1 /**************************************************************************
3 * Copyright 2007 VMware, Inc.
4 * Copyright 2010 VMware, Inc.
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the
9 * "Software"), to deal in the Software without restriction, including
10 * without limitation the rights to use, copy, modify, merge, publish,
11 * distribute, sub license, and/or sell copies of the Software, and to
12 * permit persons to whom the Software is furnished to do so, subject to
13 * the following conditions:
15 * The above copyright notice and this permission notice (including the
16 * next paragraph) shall be included in all copies or substantial portions
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
20 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
22 * IN NO EVENT SHALL THE AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR
23 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
24 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
25 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
27 **************************************************************************/
30 * Keith Whitwell, Qicheng Christopher Li, Brian Paul
33 #include "draw/draw_context.h"
34 #include "pipe/p_defines.h"
35 #include "util/u_memory.h"
36 #include "util/os_time.h"
37 #include "lp_context.h"
41 #include "lp_screen.h"
46 static struct llvmpipe_query
*llvmpipe_query( struct pipe_query
*p
)
48 return (struct llvmpipe_query
*)p
;
51 static struct pipe_query
*
52 llvmpipe_create_query(struct pipe_context
*pipe
,
56 struct llvmpipe_query
*pq
;
58 assert(type
< PIPE_QUERY_TYPES
);
60 pq
= CALLOC_STRUCT( llvmpipe_query
);
66 return (struct pipe_query
*) pq
;
71 llvmpipe_destroy_query(struct pipe_context
*pipe
, struct pipe_query
*q
)
73 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
75 /* Ideally we would refcount queries & not get destroyed until the
76 * last scene had finished with us.
79 if (!lp_fence_issued(pq
->fence
))
80 llvmpipe_flush(pipe
, NULL
, __FUNCTION__
);
82 if (!lp_fence_signalled(pq
->fence
))
83 lp_fence_wait(pq
->fence
);
85 lp_fence_reference(&pq
->fence
, NULL
);
93 llvmpipe_get_query_result(struct pipe_context
*pipe
,
96 union pipe_query_result
*vresult
)
98 struct llvmpipe_screen
*screen
= llvmpipe_screen(pipe
->screen
);
99 unsigned num_threads
= MAX2(1, screen
->num_threads
);
100 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
101 uint64_t *result
= (uint64_t *)vresult
;
105 /* only have a fence if there was a scene */
106 if (!lp_fence_signalled(pq
->fence
)) {
107 if (!lp_fence_issued(pq
->fence
))
108 llvmpipe_flush(pipe
, NULL
, __FUNCTION__
);
113 lp_fence_wait(pq
->fence
);
117 /* Sum the results from each of the threads:
122 case PIPE_QUERY_OCCLUSION_COUNTER
:
123 for (i
= 0; i
< num_threads
; i
++) {
124 *result
+= pq
->end
[i
];
127 case PIPE_QUERY_OCCLUSION_PREDICATE
:
128 case PIPE_QUERY_OCCLUSION_PREDICATE_CONSERVATIVE
:
129 for (i
= 0; i
< num_threads
; i
++) {
130 /* safer (still not guaranteed) when there's an overflow */
131 vresult
->b
= vresult
->b
|| pq
->end
[i
];
134 case PIPE_QUERY_TIMESTAMP
:
135 for (i
= 0; i
< num_threads
; i
++) {
136 if (pq
->end
[i
] > *result
) {
137 *result
= pq
->end
[i
];
141 case PIPE_QUERY_TIMESTAMP_DISJOINT
: {
142 struct pipe_query_data_timestamp_disjoint
*td
=
143 (struct pipe_query_data_timestamp_disjoint
*)vresult
;
144 /* os_get_time_nano return nanoseconds */
145 td
->frequency
= UINT64_C(1000000000);
146 td
->disjoint
= FALSE
;
149 case PIPE_QUERY_GPU_FINISHED
:
152 case PIPE_QUERY_PRIMITIVES_GENERATED
:
153 *result
= pq
->num_primitives_generated
;
155 case PIPE_QUERY_PRIMITIVES_EMITTED
:
156 *result
= pq
->num_primitives_written
;
158 case PIPE_QUERY_SO_OVERFLOW_PREDICATE
:
159 case PIPE_QUERY_SO_OVERFLOW_ANY_PREDICATE
:
160 vresult
->b
= pq
->num_primitives_generated
> pq
->num_primitives_written
;
162 case PIPE_QUERY_SO_STATISTICS
: {
163 struct pipe_query_data_so_statistics
*stats
=
164 (struct pipe_query_data_so_statistics
*)vresult
;
165 stats
->num_primitives_written
= pq
->num_primitives_written
;
166 stats
->primitives_storage_needed
= pq
->num_primitives_generated
;
169 case PIPE_QUERY_PIPELINE_STATISTICS
: {
170 struct pipe_query_data_pipeline_statistics
*stats
=
171 (struct pipe_query_data_pipeline_statistics
*)vresult
;
172 /* only ps_invocations come from binned query */
173 for (i
= 0; i
< num_threads
; i
++) {
174 pq
->stats
.ps_invocations
+= pq
->end
[i
];
176 pq
->stats
.ps_invocations
*= LP_RASTER_BLOCK_SIZE
* LP_RASTER_BLOCK_SIZE
;
190 llvmpipe_begin_query(struct pipe_context
*pipe
, struct pipe_query
*q
)
192 struct llvmpipe_context
*llvmpipe
= llvmpipe_context( pipe
);
193 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
195 /* Check if the query is already in the scene. If so, we need to
196 * flush the scene now. Real apps shouldn't re-use a query in a
197 * frame of rendering.
199 if (pq
->fence
&& !lp_fence_issued(pq
->fence
)) {
200 llvmpipe_finish(pipe
, __FUNCTION__
);
204 memset(pq
->start
, 0, sizeof(pq
->start
));
205 memset(pq
->end
, 0, sizeof(pq
->end
));
206 lp_setup_begin_query(llvmpipe
->setup
, pq
);
209 case PIPE_QUERY_PRIMITIVES_EMITTED
:
210 pq
->num_primitives_written
= llvmpipe
->so_stats
.num_primitives_written
;
212 case PIPE_QUERY_PRIMITIVES_GENERATED
:
213 pq
->num_primitives_generated
= llvmpipe
->so_stats
.primitives_storage_needed
;
215 case PIPE_QUERY_SO_STATISTICS
:
216 pq
->num_primitives_written
= llvmpipe
->so_stats
.num_primitives_written
;
217 pq
->num_primitives_generated
= llvmpipe
->so_stats
.primitives_storage_needed
;
219 case PIPE_QUERY_SO_OVERFLOW_PREDICATE
:
220 case PIPE_QUERY_SO_OVERFLOW_ANY_PREDICATE
:
221 pq
->num_primitives_written
= llvmpipe
->so_stats
.num_primitives_written
;
222 pq
->num_primitives_generated
= llvmpipe
->so_stats
.primitives_storage_needed
;
224 case PIPE_QUERY_PIPELINE_STATISTICS
:
225 /* reset our cache */
226 if (llvmpipe
->active_statistics_queries
== 0) {
227 memset(&llvmpipe
->pipeline_statistics
, 0,
228 sizeof(llvmpipe
->pipeline_statistics
));
230 memcpy(&pq
->stats
, &llvmpipe
->pipeline_statistics
, sizeof(pq
->stats
));
231 llvmpipe
->active_statistics_queries
++;
233 case PIPE_QUERY_OCCLUSION_COUNTER
:
234 case PIPE_QUERY_OCCLUSION_PREDICATE
:
235 case PIPE_QUERY_OCCLUSION_PREDICATE_CONSERVATIVE
:
236 llvmpipe
->active_occlusion_queries
++;
237 llvmpipe
->dirty
|= LP_NEW_OCCLUSION_QUERY
;
247 llvmpipe_end_query(struct pipe_context
*pipe
, struct pipe_query
*q
)
249 struct llvmpipe_context
*llvmpipe
= llvmpipe_context( pipe
);
250 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
252 lp_setup_end_query(llvmpipe
->setup
, pq
);
256 case PIPE_QUERY_PRIMITIVES_EMITTED
:
257 pq
->num_primitives_written
=
258 llvmpipe
->so_stats
.num_primitives_written
- pq
->num_primitives_written
;
260 case PIPE_QUERY_PRIMITIVES_GENERATED
:
261 pq
->num_primitives_generated
=
262 llvmpipe
->so_stats
.primitives_storage_needed
- pq
->num_primitives_generated
;
264 case PIPE_QUERY_SO_STATISTICS
:
265 pq
->num_primitives_written
=
266 llvmpipe
->so_stats
.num_primitives_written
- pq
->num_primitives_written
;
267 pq
->num_primitives_generated
=
268 llvmpipe
->so_stats
.primitives_storage_needed
- pq
->num_primitives_generated
;
270 case PIPE_QUERY_SO_OVERFLOW_PREDICATE
:
271 case PIPE_QUERY_SO_OVERFLOW_ANY_PREDICATE
:
272 pq
->num_primitives_written
=
273 llvmpipe
->so_stats
.num_primitives_written
- pq
->num_primitives_written
;
274 pq
->num_primitives_generated
=
275 llvmpipe
->so_stats
.primitives_storage_needed
- pq
->num_primitives_generated
;
277 case PIPE_QUERY_PIPELINE_STATISTICS
:
278 pq
->stats
.ia_vertices
=
279 llvmpipe
->pipeline_statistics
.ia_vertices
- pq
->stats
.ia_vertices
;
280 pq
->stats
.ia_primitives
=
281 llvmpipe
->pipeline_statistics
.ia_primitives
- pq
->stats
.ia_primitives
;
282 pq
->stats
.vs_invocations
=
283 llvmpipe
->pipeline_statistics
.vs_invocations
- pq
->stats
.vs_invocations
;
284 pq
->stats
.gs_invocations
=
285 llvmpipe
->pipeline_statistics
.gs_invocations
- pq
->stats
.gs_invocations
;
286 pq
->stats
.gs_primitives
=
287 llvmpipe
->pipeline_statistics
.gs_primitives
- pq
->stats
.gs_primitives
;
288 pq
->stats
.c_invocations
=
289 llvmpipe
->pipeline_statistics
.c_invocations
- pq
->stats
.c_invocations
;
290 pq
->stats
.c_primitives
=
291 llvmpipe
->pipeline_statistics
.c_primitives
- pq
->stats
.c_primitives
;
292 pq
->stats
.ps_invocations
=
293 llvmpipe
->pipeline_statistics
.ps_invocations
- pq
->stats
.ps_invocations
;
295 llvmpipe
->active_statistics_queries
--;
297 case PIPE_QUERY_OCCLUSION_COUNTER
:
298 case PIPE_QUERY_OCCLUSION_PREDICATE
:
299 case PIPE_QUERY_OCCLUSION_PREDICATE_CONSERVATIVE
:
300 assert(llvmpipe
->active_occlusion_queries
);
301 llvmpipe
->active_occlusion_queries
--;
302 llvmpipe
->dirty
|= LP_NEW_OCCLUSION_QUERY
;
312 llvmpipe_check_render_cond(struct llvmpipe_context
*lp
)
314 struct pipe_context
*pipe
= &lp
->pipe
;
318 if (!lp
->render_cond_query
)
319 return TRUE
; /* no query predicate, draw normally */
321 wait
= (lp
->render_cond_mode
== PIPE_RENDER_COND_WAIT
||
322 lp
->render_cond_mode
== PIPE_RENDER_COND_BY_REGION_WAIT
);
324 b
= pipe
->get_query_result(pipe
, lp
->render_cond_query
, wait
, (void*)&result
);
326 return ((!result
) == lp
->render_cond_cond
);
332 llvmpipe_set_active_query_state(struct pipe_context
*pipe
, boolean enable
)
336 void llvmpipe_init_query_funcs(struct llvmpipe_context
*llvmpipe
)
338 llvmpipe
->pipe
.create_query
= llvmpipe_create_query
;
339 llvmpipe
->pipe
.destroy_query
= llvmpipe_destroy_query
;
340 llvmpipe
->pipe
.begin_query
= llvmpipe_begin_query
;
341 llvmpipe
->pipe
.end_query
= llvmpipe_end_query
;
342 llvmpipe
->pipe
.get_query_result
= llvmpipe_get_query_result
;
343 llvmpipe
->pipe
.set_active_query_state
= llvmpipe_set_active_query_state
;