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