From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001 From: upstream source tree Date: Sun, 15 Mar 2015 20:14:05 -0400 Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream tarball. downloading a git-generated archive based on the 'upstream' tag should provide you with a source tree that is binary identical to the one extracted from the above tarball. if you have obtained the source via the command 'git clone', however, do note that line-endings of files in your working directory might differ from line-endings of the respective files in the upstream repository. --- gcc/testsuite/gcc.dg/matrix/matrix-6.c | 97 ++++++++++++++++++++++++++++++++++ 1 file changed, 97 insertions(+) create mode 100644 gcc/testsuite/gcc.dg/matrix/matrix-6.c (limited to 'gcc/testsuite/gcc.dg/matrix/matrix-6.c') diff --git a/gcc/testsuite/gcc.dg/matrix/matrix-6.c b/gcc/testsuite/gcc.dg/matrix/matrix-6.c new file mode 100644 index 000000000..536afb537 --- /dev/null +++ b/gcc/testsuite/gcc.dg/matrix/matrix-6.c @@ -0,0 +1,97 @@ +/* { dg-do compile } */ + + +#include +#include +#include +#include + +void mem_init (void); +int ARCHnodes, ARCHnodes1; +int ***vel; + +/* The last dimension of VEL escapes because of + the assignment : *vel[1] =... + Only the two external dimensions are flattened. */ + +/*--------------------------------------------------------------------------*/ + +int +main (int argc, char **argv) +{ + int i, j, k; + + ARCHnodes = 2; + ARCHnodes1 = 4; + +/* Dynamic memory allocations and initializations */ + + mem_init (); + + for (i = 0; i < ARCHnodes; i++) + { + for (j = 0; j < 3; j++) + { + for (k = 0; k < ARCHnodes1; k++) + printf ("[%d][%d][%d]=%d ", i, j, k, vel[i][j][k]); + printf ("\n"); + } + printf ("\n"); + } + for (i = 0; i < ARCHnodes; i++) + for (j = 0; j < 3; j++) + free (vel[i][j]); + + for (i = 0; i < ARCHnodes; i++) + free (vel[i]); + + free (vel); + return 0; +} + +/*--------------------------------------------------------------------------*/ +/* Dynamic memory allocations and initializations */ + +void +mem_init (void) +{ + + int i, j, k,d; + + d = 0; + vel = (int ***) malloc (ARCHnodes * sizeof (int **)); + + for (i = 0; i < ARCHnodes; i++) + { + vel[i] = (int **) malloc (3 * sizeof (int *)); + if (vel[i] == (int **) NULL) + { + fprintf (stderr, "malloc failed for vel[%d]\n", i); + fflush (stderr); + exit (0); + } + } + for (i = 0; i < ARCHnodes; i++) + { + for (j = 0; j < 3; j++) + { + vel[i][j] = (int *) malloc (ARCHnodes1 * sizeof (int)); + } + } + for (i = 0; i < ARCHnodes; i++) + { + for (j = 0; j < 3; j++) + { + for (k = 0; k < ARCHnodes1; k++) + { + vel[i][j][k] = d; + d++; + } + } + } + *vel[1] = &d; +} + +/*--------------------------------------------------------------------------*/ +/* { dg-final { scan-ipa-dump-times "Flattened 2 dimensions" 1 "matrix-reorg" } } */ +/* { dg-final { cleanup-ipa-dump "matrix-reorg" } } */ -- cgit v1.2.3