fcb5c6ac340b919dbcc209c24173c09cee162c07
[mesa.git] / src / gallium / drivers / llvmpipe / lp_query.c
1 /**************************************************************************
2 *
3 * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
4 * Copyright 2010 VMware, Inc.
5 * All Rights Reserved.
6 *
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:
14 *
15 * The above copyright notice and this permission notice (including the
16 * next paragraph) shall be included in all copies or substantial portions
17 * of the Software.
18 *
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.
26 *
27 **************************************************************************/
28
29 /* Authors:
30 * Keith Whitwell, Qicheng Christopher Li, Brian Paul
31 */
32
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"
38 #include "lp_flush.h"
39 #include "lp_fence.h"
40 #include "lp_query.h"
41 #include "lp_screen.h"
42 #include "lp_state.h"
43
44
45 static struct llvmpipe_query *llvmpipe_query( struct pipe_query *p )
46 {
47 return (struct llvmpipe_query *)p;
48 }
49
50 static struct pipe_query *
51 llvmpipe_create_query(struct pipe_context *pipe,
52 unsigned type)
53 {
54 struct llvmpipe_query *pq;
55
56 assert(type < PIPE_QUERY_TYPES);
57
58 pq = CALLOC_STRUCT( llvmpipe_query );
59
60 if (pq) {
61 pq->type = type;
62 }
63
64 return (struct pipe_query *) pq;
65 }
66
67
68 static void
69 llvmpipe_destroy_query(struct pipe_context *pipe, struct pipe_query *q)
70 {
71 struct llvmpipe_query *pq = llvmpipe_query(q);
72
73 /* Ideally we would refcount queries & not get destroyed until the
74 * last scene had finished with us.
75 */
76 if (pq->fence) {
77 if (!lp_fence_issued(pq->fence))
78 llvmpipe_flush(pipe, NULL, __FUNCTION__);
79
80 if (!lp_fence_signalled(pq->fence))
81 lp_fence_wait(pq->fence);
82
83 lp_fence_reference(&pq->fence, NULL);
84 }
85
86 FREE(pq);
87 }
88
89
90 static boolean
91 llvmpipe_get_query_result(struct pipe_context *pipe,
92 struct pipe_query *q,
93 boolean wait,
94 union pipe_query_result *vresult)
95 {
96 struct llvmpipe_screen *screen = llvmpipe_screen(pipe->screen);
97 struct llvmpipe_query *pq = llvmpipe_query(q);
98 uint64_t *result = (uint64_t *)vresult;
99 int i;
100
101 if (!pq->fence) {
102 /* no fence because there was no scene, so results is zero */
103 *result = 0;
104 return TRUE;
105 }
106
107 if (!lp_fence_signalled(pq->fence)) {
108 if (!lp_fence_issued(pq->fence))
109 llvmpipe_flush(pipe, NULL, __FUNCTION__);
110
111 if (!wait)
112 return FALSE;
113
114 lp_fence_wait(pq->fence);
115 }
116
117 /* Sum the results from each of the threads:
118 */
119 *result = 0;
120
121 switch (pq->type) {
122 case PIPE_QUERY_OCCLUSION_COUNTER:
123 for (i = 0; i < screen->num_threads; i++) {
124 *result += pq->count[i];
125 }
126 break;
127 case PIPE_QUERY_TIMESTAMP:
128 for (i = 0; i < screen->num_threads; i++) {
129 if (pq->count[i] > *result) {
130 *result = pq->count[i];
131 }
132 if (*result == 0)
133 *result = os_time_get_nano();
134 }
135 break;
136 case PIPE_QUERY_PRIMITIVES_GENERATED:
137 *result = pq->num_primitives_generated;
138 break;
139 case PIPE_QUERY_PRIMITIVES_EMITTED:
140 *result = pq->num_primitives_written;
141 break;
142 case PIPE_QUERY_SO_STATISTICS: {
143 struct pipe_query_data_so_statistics *stats =
144 (struct pipe_query_data_so_statistics *)vresult;
145 stats->num_primitives_written = pq->num_primitives_written;
146 stats->primitives_storage_needed = pq->num_primitives_generated;
147 }
148 break;
149 case PIPE_QUERY_PIPELINE_STATISTICS: {
150 struct pipe_query_data_pipeline_statistics *stats =
151 (struct pipe_query_data_pipeline_statistics *)vresult;
152 *stats = pq->stats;
153 }
154 break;
155 default:
156 assert(0);
157 break;
158 }
159
160 return TRUE;
161 }
162
163
164 static void
165 llvmpipe_begin_query(struct pipe_context *pipe, struct pipe_query *q)
166 {
167 struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
168 struct llvmpipe_query *pq = llvmpipe_query(q);
169
170 /* Check if the query is already in the scene. If so, we need to
171 * flush the scene now. Real apps shouldn't re-use a query in a
172 * frame of rendering.
173 */
174 if (pq->fence && !lp_fence_issued(pq->fence)) {
175 llvmpipe_finish(pipe, __FUNCTION__);
176 }
177
178
179 memset(pq->count, 0, sizeof(pq->count));
180 lp_setup_begin_query(llvmpipe->setup, pq);
181
182 if (pq->type == PIPE_QUERY_PRIMITIVES_EMITTED) {
183 pq->num_primitives_written = 0;
184 llvmpipe->so_stats.num_primitives_written = 0;
185 }
186
187 if (pq->type == PIPE_QUERY_PRIMITIVES_GENERATED) {
188 pq->num_primitives_generated = 0;
189 llvmpipe->num_primitives_generated = 0;
190 }
191
192 if (pq->type == PIPE_QUERY_SO_STATISTICS) {
193 pq->num_primitives_written = 0;
194 llvmpipe->so_stats.num_primitives_written = 0;
195 pq->num_primitives_generated = 0;
196 llvmpipe->num_primitives_generated = 0;
197 }
198
199 if (pq->type == PIPE_QUERY_PIPELINE_STATISTICS) {
200 /* reset our cache */
201 if (llvmpipe->active_statistics_queries == 0) {
202 memset(&llvmpipe->pipeline_statistics, 0,
203 sizeof(llvmpipe->pipeline_statistics));
204 }
205 memcpy(&pq->stats, &llvmpipe->pipeline_statistics, sizeof(pq->stats));
206 llvmpipe->active_statistics_queries++;
207 }
208
209 if (pq->type == PIPE_QUERY_OCCLUSION_COUNTER) {
210 llvmpipe->active_occlusion_query = TRUE;
211 llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
212 }
213 }
214
215
216 static void
217 llvmpipe_end_query(struct pipe_context *pipe, struct pipe_query *q)
218 {
219 struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
220 struct llvmpipe_query *pq = llvmpipe_query(q);
221
222 lp_setup_end_query(llvmpipe->setup, pq);
223
224 if (pq->type == PIPE_QUERY_PRIMITIVES_EMITTED) {
225 pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
226 }
227
228 if (pq->type == PIPE_QUERY_PRIMITIVES_GENERATED) {
229 pq->num_primitives_generated = llvmpipe->num_primitives_generated;
230 }
231
232 if (pq->type == PIPE_QUERY_SO_STATISTICS) {
233 pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
234 pq->num_primitives_generated = llvmpipe->num_primitives_generated;
235 }
236
237 if (pq->type == PIPE_QUERY_PIPELINE_STATISTICS) {
238 pq->stats.ia_vertices =
239 llvmpipe->pipeline_statistics.ia_vertices - pq->stats.ia_vertices;
240 pq->stats.ia_primitives =
241 llvmpipe->pipeline_statistics.ia_primitives - pq->stats.ia_primitives;
242 pq->stats.vs_invocations =
243 llvmpipe->pipeline_statistics.vs_invocations - pq->stats.vs_invocations;
244 pq->stats.gs_invocations =
245 llvmpipe->pipeline_statistics.gs_invocations - pq->stats.gs_invocations;
246 pq->stats.gs_primitives =
247 llvmpipe->pipeline_statistics.gs_primitives - pq->stats.gs_primitives;
248 pq->stats.c_invocations =
249 llvmpipe->pipeline_statistics.c_invocations - pq->stats.c_invocations;
250 pq->stats.c_primitives =
251 llvmpipe->pipeline_statistics.c_primitives - pq->stats.c_primitives;
252 pq->stats.ps_invocations =
253 llvmpipe->pipeline_statistics.ps_invocations - pq->stats.ps_invocations;
254
255 llvmpipe->active_statistics_queries--;
256 }
257
258 if (pq->type == PIPE_QUERY_OCCLUSION_COUNTER) {
259 assert(llvmpipe->active_occlusion_query);
260 llvmpipe->active_occlusion_query = FALSE;
261 llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
262 }
263 }
264
265 boolean
266 llvmpipe_check_render_cond(struct llvmpipe_context *lp)
267 {
268 struct pipe_context *pipe = &lp->pipe;
269 boolean b, wait;
270 uint64_t result;
271
272 if (!lp->render_cond_query)
273 return TRUE; /* no query predicate, draw normally */
274 wait = (lp->render_cond_mode == PIPE_RENDER_COND_WAIT ||
275 lp->render_cond_mode == PIPE_RENDER_COND_BY_REGION_WAIT);
276
277 b = pipe->get_query_result(pipe, lp->render_cond_query, wait, (void*)&result);
278 if (b)
279 return result > 0;
280 else
281 return TRUE;
282 }
283
284 void llvmpipe_init_query_funcs(struct llvmpipe_context *llvmpipe )
285 {
286 llvmpipe->pipe.create_query = llvmpipe_create_query;
287 llvmpipe->pipe.destroy_query = llvmpipe_destroy_query;
288 llvmpipe->pipe.begin_query = llvmpipe_begin_query;
289 llvmpipe->pipe.end_query = llvmpipe_end_query;
290 llvmpipe->pipe.get_query_result = llvmpipe_get_query_result;
291 }
292
293