Lines Matching full:results
114 * We pass in the arguments and return the results so the compiler
120 int[] results = new int[10];
123 results[0] = x + y;
124 results[1] = x - y;
125 results[2] = x * y;
126 results[3] = x * x;
127 results[4] = x / y;
128 results[5] = x % -y;
129 results[6] = x & y;
130 results[7] = x | y;
131 results[8] = x ^ y;
134 results[9] = x + ((((((((x + y) - y) * y) / y) % y) & y) | y) ^ y);
136 return results;
138 static void intOperCheck(int[] results) {
143 int negOne = -results[5];
148 assert(results[0] == 69997);
149 assert(results[1] == 70003);
150 assert(results[2] == -210000);
151 assert(results[3] == 605032704); // overflow / truncate
152 assert(results[4] == -23333);
153 assert(results[5] == 1);
154 assert(results[6] == 70000);
155 assert(results[7] == -3);
156 assert(results[8] == -70003);
157 assert(results[9] == 70000);
166 int[] results = new int[8];
169 results[0] = x + 1000;
170 results[1] = 1000 - x;
171 results[2] = x * 1000;
172 results[3] = x / 1000;
173 results[4] = x % 1000;
174 results[5] = x & 1000;
175 results[6] = x | -1000;
176 results[7] = x ^ -1000;
177 return results;
179 static void lit16Check(int[] results) {
180 assert(results[0] == 78777);
181 assert(results[1] == -76777);
182 assert(results[2] == 77777000);
183 assert(results[3] == 77);
184 assert(results[4] == 777);
185 assert(results[5] == 960);
186 assert(results[6] == -39);
187 assert(results[7] == -76855);
196 int[] results = new int[8];
199 results[0] = x + 10;
200 results[1] = 10 - x;
201 results[2] = x * 10;
202 results[3] = x / 10;
203 results[4] = x % 10;
204 results[5] = x & 10;
205 results[6] = x | -10;
206 results[7] = x ^ -10;
207 return results;
209 static void lit8Check(int[] results) {
210 //for (int i = 0; i < results.length; i++)
211 // System.out.println(" " + i + ": " + results[i]);
218 assert(results[0] == -55545);
219 assert(results[1] == 55565);
220 assert(results[2] == -555550);
221 assert(results[3] == -5555);
222 assert(results[4] == -5);
223 assert(results[5] == 8);
224 assert(results[6] == -1);
225 assert(results[7] == 55563);
235 int results[] = new int[4];
237 results[0] = value << dist;
238 results[1] = value >> dist;
239 results[2] = value >>> dist;
241 results[3] = (((value << dist) >> dist) >>> dist) << dist;
242 return results;
244 static void intShiftCheck(int[] results) {
247 assert(results[0] == 0x00aa0100);
248 assert(results[1] == 0xffff00aa);
249 assert(results[2] == 0x00ff00aa);
250 assert(results[3] == 0xaa00);
254 * We pass in the arguments and return the results so the compiler
260 long[] results = new long[10];
263 results[0] = x + y;
264 results[1] = x - y;
265 results[2] = x * y;
266 results[3] = x * x;
267 results[4] = x / y;
268 results[5] = x % -y;
269 results[6] = x & y;
270 results[7] = x | y;
271 results[8] = x ^ y;
274 results[9] = x + ((((((((x + y) - y) * y) / y) % y) & y) | y) ^ y);
276 return results;
278 static void longOperCheck(long[] results) {
283 long negOne = -results[5];
288 assert(results[0] == 69999999997L);
289 assert(results[1] == 70000000003L);
290 assert(results[2] == -210000000000L);
291 assert(results[3] == -6833923606740729856L); // overflow
292 assert(results[4] == -23333333333L);
293 assert(results[5] == 1);
294 assert(results[6] == 70000000000L);
295 assert(results[7] == -3);
296 assert(results[8] == -70000000003L);
297 assert(results[9] == 70000000000L);
299 assert(results.length == 10);
308 long results[] = new long[4];
310 results[0] = value << dist;
311 results[1] = value >> dist;
312 results[2] = value >>> dist;
314 results[3] = (((value << dist) >> dist) >>> dist) << dist;
315 return results;
317 static long longShiftCheck(long[] results) {
320 assert(results[0] == 0x96deff00aa010000L);
321 assert(results[1] == 0xffffd5aa96deff00L);
322 assert(results[2] == 0x0000d5aa96deff00L);
323 assert(results[3] == 0xffff96deff000000L);
325 assert(results.length == 4);
327 return results[0]; // test return-long
