2 * Copyright © 2016 Red Hat
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 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
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
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 NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24 * Rob Clark <robclark@freedesktop.org>
27 #ifndef _NIR_SEARCH_HELPERS_
28 #define _NIR_SEARCH_HELPERS_
31 #include "util/bitscan.h"
32 #include "nir_range_analysis.h"
36 is_pos_power_of_two(UNUSED
struct hash_table
*ht
, nir_alu_instr
*instr
,
37 unsigned src
, unsigned num_components
,
38 const uint8_t *swizzle
)
40 /* only constant srcs: */
41 if (!nir_src_is_const(instr
->src
[src
].src
))
44 for (unsigned i
= 0; i
< num_components
; i
++) {
45 nir_alu_type type
= nir_op_infos
[instr
->op
].input_types
[src
];
46 switch (nir_alu_type_get_base_type(type
)) {
48 int64_t val
= nir_src_comp_as_int(instr
->src
[src
].src
, swizzle
[i
]);
49 if (val
<= 0 || !util_is_power_of_two_or_zero64(val
))
54 uint64_t val
= nir_src_comp_as_uint(instr
->src
[src
].src
, swizzle
[i
]);
55 if (val
== 0 || !util_is_power_of_two_or_zero64(val
))
68 is_neg_power_of_two(UNUSED
struct hash_table
*ht
, nir_alu_instr
*instr
,
69 unsigned src
, unsigned num_components
,
70 const uint8_t *swizzle
)
72 /* only constant srcs: */
73 if (!nir_src_is_const(instr
->src
[src
].src
))
76 for (unsigned i
= 0; i
< num_components
; i
++) {
77 nir_alu_type type
= nir_op_infos
[instr
->op
].input_types
[src
];
78 switch (nir_alu_type_get_base_type(type
)) {
80 int64_t val
= nir_src_comp_as_int(instr
->src
[src
].src
, swizzle
[i
]);
81 if (val
>= 0 || !util_is_power_of_two_or_zero64(-val
))
94 is_zero_to_one(UNUSED
struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
95 unsigned num_components
,
96 const uint8_t *swizzle
)
98 /* only constant srcs: */
99 if (!nir_src_is_const(instr
->src
[src
].src
))
102 for (unsigned i
= 0; i
< num_components
; i
++) {
103 switch (nir_op_infos
[instr
->op
].input_types
[src
]) {
104 case nir_type_float
: {
105 double val
= nir_src_comp_as_float(instr
->src
[src
].src
, swizzle
[i
]);
106 if (isnan(val
) || val
< 0.0f
|| val
> 1.0f
)
119 * Exclusive compare with (0, 1).
121 * This differs from \c is_zero_to_one because that function tests 0 <= src <=
122 * 1 while this function tests 0 < src < 1.
125 is_gt_0_and_lt_1(UNUSED
struct hash_table
*ht
, nir_alu_instr
*instr
,
126 unsigned src
, unsigned num_components
,
127 const uint8_t *swizzle
)
129 /* only constant srcs: */
130 if (!nir_src_is_const(instr
->src
[src
].src
))
133 for (unsigned i
= 0; i
< num_components
; i
++) {
134 switch (nir_op_infos
[instr
->op
].input_types
[src
]) {
135 case nir_type_float
: {
136 double val
= nir_src_comp_as_float(instr
->src
[src
].src
, swizzle
[i
]);
137 if (isnan(val
) || val
<= 0.0f
|| val
>= 1.0f
)
150 is_not_const_zero(UNUSED
struct hash_table
*ht
, nir_alu_instr
*instr
,
151 unsigned src
, unsigned num_components
,
152 const uint8_t *swizzle
)
154 if (nir_src_as_const_value(instr
->src
[src
].src
) == NULL
)
157 for (unsigned i
= 0; i
< num_components
; i
++) {
158 nir_alu_type type
= nir_op_infos
[instr
->op
].input_types
[src
];
159 switch (nir_alu_type_get_base_type(type
)) {
161 if (nir_src_comp_as_float(instr
->src
[src
].src
, swizzle
[i
]) == 0.0)
167 if (nir_src_comp_as_uint(instr
->src
[src
].src
, swizzle
[i
]) == 0)
179 is_not_const(UNUSED
struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
180 UNUSED
unsigned num_components
,
181 UNUSED
const uint8_t *swizzle
)
183 return !nir_src_is_const(instr
->src
[src
].src
);
187 is_not_fmul(struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
188 UNUSED
unsigned num_components
, UNUSED
const uint8_t *swizzle
)
190 nir_alu_instr
*src_alu
=
191 nir_src_as_alu_instr(instr
->src
[src
].src
);
196 if (src_alu
->op
== nir_op_fneg
)
197 return is_not_fmul(ht
, src_alu
, 0, 0, NULL
);
199 return src_alu
->op
!= nir_op_fmul
;
203 is_fsign(nir_alu_instr
*instr
, unsigned src
,
204 UNUSED
unsigned num_components
, UNUSED
const uint8_t *swizzle
)
206 nir_alu_instr
*src_alu
=
207 nir_src_as_alu_instr(instr
->src
[src
].src
);
212 if (src_alu
->op
== nir_op_fneg
)
213 src_alu
= nir_src_as_alu_instr(src_alu
->src
[0].src
);
215 return src_alu
!= NULL
&& src_alu
->op
== nir_op_fsign
;
219 is_not_const_and_not_fsign(struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
220 unsigned num_components
, const uint8_t *swizzle
)
222 return is_not_const(ht
, instr
, src
, num_components
, swizzle
) &&
223 !is_fsign(instr
, src
, num_components
, swizzle
);
227 is_used_once(nir_alu_instr
*instr
)
229 bool zero_if_use
= list_is_empty(&instr
->dest
.dest
.ssa
.if_uses
);
230 bool zero_use
= list_is_empty(&instr
->dest
.dest
.ssa
.uses
);
232 if (zero_if_use
&& zero_use
)
235 if (!zero_if_use
&& list_is_singular(&instr
->dest
.dest
.ssa
.uses
))
238 if (!zero_use
&& list_is_singular(&instr
->dest
.dest
.ssa
.if_uses
))
241 if (!list_is_singular(&instr
->dest
.dest
.ssa
.if_uses
) &&
242 !list_is_singular(&instr
->dest
.dest
.ssa
.uses
))
249 is_used_by_if(nir_alu_instr
*instr
)
251 return !list_is_empty(&instr
->dest
.dest
.ssa
.if_uses
);
255 is_not_used_by_if(nir_alu_instr
*instr
)
257 return list_is_empty(&instr
->dest
.dest
.ssa
.if_uses
);
261 is_used_by_non_fsat(nir_alu_instr
*instr
)
263 nir_foreach_use(src
, &instr
->dest
.dest
.ssa
) {
264 const nir_instr
*const user_instr
= src
->parent_instr
;
266 if (user_instr
->type
!= nir_instr_type_alu
)
269 const nir_alu_instr
*const user_alu
= nir_instr_as_alu(user_instr
);
271 assert(instr
!= user_alu
);
272 if (user_alu
->op
!= nir_op_fsat
)
280 * Returns true if a NIR ALU src represents a constant integer
281 * of either 32 or 64 bits, and the higher word (bit-size / 2)
282 * of all its components is zero.
285 is_upper_half_zero(UNUSED
struct hash_table
*ht
,
286 nir_alu_instr
*instr
, unsigned src
,
287 unsigned num_components
, const uint8_t *swizzle
)
289 if (nir_src_as_const_value(instr
->src
[src
].src
) == NULL
)
292 for (unsigned i
= 0; i
< num_components
; i
++) {
293 unsigned half_bit_size
= nir_src_bit_size(instr
->src
[src
].src
) / 2;
294 uint32_t high_bits
= ((1 << half_bit_size
) - 1) << half_bit_size
;
295 if ((nir_src_comp_as_uint(instr
->src
[src
].src
,
296 swizzle
[i
]) & high_bits
) != 0) {
305 * Returns true if a NIR ALU src represents a constant integer
306 * of either 32 or 64 bits, and the lower word (bit-size / 2)
307 * of all its components is zero.
310 is_lower_half_zero(UNUSED
struct hash_table
*ht
,
311 nir_alu_instr
*instr
, unsigned src
,
312 unsigned num_components
, const uint8_t *swizzle
)
314 if (nir_src_as_const_value(instr
->src
[src
].src
) == NULL
)
317 for (unsigned i
= 0; i
< num_components
; i
++) {
319 (1 << (nir_src_bit_size(instr
->src
[src
].src
) / 2)) - 1;
320 if ((nir_src_comp_as_int(instr
->src
[src
].src
, swizzle
[i
]) & low_bits
) != 0)
328 no_signed_wrap(nir_alu_instr
*instr
)
330 return instr
->no_signed_wrap
;
334 no_unsigned_wrap(nir_alu_instr
*instr
)
336 return instr
->no_unsigned_wrap
;
340 is_integral(struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
341 UNUSED
unsigned num_components
, UNUSED
const uint8_t *swizzle
)
343 const struct ssa_result_range r
= nir_analyze_range(ht
, instr
, src
);
345 return r
.is_integral
;
348 #define RELATION(r) \
350 is_ ## r (struct hash_table *ht, nir_alu_instr *instr, unsigned src, \
351 UNUSED unsigned num_components, UNUSED const uint8_t *swizzle) \
353 const struct ssa_result_range v = nir_analyze_range(ht, instr, src); \
354 return v.range == r; \
364 is_not_negative(struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
365 UNUSED
unsigned num_components
, UNUSED
const uint8_t *swizzle
)
367 const struct ssa_result_range v
= nir_analyze_range(ht
, instr
, src
);
368 return v
.range
== ge_zero
|| v
.range
== gt_zero
|| v
.range
== eq_zero
;
372 is_not_positive(struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
373 UNUSED
unsigned num_components
, UNUSED
const uint8_t *swizzle
)
375 const struct ssa_result_range v
= nir_analyze_range(ht
, instr
, src
);
376 return v
.range
== le_zero
|| v
.range
== lt_zero
|| v
.range
== eq_zero
;
380 is_not_zero(struct hash_table
*ht
, nir_alu_instr
*instr
, unsigned src
,
381 UNUSED
unsigned num_components
, UNUSED
const uint8_t *swizzle
)
383 const struct ssa_result_range v
= nir_analyze_range(ht
, instr
, src
);
384 return v
.range
== lt_zero
|| v
.range
== gt_zero
|| v
.range
== ne_zero
;
387 #endif /* _NIR_SEARCH_ */