1 /**************************************************************************
3 * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
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 "os/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
,
55 struct llvmpipe_query
*pq
;
57 assert(type
< PIPE_QUERY_TYPES
);
59 pq
= CALLOC_STRUCT( llvmpipe_query
);
65 return (struct pipe_query
*) pq
;
70 llvmpipe_destroy_query(struct pipe_context
*pipe
, struct pipe_query
*q
)
72 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
74 /* Ideally we would refcount queries & not get destroyed until the
75 * last scene had finished with us.
78 if (!lp_fence_issued(pq
->fence
))
79 llvmpipe_flush(pipe
, NULL
, __FUNCTION__
);
81 if (!lp_fence_signalled(pq
->fence
))
82 lp_fence_wait(pq
->fence
);
84 lp_fence_reference(&pq
->fence
, NULL
);
92 llvmpipe_get_query_result(struct pipe_context
*pipe
,
95 union pipe_query_result
*vresult
)
97 struct llvmpipe_screen
*screen
= llvmpipe_screen(pipe
->screen
);
98 unsigned num_threads
= MAX2(1, screen
->num_threads
);
99 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
100 uint64_t *result
= (uint64_t *)vresult
;
104 /* only have a fence if there was a scene */
105 if (!lp_fence_signalled(pq
->fence
)) {
106 if (!lp_fence_issued(pq
->fence
))
107 llvmpipe_flush(pipe
, NULL
, __FUNCTION__
);
112 lp_fence_wait(pq
->fence
);
116 /* Sum the results from each of the threads:
121 case PIPE_QUERY_OCCLUSION_COUNTER
:
122 for (i
= 0; i
< num_threads
; i
++) {
123 *result
+= pq
->end
[i
];
126 case PIPE_QUERY_OCCLUSION_PREDICATE
:
127 for (i
= 0; i
< num_threads
; i
++) {
128 /* safer (still not guaranteed) when there's an overflow */
129 vresult
->b
= vresult
->b
|| pq
->end
[i
];
132 case PIPE_QUERY_TIMESTAMP
:
133 for (i
= 0; i
< num_threads
; i
++) {
134 if (pq
->end
[i
] > *result
) {
135 *result
= pq
->end
[i
];
139 case PIPE_QUERY_TIMESTAMP_DISJOINT
: {
140 struct pipe_query_data_timestamp_disjoint
*td
=
141 (struct pipe_query_data_timestamp_disjoint
*)vresult
;
142 /* os_get_time_nano return nanoseconds */
143 td
->frequency
= UINT64_C(1000000000);
144 td
->disjoint
= FALSE
;
147 case PIPE_QUERY_GPU_FINISHED
:
150 case PIPE_QUERY_PRIMITIVES_GENERATED
:
151 *result
= pq
->num_primitives_generated
;
153 case PIPE_QUERY_PRIMITIVES_EMITTED
:
154 *result
= pq
->num_primitives_written
;
156 case PIPE_QUERY_SO_OVERFLOW_PREDICATE
:
157 vresult
->b
= pq
->num_primitives_generated
> pq
->num_primitives_written
;
159 case PIPE_QUERY_SO_STATISTICS
: {
160 struct pipe_query_data_so_statistics
*stats
=
161 (struct pipe_query_data_so_statistics
*)vresult
;
162 stats
->num_primitives_written
= pq
->num_primitives_written
;
163 stats
->primitives_storage_needed
= pq
->num_primitives_generated
;
166 case PIPE_QUERY_PIPELINE_STATISTICS
: {
167 struct pipe_query_data_pipeline_statistics
*stats
=
168 (struct pipe_query_data_pipeline_statistics
*)vresult
;
169 /* only ps_invocations come from binned query */
170 for (i
= 0; i
< num_threads
; i
++) {
171 pq
->stats
.ps_invocations
+= pq
->end
[i
];
173 pq
->stats
.ps_invocations
*= LP_RASTER_BLOCK_SIZE
* LP_RASTER_BLOCK_SIZE
;
187 llvmpipe_begin_query(struct pipe_context
*pipe
, struct pipe_query
*q
)
189 struct llvmpipe_context
*llvmpipe
= llvmpipe_context( pipe
);
190 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
192 /* Check if the query is already in the scene. If so, we need to
193 * flush the scene now. Real apps shouldn't re-use a query in a
194 * frame of rendering.
196 if (pq
->fence
&& !lp_fence_issued(pq
->fence
)) {
197 llvmpipe_finish(pipe
, __FUNCTION__
);
201 memset(pq
->start
, 0, sizeof(pq
->start
));
202 memset(pq
->end
, 0, sizeof(pq
->end
));
203 lp_setup_begin_query(llvmpipe
->setup
, pq
);
206 case PIPE_QUERY_PRIMITIVES_EMITTED
:
207 pq
->num_primitives_written
= llvmpipe
->so_stats
.num_primitives_written
;
209 case PIPE_QUERY_PRIMITIVES_GENERATED
:
210 pq
->num_primitives_generated
= llvmpipe
->so_stats
.primitives_storage_needed
;
212 case PIPE_QUERY_SO_STATISTICS
:
213 pq
->num_primitives_written
= llvmpipe
->so_stats
.num_primitives_written
;
214 pq
->num_primitives_generated
= llvmpipe
->so_stats
.primitives_storage_needed
;
216 case PIPE_QUERY_SO_OVERFLOW_PREDICATE
:
217 pq
->num_primitives_written
= llvmpipe
->so_stats
.num_primitives_written
;
218 pq
->num_primitives_generated
= llvmpipe
->so_stats
.primitives_storage_needed
;
220 case PIPE_QUERY_PIPELINE_STATISTICS
:
221 /* reset our cache */
222 if (llvmpipe
->active_statistics_queries
== 0) {
223 memset(&llvmpipe
->pipeline_statistics
, 0,
224 sizeof(llvmpipe
->pipeline_statistics
));
226 memcpy(&pq
->stats
, &llvmpipe
->pipeline_statistics
, sizeof(pq
->stats
));
227 llvmpipe
->active_statistics_queries
++;
229 case PIPE_QUERY_OCCLUSION_COUNTER
:
230 case PIPE_QUERY_OCCLUSION_PREDICATE
:
231 llvmpipe
->active_occlusion_queries
++;
232 llvmpipe
->dirty
|= LP_NEW_OCCLUSION_QUERY
;
241 llvmpipe_end_query(struct pipe_context
*pipe
, struct pipe_query
*q
)
243 struct llvmpipe_context
*llvmpipe
= llvmpipe_context( pipe
);
244 struct llvmpipe_query
*pq
= llvmpipe_query(q
);
246 lp_setup_end_query(llvmpipe
->setup
, pq
);
250 case PIPE_QUERY_PRIMITIVES_EMITTED
:
251 pq
->num_primitives_written
=
252 llvmpipe
->so_stats
.num_primitives_written
- pq
->num_primitives_written
;
254 case PIPE_QUERY_PRIMITIVES_GENERATED
:
255 pq
->num_primitives_generated
=
256 llvmpipe
->so_stats
.primitives_storage_needed
- pq
->num_primitives_generated
;
258 case PIPE_QUERY_SO_STATISTICS
:
259 pq
->num_primitives_written
=
260 llvmpipe
->so_stats
.num_primitives_written
- pq
->num_primitives_written
;
261 pq
->num_primitives_generated
=
262 llvmpipe
->so_stats
.primitives_storage_needed
- pq
->num_primitives_generated
;
264 case PIPE_QUERY_SO_OVERFLOW_PREDICATE
:
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_PIPELINE_STATISTICS
:
271 pq
->stats
.ia_vertices
=
272 llvmpipe
->pipeline_statistics
.ia_vertices
- pq
->stats
.ia_vertices
;
273 pq
->stats
.ia_primitives
=
274 llvmpipe
->pipeline_statistics
.ia_primitives
- pq
->stats
.ia_primitives
;
275 pq
->stats
.vs_invocations
=
276 llvmpipe
->pipeline_statistics
.vs_invocations
- pq
->stats
.vs_invocations
;
277 pq
->stats
.gs_invocations
=
278 llvmpipe
->pipeline_statistics
.gs_invocations
- pq
->stats
.gs_invocations
;
279 pq
->stats
.gs_primitives
=
280 llvmpipe
->pipeline_statistics
.gs_primitives
- pq
->stats
.gs_primitives
;
281 pq
->stats
.c_invocations
=
282 llvmpipe
->pipeline_statistics
.c_invocations
- pq
->stats
.c_invocations
;
283 pq
->stats
.c_primitives
=
284 llvmpipe
->pipeline_statistics
.c_primitives
- pq
->stats
.c_primitives
;
285 pq
->stats
.ps_invocations
=
286 llvmpipe
->pipeline_statistics
.ps_invocations
- pq
->stats
.ps_invocations
;
288 llvmpipe
->active_statistics_queries
--;
290 case PIPE_QUERY_OCCLUSION_COUNTER
:
291 case PIPE_QUERY_OCCLUSION_PREDICATE
:
292 assert(llvmpipe
->active_occlusion_queries
);
293 llvmpipe
->active_occlusion_queries
--;
294 llvmpipe
->dirty
|= LP_NEW_OCCLUSION_QUERY
;
302 llvmpipe_check_render_cond(struct llvmpipe_context
*lp
)
304 struct pipe_context
*pipe
= &lp
->pipe
;
308 if (!lp
->render_cond_query
)
309 return TRUE
; /* no query predicate, draw normally */
311 wait
= (lp
->render_cond_mode
== PIPE_RENDER_COND_WAIT
||
312 lp
->render_cond_mode
== PIPE_RENDER_COND_BY_REGION_WAIT
);
314 b
= pipe
->get_query_result(pipe
, lp
->render_cond_query
, wait
, (void*)&result
);
316 return (!result
== lp
->render_cond_cond
);
321 void llvmpipe_init_query_funcs(struct llvmpipe_context
*llvmpipe
)
323 llvmpipe
->pipe
.create_query
= llvmpipe_create_query
;
324 llvmpipe
->pipe
.destroy_query
= llvmpipe_destroy_query
;
325 llvmpipe
->pipe
.begin_query
= llvmpipe_begin_query
;
326 llvmpipe
->pipe
.end_query
= llvmpipe_end_query
;
327 llvmpipe
->pipe
.get_query_result
= llvmpipe_get_query_result
;