[1/8] add testscases for some factorization of distributive operations

Message ID	20201127164950.41517-2-luc.vanoostenryck@gmail.com (mailing list archive)
State	Mainlined, archived
Headers	show Return-Path: <linux-sparse-owner@kernel.org> From: Luc Van Oostenryck <luc.vanoostenryck@gmail.com> To: linux-sparse@vger.kernel.org Cc: Luc Van Oostenryck <luc.vanoostenryck@gmail.com> Subject: [PATCH 1/8] add testscases for some factorization of distributive operations Date: Fri, 27 Nov 2020 17:49:43 +0100 Message-Id: <20201127164950.41517-2-luc.vanoostenryck@gmail.com> In-Reply-To: <20201127164950.41517-1-luc.vanoostenryck@gmail.com> References: <20201127164950.41517-1-luc.vanoostenryck@gmail.com> MIME-Version: 1.0 Content-Transfer-Encoding: 8bit Precedence: bulk
Series	factorization of distributive operations \| expand [0/8] factorization of distributive operations [1/8] add testscases for some factorization of distributive operations [2/8] reassoc: add helper can_move_to() [3/8] add helper make_insn_pair() & swap_insn() [4/8] add helper replace_binop() [5/8] refactor simplify_add() to avoid code duplication (preparation) [6/8] refactor simplify_add() to avoid code duplication [7/8] factorize (x OP1 z) OP2 (y OP1 z) into (x OP2 y) OP1 z [8/8] factorize SHIFT(x, s) OP SHIFT(y, s) into SHIFT((x OP y), s)

diff --git a/validation/optim/fact-add-mul.c b/validation/optim/fact-add-mul.c new file mode 100644 index 000000000000..48c3d656accc --- /dev/null +++ b/validation/optim/fact-add-mul.c @@ -0,0 +1,28 @@ +int fr_abx(int a, int b, int x) { return ((a * x) + (b * x)) == ((a + b) * x); } +int fl_abx(int a, int b, int x) { return ((x * a) + (x * b)) == ((a + b) * x); } +int fm_abx(int a, int b, int x) { return ((a * x) + (x * b)) == ((a + b) * x); } +int fn_abx(int a, int b, int x) { return ((x * a) + (b * x)) == ((a + b) * x); } + +int fr_bax(int b, int a, int x) { return ((a * x) + (b * x)) == ((b + a) * x); } +int fl_bax(int b, int a, int x) { return ((x * a) + (x * b)) == ((b + a) * x); } +int fm_bax(int b, int a, int x) { return ((a * x) + (x * b)) == ((b + a) * x); } +int fn_bax(int b, int a, int x) { return ((x * a) + (b * x)) == ((b + a) * x); } + +int fr_axb(int a, int x, int b) { return ((a * x) + (b * x)) == ((a + b) * x); } +int fl_axb(int a, int x, int b) { return ((x * a) + (x * b)) == ((a + b) * x); } +int fm_axb(int a, int x, int b) { return ((a * x) + (x * b)) == ((a + b) * x); } +int fn_axb(int a, int x, int b) { return ((x * a) + (b * x)) == ((a + b) * x); } + +int fr_bxa(int b, int x, int a) { return ((b * x) + (a * x)) == ((b + a) * x); } +int fl_bxa(int b, int x, int a) { return ((x * b) + (x * a)) == ((b + a) * x); } +int fm_bxa(int b, int x, int a) { return ((b * x) + (x * a)) == ((b + a) * x); } +int fn_bxa(int b, int x, int a) { return ((x * b) + (a * x)) == ((b + a) * x); } + +/* + * check-name: fact-add-mul + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/fact-and-ior.c b/validation/optim/fact-and-ior.c new file mode 100644 index 000000000000..f2a78eddf41d --- /dev/null +++ b/validation/optim/fact-and-ior.c @@ -0,0 +1,28 @@ +int fr_abx(int a, int b, int x) { return ((a | x) & (b | x)) == ((a & b) | x); } +int fl_abx(int a, int b, int x) { return ((x | a) & (x | b)) == ((a & b) | x); } +int fm_abx(int a, int b, int x) { return ((a | x) & (x | b)) == ((a & b) | x); } +int fn_abx(int a, int b, int x) { return ((x | a) & (b | x)) == ((a & b) | x); } + +int fr_bax(int b, int a, int x) { return ((a | x) & (b | x)) == ((b & a) | x); } +int fl_bax(int b, int a, int x) { return ((x | a) & (x | b)) == ((b & a) | x); } +int fm_bax(int b, int a, int x) { return ((a | x) & (x | b)) == ((b & a) | x); } +int fn_bax(int b, int a, int x) { return ((x | a) & (b | x)) == ((b & a) | x); } + +int fr_axb(int a, int x, int b) { return ((a | x) & (b | x)) == ((a & b) | x); } +int fl_axb(int a, int x, int b) { return ((x | a) & (x | b)) == ((a & b) | x); } +int fm_axb(int a, int x, int b) { return ((a | x) & (x | b)) == ((a & b) | x); } +int fn_axb(int a, int x, int b) { return ((x | a) & (b | x)) == ((a & b) | x); } + +int fr_bxa(int b, int x, int a) { return ((b | x) & (a | x)) == ((b & a) | x); } +int fl_bxa(int b, int x, int a) { return ((x | b) & (x | a)) == ((b & a) | x); } +int fm_bxa(int b, int x, int a) { return ((b | x) & (x | a)) == ((b & a) | x); } +int fn_bxa(int b, int x, int a) { return ((x | b) & (a | x)) == ((b & a) | x); } + +/* + * check-name: fact-and-ior + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/fact-and-shift.c b/validation/optim/fact-and-shift.c new file mode 100644 index 000000000000..401750216b44 --- /dev/null +++ b/validation/optim/fact-and-shift.c @@ -0,0 +1,27 @@ +typedef unsigned int uint; +typedef signed int sint; + + +uint fact_and_shl(uint a, uint b, uint s) +{ + return ((a << s) & (b << s)) == ((a & b) << s); +} + +uint fact_and_lsr(uint a, uint b, uint s) +{ + return ((a >> s) & (b >> s)) == ((a & b) >> s); +} + +sint fact_and_asr(sint a, sint b, sint s) +{ + return ((a >> s) & (b >> s)) == ((a & b) >> s); +} + +/* + * check-name: fact-and-shift + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/fact-ior-and.c b/validation/optim/fact-ior-and.c new file mode 100644 index 000000000000..7af89df1e1f0 --- /dev/null +++ b/validation/optim/fact-ior-and.c @@ -0,0 +1,28 @@ +int fr_abx(int a, int b, int x) { return ((a & x) | (b & x)) == ((a | b) & x); } +int fl_abx(int a, int b, int x) { return ((x & a) | (x & b)) == ((a | b) & x); } +int fm_abx(int a, int b, int x) { return ((a & x) | (x & b)) == ((a | b) & x); } +int fn_abx(int a, int b, int x) { return ((x & a) | (b & x)) == ((a | b) & x); } + +int fr_bax(int b, int a, int x) { return ((a & x) | (b & x)) == ((b | a) & x); } +int fl_bax(int b, int a, int x) { return ((x & a) | (x & b)) == ((b | a) & x); } +int fm_bax(int b, int a, int x) { return ((a & x) | (x & b)) == ((b | a) & x); } +int fn_bax(int b, int a, int x) { return ((x & a) | (b & x)) == ((b | a) & x); } + +int fr_axb(int a, int x, int b) { return ((a & x) | (b & x)) == ((a | b) & x); } +int fl_axb(int a, int x, int b) { return ((x & a) | (x & b)) == ((a | b) & x); } +int fm_axb(int a, int x, int b) { return ((a & x) | (x & b)) == ((a | b) & x); } +int fn_axb(int a, int x, int b) { return ((x & a) | (b & x)) == ((a | b) & x); } + +int fr_bxa(int b, int x, int a) { return ((b & x) | (a & x)) == ((b | a) & x); } +int fl_bxa(int b, int x, int a) { return ((x & b) | (x & a)) == ((b | a) & x); } +int fm_bxa(int b, int x, int a) { return ((b & x) | (x & a)) == ((b | a) & x); } +int fn_bxa(int b, int x, int a) { return ((x & b) | (a & x)) == ((b | a) & x); } + +/* + * check-name: fact-ior-and + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/fact-ior-shift.c b/validation/optim/fact-ior-shift.c new file mode 100644 index 000000000000..07fdf80604dc --- /dev/null +++ b/validation/optim/fact-ior-shift.c @@ -0,0 +1,27 @@ +typedef unsigned int uint; +typedef signed int sint; + + +uint fact_ior_shl(uint a, uint b, uint s) +{ + return ((a << s) | (b << s)) == ((a | b) << s); +} + +uint fact_ior_lsr(uint a, uint b, uint s) +{ + return ((a >> s) | (b >> s)) == ((a | b) >> s); +} + +sint fact_ior_asr(sint a, sint b, sint s) +{ + return ((a >> s) | (b >> s)) == ((a | b) >> s); +} + +/* + * check-name: fact-ior-shift + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/fact-xor-and.c b/validation/optim/fact-xor-and.c new file mode 100644 index 000000000000..905cbf4ab659 --- /dev/null +++ b/validation/optim/fact-xor-and.c @@ -0,0 +1,28 @@ +int fr_abx(int a, int b, int x) { return ((a & x) ^ (b & x)) == ((a ^ b) & x); } +int fl_abx(int a, int b, int x) { return ((x & a) ^ (x & b)) == ((a ^ b) & x); } +int fm_abx(int a, int b, int x) { return ((a & x) ^ (x & b)) == ((a ^ b) & x); } +int fn_abx(int a, int b, int x) { return ((x & a) ^ (b & x)) == ((a ^ b) & x); } + +int fr_bax(int b, int a, int x) { return ((a & x) ^ (b & x)) == ((b ^ a) & x); } +int fl_bax(int b, int a, int x) { return ((x & a) ^ (x & b)) == ((b ^ a) & x); } +int fm_bax(int b, int a, int x) { return ((a & x) ^ (x & b)) == ((b ^ a) & x); } +int fn_bax(int b, int a, int x) { return ((x & a) ^ (b & x)) == ((b ^ a) & x); } + +int fr_axb(int a, int x, int b) { return ((a & x) ^ (b & x)) == ((a ^ b) & x); } +int fl_axb(int a, int x, int b) { return ((x & a) ^ (x & b)) == ((a ^ b) & x); } +int fm_axb(int a, int x, int b) { return ((a & x) ^ (x & b)) == ((a ^ b) & x); } +int fn_axb(int a, int x, int b) { return ((x & a) ^ (b & x)) == ((a ^ b) & x); } + +int fr_bxa(int b, int x, int a) { return ((b & x) ^ (a & x)) == ((b ^ a) & x); } +int fl_bxa(int b, int x, int a) { return ((x & b) ^ (x & a)) == ((b ^ a) & x); } +int fm_bxa(int b, int x, int a) { return ((b & x) ^ (x & a)) == ((b ^ a) & x); } +int fn_bxa(int b, int x, int a) { return ((x & b) ^ (a & x)) == ((b ^ a) & x); } + +/* + * check-name: fact-xor-and + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/fact-xor-shift.c b/validation/optim/fact-xor-shift.c new file mode 100644 index 000000000000..81fcda851400 --- /dev/null +++ b/validation/optim/fact-xor-shift.c @@ -0,0 +1,27 @@ +typedef unsigned int uint; +typedef signed int sint; + + +uint fact_xor_shl(uint a, uint b, uint s) +{ + return ((a << s) ^ (b << s)) == ((a ^ b) << s); +} + +uint fact_xor_lsr(uint a, uint b, uint s) +{ + return ((a >> s) ^ (b >> s)) == ((a ^ b) >> s); +} + +sint fact_xor_asr(sint a, sint b, sint s) +{ + return ((a >> s) ^ (b >> s)) == ((a ^ b) >> s); +} + +/* + * check-name: fact-xor-shift + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */

[1/8] add testscases for some factorization of distributive operations

Commit Message

Patch