1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/*
* Copyright © 2010 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
/**
* \file lower_discard.cpp
*
* This pass moves discards out of if-statements.
*
* Case 1: The "then" branch contains a conditional discard:
* ---------------------------------------------------------
*
* if (cond1) {
* s1;
* discard cond2;
* s2;
* } else {
* s3;
* }
*
* becomes:
*
* temp = false;
* if (cond1) {
* s1;
* temp = cond2;
* s2;
* } else {
* s3;
* }
* discard temp;
*
* Case 2: The "else" branch contains a conditional discard:
* ---------------------------------------------------------
*
* if (cond1) {
* s1;
* } else {
* s2;
* discard cond2;
* s3;
* }
*
* becomes:
*
* temp = false;
* if (cond1) {
* s1;
* } else {
* s2;
* temp = cond2;
* s3;
* }
* discard temp;
*
* Case 3: Both branches contain a conditional discard:
* ----------------------------------------------------
*
* if (cond1) {
* s1;
* discard cond2;
* s2;
* } else {
* s3;
* discard cond3;
* s4;
* }
*
* becomes:
*
* temp = false;
* if (cond1) {
* s1;
* temp = cond2;
* s2;
* } else {
* s3;
* temp = cond3;
* s4;
* }
* discard temp;
*
* If there are multiple conditional discards, we need only deal with one of
* them. Repeatedly applying this pass will take care of the others.
*
* Unconditional discards are treated as having a condition of "true".
*/
#include "compiler/glsl_types.h"
#include "ir.h"
namespace {
class lower_discard_visitor : public ir_hierarchical_visitor {
public:
lower_discard_visitor()
{
this->progress = false;
}
ir_visitor_status visit_leave(ir_if *);
bool progress;
};
} /* anonymous namespace */
bool
lower_discard(exec_list *instructions)
{
lower_discard_visitor v;
visit_list_elements(&v, instructions);
return v.progress;
}
static ir_discard *
find_discard(exec_list &instructions)
{
foreach_in_list(ir_instruction, node, &instructions) {
ir_discard *ir = node->as_discard();
if (ir != NULL)
return ir;
}
return NULL;
}
static void
replace_discard(void *mem_ctx, ir_variable *var, ir_discard *ir)
{
ir_rvalue *condition = ir->condition;
/* For unconditional discards, use "true" as the condition. */
if (condition == NULL)
condition = new(mem_ctx) ir_constant(true);
ir_assignment *assignment =
new(mem_ctx) ir_assignment(new(mem_ctx) ir_dereference_variable(var),
condition, NULL);
ir->replace_with(assignment);
}
ir_visitor_status
lower_discard_visitor::visit_leave(ir_if *ir)
{
ir_discard *then_discard = find_discard(ir->then_instructions);
ir_discard *else_discard = find_discard(ir->else_instructions);
if (then_discard == NULL && else_discard == NULL)
return visit_continue;
void *mem_ctx = ralloc_parent(ir);
ir_variable *temp = new(mem_ctx) ir_variable(glsl_type::bool_type,
"discard_cond_temp",
ir_var_temporary);
ir_assignment *temp_initializer =
new(mem_ctx) ir_assignment(new(mem_ctx) ir_dereference_variable(temp),
new(mem_ctx) ir_constant(false), NULL);
ir->insert_before(temp);
ir->insert_before(temp_initializer);
if (then_discard != NULL)
replace_discard(mem_ctx, temp, then_discard);
if (else_discard != NULL)
replace_discard(mem_ctx, temp, else_discard);
ir_discard *discard = then_discard != NULL ? then_discard : else_discard;
discard->condition = new(mem_ctx) ir_dereference_variable(temp);
ir->insert_after(discard);
this->progress = true;
return visit_continue;
}
|
