[SNIP]
>>>>
>>>>> +
>>>>> +struct drm_syncobj_wait_pt {
>>>>> +Â Â Â struct drm_syncobj_stub_fence base;
>>>>> +Â Â Â u64Â Â Â value;
>>>>> +   struct rb_node  node;
>>>>> +};
>>>>> +struct drm_syncobj_signal_pt {
>>>>> +Â Â Â struct drm_syncobj_stub_fence base;
>>>>> +Â Â Â struct dma_fence *signal_fence;
>>>>> +Â Â Â struct dma_fence *pre_pt_base;
>>>>> +Â Â Â struct dma_fence_cb signal_cb;
>>>>> +Â Â Â struct dma_fence_cb pre_pt_cb;
>>>>> +Â Â Â struct drm_syncobj *syncobj;
>>>>> +Â Â Â u64Â Â Â value;
>>>>> +Â Â Â struct list_head list;
>>>>> +};
>>>>
>>>> What are those two structures good for
>>> They are used to record wait ops points and signal ops points.
>>> For timeline, they are connected by timeline value, works like:
>>> Â Â Â a. signal pt increase timeline value to signal_pt value when
>>> signal_pt is signaled. signal_pt is depending on previous pt fence
>>> and itself signal fence from signal ops.
>>> Â Â Â b. wait pt tree checks if timeline value over itself value.
>>>
>>> For normal, works like:
>>> Â Â Â a. signal pt increase 1 for syncobj_timeline->signal_point every
>>> time when signal ops is performed.
>>> Â Â Â b. when wait ops is comming, wait pt will fetch above last
>>> signal pt value as its wait point. wait pt will be only signaled by
>>> equal point value signal_pt.
>>>
>>>
>>>> and why is the stub fence their base?
>>> Good question, I tried to kzalloc for them as well when I debug
>>> them, I encountered a problem:
>>> I lookup/find wait_pt or signal_pt successfully, but when I tried to
>>> use them, they are freed sometimes, and results in NULL point.
>>> and generally, when lookup them, we often need their stub fence as
>>> well, and in the meantime, their lifecycle are same.
>>> Above reason, I make stub fence as their base.
>>
>> That sounds like you only did this because you messed up the lifecycle.
>>
>> Additional to that I don't think you correctly considered the
>> lifecycle of the waits and the sync object itself. E.g. blocking in
>> drm_syncobj_timeline_fini() until all waits are done is not a good idea.
>>
>> What you should do instead is to create a fence_array object with all
>> the fence we need to wait for when a wait point is requested.
> Yeah, this is our initial discussion result, but when I tried to do
> that, I found that cannot meet the advance signal requirement:
> Â Â Â a. We need to consider the wait and signal pt value are not
> one-to-one match, it's difficult to find dependent point, at least,
> there is some overhead.
As far as I can see that is independent of using a fence array here. See
you can either use a ring buffer or an rb-tree, but when you want to
wait for a specific point we need to condense the not yet signaled
fences into an array.
> Â Â Â b. because we allowed "wait-before-signal", if
> "wait-before-signal" happens, there isn't signal fence which can be
> used to create fence array.
Well, again we DON'T support wait-before-signal here. I will certainly
NAK any implementation which tries to do this until we haven't figured
out all the resource management constraints and I still don't see how we
can do this.
> So timeline value is good to resolve that.
>
>>
>> Otherwise somebody can easily construct a situation where timeline
>> sync obj A waits on B and B waits on A.
> Same situation also can happens with fence-array, we only can see this
> is a programming bug with incorrect use.
No, fence-array is initialized only once with a static list of fences.
This way it is impossible to add the fence-array to itself for example.
E.g. you can't build circle dependencies with that.
> Better use rbtree_postorder_for_each_entry_safe() for this.
>>> From the comments, seems we cannot use it here, we need erase node
>>> here.
>>> Comments:
>>> Â * Note, however, that it cannot handle other modifications that
>>> re-order the
>>> Â * rbtree it is iterating over. This includes calling rb_erase() on
>>> @pos, as
>>> Â * rb_erase() may rebalance the tree, causing us to miss some nodes.
>>> Â */
>>
>> Yeah, but your current implementation has the same problem :)
>>
>> You need to use something like "while (node = rb_first(...))" instead
>> if you want to destruct the whole tree.
>>
>> Regards,
>> Christian.
>>
>>>
>>> Thanks,
>>> David Zhou
>>>>
>>>> Regards,
>>>> Christian.
>>>>
>>>>> +Â Â Â Â Â Â Â wait_pt = rb_entry(node, struct drm_syncobj_wait_pt, node);
>>>>> +Â Â Â Â Â Â Â node = rb_next(node);
> I already get the next node before erasing this node, so the "for
> (..." sentence is equal with "while (...)"
That still doesn't work. The problem is the because of an erase the next
node might skip some nodes when rebalancing.
What you need to do is to either not erase the nodes at all (because we
re-initialize the tree anyway) or always use rb_first().
Regards,
Christian.
>
> Thanks,
> David Zhou
>
>>>>> + rb_erase(&wait_pt->node,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â &syncobj_timeline->wait_pt_tree);
>>>>> +Â Â Â Â Â Â Â RB_CLEAR_NODE(&wait_pt->node);
>>>>> +Â Â Â Â Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â Â Â Â Â dma_fence_wait(&wait_pt->base.base, true);
>>>>> +Â Â Â Â Â Â Â spin_lock(&syncobj->lock);
>>>>> +Â Â Â Â Â Â Â /* kfree(wait_pt) is excuted by fence put */
>>>>> +Â Â Â Â Â Â Â dma_fence_put(&wait_pt->base.base);
>>>>> +Â Â Â }
>>>>> +Â Â Â list_for_each_entry_safe(signal_pt, tmp,
>>>>> + &syncobj_timeline->signal_pt_list, list) {
>>>>> +Â Â Â Â Â Â Â list_del(&signal_pt->list);
>>>>> +Â Â Â Â Â Â Â if (signal_pt->signal_fence) {
>>>>> + dma_fence_remove_callback(signal_pt->signal_fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &signal_pt->signal_cb);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â dma_fence_put(signal_pt->signal_fence);
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â Â Â Â Â if (signal_pt->pre_pt_base) {
>>>>> + dma_fence_remove_callback(signal_pt->pre_pt_base,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &signal_pt->pre_pt_cb);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â dma_fence_put(signal_pt->pre_pt_base);
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â Â Â Â Â dma_fence_put(&signal_pt->base.base);
>>>>> +Â Â Â }
>>>>> +Â Â Â spin_unlock(&syncobj->lock);
>>>>> +}
>>>>> +
>>>>> Â -Â Â Â *fence = drm_syncobj_fence_get(syncobj);
>>>>> -Â Â Â if (*fence)
>>>>> -Â Â Â Â Â Â Â return 1;
>>>>> +static bool drm_syncobj_normal_signal_wait_pts(struct drm_syncobj
>>>>> *syncobj,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 signal_pt)
>>>>> +{
>>>>> +Â Â Â struct rb_node *node = NULL;
>>>>> +Â Â Â struct drm_syncobj_wait_pt *wait_pt = NULL;
>>>>> Â Â Â Â Â Â spin_lock(&syncobj->lock);
>>>>> -Â Â Â /* We've already tried once to get a fence and failed. Now
>>>>> that we
>>>>> -Â Â Â Â * have the lock, try one more time just to be sure we don't
>>>>> add a
>>>>> -Â Â Â Â * callback when a fence has already been set.
>>>>> -Â Â Â Â */
>>>>> -Â Â Â if (syncobj->fence) {
>>>>> -Â Â Â Â Â Â Â *fence =
>>>>> dma_fence_get(rcu_dereference_protected(syncobj->fence,
>>>>> - lockdep_is_held(&syncobj->lock)));
>>>>> -Â Â Â Â Â Â Â ret = 1;
>>>>> -Â Â Â } else {
>>>>> -Â Â Â Â Â Â Â *fence = NULL;
>>>>> -Â Â Â Â Â Â Â drm_syncobj_add_callback_locked(syncobj, cb, func);
>>>>> -Â Â Â Â Â Â Â ret = 0;
>>>>> +Â Â Â for(node = rb_first(&syncobj->syncobj_timeline.wait_pt_tree);
>>>>> +Â Â Â Â Â Â Â node != NULL; ) {
>>>>> +Â Â Â Â Â Â Â wait_pt = rb_entry(node, struct drm_syncobj_wait_pt, node);
>>>>> +Â Â Â Â Â Â Â node = rb_next(node);
>>>>> +Â Â Â Â Â Â Â /* for normal syncobj */
>>>>> +Â Â Â Â Â Â Â if (wait_pt->value == signal_pt) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â dma_fence_signal(&wait_pt->base.base);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â rb_erase(&wait_pt->node,
>>>>> + &syncobj->syncobj_timeline.wait_pt_tree);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â RB_CLEAR_NODE(&wait_pt->node);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â /* kfree(wait_pt) is excuted by fence put */
>>>>> +Â Â Â Â Â Â Â Â Â Â Â dma_fence_put(&wait_pt->base.base);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â return true;
>>>>> +Â Â Â Â Â Â Â }
>>>>> Â Â Â Â Â }
>>>>> Â Â Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â return false;
>>>>> +}
>>>>> Â -Â Â Â return ret;
>>>>> +static void drm_syncobj_timeline_signal_wait_pts(struct
>>>>> drm_syncobj *syncobj)
>>>>> +{
>>>>> +Â Â Â struct rb_node *node = NULL;
>>>>> +Â Â Â struct drm_syncobj_wait_pt *wait_pt = NULL;
>>>>> +
>>>>> +Â Â Â spin_lock(&syncobj->lock);
>>>>> +Â Â Â for(node = rb_first(&syncobj->syncobj_timeline.wait_pt_tree);
>>>>> +Â Â Â Â Â Â Â node != NULL; ) {
>>>>> +Â Â Â Â Â Â Â wait_pt = rb_entry(node, struct drm_syncobj_wait_pt, node);
>>>>> +Â Â Â Â Â Â Â node = rb_next(node);
>>>>> +Â Â Â Â Â Â Â if (wait_pt->value <= syncobj->syncobj_timeline.timeline) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â dma_fence_signal(&wait_pt->base.base);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â rb_erase(&wait_pt->node,
>>>>> + &syncobj->syncobj_timeline.wait_pt_tree);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â RB_CLEAR_NODE(&wait_pt->node);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â /* kfree(wait_pt) is excuted by fence put */
>>>>> +Â Â Â Â Â Â Â Â Â Â Â dma_fence_put(&wait_pt->base.base);
>>>>> +Â Â Â Â Â Â Â } else {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â /* the loop is from left to right, the later entry
>>>>> value is
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â * bigger, so don't need to check any more */
>>>>> +Â Â Â Â Â Â Â Â Â Â Â break;
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â }
>>>>> +Â Â Â spin_unlock(&syncobj->lock);
>>>>> Â }
>>>>> Â -void drm_syncobj_add_callback(struct drm_syncobj *syncobj,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_cb *cb,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â drm_syncobj_func_t func)
>>>>> +
>>>>> +
>>>>> +static void pt_fence_cb(struct drm_syncobj_signal_pt *signal_pt)
>>>>> Â {
>>>>> +Â Â Â struct dma_fence *fence = NULL;
>>>>> +Â Â Â struct drm_syncobj *syncobj;
>>>>> +Â Â Â struct drm_syncobj_signal_pt *tail_pt;
>>>>> +Â Â Â u64 pt_value = signal_pt->value;
>>>>> +
>>>>> +Â Â Â dma_fence_signal(&signal_pt->base.base);
>>>>> +Â Â Â fence = signal_pt->signal_fence;
>>>>> +Â Â Â signal_pt->signal_fence = NULL;
>>>>> +Â Â Â dma_fence_put(fence);
>>>>> +Â Â Â fence = signal_pt->pre_pt_base;
>>>>> +Â Â Â signal_pt->pre_pt_base = NULL;
>>>>> +Â Â Â dma_fence_put(fence);
>>>>> +
>>>>> +Â Â Â syncobj = signal_pt->syncobj;
>>>>> Â Â Â Â Â spin_lock(&syncobj->lock);
>>>>> -Â Â Â drm_syncobj_add_callback_locked(syncobj, cb, func);
>>>>> +Â Â Â syncobj->syncobj_timeline.timeline = pt_value;
>>>>> +Â Â Â tail_pt =
>>>>> list_last_entry(&syncobj->syncobj_timeline.signal_pt_list,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_signal_pt, list);
>>>>> +Â Â Â if ((syncobj->type == DRM_SYNCOBJ_TYPE_NORMAL && signal_pt !=
>>>>> tail_pt)
>>>>> +Â Â Â Â Â Â Â || syncobj->type == DRM_SYNCOBJ_TYPE_TIMELINE) {
>>>>> +Â Â Â Â Â Â Â list_del(&signal_pt->list);
>>>>> +       /* kfree(signal_pt) will be executed by below fence put */
>>>>> +Â Â Â Â Â Â Â dma_fence_put(&signal_pt->base.base);
>>>>> +Â Â Â }
>>>>> Â Â Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â if (syncobj->type == DRM_SYNCOBJ_TYPE_NORMAL)
>>>>> +Â Â Â Â Â Â Â drm_syncobj_normal_signal_wait_pts(syncobj, pt_value);
>>>>> +Â Â Â else
>>>>> +Â Â Â Â Â Â Â drm_syncobj_timeline_signal_wait_pts(syncobj);
>>>>> Â }
>>>>> +static void pt_signal_fence_func(struct dma_fence *fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence_cb *cb)
>>>>> +{
>>>>> +Â Â Â struct drm_syncobj_signal_pt *signal_pt =
>>>>> +Â Â Â Â Â Â Â container_of(cb, struct drm_syncobj_signal_pt, signal_cb);
>>>>> Â -void drm_syncobj_remove_callback(struct drm_syncobj *syncobj,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_cb *cb)
>>>>> +Â Â Â if (signal_pt->pre_pt_base &&
>>>>> + !dma_fence_is_signaled(signal_pt->pre_pt_base))
>>>>> +Â Â Â Â Â Â Â return;
>>>>> +
>>>>> +Â Â Â pt_fence_cb(signal_pt);
>>>>> +}
>>>>> +static void pt_pre_fence_func(struct dma_fence *fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence_cb *cb)
>>>>> +{
>>>>> +Â Â Â struct drm_syncobj_signal_pt *signal_pt =
>>>>> +Â Â Â Â Â Â Â container_of(cb, struct drm_syncobj_signal_pt, pre_pt_cb);
>>>>> +
>>>>> +Â Â Â if (signal_pt->signal_fence &&
>>>>> + !dma_fence_is_signaled(signal_pt->pre_pt_base))
>>>>> +Â Â Â Â Â Â Â return;
>>>>> +
>>>>> +Â Â Â pt_fence_cb(signal_pt);
>>>>> +}
>>>>> +
>>>>> +static int drm_syncobj_timeline_create_signal_pt(struct
>>>>> drm_syncobj *syncobj,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence *fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 point)
>>>>> Â {
>>>>> +Â Â Â struct drm_syncobj_signal_pt *signal_pt =
>>>>> +Â Â Â Â Â Â Â kzalloc(sizeof(struct drm_syncobj_signal_pt), GFP_KERNEL);
>>>>> +Â Â Â struct drm_syncobj_stub_fence *base;
>>>>> +Â Â Â struct drm_syncobj_signal_pt *tail_pt;
>>>>> +Â Â Â struct dma_fence *tail_pt_fence = NULL;
>>>>> +Â Â Â int ret = 0;
>>>>> +
>>>>> +Â Â Â if (!signal_pt)
>>>>> +Â Â Â Â Â Â Â return -ENOMEM;
>>>>> +Â Â Â if (syncobj->syncobj_timeline.signal_point >= point) {
>>>>> +Â Â Â Â Â Â Â DRM_WARN("A later signal is ready!");
>>>>> +Â Â Â Â Â Â Â goto out;
>>>>> +Â Â Â }
>>>>> +Â Â Â if (!fence)
>>>>> +Â Â Â Â Â Â Â goto out;
>>>>> +Â Â Â dma_fence_get(fence);
>>>>> Â Â Â Â Â spin_lock(&syncobj->lock);
>>>>> -Â Â Â list_del_init(&cb->node);
>>>>> +Â Â Â base = &signal_pt->base;
>>>>> +Â Â Â spin_lock_init(&base->lock);
>>>>> +Â Â Â dma_fence_init(&base->base,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â &drm_syncobj_stub_fence_ops,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â &base->lock,
>>>>> + syncobj->syncobj_timeline.timeline_context, point);
>>>>> +Â Â Â signal_pt->signal_fence = fence;
>>>>> +Â Â Â /* timeline syncobj must take this dependency */
>>>>> +Â Â Â if (syncobj->type == DRM_SYNCOBJ_TYPE_TIMELINE) {
>>>>> +Â Â Â Â Â Â Â if
>>>>> (!list_empty(&syncobj->syncobj_timeline.signal_pt_list)) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â tail_pt =
>>>>> list_last_entry(&syncobj->syncobj_timeline.signal_pt_list,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_signal_pt, list);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â tail_pt_fence = &tail_pt->base.base;
>>>>> +Â Â Â Â Â Â Â Â Â Â Â if (dma_fence_is_signaled(tail_pt_fence))
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â tail_pt_fence = NULL;
>>>>> +Â Â Â Â Â Â Â Â Â Â Â else
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â signal_pt->pre_pt_base =
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â dma_fence_get(tail_pt_fence);
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â }
>>>>> +
>>>>> +Â Â Â signal_pt->value = point;
>>>>> +Â Â Â syncobj->syncobj_timeline.signal_point = point;
>>>>> +Â Â Â signal_pt->syncobj = syncobj;
>>>>> +Â Â Â INIT_LIST_HEAD(&signal_pt->list);
>>>>> +Â Â Â list_add_tail(&signal_pt->list,
>>>>> &syncobj->syncobj_timeline.signal_pt_list);
>>>>> Â Â Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â wake_up_all(&syncobj->syncobj_timeline.wq);
>>>>> +Â Â Â /**
>>>>> +Â Â Â Â * Every pt is depending on signal fence and previous pt
>>>>> fence, add
>>>>> +Â Â Â Â * callbacks to them
>>>>> +Â Â Â Â */
>>>>> +Â Â Â ret = dma_fence_add_callback(signal_pt->signal_fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &signal_pt->signal_cb,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â pt_signal_fence_func);
>>>>> +
>>>>> +Â Â Â if (signal_pt->pre_pt_base) {
>>>>> +Â Â Â Â Â Â Â ret = dma_fence_add_callback(signal_pt->pre_pt_base,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &signal_pt->pre_pt_cb,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â pt_pre_fence_func);
>>>>> +Â Â Â Â Â Â Â if (ret == -ENOENT)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â pt_pre_fence_func(signal_pt->pre_pt_base,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &signal_pt->pre_pt_cb);
>>>>> +Â Â Â Â Â Â Â else if (ret)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â goto out;
>>>>> +Â Â Â } else if (ret == -ENOENT) {
>>>>> +Â Â Â Â Â Â Â pt_signal_fence_func(signal_pt->signal_fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &signal_pt->signal_cb);
>>>>> +Â Â Â } else if (ret) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â goto out;
>>>>> +Â Â Â }
>>>>> +
>>>>> +Â Â Â return 0;
>>>>> +out:
>>>>> +Â Â Â dma_fence_put(&signal_pt->base.base);
>>>>> +Â Â Â return ret;
>>>>> Â }
>>>>> Â Â /**
>>>>> @@ -149,53 +381,30 @@ void drm_syncobj_replace_fence(struct
>>>>> drm_syncobj *syncobj,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 point,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence *fence)
>>>>> Â {
>>>>> -Â Â Â struct dma_fence *old_fence;
>>>>> -Â Â Â struct drm_syncobj_cb *cur, *tmp;
>>>>> -
>>>>> -Â Â Â if (fence)
>>>>> -Â Â Â Â Â Â Â dma_fence_get(fence);
>>>>> -
>>>>> -Â Â Â spin_lock(&syncobj->lock);
>>>>> -
>>>>> -Â Â Â old_fence = rcu_dereference_protected(syncobj->fence,
>>>>> - lockdep_is_held(&syncobj->lock));
>>>>> -Â Â Â rcu_assign_pointer(syncobj->fence, fence);
>>>>> -
>>>>> -Â Â Â if (fence != old_fence) {
>>>>> -Â Â Â Â Â Â Â list_for_each_entry_safe(cur, tmp, &syncobj->cb_list,
>>>>> node) {
>>>>> -Â Â Â Â Â Â Â Â Â Â Â list_del_init(&cur->node);
>>>>> -Â Â Â Â Â Â Â Â Â Â Â cur->func(syncobj, cur);
>>>>> +Â Â Â if (syncobj->type == DRM_SYNCOBJ_TYPE_TIMELINE) {
>>>>> +Â Â Â Â Â Â Â if (fence)
>>>>> + drm_syncobj_timeline_create_signal_pt(syncobj, fence,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â point);
>>>>> +Â Â Â Â Â Â Â return;
>>>>> +Â Â Â } else if (syncobj->type == DRM_SYNCOBJ_TYPE_NORMAL) {
>>>>> +Â Â Â Â Â Â Â u64 pt_value;
>>>>> +
>>>>> +Â Â Â Â Â Â Â if (!fence) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â drm_syncobj_timeline_fini(syncobj,
>>>>> + &syncobj->syncobj_timeline);
>>>>> + drm_syncobj_timeline_init(&syncobj->syncobj_timeline);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â return;
>>>>> Â Â Â Â Â Â Â Â Â }
>>>>> +Â Â Â Â Â Â Â pt_value = syncobj->syncobj_timeline.signal_point +
>>>>> +Â Â Â Â Â Â Â Â Â Â Â DRM_SYNCOBJ_NORMAL_POINT;
>>>>> +Â Â Â Â Â Â Â drm_syncobj_timeline_create_signal_pt(syncobj, fence,
>>>>> pt_value);
>>>>> +Â Â Â Â Â Â Â return;
>>>>> +Â Â Â } else {
>>>>> +Â Â Â Â Â Â Â DRM_ERROR("the syncobj type isn't support\n");
>>>>> Â Â Â Â Â }
>>>>> -
>>>>> -Â Â Â spin_unlock(&syncobj->lock);
>>>>> -
>>>>> -Â Â Â dma_fence_put(old_fence);
>>>>> Â }
>>>>> Â EXPORT_SYMBOL(drm_syncobj_replace_fence);
>>>>> Â -struct drm_syncobj_stub_fence {
>>>>> -Â Â Â struct dma_fence base;
>>>>> -Â Â Â spinlock_t lock;
>>>>> -};
>>>>> -
>>>>> -static const char *drm_syncobj_stub_fence_get_name(struct
>>>>> dma_fence *fence)
>>>>> -{
>>>>> -Â Â Â Â Â Â Â return "syncobjstub";
>>>>> -}
>>>>> -
>>>>> -static bool drm_syncobj_stub_fence_enable_signaling(struct
>>>>> dma_fence *fence)
>>>>> -{
>>>>> -Â Â Â return !dma_fence_is_signaled(fence);
>>>>> -}
>>>>> -
>>>>> -static const struct dma_fence_ops drm_syncobj_stub_fence_ops = {
>>>>> -Â Â Â .get_driver_name = drm_syncobj_stub_fence_get_name,
>>>>> -Â Â Â .get_timeline_name = drm_syncobj_stub_fence_get_name,
>>>>> -Â Â Â .enable_signaling = drm_syncobj_stub_fence_enable_signaling,
>>>>> -Â Â Â .release = NULL,
>>>>> -};
>>>>> -
>>>>> Â static int drm_syncobj_assign_null_handle(struct drm_syncobj
>>>>> *syncobj)
>>>>> Â {
>>>>> Â Â Â Â Â struct drm_syncobj_stub_fence *fence;
>>>>> @@ -215,6 +424,143 @@ static int
>>>>> drm_syncobj_assign_null_handle(struct drm_syncobj *syncobj)
>>>>> Â Â Â Â Â return 0;
>>>>> Â }
>>>>> Â +static struct drm_syncobj_wait_pt *
>>>>> +drm_syncobj_timeline_lookup_wait_pt_fence(struct drm_syncobj
>>>>> *syncobj,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence **fence)
>>>>> +{
>>>>> +Â Â Â struct rb_node *node =
>>>>> syncobj->syncobj_timeline.wait_pt_tree.rb_node;
>>>>> +Â Â Â struct drm_syncobj_wait_pt *wait_pt = NULL;
>>>>> +
>>>>> +
>>>>> +Â Â Â spin_lock(&syncobj->lock);
>>>>> +Â Â Â while(node) {
>>>>> +Â Â Â Â Â Â Â int result;
>>>>> +
>>>>> +Â Â Â Â Â Â Â wait_pt = rb_entry(node, struct drm_syncobj_wait_pt, node);
>>>>> +Â Â Â Â Â Â Â result = point - wait_pt->value;
>>>>> +Â Â Â Â Â Â Â if (result < 0) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â node = node->rb_left;
>>>>> +Â Â Â Â Â Â Â } else if (result > 0) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â node = node->rb_right;
>>>>> +Â Â Â Â Â Â Â } else {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â if (fence)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â *fence = dma_fence_get(&wait_pt->base.base);
>>>>> +Â Â Â Â Â Â Â Â Â Â Â break;
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â }
>>>>> +Â Â Â spin_unlock(&syncobj->lock);
>>>>> +
>>>>> +Â Â Â return wait_pt;
>>>>> +}
>>>>> +
>>>>> +static struct drm_syncobj_wait_pt *
>>>>> +drm_syncobj_timeline_create_wait_pt_and_return_fence(struct
>>>>> drm_syncobj *syncobj,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence **fence)
>>>>> +{
>>>>> +Â Â Â struct drm_syncobj_wait_pt *wait_pt = kzalloc(sizeof(*wait_pt),
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â GFP_KERNEL);
>>>>> +Â Â Â struct drm_syncobj_stub_fence *base;
>>>>> +Â Â Â struct rb_node **new =
>>>>> &(syncobj->syncobj_timeline.wait_pt_tree.rb_node), *parent = NULL;
>>>>> +Â Â Â struct drm_syncobj_signal_pt *tail_signal_pt =
>>>>> + list_last_entry(&syncobj->syncobj_timeline.signal_pt_list,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_signal_pt, list);
>>>>> +
>>>>> +Â Â Â if (!wait_pt)
>>>>> +Â Â Â Â Â Â Â return NULL;
>>>>> +Â Â Â base = &wait_pt->base;
>>>>> +Â Â Â spin_lock_init(&base->lock);
>>>>> +Â Â Â dma_fence_init(&base->base,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â &drm_syncobj_stub_fence_ops,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â &base->lock,
>>>>> + syncobj->syncobj_timeline.timeline_context, point);
>>>>> +Â Â Â wait_pt->value = point;
>>>>> +
>>>>> +Â Â Â /* wait pt must be in an order, so that we can easily lookup
>>>>> and signal
>>>>> +Â Â Â Â * it */
>>>>> +Â Â Â spin_lock(&syncobj->lock);
>>>>> +Â Â Â if (syncobj->type == DRM_SYNCOBJ_TYPE_TIMELINE &&
>>>>> +Â Â Â Â Â Â Â point <= syncobj->syncobj_timeline.timeline)
>>>>> +Â Â Â Â Â Â Â dma_fence_signal(&wait_pt->base.base);
>>>>> +Â Â Â if ((syncobj->type == DRM_SYNCOBJ_TYPE_NORMAL) &&
>>>>> +Â Â Â Â Â Â Â (point == tail_signal_pt->value) &&
>>>>> + dma_fence_is_signaled(&tail_signal_pt->base.base))
>>>>> +Â Â Â Â Â Â Â dma_fence_signal(&wait_pt->base.base);
>>>>> +Â Â Â while(*new) {
>>>>> +Â Â Â Â Â Â Â struct drm_syncobj_wait_pt *this =
>>>>> +Â Â Â Â Â Â Â Â Â Â Â rb_entry(*new, struct drm_syncobj_wait_pt, node);
>>>>> +Â Â Â Â Â Â Â int result = wait_pt->value - this->value;
>>>>> +
>>>>> +Â Â Â Â Â Â Â parent = *new;
>>>>> +Â Â Â Â Â Â Â if (result < 0)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â new = &((*new)->rb_left);
>>>>> +Â Â Â Â Â Â Â else if (result > 0)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â new = &((*new)->rb_right);
>>>>> +Â Â Â Â Â Â Â else
>>>>> +Â Â Â Â Â Â Â Â Â Â Â goto exist;
>>>>> +Â Â Â }
>>>>> +Â Â Â if (fence)
>>>>> +Â Â Â Â Â Â Â *fence = dma_fence_get(&wait_pt->base.base);
>>>>> +Â Â Â rb_link_node(&wait_pt->node, parent, new);
>>>>> +Â Â Â rb_insert_color(&wait_pt->node,
>>>>> &syncobj->syncobj_timeline.wait_pt_tree);
>>>>> +Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â return wait_pt;
>>>>> +exist:
>>>>> +Â Â Â spin_unlock(&syncobj->lock);
>>>>> +Â Â Â dma_fence_put(&wait_pt->base.base);
>>>>> +Â Â Â wait_pt = drm_syncobj_timeline_lookup_wait_pt_fence(syncobj,
>>>>> point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â fence);
>>>>> +Â Â Â return wait_pt;
>>>>> +}
>>>>> +
>>>>> +static struct dma_fence *
>>>>> +drm_syncobj_timeline_point_get(struct drm_syncobj *syncobj, u64
>>>>> point, u64 flags)
>>>>> +{
>>>>> +Â Â Â struct drm_syncobj_wait_pt *wait_pt;
>>>>> +Â Â Â struct dma_fence *fence = NULL;
>>>>> +
>>>>> +Â Â Â /* already signaled, simply return a signaled stub fence */
>>>>> +Â Â Â if (syncobj->type == DRM_SYNCOBJ_TYPE_TIMELINE &&
>>>>> +Â Â Â Â Â Â Â point <= syncobj->syncobj_timeline.timeline) {
>>>>> +Â Â Â Â Â Â Â struct drm_syncobj_stub_fence *fence;
>>>>> +
>>>>> +Â Â Â Â Â Â Â fence = kzalloc(sizeof(*fence), GFP_KERNEL);
>>>>> +Â Â Â Â Â Â Â if (fence == NULL)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â return NULL;
>>>>> +
>>>>> +Â Â Â Â Â Â Â spin_lock_init(&fence->lock);
>>>>> +Â Â Â Â Â Â Â dma_fence_init(&fence->base, &drm_syncobj_stub_fence_ops,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &fence->lock, 0, 0);
>>>>> +Â Â Â Â Â Â Â dma_fence_signal(&fence->base);
>>>>> +Â Â Â Â Â Â Â return &fence->base;
>>>>> +Â Â Â }
>>>>> +
>>>>> +Â Â Â /* check if the wait pt exists */
>>>>> +Â Â Â wait_pt = drm_syncobj_timeline_lookup_wait_pt_fence(syncobj,
>>>>> point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &fence);
>>>>> +Â Â Â if (!fence) {
>>>>> +Â Â Â Â Â Â Â /* This is a new wait pt, so create it */
>>>>> +Â Â Â Â Â Â Â wait_pt =
>>>>> drm_syncobj_timeline_create_wait_pt_and_return_fence(syncobj, point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &fence);
>>>>> +Â Â Â Â Â Â Â if (!fence)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â return NULL;
>>>>> +Â Â Â }
>>>>> +Â Â Â if (wait_pt) {
>>>>> +Â Â Â Â Â Â Â int ret = 0;
>>>>> +
>>>>> +Â Â Â Â Â Â Â if (flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â ret =
>>>>> wait_event_interruptible_timeout(syncobj->syncobj_timeline.wq,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â wait_pt->value <=
>>>>> syncobj->syncobj_timeline.signal_point,
>>>>> + msecs_to_jiffies(10000)); /* wait 10s */
>>>>> +Â Â Â Â Â Â Â Â Â Â Â if (ret <= 0)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â return NULL;
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â Â Â Â Â return fence;
>>>>> +Â Â Â }
>>>>> +Â Â Â return NULL;
>>>>> +}
>>>>> +
>>>>> Â /**
>>>>> Â Â * drm_syncobj_find_fence - lookup and reference the fence in a
>>>>> sync object
>>>>> Â Â * @file_private: drm file private pointer
>>>>> @@ -229,20 +575,45 @@ static int
>>>>> drm_syncobj_assign_null_handle(struct drm_syncobj *syncobj)
>>>>> Â Â * contains a reference to the fence, which must be released by
>>>>> calling
>>>>> Â Â * dma_fence_put().
>>>>> Â Â */
>>>>> -int drm_syncobj_find_fence(struct drm_file *file_private,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â u32 handle, u64 point,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence **fence)
>>>>> +int drm_syncobj_search_fence(struct drm_syncobj *syncobj, u64 point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 flags, struct dma_fence **fence)
>>>>> Â {
>>>>> -Â Â Â struct drm_syncobj *syncobj = drm_syncobj_find(file_private,
>>>>> handle);
>>>>> Â Â Â Â Â int ret = 0;
>>>>> Â Â Â Â Â Â if (!syncobj)
>>>>> Â Â Â Â Â Â Â Â Â return -ENOENT;
>>>>> Â -Â Â Â *fence = drm_syncobj_fence_get(syncobj);
>>>>> +Â Â Â if (syncobj->type == DRM_SYNCOBJ_TYPE_NORMAL) {
>>>>> +Â Â Â Â Â Â Â /*NORMAL syncobj always wait on last pt */
>>>>> +Â Â Â Â Â Â Â u64 tail_pt_value = syncobj->syncobj_timeline.signal_point;
>>>>> +
>>>>> +Â Â Â Â Â Â Â if (tail_pt_value == 0)
>>>>> +Â Â Â Â Â Â Â Â Â Â Â tail_pt_value += DRM_SYNCOBJ_NORMAL_POINT;
>>>>> +Â Â Â Â Â Â Â /* NORMAL syncobj doesn't care point value */
>>>>> +Â Â Â Â Â Â Â WARN_ON(point != 0);
>>>>> +Â Â Â Â Â Â Â *fence = drm_syncobj_timeline_point_get(syncobj,
>>>>> tail_pt_value,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â flags);
>>>>> +Â Â Â } else if (syncobj->type == DRM_SYNCOBJ_TYPE_TIMELINE) {
>>>>> +Â Â Â Â Â Â Â *fence = drm_syncobj_timeline_point_get(syncobj, point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â flags);
>>>>> +Â Â Â } else {
>>>>> +Â Â Â Â Â Â Â DRM_ERROR("Don't support this type syncobj\n");
>>>>> +Â Â Â Â Â Â Â *fence = NULL;
>>>>> +Â Â Â }
>>>>> Â Â Â Â Â if (!*fence) {
>>>>> Â Â Â Â Â Â Â Â Â ret = -EINVAL;
>>>>> Â Â Â Â Â }
>>>>> +Â Â Â return ret;
>>>>> +}
>>>>> +EXPORT_SYMBOL(drm_syncobj_search_fence);
>>>>> +int drm_syncobj_find_fence(struct drm_file *file_private,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â u32 handle, u64 point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct dma_fence **fence) {
>>>>> +Â Â Â struct drm_syncobj *syncobj = drm_syncobj_find(file_private,
>>>>> handle);
>>>>> +
>>>>> +Â Â Â int ret = drm_syncobj_search_fence(syncobj, point,
>>>>> + DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â fence);
>>>>> Â Â Â Â Â drm_syncobj_put(syncobj);
>>>>> Â Â Â Â Â return ret;
>>>>> Â }
>>>>> @@ -259,7 +630,7 @@ void drm_syncobj_free(struct kref *kref)
>>>>> Â Â Â Â Â struct drm_syncobj *syncobj = container_of(kref,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â refcount);
>>>>> -Â Â Â drm_syncobj_replace_fence(syncobj, 0, NULL);
>>>>> +Â Â Â drm_syncobj_timeline_fini(syncobj, &syncobj->syncobj_timeline);
>>>>> Â Â Â Â Â kfree(syncobj);
>>>>> Â }
>>>>> Â EXPORT_SYMBOL(drm_syncobj_free);
>>>>> @@ -287,8 +658,12 @@ int drm_syncobj_create(struct drm_syncobj
>>>>> **out_syncobj, uint32_t flags,
>>>>> Â Â Â Â Â Â Â Â Â return -ENOMEM;
>>>>> Â Â Â Â Â Â kref_init(&syncobj->refcount);
>>>>> -Â Â Â INIT_LIST_HEAD(&syncobj->cb_list);
>>>>> Â Â Â Â Â spin_lock_init(&syncobj->lock);
>>>>> +Â Â Â if (flags & DRM_SYNCOBJ_CREATE_TYPE_TIMELINE)
>>>>> +Â Â Â Â Â Â Â syncobj->type = DRM_SYNCOBJ_TYPE_TIMELINE;
>>>>> +Â Â Â else
>>>>> +Â Â Â Â Â Â Â syncobj->type = DRM_SYNCOBJ_TYPE_NORMAL;
>>>>> + drm_syncobj_timeline_init(&syncobj->syncobj_timeline);
>>>>> Â Â Â Â Â Â if (flags & DRM_SYNCOBJ_CREATE_SIGNALED) {
>>>>> Â Â Â Â Â Â Â Â Â ret = drm_syncobj_assign_null_handle(syncobj);
>>>>> @@ -646,7 +1021,6 @@ struct syncobj_wait_entry {
>>>>> Â Â Â Â Â struct task_struct *task;
>>>>> Â Â Â Â Â struct dma_fence *fence;
>>>>> Â Â Â Â Â struct dma_fence_cb fence_cb;
>>>>> -Â Â Â struct drm_syncobj_cb syncobj_cb;
>>>>> Â };
>>>>> Â Â static void syncobj_wait_fence_func(struct dma_fence *fence,
>>>>> @@ -658,18 +1032,6 @@ static void syncobj_wait_fence_func(struct
>>>>> dma_fence *fence,
>>>>> Â Â Â Â Â wake_up_process(wait->task);
>>>>> Â }
>>>>> Â -static void syncobj_wait_syncobj_func(struct drm_syncobj *syncobj,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_cb *cb)
>>>>> -{
>>>>> -Â Â Â struct syncobj_wait_entry *wait =
>>>>> -Â Â Â Â Â Â Â container_of(cb, struct syncobj_wait_entry, syncobj_cb);
>>>>> -
>>>>> -Â Â Â /* This happens inside the syncobj lock */
>>>>> -Â Â Â wait->fence =
>>>>> dma_fence_get(rcu_dereference_protected(syncobj->fence,
>>>>> - lockdep_is_held(&syncobj->lock)));
>>>>> -Â Â Â wake_up_process(wait->task);
>>>>> -}
>>>>> -
>>>>> Â static signed long drm_syncobj_array_wait_timeout(struct
>>>>> drm_syncobj **syncobjs,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â uint32_t count,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â uint32_t flags,
>>>>> @@ -693,14 +1055,11 @@ static signed long
>>>>> drm_syncobj_array_wait_timeout(struct drm_syncobj **syncobjs,
>>>>> Â Â Â Â Â signaled_count = 0;
>>>>> Â Â Â Â Â for (i = 0; i < count; ++i) {
>>>>> Â Â Â Â Â Â Â Â Â entries[i].task = current;
>>>>> -Â Â Â Â Â Â Â entries[i].fence = drm_syncobj_fence_get(syncobjs[i]);
>>>>> +Â Â Â Â Â Â Â ret = drm_syncobj_search_fence(syncobjs[i], 0, 0,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &entries[i].fence);
>>>>> Â Â Â Â Â Â Â Â Â if (!entries[i].fence) {
>>>>> -Â Â Â Â Â Â Â Â Â Â Â if (flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT) {
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â continue;
>>>>> -Â Â Â Â Â Â Â Â Â Â Â } else {
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â ret = -EINVAL;
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â goto cleanup_entries;
>>>>> -Â Â Â Â Â Â Â Â Â Â Â }
>>>>> +Â Â Â Â Â Â Â Â Â Â Â ret = -EINVAL;
>>>>> +Â Â Â Â Â Â Â Â Â Â Â goto cleanup_entries;
>>>>> Â Â Â Â Â Â Â Â Â }
>>>>> Â Â Â Â Â Â Â Â Â Â if (dma_fence_is_signaled(entries[i].fence)) {
>>>>> @@ -728,15 +1087,6 @@ static signed long
>>>>> drm_syncobj_array_wait_timeout(struct drm_syncobj **syncobjs,
>>>>> Â Â Â Â Â Â * fallthough and try a 0 timeout wait!
>>>>> Â Â Â Â Â Â */
>>>>> Â -Â Â Â if (flags & DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT) {
>>>>> -Â Â Â Â Â Â Â for (i = 0; i < count; ++i) {
>>>>> - drm_syncobj_fence_get_or_add_callback(syncobjs[i],
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &entries[i].fence,
>>>>> - &entries[i].syncobj_cb,
>>>>> - syncobj_wait_syncobj_func);
>>>>> -Â Â Â Â Â Â Â }
>>>>> -Â Â Â }
>>>>> -
>>>>> Â Â Â Â Â do {
>>>>> Â Â Â Â Â Â Â Â Â set_current_state(TASK_INTERRUPTIBLE);
>>>>> Â @@ -784,13 +1134,10 @@ static signed long
>>>>> drm_syncobj_array_wait_timeout(struct drm_syncobj **syncobjs,
>>>>> Â Â cleanup_entries:
>>>>> Â Â Â Â Â for (i = 0; i < count; ++i) {
>>>>> -Â Â Â Â Â Â Â if (entries[i].syncobj_cb.func)
>>>>> -Â Â Â Â Â Â Â Â Â Â Â drm_syncobj_remove_callback(syncobjs[i],
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &entries[i].syncobj_cb);
>>>>> +Â Â Â Â Â Â Â dma_fence_put(entries[i].fence);
>>>>> Â Â Â Â Â Â Â Â Â if (entries[i].fence_cb.func)
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â dma_fence_remove_callback(entries[i].fence,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &entries[i].fence_cb);
>>>>> -Â Â Â Â Â Â Â dma_fence_put(entries[i].fence);
>>>>> Â Â Â Â Â }
>>>>> Â Â Â Â Â kfree(entries);
>>>>> Â @@ -965,12 +1312,20 @@ drm_syncobj_reset_ioctl(struct drm_device
>>>>> *dev, void *data,
>>>>> Â Â Â Â Â if (ret < 0)
>>>>> Â Â Â Â Â Â Â Â Â return ret;
>>>>> Â -Â Â Â for (i = 0; i < args->count_handles; i++)
>>>>> -Â Â Â Â Â Â Â drm_syncobj_replace_fence(syncobjs[i], 0, NULL);
>>>>> -
>>>>> +Â Â Â for (i = 0; i < args->count_handles; i++) {
>>>>> +Â Â Â Â Â Â Â if (syncobjs[i]->type == DRM_SYNCOBJ_TYPE_TIMELINE) {
>>>>> +Â Â Â Â Â Â Â Â Â Â Â DRM_ERROR("timeline syncobj cannot reset!\n");
>>>>> +Â Â Â Â Â Â Â Â Â Â Â ret = -EINVAL;
>>>>> +Â Â Â Â Â Â Â Â Â Â Â goto out;
>>>>> +Â Â Â Â Â Â Â }
>>>>> +Â Â Â Â Â Â Â drm_syncobj_timeline_fini(syncobjs[i],
>>>>> + &syncobjs[i]->syncobj_timeline);
>>>>> + drm_syncobj_timeline_init(&syncobjs[i]->syncobj_timeline);
>>>>> +Â Â Â }
>>>>> +out:
>>>>> Â Â Â Â Â drm_syncobj_array_free(syncobjs, args->count_handles);
>>>>> Â -Â Â Â return 0;
>>>>> +Â Â Â return ret;
>>>>> Â }
>>>>> Â Â int
>>>>> diff --git a/drivers/gpu/drm/i915/i915_gem_execbuffer.c
>>>>> b/drivers/gpu/drm/i915/i915_gem_execbuffer.c
>>>>> index 7209dd832d39..bb20d318c9d6 100644
>>>>> --- a/drivers/gpu/drm/i915/i915_gem_execbuffer.c
>>>>> +++ b/drivers/gpu/drm/i915/i915_gem_execbuffer.c
>>>>> @@ -2182,7 +2182,9 @@ await_fence_array(struct i915_execbuffer *eb,
>>>>> Â Â Â Â Â Â Â Â Â if (!(flags & I915_EXEC_FENCE_WAIT))
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â continue;
>>>>> Â -Â Â Â Â Â Â Â fence = drm_syncobj_fence_get(syncobj);
>>>>> +Â Â Â Â Â Â Â drm_syncobj_search_fence(syncobj, 0,
>>>>> + DRM_SYNCOBJ_WAIT_FLAGS_WAIT_FOR_SUBMIT,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â &fence);
>>>>> Â Â Â Â Â Â Â Â Â if (!fence)
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â return -EINVAL;
>>>>> Â diff --git a/include/drm/drm_syncobj.h b/include/drm/drm_syncobj.h
>>>>> index 425432b85a87..657c97dc25ec 100644
>>>>> --- a/include/drm/drm_syncobj.h
>>>>> +++ b/include/drm/drm_syncobj.h
>>>>> @@ -30,6 +30,25 @@
>>>>> Â Â struct drm_syncobj_cb;
>>>>> Â +enum drm_syncobj_type {
>>>>> +Â Â Â DRM_SYNCOBJ_TYPE_NORMAL,
>>>>> +Â Â Â DRM_SYNCOBJ_TYPE_TIMELINE
>>>>> +};
>>>>> +
>>>>> +struct drm_syncobj_timeline {
>>>>> +   wait_queue_head_t   wq;
>>>>> +Â Â Â u64 timeline_context;
>>>>> +Â Â Â /**
>>>>> +Â Â Â Â * @timeline: syncobj timeline
>>>>> +Â Â Â Â */
>>>>> +Â Â Â u64 timeline;
>>>>> +Â Â Â u64 signal_point;
>>>>> +
>>>>> +
>>>>> +Â Â Â struct rb_root wait_pt_tree;
>>>>> +Â Â Â struct list_head signal_pt_list;
>>>>> +};
>>>>> +
>>>>> Â /**
>>>>> Â Â * struct drm_syncobj - sync object.
>>>>> Â Â *
>>>>> @@ -41,19 +60,16 @@ struct drm_syncobj {
>>>>> Â Â Â Â Â Â */
>>>>> Â Â Â Â Â struct kref refcount;
>>>>> Â Â Â Â Â /**
>>>>> -Â Â Â Â * @fence:
>>>>> -Â Â Â Â * NULL or a pointer to the fence bound to this object.
>>>>> -Â Â Â Â *
>>>>> -Â Â Â Â * This field should not be used directly. Use
>>>>> drm_syncobj_fence_get()
>>>>> -Â Â Â Â * and drm_syncobj_replace_fence() instead.
>>>>> +Â Â Â Â * @type: indicate syncobj type
>>>>> Â Â Â Â Â Â */
>>>>> -Â Â Â struct dma_fence __rcu *fence;
>>>>> +Â Â Â enum drm_syncobj_type type;
>>>>> Â Â Â Â Â /**
>>>>> -Â Â Â Â * @cb_list: List of callbacks to call when the &fence gets
>>>>> replaced.
>>>>> +Â Â Â Â * @syncobj_timeline: timeline
>>>>> Â Â Â Â Â Â */
>>>>> -Â Â Â struct list_head cb_list;
>>>>> +Â Â Â struct drm_syncobj_timeline syncobj_timeline;
>>>>> +
>>>>> Â Â Â Â Â /**
>>>>> -Â Â Â Â * @lock: Protects &cb_list and write-locks &fence.
>>>>> +Â Â Â Â * @lock: Protects timeline list and write-locks &fence.
>>>>> Â Â Â Â Â Â */
>>>>> Â Â Â Â Â spinlock_t lock;
>>>>> Â Â Â Â Â /**
>>>>> @@ -62,25 +78,6 @@ struct drm_syncobj {
>>>>> Â Â Â Â Â struct file *file;
>>>>> Â };
>>>>> Â -typedef void (*drm_syncobj_func_t)(struct drm_syncobj *syncobj,
>>>>> -Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj_cb *cb);
>>>>> -
>>>>> -/**
>>>>> - * struct drm_syncobj_cb - callback for drm_syncobj_add_callback
>>>>> - * @node: used by drm_syncob_add_callback to append this struct to
>>>>> - *Â Â Â Â Â &drm_syncobj.cb_list
>>>>> - * @func: drm_syncobj_func_t to call
>>>>> - *
>>>>> - * This struct will be initialized by drm_syncobj_add_callback,
>>>>> additional
>>>>> - * data can be passed along by embedding drm_syncobj_cb in
>>>>> another struct.
>>>>> - * The callback will get called the next time
>>>>> drm_syncobj_replace_fence is
>>>>> - * called.
>>>>> - */
>>>>> -struct drm_syncobj_cb {
>>>>> -Â Â Â struct list_head node;
>>>>> -Â Â Â drm_syncobj_func_t func;
>>>>> -};
>>>>> -
>>>>> Â void drm_syncobj_free(struct kref *kref);
>>>>> Â Â /**
>>>>> @@ -106,29 +103,6 @@ drm_syncobj_put(struct drm_syncobj *obj)
>>>>> Â Â Â Â Â kref_put(&obj->refcount, drm_syncobj_free);
>>>>> Â }
>>>>> Â -/**
>>>>> - * drm_syncobj_fence_get - get a reference to a fence in a sync
>>>>> object
>>>>> - * @syncobj: sync object.
>>>>> - *
>>>>> - * This acquires additional reference to &drm_syncobj.fence
>>>>> contained in @obj,
>>>>> - * if not NULL. It is illegal to call this without already
>>>>> holding a reference.
>>>>> - * No locks required.
>>>>> - *
>>>>> - * Returns:
>>>>> - * Either the fence of @obj or NULL if there's none.
>>>>> - */
>>>>> -static inline struct dma_fence *
>>>>> -drm_syncobj_fence_get(struct drm_syncobj *syncobj)
>>>>> -{
>>>>> -Â Â Â struct dma_fence *fence;
>>>>> -
>>>>> -Â Â Â rcu_read_lock();
>>>>> -Â Â Â fence = dma_fence_get_rcu_safe(&syncobj->fence);
>>>>> -Â Â Â rcu_read_unlock();
>>>>> -
>>>>> -Â Â Â return fence;
>>>>> -}
>>>>> -
>>>>> Â struct drm_syncobj *drm_syncobj_find(struct drm_file *file_private,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u32 handle);
>>>>> Â void drm_syncobj_replace_fence(struct drm_syncobj *syncobj, u64
>>>>> point,
>>>>> @@ -142,5 +116,7 @@ int drm_syncobj_create(struct drm_syncobj
>>>>> **out_syncobj, uint32_t flags,
>>>>> Â int drm_syncobj_get_handle(struct drm_file *file_private,
>>>>> Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â struct drm_syncobj *syncobj, u32 *handle);
>>>>> Â int drm_syncobj_get_fd(struct drm_syncobj *syncobj, int *p_fd);
>>>>> +int drm_syncobj_search_fence(struct drm_syncobj *syncobj, u64 point,
>>>>> +Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â u64 flags, struct dma_fence **fence);
>>>>> Â Â #endif
>>>>> diff --git a/include/uapi/drm/drm.h b/include/uapi/drm/drm.h
>>>>> index 300f336633f2..cebdb2541eb7 100644
>>>>> --- a/include/uapi/drm/drm.h
>>>>> +++ b/include/uapi/drm/drm.h
>>>>> @@ -717,6 +717,7 @@ struct drm_prime_handle {
>>>>> Â struct drm_syncobj_create {
>>>>> Â Â Â Â Â __u32 handle;
>>>>> Â #define DRM_SYNCOBJ_CREATE_SIGNALED (1 << 0)
>>>>> +#define DRM_SYNCOBJ_CREATE_TYPE_TIMELINE (1 << 1)
>>>>> Â Â Â Â Â __u32 flags;
>>>>> Â };
>>>>
>>>
>>
>> _______________________________________________
>> amd-gfx mailing list
>> amd-gfx at lists.freedesktop.org
>> https://lists.freedesktop.org/mailman/listinfo/amd-gfx
>
