Lines Matching refs:a0

47     double[] a0 = new double[ARRLEN];
55 test_init(a0);
56 test_addi(a0, a1);
57 test_divi(a0, a1);
58 test_unrl_init(a0);
59 test_unrl_addi(a0, a1);
60 test_unrl_divi(a0, a1);
66 test_init(a0);
68 errn += verify("test_init: ", i, a0[i], (double)(i&3));
70 test_addi(a0, a1);
72 errn += verify("test_addi: ", i, a0[i], (double)(i+(i&3)));
74 test_divi(a0, a1);
76 errn += verify("test_divi: ", i, a0[i], (double)i/(double)((i&3)+1));
78 test_unrl_init(a0);
80 errn += verify("test_unrl_init: ", i, a0[i], (double)(i&3));
82 test_unrl_addi(a0, a1);
84 errn += verify("test_unrl_addi: ", i, a0[i], (double)(i+(i&3)));
86 test_unrl_divi(a0, a1);
88 errn += verify("test_unrl_divi: ", i, a0[i], (double)i/(double)((i&3)+1));
100 test_init(a0);
107 test_addi(a0, a1);
114 test_divi(a0, a1);
121 test_unrl_init(a0);
128 test_unrl_addi(a0, a1);
135 test_unrl_divi(a0, a1);
143 static void test_init(double[] a0) {
144 for (int i = 0; i < a0.length; i+=1) {
145 a0[i] = (double)(i&3);
148 static void test_addi(double[] a0, double[] a1) {
149 for (int i = 0; i < a0.length; i+=1) {
150 a0[i] = a1[i]+(double)(i&3);
153 static void test_divi(double[] a0, double[] a1) {
154 for (int i = 0; i < a0.length; i+=1) {
155 a0[i] = a1[i]/(double)((i&3)+1);
158 static void test_unrl_init(double[] a0) {
160 for (; i < a0.length-4; i+=4) {
161 a0[i+0] = 0.;
162 a0[i+1] = 1.;
163 a0[i+2] = 2.;
164 a0[i+3] = 3.;
166 for (; i < a0.length; i++) {
167 a0[i] = (double)(i&3);
170 static void test_unrl_addi(double[] a0, double[] a1) {
172 for (; i < a0.length-4; i+=4) {
173 a0[i+0] = a1[i+0]+0.;
174 a0[i+1] = a1[i+1]+1.;
175 a0[i+2] = a1[i+2]+2.;
176 a0[i+3] = a1[i+3]+3.;
178 for (; i < a0.length; i++) {
179 a0[i] = a1[i]+(double)(i&3);
182 static void test_unrl_divi(double[] a0, double[] a1) {
184 for (; i < a0.length-4; i+=4) {
185 a0[i+0] = a1[i+0]/1.;
186 a0[i+1] = a1[i+1]/2.;
187 a0[i+2] = a1[i+2]/3.;
188 a0[i+3] = a1[i+3]/4.;
190 for (; i < a0.length; i++) {
191 a0[i] = a1[i]/(double)((i&3)+1);