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 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
18 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
19 * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23 #include "util/u_double_list.h"
25 #include "nouveau_screen.h"
26 #include "nouveau_fence.h"
28 #include "nouveau/nouveau_pushbuf.h"
35 nouveau_fence_new(struct nouveau_screen
*screen
, struct nouveau_fence
**fence
,
38 *fence
= CALLOC_STRUCT(nouveau_fence
);
42 (*fence
)->screen
= screen
;
44 LIST_INITHEAD(&(*fence
)->work
);
47 nouveau_fence_emit(*fence
);
53 nouveau_fence_trigger_work(struct nouveau_fence
*fence
)
55 struct nouveau_fence_work
*work
, *tmp
;
57 LIST_FOR_EACH_ENTRY_SAFE(work
, tmp
, &fence
->work
, list
) {
58 work
->func(work
->data
);
59 LIST_DEL(&work
->list
);
65 nouveau_fence_work(struct nouveau_fence
*fence
,
66 void (*func
)(void *), void *data
)
68 struct nouveau_fence_work
*work
;
70 if (!fence
|| fence
->state
== NOUVEAU_FENCE_STATE_SIGNALLED
) {
75 work
= CALLOC_STRUCT(nouveau_fence_work
);
80 LIST_ADD(&work
->list
, &fence
->work
);
85 nouveau_fence_emit(struct nouveau_fence
*fence
)
87 struct nouveau_screen
*screen
= fence
->screen
;
89 assert(fence
->state
== NOUVEAU_FENCE_STATE_AVAILABLE
);
91 /* set this now, so that if fence.emit triggers a flush we don't recurse */
92 fence
->state
= NOUVEAU_FENCE_STATE_EMITTING
;
96 if (screen
->fence
.tail
)
97 screen
->fence
.tail
->next
= fence
;
99 screen
->fence
.head
= fence
;
101 screen
->fence
.tail
= fence
;
103 screen
->fence
.emit(&screen
->base
, &fence
->sequence
);
105 assert(fence
->state
== NOUVEAU_FENCE_STATE_EMITTING
);
106 fence
->state
= NOUVEAU_FENCE_STATE_EMITTED
;
110 nouveau_fence_del(struct nouveau_fence
*fence
)
112 struct nouveau_fence
*it
;
113 struct nouveau_screen
*screen
= fence
->screen
;
115 if (fence
->state
== NOUVEAU_FENCE_STATE_EMITTED
||
116 fence
->state
== NOUVEAU_FENCE_STATE_FLUSHED
) {
117 if (fence
== screen
->fence
.head
) {
118 screen
->fence
.head
= fence
->next
;
119 if (!screen
->fence
.head
)
120 screen
->fence
.tail
= NULL
;
122 for (it
= screen
->fence
.head
; it
&& it
->next
!= fence
; it
= it
->next
);
123 it
->next
= fence
->next
;
124 if (screen
->fence
.tail
== fence
)
125 screen
->fence
.tail
= it
;
129 if (!LIST_IS_EMPTY(&fence
->work
)) {
130 debug_printf("WARNING: deleting fence with work still pending !\n");
131 nouveau_fence_trigger_work(fence
);
138 nouveau_fence_update(struct nouveau_screen
*screen
, boolean flushed
)
140 struct nouveau_fence
*fence
;
141 struct nouveau_fence
*next
= NULL
;
142 u32 sequence
= screen
->fence
.update(&screen
->base
);
144 if (screen
->fence
.sequence_ack
== sequence
)
146 screen
->fence
.sequence_ack
= sequence
;
148 for (fence
= screen
->fence
.head
; fence
; fence
= next
) {
150 sequence
= fence
->sequence
;
152 fence
->state
= NOUVEAU_FENCE_STATE_SIGNALLED
;
154 nouveau_fence_trigger_work(fence
);
155 nouveau_fence_ref(NULL
, &fence
);
157 if (sequence
== screen
->fence
.sequence_ack
)
160 screen
->fence
.head
= next
;
162 screen
->fence
.tail
= NULL
;
165 for (fence
= next
; fence
; fence
= fence
->next
)
166 if (fence
->state
== NOUVEAU_FENCE_STATE_EMITTED
)
167 fence
->state
= NOUVEAU_FENCE_STATE_FLUSHED
;
171 #define NOUVEAU_FENCE_MAX_SPINS (1 << 31)
174 nouveau_fence_signalled(struct nouveau_fence
*fence
)
176 struct nouveau_screen
*screen
= fence
->screen
;
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 nouveau_fence_emit(fence
);
196 if (fence
== screen
->fence
.current
)
197 nouveau_fence_new(screen
, &screen
->fence
.current
, FALSE
);
199 if (fence
->state
< NOUVEAU_FENCE_STATE_FLUSHED
)
200 FIRE_RING(screen
->channel
);
203 nouveau_fence_update(screen
, FALSE
);
205 if (fence
->state
== NOUVEAU_FENCE_STATE_SIGNALLED
)
209 if (!(spins
% 8)) /* donate a few cycles */
212 } while (spins
< NOUVEAU_FENCE_MAX_SPINS
);
214 debug_printf("Wait on fence %u (ack = %u, next = %u) timed out !\n",
216 screen
->fence
.sequence_ack
, screen
->fence
.sequence
);
222 nouveau_fence_next(struct nouveau_screen
*screen
)
224 if (screen
->fence
.current
->state
< NOUVEAU_FENCE_STATE_EMITTING
)
225 nouveau_fence_emit(screen
->fence
.current
);
227 nouveau_fence_ref(NULL
, &screen
->fence
.current
);
229 nouveau_fence_new(screen
, &screen
->fence
.current
, FALSE
);