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