2 * Copyright (C) 2007 Ben Skeggs.
5 * Permission is hereby granted, free of charge, to any person obtaining
6 * a copy of this software and associated documentation files (the
7 * "Software"), to deal in the Software without restriction, including
8 * without limitation the rights to use, copy, modify, merge, publish,
9 * distribute, sublicense, and/or sell copies of the Software, and to
10 * permit persons to whom the Software is furnished to do so, subject to
11 * the following conditions:
13 * The above copyright notice and this permission notice (including the
14 * next paragraph) shall be included in all copies or substantial
15 * portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
18 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
20 * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
21 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
22 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
23 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
30 #include "nouveau_drv.h"
31 #include "nouveau_dma.h"
33 #define USE_REFCNT (dev_priv->card_type >= NV_10)
35 struct nouveau_fence
{
36 struct nouveau_channel
*channel
;
38 struct list_head entry
;
44 static inline struct nouveau_fence
*
45 nouveau_fence(void *sync_obj
)
47 return (struct nouveau_fence
*)sync_obj
;
51 nouveau_fence_del(struct kref
*ref
)
53 struct nouveau_fence
*fence
=
54 container_of(ref
, struct nouveau_fence
, refcount
);
60 nouveau_fence_update(struct nouveau_channel
*chan
)
62 struct drm_nouveau_private
*dev_priv
= chan
->dev
->dev_private
;
63 struct list_head
*entry
, *tmp
;
64 struct nouveau_fence
*fence
;
68 sequence
= nvchan_rd32(chan
, 0x48);
70 sequence
= chan
->fence
.last_sequence_irq
;
72 if (chan
->fence
.sequence_ack
== sequence
)
74 chan
->fence
.sequence_ack
= sequence
;
76 list_for_each_safe(entry
, tmp
, &chan
->fence
.pending
) {
77 fence
= list_entry(entry
, struct nouveau_fence
, entry
);
79 sequence
= fence
->sequence
;
80 fence
->signalled
= true;
81 list_del(&fence
->entry
);
82 kref_put(&fence
->refcount
, nouveau_fence_del
);
84 if (sequence
== chan
->fence
.sequence_ack
)
90 nouveau_fence_new(struct nouveau_channel
*chan
, struct nouveau_fence
**pfence
,
93 struct nouveau_fence
*fence
;
96 fence
= kzalloc(sizeof(*fence
), GFP_KERNEL
);
99 kref_init(&fence
->refcount
);
100 fence
->channel
= chan
;
103 ret
= nouveau_fence_emit(fence
);
106 nouveau_fence_unref((void *)&fence
);
111 struct nouveau_channel
*
112 nouveau_fence_channel(struct nouveau_fence
*fence
)
114 return fence
? fence
->channel
: NULL
;
118 nouveau_fence_emit(struct nouveau_fence
*fence
)
120 struct drm_nouveau_private
*dev_priv
= fence
->channel
->dev
->dev_private
;
121 struct nouveau_channel
*chan
= fence
->channel
;
125 ret
= RING_SPACE(chan
, 2);
129 if (unlikely(chan
->fence
.sequence
== chan
->fence
.sequence_ack
- 1)) {
130 spin_lock_irqsave(&chan
->fence
.lock
, flags
);
131 nouveau_fence_update(chan
);
132 spin_unlock_irqrestore(&chan
->fence
.lock
, flags
);
134 BUG_ON(chan
->fence
.sequence
==
135 chan
->fence
.sequence_ack
- 1);
138 fence
->sequence
= ++chan
->fence
.sequence
;
140 kref_get(&fence
->refcount
);
141 spin_lock_irqsave(&chan
->fence
.lock
, flags
);
142 list_add_tail(&fence
->entry
, &chan
->fence
.pending
);
143 spin_unlock_irqrestore(&chan
->fence
.lock
, flags
);
145 BEGIN_RING(chan
, NvSubSw
, USE_REFCNT
? 0x0050 : 0x0150, 1);
146 OUT_RING(chan
, fence
->sequence
);
153 nouveau_fence_unref(void **sync_obj
)
155 struct nouveau_fence
*fence
= nouveau_fence(*sync_obj
);
158 kref_put(&fence
->refcount
, nouveau_fence_del
);
163 nouveau_fence_ref(void *sync_obj
)
165 struct nouveau_fence
*fence
= nouveau_fence(sync_obj
);
167 kref_get(&fence
->refcount
);
172 nouveau_fence_signalled(void *sync_obj
, void *sync_arg
)
174 struct nouveau_fence
*fence
= nouveau_fence(sync_obj
);
175 struct nouveau_channel
*chan
= fence
->channel
;
178 if (fence
->signalled
)
181 spin_lock_irqsave(&chan
->fence
.lock
, flags
);
182 nouveau_fence_update(chan
);
183 spin_unlock_irqrestore(&chan
->fence
.lock
, flags
);
184 return fence
->signalled
;
188 nouveau_fence_wait(void *sync_obj
, void *sync_arg
, bool lazy
, bool intr
)
190 unsigned long timeout
= jiffies
+ (3 * DRM_HZ
);
193 __set_current_state(intr
? TASK_INTERRUPTIBLE
: TASK_UNINTERRUPTIBLE
);
196 if (nouveau_fence_signalled(sync_obj
, sync_arg
))
199 if (time_after_eq(jiffies
, timeout
)) {
207 if (intr
&& signal_pending(current
)) {
213 __set_current_state(TASK_RUNNING
);
219 nouveau_fence_flush(void *sync_obj
, void *sync_arg
)
225 nouveau_fence_handler(struct drm_device
*dev
, int channel
)
227 struct drm_nouveau_private
*dev_priv
= dev
->dev_private
;
228 struct nouveau_channel
*chan
= NULL
;
230 if (channel
>= 0 && channel
< dev_priv
->engine
.fifo
.channels
)
231 chan
= dev_priv
->fifos
[channel
];
234 spin_lock_irq(&chan
->fence
.lock
);
235 nouveau_fence_update(chan
);
236 spin_unlock_irq(&chan
->fence
.lock
);
241 nouveau_fence_init(struct nouveau_channel
*chan
)
243 INIT_LIST_HEAD(&chan
->fence
.pending
);
244 spin_lock_init(&chan
->fence
.lock
);
249 nouveau_fence_fini(struct nouveau_channel
*chan
)
251 struct list_head
*entry
, *tmp
;
252 struct nouveau_fence
*fence
;
254 list_for_each_safe(entry
, tmp
, &chan
->fence
.pending
) {
255 fence
= list_entry(entry
, struct nouveau_fence
, entry
);
257 fence
->signalled
= true;
258 list_del(&fence
->entry
);
259 kref_put(&fence
->refcount
, nouveau_fence_del
);