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 "lp_context.h"
  37 #include "lp_flush.h"
  38 #include "lp_query.h"
  39 #include "lp_rast.h"
  40 #include "lp_rast_priv.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_OCCLUSION_COUNTER);
  56
  57    pq = CALLOC_STRUCT( llvmpipe_query );
  58    if (pq) {
  59       pipe_mutex_init(pq->mutex);
  60    }
  61
  62    return (struct pipe_query *) pq;
  63 }
  64
  65
  66 static void
  67 llvmpipe_destroy_query(struct pipe_context *pipe, struct pipe_query *q)
  68 {
  69    struct llvmpipe_query *pq = llvmpipe_query(q);
  70    /* query might still be in process if we never waited for the result */
  71    if (!pq->done) {
  72      struct pipe_fence_handle *fence = NULL;
  73      llvmpipe_flush(pipe, 0, &fence);
  74      if (fence) {
  75          pipe->screen->fence_finish(pipe->screen, fence, 0);
  76          pipe->screen->fence_reference(pipe->screen, &fence, NULL);
  77       }
  78    }
  79
  80    pipe_mutex_destroy(pq->mutex);
  81    FREE(pq);
  82 }
  83
  84
  85 static boolean
  86 llvmpipe_get_query_result(struct pipe_context *pipe,
  87                           struct pipe_query *q,
  88                           boolean wait,
  89                           void *vresult)
  90 {
  91    struct llvmpipe_query *pq = llvmpipe_query(q);
  92    uint64_t *result = (uint64_t *)vresult;
  93
  94    if (!pq->done) {
  95       if (wait) {
  96          struct pipe_fence_handle *fence = NULL;
  97          llvmpipe_flush(pipe, 0, &fence);
  98          if (fence) {
  99             pipe->screen->fence_finish(pipe->screen, fence, 0);
 100             pipe->screen->fence_reference(pipe->screen, &fence, NULL);
 101          }
 102       }
 103       /* this is a bit inconsequent but should be ok */
 104       else {
 105          llvmpipe_flush(pipe, 0, NULL);
 106       }
 107    }
 108
 109    if (pq->done) {
 110       *result = pq->result;
 111    }
 112
 113    return pq->done;
 114 }
 115
 116
 117 static void
 118 llvmpipe_begin_query(struct pipe_context *pipe, struct pipe_query *q)
 119 {
 120    struct llvmpipe_context *llvmpipe = llvmpipe_context( pipe );
 121    struct llvmpipe_query *pq = llvmpipe_query(q);
 122
 123    /* Check if the query is already in the scene.  If so, we need to
 124     * flush the scene now.  Real apps shouldn't re-use a query in a
 125     * frame of rendering.
 126     */
 127    if (pq->binned) {
 128       struct pipe_fence_handle *fence;
 129       llvmpipe_flush(pipe, 0, &fence);
 130       if (fence) {
 131          pipe->screen->fence_finish(pipe->screen, fence, 0);
 132          pipe->screen->fence_reference(pipe->screen, &fence, NULL);
 133       }
 134    }
 135
 136    lp_setup_begin_query(llvmpipe->setup, pq);
 137
 138    llvmpipe->active_query_count++;
 139    llvmpipe->dirty |= LP_NEW_QUERY;
 140 }
 141
 142
 143 static void
 144 llvmpipe_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
 157 void 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