diff options
| author | Hans-Peter Nilsson <hp@axis.com> | 2012-11-05 22:17:14 +0000 |
|---|---|---|
| committer | Hans-Peter Nilsson <hp@gcc.gnu.org> | 2012-11-05 22:17:14 +0000 |
| commit | 9052f54ccb2851e9814e86b40f4442411c96d822 (patch) | |
| tree | 998be7a944c1e3c9f967e9de1c001a9c0a1d69b6 /gcc | |
| parent | a7c552588a548d39116fbd94177de64ef4aa5664 (diff) | |
| download | gcc-9052f54ccb2851e9814e86b40f4442411c96d822.zip gcc-9052f54ccb2851e9814e86b40f4442411c96d822.tar.gz gcc-9052f54ccb2851e9814e86b40f4442411c96d822.tar.bz2 | |
re PR testsuite/55186 (gcc.dg/const-uniq-1.c fails due to vector expected but not being in the constant pool)
PR testsuite/55186
* gcc.dg/const-uniq-1.c (a): Increase length four times.
From-SVN: r193194
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/testsuite/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/testsuite/gcc.dg/const-uniq-1.c | 9 |
2 files changed, 12 insertions, 2 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index a14ad8b..0757405 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2012-11-05 Hans-Peter Nilsson <hp@axis.com> + + PR testsuite/55186 + * gcc.dg/const-uniq-1.c (a): Increase length four times. + 2012-11-05 Jack Howarth <howarth@bromo.med.uc.edu> * gcc.dg/torture/pr53922.c: Use -Wl,-undefined,dynamic_lookup on diff --git a/gcc/testsuite/gcc.dg/const-uniq-1.c b/gcc/testsuite/gcc.dg/const-uniq-1.c index 8172c67..6e2b6a3 100644 --- a/gcc/testsuite/gcc.dg/const-uniq-1.c +++ b/gcc/testsuite/gcc.dg/const-uniq-1.c @@ -5,13 +5,18 @@ int lookup1 (int i) { - int a[] = { 0, 1, 2, 3, 4, 5, 6, 7 }; + /* We use vectors long enough that piece-wise initialization is not + reasonably preferable even for size (when including the constant + vectors for initialization) for any target. */ + int a[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31 }; return a[i]; } int lookup2 (int i) { - int a[] = { 0, 1, 2, 3, 4, 5, 6, 7 }; + int a[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31 }; return a[i+1]; } |