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