<p dir="ltr"><br>
On May 22, 2015 11:25 AM, "Connor Abbott" <<a href="mailto:cwabbott0@gmail.com">cwabbott0@gmail.com</a>> wrote:<br>
><br>
> We'll want to use these outside of nir_opt_cse.c. Rather than adding yet<br>
> another thing to the mess that is nir.c, create a new file and move<br>
> nir_srcs_equal() there too.<br>
><br>
> Signed-off-by: Connor Abbott <<a href="mailto:cwabbott0@gmail.com">cwabbott0@gmail.com</a>><br>
> ---<br>
> src/glsl/Makefile.sources | 1 +<br>
> src/glsl/nir/nir.c | 27 ------<br>
> src/glsl/nir/nir.h | 1 +<br>
> src/glsl/nir/nir_instr_compare.c | 179 +++++++++++++++++++++++++++++++++++++++<br>
> src/glsl/nir/nir_opt_cse.c | 121 --------------------------<br>
> 5 files changed, 181 insertions(+), 148 deletions(-)<br>
> create mode 100644 src/glsl/nir/nir_instr_compare.c<br>
><br>
> diff --git a/src/glsl/Makefile.sources b/src/glsl/Makefile.sources<br>
> index d784a81..75e5377 100644<br>
> --- a/src/glsl/Makefile.sources<br>
> +++ b/src/glsl/Makefile.sources<br>
> @@ -27,6 +27,7 @@ NIR_FILES = \<br>
> nir/nir_constant_expressions.h \<br>
> nir/nir_dominance.c \<br>
> nir/nir_from_ssa.c \<br>
> + nir/nir_instr_compare.c \<br>
> nir/nir_intrinsics.c \<br>
> nir/nir_intrinsics.h \<br>
> nir/nir_live_variables.c \<br>
> diff --git a/src/glsl/nir/nir.c b/src/glsl/nir/nir.c<br>
> index f03e80a..170807e 100644<br>
> --- a/src/glsl/nir/nir.c<br>
> +++ b/src/glsl/nir/nir.c<br>
> @@ -1785,33 +1785,6 @@ nir_src_as_const_value(nir_src src)<br>
> return &load->value;<br>
> }<br>
><br>
> -bool<br>
> -nir_srcs_equal(nir_src src1, nir_src src2)<br>
> -{<br>
> - if (src1.is_ssa) {<br>
> - if (src2.is_ssa) {<br>
> - return src1.ssa == src2.ssa;<br>
> - } else {<br>
> - return false;<br>
> - }<br>
> - } else {<br>
> - if (src2.is_ssa) {<br>
> - return false;<br>
> - } else {<br>
> - if ((src1.reg.indirect == NULL) != (src2.reg.indirect == NULL))<br>
> - return false;<br>
> -<br>
> - if (src1.reg.indirect) {<br>
> - if (!nir_srcs_equal(*src1.reg.indirect, *src2.reg.indirect))<br>
> - return false;<br>
> - }<br>
> -<br>
> - return src1.reg.reg == src2.reg.reg &&<br>
> - src1.reg.base_offset == src2.reg.base_offset;<br>
> - }<br>
> - }<br>
> -}<br>
> -<br>
> static bool<br>
> src_is_valid(const nir_src *src)<br>
> {<br>
> diff --git a/src/glsl/nir/nir.h b/src/glsl/nir/nir.h<br>
> index 697d37e..f04195f 100644<br>
> --- a/src/glsl/nir/nir.h<br>
> +++ b/src/glsl/nir/nir.h<br>
> @@ -1579,6 +1579,7 @@ bool nir_foreach_src(nir_instr *instr, nir_foreach_src_cb cb, void *state);<br>
><br>
> nir_const_value *nir_src_as_const_value(nir_src src);<br>
> bool nir_srcs_equal(nir_src src1, nir_src src2);<br>
> +bool nir_instrs_equal(nir_instr *instr1, nir_instr *instr2);<br>
> void nir_instr_rewrite_src(nir_instr *instr, nir_src *src, nir_src new_src);<br>
> void nir_instr_move_src(nir_instr *dest_instr, nir_src *dest, nir_src *src);<br>
> void nir_if_rewrite_condition(nir_if *if_stmt, nir_src new_src);<br>
> diff --git a/src/glsl/nir/nir_instr_compare.c b/src/glsl/nir/nir_instr_compare.c<br>
> new file mode 100644<br>
> index 0000000..89b576c<br>
> --- /dev/null<br>
> +++ b/src/glsl/nir/nir_instr_compare.c<br>
> @@ -0,0 +1,179 @@<br>
> +/*<br>
> + * Copyright © 2014 Intel Corporation<br>
> + * Copyright © 2015 Connor Abbott<br>
> + *<br>
> + * Permission is hereby granted, free of charge, to any person obtaining a<br>
> + * copy of this software and associated documentation files (the "Software"),<br>
> + * to deal in the Software without restriction, including without limitation<br>
> + * the rights to use, copy, modify, merge, publish, distribute, sublicense,<br>
> + * and/or sell copies of the Software, and to permit persons to whom the<br>
> + * Software is furnished to do so, subject to the following conditions:<br>
> + *<br>
> + * The above copyright notice and this permission notice (including the next<br>
> + * paragraph) shall be included in all copies or substantial portions of the<br>
> + * Software.<br>
> + *<br>
> + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR<br>
> + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,<br>
> + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL<br>
> + * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER<br>
> + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING<br>
> + * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS<br>
> + * IN THE SOFTWARE.<br>
> + *<br>
> + * Authors:<br>
> + * Jason Ekstrand (<a href="mailto:jason@jlekstrand.net">jason@jlekstrand.net</a>)<br>
> + * Connor Abbott (<a href="mailto:cwabbott0@gmail.com">cwabbott0@gmail.com</a>)<br>
> + *<br>
> + */<br>
> +<br>
> +#include "nir.h"<br>
> +<br>
> +bool<br>
> +nir_srcs_equal(nir_src src1, nir_src src2)<br>
> +{<br>
> + if (src1.is_ssa) {<br>
> + if (src2.is_ssa) {<br>
> + return src1.ssa == src2.ssa;<br>
> + } else {<br>
> + return false;<br>
> + }<br>
> + } else {<br>
> + if (src2.is_ssa) {<br>
> + return false;<br>
> + } else {<br>
> + if ((src1.reg.indirect == NULL) != (src2.reg.indirect == NULL))<br>
> + return false;<br>
> +<br>
> + if (src1.reg.indirect) {<br>
> + if (!nir_srcs_equal(*src1.reg.indirect, *src2.reg.indirect))<br>
> + return false;<br>
> + }<br>
> +<br>
> + return src1.reg.reg == src2.reg.reg &&<br>
> + src1.reg.base_offset == src2.reg.base_offset;<br>
> + }<br>
> + }<br>
> +}<br>
> +<br>
> +<br>
> +static bool<br>
> +nir_alu_srcs_equal(nir_alu_instr *alu1, nir_alu_instr *alu2, unsigned src1,<br>
> + unsigned src2)<br>
> +{<br>
> + if (alu1->src[src1].abs != alu2->src[src2].abs ||<br>
> + alu1->src[src1].negate != alu2->src[src2].negate)<br>
> + return false;<br>
> +<br>
> + for (unsigned i = 0; i < nir_ssa_alu_instr_src_components(alu1, src1); i++) {<br>
> + if (alu1->src[src1].swizzle[i] != alu2->src[src2].swizzle[i])<br>
> + return false;<br>
> + }<br>
> +<br>
> + return nir_srcs_equal(alu1->src[src1].src, alu2->src[src2].src);<br>
> +}</p>
<p dir="ltr">We should add a big fat disclaimer here that just because this function returns false doesn't mean they aren't equal. nir_instrs_equal(instr, instr) may return false.</p>
<p dir="ltr">Also, does this need to be rebased on Eric's stuff?</p>
<p dir="ltr">> +bool<br>
> +nir_instrs_equal(nir_instr *instr1, nir_instr *instr2)<br>
> +{<br>
> + if (instr1->type != instr2->type)<br>
> + return false;<br>
> +<br>
> + switch (instr1->type) {<br>
> + case nir_instr_type_alu: {<br>
> + nir_alu_instr *alu1 = nir_instr_as_alu(instr1);<br>
> + nir_alu_instr *alu2 = nir_instr_as_alu(instr2);<br>
> +<br>
> + if (alu1->op != alu2->op)<br>
> + return false;<br>
> +<br>
> + /* TODO: We can probably acutally do something more inteligent such<br>
> + * as allowing different numbers and taking a maximum or something<br>
> + * here */<br>
> + if (alu1->dest.dest.ssa.num_components != alu2->dest.dest.ssa.num_components)<br>
> + return false;<br>
> +<br>
> + if (nir_op_infos[alu1->op].algebraic_properties & NIR_OP_IS_COMMUTATIVE) {<br>
> + assert(nir_op_infos[alu1->op].num_inputs == 2);<br>
> + return (nir_alu_srcs_equal(alu1, alu2, 0, 0) &&<br>
> + nir_alu_srcs_equal(alu1, alu2, 1, 1)) ||<br>
> + (nir_alu_srcs_equal(alu1, alu2, 0, 1) &&<br>
> + nir_alu_srcs_equal(alu1, alu2, 1, 0));<br>
> + } else {<br>
> + for (unsigned i = 0; i < nir_op_infos[alu1->op].num_inputs; i++) {<br>
> + if (!nir_alu_srcs_equal(alu1, alu2, i, i))<br>
> + return false;<br>
> + }<br>
> + }<br>
> + return true;<br>
> + }<br>
> + case nir_instr_type_tex:<br>
> + return false;<br>
> + case nir_instr_type_load_const: {<br>
> + nir_load_const_instr *load1 = nir_instr_as_load_const(instr1);<br>
> + nir_load_const_instr *load2 = nir_instr_as_load_const(instr2);<br>
> +<br>
> + if (load1->def.num_components != load2->def.num_components)<br>
> + return false;<br>
> +<br>
> + return memcmp(load1->value.f, load2->value.f,<br>
> + load1->def.num_components * sizeof(*load2->value.f)) == 0;<br>
> + }<br>
> + case nir_instr_type_phi: {<br>
> + nir_phi_instr *phi1 = nir_instr_as_phi(instr1);<br>
> + nir_phi_instr *phi2 = nir_instr_as_phi(instr2);<br>
> +<br>
> + if (phi1->instr.block != phi2->instr.block)<br>
> + return false;<br>
> +<br>
> + nir_foreach_phi_src(phi1, src1) {<br>
> + nir_foreach_phi_src(phi2, src2) {<br>
> + if (src1->pred == src2->pred) {<br>
> + if (!nir_srcs_equal(src1->src, src2->src))<br>
> + return false;<br>
> +<br>
> + break;<br>
> + }<br>
> + }<br>
> + }<br>
> +<br>
> + return true;<br>
> + }<br>
> + case nir_instr_type_intrinsic: {<br>
> + nir_intrinsic_instr *intrinsic1 = nir_instr_as_intrinsic(instr1);<br>
> + nir_intrinsic_instr *intrinsic2 = nir_instr_as_intrinsic(instr2);<br>
> + const nir_intrinsic_info *info =<br>
> + &nir_intrinsic_infos[intrinsic1->intrinsic];<br>
> +<br>
> + if (intrinsic1->intrinsic != intrinsic2->intrinsic ||<br>
> + intrinsic1->num_components != intrinsic2->num_components)<br>
> + return false;<br>
> +<br>
> + if (info->has_dest && intrinsic1->dest.ssa.num_components !=<br>
> + intrinsic2->dest.ssa.num_components)<br>
> + return false;<br>
> +<br>
> + for (unsigned i = 0; i < info->num_srcs; i++) {<br>
> + if (!nir_srcs_equal(intrinsic1->src[i], intrinsic2->src[i]))<br>
> + return false;<br>
> + }<br>
> +<br>
> + assert(info->num_variables == 0);<br>
> +<br>
> + for (unsigned i = 0; i < info->num_indices; i++) {<br>
> + if (intrinsic1->const_index[i] != intrinsic2->const_index[i])<br>
> + return false;<br>
> + }<br>
> +<br>
> + return true;<br>
> + }<br>
> + case nir_instr_type_call:<br>
> + case nir_instr_type_jump:<br>
> + case nir_instr_type_ssa_undef:<br>
> + case nir_instr_type_parallel_copy:<br>
> + default:<br>
> + unreachable("Invalid instruction type");<br>
> + }<br>
> +<br>
> + return false;<br>
> +}<br>
> diff --git a/src/glsl/nir/nir_opt_cse.c b/src/glsl/nir/nir_opt_cse.c<br>
> index 553906e..a6a4a21 100644<br>
> --- a/src/glsl/nir/nir_opt_cse.c<br>
> +++ b/src/glsl/nir/nir_opt_cse.c<br>
> @@ -37,127 +37,6 @@ struct cse_state {<br>
> };<br>
><br>
> static bool<br>
> -nir_alu_srcs_equal(nir_alu_instr *alu1, nir_alu_instr *alu2, unsigned src1,<br>
> - unsigned src2)<br>
> -{<br>
> - if (alu1->src[src1].abs != alu2->src[src2].abs ||<br>
> - alu1->src[src1].negate != alu2->src[src2].negate)<br>
> - return false;<br>
> -<br>
> - for (unsigned i = 0; i < nir_ssa_alu_instr_src_components(alu1, src1); i++) {<br>
> - if (alu1->src[src1].swizzle[i] != alu2->src[src2].swizzle[i])<br>
> - return false;<br>
> - }<br>
> -<br>
> - return nir_srcs_equal(alu1->src[src1].src, alu2->src[src2].src);<br>
> -}<br>
> -<br>
> -static bool<br>
> -nir_instrs_equal(nir_instr *instr1, nir_instr *instr2)<br>
> -{<br>
> - if (instr1->type != instr2->type)<br>
> - return false;<br>
> -<br>
> - switch (instr1->type) {<br>
> - case nir_instr_type_alu: {<br>
> - nir_alu_instr *alu1 = nir_instr_as_alu(instr1);<br>
> - nir_alu_instr *alu2 = nir_instr_as_alu(instr2);<br>
> -<br>
> - if (alu1->op != alu2->op)<br>
> - return false;<br>
> -<br>
> - /* TODO: We can probably acutally do something more inteligent such<br>
> - * as allowing different numbers and taking a maximum or something<br>
> - * here */<br>
> - if (alu1->dest.dest.ssa.num_components != alu2->dest.dest.ssa.num_components)<br>
> - return false;<br>
> -<br>
> - if (nir_op_infos[alu1->op].algebraic_properties & NIR_OP_IS_COMMUTATIVE) {<br>
> - assert(nir_op_infos[alu1->op].num_inputs == 2);<br>
> - return (nir_alu_srcs_equal(alu1, alu2, 0, 0) &&<br>
> - nir_alu_srcs_equal(alu1, alu2, 1, 1)) ||<br>
> - (nir_alu_srcs_equal(alu1, alu2, 0, 1) &&<br>
> - nir_alu_srcs_equal(alu1, alu2, 1, 0));<br>
> - } else {<br>
> - for (unsigned i = 0; i < nir_op_infos[alu1->op].num_inputs; i++) {<br>
> - if (!nir_alu_srcs_equal(alu1, alu2, i, i))<br>
> - return false;<br>
> - }<br>
> - }<br>
> - return true;<br>
> - }<br>
> - case nir_instr_type_tex:<br>
> - return false;<br>
> - case nir_instr_type_load_const: {<br>
> - nir_load_const_instr *load1 = nir_instr_as_load_const(instr1);<br>
> - nir_load_const_instr *load2 = nir_instr_as_load_const(instr2);<br>
> -<br>
> - if (load1->def.num_components != load2->def.num_components)<br>
> - return false;<br>
> -<br>
> - return memcmp(load1->value.f, load2->value.f,<br>
> - load1->def.num_components * sizeof(*load2->value.f)) == 0;<br>
> - }<br>
> - case nir_instr_type_phi: {<br>
> - nir_phi_instr *phi1 = nir_instr_as_phi(instr1);<br>
> - nir_phi_instr *phi2 = nir_instr_as_phi(instr2);<br>
> -<br>
> - if (phi1->instr.block != phi2->instr.block)<br>
> - return false;<br>
> -<br>
> - nir_foreach_phi_src(phi1, src1) {<br>
> - nir_foreach_phi_src(phi2, src2) {<br>
> - if (src1->pred == src2->pred) {<br>
> - if (!nir_srcs_equal(src1->src, src2->src))<br>
> - return false;<br>
> -<br>
> - break;<br>
> - }<br>
> - }<br>
> - }<br>
> -<br>
> - return true;<br>
> - }<br>
> - case nir_instr_type_intrinsic: {<br>
> - nir_intrinsic_instr *intrinsic1 = nir_instr_as_intrinsic(instr1);<br>
> - nir_intrinsic_instr *intrinsic2 = nir_instr_as_intrinsic(instr2);<br>
> - const nir_intrinsic_info *info =<br>
> - &nir_intrinsic_infos[intrinsic1->intrinsic];<br>
> -<br>
> - if (intrinsic1->intrinsic != intrinsic2->intrinsic ||<br>
> - intrinsic1->num_components != intrinsic2->num_components)<br>
> - return false;<br>
> -<br>
> - if (info->has_dest && intrinsic1->dest.ssa.num_components !=<br>
> - intrinsic2->dest.ssa.num_components)<br>
> - return false;<br>
> -<br>
> - for (unsigned i = 0; i < info->num_srcs; i++) {<br>
> - if (!nir_srcs_equal(intrinsic1->src[i], intrinsic2->src[i]))<br>
> - return false;<br>
> - }<br>
> -<br>
> - assert(info->num_variables == 0);<br>
> -<br>
> - for (unsigned i = 0; i < info->num_indices; i++) {<br>
> - if (intrinsic1->const_index[i] != intrinsic2->const_index[i])<br>
> - return false;<br>
> - }<br>
> -<br>
> - return true;<br>
> - }<br>
> - case nir_instr_type_call:<br>
> - case nir_instr_type_jump:<br>
> - case nir_instr_type_ssa_undef:<br>
> - case nir_instr_type_parallel_copy:<br>
> - default:<br>
> - unreachable("Invalid instruction type");<br>
> - }<br>
> -<br>
> - return false;<br>
> -}<br>
> -<br>
> -static bool<br>
> src_is_ssa(nir_src *src, void *data)<br>
> {<br>
> (void) data;<br>
> --<br>
> 2.1.0<br>
><br>
> _______________________________________________<br>
> mesa-dev mailing list<br>
> <a href="mailto:mesa-dev@lists.freedesktop.org">mesa-dev@lists.freedesktop.org</a><br>
> <a href="http://lists.freedesktop.org/mailman/listinfo/mesa-dev">http://lists.freedesktop.org/mailman/listinfo/mesa-dev</a><br>
</p>