r300_query.c revision 287c94ea4987033f9c99a2f91c5750c9083504ca
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#include <stdio.h> 34 35static struct pipe_query *r300_create_query(struct pipe_context *pipe, 36 unsigned query_type) 37{ 38 struct r300_context *r300 = r300_context(pipe); 39 struct r300_screen *r300screen = r300->screen; 40 unsigned query_size; 41 struct r300_query *q, *qptr; 42 43 q = CALLOC_STRUCT(r300_query); 44 45 q->type = query_type; 46 assert(q->type == PIPE_QUERY_OCCLUSION_COUNTER); 47 48 q->active = FALSE; 49 50 if (r300screen->caps.family == CHIP_FAMILY_RV530) 51 query_size = r300screen->caps.num_z_pipes * sizeof(uint32_t); 52 else 53 query_size = r300screen->caps.num_frag_pipes * sizeof(uint32_t); 54 55 if (!is_empty_list(&r300->query_list)) { 56 qptr = last_elem(&r300->query_list); 57 q->offset = qptr->offset + query_size; 58 } 59 insert_at_tail(&r300->query_list, q); 60 61 /* XXX */ 62 if (q->offset >= 4096) { 63 q->offset = 0; 64 } 65 66 return (struct pipe_query*)q; 67} 68 69static void r300_destroy_query(struct pipe_context* pipe, 70 struct pipe_query* query) 71{ 72 struct r300_query* q = (struct r300_query*)query; 73 74 remove_from_list(q); 75 FREE(query); 76} 77 78static void r300_begin_query(struct pipe_context* pipe, 79 struct pipe_query* query) 80{ 81 uint32_t value = ~0U; 82 struct r300_context* r300 = r300_context(pipe); 83 struct r300_query* q = (struct r300_query*)query; 84 85 assert(r300->query_current == NULL); 86 87 pipe_buffer_write(pipe, 88 r300->oqbo, 89 q->offset, 90 sizeof value, 91 &value); 92 93 q->flushed = FALSE; 94 r300->query_current = q; 95 r300->dirty_state |= R300_NEW_QUERY; 96} 97 98static void r300_end_query(struct pipe_context* pipe, 99 struct pipe_query* query) 100{ 101 struct r300_context* r300 = r300_context(pipe); 102 struct r300_query* q = (struct r300_query*)query; 103 104 r300_emit_query_end(r300); 105 q->begin_emitted = false; 106 r300->query_current = NULL; 107} 108 109static boolean r300_get_query_result(struct pipe_context* pipe, 110 struct pipe_query* query, 111 boolean wait, 112 uint64_t* result) 113{ 114 struct r300_context* r300 = r300_context(pipe); 115 struct r300_screen* r300screen = r300->screen; 116 struct r300_query *q = (struct r300_query*)query; 117 struct pipe_transfer *transfer; 118 unsigned flags = PIPE_TRANSFER_READ; 119 uint32_t* map; 120 uint32_t temp = 0; 121 unsigned i, num_results; 122 123 if (q->flushed == FALSE) 124 pipe->flush(pipe, 0, NULL); 125 if (!wait) { 126 flags |= PIPE_TRANSFER_DONTBLOCK; 127 } 128 129 map = pipe_buffer_map(pipe, r300->oqbo, flags, &transfer); 130 if (!map) 131 return FALSE; 132 map += q->offset / 4; 133 134 if (r300screen->caps.family == CHIP_FAMILY_RV530) 135 num_results = r300screen->caps.num_z_pipes; 136 else 137 num_results = r300screen->caps.num_frag_pipes; 138 139 for (i = 0; i < num_results; i++) { 140 if (*map == ~0U) { 141 /* Looks like our results aren't ready yet. */ 142 if (wait) { 143 fprintf(stderr, "r300: Despite waiting, OQ results haven't " 144 "come in yet.\n"); 145 } 146 temp = ~0U; 147 break; 148 } 149 temp += *map; 150 map++; 151 } 152 pipe_buffer_unmap(pipe, r300->oqbo, transfer); 153 154 if (temp == ~0U) { 155 /* Our results haven't been written yet... */ 156 return FALSE; 157 } 158 159 *result = temp; 160 return TRUE; 161} 162 163static void r300_render_condition(struct pipe_context *pipe, 164 struct pipe_query *query, 165 uint mode) 166{ 167 struct r300_context *r300 = r300_context(pipe); 168 uint64_t result; 169 boolean wait; 170 171 if (query) { 172 wait = mode == PIPE_RENDER_COND_WAIT || 173 mode == PIPE_RENDER_COND_BY_REGION_WAIT; 174 175 if (!r300_get_query_result(pipe, query, wait, &result)) { 176 r300->skip_rendering = FALSE; 177 } 178 179 r300->skip_rendering = result == 0; 180 } else { 181 r300->skip_rendering = FALSE; 182 } 183} 184 185void r300_init_query_functions(struct r300_context* r300) { 186 r300->context.create_query = r300_create_query; 187 r300->context.destroy_query = r300_destroy_query; 188 r300->context.begin_query = r300_begin_query; 189 r300->context.end_query = r300_end_query; 190 r300->context.get_query_result = r300_get_query_result; 191 r300->context.render_condition = r300_render_condition; 192} 193