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.
23 * http://www.netlib.org/performance/html/dhry.intro.html
24 * http://www.netlib.org/performance/html/dhry.data.col0.html
26 I couldnt find a copyright in the original - the most relevent
30 I didn't write the DHRYSTONE benchmark. Rheinhold Weicker did. He has
31 certainly provided us with a useful tool for benchmarking, and is
36 (201) 389-8963 (9-17 EST)
37 (201) 542-3734 (7-9,17-24 EST)
38 ...!uunet!pcrat!rick (normal mail)
39 ...!uunet!pcrat!dry2 (results only)
50 /** Print the number of t-states this program has been executing for.
53 void _printTStates(void);
55 /** Set to one to print more messages about expected values etc.
60 #define DPRINTF(_a) printf _a
72 int Arr_2_Glob [50] [50];
74 /* Used instead of malloc() */
75 static Rec_Type _r[2];
77 void Proc_1 (REG Rec_Pointer Ptr_Val_Par);
78 void Proc_2 (One_Fifty *Int_Par_Ref);
81 void Proc_7 (One_Fifty Int_1_Par_Val, One_Fifty Int_2_Par_Val, One_Fifty *Int_Par_Ref);
82 void Proc_8 (int *Arr_1_Par_Ref, int *Arr_2_Par_Ref,
83 int Int_1_Par_Val, int Int_2_Par_Val);
84 void Proc_6 (Enumeration Enum_Val_Par, Enumeration *Enum_Ref_Par);
85 void Proc_3 (Rec_Pointer *Ptr_Ref_Par);
86 Enumeration Func_1 (Capital_Letter Ch_1_Par_Val, Capital_Letter Ch_2_Par_Val);
87 Boolean Func_2 (char *Str_1_Par_Ref, char *Str_2_Par_Ref);
88 Boolean Func_3 (Enumeration Enum_Par_Val);
93 REG One_Fifty Int_2_Loc;
95 REG Capital_Letter Ch_Index;
100 REG int Number_Of_Runs;
105 Next_Ptr_Glob = &_r[0];
109 Ptr_Glob->Ptr_Comp = Next_Ptr_Glob;
110 Ptr_Glob->Discr = Ident_1;
111 Ptr_Glob->variant.var_1.Enum_Comp = Ident_3;
112 Ptr_Glob->variant.var_1.Int_Comp = 40;
114 strcpy (Ptr_Glob->variant.var_1.Str_Comp,
115 "DHRYSTONE PROGRAM, SOME STRING");
116 strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");
118 Arr_2_Glob [8][7] = 10;
120 /* Was missing in published program. Without this statement, */
121 /* Arr_2_Glob [8][7] would have an undefined value. */
122 /* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */
123 /* overflow may occur for this array element. */
125 /* 32766 is the highest value for a 16 bitter */
126 Number_Of_Runs = 32766;
131 for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index) {
132 DPRINTF(("Run_Index = %d\n", Run_Index));
135 /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */
136 DPRINTF(("Ch_1_Glob '%c' == 'A', Ch_2_Glob '%c' == 'B', Bool_Glob %d == 1\n", Ch_1_Glob, Ch_2_Glob, Bool_Glob));
140 strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");
142 Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc);
144 DPRINTF(("Bool_Glob %d == 1, Int_1_Loc %d == 2, Int_2_Loc %d == 3\n", Bool_Glob, Int_1_Loc, Int_2_Loc));
145 while (Int_1_Loc < Int_2_Loc) /* loop body executed once */
147 DPRINTF(("m.1 Executes once.\n"));
148 Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc;
150 DPRINTF(("Int_3_Loc %d == 7\n", Int_3_Loc));
151 DPRINTF(("Proc_7\n"));
152 Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc);
156 DPRINTF(("m.2 Check above executed once.\n"));
157 /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
158 DPRINTF(("Int_1_Loc %d == 3, Int_2_Loc %d == 3, Int_3_Loc %d == 7\n",
159 Int_1_Loc, Int_2_Loc, Int_3_Loc));
161 DPRINTF(("Proc_8\n"));
162 Proc_8 (Arr_1_Glob, (int *)Arr_2_Glob, Int_1_Loc, Int_3_Loc);
164 DPRINTF(("Int_Glob %d == 5\n", Int_Glob));
165 DPRINTF(("Proc_1\n"));
167 for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index)
168 /* loop body executed twice */
170 DPRINTF(("Func_1\n"));
171 if (Enum_Loc == Func_1 (Ch_Index, 'C'))
172 /* then, not executed */
174 DPRINTF(("Proc_6\n"));
175 Proc_6 (Ident_1, &Enum_Loc);
176 strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");
177 Int_2_Loc = Run_Index;
178 Int_Glob = Run_Index;
181 /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
182 DPRINTF(("Int_1_Loc %d == 3, Int_2_Loc %d == 3, Int_3_Loc %d == 7\n",
183 Int_1_Loc, Int_2_Loc, Int_3_Loc));
185 Int_2_Loc = Int_2_Loc * Int_1_Loc;
186 Int_1_Loc = Int_2_Loc / Int_3_Loc;
187 Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc;
188 /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */
189 DPRINTF(("Int_1_Loc %d == 1, Int_2_Loc %d == 13, Int_3_Loc %d == 7\n",
190 Int_1_Loc, Int_2_Loc, Int_3_Loc));
191 DPRINTF(("Proc_2\n"));
194 DPRINTF(("Int_1_Loc %d == 5\n", Int_1_Loc));
195 DPRINTF(("Looping.\n"));
196 } /* loop "for Run_Index" */
200 printf("Run_Index = %d\n", Run_Index);
202 runTime = clock() - runTime;
204 printf ("Execution ends\n");
206 printf ("Final values of the variables used in the benchmark:\n");
208 printf ("Int_Glob: %d\n", Int_Glob);
209 printf (" should be: %d\n", (int)5);
210 printf ("Bool_Glob: %d\n", Bool_Glob);
211 printf (" should be: %d\n", (int)1);
212 printf ("Ch_1_Glob: %c\n", Ch_1_Glob);
213 printf (" should be: %c\n", 'A');
214 printf ("Ch_2_Glob: %c\n", Ch_2_Glob);
215 printf (" should be: %c\n", 'B');
216 printf ("Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]);
217 printf (" should be: %d\n", (int)7);
218 printf ("Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]);
219 printf (" should be: Number_Of_Runs + 10\n");
220 printf ("Ptr_Glob->\n");
221 printf (" Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp);
222 printf (" should be: (implementation-dependent)\n");
223 printf (" Discr: %d\n", (int)Ptr_Glob->Discr);
224 printf (" should be: %d\n", (int)0);
225 printf (" Enum_Comp: %d\n", (int)Ptr_Glob->variant.var_1.Enum_Comp);
226 printf (" should be: %d\n", (int)2);
227 printf (" Int_Comp: %d\n", (int)Ptr_Glob->variant.var_1.Int_Comp);
228 printf (" should be: %d\n", (int)17);
229 printf (" Str_Comp: %s\n", (char *)Ptr_Glob->variant.var_1.Str_Comp);
230 printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");
231 printf ("Next_Ptr_Glob->\n");
232 printf (" Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp);
233 printf (" should be: (implementation-dependent), same as above\n");
234 printf (" Discr: %d\n", Next_Ptr_Glob->Discr);
235 printf (" should be: %d\n", (int)0);
236 printf (" Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp);
237 printf (" should be: %d\n", (int)1);
238 printf (" Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp);
239 printf (" should be: %d\n", (int)18);
240 printf (" Str_Comp: %s\n",
241 Next_Ptr_Glob->variant.var_1.Str_Comp);
242 printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");
243 printf ("Int_1_Loc: %d\n", Int_1_Loc);
244 printf (" should be: %d\n", (int)5);
245 printf ("Int_2_Loc: %d\n", Int_2_Loc);
246 printf (" should be: %d\n", (int)13);
247 printf ("Int_3_Loc: %d\n", Int_3_Loc);
248 printf (" should be: %d\n", (int)7);
249 printf ("Enum_Loc: %d\n", Enum_Loc);
250 printf (" should be: %d\n", (int)1);
251 printf ("Str_1_Loc: %s\n", Str_1_Loc);
252 printf (" should be: DHRYSTONE PROGRAM, 1'ST STRING\n");
253 printf ("Str_2_Loc: %s\n", Str_2_Loc);
254 printf (" should be: DHRYSTONE PROGRAM, 2'ND STRING\n");
257 printf("Time: %u ticks\n", runTime);
258 printf("Dhrystones/s = %u\n", Number_Of_Runs / (runTime/CLOCKS_PER_SEC));
259 printf("MIPS = d/s/1757 = (sigh, need floats...)\n");
263 void Proc_1 (REG Rec_Pointer Ptr_Val_Par)
266 REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp;
267 /* == Ptr_Glob_Next */
268 /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */
269 /* corresponds to "rename" in Ada, "with" in Pascal */
271 structassign (*Ptr_Val_Par->Ptr_Comp, *Ptr_Glob);
272 Ptr_Val_Par->variant.var_1.Int_Comp = 5;
273 Next_Record->variant.var_1.Int_Comp
274 = Ptr_Val_Par->variant.var_1.Int_Comp;
275 Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp;
276 Proc_3 (&Next_Record->Ptr_Comp);
277 /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp
278 == Ptr_Glob->Ptr_Comp */
279 if (Next_Record->Discr == Ident_1)
282 Next_Record->variant.var_1.Int_Comp = 6;
283 Proc_6 (Ptr_Val_Par->variant.var_1.Enum_Comp,
284 &Next_Record->variant.var_1.Enum_Comp);
285 Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp;
286 Proc_7 (Next_Record->variant.var_1.Int_Comp, 10,
287 &Next_Record->variant.var_1.Int_Comp);
289 else /* not executed */
290 structassign (*Ptr_Val_Par, *Ptr_Val_Par->Ptr_Comp);
294 void Proc_2 (One_Fifty *Int_Par_Ref)
297 /* *Int_Par_Ref == 1, becomes 4 */
300 Enumeration Enum_Loc;
302 DPRINTF(("-> Proc_2\n"));
304 Int_Loc = *Int_Par_Ref + 10;
308 if (Ch_1_Glob == 'A')
313 *Int_Par_Ref = Int_Loc - Int_Glob;
317 } while (Enum_Loc != Ident_1); /* true */
318 DPRINTF(("Proc_2 done.\n"));
322 void Proc_3 (Rec_Pointer *Ptr_Ref_Par)
325 /* Ptr_Ref_Par becomes Ptr_Glob */
327 if (Ptr_Glob != Null)
329 *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp;
330 Proc_7 (10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp);
333 void Proc_4 (void) /* without parameters */
339 DPRINTF(("-> Proc_4\n"));
340 Bool_Loc = Ch_1_Glob == 'A';
341 Bool_Glob = Bool_Loc | Bool_Glob;
343 DPRINTF(("Expect Ch_1_Glob '%c' == 'A'\n", (char)Ch_1_Glob));
344 DPRINTF((" Ch_2_Glob '%c' == 'B'\n", (char)Ch_2_Glob));
345 DPRINTF((" Bool_Loc %d == 1\n", (unsigned)Bool_Loc));
346 DPRINTF((" Bool_Glob %d == 1\n", (unsigned)Bool_Glob));
350 void Proc_5 () /* without parameters */
358 void Proc_6 (Enumeration Enum_Val_Par, Enumeration *Enum_Ref_Par)
359 /*********************************/
361 /* Enum_Val_Par == Ident_3, Enum_Ref_Par becomes Ident_2 */
364 *Enum_Ref_Par = Enum_Val_Par;
365 if (! Func_3 (Enum_Val_Par))
366 /* then, not executed */
367 *Enum_Ref_Par = Ident_4;
368 switch (Enum_Val_Par)
371 *Enum_Ref_Par = Ident_1;
376 *Enum_Ref_Par = Ident_1;
377 else *Enum_Ref_Par = Ident_4;
379 case Ident_3: /* executed */
380 *Enum_Ref_Par = Ident_2;
384 *Enum_Ref_Par = Ident_3;
390 /*************************************************/
391 /* executed three times */
392 /* first call: Ch_1_Par_Val == 'H', Ch_2_Par_Val == 'R' */
393 /* second call: Ch_1_Par_Val == 'A', Ch_2_Par_Val == 'C' */
394 /* third call: Ch_1_Par_Val == 'B', Ch_2_Par_Val == 'C' */
395 Enumeration Func_1 (Capital_Letter Ch_1_Par_Val, Capital_Letter Ch_2_Par_Val)
397 Capital_Letter Ch_1_Loc;
398 Capital_Letter Ch_2_Loc;
400 DPRINTF(("-> Func_1\n"));
401 DPRINTF((" Inputs: Ch_1_Par_Val '%c' == { R, A, B }\n", (char)Ch_1_Par_Val));
402 DPRINTF((" Ch_2_Par_Val '%c' == { Y, C, C }\n", (char)Ch_2_Par_Val));
404 Ch_1_Loc = Ch_1_Par_Val;
406 if (Ch_2_Loc != Ch_2_Par_Val) {
410 else /* not executed */
412 Ch_1_Glob = Ch_1_Loc;
417 Boolean Func_3 (Enumeration Enum_Par_Val)
418 /***************************/
420 /* Enum_Par_Val == Ident_3 */
422 Enumeration Enum_Loc;
424 Enum_Loc = Enum_Par_Val;
425 if (Enum_Loc == Ident_3)
428 else /* not executed */
432 void Proc_7 (One_Fifty Int_1_Par_Val, One_Fifty Int_2_Par_Val, One_Fifty *Int_Par_Ref)
433 /**********************************************/
434 /* executed three times */
435 /* first call: Int_1_Par_Val == 2, Int_2_Par_Val == 3, */
436 /* Int_Par_Ref becomes 7 */
437 /* second call: Int_1_Par_Val == 10, Int_2_Par_Val == 5, */
438 /* Int_Par_Ref becomes 17 */
439 /* third call: Int_1_Par_Val == 6, Int_2_Par_Val == 10, */
440 /* Int_Par_Ref becomes 18 */
444 Int_Loc = Int_1_Par_Val + 2;
445 *Int_Par_Ref = Int_2_Par_Val + Int_Loc;
448 /*void Proc_8 (Arr_1_Dim Arr_1_Par_Ref, Arr_2_Dim Arr_2_Par_Ref,
449 int Int_1_Par_Val, int Int_2_Par_Val)*/
450 void Proc_8 (int *Arr_1_Par_Ref, int *Arr_2_Par_Ref,
451 int Int_1_Par_Val, int Int_2_Par_Val)
453 REG One_Fifty Int_Index;
454 REG One_Fifty Int_Loc;
456 DPRINTF(("-> Proc_8\n"));
457 Int_Loc = Int_1_Par_Val + 5;
458 Arr_1_Par_Ref [Int_Loc] = Int_2_Par_Val;
459 DPRINTF(("Int_Loc %d == 8 Int_2_Par_Val %d == 7\n", Int_Loc, Int_2_Par_Val));
461 Arr_1_Par_Ref [Int_Loc+1] = Arr_1_Par_Ref [Int_Loc];
462 Arr_1_Par_Ref [Int_Loc+30] = Int_Loc;
463 for (Int_Index = Int_Loc; Int_Index <= Int_Loc+1; ++Int_Index)
464 Arr_2_Par_Ref [Int_Loc*50 + Int_Index] = Int_Loc;
465 Arr_2_Par_Ref [Int_Loc * 50 + Int_Loc-1] += 1;
466 Arr_2_Par_Ref [(Int_Loc+20 *50) + Int_Loc] = Arr_1_Par_Ref [Int_Loc];
468 DPRINTF(("Arr_1_Glob[8] %d == 7\n", Arr_1_Par_Ref[8]));
471 /*********************************************************************/
473 /* Int_Par_Val_1 == 3 */
474 /* Int_Par_Val_2 == 7 */
475 Boolean Func_2 (char *Str_1_Par_Ref, char *Str_2_Par_Ref)
476 /*************************************************/
478 /* Str_1_Par_Ref == "DHRYSTONE PROGRAM, 1'ST STRING" */
479 /* Str_2_Par_Ref == "DHRYSTONE PROGRAM, 2'ND STRING" */
481 REG One_Thirty Int_Loc;
482 Capital_Letter Ch_Loc;
484 DPRINTF(("-> Func_2\n"));
485 DPRINTF((" Inputs Str_1_Par_Ref \"%s\" = \"DHRYSTONE PROGRAM, 1'ST STRING\"\n", Str_1_Par_Ref));
486 DPRINTF((" Str_2_Par_Ref \"%s\" = \"DHRYSTONE PROGRAM, 2'ND STRING\"\n", Str_2_Par_Ref));
490 while (Int_Loc <= 2) {
491 if (Func_1 (Str_1_Par_Ref[Int_Loc],
492 Str_2_Par_Ref[Int_Loc+1]) == Ident_1)
495 DPRINTF((" 2.3 Then OK.\n"));
500 DPRINTF((" 2.2 Error.\n"));
503 if (Ch_Loc >= 'W' && Ch_Loc < 'Z') {
504 /* then, not executed */
505 DPRINTF((" 2.4 Error\n"));
509 /* then, not executed */
510 DPRINTF((" 2.5 Error\n"));
515 DPRINTF(("Str_1_Par_Ref = \"%s\", Str_2_Par_Ref = \"%s\"\n",
516 Str_1_Par_Ref, Str_2_Par_Ref));
517 if (strcmp (Str_1_Par_Ref, Str_2_Par_Ref) > 0)
518 /* then, not executed */
520 DPRINTF((" 2.5 Error diff=%d\n", strcmp(Str_1_Par_Ref, Str_2_Par_Ref)));
527 DPRINTF((" 2.6 OK\n"));