Lines Matching refs:a0

48     long[] a0 = new long[ARRLEN];
56 test_init(a0);
57 test_addi(a0, a1);
58 test_lsai(a0, a1);
59 test_unrl_init(a0);
60 test_unrl_addi(a0, a1);
61 test_unrl_lsai(a0, a1);
67 test_init(a0);
69 errn += verify("test_init: ", i, a0[i], (long)(i&3));
71 test_addi(a0, a1);
73 errn += verify("test_addi: ", i, a0[i], (long)(i+(i&3)));
75 test_lsai(a0, a1);
77 errn += verify("test_lsai: ", i, a0[i], (long)(i<<(i&3)));
79 test_unrl_init(a0);
81 errn += verify("test_unrl_init: ", i, a0[i], (long)(i&3));
83 test_unrl_addi(a0, a1);
85 errn += verify("test_unrl_addi: ", i, a0[i], (long)(i+(i&3)));
87 test_unrl_lsai(a0, a1);
89 errn += verify("test_unrl_lsai: ", i, a0[i], (long)(i<<(i&3)));
101 test_init(a0);
108 test_addi(a0, a1);
115 test_lsai(a0, a1);
122 test_unrl_init(a0);
129 test_unrl_addi(a0, a1);
136 test_unrl_lsai(a0, a1);
144 static void test_init(long[] a0) {
145 for (int i = 0; i < a0.length; i+=1) {
146 a0[i] = (long)(i&3);
149 static void test_addi(long[] a0, long[] a1) {
150 for (int i = 0; i < a0.length; i+=1) {
151 a0[i] = (long)(a1[i]+(i&3));
154 static void test_lsai(long[] a0, long[] a1) {
155 for (int i = 0; i < a0.length; i+=1) {
156 a0[i] = (long)(a1[i]<<(i&3));
159 static void test_unrl_init(long[] a0) {
161 for (; i < a0.length-4; i+=4) {
162 a0[i+0] = 0;
163 a0[i+1] = 1;
164 a0[i+2] = 2;
165 a0[i+3] = 3;
167 for (; i < a0.length; i++) {
168 a0[i] = (long)(i&3);
171 static void test_unrl_addi(long[] a0, long[] a1) {
173 for (; i < a0.length-4; i+=4) {
174 a0[i+0] = (long)(a1[i+0]+0);
175 a0[i+1] = (long)(a1[i+1]+1);
176 a0[i+2] = (long)(a1[i+2]+2);
177 a0[i+3] = (long)(a1[i+3]+3);
179 for (; i < a0.length; i++) {
180 a0[i] = (long)(a1[i]+(i&3));
183 static void test_unrl_lsai(long[] a0, long[] a1) {
185 for (; i < a0.length-4; i+=4) {
186 a0[i+0] = (long)(a1[i+0]<<0);
187 a0[i+1] = (long)(a1[i+1]<<1);
188 a0[i+2] = (long)(a1[i+2]<<2);
189 a0[i+3] = (long)(a1[i+3]<<3);
191 for (; i < a0.length; i++) {
192 a0[i] = (long)(a1[i]<<(i&3));