OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR middle-end/79649 (Memset pattern in named address space crashes compiler or generates wrong code) 

PR tree-optimization/79649
	* tree-loop-distribution.c (classify_partition): Give up on
	non-generic address space loads/stores.

	* gcc.target/i386/pr79649.c: New test.

From-SVN: r245631
This commit is contained in:
Jakub Jelinek 2017-02-21 17:29:37 +01:00 committed by Jakub Jelinek
parent 5daaf2d5d9
commit d002d099b0
4 changed files with 69 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2017-02-21 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/79649
* tree-loop-distribution.c (classify_partition): Give up on
non-generic address space loads/stores.
2017-02-21 Aldy Hernandez <aldyh@redhat.com>
* doc/loop.texi (Loop manipulation): Remove nonexistent

3
gcc/testsuite/ChangeLog
View File

@ -1,5 +1,8 @@
2017-02-21 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/79649
* gcc.target/i386/pr79649.c: New test.
PR target/79494
* gcc.dg/pr79494.c: New test.

53
gcc/testsuite/gcc.target/i386/pr79649.c Normal file
View File

@ -0,0 +1,53 @@
/* PR tree-optimization/79649 */
/* { dg-do compile } */
/* { dg-options "-O3 -fdump-tree-optimized" } */
/* { dg-final { scan-tree-dump-not "__builtin_memset" "optimized" } } */
/* { dg-final { scan-tree-dump-not "__builtin_memcpy" "optimized" } } */
/* { dg-final { scan-tree-dump-not "__builtin_memmove" "optimized" } } */
typedef __SIZE_TYPE__ size_t;
void
f1 (unsigned char __seg_gs *s, size_t n)
{
for (size_t i = 0; i < n; ++i)
s[i] = 0;
}
void
f2 (unsigned char __seg_gs *__restrict d, unsigned char __seg_gs *__restrict s, size_t n)
{
for (size_t i = 0; i < n; ++i)
d[i] = s[i];
}
void
f3 (unsigned char __seg_gs *__restrict d, unsigned char *__restrict s, size_t n)
{
for (size_t i = 0; i < n; ++i)
d[i] = s[i];
}
void
f4 (unsigned char *__restrict d, unsigned char __seg_gs *__restrict s, size_t n)
{
for (size_t i = 0; i < n; ++i)
d[i] = s[i];
}
void
f5 (unsigned char __seg_gs *__restrict d, unsigned char __seg_fs *__restrict s, size_t n)
{
for (size_t i = 0; i < n; ++i)
d[i] = s[i];
}
struct A { int a; char b[1024]; };
extern struct A __seg_gs a;
void
f6 (size_t n)
{
for (size_t i = 0; i < n; ++i)
a.b[i] = 0;
}

7
gcc/tree-loop-distribution.c
View File

@ -1072,6 +1072,13 @@ classify_partition (loop_p loop, struct graph *rdg, partition *partition)
/* But exactly one store and/or load. */
for (j = 0; RDG_DATAREFS (rdg, i).iterate (j, &dr); ++j)
{
tree type = TREE_TYPE (DR_REF (dr));
/* The memset, memcpy and memmove library calls are only
able to deal with generic address space. */
if (!ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (type)))
return;
if (DR_IS_READ (dr))
{
if (single_load != NULL)