2 * Copyright 2010 Christoph Bumiller
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
18 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
20 * OTHER DEALINGS IN THE SOFTWARE.
23 #include "nouveau_screen.h"
24 #include "nouveau_winsys.h"
25 #include "nouveau_fence.h"
32 nouveau_fence_new(struct nouveau_screen
*screen
, struct nouveau_fence
**fence
,
35 *fence
= CALLOC_STRUCT(nouveau_fence
);
39 (*fence
)->screen
= screen
;
41 LIST_INITHEAD(&(*fence
)->work
);
44 nouveau_fence_emit(*fence
);
50 nouveau_fence_trigger_work(struct nouveau_fence
*fence
)
52 struct nouveau_fence_work
*work
, *tmp
;
54 LIST_FOR_EACH_ENTRY_SAFE(work
, tmp
, &fence
->work
, list
) {
55 work
->func(work
->data
);
56 LIST_DEL(&work
->list
);
62 nouveau_fence_work(struct nouveau_fence
*fence
,
63 void (*func
)(void *), void *data
)
65 struct nouveau_fence_work
*work
;
67 if (!fence
|| fence
->state
== NOUVEAU_FENCE_STATE_SIGNALLED
) {
72 work
= CALLOC_STRUCT(nouveau_fence_work
);
77 LIST_ADD(&work
->list
, &fence
->work
);
82 nouveau_fence_emit(struct nouveau_fence
*fence
)
84 struct nouveau_screen
*screen
= fence
->screen
;
86 assert(fence
->state
== NOUVEAU_FENCE_STATE_AVAILABLE
);
88 /* set this now, so that if fence.emit triggers a flush we don't recurse */
89 fence
->state
= NOUVEAU_FENCE_STATE_EMITTING
;
93 if (screen
->fence
.tail
)
94 screen
->fence
.tail
->next
= fence
;
96 screen
->fence
.head
= fence
;
98 screen
->fence
.tail
= fence
;
100 screen
->fence
.emit(&screen
->base
, &fence
->sequence
);
102 assert(fence
->state
== NOUVEAU_FENCE_STATE_EMITTING
);
103 fence
->state
= NOUVEAU_FENCE_STATE_EMITTED
;
107 nouveau_fence_del(struct nouveau_fence
*fence
)
109 struct nouveau_fence
*it
;
110 struct nouveau_screen
*screen
= fence
->screen
;
112 if (fence
->state
== NOUVEAU_FENCE_STATE_EMITTED
||
113 fence
->state
== NOUVEAU_FENCE_STATE_FLUSHED
) {
114 if (fence
== screen
->fence
.head
) {
115 screen
->fence
.head
= fence
->next
;
116 if (!screen
->fence
.head
)
117 screen
->fence
.tail
= NULL
;
119 for (it
= screen
->fence
.head
; it
&& it
->next
!= fence
; it
= it
->next
);
120 it
->next
= fence
->next
;
121 if (screen
->fence
.tail
== fence
)
122 screen
->fence
.tail
= it
;
126 if (!LIST_IS_EMPTY(&fence
->work
)) {
127 debug_printf("WARNING: deleting fence with work still pending !\n");
128 nouveau_fence_trigger_work(fence
);
135 nouveau_fence_update(struct nouveau_screen
*screen
, bool flushed
)
137 struct nouveau_fence
*fence
;
138 struct nouveau_fence
*next
= NULL
;
139 u32 sequence
= screen
->fence
.update(&screen
->base
);
141 if (screen
->fence
.sequence_ack
== sequence
)
143 screen
->fence
.sequence_ack
= sequence
;
145 for (fence
= screen
->fence
.head
; fence
; fence
= next
) {
147 sequence
= fence
->sequence
;
149 fence
->state
= NOUVEAU_FENCE_STATE_SIGNALLED
;
151 nouveau_fence_trigger_work(fence
);
152 nouveau_fence_ref(NULL
, &fence
);
154 if (sequence
== screen
->fence
.sequence_ack
)
157 screen
->fence
.head
= next
;
159 screen
->fence
.tail
= NULL
;
162 for (fence
= next
; fence
; fence
= fence
->next
)
163 if (fence
->state
== NOUVEAU_FENCE_STATE_EMITTED
)
164 fence
->state
= NOUVEAU_FENCE_STATE_FLUSHED
;
168 #define NOUVEAU_FENCE_MAX_SPINS (1 << 31)
171 nouveau_fence_signalled(struct nouveau_fence
*fence
)
173 struct nouveau_screen
*screen
= fence
->screen
;
175 if (fence
->state
== NOUVEAU_FENCE_STATE_SIGNALLED
)
178 if (fence
->state
>= NOUVEAU_FENCE_STATE_EMITTED
)
179 nouveau_fence_update(screen
, false);
181 return fence
->state
== NOUVEAU_FENCE_STATE_SIGNALLED
;
185 nouveau_fence_wait(struct nouveau_fence
*fence
)
187 struct nouveau_screen
*screen
= fence
->screen
;
190 /* wtf, someone is waiting on a fence in flush_notify handler? */
191 assert(fence
->state
!= NOUVEAU_FENCE_STATE_EMITTING
);
193 if (fence
->state
< NOUVEAU_FENCE_STATE_EMITTED
) {
194 PUSH_SPACE(screen
->pushbuf
, 8);
195 nouveau_fence_emit(fence
);
198 if (fence
->state
< NOUVEAU_FENCE_STATE_FLUSHED
)
199 if (nouveau_pushbuf_kick(screen
->pushbuf
, screen
->pushbuf
->channel
))
202 if (fence
== screen
->fence
.current
)
203 nouveau_fence_next(screen
);
206 nouveau_fence_update(screen
, false);
208 if (fence
->state
== NOUVEAU_FENCE_STATE_SIGNALLED
)
211 NOUVEAU_DRV_STAT(screen
, any_non_kernel_fence_sync_count
, 1);
214 if (!(spins
% 8)) /* donate a few cycles */
217 } while (spins
< NOUVEAU_FENCE_MAX_SPINS
);
219 debug_printf("Wait on fence %u (ack = %u, next = %u) timed out !\n",
221 screen
->fence
.sequence_ack
, screen
->fence
.sequence
);
227 nouveau_fence_next(struct nouveau_screen
*screen
)
229 if (screen
->fence
.current
->state
< NOUVEAU_FENCE_STATE_EMITTING
) {
230 if (screen
->fence
.current
->ref
> 1)
231 nouveau_fence_emit(screen
->fence
.current
);
236 nouveau_fence_ref(NULL
, &screen
->fence
.current
);
238 nouveau_fence_new(screen
, &screen
->fence
.current
, false);
242 nouveau_fence_unref_bo(void *data
)
244 struct nouveau_bo
*bo
= data
;
246 nouveau_bo_ref(NULL
, &bo
);