diff options
| author | Luc Van Oostenryck <luc.vanoostenryck@gmail.com> | 2020-11-26 22:38:21 +0100 |
|---|---|---|
| committer | Luc Van Oostenryck <luc.vanoostenryck@gmail.com> | 2020-11-27 22:17:09 +0100 |
| commit | 3aaa16eac7f07302bcf3d733aeee901d378b7e9d (patch) | |
| tree | f4d92829b7c0f2b8c0f8bf3285e6bc60067aa183 | |
| parent | 90c1d15708d44c59046568592abcad8bdd1de126 (diff) | |
| download | sparse-3aaa16eac7f07302bcf3d733aeee901d378b7e9d.tar.gz | |
add testscases for 'bits translation' optimization
Add some testcase related to the simplification of expressions like:
if (val1 & BIT1)
val2 |= BIT2;
into
val2 |= (val1 & BIT1) {SHL/LSR} |BIT2-BIT1|;
Signed-off-by: Luc Van Oostenryck <luc.vanoostenryck@gmail.com>
| -rw-r--r-- | validation/optim/fact-select01.c | 26 | ||||
| -rw-r--r-- | validation/optim/select-and-shift.c | 18 |
2 files changed, 44 insertions, 0 deletions
diff --git a/validation/optim/fact-select01.c b/validation/optim/fact-select01.c new file mode 100644 index 00000000..ef4e5e89 --- /dev/null +++ b/validation/optim/fact-select01.c @@ -0,0 +1,26 @@ +int add_yx_y(int p, int x, int y) { return (p ? (y+x) : y) == ((p ? x : 0) + y); } +int add_xy_y(int p, int y, int x) { return (p ? (x+y) : y) == ((p ? x : 0) + y); } +int add_xy_x(int p, int x, int y) { return (p ? (x+y) : x) == ((p ? y : 0) + x); } +int add_yx_x(int p, int y, int x) { return (p ? (y+x) : x) == ((p ? y : 0) + x); } +int add_y_yx(int p, int x, int y) { return (p ? y : (y+x)) == ((p ? 0 : x) + y); } + +int ior_yx_y(int p, int x, int y) { return (p ? (y|x) : y) == ((p ? x : 0) | y); } +int ior_xy_y(int p, int y, int x) { return (p ? (x|y) : y) == ((p ? x : 0) | y); } +int ior_xy_x(int p, int x, int y) { return (p ? (x|y) : x) == ((p ? y : 0) | x); } +int ior_yx_x(int p, int y, int x) { return (p ? (y|x) : x) == ((p ? y : 0) | x); } +int ior_y_yx(int p, int x, int y) { return (p ? y : (y|x)) == ((p ? 0 : x) | y); } + +int xor_yx_y(int p, int x, int y) { return (p ? (y^x) : y) == ((p ? x : 0) ^ y); } +int xor_xy_y(int p, int y, int x) { return (p ? (x^y) : y) == ((p ? x : 0) ^ y); } +int xor_xy_x(int p, int x, int y) { return (p ? (x^y) : x) == ((p ? y : 0) ^ x); } +int xor_yx_x(int p, int y, int x) { return (p ? (y^x) : x) == ((p ? y : 0) ^ x); } +int xor_y_yx(int p, int x, int y) { return (p ? y : (y^x)) == ((p ? 0 : x) ^ y); } + +/* + * check-name: fact-select01 + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ diff --git a/validation/optim/select-and-shift.c b/validation/optim/select-and-shift.c new file mode 100644 index 00000000..fbe044c7 --- /dev/null +++ b/validation/optim/select-and-shift.c @@ -0,0 +1,18 @@ +#define S1 2 +#define S2 5 +#define S (S2 - S1) + +#define A (1 << S1) +#define B (1 << S2) + +int foo(int p) { return ((p & A) ? B : 0) == ((((unsigned)p) & A) << S); } +int bar(int p) { return ((p & B) ? A : 0) == ((((unsigned)p) & B) >> S); } + +/* + * check-name: select-and-shift + * check-command: test-linearize -Wno-decl $file + * check-known-to-fail + * + * check-output-ignore + * check-output-returns: 1 + */ |