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