2 * Copyright 2009 Corbin Simpson <MostAwesomeDude@gmail.com>
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 * on the rights to use, copy, modify, merge, publish, distribute, sub
8 * license, and/or sell copies of the Software, and to permit persons to whom
9 * the Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHOR(S) AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
21 * USE OR OTHER DEALINGS IN THE SOFTWARE. */
23 #include "util/u_memory.h"
24 #include "util/u_simple_list.h"
26 #include "r300_context.h"
27 #include "r300_screen.h"
28 #include "r300_emit.h"
29 #include "r300_winsys.h"
33 static struct pipe_query
*r300_create_query(struct pipe_context
*pipe
,
36 struct r300_context
*r300
= r300_context(pipe
);
37 struct r300_screen
*r300screen
= r300
->screen
;
40 if (query_type
!= PIPE_QUERY_OCCLUSION_COUNTER
) {
44 q
= CALLOC_STRUCT(r300_query
);
49 q
->domain
= R300_DOMAIN_GTT
;
50 q
->buffer_size
= 4096;
52 if (r300screen
->caps
.family
== CHIP_FAMILY_RV530
)
53 q
->num_pipes
= r300screen
->caps
.num_z_pipes
;
55 q
->num_pipes
= r300screen
->caps
.num_frag_pipes
;
57 insert_at_tail(&r300
->query_list
, q
);
59 /* Open up the occlusion query buffer. */
60 q
->buffer
= r300
->rws
->buffer_create(r300
->rws
, q
->buffer_size
, 4096,
61 PIPE_BIND_CUSTOM
, PIPE_USAGE_STREAM
,
64 return (struct pipe_query
*)q
;
67 static void r300_destroy_query(struct pipe_context
* pipe
,
68 struct pipe_query
* query
)
70 struct r300_context
*r300
= r300_context(pipe
);
71 struct r300_query
* q
= r300_query(query
);
73 r300
->rws
->buffer_reference(r300
->rws
, &q
->buffer
, NULL
);
78 void r300_resume_query(struct r300_context
*r300
,
79 struct r300_query
*query
)
81 r300
->query_current
= query
;
82 r300
->query_start
.dirty
= TRUE
;
85 static void r300_begin_query(struct pipe_context
* pipe
,
86 struct pipe_query
* query
)
88 struct r300_context
* r300
= r300_context(pipe
);
89 struct r300_query
* q
= r300_query(query
);
91 if (r300
->query_current
!= NULL
) {
92 fprintf(stderr
, "r300: begin_query: "
93 "Some other query has already been started.\n");
99 r300_resume_query(r300
, q
);
102 void r300_stop_query(struct r300_context
*r300
)
104 r300_emit_query_end(r300
);
105 r300
->query_current
= NULL
;
108 static void r300_end_query(struct pipe_context
* pipe
,
109 struct pipe_query
* query
)
111 struct r300_context
* r300
= r300_context(pipe
);
112 struct r300_query
*q
= r300_query(query
);
114 if (q
!= r300
->query_current
) {
115 fprintf(stderr
, "r300: end_query: Got invalid query.\n");
120 r300_stop_query(r300
);
123 static boolean
r300_get_query_result(struct pipe_context
* pipe
,
124 struct pipe_query
* query
,
128 struct r300_context
* r300
= r300_context(pipe
);
129 struct r300_query
*q
= r300_query(query
);
132 uint64_t *result
= (uint64_t*)vresult
;
135 pipe
->flush(pipe
, 0, NULL
);
137 flags
= PIPE_TRANSFER_READ
| (!wait
? PIPE_TRANSFER_DONTBLOCK
: 0);
139 map
= r300
->rws
->buffer_map(r300
->rws
, q
->buffer
, r300
->cs
, flags
);
143 /* Sum up the results. */
145 for (i
= 0; i
< q
->num_results
; i
++) {
150 r300
->rws
->buffer_unmap(r300
->rws
, q
->buffer
);
156 static void r300_render_condition(struct pipe_context
*pipe
,
157 struct pipe_query
*query
,
160 struct r300_context
*r300
= r300_context(pipe
);
165 wait
= mode
== PIPE_RENDER_COND_WAIT
||
166 mode
== PIPE_RENDER_COND_BY_REGION_WAIT
;
168 if (!r300_get_query_result(pipe
, query
, wait
, &result
)) {
169 r300
->skip_rendering
= FALSE
;
172 r300
->skip_rendering
= result
== 0;
174 r300
->skip_rendering
= FALSE
;
178 /***************************************************************************
179 * Fake occlusion queries (for debugging)
180 ***************************************************************************/
182 static unsigned r300_fake_query
;
184 static struct pipe_query
*r300_fake_create_query(struct pipe_context
*pipe
,
187 return (struct pipe_query
*)&r300_fake_query
;
190 static void r300_fake_destroy_query(struct pipe_context
* pipe
,
191 struct pipe_query
* query
)
195 static void r300_fake_begin_query(struct pipe_context
* pipe
,
196 struct pipe_query
* query
)
200 static void r300_fake_end_query(struct pipe_context
* pipe
,
201 struct pipe_query
* query
)
205 static boolean
r300_fake_get_query_result(struct pipe_context
* pipe
,
206 struct pipe_query
* query
,
207 boolean wait
, void* vresult
)
209 uint64_t *result
= (uint64_t*)vresult
;
214 static void r300_fake_render_condition(struct pipe_context
*pipe
,
215 struct pipe_query
*query
, uint mode
)
219 void r300_init_query_functions(struct r300_context
* r300
) {
220 if (DBG_ON(r300
, DBG_FAKE_OCC
)) {
221 r300
->context
.create_query
= r300_fake_create_query
;
222 r300
->context
.destroy_query
= r300_fake_destroy_query
;
223 r300
->context
.begin_query
= r300_fake_begin_query
;
224 r300
->context
.end_query
= r300_fake_end_query
;
225 r300
->context
.get_query_result
= r300_fake_get_query_result
;
226 r300
->context
.render_condition
= r300_fake_render_condition
;
228 r300
->context
.create_query
= r300_create_query
;
229 r300
->context
.destroy_query
= r300_destroy_query
;
230 r300
->context
.begin_query
= r300_begin_query
;
231 r300
->context
.end_query
= r300_end_query
;
232 r300
->context
.get_query_result
= r300_get_query_result
;
233 r300
->context
.render_condition
= r300_render_condition
;