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    unsigned num_threads = MAX2(1, screen->num_threads);
  98    struct llvmpipe_query *pq = llvmpipe_query(q);
  99    uint64_t *result = (uint64_t *)vresult;
 100    int i;
 101
 102    if (!pq->fence) {
 103       /* no fence because there was no scene, so results is zero */
 104       *result = 0;
 105       return TRUE;
 106    }
 107
 108    if (!lp_fence_signalled(pq->fence)) {
 109       if (!lp_fence_issued(pq->fence))
 110          llvmpipe_flush(pipe, NULL, __FUNCTION__);
 111
 112       if (!wait)
 113          return FALSE;
 114
 115       lp_fence_wait(pq->fence);
 116    }
 117
 118    /* Sum the results from each of the threads:
 119     */
 120    *result = 0;
 121
 122    switch (pq->type) {
 123    case PIPE_QUERY_OCCLUSION_COUNTER:
 124       for (i = 0; i < num_threads; i++) {
 125          *result += pq->count[i];
 126       }
 127       break;
 128    case PIPE_QUERY_OCCLUSION_PREDICATE:
 129       for (i = 0; i < num_threads; i++) {
 130          /* safer (still not guaranteed) when there's an overflow */
 131          *result = *result || pq->count[i];
 132       }
 133       break;
 134    case PIPE_QUERY_TIMESTAMP:
 135       for (i = 0; i < num_threads; i++) {
 136          if (pq->count[i] > *result) {
 137             *result = pq->count[i];
 138          }
 139          if (*result == 0)
 140             *result = os_time_get_nano();
 141       }
 142       break;
 143    case PIPE_QUERY_PRIMITIVES_GENERATED:
 144       *result = pq->num_primitives_generated;
 145       break;
 146    case PIPE_QUERY_PRIMITIVES_EMITTED:
 147       *result = pq->num_primitives_written;
 148       break;
 149    case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
 150       *result = pq->so_has_overflown;
 151       break;
 152    case PIPE_QUERY_SO_STATISTICS: {
 153       struct pipe_query_data_so_statistics *stats =
 154          (struct pipe_query_data_so_statistics *)vresult;
 155       stats->num_primitives_written = pq->num_primitives_written;
 156       stats->primitives_storage_needed = pq->num_primitives_generated;
 157    }
 158       break;
 159    case PIPE_QUERY_PIPELINE_STATISTICS: {
 160       struct pipe_query_data_pipeline_statistics *stats =
 161          (struct pipe_query_data_pipeline_statistics *)vresult;
 162       *stats = pq->stats;
 163    }
 164       break;
 165    default:
 166       assert(0);
 167       break;
 168    }
 169
 170    return TRUE;
 171 }
 172
 173
 174 static void
 175 llvmpipe_begin_query(struct pipe_context *pipe, struct pipe_query *q)
 176 {
 177    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 178    struct llvmpipe_query *pq = llvmpipe_query(q);
 179
 180    /* Check if the query is already in the scene.  If so, we need to
 181     * flush the scene now.  Real apps shouldn't re-use a query in a
 182     * frame of rendering.
 183     */
 184    if (pq->fence && !lp_fence_issued(pq->fence)) {
 185       llvmpipe_finish(pipe, __FUNCTION__);
 186    }
 187
 188
 189    memset(pq->count, 0, sizeof(pq->count));
 190    lp_setup_begin_query(llvmpipe->setup, pq);
 191
 192    switch (pq->type) {
 193    case PIPE_QUERY_PRIMITIVES_EMITTED:
 194       pq->num_primitives_written = 0;
 195       llvmpipe->so_stats.num_primitives_written = 0;
 196       break;
 197    case PIPE_QUERY_PRIMITIVES_GENERATED:
 198       pq->num_primitives_generated = 0;
 199       llvmpipe->num_primitives_generated = 0;
 200       break;
 201    case PIPE_QUERY_SO_STATISTICS:
 202       pq->num_primitives_written = 0;
 203       llvmpipe->so_stats.num_primitives_written = 0;
 204       pq->num_primitives_generated = 0;
 205       llvmpipe->num_primitives_generated = 0;
 206       break;
 207    case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
 208       pq->so_has_overflown = FALSE;
 209       break;
 210    case PIPE_QUERY_PIPELINE_STATISTICS:
 211       /* reset our cache */
 212       if (llvmpipe->active_statistics_queries == 0) {
 213          memset(&llvmpipe->pipeline_statistics, 0,
 214                 sizeof(llvmpipe->pipeline_statistics));
 215       }
 216       memcpy(&pq->stats, &llvmpipe->pipeline_statistics, sizeof(pq->stats));
 217       llvmpipe->active_statistics_queries++;
 218       break;
 219    case PIPE_QUERY_OCCLUSION_COUNTER:
 220    case PIPE_QUERY_OCCLUSION_PREDICATE:
 221       /* Both active at same time will still fail all over the place.
 222        * Then again several of each type can be active too... */
 223       llvmpipe->active_occlusion_query++;
 224       llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
 225       break;
 226    default:
 227       break;
 228    }
 229 }
 230
 231
 232 static void
 233 llvmpipe_end_query(struct pipe_context *pipe, struct pipe_query *q)
 234 {
 235    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 236    struct llvmpipe_query *pq = llvmpipe_query(q);
 237
 238    lp_setup_end_query(llvmpipe->setup, pq);
 239
 240    switch (pq->type) {
 241
 242    case PIPE_QUERY_PRIMITIVES_EMITTED:
 243       pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
 244       break;
 245    case PIPE_QUERY_PRIMITIVES_GENERATED:
 246       pq->num_primitives_generated = llvmpipe->num_primitives_generated;
 247       break;
 248    case PIPE_QUERY_SO_STATISTICS:
 249       pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
 250       pq->num_primitives_generated = llvmpipe->num_primitives_generated;
 251       break;
 252    case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
 253       pq->so_has_overflown = (llvmpipe->num_primitives_generated >
 254                               llvmpipe->so_stats.num_primitives_written);
 255       break;
 256    case PIPE_QUERY_PIPELINE_STATISTICS:
 257       pq->stats.ia_vertices =
 258          llvmpipe->pipeline_statistics.ia_vertices - pq->stats.ia_vertices;
 259       pq->stats.ia_primitives =
 260          llvmpipe->pipeline_statistics.ia_primitives - pq->stats.ia_primitives;
 261       pq->stats.vs_invocations =
 262          llvmpipe->pipeline_statistics.vs_invocations - pq->stats.vs_invocations;
 263       pq->stats.gs_invocations =
 264          llvmpipe->pipeline_statistics.gs_invocations - pq->stats.gs_invocations;
 265       pq->stats.gs_primitives =
 266          llvmpipe->pipeline_statistics.gs_primitives - pq->stats.gs_primitives;
 267       pq->stats.c_invocations =
 268          llvmpipe->pipeline_statistics.c_invocations - pq->stats.c_invocations;
 269       pq->stats.c_primitives =
 270          llvmpipe->pipeline_statistics.c_primitives - pq->stats.c_primitives;
 271       pq->stats.ps_invocations =
 272          llvmpipe->pipeline_statistics.ps_invocations - pq->stats.ps_invocations;
 273
 274       llvmpipe->active_statistics_queries--;
 275       break;
 276    case PIPE_QUERY_OCCLUSION_COUNTER:
 277    case PIPE_QUERY_OCCLUSION_PREDICATE:
 278       assert(llvmpipe->active_occlusion_query);
 279       llvmpipe->active_occlusion_query--;
 280       llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
 281       break;
 282    default:
 283       break;
 284    }
 285 }
 286
 287 boolean
 288 llvmpipe_check_render_cond(struct llvmpipe_context *lp)
 289 {
 290    struct pipe_context *pipe = &lp->pipe;
 291    boolean b, wait;
 292    uint64_t result;
 293
 294    if (!lp->render_cond_query)
 295       return TRUE; /* no query predicate, draw normally */
 296
 297    wait = (lp->render_cond_mode == PIPE_RENDER_COND_WAIT ||
 298            lp->render_cond_mode == PIPE_RENDER_COND_BY_REGION_WAIT);
 299
 300    b = pipe->get_query_result(pipe, lp->render_cond_query, wait, (void*)&result);
 301    if (b)
 302       return (!result == lp->render_cond_cond);
 303    else
 304       return TRUE;
 305 }
 306
 307 void llvmpipe_init_query_funcs(struct llvmpipe_context *llvmpipe )
 308 {
 309    llvmpipe->pipe.create_query = llvmpipe_create_query;
 310    llvmpipe->pipe.destroy_query = llvmpipe_destroy_query;
 311    llvmpipe->pipe.begin_query = llvmpipe_begin_query;
 312    llvmpipe->pipe.end_query = llvmpipe_end_query;
 313    llvmpipe->pipe.get_query_result = llvmpipe_get_query_result;
 314 }
 315
 316