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
|
/*
* Copyright © 2018 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.
*/
#include "nir.h"
#include "nir_builder.h"
static bool
assert_ssa_def_is_not_1bit(nir_ssa_def *def, UNUSED void *unused)
{
assert(def->bit_size > 1);
return true;
}
static bool
rewrite_1bit_ssa_def_to_32bit(nir_ssa_def *def, void *_progress)
{
bool *progress = _progress;
if (def->bit_size == 1) {
def->bit_size = 32;
*progress = true;
}
return true;
}
static bool
lower_alu_instr(nir_alu_instr *alu)
{
const nir_op_info *op_info = &nir_op_infos[alu->op];
assert(alu->dest.dest.is_ssa);
switch (alu->op) {
case nir_op_mov:
case nir_op_vec2:
case nir_op_vec3:
case nir_op_vec4:
case nir_op_vec5:
case nir_op_vec8:
case nir_op_vec16:
case nir_op_inot:
case nir_op_iand:
case nir_op_ior:
case nir_op_ixor:
if (alu->dest.dest.ssa.bit_size != 1)
return false;
/* These we expect to have booleans but the opcode doesn't change */
break;
case nir_op_b2b32:
case nir_op_b2b1:
/* We're mutating instructions in a dominance-preserving order so our
* source boolean should be 32-bit by now.
*/
assert(nir_src_bit_size(alu->src[0].src) == 32);
alu->op = nir_op_mov;
break;
case nir_op_flt: alu->op = nir_op_flt32; break;
case nir_op_fge: alu->op = nir_op_fge32; break;
case nir_op_feq: alu->op = nir_op_feq32; break;
case nir_op_fneu: alu->op = nir_op_fneu32; break;
case nir_op_ilt: alu->op = nir_op_ilt32; break;
case nir_op_ige: alu->op = nir_op_ige32; break;
case nir_op_ieq: alu->op = nir_op_ieq32; break;
case nir_op_ine: alu->op = nir_op_ine32; break;
case nir_op_ult: alu->op = nir_op_ult32; break;
case nir_op_uge: alu->op = nir_op_uge32; break;
case nir_op_ball_fequal2: alu->op = nir_op_b32all_fequal2; break;
case nir_op_ball_fequal3: alu->op = nir_op_b32all_fequal3; break;
case nir_op_ball_fequal4: alu->op = nir_op_b32all_fequal4; break;
case nir_op_bany_fnequal2: alu->op = nir_op_b32any_fnequal2; break;
case nir_op_bany_fnequal3: alu->op = nir_op_b32any_fnequal3; break;
case nir_op_bany_fnequal4: alu->op = nir_op_b32any_fnequal4; break;
case nir_op_ball_iequal2: alu->op = nir_op_b32all_iequal2; break;
case nir_op_ball_iequal3: alu->op = nir_op_b32all_iequal3; break;
case nir_op_ball_iequal4: alu->op = nir_op_b32all_iequal4; break;
case nir_op_bany_inequal2: alu->op = nir_op_b32any_inequal2; break;
case nir_op_bany_inequal3: alu->op = nir_op_b32any_inequal3; break;
case nir_op_bany_inequal4: alu->op = nir_op_b32any_inequal4; break;
case nir_op_bcsel: alu->op = nir_op_b32csel; break;
case nir_op_fisfinite: alu->op = nir_op_fisfinite32; break;
default:
assert(alu->dest.dest.ssa.bit_size > 1);
for (unsigned i = 0; i < op_info->num_inputs; i++)
assert(alu->src[i].src.ssa->bit_size > 1);
return false;
}
if (alu->dest.dest.ssa.bit_size == 1)
alu->dest.dest.ssa.bit_size = 32;
return true;
}
static bool
lower_tex_instr(nir_tex_instr *tex)
{
bool progress = false;
rewrite_1bit_ssa_def_to_32bit(&tex->dest.ssa, &progress);
if (tex->dest_type == nir_type_bool1) {
tex->dest_type = nir_type_bool32;
progress = true;
}
return progress;
}
static bool
nir_lower_bool_to_int32_instr(UNUSED nir_builder *b,
nir_instr *instr,
UNUSED void *cb_data)
{
switch (instr->type) {
case nir_instr_type_alu:
return lower_alu_instr(nir_instr_as_alu(instr));
case nir_instr_type_load_const: {
nir_load_const_instr *load = nir_instr_as_load_const(instr);
if (load->def.bit_size == 1) {
nir_const_value *value = load->value;
for (unsigned i = 0; i < load->def.num_components; i++)
load->value[i].u32 = value[i].b ? NIR_TRUE : NIR_FALSE;
load->def.bit_size = 32;
return true;
}
return false;
}
case nir_instr_type_intrinsic:
case nir_instr_type_ssa_undef:
case nir_instr_type_phi: {
bool progress = false;
nir_foreach_ssa_def(instr, rewrite_1bit_ssa_def_to_32bit, &progress);
return progress;
}
case nir_instr_type_tex:
return lower_tex_instr(nir_instr_as_tex(instr));
default:
nir_foreach_ssa_def(instr, assert_ssa_def_is_not_1bit, NULL);
return false;
}
}
bool
nir_lower_bool_to_int32(nir_shader *shader)
{
nir_foreach_function(func, shader) {
for (unsigned idx = 0; idx < func->num_params; idx++) {
nir_parameter *param = &func->params[idx];
if (param->bit_size == 1)
param->bit_size = 32;
}
}
return nir_shader_instructions_pass(shader, nir_lower_bool_to_int32_instr,
nir_metadata_block_index |
nir_metadata_dominance,
NULL);
}
|
