lp_query.c revision 040e59851ae4c26ce0509d42d2ee71e007b3b3d1 
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 "lp_context.h"
37#include "lp_flush.h"
38#include "lp_fence.h"
39#include "lp_query.h"
40#include "lp_state.h"
41
42
43static struct llvmpipe_query *llvmpipe_query( struct pipe_query *p )
44{
45   return (struct llvmpipe_query *)p;
46}
47
48static struct pipe_query *
49llvmpipe_create_query(struct pipe_context *pipe,
50                      unsigned type)
51{
52   struct llvmpipe_query *pq;
53
54   assert(type == PIPE_QUERY_OCCLUSION_COUNTER);
55
56   pq = CALLOC_STRUCT( llvmpipe_query );
57
58   return (struct pipe_query *) pq;
59}
60
61
62static void
63llvmpipe_destroy_query(struct pipe_context *pipe, struct pipe_query *q)
64{
65   struct llvmpipe_query *pq = llvmpipe_query(q);
66
67   /* Ideally we would refcount queries & not get destroyed until the
68    * last scene had finished with us.
69    */
70   if (pq->fence) {
71      if (!lp_fence_issued(pq->fence))
72         llvmpipe_flush(pipe, 0, NULL, __FUNCTION__);
73
74      if (!lp_fence_signalled(pq->fence))
75         lp_fence_wait(pq->fence);
76
77      lp_fence_reference(&pq->fence, NULL);
78   }
79
80   FREE(pq);
81}
82
83
84static boolean
85llvmpipe_get_query_result(struct pipe_context *pipe,
86                          struct pipe_query *q,
87                          boolean wait,
88                          void *vresult)
89{
90   struct llvmpipe_query *pq = llvmpipe_query(q);
91   uint64_t *result = (uint64_t *)vresult;
92   int i;
93
94   if (!pq->fence) {
95      assert(0);                /* query not in issued state */
96      return FALSE;
97   }
98
99   if (!lp_fence_signalled(pq->fence)) {
100      if (!lp_fence_issued(pq->fence))
101         llvmpipe_flush(pipe, 0, NULL, __FUNCTION__);
102
103      if (!wait)
104         return FALSE;
105
106      lp_fence_wait(pq->fence);
107   }
108
109   /* Sum the results from each of the threads:
110    */
111   *result = 0;
112   for (i = 0; i < LP_MAX_THREADS; i++) {
113      *result += pq->count[i];
114   }
115
116   return TRUE;
117}
118
119
120static void
121llvmpipe_begin_query(struct pipe_context *pipe, struct pipe_query *q)
122{
123   struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
124   struct llvmpipe_query *pq = llvmpipe_query(q);
125
126   /* Check if the query is already in the scene.  If so, we need to
127    * flush the scene now.  Real apps shouldn't re-use a query in a
128    * frame of rendering.
129    */
130   if (pq->fence && !lp_fence_issued(pq->fence)) {
131      llvmpipe_finish(pipe, __FUNCTION__);
132   }
133
134
135   memset(pq->count, 0, sizeof(pq->count));
136   lp_setup_begin_query(llvmpipe->setup, pq);
137
138   llvmpipe->active_query_count++;
139   llvmpipe->dirty |= LP_NEW_QUERY;
140}
141
142
143static void
144llvmpipe_end_query(struct pipe_context *pipe, struct pipe_query *q)
145{
146   struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
147   struct llvmpipe_query *pq = llvmpipe_query(q);
148
149   lp_setup_end_query(llvmpipe->setup, pq);
150
151   assert(llvmpipe->active_query_count);
152   llvmpipe->active_query_count--;
153   llvmpipe->dirty |= LP_NEW_QUERY;
154}
155
156
157void llvmpipe_init_query_funcs(struct llvmpipe_context *llvmpipe )
158{
159   llvmpipe->pipe.create_query = llvmpipe_create_query;
160   llvmpipe->pipe.destroy_query = llvmpipe_destroy_query;
161   llvmpipe->pipe.begin_query = llvmpipe_begin_query;
162   llvmpipe->pipe.end_query = llvmpipe_end_query;
163   llvmpipe->pipe.get_query_result = llvmpipe_get_query_result;
164}
165
166
167