2 * Copyright 2009 Corbin Simpson <MostAwesomeDude@gmail.com>
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:
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
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. */
23 #include "util/u_memory.h"
24 #include "util/u_simple_list.h"
26 #include "r300_context.h"
27 #include "r300_screen.h"
28 #include "r300_emit.h"
32 static struct pipe_query *r300_create_query(struct pipe_context *pipe,
35 struct r300_context *r300 = r300_context(pipe);
36 struct r300_screen *r300screen = r300->screen;
38 struct r300_query *q, *qptr;
40 q = CALLOC_STRUCT(r300_query);
43 assert(q->type == PIPE_QUERY_OCCLUSION_COUNTER);
45 if (r300screen->caps.family == CHIP_FAMILY_RV530)
46 query_size = r300screen->caps.num_z_pipes * sizeof(uint32_t);
48 query_size = r300screen->caps.num_frag_pipes * sizeof(uint32_t);
50 if (!is_empty_list(&r300->query_list)) {
51 qptr = last_elem(&r300->query_list);
52 q->offset = qptr->offset + query_size;
54 insert_at_tail(&r300->query_list, q);
57 if (q->offset >= 4096) {
59 fprintf(stderr, "r300: Rewinding OQBO...\n");
62 return (struct pipe_query*)q;
65 static void r300_destroy_query(struct pipe_context* pipe,
66 struct pipe_query* query)
68 struct r300_query* q = (struct r300_query*)query;
74 static void r300_begin_query(struct pipe_context* pipe,
75 struct pipe_query* query)
78 struct r300_context* r300 = r300_context(pipe);
79 struct r300_query* q = (struct r300_query*)query;
81 if (r300->query_current != NULL) {
82 fprintf(stderr, "r300: begin_query: "
83 "Some other query has already been started.\n");
88 pipe_buffer_write(pipe,
95 r300->query_current = q;
96 r300->query_start.dirty = TRUE;
99 static void r300_end_query(struct pipe_context* pipe,
100 struct pipe_query* query)
102 struct r300_context* r300 = r300_context(pipe);
104 if ((struct r300_query*)query != r300->query_current) {
105 fprintf(stderr, "r300: end_query: Got invalid query.\n");
110 r300_emit_query_end(r300);
111 r300->query_current = NULL;
114 static boolean r300_get_query_result(struct pipe_context* pipe,
115 struct pipe_query* query,
119 struct r300_context* r300 = r300_context(pipe);
120 struct r300_screen* r300screen = r300->screen;
121 struct r300_query *q = (struct r300_query*)query;
122 struct pipe_transfer *transfer;
123 unsigned flags = PIPE_TRANSFER_READ;
126 unsigned i, num_results;
127 uint64_t *result = (uint64_t*)vresult;
129 if (q->flushed == FALSE)
130 pipe->flush(pipe, 0, NULL);
132 flags |= PIPE_TRANSFER_DONTBLOCK;
135 map = pipe_buffer_map(pipe, r300->oqbo, flags, &transfer);
138 map += q->offset / 4;
140 if (r300screen->caps.family == CHIP_FAMILY_RV530)
141 num_results = r300screen->caps.num_z_pipes;
143 num_results = r300screen->caps.num_frag_pipes;
145 for (i = 0; i < num_results; i++) {
147 /* Looks like our results aren't ready yet. */
149 fprintf(stderr, "r300: Despite waiting, OQ results haven't "
150 "come in yet. This is a driver bug.\n"
151 "r300: Returning bogus results to avoid "
152 "a possible infinite loop...\n");
162 pipe_buffer_unmap(pipe, r300->oqbo, transfer);
165 /* Our results haven't been written yet... */
173 static void r300_render_condition(struct pipe_context *pipe,
174 struct pipe_query *query,
177 struct r300_context *r300 = r300_context(pipe);
182 wait = mode == PIPE_RENDER_COND_WAIT ||
183 mode == PIPE_RENDER_COND_BY_REGION_WAIT;
185 if (!r300_get_query_result(pipe, query, wait, &result)) {
186 r300->skip_rendering = FALSE;
189 r300->skip_rendering = result == 0;
191 r300->skip_rendering = FALSE;
195 void r300_init_query_functions(struct r300_context* r300) {
196 r300->context.create_query = r300_create_query;
197 r300->context.destroy_query = r300_destroy_query;
198 r300->context.begin_query = r300_begin_query;
199 r300->context.end_query = r300_end_query;
200 r300->context.get_query_result = r300_get_query_result;
201 r300->context.render_condition = r300_render_condition;