1 /** Sanatised version of the dhrystone-2.1 test.
3 Modifications Michael Hope <michaelh@earthling.net>
5 This is derrived from the dhrystone-2.1.tar.gz tarball available
6 all over the net. I sourced it from the Red Hat src rpm.
9 * Made it more ANSI compliant.
10 * Changed any array function arguments to pointers to make my
12 * Removed malloc's for a couple of static arrays.
14 * Proc_8 is a bit messy. It originally took a 2 dim array, but
15 sdcc doesnt support this. So the offsets are hard coded...
18 * The comment at the start of Func_1 about the input being
19 H, R on the first call is wrong - Func_1 is first called
20 from Func_2 where the input is R, Y. The test still succeeds.
22 I couldnt find a copyright in the original - the most relevent
26 I didn't write the DHRYSTONE benchmark. Rheinhold Weicker did. He has
27 certainly provided us with a useful tool for benchmarking, and is
32 (201) 389-8963 (9-17 EST)
33 (201) 542-3734 (7-9,17-24 EST)
34 ...!uunet!pcrat!rick (normal mail)
35 ...!uunet!pcrat!dry2 (results only)
40 /* Temporary definitions. Remove soon :) */
42 void *memcpy(void *dest, const char *src, int wLen);
44 char *strcpy(char *dest, const char *src);
45 int strcmp(const char *s1, const char *s2);
54 int Arr_2_Glob [50] [50];
56 /* Used instead of malloc() */
57 static Rec_Type _r[2];
59 void Proc_1 (REG Rec_Pointer Ptr_Val_Par);
60 void Proc_2 (One_Fifty *Int_Par_Ref);
63 void Proc_7 (One_Fifty Int_1_Par_Val, One_Fifty Int_2_Par_Val, One_Fifty *Int_Par_Ref);
64 void Proc_8 (int *Arr_1_Par_Ref, int *Arr_2_Par_Ref,
65 int Int_1_Par_Val, int Int_2_Par_Val);
66 void Proc_6 (Enumeration Enum_Val_Par, Enumeration *Enum_Ref_Par);
67 void Proc_3 (Rec_Pointer *Ptr_Ref_Par);
68 Enumeration Func_1 (Capital_Letter Ch_1_Par_Val, Capital_Letter Ch_2_Par_Val);
69 Boolean Func_2 (char *Str_1_Par_Ref, char *Str_2_Par_Ref);
70 Boolean Func_3 (Enumeration Enum_Par_Val);
72 void printf(const char *format, ...);
75 /*#define DPRINTF(_a) printf _a*/
87 REG One_Fifty Int_2_Loc;
89 REG Capital_Letter Ch_Index;
94 REG int Number_Of_Runs;
98 Next_Ptr_Glob = &_r[0];
101 Ptr_Glob->Ptr_Comp = Next_Ptr_Glob;
102 Ptr_Glob->Discr = Ident_1;
103 Ptr_Glob->variant.var_1.Enum_Comp = Ident_3;
104 Ptr_Glob->variant.var_1.Int_Comp = 40;
106 strcpy (Ptr_Glob->variant.var_1.Str_Comp,
107 "DHRYSTONE PROGRAM, SOME STRING");
108 strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");
110 Arr_2_Glob [8][7] = 10;
111 /* Was missing in published program. Without this statement, */
112 /* Arr_2_Glob [8][7] would have an undefined value. */
113 /* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */
114 /* overflow may occur for this array element. */
116 Number_Of_Runs = 5000;
119 for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index) {
120 DPRINTF(("Run_Index = %d\n", Run_Index));
123 /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */
124 DPRINTF(("Ch_1_Glob '%c' == 'A', Ch_2_Glob '%c' == 'B', Bool_Glob %d == 1\n", Ch_1_Glob, Ch_2_Glob, Bool_Glob));
128 strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");
130 Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc);
132 DPRINTF(("Bool_Glob %d == 1, Int_1_Loc %d == 2, Int_2_Loc %d == 3\n", Bool_Glob, Int_1_Loc, Int_2_Loc));
133 while (Int_1_Loc < Int_2_Loc) /* loop body executed once */
135 DPRINTF(("m.1 Executes once.\n"));
136 Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc;
138 DPRINTF(("Int_3_Loc %d == 7\n", Int_3_Loc));
139 DPRINTF(("Proc_7\n"));
140 Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc);
144 DPRINTF(("m.2 Check above executed once.\n"));
145 /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
146 DPRINTF(("Int_1_Loc %d == 3, Int_2_Loc %d == 3, Int_3_Loc %d == 7\n",
147 Int_1_Loc, Int_2_Loc, Int_3_Loc));
149 DPRINTF(("Proc_8\n"));
150 Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc);
152 DPRINTF(("Int_Glob %d == 5\n", Int_Glob));
153 DPRINTF(("Proc_1\n"));
155 for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index)
156 /* loop body executed twice */
158 DPRINTF(("Func_1\n"));
159 if (Enum_Loc == Func_1 (Ch_Index, 'C'))
160 /* then, not executed */
162 DPRINTF(("Proc_6\n"));
163 Proc_6 (Ident_1, &Enum_Loc);
164 strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");
165 Int_2_Loc = Run_Index;
166 Int_Glob = Run_Index;
169 /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
170 DPRINTF(("Int_1_Loc %d == 3, Int_2_Loc %d == 3, Int_3_Loc %d == 7\n",
171 Int_1_Loc, Int_2_Loc, Int_3_Loc));
173 Int_2_Loc = Int_2_Loc * Int_1_Loc;
174 Int_1_Loc = Int_2_Loc / Int_3_Loc;
175 Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc;
176 /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */
177 DPRINTF(("Int_1_Loc %d == 1, Int_2_Loc %d == 13, Int_3_Loc %d == 7\n",
178 Int_1_Loc, Int_2_Loc, Int_3_Loc));
179 DPRINTF(("Proc_2\n"));
182 DPRINTF(("Int_1_Loc %d == 5\n", Int_1_Loc));
183 DPRINTF(("Looping.\n"));
184 } /* loop "for Run_Index" */
186 printf("Run_Index = %d\n", Run_Index);
188 printf ("Execution ends\n");
190 printf ("Final values of the variables used in the benchmark:\n");
192 printf ("Int_Glob: %d\n", Int_Glob);
193 printf (" should be: %d\n", (int)5);
194 printf ("Bool_Glob: %d\n", Bool_Glob);
195 printf (" should be: %d\n", (int)1);
196 printf ("Ch_1_Glob: %c\n", Ch_1_Glob);
197 printf (" should be: %c\n", 'A');
198 printf ("Ch_2_Glob: %c\n", Ch_2_Glob);
199 printf (" should be: %c\n", 'B');
200 printf ("Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]);
201 printf (" should be: %d\n", (int)7);
202 printf ("Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]);
203 printf (" should be: Number_Of_Runs + 10\n");
204 printf ("Ptr_Glob->\n");
205 printf (" Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp);
206 printf (" should be: (implementation-dependent)\n");
207 printf (" Discr: %d\n", (int)Ptr_Glob->Discr);
208 printf (" should be: %d\n", (int)0);
209 printf (" Enum_Comp: %d\n", (int)Ptr_Glob->variant.var_1.Enum_Comp);
210 printf (" should be: %d\n", (int)2);
211 printf (" Int_Comp: %d\n", (int)Ptr_Glob->variant.var_1.Int_Comp);
212 printf (" should be: %d\n", (int)17);
213 printf (" Str_Comp: %s\n", (char *)Ptr_Glob->variant.var_1.Str_Comp);
214 printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");
215 printf ("Next_Ptr_Glob->\n");
216 printf (" Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp);
217 printf (" should be: (implementation-dependent), same as above\n");
218 printf (" Discr: %d\n", Next_Ptr_Glob->Discr);
219 printf (" should be: %d\n", (int)0);
220 printf (" Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp);
221 printf (" should be: %d\n", (int)1);
222 printf (" Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp);
223 printf (" should be: %d\n", (int)18);
224 printf (" Str_Comp: %s\n",
225 Next_Ptr_Glob->variant.var_1.Str_Comp);
226 printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");
227 printf ("Int_1_Loc: %d\n", Int_1_Loc);
228 printf (" should be: %d\n", (int)5);
229 printf ("Int_2_Loc: %d\n", Int_2_Loc);
230 printf (" should be: %d\n", (int)13);
231 printf ("Int_3_Loc: %d\n", Int_3_Loc);
232 printf (" should be: %d\n", (int)7);
233 printf ("Enum_Loc: %d\n", Enum_Loc);
234 printf (" should be: %d\n", (int)1);
235 printf ("Str_1_Loc: %s\n", Str_1_Loc);
236 printf (" should be: DHRYSTONE PROGRAM, 1'ST STRING\n");
237 printf ("Str_2_Loc: %s\n", Str_2_Loc);
238 printf (" should be: DHRYSTONE PROGRAM, 2'ND STRING\n");
242 void Proc_1 (REG Rec_Pointer Ptr_Val_Par)
245 REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp;
246 /* == Ptr_Glob_Next */
247 /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */
248 /* corresponds to "rename" in Ada, "with" in Pascal */
250 structassign (*Ptr_Val_Par->Ptr_Comp, *Ptr_Glob);
251 Ptr_Val_Par->variant.var_1.Int_Comp = 5;
252 Next_Record->variant.var_1.Int_Comp
253 = Ptr_Val_Par->variant.var_1.Int_Comp;
254 Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp;
255 Proc_3 (&Next_Record->Ptr_Comp);
256 /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp
257 == Ptr_Glob->Ptr_Comp */
258 if (Next_Record->Discr == Ident_1)
261 Next_Record->variant.var_1.Int_Comp = 6;
262 Proc_6 (Ptr_Val_Par->variant.var_1.Enum_Comp,
263 &Next_Record->variant.var_1.Enum_Comp);
264 Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp;
265 Proc_7 (Next_Record->variant.var_1.Int_Comp, 10,
266 &Next_Record->variant.var_1.Int_Comp);
268 else /* not executed */
269 structassign (*Ptr_Val_Par, *Ptr_Val_Par->Ptr_Comp);
273 void Proc_2 (One_Fifty *Int_Par_Ref)
276 /* *Int_Par_Ref == 1, becomes 4 */
279 Enumeration Enum_Loc;
281 DPRINTF(("-> Proc_2\n"));
283 Int_Loc = *Int_Par_Ref + 10;
287 if (Ch_1_Glob == 'A')
292 *Int_Par_Ref = Int_Loc - Int_Glob;
296 } while (Enum_Loc != Ident_1); /* true */
297 DPRINTF(("Proc_2 done.\n"));
301 void Proc_3 (Rec_Pointer *Ptr_Ref_Par)
304 /* Ptr_Ref_Par becomes Ptr_Glob */
306 if (Ptr_Glob != Null)
308 *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp;
309 Proc_7 (10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp);
312 void Proc_4 (void) /* without parameters */
318 DPRINTF(("-> Proc_4\n"));
319 Bool_Loc = Ch_1_Glob == 'A';
320 Bool_Glob = Bool_Loc | Bool_Glob;
322 DPRINTF(("Expect Ch_1_Glob '%c' == 'A'\n", (char)Ch_1_Glob));
323 DPRINTF((" Ch_2_Glob '%c' == 'B'\n", (char)Ch_2_Glob));
324 DPRINTF((" Bool_Loc %d == 1\n", (unsigned)Bool_Loc));
325 DPRINTF((" Bool_Glob %d == 1\n", (unsigned)Bool_Glob));
329 void Proc_5 () /* without parameters */
337 void Proc_6 (Enumeration Enum_Val_Par, Enumeration *Enum_Ref_Par)
338 /*********************************/
340 /* Enum_Val_Par == Ident_3, Enum_Ref_Par becomes Ident_2 */
343 *Enum_Ref_Par = Enum_Val_Par;
344 if (! Func_3 (Enum_Val_Par))
345 /* then, not executed */
346 *Enum_Ref_Par = Ident_4;
347 switch (Enum_Val_Par)
350 *Enum_Ref_Par = Ident_1;
355 *Enum_Ref_Par = Ident_1;
356 else *Enum_Ref_Par = Ident_4;
358 case Ident_3: /* executed */
359 *Enum_Ref_Par = Ident_2;
363 *Enum_Ref_Par = Ident_3;
369 /*************************************************/
370 /* executed three times */
371 /* first call: Ch_1_Par_Val == 'H', Ch_2_Par_Val == 'R' */
372 /* second call: Ch_1_Par_Val == 'A', Ch_2_Par_Val == 'C' */
373 /* third call: Ch_1_Par_Val == 'B', Ch_2_Par_Val == 'C' */
374 Enumeration Func_1 (Capital_Letter Ch_1_Par_Val, Capital_Letter Ch_2_Par_Val)
376 Capital_Letter Ch_1_Loc;
377 Capital_Letter Ch_2_Loc;
379 DPRINTF(("-> Func_1\n"));
380 DPRINTF((" Inputs: Ch_1_Par_Val '%c' == { H, A, B }\n", (char)Ch_1_Par_Val));
381 DPRINTF((" Ch_2_Par_Val '%c' == { R, C, C }\n", (char)Ch_2_Par_Val));
383 Ch_1_Loc = Ch_1_Par_Val;
385 if (Ch_2_Loc != Ch_2_Par_Val) {
389 else /* not executed */
391 Ch_1_Glob = Ch_1_Loc;
396 Boolean Func_3 (Enumeration Enum_Par_Val)
397 /***************************/
399 /* Enum_Par_Val == Ident_3 */
401 Enumeration Enum_Loc;
403 Enum_Loc = Enum_Par_Val;
404 if (Enum_Loc == Ident_3)
407 else /* not executed */
411 void Proc_7 (One_Fifty Int_1_Par_Val, One_Fifty Int_2_Par_Val, One_Fifty *Int_Par_Ref)
412 /**********************************************/
413 /* executed three times */
414 /* first call: Int_1_Par_Val == 2, Int_2_Par_Val == 3, */
415 /* Int_Par_Ref becomes 7 */
416 /* second call: Int_1_Par_Val == 10, Int_2_Par_Val == 5, */
417 /* Int_Par_Ref becomes 17 */
418 /* third call: Int_1_Par_Val == 6, Int_2_Par_Val == 10, */
419 /* Int_Par_Ref becomes 18 */
423 Int_Loc = Int_1_Par_Val + 2;
424 *Int_Par_Ref = Int_2_Par_Val + Int_Loc;
427 /*void Proc_8 (Arr_1_Dim Arr_1_Par_Ref, Arr_2_Dim Arr_2_Par_Ref,
428 int Int_1_Par_Val, int Int_2_Par_Val)*/
429 void Proc_8 (int *Arr_1_Par_Ref, int *Arr_2_Par_Ref,
430 int Int_1_Par_Val, int Int_2_Par_Val)
432 REG One_Fifty Int_Index;
433 REG One_Fifty Int_Loc;
435 DPRINTF(("-> Proc_8\n"));
436 Int_Loc = Int_1_Par_Val + 5;
437 Arr_1_Par_Ref [Int_Loc] = Int_2_Par_Val;
438 DPRINTF(("Int_Loc %d == 8\n", Int_Loc));
440 Arr_1_Par_Ref [Int_Loc+1] = Arr_1_Par_Ref [Int_Loc];
441 Arr_1_Par_Ref [Int_Loc+30] = Int_Loc;
442 for (Int_Index = Int_Loc; Int_Index <= Int_Loc+1; ++Int_Index)
443 Arr_2_Par_Ref [Int_Loc*50 + Int_Index] = Int_Loc;
444 Arr_2_Par_Ref [Int_Loc * 50 + Int_Loc-1] += 1;
445 Arr_2_Par_Ref [(Int_Loc+20 *50) + Int_Loc] = Arr_1_Par_Ref [Int_Loc];
449 /*********************************************************************/
451 /* Int_Par_Val_1 == 3 */
452 /* Int_Par_Val_2 == 7 */
453 Boolean Func_2 (char *Str_1_Par_Ref, char *Str_2_Par_Ref)
454 /*************************************************/
456 /* Str_1_Par_Ref == "DHRYSTONE PROGRAM, 1'ST STRING" */
457 /* Str_2_Par_Ref == "DHRYSTONE PROGRAM, 2'ND STRING" */
459 REG One_Thirty Int_Loc;
460 Capital_Letter Ch_Loc;
462 DPRINTF(("-> Func_2\n"));
463 DPRINTF((" Inputs Str_1_Par_Ref \"%s\" = \"DHRYSTONE PROGRAM, 1'ST STRING\"\n", Str_1_Par_Ref));
464 DPRINTF((" Str_2_Par_Ref \"%s\" = \"DHRYSTONE PROGRAM, 2'ND STRING\"\n", Str_2_Par_Ref));
468 while (Int_Loc <= 2) {
471 DPRINTF((" 2.1 Runs once Int_Loc %u = 2.\n", (unsigned)Int_Loc));
472 /* loop body executed once */
473 a = Str_1_Par_Ref[Int_Loc];
474 b = Str_2_Par_Ref[Int_Loc+1];
475 if (Func_1 (a, b) == Ident_1)
477 if (Func_1 (Str_1_Par_Ref[Int_Loc],
478 Str_2_Par_Ref[Int_Loc+1]) == Ident_1)
482 DPRINTF((" 2.3 Then OK.\n"));
487 DPRINTF((" 2.2 Error.\n"));
490 if (Ch_Loc >= 'W' && Ch_Loc < 'Z') {
491 /* then, not executed */
492 DPRINTF((" 2.4 Error\n"));
496 /* then, not executed */
497 DPRINTF((" 2.5 Error\n"));
502 DPRINTF(("Str_1_Par_Ref = \"%s\", Str_2_Par_Ref = \"%s\"\n",
503 Str_1_Par_Ref, Str_2_Par_Ref));
504 if (strcmp (Str_1_Par_Ref, Str_2_Par_Ref) > 0)
505 /* then, not executed */
507 DPRINTF((" 2.5 Error diff=%d\n", strcmp(Str_1_Par_Ref, Str_2_Par_Ref)));
514 DPRINTF((" 2.6 OK\n"));