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 #include "lp_rast.h"
  44
  45
  46 static struct llvmpipe_query *llvmpipe_query( struct pipe_query *p )
  47 {
  48    return (struct llvmpipe_query *)p;
  49 }
  50
  51 static struct pipe_query *
  52 llvmpipe_create_query(struct pipe_context *pipe,
  53                       unsigned type)
  54 {
  55    struct llvmpipe_query *pq;
  56
  57    assert(type < PIPE_QUERY_TYPES);
  58
  59    pq = CALLOC_STRUCT( llvmpipe_query );
  60
  61    if (pq) {
  62       pq->type = type;
  63    }
  64
  65    return (struct pipe_query *) pq;
  66 }
  67
  68
  69 static void
  70 llvmpipe_destroy_query(struct pipe_context *pipe, struct pipe_query *q)
  71 {
  72    struct llvmpipe_query *pq = llvmpipe_query(q);
  73
  74    /* Ideally we would refcount queries & not get destroyed until the
  75     * last scene had finished with us.
  76     */
  77    if (pq->fence) {
  78       if (!lp_fence_issued(pq->fence))
  79          llvmpipe_flush(pipe, NULL, __FUNCTION__);
  80
  81       if (!lp_fence_signalled(pq->fence))
  82          lp_fence_wait(pq->fence);
  83
  84       lp_fence_reference(&pq->fence, NULL);
  85    }
  86
  87    FREE(pq);
  88 }
  89
  90
  91 static boolean
  92 llvmpipe_get_query_result(struct pipe_context *pipe,
  93                           struct pipe_query *q,
  94                           boolean wait,
  95                           union pipe_query_result *vresult)
  96 {
  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;
 101    int i;
 102
 103    if (pq->fence) {
 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__);
 108
 109          if (!wait)
 110             return FALSE;
 111
 112          lp_fence_wait(pq->fence);
 113       }
 114    }
 115
 116    /* Sum the results from each of the threads:
 117     */
 118    *result = 0;
 119
 120    switch (pq->type) {
 121    case PIPE_QUERY_OCCLUSION_COUNTER:
 122       for (i = 0; i < num_threads; i++) {
 123          *result += pq->end[i];
 124       }
 125       break;
 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];
 130       }
 131       break;
 132    case PIPE_QUERY_TIMESTAMP:
 133       for (i = 0; i < num_threads; i++) {
 134          if (pq->end[i] > *result) {
 135             *result = pq->end[i];
 136          }
 137          if (*result == 0)
 138             *result = os_time_get_nano();
 139       }
 140       break;
 141    case PIPE_QUERY_TIMESTAMP_DISJOINT: {
 142       struct pipe_query_data_timestamp_disjoint *td =
 143          (struct pipe_query_data_timestamp_disjoint *)vresult;
 144       /* os_get_time_nano return nanoseconds */
 145       td->frequency = UINT64_C(1000000000);
 146       td->disjoint = FALSE;
 147    }
 148       break;
 149    case PIPE_QUERY_GPU_FINISHED:
 150       vresult->b = TRUE;
 151       break;
 152    case PIPE_QUERY_PRIMITIVES_GENERATED:
 153       *result = pq->num_primitives_generated;
 154       break;
 155    case PIPE_QUERY_PRIMITIVES_EMITTED:
 156       *result = pq->num_primitives_written;
 157       break;
 158    case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
 159       vresult->b = pq->so_has_overflown;
 160       break;
 161    case PIPE_QUERY_SO_STATISTICS: {
 162       struct pipe_query_data_so_statistics *stats =
 163          (struct pipe_query_data_so_statistics *)vresult;
 164       stats->num_primitives_written = pq->num_primitives_written;
 165       stats->primitives_storage_needed = pq->num_primitives_generated;
 166    }
 167       break;
 168    case PIPE_QUERY_PIPELINE_STATISTICS: {
 169       struct pipe_query_data_pipeline_statistics *stats =
 170          (struct pipe_query_data_pipeline_statistics *)vresult;
 171       /* only ps_invocations come from binned query */
 172       for (i = 0; i < num_threads; i++) {
 173          pq->stats.ps_invocations += pq->end[i];
 174       }
 175       pq->stats.ps_invocations *= LP_RASTER_BLOCK_SIZE * LP_RASTER_BLOCK_SIZE;
 176       *stats = pq->stats;
 177    }
 178       break;
 179    default:
 180       assert(0);
 181       break;
 182    }
 183
 184    return TRUE;
 185 }
 186
 187
 188 static void
 189 llvmpipe_begin_query(struct pipe_context *pipe, struct pipe_query *q)
 190 {
 191    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 192    struct llvmpipe_query *pq = llvmpipe_query(q);
 193
 194    /* Check if the query is already in the scene.  If so, we need to
 195     * flush the scene now.  Real apps shouldn't re-use a query in a
 196     * frame of rendering.
 197     */
 198    if (pq->fence && !lp_fence_issued(pq->fence)) {
 199       llvmpipe_finish(pipe, __FUNCTION__);
 200    }
 201
 202
 203    memset(pq->start, 0, sizeof(pq->start));
 204    memset(pq->end, 0, sizeof(pq->end));
 205    lp_setup_begin_query(llvmpipe->setup, pq);
 206
 207    switch (pq->type) {
 208    case PIPE_QUERY_PRIMITIVES_EMITTED:
 209       pq->num_primitives_written = 0;
 210       llvmpipe->so_stats.num_primitives_written = 0;
 211       break;
 212    case PIPE_QUERY_PRIMITIVES_GENERATED:
 213       pq->num_primitives_generated = 0;
 214       llvmpipe->num_primitives_generated = 0;
 215       break;
 216    case PIPE_QUERY_SO_STATISTICS:
 217       pq->num_primitives_written = 0;
 218       llvmpipe->so_stats.num_primitives_written = 0;
 219       pq->num_primitives_generated = 0;
 220       llvmpipe->num_primitives_generated = 0;
 221       break;
 222    case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
 223       pq->so_has_overflown = FALSE;
 224       break;
 225    case PIPE_QUERY_PIPELINE_STATISTICS:
 226       /* reset our cache */
 227       if (llvmpipe->active_statistics_queries == 0) {
 228          memset(&llvmpipe->pipeline_statistics, 0,
 229                 sizeof(llvmpipe->pipeline_statistics));
 230       }
 231       memcpy(&pq->stats, &llvmpipe->pipeline_statistics, sizeof(pq->stats));
 232       llvmpipe->active_statistics_queries++;
 233       break;
 234    case PIPE_QUERY_OCCLUSION_COUNTER:
 235    case PIPE_QUERY_OCCLUSION_PREDICATE:
 236       llvmpipe->active_occlusion_query++;
 237       llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
 238       break;
 239    default:
 240       break;
 241    }
 242 }
 243
 244
 245 static void
 246 llvmpipe_end_query(struct pipe_context *pipe, struct pipe_query *q)
 247 {
 248    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 249    struct llvmpipe_query *pq = llvmpipe_query(q);
 250
 251    lp_setup_end_query(llvmpipe->setup, pq);
 252
 253    switch (pq->type) {
 254
 255    case PIPE_QUERY_PRIMITIVES_EMITTED:
 256       pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
 257       break;
 258    case PIPE_QUERY_PRIMITIVES_GENERATED:
 259       pq->num_primitives_generated = llvmpipe->num_primitives_generated;
 260       break;
 261    case PIPE_QUERY_SO_STATISTICS:
 262       pq->num_primitives_written = llvmpipe->so_stats.num_primitives_written;
 263       pq->num_primitives_generated = llvmpipe->num_primitives_generated;
 264       break;
 265    case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
 266       pq->so_has_overflown = (llvmpipe->num_primitives_generated >
 267                               llvmpipe->so_stats.num_primitives_written);
 268       break;
 269    case PIPE_QUERY_PIPELINE_STATISTICS:
 270       pq->stats.ia_vertices =
 271          llvmpipe->pipeline_statistics.ia_vertices - pq->stats.ia_vertices;
 272       pq->stats.ia_primitives =
 273          llvmpipe->pipeline_statistics.ia_primitives - pq->stats.ia_primitives;
 274       pq->stats.vs_invocations =
 275          llvmpipe->pipeline_statistics.vs_invocations - pq->stats.vs_invocations;
 276       pq->stats.gs_invocations =
 277          llvmpipe->pipeline_statistics.gs_invocations - pq->stats.gs_invocations;
 278       pq->stats.gs_primitives =
 279          llvmpipe->pipeline_statistics.gs_primitives - pq->stats.gs_primitives;
 280       pq->stats.c_invocations =
 281          llvmpipe->pipeline_statistics.c_invocations - pq->stats.c_invocations;
 282       pq->stats.c_primitives =
 283          llvmpipe->pipeline_statistics.c_primitives - pq->stats.c_primitives;
 284       pq->stats.ps_invocations =
 285          llvmpipe->pipeline_statistics.ps_invocations - pq->stats.ps_invocations;
 286
 287       llvmpipe->active_statistics_queries--;
 288       break;
 289    case PIPE_QUERY_OCCLUSION_COUNTER:
 290    case PIPE_QUERY_OCCLUSION_PREDICATE:
 291       assert(llvmpipe->active_occlusion_query);
 292       llvmpipe->active_occlusion_query--;
 293       llvmpipe->dirty |= LP_NEW_OCCLUSION_QUERY;
 294       break;
 295    default:
 296       break;
 297    }
 298 }
 299
 300 boolean
 301 llvmpipe_check_render_cond(struct llvmpipe_context *lp)
 302 {
 303    struct pipe_context *pipe = &lp->pipe;
 304    boolean b, wait;
 305    uint64_t result;
 306
 307    if (!lp->render_cond_query)
 308       return TRUE; /* no query predicate, draw normally */
 309
 310    wait = (lp->render_cond_mode == PIPE_RENDER_COND_WAIT ||
 311            lp->render_cond_mode == PIPE_RENDER_COND_BY_REGION_WAIT);
 312
 313    b = pipe->get_query_result(pipe, lp->render_cond_query, wait, (void*)&result);
 314    if (b)
 315       return (!result == lp->render_cond_cond);
 316    else
 317       return TRUE;
 318 }
 319
 320 void llvmpipe_init_query_funcs(struct llvmpipe_context *llvmpipe )
 321 {
 322    llvmpipe->pipe.create_query = llvmpipe_create_query;
 323    llvmpipe->pipe.destroy_query = llvmpipe_destroy_query;
 324    llvmpipe->pipe.begin_query = llvmpipe_begin_query;
 325    llvmpipe->pipe.end_query = llvmpipe_end_query;
 326    llvmpipe->pipe.get_query_result = llvmpipe_get_query_result;
 327 }
 328
 329