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_state.h"
  42
  43
  44 static struct llvmpipe_query *llvmpipe_query( struct pipe_query *p )
  45 {
  46    return (struct llvmpipe_query *)p;
  47 }
  48
  49 static struct pipe_query *
  50 llvmpipe_create_query(struct pipe_context *pipe,
  51                       unsigned type)
  52 {
  53    struct llvmpipe_query *pq;
  54
  55    assert(type < PIPE_QUERY_TYPES);
  56
  57    pq = CALLOC_STRUCT( llvmpipe_query );
  58
  59    if (pq) {
  60       pq->type = type;
  61    }
  62
  63    return (struct pipe_query *) pq;
  64 }
  65
  66
  67 static void
  68 llvmpipe_destroy_query(struct pipe_context *pipe, struct pipe_query *q)
  69 {
  70    struct llvmpipe_query *pq = llvmpipe_query(q);
  71
  72    /* Ideally we would refcount queries & not get destroyed until the
  73     * last scene had finished with us.
  74     */
  75    if (pq->fence) {
  76       if (!lp_fence_issued(pq->fence))
  77          llvmpipe_flush(pipe, NULL, __FUNCTION__);
  78
  79       if (!lp_fence_signalled(pq->fence))
  80          lp_fence_wait(pq->fence);
  81
  82       lp_fence_reference(&pq->fence, NULL);
  83    }
  84
  85    FREE(pq);
  86 }
  87
  88
  89 static boolean
  90 llvmpipe_get_query_result(struct pipe_context *pipe,
  91                           struct pipe_query *q,
  92                           boolean wait,
  93                           union pipe_query_result *vresult)
  94 {
  95    struct llvmpipe_query *pq = llvmpipe_query(q);
  96    uint64_t *result = (uint64_t *)vresult;
  97    int i;
  98
  99    if (!pq->fence) {
 100       /* no fence because there was no scene, so results is zero */
 101       *result = 0;
 102       return TRUE;
 103    }
 104
 105    if (!lp_fence_signalled(pq->fence)) {
 106       if (!lp_fence_issued(pq->fence))
 107          llvmpipe_flush(pipe, NULL, __FUNCTION__);
 108
 109       if (!wait)
 110          return FALSE;
 111
 112       lp_fence_wait(pq->fence);
 113    }
 114
 115    /* Sum the results from each of the threads:
 116     */
 117    *result = 0;
 118
 119    switch (pq->type) {
 120    case PIPE_QUERY_OCCLUSION_COUNTER:
 121       for (i = 0; i < LP_MAX_THREADS; i++) {
 122          *result += pq->count[i];
 123       }
 124       break;
 125    case PIPE_QUERY_TIME_ELAPSED:
 126       for (i = 0; i < LP_MAX_THREADS; i++) {
 127          if (pq->count[i] > *result) {
 128             *result = pq->count[i];
 129          }
 130       }
 131       break;
 132    case PIPE_QUERY_TIMESTAMP:
 133       for (i = 0; i < LP_MAX_THREADS; i++) {
 134          if (pq->count[i] > *result) {
 135             *result = pq->count[i];
 136          }
 137          if (*result == 0)
 138             *result = os_time_get_nano();
 139       }
 140       break;
 141    case PIPE_QUERY_PRIMITIVES_GENERATED:
 142       *result = pq->num_primitives_generated;
 143       break;
 144    case PIPE_QUERY_PRIMITIVES_EMITTED:
 145       *result = pq->num_primitives_written;
 146       break;
 147    default:
 148       assert(0);
 149       break;
 150    }
 151
 152    return TRUE;
 153 }
 154
 155
 156 static void
 157 llvmpipe_begin_query(struct pipe_context *pipe, struct pipe_query *q)
 158 {
 159    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 160    struct llvmpipe_query *pq = llvmpipe_query(q);
 161
 162    /* Check if the query is already in the scene.  If so, we need to
 163     * flush the scene now.  Real apps shouldn't re-use a query in a
 164     * frame of rendering.
 165     */
 166    if (pq->fence && !lp_fence_issued(pq->fence)) {
 167       llvmpipe_finish(pipe, __FUNCTION__);
 168    }
 169
 170
 171    memset(pq->count, 0, sizeof(pq->count));
 172    lp_setup_begin_query(llvmpipe->setup, pq);
 173
 174    if (pq->type == PIPE_QUERY_PRIMITIVES_EMITTED) {
 175       pq->num_primitives_written = 0;
 176       llvmpipe->so_stats.num_primitives_written = 0;
 177    }
 178
 179    if (pq->type == PIPE_QUERY_PRIMITIVES_GENERATED) {
 180       pq->num_primitives_generated = 0;
 181       llvmpipe->num_primitives_generated = 0;
 182    }
 183
 184    if (pq->type == PIPE_QUERY_OCCLUSION_COUNTER) {
 185       llvmpipe->active_occlusion_query = TRUE;
 186       llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
 187    }
 188 }
 189
 190
 191 static void
 192 llvmpipe_end_query(struct pipe_context *pipe, struct pipe_query *q)
 193 {
 194    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 195    struct llvmpipe_query *pq = llvmpipe_query(q);
 196
 197    lp_setup_end_query(llvmpipe->setup, pq);
 198
 199    if (pq->type == PIPE_QUERY_PRIMITIVES_EMITTED) {
 200       pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
 201    }
 202
 203    if (pq->type == PIPE_QUERY_PRIMITIVES_GENERATED) {
 204       pq->num_primitives_generated = llvmpipe->num_primitives_generated;
 205    }
 206
 207    if (pq->type == PIPE_QUERY_OCCLUSION_COUNTER) {
 208       assert(llvmpipe->active_occlusion_query);
 209       llvmpipe->active_occlusion_query = FALSE;
 210       llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
 211    }
 212 }
 213
 214 boolean
 215 llvmpipe_check_render_cond(struct llvmpipe_context *lp)
 216 {
 217    struct pipe_context *pipe = &lp->pipe;
 218    boolean b, wait;
 219    uint64_t result;
 220
 221    if (!lp->render_cond_query)
 222       return TRUE; /* no query predicate, draw normally */
 223    wait = (lp->render_cond_mode == PIPE_RENDER_COND_WAIT ||
 224            lp->render_cond_mode == PIPE_RENDER_COND_BY_REGION_WAIT);
 225
 226    b = pipe->get_query_result(pipe, lp->render_cond_query, wait, (void*)&result);
 227    if (b)
 228       return result > 0;
 229    else
 230       return TRUE;
 231 }
 232
 233 void llvmpipe_init_query_funcs(struct llvmpipe_context *llvmpipe )
 234 {
 235    llvmpipe->pipe.create_query = llvmpipe_create_query;
 236    llvmpipe->pipe.destroy_query = llvmpipe_destroy_query;
 237    llvmpipe->pipe.begin_query = llvmpipe_begin_query;
 238    llvmpipe->pipe.end_query = llvmpipe_end_query;
 239    llvmpipe->pipe.get_query_result = llvmpipe_get_query_result;
 240 }
 241
 242