Path: utzoo!utgpu!watmath!clyde!att!rutgers!ucsd!sdcsvax!ucsdhub!esosun!seismo!uunet!pcrat!dry From: dry2@pcrat.UUCP (Dhrystone) Newsgroups: comp.arch Subject: Dhrystone 2.1 (2 of 3) Keywords: integer benchmark Message-ID: <630@pcrat.UUCP> Date: 4 Dec 88 07:12:17 GMT Organization: PC Research, Inc., Tinton Falls, NJ Lines: 1516 #! /bin/sh # This is a shell archive, meaning: # 1. Remove everything above the #! /bin/sh line. # 2. Save the resulting text in a file. # 3. Execute the file with /bin/sh (not csh) to create: # README # RATIONALE # dhry.h # dhry_1.c # dhry_2.c # This archive created: Sun Dec 4 00:42:33 1988 export PATH; PATH=/bin:/usr/bin:$PATH echo shar: "extracting 'README'" '(2308 characters)' if test -f 'README' then echo shar: "will not over-write existing file 'README'" else sed 's/^X//' << \SHAR_EOF > 'README' XThis floppy disk contains the source code of the Dhrystone benchmark X(version 2.1) in three languages: X XFiles containing the Ada version (*.s: Specifications, *.b: Bodies): X X d_global.s X d_main.b X d_pack_1.b X d_pack_1.s X d_pack_2.b X d_pack_2.s X X (The file names have been abbreviated to 8 characters plus extension X for MS-DOS) X XFiles containing the C version (*.h: Header File, *.c: C Modules) X X dhry.h X dhry_1.c X dhry_2.c X XFile containing the Pascal version: X X dhry.p X XThe file RATIONALE contains the article X X "Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules" X Xwhich has been published, together with the C source code (Version 2.0), Xin SIGPLAN Notices vol. 23, no. 8 (Aug. 1988), pp. 49-62. XThis article explains all changes that have been made for Version 2, Xcompared with the version of the original publication Xin Communications of the ACM vol. 27, no. 10 (Oct. 1984), pp. 1013-1030. XIt also contains "ground rules" for benchmarking with Dhrystone Xwhich should be followed by everyone who uses the program and publishes XDhrystone results. X XCompared with the Version 2.0 published in SIGPLAN Notices, Version 2.1 Xcontains a few corrections that have been made after Version 2.0 was Xdistriobuted over the UNIX network Usenet. These small differences between XVersion 2.0 and 2.1 should not affect execution time measurements. XFor those who want to compare the exact contents of both versions, Xthe file "dhry_c.dif" contains the differences between the two versions, Xas generated by a file comparison of the corresponding files with the XUNIX utility "diff". X XRecipients of this floppy disk who perform measurements are asked Xto send measurement results to the author and/or to Rick Richardson. XRick Richardson publishes regularly Dhrystone results on the UNIX network XUsenet. For submissions of results to him (preferably by electronic mail, Xsee address in the program header), he has provided a form which is contained Xin the file "submit.frm". X XAugust 17, 1988 X X Reinhold P. Weicker X Siemens AG, E STE 35 X Postfach 3240 X D-8520 Erlangen X Germany (West) X X Phone: [xxx-49]-9131-7-20330 (8-17 Central European Time) X Usenet: ..!mcvax!unido!estevax!weicker SHAR_EOF if test 2308 -ne "`wc -c < 'README'`" then echo shar: "error transmitting 'README'" '(should have been 2308 characters)' fi fi echo shar: "extracting 'RATIONALE'" '(18793 characters)' if test -f 'RATIONALE' then echo shar: "will not over-write existing file 'RATIONALE'" else sed 's/^X//' << \SHAR_EOF > 'RATIONALE' X X X Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules X X X Reinhold P. Weicker X Siemens AG, E STE 35 X Postfach 3240 X D-8520 Erlangen X Germany (West) X X X X X1. Why a Version 2 of Dhrystone? X XThe Dhrystone benchmark program [1] has become a popular benchmark for XCPU/compiler performance measurement, in particular in the area of Xminicomputers, workstations, PC's and microprocesors. It apparently satisfies Xa need for an easy-to-use integer benchmark; it gives a first performance Xindication which is more meaningful than MIPS numbers which, in their literal Xmeaning (million instructions per second), cannot be used across different Xinstruction sets (e.g. RISC vs. CISC). With the increasing use of the Xbenchmark, it seems necessary to reconsider the benchmark and to check whether Xit can still fulfill this function. Version 2 of Dhrystone is the result of Xsuch a re-evaluation, it has been made for two reasons: X Xo Dhrystone has been published in Ada [1], and Versions in Ada, Pascal and C X have been distributed by Reinhold Weicker via floppy disk. However, the X version that was used most often for benchmarking has been the version made X by Rick Richardson by another translation from the Ada version into the C X programming language, this has been the version distributed via the UNIX X network Usenet [2]. X X There is an obvious need for a common C version of Dhrystone, since C is at X present the most popular system programming language for the class of X systems (microcomputers, minicomputers, workstations) where Dhrystone is X used most. There should be, as far as possible, only one C version of X Dhrystone such that results can be compared without restrictions. In the X past, the C versions distributed by Rick Richardson (Version 1.1) and by X Reinhold Weicker had small (though not significant) differences. X X Together with the new C version, the Ada and Pascal versions have been X updated as well. X Xo As far as it is possible without changes to the Dhrystone statistics, X optimizing compilers should be prevented from removing significant X statements. It has turned out in the past that optimizing compilers X suppressed code generation for too many statements (by "dead code removal" X or "dead variable elimination"). This has lead to the danger that X benchmarking results obtained by a naive application of Dhrystone - without X inspection of the code that was generated - could become meaningless. X XThe overall policiy for version 2 has been that the distribution of Xstatements, operand types and operand locality described in [1] should remain Xunchanged as much as possible. (Very few changes were necessary; their impact Xshould be negligible.) Also, the order of statements should remain unchanged. XAlthough I am aware of some critical remarks on the benchmark - I agree with Xseveral of them - and know some suggestions for improvement, I didn't want to Xchange the benchmark into something different from what has become known as X"Dhrystone"; the confusion generated by such a change would probably outweight Xthe benefits. If I were to write a new benchmark program, I wouldn't give it Xthe name "Dhrystone" since this denotes the program published in [1]. XHowever, I do recognize the need for a larger number of representative Xprograms that can be used as benchmarks; users should always be encouraged to Xuse more than just one benchmark. X XThe new versions (version 2.1 for C, Pascal and Ada) will be distributed as Xwidely as possible. (Version 2.1 differs from version 2.0 distributed via the XUNIX Network Usenet in March 1988 only in a few corrections for minor Xdeficiencies found by users of version 2.0.) Readers who want to use the Xbenchmark for their own measurements can obtain a copy in machine-readable Xform on floppy disk (MS-DOS or XENIX format) from the author. X X X2. Overall Characteristics of Version 2 X XIn general, version 2 follows - in the parts that are significant for Xperformance measurement, i.e. within the measurement loop - the published X(Ada) version and the C versions previously distributed. Where the versions Xdistributed by Rick Richardson [2] and Reinhold Weicker have been different, Xit follows the version distributed by Reinhold Weicker. (However, the Xdifferences have been so small that their impact on execution time in all Xlikelihood has been negligible.) The initialization and UNIX instrumentation Xpart - which had been omitted in [1] - follows mostly the ideas of Rick XRichardson [2]. However, any changes in the initialization part and in the Xprinting of the result have no impact on performance measurement since they Xare outside the measaurement loop. As a concession to older compilers, names Xhave been made unique within the first 8 characters for the C version. X XThe original publication of Dhrystone did not contain any statements for time Xmeasurement since they are necessarily system-dependent. However, it turned Xout that it is not enough just to inclose the main procedure of Dhrystone in a Xloop and to measure the execution time. If the variables that are computed Xare not used somehow, there is the danger that the compiler considers them as X"dead variables" and suppresses code generation for a part of the statements. XTherefore in version 2 all variables of "main" are printed at the end of the Xprogram. This also permits some plausibility control for correct execution of Xthe benchmark. X XAt several places in the benchmark, code has been added, but only in branches Xthat are not executed. The intention is that optimizing compilers should be Xprevented from moving code out of the measurement loop, or from removing code Xaltogether. Statements that are executed have been changed in very few places Xonly. In these cases, only the role of some operands has been changed, and it Xwas made sure that the numbers defining the "Dhrystone distribution" X(distribution of statements, operand types and locality) still hold as much as Xpossible. Except for sophisticated optimizing compilers, execution times for Xversion 2.1 should be the same as for previous versions. X XBecause of the self-imposed limitation that the order and distribution of the Xexecuted statements should not be changed, there are still cases where Xoptimizing compilers may not generate code for some statements. To a certain Xdegree, this is unavoidable for small synthetic benchmarks. Users of the Xbenchmark are advised to check code listings whether code is generated for all Xstatements of Dhrystone. X XContrary to the suggestion in the published paper and its realization in the Xversions previously distributed, no attempt has been made to subtract the time Xfor the measurement loop overhead. (This calculation has proven difficult to Ximplement in a correct way, and its omission makes the program simpler.) XHowever, since the loop check is now part of the benchmark, this does have an Ximpact - though a very minor one - on the distribution statistics which have Xbeen updated for this version. X X X3. Discussion of Individual Changes X XIn this section, all changes are described that affect the measurement loop Xand that are not just renamings of variables. All remarks refer to the C Xversion; the other language versions have been updated similarly. X XIn addition to adding the measurement loop and the printout statements, Xchanges have been made at the following places: X Xo In procedure "main", three statements have been added in the non-executed X "then" part of the statement X X if (Enum_Loc == Func_1 (Ch_Index, 'C')) X X they are X X strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING"); X Int_2_Loc = Run_Index; X Int_Glob = Run_Index; X X The string assignment prevents movement of the preceding assignment to X Str_2_Loc (5'th statement of "main") out of the measurement loop (This X probably will not happen for the C version, but it did happen with another X language and compiler.) The assignment to Int_2_Loc prevents value X propagation for Int_2_Loc, and the assignment to Int_Glob makes the value of X Int_Glob possibly dependent from the value of Run_Index. X Xo In the three arithmetic computations at the end of the measurement loop in X "main ", the role of some variables has been exchanged, to prevent the X division from just cancelling out the multiplication as it was in [1]. A X very smart compiler might have recognized this and suppressed code X generation for the division. X Xo For Proc_2, no code has been changed, but the values of the actual parameter X have changed due to changes in "main". X Xo In Proc_4, the second assignment has been changed from X X Bool_Loc = Bool_Loc | Bool_Glob; X X to X X Bool_Glob = Bool_Loc | Bool_Glob; X X It now assigns a value to a global variable instead of a local variable X (Bool_Loc); Bool_Loc would be a "dead variable" which is not used X afterwards. X Xo In Func_1, the statement X X Ch_1_Glob = Ch_1_Loc; X X was added in the non-executed "else" part of the "if" statement, to prevent X the suppression of code generation for the assignment to Ch_1_Loc. X Xo In Func_2, the second character comparison statement has been changed to X X if (Ch_Loc == 'R') X X ('R' instead of 'X') because a comparison with 'X' is implied in the X preceding "if" statement. X X Also in Func_2, the statement X X Int_Glob = Int_Loc; X X has been added in the non-executed part of the last "if" statement, in order X to prevent Int_Loc from becoming a dead variable. X Xo In Func_3, a non-executed "else" part has been added to the "if" statement. X While the program would not be incorrect without this "else" part, it is X considered bad programming practice if a function can be left without a X return value. X X To compensate for this change, the (non-executed) "else" part in the "if" X statement of Proc_3 was removed. X XThe distribution statistics have been changed only by the addition of the Xmeasurement loop iteration (1 additional statement, 4 additional local integer Xoperands) and by the change in Proc_4 (one operand changed from local to Xglobal). The distribution statistics in the comment headers have been updated Xaccordingly. X X X4. String Operations X XThe string operations (string assignment and string comparison) have not been Xchanged, to keep the program consistent with the original version. X XThere has been some concern that the string operations are over-represented in Xthe program, and that execution time is dominated by these operations. This Xwas true in particular when optimizing compilers removed too much code in the Xmain part of the program, this should have been mitigated in version 2. X XIt should be noted that this is a language-dependent issue: Dhrystone was Xfirst published in Ada, and with Ada or Pascal semantics, the time spent in Xthe string operations is, at least in all implementations known to me, Xconsiderably smaller. In Ada and Pascal, assignment and comparison of strings Xare operators defined in the language, and the upper bounds of the strings Xoccuring in Dhrystone are part of the type information known at compilation Xtime. The compilers can therefore generate efficient inline code. In C, Xstring assignemt and comparisons are not part of the language, so the string Xoperations must be expressed in terms of the C library functions "strcpy" and X"strcmp". (ANSI C allows an implementation to use inline code for these Xfunctions.) In addition to the overhead caused by additional function calls, Xthese functions are defined for null-terminated strings where the length of Xthe strings is not known at compilation time; the function has to check every Xbyte for the termination condition (the null byte). X XObviously, a C library which includes efficiently coded "strcpy" and "strcmp" Xfunctions helps to obtain good Dhrystone results. However, I don't think that Xthis is unfair since string functions do occur quite frequently in real Xprograms (editors, command interpreters, etc.). If the strings functions are Ximplemented efficiently, this helps real programs as well as benchmark Xprograms. X XI admit that the string comparison in Dhrystone terminates later (after Xscanning 20 characters) than most string comparisons in real programs. For Xconsistency with the original benchmark, I didn't change the program despite Xthis weakness. X X X5. Intended Use of Dhrystone X XWhen Dhrystone is used, the following "ground rules" apply: X Xo Separate compilation (Ada and C versions) X X As mentioned in [1], Dhrystone was written to reflect actual programming X practice in systems programming. The division into several compilation X units (5 in the Ada version, 2 in the C version) is intended, as is the X distribution of inter-module and intra-module subprogram calls. Although on X many systems there will be no difference in execution time to a Dhrystone X version where all compilation units are merged into one file, the rule is X that separate compilation should be used. The intention is that real X programming practice, where programs consist of several independently X compiled units, should be reflected. This also has implies that the X compiler, while compiling one unit, has no information about the use of X variables, register allocation etc. occuring in other compilation units. X Although in real life compilation units will probably be larger, the X intention is that these effects of separate compilation are modeled in X Dhrystone. X X A few language systems have post-linkage optimization available (e.g., final X register allocation is performed after linkage). This is a borderline case: X Post-linkage optimization involves additional program preparation time X (although not as much as compilation in one unit) which may prevent its X general use in practical programming. I think that since it defeats the X intentions given above, it should not be used for Dhrystone. X X Unfortunately, ISO/ANSI Pascal does not contain language features for X separate compilation. Although most commercial Pascal compilers provide X separate compilation in some way, we cannot use it for Dhrystone since such X a version would not be portable. Therefore, no attempt has been made to X provide a Pascal version with several compilation units. X Xo No procedure merging X X Although Dhrystone contains some very short procedures where execution would X benefit from procedure merging (inlining, macro expansion of procedures), X procedure merging is not to be used. The reason is that the percentage of X procedure and function calls is part of the "Dhrystone distribution" of X statements contained in [1]. This restriction does not hold for the string X functions of the C version since ANSI C allows an implementation to use X inline code for these functions. X Xo Other optimizations are allowed, but they should be indicated X X It is often hard to draw an exact line between "normal code generation" and X "optimization" in compilers: Some compilers perform operations by default X that are invoked in other compilers only when optimization is explicitly X requested. Also, we cannot avoid that in benchmarking people try to achieve X results that look as good as possible. Therefore, optimizations performed X by compilers - other than those listed above - are not forbidden when X Dhrystone execution times are measured. Dhrystone is not intended to be X non-optimizable but is intended to be similarly optimizable as normal X programs. For example, there are several places in Dhrystone where X performance benefits from optimizations like common subexpression X elimination, value propagation etc., but normal programs usually also X benefit from these optimizations. Therefore, no effort was made to X artificially prevent such optimizations. However, measurement reports X should indicate which compiler optimization levels have been used, and X reporting results with different levels of compiler optimization for the X same hardware is encouraged. X Xo Default results are those without "register" declarations (C version) X X When Dhrystone results are quoted without additional qualification, they X should be understood as results obtained without use of the "register" X attribute. Good compilers should be able to make good use of registers even X without explicit register declarations ([3], p. 193). X XOf course, for experimental purposes, post-linkage optimization, procedure Xmerging and/or compilation in one unit can be done to determine their effects. XHowever, Dhrystone numbers obtained under these conditions should be Xexplicitly marked as such; "normal" Dhrystone results should be understood as Xresults obtained following the ground rules listed above. X XIn any case, for serious performance evaluation, users are advised to ask for Xcode listings and to check them carefully. In this way, when results for Xdifferent systems are compared, the reader can get a feeling how much Xperformance difference is due to compiler optimization and how much is due to Xhardware speed. X X X6. Acknowledgements X XThe C version 2.1 of Dhrystone has been developed in cooperation with Rick XRichardson (Tinton Falls, NJ), it incorporates many ideas from the "Version X1.1" distributed previously by him over the UNIX network Usenet. Through his Xactivity with Usenet, Rick Richardson has made a very valuable contribution to Xthe dissemination of the benchmark. I also thank Chaim Benedelac (National XSemiconductor), David Ditzel (SUN), Earl Killian and John Mashey (MIPS), Alan XSmith and Rafael Saavedra-Barrera (UC at Berkeley) for their help with Xcomments on earlier versions of the benchmark. X X X7. Bibliography X X[1] X Reinhold P. Weicker: Dhrystone: A Synthetic Systems Programming Benchmark. X Communications of the ACM 27, 10 (Oct. 1984), 1013-1030 X X[2] X Rick Richardson: Dhrystone 1.1 Benchmark Summary (and Program Text) X Informal Distribution via "Usenet", Last Version Known to me: Sept. 21, X 1987 X X[3] X Brian W. Kernighan and Dennis M. Ritchie: The C Programming Language. X Prentice-Hall, Englewood Cliffs (NJ) 1978 X SHAR_EOF if test 18793 -ne "`wc -c < 'RATIONALE'`" then echo shar: "error transmitting 'RATIONALE'" '(should have been 18793 characters)' fi fi echo shar: "extracting 'dhry.h'" '(18556 characters)' if test -f 'dhry.h' then echo shar: "will not over-write existing file 'dhry.h'" else sed 's/^X//' << \SHAR_EOF > 'dhry.h' X/* X **************************************************************************** X * X * "DHRYSTONE" Benchmark Program X * ----------------------------- X * X * Version: C, Version 2.1 X * X * File: dhry.h (part 1 of 3) X * X * Date: May 25, 1988 X * X * Author: Reinhold P. Weicker X * Siemens AG, E STE 35 X * Postfach 3240 X * 8520 Erlangen X * Germany (West) X * Phone: [xxx-49]-9131-7-20330 X * (8-17 Central European Time) X * Usenet: ..!mcvax!unido!estevax!weicker X * X * Original Version (in Ada) published in X * "Communications of the ACM" vol. 27., no. 10 (Oct. 1984), X * pp. 1013 - 1030, together with the statistics X * on which the distribution of statements etc. is based. X * X * In this C version, the following C library functions are used: X * - strcpy, strcmp (inside the measurement loop) X * - printf, scanf (outside the measurement loop) X * In addition, Berkeley UNIX system calls "times ()" or "time ()" X * are used for execution time measurement. For measurements X * on other systems, these calls have to be changed. X * X * Collection of Results: X * Reinhold Weicker (address see above) and X * X * Rick Richardson X * PC Research. Inc. X * 94 Apple Orchard Drive X * Tinton Falls, NJ 07724 X * Phone: (201) 389-8963 (9-17 EST) X * Usenet: ...!uunet!pcrat!rick X * X * Please send results to Rick Richardson and/or Reinhold Weicker. X * Complete information should be given on hardware and software used. X * Hardware information includes: Machine type, CPU, type and size X * of caches; for microprocessors: clock frequency, memory speed X * (number of wait states). X * Software information includes: Compiler (and runtime library) X * manufacturer and version, compilation switches, OS version. X * The Operating System version may give an indication about the X * compiler; Dhrystone itself performs no OS calls in the measurement loop. X * X * The complete output generated by the program should be mailed X * such that at least some checks for correctness can be made. X * X *************************************************************************** X * X * History: This version C/2.1 has been made for two reasons: X * X * 1) There is an obvious need for a common C version of X * Dhrystone, since C is at present the most popular system X * programming language for the class of processors X * (microcomputers, minicomputers) where Dhrystone is used most. X * There should be, as far as possible, only one C version of X * Dhrystone such that results can be compared without X * restrictions. In the past, the C versions distributed X * by Rick Richardson (Version 1.1) and by Reinhold Weicker X * had small (though not significant) differences. X * X * 2) As far as it is possible without changes to the Dhrystone X * statistics, optimizing compilers should be prevented from X * removing significant statements. X * X * This C version has been developed in cooperation with X * Rick Richardson (Tinton Falls, NJ), it incorporates many X * ideas from the "Version 1.1" distributed previously by X * him over the UNIX network Usenet. X * I also thank Chaim Benedelac (National Semiconductor), X * David Ditzel (SUN), Earl Killian and John Mashey (MIPS), X * Alan Smith and Rafael Saavedra-Barrera (UC at Berkeley) X * for their help with comments on earlier versions of the X * benchmark. X * X * Changes: In the initialization part, this version follows mostly X * Rick Richardson's version distributed via Usenet, not the X * version distributed earlier via floppy disk by Reinhold Weicker. X * As a concession to older compilers, names have been made X * unique within the first 8 characters. X * Inside the measurement loop, this version follows the X * version previously distributed by Reinhold Weicker. X * X * At several places in the benchmark, code has been added, X * but within the measurement loop only in branches that X * are not executed. The intention is that optimizing compilers X * should be prevented from moving code out of the measurement X * loop, or from removing code altogether. Since the statements X * that are executed within the measurement loop have NOT been X * changed, the numbers defining the "Dhrystone distribution" X * (distribution of statements, operand types and locality) X * still hold. Except for sophisticated optimizing compilers, X * execution times for this version should be the same as X * for previous versions. X * X * Since it has proven difficult to subtract the time for the X * measurement loop overhead in a correct way, the loop check X * has been made a part of the benchmark. This does have X * an impact - though a very minor one - on the distribution X * statistics which have been updated for this version. X * X * All changes within the measurement loop are described X * and discussed in the companion paper "Rationale for X * Dhrystone version 2". X * X * Because of the self-imposed limitation that the order and X * distribution of the executed statements should not be X * changed, there are still cases where optimizing compilers X * may not generate code for some statements. To a certain X * degree, this is unavoidable for small synthetic benchmarks. X * Users of the benchmark are advised to check code listings X * whether code is generated for all statements of Dhrystone. X * X * Version 2.1 is identical to version 2.0 distributed via X * the UNIX network Usenet in March 1988 except that it corrects X * some minor deficiencies that were found by users of version 2.0. X * The only change within the measurement loop is that a X * non-executed "else" part was added to the "if" statement in X * Func_3, and a non-executed "else" part removed from Proc_3. X * X *************************************************************************** X * X * Defines: The following "Defines" are possible: X * -DREG=register (default: Not defined) X * As an approximation to what an average C programmer X * might do, the "register" storage class is applied X * (if enabled by -DREG=register) X * - for local variables, if they are used (dynamically) X * five or more times X * - for parameters if they are used (dynamically) X * six or more times X * Note that an optimal "register" strategy is X * compiler-dependent, and that "register" declarations X * do not necessarily lead to faster execution. X * -DNOSTRUCTASSIGN (default: Not defined) X * Define if the C compiler does not support X * assignment of structures. X * -DNOENUMS (default: Not defined) X * Define if the C compiler does not support X * enumeration types. X * -DTIMES (default) X * -DTIME X * The "times" function of UNIX (returning process times) X * or the "time" function (returning wallclock time) X * is used for measurement. X * For single user machines, "time ()" is adequate. For X * multi-user machines where you cannot get single-user X * access, use the "times ()" function. If you have X * neither, use a stopwatch in the dead of night. X * "printf"s are provided marking the points "Start Timer" X * and "Stop Timer". DO NOT use the UNIX "time(1)" X * command, as this will measure the total time to X * run this program, which will (erroneously) include X * the time to allocate storage (malloc) and to perform X * the initialization. X * -DHZ=nnn X * In Berkeley UNIX, the function "times" returns process X * time in 1/HZ seconds, with HZ = 60 for most systems. X * CHECK YOUR SYSTEM DESCRIPTION BEFORE YOU JUST APPLY X * A VALUE. X * X *************************************************************************** X * X * Compilation model and measurement (IMPORTANT): X * X * This C version of Dhrystone consists of three files: X * - dhry.h (this file, containing global definitions and comments) X * - dhry_1.c (containing the code corresponding to Ada package Pack_1) X * - dhry_2.c (containing the code corresponding to Ada package Pack_2) X * X * The following "ground rules" apply for measurements: X * - Separate compilation X * - No procedure merging X * - Otherwise, compiler optimizations are allowed but should be indicated X * - Default results are those without register declarations X * See the companion paper "Rationale for Dhrystone Version 2" for a more X * detailed discussion of these ground rules. X * X * For 16-Bit processors (e.g. 80186, 80286), times for all compilation X * models ("small", "medium", "large" etc.) should be given if possible, X * together with a definition of these models for the compiler system used. X * X ************************************************************************** X * X * Dhrystone (C version) statistics: X * X * [Comment from the first distribution, updated for version 2. X * Note that because of language differences, the numbers are slightly X * different from the Ada version.] X * X * The following program contains statements of a high level programming X * language (here: C) in a distribution considered representative: X * X * assignments 52 (51.0 %) X * control statements 33 (32.4 %) X * procedure, function calls 17 (16.7 %) X * X * 103 statements are dynamically executed. The program is balanced with X * respect to the three aspects: X * X * - statement type X * - operand type X * - operand locality X * operand global, local, parameter, or constant. X * X * The combination of these three aspects is balanced only approximately. X * X * 1. Statement Type: X * ----------------- number X * X * V1 = V2 9 X * (incl. V1 = F(..) X * V = Constant 12 X * Assignment, 7 X * with array element X * Assignment, 6 X * with record component X * -- X * 34 34 X * X * X = Y +|-|"&&"|"|" Z 5 X * X = Y +|-|"==" Constant 6 X * X = X +|- 1 3 X * X = Y *|/ Z 2 X * X = Expression, 1 X * two operators X * X = Expression, 1 X * three operators X * -- X * 18 18 X * X * if .... 14 X * with "else" 7 X * without "else" 7 X * executed 3 X * not executed 4 X * for ... 7 | counted every time X * while ... 4 | the loop condition X * do ... while 1 | is evaluated X * switch ... 1 X * break 1 X * declaration with 1 X * initialization X * -- X * 34 34 X * X * P (...) procedure call 11 X * user procedure 10 X * library procedure 1 X * X = F (...) X * function call 6 X * user function 5 X * library function 1 X * -- X * 17 17 X * --- X * 103 X * X * The average number of parameters in procedure or function calls X * is 1.82 (not counting the function values as implicit parameters). X * X * X * 2. Operators X * ------------ X * number approximate X * percentage X * X * Arithmetic 32 50.8 X * X * + 21 33.3 X * - 7 11.1 X * * 3 4.8 X * / (int div) 1 1.6 X * X * Comparison 27 42.8 X * X * == 9 14.3 X * /= 4 6.3 X * > 1 1.6 X * < 3 4.8 X * >= 1 1.6 X * <= 9 14.3 X * X * Logic 4 6.3 X * X * && (AND-THEN) 1 1.6 X * | (OR) 1 1.6 X * ! (NOT) 2 3.2 X * X * -- ----- X * 63 100.1 X * X * X * 3. Operand Type (counted once per operand reference): X * --------------- X * number approximate X * percentage X * X * Integer 175 72.3 % X * Character 45 18.6 % X * Pointer 12 5.0 % X * String30 6 2.5 % X * Array 2 0.8 % X * Record 2 0.8 % X * --- ------- X * 242 100.0 % X * X * When there is an access path leading to the final operand (e.g. a record X * component), only the final data type on the access path is counted. X * X * X * 4. Operand Locality: X * ------------------- X * number approximate X * percentage X * X * local variable 114 47.1 % X * global variable 22 9.1 % X * parameter 45 18.6 % X * value 23 9.5 % X * reference 22 9.1 % X * function result 6 2.5 % X * constant 55 22.7 % X * --- ------- X * 242 100.0 % X * X * X * The program does not compute anything meaningful, but it is syntactically X * and semantically correct. All variables have a value assigned to them X * before they are used as a source operand. X * X * There has been no explicit effort to account for the effects of a X * cache, or to balance the use of long or short displacements for code or X * data. X * X *************************************************************************** X */ X X/* Compiler and system dependent definitions: */ X X#ifndef TIME X#undef TIMES X#define TIMES X#endif X /* Use times(2) time function unless */ X /* explicitly defined otherwise */ X X#ifdef MSC_CLOCK X#undef HZ X#undef TIMES X#includeX#define HZ CLK_TCK X#endif X /* Use Microsoft C hi-res clock */ X X#ifdef TIMES X#include X#include X /* for "times" */ X#endif X X#define Mic_secs_Per_Second 1000000.0 X /* Berkeley UNIX C returns process times in seconds/HZ */ X X#ifdef NOSTRUCTASSIGN X#define structassign(d, s) memcpy(&(d), &(s), sizeof(d)) X#else X#define structassign(d, s) d = s X#endif X X#ifdef NOENUM X#define Ident_1 0 X#define Ident_2 1 X#define Ident_3 2 X#define Ident_4 3 X#define Ident_5 4 X typedef int Enumeration; X#else X typedef enum {Ident_1, Ident_2, Ident_3, Ident_4, Ident_5} X Enumeration; X#endif X /* for boolean and enumeration types in Ada, Pascal */ X X/* General definitions: */ X X#include X /* for strcpy, strcmp */ X X#define Null 0 X /* Value of a Null pointer */ X#define true 1 X#define false 0 X Xtypedef int One_Thirty; Xtypedef int One_Fifty; Xtypedef char Capital_Letter; Xtypedef int Boolean; Xtypedef char Str_30 [31]; Xtypedef int Arr_1_Dim [50]; Xtypedef int Arr_2_Dim [50] [50]; X Xtypedef struct record X { X struct record *Ptr_Comp; X Enumeration Discr; X union { X struct { X Enumeration Enum_Comp; X int Int_Comp; X char Str_Comp [31]; X } var_1; X struct { X Enumeration E_Comp_2; X char Str_2_Comp [31]; X } var_2; X struct { X char Ch_1_Comp; X char Ch_2_Comp; X } var_3; X } variant; X } Rec_Type, *Rec_Pointer; X X SHAR_EOF if test 18556 -ne "`wc -c < 'dhry.h'`" then echo shar: "error transmitting 'dhry.h'" '(should have been 18556 characters)' fi fi echo shar: "extracting 'dhry_1.c'" '(11857 characters)' if test -f 'dhry_1.c' then echo shar: "will not over-write existing file 'dhry_1.c'" else sed 's/^X//' << \SHAR_EOF > 'dhry_1.c' X/* X **************************************************************************** X * X * "DHRYSTONE" Benchmark Program X * ----------------------------- X * X * Version: C, Version 2.1 X * X * File: dhry_1.c (part 2 of 3) X * X * Date: May 25, 1988 X * X * Author: Reinhold P. Weicker X * X **************************************************************************** X */ X X#include "dhry.h" X X/* Global Variables: */ X XRec_Pointer Ptr_Glob, X Next_Ptr_Glob; Xint Int_Glob; XBoolean Bool_Glob; Xchar Ch_1_Glob, X Ch_2_Glob; Xint Arr_1_Glob [50]; Xint Arr_2_Glob [50] [50]; X Xextern char *malloc (); XEnumeration Func_1 (); X /* forward declaration necessary since Enumeration may not simply be int */ X X#ifndef REG X Boolean Reg = false; X#define REG X /* REG becomes defined as empty */ X /* i.e. no register variables */ X#else X Boolean Reg = true; X#endif X X/* variables for time measurement: */ X X#ifdef TIMES Xstruct tms time_info; Xextern int times (); X /* see library function "times" */ X#define Too_Small_Time (2*HZ) X /* Measurements should last at least about 2 seconds */ X#endif X#ifdef TIME Xextern long time(); X /* see library function "time" */ X#define Too_Small_Time 2 X /* Measurements should last at least 2 seconds */ X#endif X#ifdef MSC_CLOCK Xextern clock_t clock(); X#define Too_Small_Time (2*HZ) X#endif X Xlong Begin_Time, X End_Time, X User_Time; Xfloat Microseconds, X Dhrystones_Per_Second; X X/* end of variables for time measurement */ X X Xmain () X/*****/ X X /* main program, corresponds to procedures */ X /* Main and Proc_0 in the Ada version */ X{ X One_Fifty Int_1_Loc; X REG One_Fifty Int_2_Loc; X One_Fifty Int_3_Loc; X REG char Ch_Index; X Enumeration Enum_Loc; X Str_30 Str_1_Loc; X Str_30 Str_2_Loc; X REG int Run_Index; X REG int Number_Of_Runs; X X /* Initializations */ X X Next_Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type)); X Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type)); X X Ptr_Glob->Ptr_Comp = Next_Ptr_Glob; X Ptr_Glob->Discr = Ident_1; X Ptr_Glob->variant.var_1.Enum_Comp = Ident_3; X Ptr_Glob->variant.var_1.Int_Comp = 40; X strcpy (Ptr_Glob->variant.var_1.Str_Comp, X "DHRYSTONE PROGRAM, SOME STRING"); X strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING"); X X Arr_2_Glob [8][7] = 10; X /* Was missing in published program. Without this statement, */ X /* Arr_2_Glob [8][7] would have an undefined value. */ X /* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */ X /* overflow may occur for this array element. */ X X printf ("\n"); X printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n"); X printf ("\n"); X if (Reg) X { X printf ("Program compiled with 'register' attribute\n"); X printf ("\n"); X } X else X { X printf ("Program compiled without 'register' attribute\n"); X printf ("\n"); X } X printf ("Please give the number of runs through the benchmark: "); X { X int n; X scanf ("%d", &n); X Number_Of_Runs = n; X } X printf ("\n"); X X printf ("Execution starts, %d runs through Dhrystone\n", Number_Of_Runs); X X /***************/ X /* Start timer */ X /***************/ X X#ifdef TIMES X times (&time_info); X Begin_Time = (long) time_info.tms_utime; X#endif X#ifdef TIME X Begin_Time = time ( (long *) 0); X#endif X#ifdef MSC_CLOCK X Begin_Time = clock(); X#endif X X for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index) X { X X Proc_5(); X Proc_4(); X /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */ X Int_1_Loc = 2; X Int_2_Loc = 3; X strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING"); X Enum_Loc = Ident_2; X Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc); X /* Bool_Glob == 1 */ X while (Int_1_Loc < Int_2_Loc) /* loop body executed once */ X { X Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc; X /* Int_3_Loc == 7 */ X Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc); X /* Int_3_Loc == 7 */ X Int_1_Loc += 1; X } /* while */ X /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */ X Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc); X /* Int_Glob == 5 */ X Proc_1 (Ptr_Glob); X for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index) X /* loop body executed twice */ X { X if (Enum_Loc == Func_1 (Ch_Index, 'C')) X /* then, not executed */ X { X Proc_6 (Ident_1, &Enum_Loc); X strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING"); X Int_2_Loc = Run_Index; X Int_Glob = Run_Index; X } X } X /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */ X Int_2_Loc = Int_2_Loc * Int_1_Loc; X Int_1_Loc = Int_2_Loc / Int_3_Loc; X Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc; X /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */ X Proc_2 (&Int_1_Loc); X /* Int_1_Loc == 5 */ X X } /* loop "for Run_Index" */ X X /**************/ X /* Stop timer */ X /**************/ X X#ifdef TIMES X times (&time_info); X End_Time = (long) time_info.tms_utime; X#endif X#ifdef TIME X End_Time = time ( (long *) 0); X#endif X#ifdef MSC_CLOCK X End_Time = clock(); X#endif X X printf ("Execution ends\n"); X printf ("\n"); X printf ("Final values of the variables used in the benchmark:\n"); X printf ("\n"); X printf ("Int_Glob: %d\n", Int_Glob); X printf (" should be: %d\n", 5); X printf ("Bool_Glob: %d\n", Bool_Glob); X printf (" should be: %d\n", 1); X printf ("Ch_1_Glob: %c\n", Ch_1_Glob); X printf (" should be: %c\n", 'A'); X printf ("Ch_2_Glob: %c\n", Ch_2_Glob); X printf (" should be: %c\n", 'B'); X printf ("Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]); X printf (" should be: %d\n", 7); X printf ("Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]); X printf (" should be: Number_Of_Runs + 10\n"); X printf ("Ptr_Glob->\n"); X printf (" Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp); X printf (" should be: (implementation-dependent)\n"); X printf (" Discr: %d\n", Ptr_Glob->Discr); X printf (" should be: %d\n", 0); X printf (" Enum_Comp: %d\n", Ptr_Glob->variant.var_1.Enum_Comp); X printf (" should be: %d\n", 2); X printf (" Int_Comp: %d\n", Ptr_Glob->variant.var_1.Int_Comp); X printf (" should be: %d\n", 17); X printf (" Str_Comp: %s\n", Ptr_Glob->variant.var_1.Str_Comp); X printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n"); X printf ("Next_Ptr_Glob->\n"); X printf (" Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp); X printf (" should be: (implementation-dependent), same as above\n"); X printf (" Discr: %d\n", Next_Ptr_Glob->Discr); X printf (" should be: %d\n", 0); X printf (" Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp); X printf (" should be: %d\n", 1); X printf (" Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp); X printf (" should be: %d\n", 18); X printf (" Str_Comp: %s\n", X Next_Ptr_Glob->variant.var_1.Str_Comp); X printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n"); X printf ("Int_1_Loc: %d\n", Int_1_Loc); X printf (" should be: %d\n", 5); X printf ("Int_2_Loc: %d\n", Int_2_Loc); X printf (" should be: %d\n", 13); X printf ("Int_3_Loc: %d\n", Int_3_Loc); X printf (" should be: %d\n", 7); X printf ("Enum_Loc: %d\n", Enum_Loc); X printf (" should be: %d\n", 1); X printf ("Str_1_Loc: %s\n", Str_1_Loc); X printf (" should be: DHRYSTONE PROGRAM, 1'ST STRING\n"); X printf ("Str_2_Loc: %s\n", Str_2_Loc); X printf (" should be: DHRYSTONE PROGRAM, 2'ND STRING\n"); X printf ("\n"); X X User_Time = End_Time - Begin_Time; X X if (User_Time < Too_Small_Time) X { X printf ("Measured time too small to obtain meaningful results\n"); X printf ("Please increase number of runs\n"); X printf ("\n"); X } X else X { X#ifdef TIME X Microseconds = (float) User_Time * Mic_secs_Per_Second X / (float) Number_Of_Runs; X Dhrystones_Per_Second = (float) Number_Of_Runs / (float) User_Time; X#else X Microseconds = (float) User_Time * Mic_secs_Per_Second X / ((float) HZ * ((float) Number_Of_Runs)); X Dhrystones_Per_Second = ((float) HZ * (float) Number_Of_Runs) X / (float) User_Time; X#endif X printf ("Microseconds for one run through Dhrystone: "); X printf ("%6.1f \n", Microseconds); X printf ("Dhrystones per Second: "); X printf ("%6.1f \n", Dhrystones_Per_Second); X printf ("\n"); X } X X} X X XProc_1 (Ptr_Val_Par) X/******************/ X XREG Rec_Pointer Ptr_Val_Par; X /* executed once */ X{ X REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp; X /* == Ptr_Glob_Next */ X /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */ X /* corresponds to "rename" in Ada, "with" in Pascal */ X X structassign (*Ptr_Val_Par->Ptr_Comp, *Ptr_Glob); X Ptr_Val_Par->variant.var_1.Int_Comp = 5; X Next_Record->variant.var_1.Int_Comp X = Ptr_Val_Par->variant.var_1.Int_Comp; X Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp; X Proc_3 (&Next_Record->Ptr_Comp); X /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp X == Ptr_Glob->Ptr_Comp */ X if (Next_Record->Discr == Ident_1) X /* then, executed */ X { X Next_Record->variant.var_1.Int_Comp = 6; X Proc_6 (Ptr_Val_Par->variant.var_1.Enum_Comp, X &Next_Record->variant.var_1.Enum_Comp); X Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp; X Proc_7 (Next_Record->variant.var_1.Int_Comp, 10, X &Next_Record->variant.var_1.Int_Comp); X } X else /* not executed */ X structassign (*Ptr_Val_Par, *Ptr_Val_Par->Ptr_Comp); X} /* Proc_1 */ X X XProc_2 (Int_Par_Ref) X/******************/ X /* executed once */ X /* *Int_Par_Ref == 1, becomes 4 */ X XOne_Fifty *Int_Par_Ref; X{ X One_Fifty Int_Loc; X Enumeration Enum_Loc; X X Int_Loc = *Int_Par_Ref + 10; X do /* executed once */ X if (Ch_1_Glob == 'A') X /* then, executed */ X { X Int_Loc -= 1; X *Int_Par_Ref = Int_Loc - Int_Glob; X Enum_Loc = Ident_1; X } /* if */ X while (Enum_Loc != Ident_1); /* true */ X} /* Proc_2 */ X X XProc_3 (Ptr_Ref_Par) X/******************/ X /* executed once */ X /* Ptr_Ref_Par becomes Ptr_Glob */ X XRec_Pointer *Ptr_Ref_Par; X X{ X if (Ptr_Glob != Null) X /* then, executed */ X *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp; X Proc_7 (10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp); X} /* Proc_3 */ X X XProc_4 () /* without parameters */ X/*******/ X /* executed once */ X{ X Boolean Bool_Loc; X X Bool_Loc = Ch_1_Glob == 'A'; X Bool_Glob = Bool_Loc | Bool_Glob; X Ch_2_Glob = 'B'; X} /* Proc_4 */ X X XProc_5 () /* without parameters */ X/*******/ X /* executed once */ X{ X Ch_1_Glob = 'A'; X Bool_Glob = false; X} /* Proc_5 */ X X X /* Procedure for the assignment of structures, */ X /* if the C compiler doesn't support this feature */ X#ifdef NOSTRUCTASSIGN Xmemcpy (d, s, l) Xregister char *d; Xregister char *s; Xregister int l; X{ X while (l--) *d++ = *s++; X} X#endif X X SHAR_EOF if test 11857 -ne "`wc -c < 'dhry_1.c'`" then echo shar: "error transmitting 'dhry_1.c'" '(should have been 11857 characters)' fi fi echo shar: "extracting 'dhry_2.c'" '(5273 characters)' if test -f 'dhry_2.c' then echo shar: "will not over-write existing file 'dhry_2.c'" else sed 's/^X//' << \SHAR_EOF > 'dhry_2.c' X/* X **************************************************************************** X * X * "DHRYSTONE" Benchmark Program X * ----------------------------- X * X * Version: C, Version 2.1 X * X * File: dhry_2.c (part 3 of 3) X * X * Date: May 25, 1988 X * X * Author: Reinhold P. Weicker X * X **************************************************************************** X */ X X#include "dhry.h" X X#ifndef REG X#define REG X /* REG becomes defined as empty */ X /* i.e. no register variables */ X#endif X Xextern int Int_Glob; Xextern char Ch_1_Glob; X X XProc_6 (Enum_Val_Par, Enum_Ref_Par) X/*********************************/ X /* executed once */ X /* Enum_Val_Par == Ident_3, Enum_Ref_Par becomes Ident_2 */ X XEnumeration Enum_Val_Par; XEnumeration *Enum_Ref_Par; X{ X *Enum_Ref_Par = Enum_Val_Par; X if (! Func_3 (Enum_Val_Par)) X /* then, not executed */ X *Enum_Ref_Par = Ident_4; X switch (Enum_Val_Par) X { X case Ident_1: X *Enum_Ref_Par = Ident_1; X break; X case Ident_2: X if (Int_Glob > 100) X /* then */ X *Enum_Ref_Par = Ident_1; X else *Enum_Ref_Par = Ident_4; X break; X case Ident_3: /* executed */ X *Enum_Ref_Par = Ident_2; X break; X case Ident_4: break; X case Ident_5: X *Enum_Ref_Par = Ident_3; X break; X } /* switch */ X} /* Proc_6 */ X X XProc_7 (Int_1_Par_Val, Int_2_Par_Val, Int_Par_Ref) X/**********************************************/ X /* executed three times */ X /* first call: Int_1_Par_Val == 2, Int_2_Par_Val == 3, */ X /* Int_Par_Ref becomes 7 */ X /* second call: Int_1_Par_Val == 10, Int_2_Par_Val == 5, */ X /* Int_Par_Ref becomes 17 */ X /* third call: Int_1_Par_Val == 6, Int_2_Par_Val == 10, */ X /* Int_Par_Ref becomes 18 */ XOne_Fifty Int_1_Par_Val; XOne_Fifty Int_2_Par_Val; XOne_Fifty *Int_Par_Ref; X{ X One_Fifty Int_Loc; X X Int_Loc = Int_1_Par_Val + 2; X *Int_Par_Ref = Int_2_Par_Val + Int_Loc; X} /* Proc_7 */ X X XProc_8 (Arr_1_Par_Ref, Arr_2_Par_Ref, Int_1_Par_Val, Int_2_Par_Val) X/*********************************************************************/ X /* executed once */ X /* Int_Par_Val_1 == 3 */ X /* Int_Par_Val_2 == 7 */ XArr_1_Dim Arr_1_Par_Ref; XArr_2_Dim Arr_2_Par_Ref; Xint Int_1_Par_Val; Xint Int_2_Par_Val; X{ X REG One_Fifty Int_Index; X REG One_Fifty Int_Loc; X X Int_Loc = Int_1_Par_Val + 5; X Arr_1_Par_Ref [Int_Loc] = Int_2_Par_Val; X Arr_1_Par_Ref [Int_Loc+1] = Arr_1_Par_Ref [Int_Loc]; X Arr_1_Par_Ref [Int_Loc+30] = Int_Loc; X for (Int_Index = Int_Loc; Int_Index <= Int_Loc+1; ++Int_Index) X Arr_2_Par_Ref [Int_Loc] [Int_Index] = Int_Loc; X Arr_2_Par_Ref [Int_Loc] [Int_Loc-1] += 1; X Arr_2_Par_Ref [Int_Loc+20] [Int_Loc] = Arr_1_Par_Ref [Int_Loc]; X Int_Glob = 5; X} /* Proc_8 */ X X XEnumeration Func_1 (Ch_1_Par_Val, Ch_2_Par_Val) X/*************************************************/ X /* executed three times */ X /* first call: Ch_1_Par_Val == 'H', Ch_2_Par_Val == 'R' */ X /* second call: Ch_1_Par_Val == 'A', Ch_2_Par_Val == 'C' */ X /* third call: Ch_1_Par_Val == 'B', Ch_2_Par_Val == 'C' */ X XCapital_Letter Ch_1_Par_Val; XCapital_Letter Ch_2_Par_Val; X{ X Capital_Letter Ch_1_Loc; X Capital_Letter Ch_2_Loc; X X Ch_1_Loc = Ch_1_Par_Val; X Ch_2_Loc = Ch_1_Loc; X if (Ch_2_Loc != Ch_2_Par_Val) X /* then, executed */ X return (Ident_1); X else /* not executed */ X { X Ch_1_Glob = Ch_1_Loc; X return (Ident_2); X } X} /* Func_1 */ X X XBoolean Func_2 (Str_1_Par_Ref, Str_2_Par_Ref) X/*************************************************/ X /* executed once */ X /* Str_1_Par_Ref == "DHRYSTONE PROGRAM, 1'ST STRING" */ X /* Str_2_Par_Ref == "DHRYSTONE PROGRAM, 2'ND STRING" */ X XStr_30 Str_1_Par_Ref; XStr_30 Str_2_Par_Ref; X{ X REG One_Thirty Int_Loc; X Capital_Letter Ch_Loc; X X Int_Loc = 2; X while (Int_Loc <= 2) /* loop body executed once */ X if (Func_1 (Str_1_Par_Ref[Int_Loc], X Str_2_Par_Ref[Int_Loc+1]) == Ident_1) X /* then, executed */ X { X Ch_Loc = 'A'; X Int_Loc += 1; X } /* if, while */ X if (Ch_Loc >= 'W' && Ch_Loc < 'Z') X /* then, not executed */ X Int_Loc = 7; X if (Ch_Loc == 'R') X /* then, not executed */ X return (true); X else /* executed */ X { X if (strcmp (Str_1_Par_Ref, Str_2_Par_Ref) > 0) X /* then, not executed */ X { X Int_Loc += 7; X Int_Glob = Int_Loc; X return (true); X } X else /* executed */ X return (false); X } /* if Ch_Loc */ X} /* Func_2 */ X X XBoolean Func_3 (Enum_Par_Val) X/***************************/ X /* executed once */ X /* Enum_Par_Val == Ident_3 */ XEnumeration Enum_Par_Val; X{ X Enumeration Enum_Loc; X X Enum_Loc = Enum_Par_Val; X if (Enum_Loc == Ident_3) X /* then, executed */ X return (true); X else /* not executed */ X return (false); X} /* Func_3 */ X SHAR_EOF if test 5273 -ne "`wc -c < 'dhry_2.c'`" then echo shar: "error transmitting 'dhry_2.c'" '(should have been 5273 characters)' fi fi exit 0 # End of shell archive