r300_query.c revision 363ff844753c46ac9c13866627e096b091ea81f8 
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
32static 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    struct r300_query *q;
38
39    if (query_type != PIPE_QUERY_OCCLUSION_COUNTER) {
40        return NULL;
41    }
42
43    q = CALLOC_STRUCT(r300_query);
44    if (!q)
45        return NULL;
46
47    q->type = query_type;
48    q->buffer_size = 4096;
49
50    if (r300screen->caps.family == CHIP_FAMILY_RV530)
51        q->num_pipes = r300screen->info.r300_num_z_pipes;
52    else
53        q->num_pipes = r300screen->info.r300_num_gb_pipes;
54
55    insert_at_tail(&r300->query_list, q);
56
57    /* Open up the occlusion query buffer. */
58    q->buf = r300->rws->buffer_create(r300->rws, q->buffer_size, 4096,
59                                         PIPE_BIND_CUSTOM, PIPE_USAGE_STAGING);
60    q->cs_buf = r300->rws->buffer_get_cs_handle(q->buf);
61
62    return (struct pipe_query*)q;
63}
64
65static void r300_destroy_query(struct pipe_context* pipe,
66                               struct pipe_query* query)
67{
68    struct r300_query* q = r300_query(query);
69
70    pb_reference(&q->buf, NULL);
71    remove_from_list(q);
72    FREE(query);
73}
74
75void r300_resume_query(struct r300_context *r300,
76                       struct r300_query *query)
77{
78    r300->query_current = query;
79    r300_mark_atom_dirty(r300, &r300->query_start);
80}
81
82static void r300_begin_query(struct pipe_context* pipe,
83                             struct pipe_query* query)
84{
85    struct r300_context* r300 = r300_context(pipe);
86    struct r300_query* q = r300_query(query);
87
88    if (r300->query_current != NULL) {
89        fprintf(stderr, "r300: begin_query: "
90                "Some other query has already been started.\n");
91        assert(0);
92        return;
93    }
94
95    q->num_results = 0;
96    r300_resume_query(r300, q);
97}
98
99void r300_stop_query(struct r300_context *r300)
100{
101    r300_emit_query_end(r300);
102    r300->query_current = NULL;
103}
104
105static void r300_end_query(struct pipe_context* pipe,
106	                   struct pipe_query* query)
107{
108    struct r300_context* r300 = r300_context(pipe);
109    struct r300_query *q = r300_query(query);
110
111    if (q != r300->query_current) {
112        fprintf(stderr, "r300: end_query: Got invalid query.\n");
113        assert(0);
114        return;
115    }
116
117    r300_stop_query(r300);
118}
119
120static boolean r300_get_query_result(struct pipe_context* pipe,
121                                     struct pipe_query* query,
122                                     boolean wait,
123                                     void* vresult)
124{
125    struct r300_context* r300 = r300_context(pipe);
126    struct r300_query *q = r300_query(query);
127    unsigned i;
128    uint32_t temp, *map;
129
130    map = r300->rws->buffer_map(q->buf, r300->cs,
131                                PIPE_TRANSFER_READ |
132                                (!wait ? PIPE_TRANSFER_DONTBLOCK : 0));
133    if (!map)
134        return FALSE;
135
136    /* Sum up the results. */
137    temp = 0;
138    for (i = 0; i < q->num_results; i++) {
139        temp += *map;
140        map++;
141    }
142
143    r300->rws->buffer_unmap(q->buf);
144
145    *((uint64_t*)vresult) = temp;
146    return TRUE;
147}
148
149static void r300_render_condition(struct pipe_context *pipe,
150                                  struct pipe_query *query,
151                                  uint mode)
152{
153    struct r300_context *r300 = r300_context(pipe);
154    uint64_t result = 0;
155    boolean wait;
156
157    r300->skip_rendering = FALSE;
158
159    if (query) {
160        wait = mode == PIPE_RENDER_COND_WAIT ||
161               mode == PIPE_RENDER_COND_BY_REGION_WAIT;
162
163        if (r300_get_query_result(pipe, query, wait, &result)) {
164            r300->skip_rendering = result == 0;
165        }
166    }
167}
168
169void r300_init_query_functions(struct r300_context* r300) {
170    r300->context.create_query = r300_create_query;
171    r300->context.destroy_query = r300_destroy_query;
172    r300->context.begin_query = r300_begin_query;
173    r300->context.end_query = r300_end_query;
174    r300->context.get_query_result = r300_get_query_result;
175    r300->context.render_condition = r300_render_condition;
176}
177