__attribute__ ((noinline)) int main1 () { int i,j; /* Initialization. */ for (i = 0; i < N; i++) { b[i] = i*3; c[i] = i; d[i] = i*2; ic[i] = i*3; ib[i] = i*3; cb[i] = i*3; fadd_results[i] = b[i] + c[i] + d[i]; iadd_results[i] = ib[i] + ic[i]; fmul_results[i] = b[i] * c[i]; fresults1[i] = 0; fresults2[i] = 0; if (y) abort (); } /* Test 1: copy chars. */ for (i = 0; i < N; i++) { ca[i] = cb[i]; } /* check results: */ for (i = 0; i < N; i++) { if (ca[i] != cb[i]) abort (); } /* Test 2: fp mult. */ for (i = 0; i < N; i++) { a[i] = b[i] * c[i]; } fbar_mul (a); /* Test 3: mixed types (int, fp), same nunits in vector. */ for (i = 0; i < N; i++) { a[i] = b[i] + c[i] + d[i]; e[i] = b[i] + c[i] + d[i]; ia[i] = ib[i] + ic[i]; } ibar_add (ia); fbar_add (a); fbar_add (e); /* Initialization. */ for (i = 0; i < N; i++) { fresults1[i] = a[i]; fresults2[i] = e[i]; if (y) abort (); } for (i = 0; i < N/2; i++) { fresults1[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i]; fresults2[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i]; if (y) abort (); } /* Test 4: access with offset. */ for (i = 0; i < N/2; i++) { a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i]; e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i]; } fbar1 (a); fbar2 (e); /* Test 5: access with offset */ for (i = 1; i <=N-4; i++) { a[i+3] = b[i-1]; } /* check results: */ for (i = 1; i <=N-4; i++) { if (a[i+3] != b[i-1]) abort (); } /* Test 6 - loop induction with stride != 1. */ i = 0; j = 0; while (i < 5*N) { a[j] = c[j]; i += 5; j++; } /* check results: */ for (i = 0; i <N; i++) { if (a[i] != c[i]) abort (); } /* Test 7 - reverse access. */ for (i = N; i > 0; i--) { a[N-i] = d[N-i]; } /* check results: */ for (i = 0; i <N; i++) { if (a[i] != d[i]) abort (); } /* Tests 8,9,10 - constants. */ for (i = 0; i < N; i++) { a[i] = 5.0; } /* check results: */ for (i = 0; i < N; i++) { if (a[i] != 5.0) abort (); } for (i = 0; i < N; i++) { sa[i] = 5; } /* check results: */ for (i = 0; i < N; i++) { if (sa[i] != 5) abort (); } for (i = 0; i < N; i++) { ia[i] = ib[i] + 5; } /* check results: */ for (i = 0; i < N; i++) { if (ia[i] != ib[i] + 5) abort (); } return 0; }
int main1 () { int i,j; float a[N]; float e[N]; float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30}; int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; int ia[N]; char cb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; char ca[N]; short sa[N]; /* Test 1: copy chars. */ for (i = 0; i < N; i++) { ca[i] = cb[i]; } /* check results: */ for (i = 0; i < N; i++) { if (ca[i] != cb[i]) abort (); } /* Test 2: fp mult. */ for (i = 0; i < N; i++) { a[i] = b[i] * c[i]; } fbar_mul (a); /* Test 3: mixed types (int, fp), same nunits in vector. */ for (i = 0; i < N; i++) { a[i] = b[i] + c[i] + d[i]; e[i] = b[i] + c[i] + d[i]; ia[i] = ib[i] + ic[i]; } ibar_add (ia); fbar_add (a); fbar_add (e); /* Test 4: access with offset. */ for (i = 0; i < N/2; i++) { a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i]; e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i]; } fbar1 (a); fbar2 (e); /* Test 5: access with offset */ for (i = 1; i <=N-4; i++) { a[i+3] = b[i-1]; } /* check results: */ for (i = 1; i <=N-4; i++) { if (a[i+3] != b[i-1]) abort (); } /* Test 6 - loop induction with stride != 1. */ i = 0; j = 0; while (i < 5*N) { a[j] = c[j]; i += 5; j++; } /* check results: */ for (i = 0; i <N; i++) { if (a[i] != c[i]) abort (); } /* Test 7 - reverse access. */ for (i = N; i > 0; i--) { a[N-i] = d[N-i]; } /* check results: */ for (i = 0; i <N; i++) { if (a[i] != d[i]) abort (); } /* Tests 8,9,10 - constants. */ for (i = 0; i < N; i++) { a[i] = 5.0; } /* check results: */ for (i = 0; i < N; i++) { if (a[i] != 5.0) abort (); } for (i = 0; i < N; i++) { sa[i] = 5; } /* check results: */ for (i = 0; i < N; i++) { if (sa[i] != 5) abort (); } for (i = 0; i < N; i++) { ia[i] = ib[i] + 5; } /* check results: */ for (i = 0; i < N; i++) { if (ia[i] != ib[i] + 5) abort (); } return 0; }