blob: 8b55a2efbcd5bace9cf2656db4ed6debc9c8cd35 [file] [log] [blame]
/* { dg-do run } */
/* { dg-options "-fwhole-program" } */
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
void mem_init (void);
int ARCHnodes, ARCHnodes1;
int ***vel;
/* The inner most dimension escapes.
The two external dimensions are flattened
after being transposed. */
/*--------------------------------------------------------------------------*/
int
main (int argc, char **argv)
{
int i, j, k;
ARCHnodes = 2;
ARCHnodes1 = 4;
/* Dynamic memory allocations and initializations */
mem_init ();
for (j = 0; j < 4; j++)
{
for (i = 0; i < 3; i++)
{
for (k = 0; k < 2; k++)
{
printf ("[%d][%d][%d]=%d ", i, j, k, vel[k][i][j]);
}
printf ("\n");
}
printf ("\n");
}
vel[0][0]=vel[1][1];
for (i = 0; i < 2; i++)
for (j = 0; j < 3; j++)
if (i==1 && j==1)
continue;
else
free (vel[i][j]);
for (i = 0; i < 2; i++)
free (vel[i]);
free (vel);
return 0;
}
/*--------------------------------------------------------------------------*/
/* Dynamic memory allocations and initializations */
void
mem_init (void)
{
signed 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)
{
printf ("malloc failed for vel[%d]\n", i);
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++)
{
printf ("acc to dim2 ");
vel[i][j][k] = d;
d++;
}
}
}
printf ("\n");
}
/*--------------------------------------------------------------------------*/