dhry_1.c 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290
  1. // SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
  2. /*
  3. ****************************************************************************
  4. *
  5. * "DHRYSTONE" Benchmark Program
  6. * -----------------------------
  7. *
  8. * Version: C, Version 2.1
  9. *
  10. * File: dhry_1.c (part 2 of 3)
  11. *
  12. * Date: May 25, 1988
  13. *
  14. * Author: Reinhold P. Weicker
  15. *
  16. ****************************************************************************
  17. */
  18. #include "dhry.h"
  19. #include <linux/ktime.h>
  20. #include <linux/slab.h>
  21. #include <linux/string.h>
  22. /* Global Variables: */
  23. int Int_Glob;
  24. char Ch_1_Glob;
  25. static Rec_Pointer Ptr_Glob, Next_Ptr_Glob;
  26. static Boolean Bool_Glob;
  27. static char Ch_2_Glob;
  28. static int Arr_1_Glob[50];
  29. static int Arr_2_Glob[50][50];
  30. static void Proc_3(Rec_Pointer *Ptr_Ref_Par)
  31. /******************/
  32. /* executed once */
  33. /* Ptr_Ref_Par becomes Ptr_Glob */
  34. {
  35. if (Ptr_Glob) {
  36. /* then, executed */
  37. *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp;
  38. }
  39. Proc_7(10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp);
  40. } /* Proc_3 */
  41. static void Proc_1(Rec_Pointer Ptr_Val_Par)
  42. /******************/
  43. /* executed once */
  44. {
  45. Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp;
  46. /* == Ptr_Glob_Next */
  47. /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */
  48. /* corresponds to "rename" in Ada, "with" in Pascal */
  49. *Ptr_Val_Par->Ptr_Comp = *Ptr_Glob;
  50. Ptr_Val_Par->variant.var_1.Int_Comp = 5;
  51. Next_Record->variant.var_1.Int_Comp =
  52. Ptr_Val_Par->variant.var_1.Int_Comp;
  53. Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp;
  54. Proc_3(&Next_Record->Ptr_Comp);
  55. /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp == Ptr_Glob->Ptr_Comp */
  56. if (Next_Record->Discr == Ident_1) {
  57. /* then, executed */
  58. Next_Record->variant.var_1.Int_Comp = 6;
  59. Proc_6(Ptr_Val_Par->variant.var_1.Enum_Comp,
  60. &Next_Record->variant.var_1.Enum_Comp);
  61. Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp;
  62. Proc_7(Next_Record->variant.var_1.Int_Comp, 10,
  63. &Next_Record->variant.var_1.Int_Comp);
  64. } else {
  65. /* not executed */
  66. *Ptr_Val_Par = *Ptr_Val_Par->Ptr_Comp;
  67. }
  68. } /* Proc_1 */
  69. static void Proc_2(One_Fifty *Int_Par_Ref)
  70. /******************/
  71. /* executed once */
  72. /* *Int_Par_Ref == 1, becomes 4 */
  73. {
  74. One_Fifty Int_Loc;
  75. Enumeration Enum_Loc;
  76. Int_Loc = *Int_Par_Ref + 10;
  77. do {
  78. /* executed once */
  79. if (Ch_1_Glob == 'A') {
  80. /* then, executed */
  81. Int_Loc -= 1;
  82. *Int_Par_Ref = Int_Loc - Int_Glob;
  83. Enum_Loc = Ident_1;
  84. } /* if */
  85. } while (Enum_Loc != Ident_1); /* true */
  86. } /* Proc_2 */
  87. static void Proc_4(void)
  88. /*******/
  89. /* executed once */
  90. {
  91. Boolean Bool_Loc;
  92. Bool_Loc = Ch_1_Glob == 'A';
  93. Bool_Glob = Bool_Loc | Bool_Glob;
  94. Ch_2_Glob = 'B';
  95. } /* Proc_4 */
  96. static void Proc_5(void)
  97. /*******/
  98. /* executed once */
  99. {
  100. Ch_1_Glob = 'A';
  101. Bool_Glob = false;
  102. } /* Proc_5 */
  103. int dhry(int n)
  104. /*****/
  105. /* main program, corresponds to procedures */
  106. /* Main and Proc_0 in the Ada version */
  107. {
  108. One_Fifty Int_1_Loc;
  109. One_Fifty Int_2_Loc;
  110. One_Fifty Int_3_Loc;
  111. char Ch_Index;
  112. Enumeration Enum_Loc;
  113. Str_30 Str_1_Loc;
  114. Str_30 Str_2_Loc;
  115. int Run_Index;
  116. int Number_Of_Runs;
  117. ktime_t Begin_Time, End_Time;
  118. u32 User_Time;
  119. /* Initializations */
  120. Next_Ptr_Glob = (Rec_Pointer)kzalloc(sizeof(Rec_Type), GFP_ATOMIC);
  121. if (!Next_Ptr_Glob)
  122. return -ENOMEM;
  123. Ptr_Glob = (Rec_Pointer)kzalloc(sizeof(Rec_Type), GFP_ATOMIC);
  124. if (!Ptr_Glob) {
  125. kfree(Next_Ptr_Glob);
  126. return -ENOMEM;
  127. }
  128. Ptr_Glob->Ptr_Comp = Next_Ptr_Glob;
  129. Ptr_Glob->Discr = Ident_1;
  130. Ptr_Glob->variant.var_1.Enum_Comp = Ident_3;
  131. Ptr_Glob->variant.var_1.Int_Comp = 40;
  132. strcpy(Ptr_Glob->variant.var_1.Str_Comp,
  133. "DHRYSTONE PROGRAM, SOME STRING");
  134. strcpy(Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");
  135. Arr_2_Glob[8][7] = 10;
  136. /* Was missing in published program. Without this statement, */
  137. /* Arr_2_Glob[8][7] would have an undefined value. */
  138. /* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */
  139. /* overflow may occur for this array element. */
  140. pr_debug("Dhrystone Benchmark, Version 2.1 (Language: C)\n");
  141. Number_Of_Runs = n;
  142. pr_debug("Execution starts, %d runs through Dhrystone\n",
  143. Number_Of_Runs);
  144. /***************/
  145. /* Start timer */
  146. /***************/
  147. Begin_Time = ktime_get();
  148. for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index) {
  149. Proc_5();
  150. Proc_4();
  151. /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */
  152. Int_1_Loc = 2;
  153. Int_2_Loc = 3;
  154. strcpy(Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");
  155. Enum_Loc = Ident_2;
  156. Bool_Glob = !Func_2(Str_1_Loc, Str_2_Loc);
  157. /* Bool_Glob == 1 */
  158. while (Int_1_Loc < Int_2_Loc) {
  159. /* loop body executed once */
  160. Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc;
  161. /* Int_3_Loc == 7 */
  162. Proc_7(Int_1_Loc, Int_2_Loc, &Int_3_Loc);
  163. /* Int_3_Loc == 7 */
  164. Int_1_Loc += 1;
  165. } /* while */
  166. /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
  167. Proc_8(Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc);
  168. /* Int_Glob == 5 */
  169. Proc_1(Ptr_Glob);
  170. for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index) {
  171. /* loop body executed twice */
  172. if (Enum_Loc == Func_1(Ch_Index, 'C')) {
  173. /* then, not executed */
  174. Proc_6(Ident_1, &Enum_Loc);
  175. strcpy(Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");
  176. Int_2_Loc = Run_Index;
  177. Int_Glob = Run_Index;
  178. }
  179. }
  180. /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
  181. Int_2_Loc = Int_2_Loc * Int_1_Loc;
  182. Int_1_Loc = Int_2_Loc / Int_3_Loc;
  183. Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc;
  184. /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */
  185. Proc_2(&Int_1_Loc);
  186. /* Int_1_Loc == 5 */
  187. } /* loop "for Run_Index" */
  188. /**************/
  189. /* Stop timer */
  190. /**************/
  191. End_Time = ktime_get();
  192. #define dhry_assert_int_eq(val, expected) \
  193. if (val != expected) \
  194. pr_err("%s: %d (FAIL, expected %d)\n", #val, val, \
  195. expected); \
  196. else \
  197. pr_debug("%s: %d (OK)\n", #val, val)
  198. #define dhry_assert_char_eq(val, expected) \
  199. if (val != expected) \
  200. pr_err("%s: %c (FAIL, expected %c)\n", #val, val, \
  201. expected); \
  202. else \
  203. pr_debug("%s: %c (OK)\n", #val, val)
  204. #define dhry_assert_string_eq(val, expected) \
  205. if (strcmp(val, expected)) \
  206. pr_err("%s: %s (FAIL, expected %s)\n", #val, val, \
  207. expected); \
  208. else \
  209. pr_debug("%s: %s (OK)\n", #val, val)
  210. pr_debug("Execution ends\n");
  211. pr_debug("Final values of the variables used in the benchmark:\n");
  212. dhry_assert_int_eq(Int_Glob, 5);
  213. dhry_assert_int_eq(Bool_Glob, 1);
  214. dhry_assert_char_eq(Ch_1_Glob, 'A');
  215. dhry_assert_char_eq(Ch_2_Glob, 'B');
  216. dhry_assert_int_eq(Arr_1_Glob[8], 7);
  217. dhry_assert_int_eq(Arr_2_Glob[8][7], Number_Of_Runs + 10);
  218. pr_debug("Ptr_Comp: %px\n", Ptr_Glob->Ptr_Comp);
  219. dhry_assert_int_eq(Ptr_Glob->Discr, 0);
  220. dhry_assert_int_eq(Ptr_Glob->variant.var_1.Enum_Comp, 2);
  221. dhry_assert_int_eq(Ptr_Glob->variant.var_1.Int_Comp, 17);
  222. dhry_assert_string_eq(Ptr_Glob->variant.var_1.Str_Comp,
  223. "DHRYSTONE PROGRAM, SOME STRING");
  224. if (Next_Ptr_Glob->Ptr_Comp != Ptr_Glob->Ptr_Comp)
  225. pr_err("Next_Ptr_Glob->Ptr_Comp: %px (expected %px)\n",
  226. Next_Ptr_Glob->Ptr_Comp, Ptr_Glob->Ptr_Comp);
  227. else
  228. pr_debug("Next_Ptr_Glob->Ptr_Comp: %px\n",
  229. Next_Ptr_Glob->Ptr_Comp);
  230. dhry_assert_int_eq(Next_Ptr_Glob->Discr, 0);
  231. dhry_assert_int_eq(Next_Ptr_Glob->variant.var_1.Enum_Comp, 1);
  232. dhry_assert_int_eq(Next_Ptr_Glob->variant.var_1.Int_Comp, 18);
  233. dhry_assert_string_eq(Next_Ptr_Glob->variant.var_1.Str_Comp,
  234. "DHRYSTONE PROGRAM, SOME STRING");
  235. dhry_assert_int_eq(Int_1_Loc, 5);
  236. dhry_assert_int_eq(Int_2_Loc, 13);
  237. dhry_assert_int_eq(Int_3_Loc, 7);
  238. dhry_assert_int_eq(Enum_Loc, 1);
  239. dhry_assert_string_eq(Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");
  240. dhry_assert_string_eq(Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");
  241. User_Time = ktime_ms_delta(End_Time, Begin_Time);
  242. kfree(Ptr_Glob);
  243. kfree(Next_Ptr_Glob);
  244. /* Measurements should last at least 2 seconds */
  245. if (User_Time < 2 * MSEC_PER_SEC)
  246. return -EAGAIN;
  247. return div_u64(mul_u32_u32(MSEC_PER_SEC, Number_Of_Runs), User_Time);
  248. }