section-anchors-vect-69.c [plain text]
#include <stdarg.h>
#include "tree-vect.h"
#define N 32
struct s{
int m;
int n[N][N][N];
};
struct s2{
int m;
int n[N-1][N-1][N-1];
};
struct test1{
struct s a;
int b;
int c;
struct s e;
};
struct test2{
struct s2 a;
int b;
int c;
struct s2 e;
};
struct test1 tmp1[4];
struct test2 tmp2[4];
int main1 ()
{
int i,j;
for (i = 0; i < N; i++)
{
tmp1[2].a.n[1][2][i] = 5;
}
for (i = 0; i <N; i++)
{
if (tmp1[2].a.n[1][2][i] != 5)
abort ();
}
for (i = 3; i < N-1; i++)
{
tmp1[2].a.n[1][2][i] = 6;
}
for (i = 3; i < N-1; i++)
{
if (tmp1[2].a.n[1][2][i] != 6)
abort ();
}
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
tmp1[2].e.n[1][i][j] = 8;
}
}
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
if (tmp1[2].e.n[1][i][j] != 8)
abort ();
}
}
for (i = 0; i < N-4; i++)
{
for (j = 0; j < N-4; j++)
{
tmp2[2].e.n[1][i][j] = 8;
}
}
for (i = 0; i < N-4; i++)
{
for (j = 0; j < N-4; j++)
{
if (tmp2[2].e.n[1][i][j] != 8)
abort ();
}
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}