src/gallium/drivers/r300/r300_query.c

   1 /*
   2  * Copyright 2009 Corbin Simpson <MostAwesomeDude@gmail.com>
   3  *
   4  * Permission is hereby granted, free of charge, to any person obtaining a
   5  * copy of this software and associated documentation files (the "Software"),
   6  * to deal in the Software without restriction, including without limitation
   7  * on the rights to use, copy, modify, merge, publish, distribute, sub
   8  * license, and/or sell copies of the Software, and to permit persons to whom
   9  * the Software is furnished to do so, subject to the following conditions:
  10  *
  11  * The above copyright notice and this permission notice (including the next
  12  * paragraph) shall be included in all copies or substantial portions of the
  13  * Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
  18  * THE AUTHOR(S) AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
  19  * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  20  * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  21  * USE OR OTHER DEALINGS IN THE SOFTWARE. */
  22
  23 #include "util/u_memory.h"
  24 #include "util/u_simple_list.h"
  25
  26 #include "r300_context.h"
  27 #include "r300_screen.h"
  28 #include "r300_cs.h"
  29 #include "r300_emit.h"
  30 #include "r300_query.h"
  31 #include "r300_reg.h"
  32
  33 static struct pipe_query *r300_create_query(struct pipe_context *pipe,
  34                                             unsigned query_type)
  35 {
  36     struct r300_context *r300 = r300_context(pipe);
  37     struct r300_screen *r300screen = r300_screen(r300->context.screen);
  38     unsigned query_size;
  39     struct r300_query *q, *qptr;
  40
  41     q = CALLOC_STRUCT(r300_query);
  42
  43     q->type = query_type;
  44     assert(q->type == PIPE_QUERY_OCCLUSION_COUNTER);
  45
  46     q->active = FALSE;
  47
  48     if (r300screen->caps->family == CHIP_FAMILY_RV530)
  49         query_size = r300screen->caps->num_z_pipes * sizeof(uint32_t);
  50     else
  51         query_size = r300screen->caps->num_frag_pipes * sizeof(uint32_t);
  52
  53     if (!is_empty_list(&r300->query_list)) {
  54         qptr = last_elem(&r300->query_list);
  55         q->offset = qptr->offset + query_size;
  56     }
  57     insert_at_tail(&r300->query_list, q);
  58
  59     /* XXX */
  60     if (q->offset >= 4096) {
  61         q->offset = 0;
  62     }
  63
  64     return (struct pipe_query*)q;
  65 }
  66
  67 static void r300_destroy_query(struct pipe_context* pipe,
  68                                struct pipe_query* query)
  69 {
  70     struct r300_query* q = (struct r300_query*)query;
  71
  72     remove_from_list(q);
  73     FREE(query);
  74 }
  75
  76 static void r300_begin_query(struct pipe_context* pipe,
  77                              struct pipe_query* query)
  78 {
  79     uint32_t* map;
  80     struct r300_context* r300 = r300_context(pipe);
  81     struct r300_query* q = (struct r300_query*)query;
  82
  83     assert(r300->query_current == NULL);
  84
  85     map = pipe->screen->buffer_map(pipe->screen, r300->oqbo,
  86             PIPE_BUFFER_USAGE_CPU_WRITE);
  87     map += q->offset / 4;
  88     *map = ~0U;
  89     pipe->screen->buffer_unmap(pipe->screen, r300->oqbo);
  90
  91     q->flushed = FALSE;
  92     r300->query_current = q;
  93     r300->dirty_state |= R300_NEW_QUERY;
  94 }
  95
  96 static void r300_end_query(struct pipe_context* pipe,
  97                            struct pipe_query* query)
  98 {
  99     struct r300_context* r300 = r300_context(pipe);
 100
 101     r300_emit_query_end(r300);
 102     r300->query_current = NULL;
 103 }
 104
 105 static boolean r300_get_query_result(struct pipe_context* pipe,
 106                                      struct pipe_query* query,
 107                                      boolean wait,
 108                                      uint64_t* result)
 109 {
 110     struct r300_context* r300 = r300_context(pipe);
 111     struct r300_screen* r300screen = r300_screen(r300->context.screen);
 112     struct r300_query *q = (struct r300_query*)query;
 113     unsigned flags = PIPE_BUFFER_USAGE_CPU_READ;
 114     uint32_t* map;
 115     uint32_t temp = 0;
 116     unsigned i;
 117
 118     if (q->flushed == FALSE)
 119         pipe->flush(pipe, 0, NULL);
 120     if (!wait) {
 121         flags |= PIPE_BUFFER_USAGE_DONTBLOCK;
 122     }
 123
 124     map = pipe->screen->buffer_map(pipe->screen, r300->oqbo, flags);
 125     if (!map)
 126         return FALSE;
 127     map += q->offset / 4;
 128     for (i = 0; i < r300screen->caps->num_frag_pipes; i++) {
 129         if (*map == ~0U) {
 130             /* Looks like our results aren't ready yet. */
 131             if (wait) {
 132                 debug_printf("r300: Despite waiting, OQ results haven't"
 133                         " come in yet.\n");
 134             }
 135             temp = ~0U;
 136             break;
 137         }
 138         temp += *map;
 139         map++;
 140     }
 141     pipe->screen->buffer_unmap(pipe->screen, r300->oqbo);
 142
 143     if (temp == ~0U) {
 144         /* Our results haven't been written yet... */
 145         return FALSE;
 146     }
 147
 148     *result = temp;
 149     return TRUE;
 150 }
 151
 152 void r300_init_query_functions(struct r300_context* r300) {
 153     r300->context.create_query = r300_create_query;
 154     r300->context.destroy_query = r300_destroy_query;
 155     r300->context.begin_query = r300_begin_query;
 156     r300->context.end_query = r300_end_query;
 157     r300->context.get_query_result = r300_get_query_result;
 158 }