#include <stdarg.h>
#include "tree-vect.h"
#define N 16
struct s{
int m;
int n[N][N][N];
};
struct test1{
struct s a;
int b;
int c;
struct s e[N];
};
int main1 ()
{
int i,j;
struct test1 tmp1;
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
tmp1.e[i].n[1][2][j] = 8;
}
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
if (tmp1.e[i].n[1][2][j] != 8)
abort ();
}
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
tmp1.e[j].n[1][2][j] = 8;
}
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
if (tmp1.e[j].n[1][2][j] != 8)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}