diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2021-02-25 10:22:53 +0100 |
|---|---|---|
| committer | Jakub Jelinek <jakub@redhat.com> | 2021-02-25 10:22:53 +0100 |
| commit | 880682e7b2348d66f4089fa4af102b69eaaefbc2 (patch) | |
| tree | 4a7d93ee7801519d05e8be771f0e4e0b992f6fb9 /gcc/match.pd | |
| parent | 3cf52b87ff6938e30883b8f8f542a638635d507d (diff) | |
| download | gcc-880682e7b2348d66f4089fa4af102b69eaaefbc2.zip gcc-880682e7b2348d66f4089fa4af102b69eaaefbc2.tar.gz gcc-880682e7b2348d66f4089fa4af102b69eaaefbc2.tar.bz2 | |
match.pd: Use :s for (T)(A) + CST -> (T)(A + CST) [PR95798]
The r10-2806 change regressed following testcases, instead of doing
int -> unsigned long sign-extension once and then add 8, 16, ... 56 to it
for each of the memory access, it adds 8, 16, ... 56 in int mode and then
sign extends each. So that means:
+ movq $0, (%rsp,%rax,8)
+ leal 1(%rdx), %eax
+ cltq
+ movq $1, (%rsp,%rax,8)
+ leal 2(%rdx), %eax
+ cltq
+ movq $2, (%rsp,%rax,8)
+ leal 3(%rdx), %eax
+ cltq
+ movq $3, (%rsp,%rax,8)
+ leal 4(%rdx), %eax
+ cltq
+ movq $4, (%rsp,%rax,8)
+ leal 5(%rdx), %eax
+ cltq
+ movq $5, (%rsp,%rax,8)
+ leal 6(%rdx), %eax
+ addl $7, %edx
+ cltq
+ movslq %edx, %rdx
+ movq $6, (%rsp,%rax,8)
+ movq $7, (%rsp,%rdx,8)
- movq $0, (%rsp,%rdx,8)
- movq $1, 8(%rsp,%rdx,8)
- movq $2, 16(%rsp,%rdx,8)
- movq $3, 24(%rsp,%rdx,8)
- movq $4, 32(%rsp,%rdx,8)
- movq $5, 40(%rsp,%rdx,8)
- movq $6, 48(%rsp,%rdx,8)
- movq $7, 56(%rsp,%rdx,8)
GCC 9 -> 10 change or:
- movq $0, (%rsp,%rdx,8)
- movq $1, 8(%rsp,%rdx,8)
- movq $2, 16(%rsp,%rdx,8)
- movq $3, 24(%rsp,%rdx,8)
- movq $4, 32(%rsp,%rdx,8)
- movq $5, 40(%rsp,%rdx,8)
- movq $6, 48(%rsp,%rdx,8)
- movq $7, 56(%rsp,%rdx,8)
+ movq $0, (%rsp,%rax,8)
+ leal 1(%rdx), %eax
+ movq $1, (%rsp,%rax,8)
+ leal 2(%rdx), %eax
+ movq $2, (%rsp,%rax,8)
+ leal 3(%rdx), %eax
+ movq $3, (%rsp,%rax,8)
+ leal 4(%rdx), %eax
+ movq $4, (%rsp,%rax,8)
+ leal 5(%rdx), %eax
+ movq $5, (%rsp,%rax,8)
+ leal 6(%rdx), %eax
+ movq $6, (%rsp,%rax,8)
+ leal 7(%rdx), %eax
+ movq $7, (%rsp,%rax,8)
change on the other test. While for the former case of
int there is due to signed integer overflow (unless -fwrapv)
the possibility to undo it e.g. during expansion, for the unsigned
case information is unfortunately lost.
The following patch adds :s to the convert which restores these
testcases but keeps the testcases the patch meant to improve as is.
2021-02-25 Jakub Jelinek <jakub@redhat.com>
PR target/95798
* match.pd ((T)(A) + CST -> (T)(A + CST)): Add :s to convert.
* gcc.target/i386/pr95798-1.c: New test.
* gcc.target/i386/pr95798-2.c: New test.
Diffstat (limited to 'gcc/match.pd')
| -rw-r--r-- | gcc/match.pd | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/match.pd b/gcc/match.pd index 760f773..a34c283 100644 --- a/gcc/match.pd +++ b/gcc/match.pd @@ -2492,7 +2492,7 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) /* ((T)(A)) + CST -> (T)(A + CST) */ #if GIMPLE (simplify - (plus (convert SSA_NAME@0) INTEGER_CST@1) + (plus (convert:s SSA_NAME@0) INTEGER_CST@1) (if (TREE_CODE (TREE_TYPE (@0)) == INTEGER_TYPE && TREE_CODE (type) == INTEGER_TYPE && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (@0)) |