diff options
Diffstat (limited to 'zpu/roadshow/roadshow')
60 files changed, 8095 insertions, 0 deletions
diff --git a/zpu/roadshow/roadshow/build/makefirmware.sh b/zpu/roadshow/roadshow/build/makefirmware.sh new file mode 100644 index 0000000..b44559b --- /dev/null +++ b/zpu/roadshow/roadshow/build/makefirmware.sh @@ -0,0 +1,13 @@ +echo >$2 ZylinPhiFirmware + +if [ x"$3" = x ] ;then + echo "No ic300.bit embedded into .phi" +else + echo "Embed ic300.bit into .phi" + echo >>$2 "FPGA: `wc -c $3 | grep -o -e \[0-9\]*`" + cat >>$2 $1 +fi +echo "Writing application" +echo >>$2 "Application: `wc -c $1 | grep -o -e \[0-9\]*`" +cat >>$2 $1 +echo >>$2 Done
\ No newline at end of file diff --git a/zpu/roadshow/roadshow/codesize/.cvsignore b/zpu/roadshow/roadshow/codesize/.cvsignore new file mode 100644 index 0000000..6559932 --- /dev/null +++ b/zpu/roadshow/roadshow/codesize/.cvsignore @@ -0,0 +1 @@ +smallstd.elf diff --git a/zpu/roadshow/roadshow/codesize/crt0_phi.S b/zpu/roadshow/roadshow/codesize/crt0_phi.S new file mode 100644 index 0000000..4d654e2 --- /dev/null +++ b/zpu/roadshow/roadshow/codesize/crt0_phi.S @@ -0,0 +1,178 @@ +/* Startup code for ZPU + Copyright (C) 2005 Free Software Foundation, Inc. + +This file is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by the +Free Software Foundation; either version 2, or (at your option) any +later version. + +In addition to the permissions in the GNU General Public License, the +Free Software Foundation gives you unlimited permission to link the +compiled version of this file with other programs, and to distribute +those programs without any restriction coming from the use of this +file. (The General Public License restrictions do apply in other +respects; for example, they cover modification of the file, and +distribution when not linked into another program.) + +This file is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with this program; see the file COPYING. If not, write to +the Free Software Foundation, 59 Temple Place - Suite 330, +Boston, MA 02111-1307, USA. */ + .file "crt0.S" + + + + +; .section ".fixed_vectors","ax" +; KLUDGE!!! we remove the executable bit to avoid relaxation + .section ".fixed_vectors","a" + +; DANGER!!!! +; we need to align these code sections to 32 bytes, which +; means we must not use any assembler instructions that are relaxed +; at linker time +; DANGER!!!! + + .macro fixedim value + im \value + .endm + + .macro jsr address + + im 0 ; save R0 + load + im 4 ; save R1 + load + im 8 ; save R2 + load + + fixedim \address + call + + im 8 + store ; restore R2 + im 4 + store ; restore R1 + im 0 + store ; restore R0 + .endm + + + .macro jmp address + fixedim \address + poppc + .endm + + + .macro fast_neg + not + im 1 + add + .endm + + .macro cimpl funcname + ; save R0 + im 0 + load + + ; save R1 + im 4 + load + + ; save R2 + im 8 + load + + loadsp 20 + loadsp 20 + + fixedim \funcname + call + + ; destroy arguments on stack + storesp 0 + storesp 0 + + im 0 + load + + ; poke the result into the right slot + storesp 24 + + ; restore R2 + im 8 + store + + ; restore R1 + im 4 + store + + ; restore r0 + im 0 + store + + + storesp 4 + poppc + .endm + + .macro mult1bit + ; create mask of lowest bit in A + loadsp 8 ; A + im 1 + and + im -1 + add + not + loadsp 8 ; B + and + add ; accumulate in C + + ; shift B left 1 bit + loadsp 4 ; B + addsp 0 + storesp 8 ; B + + ; shift A right 1 bit + loadsp 8 ; A + flip + addsp 0 + flip + storesp 12 ; A + .endm + + + +/* vectors */ + .balign 32,0 +# offset 0x0000 0000 + .globl _start +_start: + ; intSp must be 0 when we jump to _premain + + im ZPU_ID + loadsp 0 + im _cpu_config + store + config + jmp _premain + + + +/* instruction emulation code */ + + .data + + + .globl _hardware +_hardware: + .long 0 + .globl _cpu_config +_cpu_config: + .long 0 + diff --git a/zpu/roadshow/roadshow/codesize/hello.c b/zpu/roadshow/roadshow/codesize/hello.c new file mode 100644 index 0000000..176275c --- /dev/null +++ b/zpu/roadshow/roadshow/codesize/hello.c @@ -0,0 +1,9 @@ +/* Simple hello world */
+#include <stdio.h>
+
+
+int main(int argc, char **argv)
+{
+ puts("Hello world\n");
+}
+
diff --git a/zpu/roadshow/roadshow/codesize/small.c b/zpu/roadshow/roadshow/codesize/small.c new file mode 100644 index 0000000..0317343 --- /dev/null +++ b/zpu/roadshow/roadshow/codesize/small.c @@ -0,0 +1,9 @@ +void _premain(void) +{ + volatile int *someRegister=(volatile int *)0; + volatile int *otherRegister=(volatile int *)4; + while (*someRegister!=0) + { + *otherRegister++; + } +} diff --git a/zpu/roadshow/roadshow/codesize/small.elf b/zpu/roadshow/roadshow/codesize/small.elf Binary files differnew file mode 100644 index 0000000..4193a53 --- /dev/null +++ b/zpu/roadshow/roadshow/codesize/small.elf diff --git a/zpu/roadshow/roadshow/codesize/smallstd.c b/zpu/roadshow/roadshow/codesize/smallstd.c new file mode 100644 index 0000000..5d4b87a --- /dev/null +++ b/zpu/roadshow/roadshow/codesize/smallstd.c @@ -0,0 +1,9 @@ +int main(int argc, char **argv) +{ + volatile int *someRegister=(volatile int *)0; + volatile int *otherRegister=(volatile int *)4; + while (*someRegister!=0) + { + *otherRegister++; + } +} diff --git a/zpu/roadshow/roadshow/dhrystone/.cvsignore b/zpu/roadshow/roadshow/dhrystone/.cvsignore new file mode 100644 index 0000000..3544c3f --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/.cvsignore @@ -0,0 +1,2 @@ +dhrystone.elf +dhrystone_zpu.elf diff --git a/zpu/roadshow/roadshow/dhrystone/RATIONALE b/zpu/roadshow/roadshow/dhrystone/RATIONALE new file mode 100644 index 0000000..926e046 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/RATIONALE @@ -0,0 +1,361 @@ + + + Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules + + [published in SIGPLAN Notices 23,8 (Aug. 1988), 49-62] + + + Reinhold P. Weicker + Siemens AG, E STE 35 + [now: Siemens AG, AUT E 51] + Postfach 3220 + D-8520 Erlangen + Germany (West) + + + + +1. Why a Version 2 of Dhrystone? + +The Dhrystone benchmark program [1] has become a popular benchmark for +CPU/compiler performance measurement, in particular in the area of +minicomputers, workstations, PC's and microprocesors. It apparently satisfies +a need for an easy-to-use integer benchmark; it gives a first performance +indication which is more meaningful than MIPS numbers which, in their literal +meaning (million instructions per second), cannot be used across different +instruction sets (e.g. RISC vs. CISC). With the increasing use of the +benchmark, it seems necessary to reconsider the benchmark and to check whether +it can still fulfill this function. Version 2 of Dhrystone is the result of +such a re-evaluation, it has been made for two reasons: + +o Dhrystone has been published in Ada [1], and Versions in Ada, Pascal and C + have been distributed by Reinhold Weicker via floppy disk. However, the + version that was used most often for benchmarking has been the version made + by Rick Richardson by another translation from the Ada version into the C + programming language, this has been the version distributed via the UNIX + network Usenet [2]. + + There is an obvious need for a common C version of Dhrystone, since C is at + present the most popular system programming language for the class of + systems (microcomputers, minicomputers, workstations) where Dhrystone is + used most. There should be, as far as possible, only one C version of + Dhrystone such that results can be compared without restrictions. In the + past, the C versions distributed by Rick Richardson (Version 1.1) and by + Reinhold Weicker had small (though not significant) differences. + + Together with the new C version, the Ada and Pascal versions have been + updated as well. + +o As far as it is possible without changes to the Dhrystone statistics, + optimizing compilers should be prevented from removing significant + statements. It has turned out in the past that optimizing compilers + suppressed code generation for too many statements (by "dead code removal" + or "dead variable elimination"). This has lead to the danger that + benchmarking results obtained by a naive application of Dhrystone - without + inspection of the code that was generated - could become meaningless. + +The overall policiy for version 2 has been that the distribution of +statements, operand types and operand locality described in [1] should remain +unchanged as much as possible. (Very few changes were necessary; their impact +should be negligible.) Also, the order of statements should remain unchanged. +Although I am aware of some critical remarks on the benchmark - I agree with +several of them - and know some suggestions for improvement, I didn't want to +change the benchmark into something different from what has become known as +"Dhrystone"; the confusion generated by such a change would probably outweight +the benefits. If I were to write a new benchmark program, I wouldn't give it +the name "Dhrystone" since this denotes the program published in [1]. +However, I do recognize the need for a larger number of representative +programs that can be used as benchmarks; users should always be encouraged to +use more than just one benchmark. + +The new versions (version 2.1 for C, Pascal and Ada) will be distributed as +widely as possible. (Version 2.1 differs from version 2.0 distributed via the +UNIX Network Usenet in March 1988 only in a few corrections for minor +deficiencies found by users of version 2.0.) Readers who want to use the +benchmark for their own measurements can obtain a copy in machine-readable +form on floppy disk (MS-DOS or XENIX format) from the author. + + +2. Overall Characteristics of Version 2 + +In general, version 2 follows - in the parts that are significant for +performance measurement, i.e. within the measurement loop - the published +(Ada) version and the C versions previously distributed. Where the versions +distributed by Rick Richardson [2] and Reinhold Weicker have been different, +it follows the version distributed by Reinhold Weicker. (However, the +differences have been so small that their impact on execution time in all +likelihood has been negligible.) The initialization and UNIX instrumentation +part - which had been omitted in [1] - follows mostly the ideas of Rick +Richardson [2]. However, any changes in the initialization part and in the +printing of the result have no impact on performance measurement since they +are outside the measaurement loop. As a concession to older compilers, names +have been made unique within the first 8 characters for the C version. + +The original publication of Dhrystone did not contain any statements for time +measurement since they are necessarily system-dependent. However, it turned +out that it is not enough just to inclose the main procedure of Dhrystone in a +loop and to measure the execution time. If the variables that are computed +are not used somehow, there is the danger that the compiler considers them as +"dead variables" and suppresses code generation for a part of the statements. +Therefore in version 2 all variables of "main" are printed at the end of the +program. This also permits some plausibility control for correct execution of +the benchmark. + +At several places in the benchmark, code has been added, but only in branches +that are not executed. The intention is that optimizing compilers should be +prevented from moving code out of the measurement loop, or from removing code +altogether. Statements that are executed have been changed in very few places +only. In these cases, only the role of some operands has been changed, and it +was made sure that the numbers defining the "Dhrystone distribution" +(distribution of statements, operand types and locality) still hold as much as +possible. Except for sophisticated optimizing compilers, execution times for +version 2.1 should be the same as for previous versions. + +Because of the self-imposed limitation that the order and distribution of the +executed statements should not be changed, there are still cases where +optimizing compilers may not generate code for some statements. To a certain +degree, this is unavoidable for small synthetic benchmarks. Users of the +benchmark are advised to check code listings whether code is generated for all +statements of Dhrystone. + +Contrary to the suggestion in the published paper and its realization in the +versions previously distributed, no attempt has been made to subtract the time +for the measurement loop overhead. (This calculation has proven difficult to +implement in a correct way, and its omission makes the program simpler.) +However, since the loop check is now part of the benchmark, this does have an +impact - though a very minor one - on the distribution statistics which have +been updated for this version. + + +3. Discussion of Individual Changes + +In this section, all changes are described that affect the measurement loop +and that are not just renamings of variables. All remarks refer to the C +version; the other language versions have been updated similarly. + +In addition to adding the measurement loop and the printout statements, +changes have been made at the following places: + +o In procedure "main", three statements have been added in the non-executed + "then" part of the statement + + if (Enum_Loc == Func_1 (Ch_Index, 'C')) + + they are + + strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING"); + Int_2_Loc = Run_Index; + Int_Glob = Run_Index; + + The string assignment prevents movement of the preceding assignment to + Str_2_Loc (5'th statement of "main") out of the measurement loop (This + probably will not happen for the C version, but it did happen with another + language and compiler.) The assignment to Int_2_Loc prevents value + propagation for Int_2_Loc, and the assignment to Int_Glob makes the value of + Int_Glob possibly dependent from the value of Run_Index. + +o In the three arithmetic computations at the end of the measurement loop in + "main ", the role of some variables has been exchanged, to prevent the + division from just cancelling out the multiplication as it was in [1]. A + very smart compiler might have recognized this and suppressed code + generation for the division. + +o For Proc_2, no code has been changed, but the values of the actual parameter + have changed due to changes in "main". + +o In Proc_4, the second assignment has been changed from + + Bool_Loc = Bool_Loc | Bool_Glob; + + to + + Bool_Glob = Bool_Loc | Bool_Glob; + + It now assigns a value to a global variable instead of a local variable + (Bool_Loc); Bool_Loc would be a "dead variable" which is not used + afterwards. + +o In Func_1, the statement + + Ch_1_Glob = Ch_1_Loc; + + was added in the non-executed "else" part of the "if" statement, to prevent + the suppression of code generation for the assignment to Ch_1_Loc. + +o In Func_2, the second character comparison statement has been changed to + + if (Ch_Loc == 'R') + + ('R' instead of 'X') because a comparison with 'X' is implied in the + preceding "if" statement. + + Also in Func_2, the statement + + Int_Glob = Int_Loc; + + has been added in the non-executed part of the last "if" statement, in order + to prevent Int_Loc from becoming a dead variable. + +o In Func_3, a non-executed "else" part has been added to the "if" statement. + While the program would not be incorrect without this "else" part, it is + considered bad programming practice if a function can be left without a + return value. + + To compensate for this change, the (non-executed) "else" part in the "if" + statement of Proc_3 was removed. + +The distribution statistics have been changed only by the addition of the +measurement loop iteration (1 additional statement, 4 additional local integer +operands) and by the change in Proc_4 (one operand changed from local to +global). The distribution statistics in the comment headers have been updated +accordingly. + + +4. String Operations + +The string operations (string assignment and string comparison) have not been +changed, to keep the program consistent with the original version. + +There has been some concern that the string operations are over-represented in +the program, and that execution time is dominated by these operations. This +was true in particular when optimizing compilers removed too much code in the +main part of the program, this should have been mitigated in version 2. + +It should be noted that this is a language-dependent issue: Dhrystone was +first published in Ada, and with Ada or Pascal semantics, the time spent in +the string operations is, at least in all implementations known to me, +considerably smaller. In Ada and Pascal, assignment and comparison of strings +are operators defined in the language, and the upper bounds of the strings +occuring in Dhrystone are part of the type information known at compilation +time. The compilers can therefore generate efficient inline code. In C, +string assignemt and comparisons are not part of the language, so the string +operations must be expressed in terms of the C library functions "strcpy" and +"strcmp". (ANSI C allows an implementation to use inline code for these +functions.) In addition to the overhead caused by additional function calls, +these functions are defined for null-terminated strings where the length of +the strings is not known at compilation time; the function has to check every +byte for the termination condition (the null byte). + +Obviously, a C library which includes efficiently coded "strcpy" and "strcmp" +functions helps to obtain good Dhrystone results. However, I don't think that +this is unfair since string functions do occur quite frequently in real +programs (editors, command interpreters, etc.). If the strings functions are +implemented efficiently, this helps real programs as well as benchmark +programs. + +I admit that the string comparison in Dhrystone terminates later (after +scanning 20 characters) than most string comparisons in real programs. For +consistency with the original benchmark, I didn't change the program despite +this weakness. + + +5. Intended Use of Dhrystone + +When Dhrystone is used, the following "ground rules" apply: + +o Separate compilation (Ada and C versions) + + As mentioned in [1], Dhrystone was written to reflect actual programming + practice in systems programming. The division into several compilation + units (5 in the Ada version, 2 in the C version) is intended, as is the + distribution of inter-module and intra-module subprogram calls. Although on + many systems there will be no difference in execution time to a Dhrystone + version where all compilation units are merged into one file, the rule is + that separate compilation should be used. The intention is that real + programming practice, where programs consist of several independently + compiled units, should be reflected. This also has implies that the + compiler, while compiling one unit, has no information about the use of + variables, register allocation etc. occuring in other compilation units. + Although in real life compilation units will probably be larger, the + intention is that these effects of separate compilation are modeled in + Dhrystone. + + A few language systems have post-linkage optimization available (e.g., final + register allocation is performed after linkage). This is a borderline case: + Post-linkage optimization involves additional program preparation time + (although not as much as compilation in one unit) which may prevent its + general use in practical programming. I think that since it defeats the + intentions given above, it should not be used for Dhrystone. + + Unfortunately, ISO/ANSI Pascal does not contain language features for + separate compilation. Although most commercial Pascal compilers provide + separate compilation in some way, we cannot use it for Dhrystone since such + a version would not be portable. Therefore, no attempt has been made to + provide a Pascal version with several compilation units. + +o No procedure merging + + Although Dhrystone contains some very short procedures where execution would + benefit from procedure merging (inlining, macro expansion of procedures), + procedure merging is not to be used. The reason is that the percentage of + procedure and function calls is part of the "Dhrystone distribution" of + statements contained in [1]. This restriction does not hold for the string + functions of the C version since ANSI C allows an implementation to use + inline code for these functions. + +o Other optimizations are allowed, but they should be indicated + + It is often hard to draw an exact line between "normal code generation" and + "optimization" in compilers: Some compilers perform operations by default + that are invoked in other compilers only when optimization is explicitly + requested. Also, we cannot avoid that in benchmarking people try to achieve + results that look as good as possible. Therefore, optimizations performed + by compilers - other than those listed above - are not forbidden when + Dhrystone execution times are measured. Dhrystone is not intended to be + non-optimizable but is intended to be similarly optimizable as normal + programs. For example, there are several places in Dhrystone where + performance benefits from optimizations like common subexpression + elimination, value propagation etc., but normal programs usually also + benefit from these optimizations. Therefore, no effort was made to + artificially prevent such optimizations. However, measurement reports + should indicate which compiler optimization levels have been used, and + reporting results with different levels of compiler optimization for the + same hardware is encouraged. + +o Default results are those without "register" declarations (C version) + + When Dhrystone results are quoted without additional qualification, they + should be understood as results obtained without use of the "register" + attribute. Good compilers should be able to make good use of registers even + without explicit register declarations ([3], p. 193). + +Of course, for experimental purposes, post-linkage optimization, procedure +merging and/or compilation in one unit can be done to determine their effects. +However, Dhrystone numbers obtained under these conditions should be +explicitly marked as such; "normal" Dhrystone results should be understood as +results obtained following the ground rules listed above. + +In any case, for serious performance evaluation, users are advised to ask for +code listings and to check them carefully. In this way, when results for +different systems are compared, the reader can get a feeling how much +performance difference is due to compiler optimization and how much is due to +hardware speed. + + +6. Acknowledgements + +The C version 2.1 of Dhrystone has been developed in cooperation with Rick +Richardson (Tinton Falls, NJ), it incorporates many ideas from the "Version +1.1" distributed previously by him over the UNIX network Usenet. Through his +activity with Usenet, Rick Richardson has made a very valuable contribution to +the dissemination of the benchmark. I also thank Chaim Benedelac (National +Semiconductor), David Ditzel (SUN), Earl Killian and John Mashey (MIPS), Alan +Smith and Rafael Saavedra-Barrera (UC at Berkeley) for their help with +comments on earlier versions of the benchmark. + + +7. Bibliography + +[1] + Reinhold P. Weicker: Dhrystone: A Synthetic Systems Programming Benchmark. + Communications of the ACM 27, 10 (Oct. 1984), 1013-1030 + +[2] + Rick Richardson: Dhrystone 1.1 Benchmark Summary (and Program Text) + Informal Distribution via "Usenet", Last Version Known to me: Sept. 21, + 1987 + +[3] + Brian W. Kernighan and Dennis M. Ritchie: The C Programming Language. + Prentice-Hall, Englewood Cliffs (NJ) 1978 + diff --git a/zpu/roadshow/roadshow/dhrystone/README_C b/zpu/roadshow/roadshow/dhrystone/README_C new file mode 100644 index 0000000..a27a192 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/README_C @@ -0,0 +1,78 @@ +This "shar" file contains the documentation for the +electronic mail distribution of the Dhrystone benchmark (C version 2.1); +a companion "shar" file contains the source code. +(Because of mail length restrictions for some mailers, I have +split the distribution in two parts.) + +For versions in other languages, see the other "shar" files. + +Files containing the C version (*.h: Header File, *.c: C Modules) + + dhry.h + dhry_1.c + dhry_2.c + +The file RATIONALE contains the article + + "Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules" + +which has been published, together with the C source code (Version 2.0), +in SIGPLAN Notices vol. 23, no. 8 (Aug. 1988), pp. 49-62. +This article explains all changes that have been made for Version 2, +compared with the version of the original publication +in Communications of the ACM vol. 27, no. 10 (Oct. 1984), pp. 1013-1030. +It also contains "ground rules" for benchmarking with Dhrystone +which should be followed by everyone who uses the program and publishes +Dhrystone results. + +Compared with the Version 2.0 published in SIGPLAN Notices, Version 2.1 +contains a few corrections that have been made after Version 2.0 was +distriobuted over the UNIX network Usenet. These small differences between +Version 2.0 and 2.1 should not affect execution time measurements. +For those who want to compare the exact contents of both versions, +the file "dhry_c.dif" contains the differences between the two versions, +as generated by a file comparison of the corresponding files with the +UNIX utility "diff". + +The file VARIATIONS contains the article + + "Understanding Variations in Dhrystone Performance" + +which has been published in Microprocessor Report, May 1989 +(Editor: M. Slater), pp. 16-17. It describes the points that users +should know if C Dhrystone results are compared. + +Recipients of this shar file who perform measurements are asked +to send measurement results to the author and/or to Rick Richardson. +Rick Richardson publishes regularly Dhrystone results on the UNIX network +Usenet. For submissions of results to him (preferably by electronic mail, +see address in the program header), he has provided a form which is contained +in the file "submit.frm". + + +The following files are contained in other "shar" files: + +Files containing the Ada version (*.s: Specifications, *.b: Bodies): + + d_global.s + d_main.b + d_pack_1.b + d_pack_1.s + d_pack_2.b + d_pack_2.s + +File containing the Pascal version: + + dhry.p + + +February 22, 1990 + + Reinhold P. Weicker + Siemens AG, AUT E 51 + Postfach 3220 + D-8520 Erlangen + Germany (West) + + Phone: [xxx-49]-9131-7-20330 (8-17 Central European Time) + UUCP: ..!mcsun!unido!estevax!weicker diff --git a/zpu/roadshow/roadshow/dhrystone/VARIATIONS b/zpu/roadshow/roadshow/dhrystone/VARIATIONS new file mode 100644 index 0000000..3046cbd --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/VARIATIONS @@ -0,0 +1,157 @@ + + Understanding Variations in Dhrystone Performance + + + + By Reinhold P. Weicker, Siemens AG, AUT E 51, Erlangen + + + + April 1989 + + + This article has appeared in: + + + Microprocessor Report, May 1989 (Editor: M. Slater), pp. 16-17 + + + + +Microprocessor manufacturers tend to credit all the performance measured by +benchmarks to the speed of their processors, they often don't even mention the +programming language and compiler used. In their detailed documents, usually +called "performance brief" or "performance report," they usually do give more +details. However, these details are often lost in the press releases and other +marketing statements. For serious performance evaluation, it is necessary to +study the code generated by the various compilers. + +Dhrystone was originally published in Ada (Communications of the ACM, Oct. +1984). However, since good Ada compilers were rare at this time and, together +with UNIX, C became more and more popular, the C version of Dhrystone is the +one now mainly used in industry. There are "official" versions 2.1 for Ada, +Pascal, and C, which are as close together as the languages' semantic +differences permit. + +Dhrystone contains two statements where the programming language and its +translation play a major part in the execution time measured by the benchmark: + + o String assignment (in procedure Proc_0 / main) + o String comparison (in function Func_2) + +In Ada and Pascal, strings are arrays of characters where the length of the +string is part of the type information known at compile time. In C, strings +are also arrays of characters, but there are no operators defined in the +language for assignment and comparison of strings. Instead, functions +"strcpy" and "strcmp" are used. These functions are defined for strings of +arbitrary length, and make use of the fact that strings in C have to end with +a terminating null byte. For general-purpose calls to these functions, the +implementor can assume nothing about the length and the alignment of the +strings involved. + +The C version of Dhrystone spends a relatively large amount of time in these +two functions. Some time ago, I made measurements on a VAX 11/785 with the +Berkeley UNIX (4.2) compilers (often-used compilers, but certainly not the +most advanced). In the C version, 23% of the time was spent in the string +functions; in the Pascal version, only 10%. On good RISC machines (where less +time is spent in the procedure calling sequence than on a VAX) and with better +optimizing compilers, the percentage is higher; MIPS has reported 34% for an +R3000. Because of this effect, Pascal and Ada Dhrystone results are usually +better than C results (except when the optimization quality of the C compiler +is considerably better than that of the other compilers). + +Several people have noted that the string operations are over-represented in +Dhrystone, mainly because the strings occurring in Dhrystone are longer than +average strings. I admit that this is true, and have said so in my SIGPLAN +Notices paper (Aug. 1988); however, I didn't want to generate confusion by +changing the string lengths from version 1 to version 2. + +Even if they are somewhat over-represented in Dhrystone, string operations are +frequent enough that it makes sense to implement them in the most efficient +way possible, not only for benchmarking purposes. This means that they can +and should be written in assembly language code. ANSI C also explicitly allows +the strings functions to be implemented as macros, i.e. by inline code. + +There is also a third way to speed up the "strcpy" statement in Dhrystone: For +this particular "strcpy" statement, the source of the assignment is a string +constant. Therefore, in contrast to calls to "strcpy" in the general case, the +compiler knows the length and alignment of the strings involved at compile +time and can generate code in the same efficient way as a Pascal compiler +(word instructions instead of byte instructions). + +This is not allowed in the case of the "strcmp" call: Here, the addresses are +formal procedure parameters, and no assumptions can be made about the length +or alignment of the strings. Any such assumptions would indicate an incorrect +implementation. They might work for Dhrystone, where the strings are in fact +word-aligned with typical compilers, but other programs would deliver +incorrect results. + +So, for an apple-to-apple comparison between processors, and not between +several possible (legal or illegal) degrees of compiler optimization, one +should check that the systems are comparable with respect to the following +three points: + + (1) String functions in assembly language vs. in C + + Frequently used functions such as the string functions can and should be + written in assembly language, and all serious C language systems known + to me do this. (I list this point for completeness only.) Note that + processors with an instruction that checks a word for a null byte (such + as AMD's 29000 and Intel's 80960) have an advantage here. (This + advantage decreases relatively if optimization (3) is applied.) Due to + the length of the strings involved in Dhrystone, this advantage may be + considered too high in perspective, but it is certainly legal to use + such instructions - after all, these situations are what they were + invented for. + + (2) String function code inline vs. as library functions. + + ANSI C has created a new situation, compared with the older + Kernighan/Ritchie C. In the original C, the definition of the string + function was not part of the language. Now it is, and inlining is + explicitly allowed. I probably should have stated more clearly in my + SIGPLAN Notices paper that the rule "No procedure inlining for + Dhrystone" referred to the user level procedures only and not to the + library routines. + + (3) Fixed-length and alignment assumptions for the strings + + Compilers should be allowed to optimize in these cases if (and only if) + it is safe to do so. For Dhrystone, this is the "strcpy" statement, but + not the "strcmp" statement (unless, of course, the "strcmp" code + explicitly checks the alignment at execution time and branches + accordingly). A "Dhrystone switch" for the compiler that causes the + generation of code that may not work under certain circumstances is + certainly inappropriate for comparisons. It has been reported in Usenet + that some C compilers provide such a compiler option; since I don't have + access to all C compilers involved, I cannot verify this. + + If the fixed-length and word-alignment assumption can be used, a wide + bus that permits fast multi-word load instructions certainly does help; + however, this fact by itself should not make a really big difference. + +A check of these points - something that is necessary for a thorough +evaluation and comparison of the Dhrystone performance claims - requires +object code listings as well as listings for the string functions (strcpy, +strcmp) that are possibly called by the program. + +I don't pretend that Dhrystone is a perfect tool to measure the integer +performance of microprocessors. The more it is used and discussed, the more I +myself learn about aspects that I hadn't noticed yet when I wrote the program. +And of course, the very success of a benchmark program is a danger in that +people may tune their compilers and/or hardware to it, and with this action +make it less useful. + +Whetstone and Linpack have their critical points also: The Whetstone rating +depends heavily on the speed of the mathematical functions (sine, sqrt, ...), +and Linpack is sensitive to data alignment for some cache configurations. + +Introduction of a standard set of public domain benchmark software (something +the SPEC effort attempts) is certainly a worthwhile thing. In the meantime, +people will continue to use whatever is available and widely distributed, and +Dhrystone ratings are probably still better than MIPS ratings if these are - +as often in industry - based on no reproducible derivation. However, any +serious performance evaluation requires more than just a comparison of raw +numbers; one has to make sure that the numbers have been obtained in a +comparable way. + diff --git a/zpu/roadshow/roadshow/dhrystone/build.sh b/zpu/roadshow/roadshow/dhrystone/build.sh new file mode 100644 index 0000000..5bba707 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/build.sh @@ -0,0 +1,7 @@ +zpu-elf-gcc -phi -DTIME dhry_1.c dhry_2.c -O3 -Wl,--relax -Wl,--gc-sections -o dhrystone.elf +zpu-elf-size *.elf +zpu-elf-objcopy -O binary dhrystone.elf dhrystone.bin +sh ../build/makefirmware.sh dhrystone.bin dhrystone.zpu + + + diff --git a/zpu/roadshow/roadshow/dhrystone/dhry-c b/zpu/roadshow/roadshow/dhrystone/dhry-c new file mode 100644 index 0000000..4cec46c --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhry-c @@ -0,0 +1,1779 @@ +# to unbundle, sh this file (in an empty directory) +echo RATIONALE 1>&2 +sed >RATIONALE <<'//GO.SYSIN DD RATIONALE' 's/^-//' +- +- +- Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules +- +- [published in SIGPLAN Notices 23,8 (Aug. 1988), 49-62] +- +- +- Reinhold P. Weicker +- Siemens AG, E STE 35 +- [now: Siemens AG, AUT E 51] +- Postfach 3220 +- D-8520 Erlangen +- Germany (West) +- +- +- +- +-1. Why a Version 2 of Dhrystone? +- +-The Dhrystone benchmark program [1] has become a popular benchmark for +-CPU/compiler performance measurement, in particular in the area of +-minicomputers, workstations, PC's and microprocesors. It apparently satisfies +-a need for an easy-to-use integer benchmark; it gives a first performance +-indication which is more meaningful than MIPS numbers which, in their literal +-meaning (million instructions per second), cannot be used across different +-instruction sets (e.g. RISC vs. CISC). With the increasing use of the +-benchmark, it seems necessary to reconsider the benchmark and to check whether +-it can still fulfill this function. Version 2 of Dhrystone is the result of +-such a re-evaluation, it has been made for two reasons: +- +-o Dhrystone has been published in Ada [1], and Versions in Ada, Pascal and C +- have been distributed by Reinhold Weicker via floppy disk. However, the +- version that was used most often for benchmarking has been the version made +- by Rick Richardson by another translation from the Ada version into the C +- programming language, this has been the version distributed via the UNIX +- network Usenet [2]. +- +- There is an obvious need for a common C version of Dhrystone, since C is at +- present the most popular system programming language for the class of +- systems (microcomputers, minicomputers, workstations) where Dhrystone is +- used most. There should be, as far as possible, only one C version of +- Dhrystone such that results can be compared without restrictions. In the +- past, the C versions distributed by Rick Richardson (Version 1.1) and by +- Reinhold Weicker had small (though not significant) differences. +- +- Together with the new C version, the Ada and Pascal versions have been +- updated as well. +- +-o As far as it is possible without changes to the Dhrystone statistics, +- optimizing compilers should be prevented from removing significant +- statements. It has turned out in the past that optimizing compilers +- suppressed code generation for too many statements (by "dead code removal" +- or "dead variable elimination"). This has lead to the danger that +- benchmarking results obtained by a naive application of Dhrystone - without +- inspection of the code that was generated - could become meaningless. +- +-The overall policiy for version 2 has been that the distribution of +-statements, operand types and operand locality described in [1] should remain +-unchanged as much as possible. (Very few changes were necessary; their impact +-should be negligible.) Also, the order of statements should remain unchanged. +-Although I am aware of some critical remarks on the benchmark - I agree with +-several of them - and know some suggestions for improvement, I didn't want to +-change the benchmark into something different from what has become known as +-"Dhrystone"; the confusion generated by such a change would probably outweight +-the benefits. If I were to write a new benchmark program, I wouldn't give it +-the name "Dhrystone" since this denotes the program published in [1]. +-However, I do recognize the need for a larger number of representative +-programs that can be used as benchmarks; users should always be encouraged to +-use more than just one benchmark. +- +-The new versions (version 2.1 for C, Pascal and Ada) will be distributed as +-widely as possible. (Version 2.1 differs from version 2.0 distributed via the +-UNIX Network Usenet in March 1988 only in a few corrections for minor +-deficiencies found by users of version 2.0.) Readers who want to use the +-benchmark for their own measurements can obtain a copy in machine-readable +-form on floppy disk (MS-DOS or XENIX format) from the author. +- +- +-2. Overall Characteristics of Version 2 +- +-In general, version 2 follows - in the parts that are significant for +-performance measurement, i.e. within the measurement loop - the published +-(Ada) version and the C versions previously distributed. Where the versions +-distributed by Rick Richardson [2] and Reinhold Weicker have been different, +-it follows the version distributed by Reinhold Weicker. (However, the +-differences have been so small that their impact on execution time in all +-likelihood has been negligible.) The initialization and UNIX instrumentation +-part - which had been omitted in [1] - follows mostly the ideas of Rick +-Richardson [2]. However, any changes in the initialization part and in the +-printing of the result have no impact on performance measurement since they +-are outside the measaurement loop. As a concession to older compilers, names +-have been made unique within the first 8 characters for the C version. +- +-The original publication of Dhrystone did not contain any statements for time +-measurement since they are necessarily system-dependent. However, it turned +-out that it is not enough just to inclose the main procedure of Dhrystone in a +-loop and to measure the execution time. If the variables that are computed +-are not used somehow, there is the danger that the compiler considers them as +-"dead variables" and suppresses code generation for a part of the statements. +-Therefore in version 2 all variables of "main" are printed at the end of the +-program. This also permits some plausibility control for correct execution of +-the benchmark. +- +-At several places in the benchmark, code has been added, but only in branches +-that are not executed. The intention is that optimizing compilers should be +-prevented from moving code out of the measurement loop, or from removing code +-altogether. Statements that are executed have been changed in very few places +-only. In these cases, only the role of some operands has been changed, and it +-was made sure that the numbers defining the "Dhrystone distribution" +-(distribution of statements, operand types and locality) still hold as much as +-possible. Except for sophisticated optimizing compilers, execution times for +-version 2.1 should be the same as for previous versions. +- +-Because of the self-imposed limitation that the order and distribution of the +-executed statements should not be changed, there are still cases where +-optimizing compilers may not generate code for some statements. To a certain +-degree, this is unavoidable for small synthetic benchmarks. Users of the +-benchmark are advised to check code listings whether code is generated for all +-statements of Dhrystone. +- +-Contrary to the suggestion in the published paper and its realization in the +-versions previously distributed, no attempt has been made to subtract the time +-for the measurement loop overhead. (This calculation has proven difficult to +-implement in a correct way, and its omission makes the program simpler.) +-However, since the loop check is now part of the benchmark, this does have an +-impact - though a very minor one - on the distribution statistics which have +-been updated for this version. +- +- +-3. Discussion of Individual Changes +- +-In this section, all changes are described that affect the measurement loop +-and that are not just renamings of variables. All remarks refer to the C +-version; the other language versions have been updated similarly. +- +-In addition to adding the measurement loop and the printout statements, +-changes have been made at the following places: +- +-o In procedure "main", three statements have been added in the non-executed +- "then" part of the statement +- +- if (Enum_Loc == Func_1 (Ch_Index, 'C')) +- +- they are +- +- strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING"); +- Int_2_Loc = Run_Index; +- Int_Glob = Run_Index; +- +- The string assignment prevents movement of the preceding assignment to +- Str_2_Loc (5'th statement of "main") out of the measurement loop (This +- probably will not happen for the C version, but it did happen with another +- language and compiler.) The assignment to Int_2_Loc prevents value +- propagation for Int_2_Loc, and the assignment to Int_Glob makes the value of +- Int_Glob possibly dependent from the value of Run_Index. +- +-o In the three arithmetic computations at the end of the measurement loop in +- "main ", the role of some variables has been exchanged, to prevent the +- division from just cancelling out the multiplication as it was in [1]. A +- very smart compiler might have recognized this and suppressed code +- generation for the division. +- +-o For Proc_2, no code has been changed, but the values of the actual parameter +- have changed due to changes in "main". +- +-o In Proc_4, the second assignment has been changed from +- +- Bool_Loc = Bool_Loc | Bool_Glob; +- +- to +- +- Bool_Glob = Bool_Loc | Bool_Glob; +- +- It now assigns a value to a global variable instead of a local variable +- (Bool_Loc); Bool_Loc would be a "dead variable" which is not used +- afterwards. +- +-o In Func_1, the statement +- +- Ch_1_Glob = Ch_1_Loc; +- +- was added in the non-executed "else" part of the "if" statement, to prevent +- the suppression of code generation for the assignment to Ch_1_Loc. +- +-o In Func_2, the second character comparison statement has been changed to +- +- if (Ch_Loc == 'R') +- +- ('R' instead of 'X') because a comparison with 'X' is implied in the +- preceding "if" statement. +- +- Also in Func_2, the statement +- +- Int_Glob = Int_Loc; +- +- has been added in the non-executed part of the last "if" statement, in order +- to prevent Int_Loc from becoming a dead variable. +- +-o In Func_3, a non-executed "else" part has been added to the "if" statement. +- While the program would not be incorrect without this "else" part, it is +- considered bad programming practice if a function can be left without a +- return value. +- +- To compensate for this change, the (non-executed) "else" part in the "if" +- statement of Proc_3 was removed. +- +-The distribution statistics have been changed only by the addition of the +-measurement loop iteration (1 additional statement, 4 additional local integer +-operands) and by the change in Proc_4 (one operand changed from local to +-global). The distribution statistics in the comment headers have been updated +-accordingly. +- +- +-4. String Operations +- +-The string operations (string assignment and string comparison) have not been +-changed, to keep the program consistent with the original version. +- +-There has been some concern that the string operations are over-represented in +-the program, and that execution time is dominated by these operations. This +-was true in particular when optimizing compilers removed too much code in the +-main part of the program, this should have been mitigated in version 2. +- +-It should be noted that this is a language-dependent issue: Dhrystone was +-first published in Ada, and with Ada or Pascal semantics, the time spent in +-the string operations is, at least in all implementations known to me, +-considerably smaller. In Ada and Pascal, assignment and comparison of strings +-are operators defined in the language, and the upper bounds of the strings +-occuring in Dhrystone are part of the type information known at compilation +-time. The compilers can therefore generate efficient inline code. In C, +-string assignemt and comparisons are not part of the language, so the string +-operations must be expressed in terms of the C library functions "strcpy" and +-"strcmp". (ANSI C allows an implementation to use inline code for these +-functions.) In addition to the overhead caused by additional function calls, +-these functions are defined for null-terminated strings where the length of +-the strings is not known at compilation time; the function has to check every +-byte for the termination condition (the null byte). +- +-Obviously, a C library which includes efficiently coded "strcpy" and "strcmp" +-functions helps to obtain good Dhrystone results. However, I don't think that +-this is unfair since string functions do occur quite frequently in real +-programs (editors, command interpreters, etc.). If the strings functions are +-implemented efficiently, this helps real programs as well as benchmark +-programs. +- +-I admit that the string comparison in Dhrystone terminates later (after +-scanning 20 characters) than most string comparisons in real programs. For +-consistency with the original benchmark, I didn't change the program despite +-this weakness. +- +- +-5. Intended Use of Dhrystone +- +-When Dhrystone is used, the following "ground rules" apply: +- +-o Separate compilation (Ada and C versions) +- +- As mentioned in [1], Dhrystone was written to reflect actual programming +- practice in systems programming. The division into several compilation +- units (5 in the Ada version, 2 in the C version) is intended, as is the +- distribution of inter-module and intra-module subprogram calls. Although on +- many systems there will be no difference in execution time to a Dhrystone +- version where all compilation units are merged into one file, the rule is +- that separate compilation should be used. The intention is that real +- programming practice, where programs consist of several independently +- compiled units, should be reflected. This also has implies that the +- compiler, while compiling one unit, has no information about the use of +- variables, register allocation etc. occuring in other compilation units. +- Although in real life compilation units will probably be larger, the +- intention is that these effects of separate compilation are modeled in +- Dhrystone. +- +- A few language systems have post-linkage optimization available (e.g., final +- register allocation is performed after linkage). This is a borderline case: +- Post-linkage optimization involves additional program preparation time +- (although not as much as compilation in one unit) which may prevent its +- general use in practical programming. I think that since it defeats the +- intentions given above, it should not be used for Dhrystone. +- +- Unfortunately, ISO/ANSI Pascal does not contain language features for +- separate compilation. Although most commercial Pascal compilers provide +- separate compilation in some way, we cannot use it for Dhrystone since such +- a version would not be portable. Therefore, no attempt has been made to +- provide a Pascal version with several compilation units. +- +-o No procedure merging +- +- Although Dhrystone contains some very short procedures where execution would +- benefit from procedure merging (inlining, macro expansion of procedures), +- procedure merging is not to be used. The reason is that the percentage of +- procedure and function calls is part of the "Dhrystone distribution" of +- statements contained in [1]. This restriction does not hold for the string +- functions of the C version since ANSI C allows an implementation to use +- inline code for these functions. +- +-o Other optimizations are allowed, but they should be indicated +- +- It is often hard to draw an exact line between "normal code generation" and +- "optimization" in compilers: Some compilers perform operations by default +- that are invoked in other compilers only when optimization is explicitly +- requested. Also, we cannot avoid that in benchmarking people try to achieve +- results that look as good as possible. Therefore, optimizations performed +- by compilers - other than those listed above - are not forbidden when +- Dhrystone execution times are measured. Dhrystone is not intended to be +- non-optimizable but is intended to be similarly optimizable as normal +- programs. For example, there are several places in Dhrystone where +- performance benefits from optimizations like common subexpression +- elimination, value propagation etc., but normal programs usually also +- benefit from these optimizations. Therefore, no effort was made to +- artificially prevent such optimizations. However, measurement reports +- should indicate which compiler optimization levels have been used, and +- reporting results with different levels of compiler optimization for the +- same hardware is encouraged. +- +-o Default results are those without "register" declarations (C version) +- +- When Dhrystone results are quoted without additional qualification, they +- should be understood as results obtained without use of the "register" +- attribute. Good compilers should be able to make good use of registers even +- without explicit register declarations ([3], p. 193). +- +-Of course, for experimental purposes, post-linkage optimization, procedure +-merging and/or compilation in one unit can be done to determine their effects. +-However, Dhrystone numbers obtained under these conditions should be +-explicitly marked as such; "normal" Dhrystone results should be understood as +-results obtained following the ground rules listed above. +- +-In any case, for serious performance evaluation, users are advised to ask for +-code listings and to check them carefully. In this way, when results for +-different systems are compared, the reader can get a feeling how much +-performance difference is due to compiler optimization and how much is due to +-hardware speed. +- +- +-6. Acknowledgements +- +-The C version 2.1 of Dhrystone has been developed in cooperation with Rick +-Richardson (Tinton Falls, NJ), it incorporates many ideas from the "Version +-1.1" distributed previously by him over the UNIX network Usenet. Through his +-activity with Usenet, Rick Richardson has made a very valuable contribution to +-the dissemination of the benchmark. I also thank Chaim Benedelac (National +-Semiconductor), David Ditzel (SUN), Earl Killian and John Mashey (MIPS), Alan +-Smith and Rafael Saavedra-Barrera (UC at Berkeley) for their help with +-comments on earlier versions of the benchmark. +- +- +-7. Bibliography +- +-[1] +- Reinhold P. Weicker: Dhrystone: A Synthetic Systems Programming Benchmark. +- Communications of the ACM 27, 10 (Oct. 1984), 1013-1030 +- +-[2] +- Rick Richardson: Dhrystone 1.1 Benchmark Summary (and Program Text) +- Informal Distribution via "Usenet", Last Version Known to me: Sept. 21, +- 1987 +- +-[3] +- Brian W. Kernighan and Dennis M. Ritchie: The C Programming Language. +- Prentice-Hall, Englewood Cliffs (NJ) 1978 +- +//GO.SYSIN DD RATIONALE +echo README_C 1>&2 +sed >README_C <<'//GO.SYSIN DD README_C' 's/^-//' +-This "shar" file contains the documentation for the +-electronic mail distribution of the Dhrystone benchmark (C version 2.1); +-a companion "shar" file contains the source code. +-(Because of mail length restrictions for some mailers, I have +-split the distribution in two parts.) +- +-For versions in other languages, see the other "shar" files. +- +-Files containing the C version (*.h: Header File, *.c: C Modules) +- +- dhry.h +- dhry_1.c +- dhry_2.c +- +-The file RATIONALE contains the article +- +- "Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules" +- +-which has been published, together with the C source code (Version 2.0), +-in SIGPLAN Notices vol. 23, no. 8 (Aug. 1988), pp. 49-62. +-This article explains all changes that have been made for Version 2, +-compared with the version of the original publication +-in Communications of the ACM vol. 27, no. 10 (Oct. 1984), pp. 1013-1030. +-It also contains "ground rules" for benchmarking with Dhrystone +-which should be followed by everyone who uses the program and publishes +-Dhrystone results. +- +-Compared with the Version 2.0 published in SIGPLAN Notices, Version 2.1 +-contains a few corrections that have been made after Version 2.0 was +-distriobuted over the UNIX network Usenet. These small differences between +-Version 2.0 and 2.1 should not affect execution time measurements. +-For those who want to compare the exact contents of both versions, +-the file "dhry_c.dif" contains the differences between the two versions, +-as generated by a file comparison of the corresponding files with the +-UNIX utility "diff". +- +-The file VARIATIONS contains the article +- +- "Understanding Variations in Dhrystone Performance" +- +-which has been published in Microprocessor Report, May 1989 +-(Editor: M. Slater), pp. 16-17. It describes the points that users +-should know if C Dhrystone results are compared. +- +-Recipients of this shar file who perform measurements are asked +-to send measurement results to the author and/or to Rick Richardson. +-Rick Richardson publishes regularly Dhrystone results on the UNIX network +-Usenet. For submissions of results to him (preferably by electronic mail, +-see address in the program header), he has provided a form which is contained +-in the file "submit.frm". +- +- +-The following files are contained in other "shar" files: +- +-Files containing the Ada version (*.s: Specifications, *.b: Bodies): +- +- d_global.s +- d_main.b +- d_pack_1.b +- d_pack_1.s +- d_pack_2.b +- d_pack_2.s +- +-File containing the Pascal version: +- +- dhry.p +- +- +-February 22, 1990 +- +- Reinhold P. Weicker +- Siemens AG, AUT E 51 +- Postfach 3220 +- D-8520 Erlangen +- Germany (West) +- +- Phone: [xxx-49]-9131-7-20330 (8-17 Central European Time) +- UUCP: ..!mcsun!unido!estevax!weicker +//GO.SYSIN DD README_C +echo VARIATIONS 1>&2 +sed >VARIATIONS <<'//GO.SYSIN DD VARIATIONS' 's/^-//' +- +- Understanding Variations in Dhrystone Performance +- +- +- +- By Reinhold P. Weicker, Siemens AG, AUT E 51, Erlangen +- +- +- +- April 1989 +- +- +- This article has appeared in: +- +- +- Microprocessor Report, May 1989 (Editor: M. Slater), pp. 16-17 +- +- +- +- +-Microprocessor manufacturers tend to credit all the performance measured by +-benchmarks to the speed of their processors, they often don't even mention the +-programming language and compiler used. In their detailed documents, usually +-called "performance brief" or "performance report," they usually do give more +-details. However, these details are often lost in the press releases and other +-marketing statements. For serious performance evaluation, it is necessary to +-study the code generated by the various compilers. +- +-Dhrystone was originally published in Ada (Communications of the ACM, Oct. +-1984). However, since good Ada compilers were rare at this time and, together +-with UNIX, C became more and more popular, the C version of Dhrystone is the +-one now mainly used in industry. There are "official" versions 2.1 for Ada, +-Pascal, and C, which are as close together as the languages' semantic +-differences permit. +- +-Dhrystone contains two statements where the programming language and its +-translation play a major part in the execution time measured by the benchmark: +- +- o String assignment (in procedure Proc_0 / main) +- o String comparison (in function Func_2) +- +-In Ada and Pascal, strings are arrays of characters where the length of the +-string is part of the type information known at compile time. In C, strings +-are also arrays of characters, but there are no operators defined in the +-language for assignment and comparison of strings. Instead, functions +-"strcpy" and "strcmp" are used. These functions are defined for strings of +-arbitrary length, and make use of the fact that strings in C have to end with +-a terminating null byte. For general-purpose calls to these functions, the +-implementor can assume nothing about the length and the alignment of the +-strings involved. +- +-The C version of Dhrystone spends a relatively large amount of time in these +-two functions. Some time ago, I made measurements on a VAX 11/785 with the +-Berkeley UNIX (4.2) compilers (often-used compilers, but certainly not the +-most advanced). In the C version, 23% of the time was spent in the string +-functions; in the Pascal version, only 10%. On good RISC machines (where less +-time is spent in the procedure calling sequence than on a VAX) and with better +-optimizing compilers, the percentage is higher; MIPS has reported 34% for an +-R3000. Because of this effect, Pascal and Ada Dhrystone results are usually +-better than C results (except when the optimization quality of the C compiler +-is considerably better than that of the other compilers). +- +-Several people have noted that the string operations are over-represented in +-Dhrystone, mainly because the strings occurring in Dhrystone are longer than +-average strings. I admit that this is true, and have said so in my SIGPLAN +-Notices paper (Aug. 1988); however, I didn't want to generate confusion by +-changing the string lengths from version 1 to version 2. +- +-Even if they are somewhat over-represented in Dhrystone, string operations are +-frequent enough that it makes sense to implement them in the most efficient +-way possible, not only for benchmarking purposes. This means that they can +-and should be written in assembly language code. ANSI C also explicitly allows +-the strings functions to be implemented as macros, i.e. by inline code. +- +-There is also a third way to speed up the "strcpy" statement in Dhrystone: For +-this particular "strcpy" statement, the source of the assignment is a string +-constant. Therefore, in contrast to calls to "strcpy" in the general case, the +-compiler knows the length and alignment of the strings involved at compile +-time and can generate code in the same efficient way as a Pascal compiler +-(word instructions instead of byte instructions). +- +-This is not allowed in the case of the "strcmp" call: Here, the addresses are +-formal procedure parameters, and no assumptions can be made about the length +-or alignment of the strings. Any such assumptions would indicate an incorrect +-implementation. They might work for Dhrystone, where the strings are in fact +-word-aligned with typical compilers, but other programs would deliver +-incorrect results. +- +-So, for an apple-to-apple comparison between processors, and not between +-several possible (legal or illegal) degrees of compiler optimization, one +-should check that the systems are comparable with respect to the following +-three points: +- +- (1) String functions in assembly language vs. in C +- +- Frequently used functions such as the string functions can and should be +- written in assembly language, and all serious C language systems known +- to me do this. (I list this point for completeness only.) Note that +- processors with an instruction that checks a word for a null byte (such +- as AMD's 29000 and Intel's 80960) have an advantage here. (This +- advantage decreases relatively if optimization (3) is applied.) Due to +- the length of the strings involved in Dhrystone, this advantage may be +- considered too high in perspective, but it is certainly legal to use +- such instructions - after all, these situations are what they were +- invented for. +- +- (2) String function code inline vs. as library functions. +- +- ANSI C has created a new situation, compared with the older +- Kernighan/Ritchie C. In the original C, the definition of the string +- function was not part of the language. Now it is, and inlining is +- explicitly allowed. I probably should have stated more clearly in my +- SIGPLAN Notices paper that the rule "No procedure inlining for +- Dhrystone" referred to the user level procedures only and not to the +- library routines. +- +- (3) Fixed-length and alignment assumptions for the strings +- +- Compilers should be allowed to optimize in these cases if (and only if) +- it is safe to do so. For Dhrystone, this is the "strcpy" statement, but +- not the "strcmp" statement (unless, of course, the "strcmp" code +- explicitly checks the alignment at execution time and branches +- accordingly). A "Dhrystone switch" for the compiler that causes the +- generation of code that may not work under certain circumstances is +- certainly inappropriate for comparisons. It has been reported in Usenet +- that some C compilers provide such a compiler option; since I don't have +- access to all C compilers involved, I cannot verify this. +- +- If the fixed-length and word-alignment assumption can be used, a wide +- bus that permits fast multi-word load instructions certainly does help; +- however, this fact by itself should not make a really big difference. +- +-A check of these points - something that is necessary for a thorough +-evaluation and comparison of the Dhrystone performance claims - requires +-object code listings as well as listings for the string functions (strcpy, +-strcmp) that are possibly called by the program. +- +-I don't pretend that Dhrystone is a perfect tool to measure the integer +-performance of microprocessors. The more it is used and discussed, the more I +-myself learn about aspects that I hadn't noticed yet when I wrote the program. +-And of course, the very success of a benchmark program is a danger in that +-people may tune their compilers and/or hardware to it, and with this action +-make it less useful. +- +-Whetstone and Linpack have their critical points also: The Whetstone rating +-depends heavily on the speed of the mathematical functions (sine, sqrt, ...), +-and Linpack is sensitive to data alignment for some cache configurations. +- +-Introduction of a standard set of public domain benchmark software (something +-the SPEC effort attempts) is certainly a worthwhile thing. In the meantime, +-people will continue to use whatever is available and widely distributed, and +-Dhrystone ratings are probably still better than MIPS ratings if these are - +-as often in industry - based on no reproducible derivation. However, any +-serious performance evaluation requires more than just a comparison of raw +-numbers; one has to make sure that the numbers have been obtained in a +-comparable way. +- +//GO.SYSIN DD VARIATIONS +echo dhry.h 1>&2 +sed >dhry.h <<'//GO.SYSIN DD dhry.h' 's/^-//' +-/* +- **************************************************************************** +- * +- * "DHRYSTONE" Benchmark Program +- * ----------------------------- +- * +- * Version: C, Version 2.1 +- * +- * File: dhry.h (part 1 of 3) +- * +- * Date: May 25, 1988 +- * +- * Author: Reinhold P. Weicker +- * Siemens AG, AUT E 51 +- * Postfach 3220 +- * 8520 Erlangen +- * Germany (West) +- * Phone: [+49]-9131-7-20330 +- * (8-17 Central European Time) +- * Usenet: ..!mcsun!unido!estevax!weicker +- * +- * Original Version (in Ada) published in +- * "Communications of the ACM" vol. 27., no. 10 (Oct. 1984), +- * pp. 1013 - 1030, together with the statistics +- * on which the distribution of statements etc. is based. +- * +- * In this C version, the following C library functions are used: +- * - strcpy, strcmp (inside the measurement loop) +- * - printf, scanf (outside the measurement loop) +- * In addition, Berkeley UNIX system calls "times ()" or "time ()" +- * are used for execution time measurement. For measurements +- * on other systems, these calls have to be changed. +- * +- * Collection of Results: +- * Reinhold Weicker (address see above) and +- * +- * Rick Richardson +- * PC Research. Inc. +- * 94 Apple Orchard Drive +- * Tinton Falls, NJ 07724 +- * Phone: (201) 389-8963 (9-17 EST) +- * Usenet: ...!uunet!pcrat!rick +- * +- * Please send results to Rick Richardson and/or Reinhold Weicker. +- * Complete information should be given on hardware and software used. +- * Hardware information includes: Machine type, CPU, type and size +- * of caches; for microprocessors: clock frequency, memory speed +- * (number of wait states). +- * Software information includes: Compiler (and runtime library) +- * manufacturer and version, compilation switches, OS version. +- * The Operating System version may give an indication about the +- * compiler; Dhrystone itself performs no OS calls in the measurement loop. +- * +- * The complete output generated by the program should be mailed +- * such that at least some checks for correctness can be made. +- * +- *************************************************************************** +- * +- * History: This version C/2.1 has been made for two reasons: +- * +- * 1) There is an obvious need for a common C version of +- * Dhrystone, since C is at present the most popular system +- * programming language for the class of processors +- * (microcomputers, minicomputers) where Dhrystone is used most. +- * There should be, as far as possible, only one C version of +- * Dhrystone such that results can be compared without +- * restrictions. In the past, the C versions distributed +- * by Rick Richardson (Version 1.1) and by Reinhold Weicker +- * had small (though not significant) differences. +- * +- * 2) As far as it is possible without changes to the Dhrystone +- * statistics, optimizing compilers should be prevented from +- * removing significant statements. +- * +- * This C version has been developed in cooperation with +- * Rick Richardson (Tinton Falls, NJ), it incorporates many +- * ideas from the "Version 1.1" distributed previously by +- * him over the UNIX network Usenet. +- * I also thank Chaim Benedelac (National Semiconductor), +- * David Ditzel (SUN), Earl Killian and John Mashey (MIPS), +- * Alan Smith and Rafael Saavedra-Barrera (UC at Berkeley) +- * for their help with comments on earlier versions of the +- * benchmark. +- * +- * Changes: In the initialization part, this version follows mostly +- * Rick Richardson's version distributed via Usenet, not the +- * version distributed earlier via floppy disk by Reinhold Weicker. +- * As a concession to older compilers, names have been made +- * unique within the first 8 characters. +- * Inside the measurement loop, this version follows the +- * version previously distributed by Reinhold Weicker. +- * +- * At several places in the benchmark, code has been added, +- * but within the measurement loop only in branches that +- * are not executed. The intention is that optimizing compilers +- * should be prevented from moving code out of the measurement +- * loop, or from removing code altogether. Since the statements +- * that are executed within the measurement loop have NOT been +- * changed, the numbers defining the "Dhrystone distribution" +- * (distribution of statements, operand types and locality) +- * still hold. Except for sophisticated optimizing compilers, +- * execution times for this version should be the same as +- * for previous versions. +- * +- * Since it has proven difficult to subtract the time for the +- * measurement loop overhead in a correct way, the loop check +- * has been made a part of the benchmark. This does have +- * an impact - though a very minor one - on the distribution +- * statistics which have been updated for this version. +- * +- * All changes within the measurement loop are described +- * and discussed in the companion paper "Rationale for +- * Dhrystone version 2". +- * +- * Because of the self-imposed limitation that the order and +- * distribution of the executed statements should not be +- * changed, there are still cases where optimizing compilers +- * may not generate code for some statements. To a certain +- * degree, this is unavoidable for small synthetic benchmarks. +- * Users of the benchmark are advised to check code listings +- * whether code is generated for all statements of Dhrystone. +- * +- * Version 2.1 is identical to version 2.0 distributed via +- * the UNIX network Usenet in March 1988 except that it corrects +- * some minor deficiencies that were found by users of version 2.0. +- * The only change within the measurement loop is that a +- * non-executed "else" part was added to the "if" statement in +- * Func_3, and a non-executed "else" part removed from Proc_3. +- * +- *************************************************************************** +- * +- * Defines: The following "Defines" are possible: +- * -DREG=register (default: Not defined) +- * As an approximation to what an average C programmer +- * might do, the "register" storage class is applied +- * (if enabled by -DREG=register) +- * - for local variables, if they are used (dynamically) +- * five or more times +- * - for parameters if they are used (dynamically) +- * six or more times +- * Note that an optimal "register" strategy is +- * compiler-dependent, and that "register" declarations +- * do not necessarily lead to faster execution. +- * -DNOSTRUCTASSIGN (default: Not defined) +- * Define if the C compiler does not support +- * assignment of structures. +- * -DNOENUMS (default: Not defined) +- * Define if the C compiler does not support +- * enumeration types. +- * -DTIMES (default) +- * -DTIME +- * The "times" function of UNIX (returning process times) +- * or the "time" function (returning wallclock time) +- * is used for measurement. +- * For single user machines, "time ()" is adequate. For +- * multi-user machines where you cannot get single-user +- * access, use the "times ()" function. If you have +- * neither, use a stopwatch in the dead of night. +- * "printf"s are provided marking the points "Start Timer" +- * and "Stop Timer". DO NOT use the UNIX "time(1)" +- * command, as this will measure the total time to +- * run this program, which will (erroneously) include +- * the time to allocate storage (malloc) and to perform +- * the initialization. +- * -DHZ=nnn +- * In Berkeley UNIX, the function "times" returns process +- * time in 1/HZ seconds, with HZ = 60 for most systems. +- * CHECK YOUR SYSTEM DESCRIPTION BEFORE YOU JUST APPLY +- * A VALUE. +- * +- *************************************************************************** +- * +- * Compilation model and measurement (IMPORTANT): +- * +- * This C version of Dhrystone consists of three files: +- * - dhry.h (this file, containing global definitions and comments) +- * - dhry_1.c (containing the code corresponding to Ada package Pack_1) +- * - dhry_2.c (containing the code corresponding to Ada package Pack_2) +- * +- * The following "ground rules" apply for measurements: +- * - Separate compilation +- * - No procedure merging +- * - Otherwise, compiler optimizations are allowed but should be indicated +- * - Default results are those without register declarations +- * See the companion paper "Rationale for Dhrystone Version 2" for a more +- * detailed discussion of these ground rules. +- * +- * For 16-Bit processors (e.g. 80186, 80286), times for all compilation +- * models ("small", "medium", "large" etc.) should be given if possible, +- * together with a definition of these models for the compiler system used. +- * +- ************************************************************************** +- * +- * Dhrystone (C version) statistics: +- * +- * [Comment from the first distribution, updated for version 2. +- * Note that because of language differences, the numbers are slightly +- * different from the Ada version.] +- * +- * The following program contains statements of a high level programming +- * language (here: C) in a distribution considered representative: +- * +- * assignments 52 (51.0 %) +- * control statements 33 (32.4 %) +- * procedure, function calls 17 (16.7 %) +- * +- * 103 statements are dynamically executed. The program is balanced with +- * respect to the three aspects: +- * +- * - statement type +- * - operand type +- * - operand locality +- * operand global, local, parameter, or constant. +- * +- * The combination of these three aspects is balanced only approximately. +- * +- * 1. Statement Type: +- * ----------------- number +- * +- * V1 = V2 9 +- * (incl. V1 = F(..) +- * V = Constant 12 +- * Assignment, 7 +- * with array element +- * Assignment, 6 +- * with record component +- * -- +- * 34 34 +- * +- * X = Y +|-|"&&"|"|" Z 5 +- * X = Y +|-|"==" Constant 6 +- * X = X +|- 1 3 +- * X = Y *|/ Z 2 +- * X = Expression, 1 +- * two operators +- * X = Expression, 1 +- * three operators +- * -- +- * 18 18 +- * +- * if .... 14 +- * with "else" 7 +- * without "else" 7 +- * executed 3 +- * not executed 4 +- * for ... 7 | counted every time +- * while ... 4 | the loop condition +- * do ... while 1 | is evaluated +- * switch ... 1 +- * break 1 +- * declaration with 1 +- * initialization +- * -- +- * 34 34 +- * +- * P (...) procedure call 11 +- * user procedure 10 +- * library procedure 1 +- * X = F (...) +- * function call 6 +- * user function 5 +- * library function 1 +- * -- +- * 17 17 +- * --- +- * 103 +- * +- * The average number of parameters in procedure or function calls +- * is 1.82 (not counting the function values as implicit parameters). +- * +- * +- * 2. Operators +- * ------------ +- * number approximate +- * percentage +- * +- * Arithmetic 32 50.8 +- * +- * + 21 33.3 +- * - 7 11.1 +- * * 3 4.8 +- * / (int div) 1 1.6 +- * +- * Comparison 27 42.8 +- * +- * == 9 14.3 +- * /= 4 6.3 +- * > 1 1.6 +- * < 3 4.8 +- * >= 1 1.6 +- * <= 9 14.3 +- * +- * Logic 4 6.3 +- * +- * && (AND-THEN) 1 1.6 +- * | (OR) 1 1.6 +- * ! (NOT) 2 3.2 +- * +- * -- ----- +- * 63 100.1 +- * +- * +- * 3. Operand Type (counted once per operand reference): +- * --------------- +- * number approximate +- * percentage +- * +- * Integer 175 72.3 % +- * Character 45 18.6 % +- * Pointer 12 5.0 % +- * String30 6 2.5 % +- * Array 2 0.8 % +- * Record 2 0.8 % +- * --- ------- +- * 242 100.0 % +- * +- * When there is an access path leading to the final operand (e.g. a record +- * component), only the final data type on the access path is counted. +- * +- * +- * 4. Operand Locality: +- * ------------------- +- * number approximate +- * percentage +- * +- * local variable 114 47.1 % +- * global variable 22 9.1 % +- * parameter 45 18.6 % +- * value 23 9.5 % +- * reference 22 9.1 % +- * function result 6 2.5 % +- * constant 55 22.7 % +- * --- ------- +- * 242 100.0 % +- * +- * +- * The program does not compute anything meaningful, but it is syntactically +- * and semantically correct. All variables have a value assigned to them +- * before they are used as a source operand. +- * +- * There has been no explicit effort to account for the effects of a +- * cache, or to balance the use of long or short displacements for code or +- * data. +- * +- *************************************************************************** +- */ +- +-/* Compiler and system dependent definitions: */ +- +-#ifndef TIME +-#define TIMES +-#endif +- /* Use times(2) time function unless */ +- /* explicitly defined otherwise */ +- +-#ifdef TIMES +-#include <sys/types.h> +-#include <sys/times.h> +- /* for "times" */ +-#endif +- +-#define Mic_secs_Per_Second 1000000.0 +- /* Berkeley UNIX C returns process times in seconds/HZ */ +- +-#ifdef NOSTRUCTASSIGN +-#define structassign(d, s) memcpy(&(d), &(s), sizeof(d)) +-#else +-#define structassign(d, s) d = s +-#endif +- +-#ifdef NOENUM +-#define Ident_1 0 +-#define Ident_2 1 +-#define Ident_3 2 +-#define Ident_4 3 +-#define Ident_5 4 +- typedef int Enumeration; +-#else +- typedef enum {Ident_1, Ident_2, Ident_3, Ident_4, Ident_5} +- Enumeration; +-#endif +- /* for boolean and enumeration types in Ada, Pascal */ +- +-/* General definitions: */ +- +-#include <stdio.h> +- /* for strcpy, strcmp */ +- +-#define Null 0 +- /* Value of a Null pointer */ +-#define true 1 +-#define false 0 +- +-typedef int One_Thirty; +-typedef int One_Fifty; +-typedef char Capital_Letter; +-typedef int Boolean; +-typedef char Str_30 [31]; +-typedef int Arr_1_Dim [50]; +-typedef int Arr_2_Dim [50] [50]; +- +-typedef struct record +- { +- struct record *Ptr_Comp; +- Enumeration Discr; +- union { +- struct { +- Enumeration Enum_Comp; +- int Int_Comp; +- char Str_Comp [31]; +- } var_1; +- struct { +- Enumeration E_Comp_2; +- char Str_2_Comp [31]; +- } var_2; +- struct { +- char Ch_1_Comp; +- char Ch_2_Comp; +- } var_3; +- } variant; +- } Rec_Type, *Rec_Pointer; +- +- +//GO.SYSIN DD dhry.h +echo dhry_1.c 1>&2 +sed >dhry_1.c <<'//GO.SYSIN DD dhry_1.c' 's/^-//' +-/* +- **************************************************************************** +- * +- * "DHRYSTONE" Benchmark Program +- * ----------------------------- +- * +- * Version: C, Version 2.1 +- * +- * File: dhry_1.c (part 2 of 3) +- * +- * Date: May 25, 1988 +- * +- * Author: Reinhold P. Weicker +- * +- **************************************************************************** +- */ +- +-#include "dhry.h" +- +-/* Global Variables: */ +- +-Rec_Pointer Ptr_Glob, +- Next_Ptr_Glob; +-int Int_Glob; +-Boolean Bool_Glob; +-char Ch_1_Glob, +- Ch_2_Glob; +-int Arr_1_Glob [50]; +-int Arr_2_Glob [50] [50]; +- +-extern char *malloc (); +-Enumeration Func_1 (); +- /* forward declaration necessary since Enumeration may not simply be int */ +- +-#ifndef REG +- Boolean Reg = false; +-#define REG +- /* REG becomes defined as empty */ +- /* i.e. no register variables */ +-#else +- Boolean Reg = true; +-#endif +- +-/* variables for time measurement: */ +- +-#ifdef TIMES +-struct tms time_info; +-extern int times (); +- /* see library function "times" */ +-#define Too_Small_Time 120 +- /* Measurements should last at least about 2 seconds */ +-#endif +-#ifdef TIME +-extern long time(); +- /* see library function "time" */ +-#define Too_Small_Time 2 +- /* Measurements should last at least 2 seconds */ +-#endif +- +-long Begin_Time, +- End_Time, +- User_Time; +-float Microseconds, +- Dhrystones_Per_Second; +- +-/* end of variables for time measurement */ +- +- +-main () +-/*****/ +- +- /* main program, corresponds to procedures */ +- /* Main and Proc_0 in the Ada version */ +-{ +- One_Fifty Int_1_Loc; +- REG One_Fifty Int_2_Loc; +- One_Fifty Int_3_Loc; +- REG char Ch_Index; +- Enumeration Enum_Loc; +- Str_30 Str_1_Loc; +- Str_30 Str_2_Loc; +- REG int Run_Index; +- REG int Number_Of_Runs; +- +- /* Initializations */ +- +- Next_Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type)); +- Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type)); +- +- Ptr_Glob->Ptr_Comp = Next_Ptr_Glob; +- Ptr_Glob->Discr = Ident_1; +- Ptr_Glob->variant.var_1.Enum_Comp = Ident_3; +- Ptr_Glob->variant.var_1.Int_Comp = 40; +- strcpy (Ptr_Glob->variant.var_1.Str_Comp, +- "DHRYSTONE PROGRAM, SOME STRING"); +- strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING"); +- +- Arr_2_Glob [8][7] = 10; +- /* Was missing in published program. Without this statement, */ +- /* Arr_2_Glob [8][7] would have an undefined value. */ +- /* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */ +- /* overflow may occur for this array element. */ +- +- printf ("\n"); +- printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n"); +- printf ("\n"); +- if (Reg) +- { +- printf ("Program compiled with 'register' attribute\n"); +- printf ("\n"); +- } +- else +- { +- printf ("Program compiled without 'register' attribute\n"); +- printf ("\n"); +- } +- printf ("Please give the number of runs through the benchmark: "); +- { +- int n; +- scanf ("%d", &n); +- Number_Of_Runs = n; +- } +- printf ("\n"); +- +- printf ("Execution starts, %d runs through Dhrystone\n", Number_Of_Runs); +- +- /***************/ +- /* Start timer */ +- /***************/ +- +-#ifdef TIMES +- times (&time_info); +- Begin_Time = (long) time_info.tms_utime; +-#endif +-#ifdef TIME +- Begin_Time = time ( (long *) 0); +-#endif +- +- for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index) +- { +- +- Proc_5(); +- Proc_4(); +- /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */ +- Int_1_Loc = 2; +- Int_2_Loc = 3; +- strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING"); +- Enum_Loc = Ident_2; +- Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc); +- /* Bool_Glob == 1 */ +- while (Int_1_Loc < Int_2_Loc) /* loop body executed once */ +- { +- Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc; +- /* Int_3_Loc == 7 */ +- Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc); +- /* Int_3_Loc == 7 */ +- Int_1_Loc += 1; +- } /* while */ +- /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */ +- Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc); +- /* Int_Glob == 5 */ +- Proc_1 (Ptr_Glob); +- for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index) +- /* loop body executed twice */ +- { +- if (Enum_Loc == Func_1 (Ch_Index, 'C')) +- /* then, not executed */ +- { +- Proc_6 (Ident_1, &Enum_Loc); +- strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING"); +- Int_2_Loc = Run_Index; +- Int_Glob = Run_Index; +- } +- } +- /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */ +- Int_2_Loc = Int_2_Loc * Int_1_Loc; +- Int_1_Loc = Int_2_Loc / Int_3_Loc; +- Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc; +- /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */ +- Proc_2 (&Int_1_Loc); +- /* Int_1_Loc == 5 */ +- +- } /* loop "for Run_Index" */ +- +- /**************/ +- /* Stop timer */ +- /**************/ +- +-#ifdef TIMES +- times (&time_info); +- End_Time = (long) time_info.tms_utime; +-#endif +-#ifdef TIME +- End_Time = time ( (long *) 0); +-#endif +- +- printf ("Execution ends\n"); +- printf ("\n"); +- printf ("Final values of the variables used in the benchmark:\n"); +- printf ("\n"); +- printf ("Int_Glob: %d\n", Int_Glob); +- printf (" should be: %d\n", 5); +- printf ("Bool_Glob: %d\n", Bool_Glob); +- printf (" should be: %d\n", 1); +- printf ("Ch_1_Glob: %c\n", Ch_1_Glob); +- printf (" should be: %c\n", 'A'); +- printf ("Ch_2_Glob: %c\n", Ch_2_Glob); +- printf (" should be: %c\n", 'B'); +- printf ("Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]); +- printf (" should be: %d\n", 7); +- printf ("Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]); +- printf (" should be: Number_Of_Runs + 10\n"); +- printf ("Ptr_Glob->\n"); +- printf (" Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp); +- printf (" should be: (implementation-dependent)\n"); +- printf (" Discr: %d\n", Ptr_Glob->Discr); +- printf (" should be: %d\n", 0); +- printf (" Enum_Comp: %d\n", Ptr_Glob->variant.var_1.Enum_Comp); +- printf (" should be: %d\n", 2); +- printf (" Int_Comp: %d\n", Ptr_Glob->variant.var_1.Int_Comp); +- printf (" should be: %d\n", 17); +- printf (" Str_Comp: %s\n", Ptr_Glob->variant.var_1.Str_Comp); +- printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n"); +- printf ("Next_Ptr_Glob->\n"); +- printf (" Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp); +- printf (" should be: (implementation-dependent), same as above\n"); +- printf (" Discr: %d\n", Next_Ptr_Glob->Discr); +- printf (" should be: %d\n", 0); +- printf (" Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp); +- printf (" should be: %d\n", 1); +- printf (" Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp); +- printf (" should be: %d\n", 18); +- printf (" Str_Comp: %s\n", +- Next_Ptr_Glob->variant.var_1.Str_Comp); +- printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n"); +- printf ("Int_1_Loc: %d\n", Int_1_Loc); +- printf (" should be: %d\n", 5); +- printf ("Int_2_Loc: %d\n", Int_2_Loc); +- printf (" should be: %d\n", 13); +- printf ("Int_3_Loc: %d\n", Int_3_Loc); +- printf (" should be: %d\n", 7); +- printf ("Enum_Loc: %d\n", Enum_Loc); +- printf (" should be: %d\n", 1); +- printf ("Str_1_Loc: %s\n", Str_1_Loc); +- printf (" should be: DHRYSTONE PROGRAM, 1'ST STRING\n"); +- printf ("Str_2_Loc: %s\n", Str_2_Loc); +- printf (" should be: DHRYSTONE PROGRAM, 2'ND STRING\n"); +- printf ("\n"); +- +- User_Time = End_Time - Begin_Time; +- +- if (User_Time < Too_Small_Time) +- { +- printf ("Measured time too small to obtain meaningful results\n"); +- printf ("Please increase number of runs\n"); +- printf ("\n"); +- } +- else +- { +-#ifdef TIME +- Microseconds = (float) User_Time * Mic_secs_Per_Second +- / (float) Number_Of_Runs; +- Dhrystones_Per_Second = (float) Number_Of_Runs / (float) User_Time; +-#else +- Microseconds = (float) User_Time * Mic_secs_Per_Second +- / ((float) HZ * ((float) Number_Of_Runs)); +- Dhrystones_Per_Second = ((float) HZ * (float) Number_Of_Runs) +- / (float) User_Time; +-#endif +- printf ("Microseconds for one run through Dhrystone: "); +- printf ("%6.1f \n", Microseconds); +- printf ("Dhrystones per Second: "); +- printf ("%6.1f \n", Dhrystones_Per_Second); +- printf ("\n"); +- } +- +-} +- +- +-Proc_1 (Ptr_Val_Par) +-/******************/ +- +-REG Rec_Pointer Ptr_Val_Par; +- /* executed once */ +-{ +- REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp; +- /* == Ptr_Glob_Next */ +- /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */ +- /* corresponds to "rename" in Ada, "with" in Pascal */ +- +- structassign (*Ptr_Val_Par->Ptr_Comp, *Ptr_Glob); +- Ptr_Val_Par->variant.var_1.Int_Comp = 5; +- Next_Record->variant.var_1.Int_Comp +- = Ptr_Val_Par->variant.var_1.Int_Comp; +- Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp; +- Proc_3 (&Next_Record->Ptr_Comp); +- /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp +- == Ptr_Glob->Ptr_Comp */ +- if (Next_Record->Discr == Ident_1) +- /* then, executed */ +- { +- Next_Record->variant.var_1.Int_Comp = 6; +- Proc_6 (Ptr_Val_Par->variant.var_1.Enum_Comp, +- &Next_Record->variant.var_1.Enum_Comp); +- Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp; +- Proc_7 (Next_Record->variant.var_1.Int_Comp, 10, +- &Next_Record->variant.var_1.Int_Comp); +- } +- else /* not executed */ +- structassign (*Ptr_Val_Par, *Ptr_Val_Par->Ptr_Comp); +-} /* Proc_1 */ +- +- +-Proc_2 (Int_Par_Ref) +-/******************/ +- /* executed once */ +- /* *Int_Par_Ref == 1, becomes 4 */ +- +-One_Fifty *Int_Par_Ref; +-{ +- One_Fifty Int_Loc; +- Enumeration Enum_Loc; +- +- Int_Loc = *Int_Par_Ref + 10; +- do /* executed once */ +- if (Ch_1_Glob == 'A') +- /* then, executed */ +- { +- Int_Loc -= 1; +- *Int_Par_Ref = Int_Loc - Int_Glob; +- Enum_Loc = Ident_1; +- } /* if */ +- while (Enum_Loc != Ident_1); /* true */ +-} /* Proc_2 */ +- +- +-Proc_3 (Ptr_Ref_Par) +-/******************/ +- /* executed once */ +- /* Ptr_Ref_Par becomes Ptr_Glob */ +- +-Rec_Pointer *Ptr_Ref_Par; +- +-{ +- if (Ptr_Glob != Null) +- /* then, executed */ +- *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp; +- Proc_7 (10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp); +-} /* Proc_3 */ +- +- +-Proc_4 () /* without parameters */ +-/*******/ +- /* executed once */ +-{ +- Boolean Bool_Loc; +- +- Bool_Loc = Ch_1_Glob == 'A'; +- Bool_Glob = Bool_Loc | Bool_Glob; +- Ch_2_Glob = 'B'; +-} /* Proc_4 */ +- +- +-Proc_5 () /* without parameters */ +-/*******/ +- /* executed once */ +-{ +- Ch_1_Glob = 'A'; +- Bool_Glob = false; +-} /* Proc_5 */ +- +- +- /* Procedure for the assignment of structures, */ +- /* if the C compiler doesn't support this feature */ +-#ifdef NOSTRUCTASSIGN +-memcpy (d, s, l) +-register char *d; +-register char *s; +-register int l; +-{ +- while (l--) *d++ = *s++; +-} +-#endif +- +- +//GO.SYSIN DD dhry_1.c +echo dhry_2.c 1>&2 +sed >dhry_2.c <<'//GO.SYSIN DD dhry_2.c' 's/^-//' +-/* +- **************************************************************************** +- * +- * "DHRYSTONE" Benchmark Program +- * ----------------------------- +- * +- * Version: C, Version 2.1 +- * +- * File: dhry_2.c (part 3 of 3) +- * +- * Date: May 25, 1988 +- * +- * Author: Reinhold P. Weicker +- * +- **************************************************************************** +- */ +- +-#include "dhry.h" +- +-#ifndef REG +-#define REG +- /* REG becomes defined as empty */ +- /* i.e. no register variables */ +-#endif +- +-extern int Int_Glob; +-extern char Ch_1_Glob; +- +- +-Proc_6 (Enum_Val_Par, Enum_Ref_Par) +-/*********************************/ +- /* executed once */ +- /* Enum_Val_Par == Ident_3, Enum_Ref_Par becomes Ident_2 */ +- +-Enumeration Enum_Val_Par; +-Enumeration *Enum_Ref_Par; +-{ +- *Enum_Ref_Par = Enum_Val_Par; +- if (! Func_3 (Enum_Val_Par)) +- /* then, not executed */ +- *Enum_Ref_Par = Ident_4; +- switch (Enum_Val_Par) +- { +- case Ident_1: +- *Enum_Ref_Par = Ident_1; +- break; +- case Ident_2: +- if (Int_Glob > 100) +- /* then */ +- *Enum_Ref_Par = Ident_1; +- else *Enum_Ref_Par = Ident_4; +- break; +- case Ident_3: /* executed */ +- *Enum_Ref_Par = Ident_2; +- break; +- case Ident_4: break; +- case Ident_5: +- *Enum_Ref_Par = Ident_3; +- break; +- } /* switch */ +-} /* Proc_6 */ +- +- +-Proc_7 (Int_1_Par_Val, Int_2_Par_Val, Int_Par_Ref) +-/**********************************************/ +- /* executed three times */ +- /* first call: Int_1_Par_Val == 2, Int_2_Par_Val == 3, */ +- /* Int_Par_Ref becomes 7 */ +- /* second call: Int_1_Par_Val == 10, Int_2_Par_Val == 5, */ +- /* Int_Par_Ref becomes 17 */ +- /* third call: Int_1_Par_Val == 6, Int_2_Par_Val == 10, */ +- /* Int_Par_Ref becomes 18 */ +-One_Fifty Int_1_Par_Val; +-One_Fifty Int_2_Par_Val; +-One_Fifty *Int_Par_Ref; +-{ +- One_Fifty Int_Loc; +- +- Int_Loc = Int_1_Par_Val + 2; +- *Int_Par_Ref = Int_2_Par_Val + Int_Loc; +-} /* Proc_7 */ +- +- +-Proc_8 (Arr_1_Par_Ref, Arr_2_Par_Ref, Int_1_Par_Val, Int_2_Par_Val) +-/*********************************************************************/ +- /* executed once */ +- /* Int_Par_Val_1 == 3 */ +- /* Int_Par_Val_2 == 7 */ +-Arr_1_Dim Arr_1_Par_Ref; +-Arr_2_Dim Arr_2_Par_Ref; +-int Int_1_Par_Val; +-int Int_2_Par_Val; +-{ +- REG One_Fifty Int_Index; +- REG One_Fifty Int_Loc; +- +- Int_Loc = Int_1_Par_Val + 5; +- Arr_1_Par_Ref [Int_Loc] = Int_2_Par_Val; +- Arr_1_Par_Ref [Int_Loc+1] = Arr_1_Par_Ref [Int_Loc]; +- Arr_1_Par_Ref [Int_Loc+30] = Int_Loc; +- for (Int_Index = Int_Loc; Int_Index <= Int_Loc+1; ++Int_Index) +- Arr_2_Par_Ref [Int_Loc] [Int_Index] = Int_Loc; +- Arr_2_Par_Ref [Int_Loc] [Int_Loc-1] += 1; +- Arr_2_Par_Ref [Int_Loc+20] [Int_Loc] = Arr_1_Par_Ref [Int_Loc]; +- Int_Glob = 5; +-} /* Proc_8 */ +- +- +-Enumeration Func_1 (Ch_1_Par_Val, Ch_2_Par_Val) +-/*************************************************/ +- /* executed three times */ +- /* first call: Ch_1_Par_Val == 'H', Ch_2_Par_Val == 'R' */ +- /* second call: Ch_1_Par_Val == 'A', Ch_2_Par_Val == 'C' */ +- /* third call: Ch_1_Par_Val == 'B', Ch_2_Par_Val == 'C' */ +- +-Capital_Letter Ch_1_Par_Val; +-Capital_Letter Ch_2_Par_Val; +-{ +- Capital_Letter Ch_1_Loc; +- Capital_Letter Ch_2_Loc; +- +- Ch_1_Loc = Ch_1_Par_Val; +- Ch_2_Loc = Ch_1_Loc; +- if (Ch_2_Loc != Ch_2_Par_Val) +- /* then, executed */ +- return (Ident_1); +- else /* not executed */ +- { +- Ch_1_Glob = Ch_1_Loc; +- return (Ident_2); +- } +-} /* Func_1 */ +- +- +-Boolean Func_2 (Str_1_Par_Ref, Str_2_Par_Ref) +-/*************************************************/ +- /* executed once */ +- /* Str_1_Par_Ref == "DHRYSTONE PROGRAM, 1'ST STRING" */ +- /* Str_2_Par_Ref == "DHRYSTONE PROGRAM, 2'ND STRING" */ +- +-Str_30 Str_1_Par_Ref; +-Str_30 Str_2_Par_Ref; +-{ +- REG One_Thirty Int_Loc; +- Capital_Letter Ch_Loc; +- +- Int_Loc = 2; +- while (Int_Loc <= 2) /* loop body executed once */ +- if (Func_1 (Str_1_Par_Ref[Int_Loc], +- Str_2_Par_Ref[Int_Loc+1]) == Ident_1) +- /* then, executed */ +- { +- Ch_Loc = 'A'; +- Int_Loc += 1; +- } /* if, while */ +- if (Ch_Loc >= 'W' && Ch_Loc < 'Z') +- /* then, not executed */ +- Int_Loc = 7; +- if (Ch_Loc == 'R') +- /* then, not executed */ +- return (true); +- else /* executed */ +- { +- if (strcmp (Str_1_Par_Ref, Str_2_Par_Ref) > 0) +- /* then, not executed */ +- { +- Int_Loc += 7; +- Int_Glob = Int_Loc; +- return (true); +- } +- else /* executed */ +- return (false); +- } /* if Ch_Loc */ +-} /* Func_2 */ +- +- +-Boolean Func_3 (Enum_Par_Val) +-/***************************/ +- /* executed once */ +- /* Enum_Par_Val == Ident_3 */ +-Enumeration Enum_Par_Val; +-{ +- Enumeration Enum_Loc; +- +- Enum_Loc = Enum_Par_Val; +- if (Enum_Loc == Ident_3) +- /* then, executed */ +- return (true); +- else /* not executed */ +- return (false); +-} /* Func_3 */ +- +//GO.SYSIN DD dhry_2.c +echo dhry_c.dif 1>&2 +sed >dhry_c.dif <<'//GO.SYSIN DD dhry_c.dif' 's/^-//' +-7c7 +-< * Version: C, Version 2.1 +---- +-> * Version: C, Version 2.0 +-9c9 +-< * File: dhry.h (part 1 of 3) +---- +-> * File: dhry_global.h (part 1 of 3) +-11c11 +-< * Date: May 25, 1988 +---- +-> * Date: March 3, 1988 +-30c30 +-< * In addition, Berkeley UNIX system calls "times ()" or "time ()" +---- +-> * In addition, UNIX system calls "times ()" or "time ()" +-44c44 +-< * Please send results to Rick Richardson and/or Reinhold Weicker. +---- +-> * Please send results to Reinhold Weicker and/or Rick Richardson. +-59c59 +-< * History: This version C/2.1 has been made for two reasons: +---- +-> * History: This version C/2.0 has been made for two reasons: +-123,129d122 +-< * Version 2.1 is identical to version 2.0 distributed via +-< * the UNIX network Usenet in March 1988 except that it corrects +-< * some minor deficiencies that were found by users of version 2.0. +-< * The only change within the measurement loop is that a +-< * non-executed "else" part was added to the "if" statement in +-< * Func_3, and a non-executed "else" part removed from Proc_3. +-< * +-165,167c158,160 +-< * -DHZ=nnn +-< * In Berkeley UNIX, the function "times" returns process +-< * time in 1/HZ seconds, with HZ = 60 for most systems. +---- +-> * -DHZ=nnn (default: 60) +-> * The function "times" returns process times in +-> * 1/HZ seconds, with HZ = 60 for most systems. +-169c162 +-< * A VALUE. +---- +-> * THE DEFAULT VALUE. +-176,178c169,171 +-< * - dhry.h (this file, containing global definitions and comments) +-< * - dhry_1.c (containing the code corresponding to Ada package Pack_1) +-< * - dhry_2.c (containing the code corresponding to Ada package Pack_2) +---- +-> * - dhry_global.h (this file, containing global definitions and comments) +-> * - dhry_pack_1.c (containing the code corresponding to Ada package Pack_1) +-> * - dhry_pack_2.c (containing the code corresponding to Ada package Pack_2) +-350a344 +-> #ifndef TIMES +-353,354c347,354 +-< /* Use times(2) time function unless */ +-< /* explicitly defined otherwise */ +---- +-> #endif +-> /* Use "times" function for measurement */ +-> /* unless explicitly defined otherwise */ +-> #ifndef HZ +-> #define HZ 60 +-> #endif +-> /* Use HZ = 60 for "times" function */ +-> /* unless explicitly defined otherwise */ +-363c363 +-< /* Berkeley UNIX C returns process times in seconds/HZ */ +---- +-> /* UNIX C returns process times in seconds/HZ */ +-7c7 +-< * Version: C, Version 2.1 +---- +-> * Version: C, Version 2.0 +-9c9 +-< * File: dhry_1.c (part 2 of 3) +---- +-> * File: dhry_pack_1.c (part 2 of 3) +-11c11 +-< * Date: May 25, 1988 +---- +-> * Date: March 3, 1988 +-18c18 +-< #include "dhry.h" +---- +-> #include "dhry_global.h" +-50,51d49 +-< #define Too_Small_Time 120 +-< /* Measurements should last at least about 2 seconds */ +-55a54,55 +-> #endif +-> +-58d57 +-< #endif +-73a73 +-> +-84a85 +-> +-99,100c100,102 +-< /* Was missing in published program. Without this statement, */ +-< /* Arr_2_Glob [8][7] would have an undefined value. */ +---- +-> /* Was missing in published program. Without this */ +-> /* initialization, Arr_2_Glob [8][7] would have an */ +-> /* undefined value. */ +-105c107 +-< printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n"); +---- +-> printf ("Dhrystone Benchmark, Version 2.0 (Language: C)\n"); +-281c283 +-< /******************/ +---- +-> /**********************/ +-338c340 +-< /******************/ +---- +-> /**********************/ +-347a350,351 +-> else /* not executed */ +-> Int_Glob = 100; +-349a354 +-> +-7c7 +-< * Version: C, Version 2.1 +---- +-> * Version: C, Version 2.0 +-9c9 +-< * File: dhry_2.c (part 3 of 3) +---- +-> * File: dhry_pack_2.c (part 3 of 3) +-11c11 +-< * Date: May 25, 1988 +---- +-> * Date: March 3, 1988 +-18c18 +-< #include "dhry.h" +---- +-> #include "dhry_global.h" +-189,190d188 +-< else /* not executed */ +-< return (false); +//GO.SYSIN DD dhry_c.dif +echo submit.frm 1>&2 +sed >submit.frm <<'//GO.SYSIN DD submit.frm' 's/^-//' +-DHRYSTONE 2.1 BENCHMARK REPORTING FORM +-MANUF: +-MODEL: +-PROC: +-CLOCK: +-OS: +-OVERSION: +-COMPILER: +-CVERSION: +-OPTIONS: +-NOREG: +-REG: +-NOTES: +-DATE: +-SUBMITTER: +-CODESIZE: +-MAILTO: uunet!pcrat!dry2 +//GO.SYSIN DD submit.frm diff --git a/zpu/roadshow/roadshow/dhrystone/dhry.h b/zpu/roadshow/roadshow/dhrystone/dhry.h new file mode 100644 index 0000000..211c2e2 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhry.h @@ -0,0 +1,423 @@ +/*
+ ****************************************************************************
+ *
+ * "DHRYSTONE" Benchmark Program
+ * -----------------------------
+ *
+ * Version: C, Version 2.1
+ *
+ * File: dhry.h (part 1 of 3)
+ *
+ * Date: May 25, 1988
+ *
+ * Author: Reinhold P. Weicker
+ * Siemens AG, AUT E 51
+ * Postfach 3220
+ * 8520 Erlangen
+ * Germany (West)
+ * Phone: [+49]-9131-7-20330
+ * (8-17 Central European Time)
+ * Usenet: ..!mcsun!unido!estevax!weicker
+ *
+ * Original Version (in Ada) published in
+ * "Communications of the ACM" vol. 27., no. 10 (Oct. 1984),
+ * pp. 1013 - 1030, together with the statistics
+ * on which the distribution of statements etc. is based.
+ *
+ * In this C version, the following C library functions are used:
+ * - strcpy, strcmp (inside the measurement loop)
+ * - printf, scanf (outside the measurement loop)
+ * In addition, Berkeley UNIX system calls "times ()" or "time ()"
+ * are used for execution time measurement. For measurements
+ * on other systems, these calls have to be changed.
+ *
+ * Collection of Results:
+ * Reinhold Weicker (address see above) and
+ *
+ * Rick Richardson
+ * PC Research. Inc.
+ * 94 Apple Orchard Drive
+ * Tinton Falls, NJ 07724
+ * Phone: (201) 389-8963 (9-17 EST)
+ * Usenet: ...!uunet!pcrat!rick
+ *
+ * Please send results to Rick Richardson and/or Reinhold Weicker.
+ * Complete information should be given on hardware and software used.
+ * Hardware information includes: Machine type, CPU, type and size
+ * of caches; for microprocessors: clock frequency, memory speed
+ * (number of wait states).
+ * Software information includes: Compiler (and runtime library)
+ * manufacturer and version, compilation switches, OS version.
+ * The Operating System version may give an indication about the
+ * compiler; Dhrystone itself performs no OS calls in the measurement loop.
+ *
+ * The complete output generated by the program should be mailed
+ * such that at least some checks for correctness can be made.
+ *
+ ***************************************************************************
+ *
+ * History: This version C/2.1 has been made for two reasons:
+ *
+ * 1) There is an obvious need for a common C version of
+ * Dhrystone, since C is at present the most popular system
+ * programming language for the class of processors
+ * (microcomputers, minicomputers) where Dhrystone is used most.
+ * There should be, as far as possible, only one C version of
+ * Dhrystone such that results can be compared without
+ * restrictions. In the past, the C versions distributed
+ * by Rick Richardson (Version 1.1) and by Reinhold Weicker
+ * had small (though not significant) differences.
+ *
+ * 2) As far as it is possible without changes to the Dhrystone
+ * statistics, optimizing compilers should be prevented from
+ * removing significant statements.
+ *
+ * This C version has been developed in cooperation with
+ * Rick Richardson (Tinton Falls, NJ), it incorporates many
+ * ideas from the "Version 1.1" distributed previously by
+ * him over the UNIX network Usenet.
+ * I also thank Chaim Benedelac (National Semiconductor),
+ * David Ditzel (SUN), Earl Killian and John Mashey (MIPS),
+ * Alan Smith and Rafael Saavedra-Barrera (UC at Berkeley)
+ * for their help with comments on earlier versions of the
+ * benchmark.
+ *
+ * Changes: In the initialization part, this version follows mostly
+ * Rick Richardson's version distributed via Usenet, not the
+ * version distributed earlier via floppy disk by Reinhold Weicker.
+ * As a concession to older compilers, names have been made
+ * unique within the first 8 characters.
+ * Inside the measurement loop, this version follows the
+ * version previously distributed by Reinhold Weicker.
+ *
+ * At several places in the benchmark, code has been added,
+ * but within the measurement loop only in branches that
+ * are not executed. The intention is that optimizing compilers
+ * should be prevented from moving code out of the measurement
+ * loop, or from removing code altogether. Since the statements
+ * that are executed within the measurement loop have NOT been
+ * changed, the numbers defining the "Dhrystone distribution"
+ * (distribution of statements, operand types and locality)
+ * still hold. Except for sophisticated optimizing compilers,
+ * execution times for this version should be the same as
+ * for previous versions.
+ *
+ * Since it has proven difficult to subtract the time for the
+ * measurement loop overhead in a correct way, the loop check
+ * has been made a part of the benchmark. This does have
+ * an impact - though a very minor one - on the distribution
+ * statistics which have been updated for this version.
+ *
+ * All changes within the measurement loop are described
+ * and discussed in the companion paper "Rationale for
+ * Dhrystone version 2".
+ *
+ * Because of the self-imposed limitation that the order and
+ * distribution of the executed statements should not be
+ * changed, there are still cases where optimizing compilers
+ * may not generate code for some statements. To a certain
+ * degree, this is unavoidable for small synthetic benchmarks.
+ * Users of the benchmark are advised to check code listings
+ * whether code is generated for all statements of Dhrystone.
+ *
+ * Version 2.1 is identical to version 2.0 distributed via
+ * the UNIX network Usenet in March 1988 except that it corrects
+ * some minor deficiencies that were found by users of version 2.0.
+ * The only change within the measurement loop is that a
+ * non-executed "else" part was added to the "if" statement in
+ * Func_3, and a non-executed "else" part removed from Proc_3.
+ *
+ ***************************************************************************
+ *
+ * Defines: The following "Defines" are possible:
+ * -DREG=register (default: Not defined)
+ * As an approximation to what an average C programmer
+ * might do, the "register" storage class is applied
+ * (if enabled by -DREG=register)
+ * - for local variables, if they are used (dynamically)
+ * five or more times
+ * - for parameters if they are used (dynamically)
+ * six or more times
+ * Note that an optimal "register" strategy is
+ * compiler-dependent, and that "register" declarations
+ * do not necessarily lead to faster execution.
+ * -DNOSTRUCTASSIGN (default: Not defined)
+ * Define if the C compiler does not support
+ * assignment of structures.
+ * -DNOENUMS (default: Not defined)
+ * Define if the C compiler does not support
+ * enumeration types.
+ * -DTIMES (default)
+ * -DTIME
+ * The "times" function of UNIX (returning process times)
+ * or the "time" function (returning wallclock time)
+ * is used for measurement.
+ * For single user machines, "time ()" is adequate. For
+ * multi-user machines where you cannot get single-user
+ * access, use the "times ()" function. If you have
+ * neither, use a stopwatch in the dead of night.
+ * "printf"s are provided marking the points "Start Timer"
+ * and "Stop Timer". DO NOT use the UNIX "time(1)"
+ * command, as this will measure the total time to
+ * run this program, which will (erroneously) include
+ * the time to allocate storage (malloc) and to perform
+ * the initialization.
+ * -DHZ=nnn
+ * In Berkeley UNIX, the function "times" returns process
+ * time in 1/HZ seconds, with HZ = 60 for most systems.
+ * CHECK YOUR SYSTEM DESCRIPTION BEFORE YOU JUST APPLY
+ * A VALUE.
+ *
+ ***************************************************************************
+ *
+ * Compilation model and measurement (IMPORTANT):
+ *
+ * This C version of Dhrystone consists of three files:
+ * - dhry.h (this file, containing global definitions and comments)
+ * - dhry_1.c (containing the code corresponding to Ada package Pack_1)
+ * - dhry_2.c (containing the code corresponding to Ada package Pack_2)
+ *
+ * The following "ground rules" apply for measurements:
+ * - Separate compilation
+ * - No procedure merging
+ * - Otherwise, compiler optimizations are allowed but should be indicated
+ * - Default results are those without register declarations
+ * See the companion paper "Rationale for Dhrystone Version 2" for a more
+ * detailed discussion of these ground rules.
+ *
+ * For 16-Bit processors (e.g. 80186, 80286), times for all compilation
+ * models ("small", "medium", "large" etc.) should be given if possible,
+ * together with a definition of these models for the compiler system used.
+ *
+ **************************************************************************
+ *
+ * Dhrystone (C version) statistics:
+ *
+ * [Comment from the first distribution, updated for version 2.
+ * Note that because of language differences, the numbers are slightly
+ * different from the Ada version.]
+ *
+ * The following program contains statements of a high level programming
+ * language (here: C) in a distribution considered representative:
+ *
+ * assignments 52 (51.0 %)
+ * control statements 33 (32.4 %)
+ * procedure, function calls 17 (16.7 %)
+ *
+ * 103 statements are dynamically executed. The program is balanced with
+ * respect to the three aspects:
+ *
+ * - statement type
+ * - operand type
+ * - operand locality
+ * operand global, local, parameter, or constant.
+ *
+ * The combination of these three aspects is balanced only approximately.
+ *
+ * 1. Statement Type:
+ * ----------------- number
+ *
+ * V1 = V2 9
+ * (incl. V1 = F(..)
+ * V = Constant 12
+ * Assignment, 7
+ * with array element
+ * Assignment, 6
+ * with record component
+ * --
+ * 34 34
+ *
+ * X = Y +|-|"&&"|"|" Z 5
+ * X = Y +|-|"==" Constant 6
+ * X = X +|- 1 3
+ * X = Y *|/ Z 2
+ * X = Expression, 1
+ * two operators
+ * X = Expression, 1
+ * three operators
+ * --
+ * 18 18
+ *
+ * if .... 14
+ * with "else" 7
+ * without "else" 7
+ * executed 3
+ * not executed 4
+ * for ... 7 | counted every time
+ * while ... 4 | the loop condition
+ * do ... while 1 | is evaluated
+ * switch ... 1
+ * break 1
+ * declaration with 1
+ * initialization
+ * --
+ * 34 34
+ *
+ * P (...) procedure call 11
+ * user procedure 10
+ * library procedure 1
+ * X = F (...)
+ * function call 6
+ * user function 5
+ * library function 1
+ * --
+ * 17 17
+ * ---
+ * 103
+ *
+ * The average number of parameters in procedure or function calls
+ * is 1.82 (not counting the function values as implicit parameters).
+ *
+ *
+ * 2. Operators
+ * ------------
+ * number approximate
+ * percentage
+ *
+ * Arithmetic 32 50.8
+ *
+ * + 21 33.3
+ * - 7 11.1
+ * * 3 4.8
+ * / (int div) 1 1.6
+ *
+ * Comparison 27 42.8
+ *
+ * == 9 14.3
+ * /= 4 6.3
+ * > 1 1.6
+ * < 3 4.8
+ * >= 1 1.6
+ * <= 9 14.3
+ *
+ * Logic 4 6.3
+ *
+ * && (AND-THEN) 1 1.6
+ * | (OR) 1 1.6
+ * ! (NOT) 2 3.2
+ *
+ * -- -----
+ * 63 100.1
+ *
+ *
+ * 3. Operand Type (counted once per operand reference):
+ * ---------------
+ * number approximate
+ * percentage
+ *
+ * Integer 175 72.3 %
+ * Character 45 18.6 %
+ * Pointer 12 5.0 %
+ * String30 6 2.5 %
+ * Array 2 0.8 %
+ * Record 2 0.8 %
+ * --- -------
+ * 242 100.0 %
+ *
+ * When there is an access path leading to the final operand (e.g. a record
+ * component), only the final data type on the access path is counted.
+ *
+ *
+ * 4. Operand Locality:
+ * -------------------
+ * number approximate
+ * percentage
+ *
+ * local variable 114 47.1 %
+ * global variable 22 9.1 %
+ * parameter 45 18.6 %
+ * value 23 9.5 %
+ * reference 22 9.1 %
+ * function result 6 2.5 %
+ * constant 55 22.7 %
+ * --- -------
+ * 242 100.0 %
+ *
+ *
+ * The program does not compute anything meaningful, but it is syntactically
+ * and semantically correct. All variables have a value assigned to them
+ * before they are used as a source operand.
+ *
+ * There has been no explicit effort to account for the effects of a
+ * cache, or to balance the use of long or short displacements for code or
+ * data.
+ *
+ ***************************************************************************
+ */
+
+/* Compiler and system dependent definitions: */
+
+#ifndef TIME
+#define TIMES
+#endif
+ /* Use times(2) time function unless */
+ /* explicitly defined otherwise */
+
+#ifdef TIMES
+#include <sys/types.h>
+#include <sys/times.h>
+ /* for "times" */
+#endif
+
+#define Mic_secs_Per_Second 1000000
+ /* Berkeley UNIX C returns process times in seconds/HZ */
+
+#ifdef NOSTRUCTASSIGN
+#define structassign(d, s) memcpy(&(d), &(s), sizeof(d))
+#else
+#define structassign(d, s) d = s
+#endif
+
+#ifdef NOENUM
+#define Ident_1 0
+#define Ident_2 1
+#define Ident_3 2
+#define Ident_4 3
+#define Ident_5 4
+ typedef int Enumeration;
+#else
+ typedef enum {Ident_1, Ident_2, Ident_3, Ident_4, Ident_5}
+ Enumeration;
+#endif
+ /* for boolean and enumeration types in Ada, Pascal */
+
+/* General definitions: */
+
+#include <stdio.h>
+ /* for strcpy, strcmp */
+
+#define Null 0
+ /* Value of a Null pointer */
+#define true 1
+#define false 0
+
+typedef int One_Thirty;
+typedef int One_Fifty;
+typedef char Capital_Letter;
+typedef int Boolean;
+typedef char Str_30 [31];
+typedef int Arr_1_Dim [50];
+typedef int Arr_2_Dim [50] [50];
+
+typedef struct record
+ {
+ struct record *Ptr_Comp;
+ Enumeration Discr;
+ union {
+ struct {
+ Enumeration Enum_Comp;
+ int Int_Comp;
+ char Str_Comp [31];
+ } var_1;
+ struct {
+ Enumeration E_Comp_2;
+ char Str_2_Comp [31];
+ } var_2;
+ struct {
+ char Ch_1_Comp;
+ char Ch_2_Comp;
+ } var_3;
+ } variant;
+ } Rec_Type, *Rec_Pointer;
+
+
diff --git a/zpu/roadshow/roadshow/dhrystone/dhry_1.c b/zpu/roadshow/roadshow/dhrystone/dhry_1.c new file mode 100644 index 0000000..08a29b9 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhry_1.c @@ -0,0 +1,533 @@ +/*
+ ****************************************************************************
+ *
+ * "DHRYSTONE" Benchmark Program
+ * -----------------------------
+ *
+ * Version: C, Version 2.1
+ *
+ * File: dhry_1.c (part 2 of 3)
+ *
+ * Date: May 25, 1988
+ *
+ * Author: Reinhold P. Weicker
+ *
+ ****************************************************************************
+ */
+
+#include "dhry.h"
+#include <stdarg.h>
+
+static int
+_cvt(int val, char *buf, int radix, char *digits)
+{
+ char temp[80];
+ char *cp = temp;
+ int length = 0;
+
+ if (val == 0) {
+ /* Special case */
+ *cp++ = '0';
+ } else {
+ while (val) {
+ *cp++ = digits[val % radix];
+ val /= radix;
+ }
+ }
+ while (cp != temp) {
+ *buf++ = *--cp;
+ length++;
+ }
+ *buf = '\0';
+ return (length);
+}
+
+#define is_digit(c) ((c >= '0') && (c <= '9'))
+
+
+#ifndef TINY
+static int
+_vprintf(void (*putc)(char c, void **param), void **param, const char *fmt, va_list ap)
+{
+ char buf[sizeof(long long)*8];
+ char c, sign, *cp=buf;
+ int left_prec, right_prec, zero_fill, pad, pad_on_right,
+ i, islong, islonglong;
+ long long val = 0;
+ int res = 0, length = 0;
+
+ while ((c = *fmt++) != '\0') {
+ if (c == '%') {
+ c = *fmt++;
+ left_prec = right_prec = pad_on_right = islong = islonglong = 0;
+ sign = '\0';
+ // Fetch value [numeric descriptors only]
+ switch (c) {
+ case 'd':
+ val = (long long)va_arg(ap, int);
+ if ((c == 'd') || (c == 'D')) {
+ if (val < 0) {
+ sign = '-';
+ val = -val;
+ }
+ } else {
+ // Mask to unsigned, sized quantity
+ if (islong) {
+ val &= ((long long)1 << (sizeof(long) * 8)) - 1;
+ } else{
+ val &= ((long long)1 << (sizeof(int) * 8)) - 1;
+ }
+ }
+ break;
+ default:
+ break;
+ }
+ // Process output
+ switch (c) {
+ case 'd':
+ switch (c) {
+ case 'd':
+ length = _cvt(val, buf, 10, "0123456789");
+ break;
+ }
+ cp = buf;
+ break;
+ case 's':
+ cp = va_arg(ap, char *);
+ length = 0;
+ while (cp[length] != '\0') length++;
+ break;
+ case 'c':
+ c = va_arg(ap, int /*char*/);
+ (*putc)(c, param);
+ res++;
+ continue;
+ default:
+ (*putc)('%', param);
+ (*putc)(c, param);
+ res += 2;
+ continue;
+ }
+ while (length-- > 0) {
+ c = *cp++;
+ (*putc)(c, param);
+ res++;
+ }
+ } else {
+ (*putc)(c, param);
+ res++;
+ }
+ }
+ return (res);
+}
+#endif
+
+// Default wrapper function used by diag_printf
+static void
+_diag_write_char(char c, void **param)
+{
+ if (c=='\n')
+ {
+ outbyte('\r');
+ }
+ outbyte(c);
+}
+
+int
+small_printf(const char *fmt, ...)
+{
+#ifndef TINY
+ va_list ap;
+ int ret;
+
+ va_start(ap, fmt);
+ ret = _vprintf(_diag_write_char, (void **)0, fmt, ap);
+ va_end(ap);
+ return (ret);
+#else
+ return 0;
+#endif
+}
+
+
+
+
+/* Global Variables: */
+
+Rec_Pointer Ptr_Glob,
+ Next_Ptr_Glob;
+int Int_Glob;
+Boolean Bool_Glob;
+char Ch_1_Glob,
+ Ch_2_Glob;
+int Arr_1_Glob [50];
+int Arr_2_Glob [50] [50];
+
+Enumeration Func_1 ();
+ /* forward declaration necessary since Enumeration may not simply be int */
+
+#ifndef REG
+ Boolean Reg = false;
+#define REG
+ /* REG becomes defined as empty */
+ /* i.e. no register variables */
+#else
+ Boolean Reg = true;
+#endif
+
+/* variables for time measurement: */
+
+#ifdef TIMES
+struct tms time_info;
+ /* see library function "times" */
+#define Too_Small_Time 120
+ /* Measurements should last at least about 2 seconds */
+#endif
+#ifdef TIME
+extern long time();
+ /* see library function "time" */
+#define Too_Small_Time 2
+ /* Measurements should last at least 2 seconds */
+#endif
+
+long long Begin_Time,
+ End_Time,
+ User_Time;
+long long Microseconds,
+ Dhrystones_Per_Second,
+ Vax_Mips;
+
+/* end of variables for time measurement */
+
+int Number_Of_Runs = 50000;
+
+extern long long _readMicroseconds();
+
+
+int main ()
+/*****/
+
+ /* main program, corresponds to procedures */
+ /* Main and Proc_0 in the Ada version */
+{
+ One_Fifty Int_1_Loc;
+ REG One_Fifty Int_2_Loc;
+ One_Fifty Int_3_Loc;
+ REG char Ch_Index;
+ Enumeration Enum_Loc;
+ Str_30 Str_1_Loc;
+ Str_30 Str_2_Loc;
+ REG int Run_Index;
+
+ /* Initializations */
+
+ Next_Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type));
+ Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type));
+
+ Ptr_Glob->Ptr_Comp = Next_Ptr_Glob;
+ Ptr_Glob->Discr = Ident_1;
+ Ptr_Glob->variant.var_1.Enum_Comp = Ident_3;
+ Ptr_Glob->variant.var_1.Int_Comp = 40;
+ strcpy (Ptr_Glob->variant.var_1.Str_Comp,
+ "DHRYSTONE PROGRAM, SOME STRING");
+ strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");
+
+ Arr_2_Glob [8][7] = 10;
+ /* Was missing in published program. Without this statement, */
+ /* Arr_2_Glob [8][7] would have an undefined value. */
+ /* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */
+ /* overflow may occur for this array element. */
+ small_printf ("\n");
+ small_printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n");
+ small_printf ("\n");
+ if (Reg)
+ {
+ small_printf ("Program compiled with 'register' attribute\n");
+ small_printf ("\n");
+ }
+ else
+ {
+ small_printf ("Program compiled without 'register' attribute\n");
+ small_printf ("\n");
+ }
+ Number_Of_Runs;
+
+ small_printf ("Execution starts, %d runs through Dhrystone\n", Number_Of_Runs);
+
+ /***************/
+ /* Start timer */
+ /***************/
+
+#if 0
+#ifdef TIMES
+ times (&time_info);
+ Begin_Time = (long) time_info.tms_utime;
+#endif
+#ifdef TIME
+ Begin_Time = time ( (long *) 0);
+#endif
+#else
+ Begin_Time = _readMicroseconds();
+#endif
+ for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index)
+ {
+
+ Proc_5();
+ Proc_4();
+ /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */
+ Int_1_Loc = 2;
+ Int_2_Loc = 3;
+ strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");
+ Enum_Loc = Ident_2;
+ Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc);
+ /* Bool_Glob == 1 */
+ while (Int_1_Loc < Int_2_Loc) /* loop body executed once */
+ {
+ Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc;
+ /* Int_3_Loc == 7 */
+ Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc);
+ /* Int_3_Loc == 7 */
+ Int_1_Loc += 1;
+ } /* while */
+ /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
+ Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc);
+ /* Int_Glob == 5 */
+ Proc_1 (Ptr_Glob);
+ for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index)
+ /* loop body executed twice */
+ {
+ if (Enum_Loc == Func_1 (Ch_Index, 'C'))
+ /* then, not executed */
+ {
+ Proc_6 (Ident_1, &Enum_Loc);
+ strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");
+ Int_2_Loc = Run_Index;
+ Int_Glob = Run_Index;
+ }
+ }
+ /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
+ Int_2_Loc = Int_2_Loc * Int_1_Loc;
+ Int_1_Loc = Int_2_Loc / Int_3_Loc;
+ Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc;
+ /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */
+ Proc_2 (&Int_1_Loc);
+ /* Int_1_Loc == 5 */
+
+ } /* loop "for Run_Index" */
+
+ /**************/
+ /* Stop timer */
+ /**************/
+
+#if 0
+#ifdef TIMES
+ times (&time_info);
+ End_Time = (long) time_info.tms_utime;
+#endif
+#ifdef TIME
+ End_Time = time ( (long *) 0);
+#endif
+#else
+ End_Time = _readMicroseconds();
+#endif
+
+ small_printf ("Execution ends\n");
+ small_printf ("\n");
+ small_printf ("Final values of the variables used in the benchmark:\n");
+ small_printf ("\n");
+ small_printf ("Int_Glob: %d\n", Int_Glob);
+ small_printf (" should be: %d\n", 5);
+ small_printf ("Bool_Glob: %d\n", Bool_Glob);
+ small_printf (" should be: %d\n", 1);
+ small_printf ("Ch_1_Glob: %c\n", Ch_1_Glob);
+ small_printf (" should be: %c\n", 'A');
+ small_printf ("Ch_2_Glob: %c\n", Ch_2_Glob);
+ small_printf (" should be: %c\n", 'B');
+ small_printf ("Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]);
+ small_printf (" should be: %d\n", 7);
+ small_printf ("Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]);
+ small_printf (" should be: Number_Of_Runs + 10\n");
+ small_printf ("Ptr_Glob->\n");
+ small_printf (" Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp);
+ small_printf (" should be: (implementation-dependent)\n");
+ small_printf (" Discr: %d\n", Ptr_Glob->Discr);
+ small_printf (" should be: %d\n", 0);
+ small_printf (" Enum_Comp: %d\n", Ptr_Glob->variant.var_1.Enum_Comp);
+ small_printf (" should be: %d\n", 2);
+ small_printf (" Int_Comp: %d\n", Ptr_Glob->variant.var_1.Int_Comp);
+ small_printf (" should be: %d\n", 17);
+ small_printf (" Str_Comp: %s\n", Ptr_Glob->variant.var_1.Str_Comp);
+ small_printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");
+ small_printf ("Next_Ptr_Glob->\n");
+ small_printf (" Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp);
+ small_printf (" should be: (implementation-dependent), same as above\n");
+ small_printf (" Discr: %d\n", Next_Ptr_Glob->Discr);
+ small_printf (" should be: %d\n", 0);
+ small_printf (" Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp);
+ small_printf (" should be: %d\n", 1);
+ small_printf (" Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp);
+ small_printf (" should be: %d\n", 18);
+ small_printf (" Str_Comp: %s\n",
+ Next_Ptr_Glob->variant.var_1.Str_Comp);
+ small_printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");
+ small_printf ("Int_1_Loc: %d\n", Int_1_Loc);
+ small_printf (" should be: %d\n", 5);
+ small_printf ("Int_2_Loc: %d\n", Int_2_Loc);
+ small_printf (" should be: %d\n", 13);
+ small_printf ("Int_3_Loc: %d\n", Int_3_Loc);
+ small_printf (" should be: %d\n", 7);
+ small_printf ("Enum_Loc: %d\n", Enum_Loc);
+ small_printf (" should be: %d\n", 1);
+ small_printf ("Str_1_Loc: %s\n", Str_1_Loc);
+ small_printf (" should be: DHRYSTONE PROGRAM, 1'ST STRING\n");
+ small_printf ("Str_2_Loc: %s\n", Str_2_Loc);
+ small_printf (" should be: DHRYSTONE PROGRAM, 2'ND STRING\n");
+ small_printf ("\n");
+
+ User_Time = End_Time - Begin_Time;
+ small_printf ("User time: %d\n", (int)User_Time);
+
+ if (User_Time < Too_Small_Time)
+ {
+ small_printf ("Measured time too small to obtain meaningful results\n");
+ small_printf ("Please increase number of runs\n");
+ small_printf ("\n");
+ }
+/* else */
+ {
+#if 0
+#ifdef TIME
+ Microseconds = (User_Time * Mic_secs_Per_Second )
+ / Number_Of_Runs;
+ Dhrystones_Per_Second = Number_Of_Runs / User_Time;
+ Vax_Mips = (Number_Of_Runs*1000) / (1757*User_Time);
+#else
+ Microseconds = (float) User_Time * Mic_secs_Per_Second
+ / ((float) HZ * ((float) Number_Of_Runs));
+ Dhrystones_Per_Second = ((float) HZ * (float) Number_Of_Runs)
+ / (float) User_Time;
+ Vax_Mips = Dhrystones_Per_Second / 1757.0;
+#endif
+#else
+ Microseconds = User_Time / Number_Of_Runs;
+ Dhrystones_Per_Second = ((long long)Number_Of_Runs*1000000) / User_Time;
+ Vax_Mips = (((long long)Number_Of_Runs)*1000000000) / (1757*User_Time);
+#endif
+ small_printf ("Microseconds for one run through Dhrystone: ");
+ small_printf ("%d \n", (int)Microseconds);
+ small_printf ("Dhrystones per Second: ");
+ small_printf ("%d \n", (int)Dhrystones_Per_Second);
+ small_printf ("VAX MIPS rating * 1000 = %d \n",(int)Vax_Mips);
+ small_printf ("\n");
+ }
+
+ return 0;
+}
+
+
+Proc_1 (Ptr_Val_Par)
+/******************/
+
+REG Rec_Pointer Ptr_Val_Par;
+ /* executed once */
+{
+ REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp;
+ /* == Ptr_Glob_Next */
+ /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */
+ /* corresponds to "rename" in Ada, "with" in Pascal */
+
+ structassign (*Ptr_Val_Par->Ptr_Comp, *Ptr_Glob);
+ Ptr_Val_Par->variant.var_1.Int_Comp = 5;
+ Next_Record->variant.var_1.Int_Comp
+ = Ptr_Val_Par->variant.var_1.Int_Comp;
+ Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp;
+ Proc_3 (&Next_Record->Ptr_Comp);
+ /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp
+ == Ptr_Glob->Ptr_Comp */
+ if (Next_Record->Discr == Ident_1)
+ /* then, executed */
+ {
+ Next_Record->variant.var_1.Int_Comp = 6;
+ Proc_6 (Ptr_Val_Par->variant.var_1.Enum_Comp,
+ &Next_Record->variant.var_1.Enum_Comp);
+ Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp;
+ Proc_7 (Next_Record->variant.var_1.Int_Comp, 10,
+ &Next_Record->variant.var_1.Int_Comp);
+ }
+ else /* not executed */
+ structassign (*Ptr_Val_Par, *Ptr_Val_Par->Ptr_Comp);
+} /* Proc_1 */
+
+
+Proc_2 (Int_Par_Ref)
+/******************/
+ /* executed once */
+ /* *Int_Par_Ref == 1, becomes 4 */
+
+One_Fifty *Int_Par_Ref;
+{
+ One_Fifty Int_Loc;
+ Enumeration Enum_Loc;
+
+ Int_Loc = *Int_Par_Ref + 10;
+ do /* executed once */
+ if (Ch_1_Glob == 'A')
+ /* then, executed */
+ {
+ Int_Loc -= 1;
+ *Int_Par_Ref = Int_Loc - Int_Glob;
+ Enum_Loc = Ident_1;
+ } /* if */
+ while (Enum_Loc != Ident_1); /* true */
+} /* Proc_2 */
+
+
+Proc_3 (Ptr_Ref_Par)
+/******************/
+ /* executed once */
+ /* Ptr_Ref_Par becomes Ptr_Glob */
+
+Rec_Pointer *Ptr_Ref_Par;
+
+{
+ if (Ptr_Glob != Null)
+ /* then, executed */
+ *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp;
+ Proc_7 (10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp);
+} /* Proc_3 */
+
+
+Proc_4 () /* without parameters */
+/*******/
+ /* executed once */
+{
+ Boolean Bool_Loc;
+
+ Bool_Loc = Ch_1_Glob == 'A';
+ Bool_Glob = Bool_Loc | Bool_Glob;
+ Ch_2_Glob = 'B';
+} /* Proc_4 */
+
+
+Proc_5 () /* without parameters */
+/*******/
+ /* executed once */
+{
+ Ch_1_Glob = 'A';
+ Bool_Glob = false;
+} /* Proc_5 */
+
+
+ /* Procedure for the assignment of structures, */
+ /* if the C compiler doesn't support this feature */
+#ifdef NOSTRUCTASSIGN
+memcpy (d, s, l)
+register char *d;
+register char *s;
+register int l;
+{
+ while (l--) *d++ = *s++;
+}
+#endif
+
+
diff --git a/zpu/roadshow/roadshow/dhrystone/dhry_2.c b/zpu/roadshow/roadshow/dhrystone/dhry_2.c new file mode 100644 index 0000000..ed0e5b7 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhry_2.c @@ -0,0 +1,192 @@ +/*
+ ****************************************************************************
+ *
+ * "DHRYSTONE" Benchmark Program
+ * -----------------------------
+ *
+ * Version: C, Version 2.1
+ *
+ * File: dhry_2.c (part 3 of 3)
+ *
+ * Date: May 25, 1988
+ *
+ * Author: Reinhold P. Weicker
+ *
+ ****************************************************************************
+ */
+
+#include "dhry.h"
+
+#ifndef REG
+#define REG
+ /* REG becomes defined as empty */
+ /* i.e. no register variables */
+#endif
+
+extern int Int_Glob;
+extern char Ch_1_Glob;
+
+
+Proc_6 (Enum_Val_Par, Enum_Ref_Par)
+/*********************************/
+ /* executed once */
+ /* Enum_Val_Par == Ident_3, Enum_Ref_Par becomes Ident_2 */
+
+Enumeration Enum_Val_Par;
+Enumeration *Enum_Ref_Par;
+{
+ *Enum_Ref_Par = Enum_Val_Par;
+ if (! Func_3 (Enum_Val_Par))
+ /* then, not executed */
+ *Enum_Ref_Par = Ident_4;
+ switch (Enum_Val_Par)
+ {
+ case Ident_1:
+ *Enum_Ref_Par = Ident_1;
+ break;
+ case Ident_2:
+ if (Int_Glob > 100)
+ /* then */
+ *Enum_Ref_Par = Ident_1;
+ else *Enum_Ref_Par = Ident_4;
+ break;
+ case Ident_3: /* executed */
+ *Enum_Ref_Par = Ident_2;
+ break;
+ case Ident_4: break;
+ case Ident_5:
+ *Enum_Ref_Par = Ident_3;
+ break;
+ } /* switch */
+} /* Proc_6 */
+
+
+Proc_7 (Int_1_Par_Val, Int_2_Par_Val, Int_Par_Ref)
+/**********************************************/
+ /* executed three times */
+ /* first call: Int_1_Par_Val == 2, Int_2_Par_Val == 3, */
+ /* Int_Par_Ref becomes 7 */
+ /* second call: Int_1_Par_Val == 10, Int_2_Par_Val == 5, */
+ /* Int_Par_Ref becomes 17 */
+ /* third call: Int_1_Par_Val == 6, Int_2_Par_Val == 10, */
+ /* Int_Par_Ref becomes 18 */
+One_Fifty Int_1_Par_Val;
+One_Fifty Int_2_Par_Val;
+One_Fifty *Int_Par_Ref;
+{
+ One_Fifty Int_Loc;
+
+ Int_Loc = Int_1_Par_Val + 2;
+ *Int_Par_Ref = Int_2_Par_Val + Int_Loc;
+} /* Proc_7 */
+
+
+Proc_8 (Arr_1_Par_Ref, Arr_2_Par_Ref, Int_1_Par_Val, Int_2_Par_Val)
+/*********************************************************************/
+ /* executed once */
+ /* Int_Par_Val_1 == 3 */
+ /* Int_Par_Val_2 == 7 */
+Arr_1_Dim Arr_1_Par_Ref;
+Arr_2_Dim Arr_2_Par_Ref;
+int Int_1_Par_Val;
+int Int_2_Par_Val;
+{
+ REG One_Fifty Int_Index;
+ REG One_Fifty Int_Loc;
+
+ Int_Loc = Int_1_Par_Val + 5;
+ Arr_1_Par_Ref [Int_Loc] = Int_2_Par_Val;
+ Arr_1_Par_Ref [Int_Loc+1] = Arr_1_Par_Ref [Int_Loc];
+ Arr_1_Par_Ref [Int_Loc+30] = Int_Loc;
+ for (Int_Index = Int_Loc; Int_Index <= Int_Loc+1; ++Int_Index)
+ Arr_2_Par_Ref [Int_Loc] [Int_Index] = Int_Loc;
+ Arr_2_Par_Ref [Int_Loc] [Int_Loc-1] += 1;
+ Arr_2_Par_Ref [Int_Loc+20] [Int_Loc] = Arr_1_Par_Ref [Int_Loc];
+ Int_Glob = 5;
+} /* Proc_8 */
+
+
+Enumeration Func_1 (Ch_1_Par_Val, Ch_2_Par_Val)
+/*************************************************/
+ /* executed three times */
+ /* first call: Ch_1_Par_Val == 'H', Ch_2_Par_Val == 'R' */
+ /* second call: Ch_1_Par_Val == 'A', Ch_2_Par_Val == 'C' */
+ /* third call: Ch_1_Par_Val == 'B', Ch_2_Par_Val == 'C' */
+
+Capital_Letter Ch_1_Par_Val;
+Capital_Letter Ch_2_Par_Val;
+{
+ Capital_Letter Ch_1_Loc;
+ Capital_Letter Ch_2_Loc;
+
+ Ch_1_Loc = Ch_1_Par_Val;
+ Ch_2_Loc = Ch_1_Loc;
+ if (Ch_2_Loc != Ch_2_Par_Val)
+ /* then, executed */
+ return (Ident_1);
+ else /* not executed */
+ {
+ Ch_1_Glob = Ch_1_Loc;
+ return (Ident_2);
+ }
+} /* Func_1 */
+
+
+Boolean Func_2 (Str_1_Par_Ref, Str_2_Par_Ref)
+/*************************************************/
+ /* executed once */
+ /* Str_1_Par_Ref == "DHRYSTONE PROGRAM, 1'ST STRING" */
+ /* Str_2_Par_Ref == "DHRYSTONE PROGRAM, 2'ND STRING" */
+
+Str_30 Str_1_Par_Ref;
+Str_30 Str_2_Par_Ref;
+{
+ REG One_Thirty Int_Loc;
+ Capital_Letter Ch_Loc;
+
+ Int_Loc = 2;
+ while (Int_Loc <= 2) /* loop body executed once */
+ if (Func_1 (Str_1_Par_Ref[Int_Loc],
+ Str_2_Par_Ref[Int_Loc+1]) == Ident_1)
+ /* then, executed */
+ {
+ Ch_Loc = 'A';
+ Int_Loc += 1;
+ } /* if, while */
+ if (Ch_Loc >= 'W' && Ch_Loc < 'Z')
+ /* then, not executed */
+ Int_Loc = 7;
+ if (Ch_Loc == 'R')
+ /* then, not executed */
+ return (true);
+ else /* executed */
+ {
+ if (strcmp (Str_1_Par_Ref, Str_2_Par_Ref) > 0)
+ /* then, not executed */
+ {
+ Int_Loc += 7;
+ Int_Glob = Int_Loc;
+ return (true);
+ }
+ else /* executed */
+ return (false);
+ } /* if Ch_Loc */
+} /* Func_2 */
+
+
+Boolean Func_3 (Enum_Par_Val)
+/***************************/
+ /* executed once */
+ /* Enum_Par_Val == Ident_3 */
+Enumeration Enum_Par_Val;
+{
+ Enumeration Enum_Loc;
+
+ Enum_Loc = Enum_Par_Val;
+ if (Enum_Loc == Ident_3)
+ /* then, executed */
+ return (true);
+ else /* not executed */
+ return (false);
+} /* Func_3 */
+
diff --git a/zpu/roadshow/roadshow/dhrystone/dhry_c.dif b/zpu/roadshow/roadshow/dhrystone/dhry_c.dif new file mode 100644 index 0000000..8bcaaea --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhry_c.dif @@ -0,0 +1,141 @@ +7c7 +< * Version: C, Version 2.1 +--- +> * Version: C, Version 2.0 +9c9 +< * File: dhry.h (part 1 of 3) +--- +> * File: dhry_global.h (part 1 of 3) +11c11 +< * Date: May 25, 1988 +--- +> * Date: March 3, 1988 +30c30 +< * In addition, Berkeley UNIX system calls "times ()" or "time ()" +--- +> * In addition, UNIX system calls "times ()" or "time ()" +44c44 +< * Please send results to Rick Richardson and/or Reinhold Weicker. +--- +> * Please send results to Reinhold Weicker and/or Rick Richardson. +59c59 +< * History: This version C/2.1 has been made for two reasons: +--- +> * History: This version C/2.0 has been made for two reasons: +123,129d122 +< * Version 2.1 is identical to version 2.0 distributed via +< * the UNIX network Usenet in March 1988 except that it corrects +< * some minor deficiencies that were found by users of version 2.0. +< * The only change within the measurement loop is that a +< * non-executed "else" part was added to the "if" statement in +< * Func_3, and a non-executed "else" part removed from Proc_3. +< * +165,167c158,160 +< * -DHZ=nnn +< * In Berkeley UNIX, the function "times" returns process +< * time in 1/HZ seconds, with HZ = 60 for most systems. +--- +> * -DHZ=nnn (default: 60) +> * The function "times" returns process times in +> * 1/HZ seconds, with HZ = 60 for most systems. +169c162 +< * A VALUE. +--- +> * THE DEFAULT VALUE. +176,178c169,171 +< * - dhry.h (this file, containing global definitions and comments) +< * - dhry_1.c (containing the code corresponding to Ada package Pack_1) +< * - dhry_2.c (containing the code corresponding to Ada package Pack_2) +--- +> * - dhry_global.h (this file, containing global definitions and comments) +> * - dhry_pack_1.c (containing the code corresponding to Ada package Pack_1) +> * - dhry_pack_2.c (containing the code corresponding to Ada package Pack_2) +350a344 +> #ifndef TIMES +353,354c347,354 +< /* Use times(2) time function unless */ +< /* explicitly defined otherwise */ +--- +> #endif +> /* Use "times" function for measurement */ +> /* unless explicitly defined otherwise */ +> #ifndef HZ +> #define HZ 60 +> #endif +> /* Use HZ = 60 for "times" function */ +> /* unless explicitly defined otherwise */ +363c363 +< /* Berkeley UNIX C returns process times in seconds/HZ */ +--- +> /* UNIX C returns process times in seconds/HZ */ +7c7 +< * Version: C, Version 2.1 +--- +> * Version: C, Version 2.0 +9c9 +< * File: dhry_1.c (part 2 of 3) +--- +> * File: dhry_pack_1.c (part 2 of 3) +11c11 +< * Date: May 25, 1988 +--- +> * Date: March 3, 1988 +18c18 +< #include "dhry.h" +--- +> #include "dhry_global.h" +50,51d49 +< #define Too_Small_Time 120 +< /* Measurements should last at least about 2 seconds */ +55a54,55 +> #endif +> +58d57 +< #endif +73a73 +> +84a85 +> +99,100c100,102 +< /* Was missing in published program. Without this statement, */ +< /* Arr_2_Glob [8][7] would have an undefined value. */ +--- +> /* Was missing in published program. Without this */ +> /* initialization, Arr_2_Glob [8][7] would have an */ +> /* undefined value. */ +105c107 +< printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n"); +--- +> printf ("Dhrystone Benchmark, Version 2.0 (Language: C)\n"); +281c283 +< /******************/ +--- +> /**********************/ +338c340 +< /******************/ +--- +> /**********************/ +347a350,351 +> else /* not executed */ +> Int_Glob = 100; +349a354 +> +7c7 +< * Version: C, Version 2.1 +--- +> * Version: C, Version 2.0 +9c9 +< * File: dhry_2.c (part 3 of 3) +--- +> * File: dhry_pack_2.c (part 3 of 3) +11c11 +< * Date: May 25, 1988 +--- +> * Date: March 3, 1988 +18c18 +< #include "dhry.h" +--- +> #include "dhry_global.h" +189,190d188 +< else /* not executed */ +< return (false); diff --git a/zpu/roadshow/roadshow/dhrystone/dhrystone.bin b/zpu/roadshow/roadshow/dhrystone/dhrystone.bin Binary files differnew file mode 100644 index 0000000..ee1a6fe --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhrystone.bin diff --git a/zpu/roadshow/roadshow/dhrystone/dhrystone.zpu b/zpu/roadshow/roadshow/dhrystone/dhrystone.zpu Binary files differnew file mode 100644 index 0000000..e37e59f --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/dhrystone.zpu diff --git a/zpu/roadshow/roadshow/dhrystone/submit.frm b/zpu/roadshow/roadshow/dhrystone/submit.frm new file mode 100644 index 0000000..a75a689 --- /dev/null +++ b/zpu/roadshow/roadshow/dhrystone/submit.frm @@ -0,0 +1,17 @@ +DHRYSTONE 2.1 BENCHMARK REPORTING FORM +MANUF: +MODEL: +PROC: +CLOCK: +OS: +OVERSION: +COMPILER: +CVERSION: +OPTIONS: +NOREG: +REG: +NOTES: +DATE: +SUBMITTER: +CODESIZE: +MAILTO: uunet!pcrat!dry2 diff --git a/zpu/roadshow/roadshow/ecos/codesize/zpuarmcodesize.htm b/zpu/roadshow/roadshow/ecos/codesize/zpuarmcodesize.htm new file mode 100644 index 0000000..3631145 --- /dev/null +++ b/zpu/roadshow/roadshow/ecos/codesize/zpuarmcodesize.htm @@ -0,0 +1,1049 @@ +<html xmlns:o="urn:schemas-microsoft-com:office:office" +xmlns:x="urn:schemas-microsoft-com:office:excel" +xmlns="http://www.w3.org/TR/REC-html40"> + +<head> +<meta http-equiv=Content-Type content="text/html; charset=windows-1252"> +<meta name=ProgId content=Excel.Sheet> +<meta name=Generator content="Microsoft Excel 9"> +<link rel=File-List href="./zpuarmcodesize2_files/filelist.xml"> +<style id="test_15598_Styles"> +<!--table + {mso-displayed-decimal-separator:"\,"; + mso-displayed-thousand-separator:" ";} +.xl1515598 + {padding-top:1px; + padding-right:1px; + padding-left:1px; + mso-ignore:padding; + color:windowtext; + font-size:10.0pt; + font-weight:400; + font-style:normal; + text-decoration:none; + font-family:Arial; + mso-generic-font-family:auto; + mso-font-charset:0; + mso-number-format:General; + text-align:general; + vertical-align:bottom; + mso-background-source:auto; + mso-pattern:auto; + white-space:nowrap;} +.xl2215598 + {padding-top:1px; + padding-right:1px; + padding-left:1px; + mso-ignore:padding; + color:windowtext; + font-size:10.0pt; + font-weight:400; + font-style:normal; + text-decoration:none; + font-family:Arial; + mso-generic-font-family:auto; + mso-font-charset:0; + mso-number-format:General; + text-align:center; + vertical-align:bottom; + mso-background-source:auto; + mso-pattern:auto; + white-space:nowrap;} +.xl2315598 + {padding-top:1px; + padding-right:1px; + padding-left:1px; + mso-ignore:padding; + color:windowtext; + font-size:10.0pt; + font-weight:400; + font-style:normal; + text-decoration:none; + font-family:Arial; + mso-generic-font-family:auto; + mso-font-charset:0; + mso-number-format:"0\\ %"; + text-align:general; + vertical-align:bottom; + mso-background-source:auto; + mso-pattern:auto; + white-space:nowrap;} +.xl2415598 + {padding-top:1px; + padding-right:1px; + padding-left:1px; + mso-ignore:padding; + color:windowtext; + font-size:10.0pt; + font-weight:400; + font-style:normal; + text-decoration:none; + font-family:Arial; + mso-generic-font-family:auto; + mso-font-charset:0; + mso-number-format:General; + text-align:right; + vertical-align:bottom; + mso-background-source:auto; + mso-pattern:auto; + white-space:nowrap;} +.xl2515598 + {padding-top:1px; + padding-right:1px; + padding-left:1px; + mso-ignore:padding; + color:windowtext; + font-size:10.0pt; + font-weight:400; + font-style:normal; + text-decoration:none; + font-family:Arial; + mso-generic-font-family:auto; + mso-font-charset:0; + mso-number-format:"\@"; + text-align:right; + vertical-align:bottom; + mso-background-source:auto; + mso-pattern:auto; + white-space:nowrap;} +--> +</style> +<title>ZPU vs. ARM non-thumb eCos codesize</title> +</head> + +<body> +<!--[if !excel]> <![endif]--> +<!--The following information was generated by Microsoft Excel's Publish as Web +Page wizard.--> +<!--If the same item is republished from Excel, all information between the DIV +tags will be replaced.--> +<!-----------------------------> +<!--START OF OUTPUT FROM EXCEL PUBLISH AS WEB PAGE WIZARD --> +<!-----------------------------> + +<div id="test_15598" align=center x:publishsource="Excel"> + +<h1 style='color:black;font-family:Arial;font-size:14.0pt;font-weight:800; +font-style:normal'>ZPU vs. ARM non-thumb eCos codesize</h1> + +<table x:str border=0 cellpadding=0 cellspacing=0 width=883 style='border-collapse: + collapse;table-layout:fixed;width:663pt'> + <col width=64 span=5 style='width:48pt'> + <col width=62 style='mso-width-source:userset;mso-width-alt:2267;width:47pt'> + <col width=64 span=6 style='width:48pt'> + <col width=117 style='mso-width-source:userset;mso-width-alt:4278;width:88pt'> + <tr height=17 style='height:12.75pt'> + <td colspan=6 height=17 class=xl2215598 width=382 style='height:12.75pt; + width:287pt'>ZPU</td> + <td colspan=6 class=xl2215598 width=384 style='width:288pt'>ARM + non-thumb(eCos Thumb does not compile out of the box)</td> + <td class=xl1515598 width=117 style='width:88pt'></td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>filename</td> + <td class=xl1515598>text</td> + <td class=xl1515598>data</td> + <td class=xl1515598>bss</td> + <td class=xl1515598>dec</td> + <td class=xl1515598>hex</td> + <td class=xl1515598>filename</td> + <td class=xl1515598>text</td> + <td class=xl1515598>data</td> + <td class=xl1515598>bss</td> + <td class=xl1515598>dec</td> + <td class=xl1515598>hex</td> + <td class=xl1515598>ZPU text/ZPU ARM</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>bin_sem0</td> + <td class=xl2415598 x:num>15761</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>12060</td> + <td class=xl2415598 x:num>29325</td> + <td class=xl2515598>728d</td> + <td class=xl2415598>bin_sem0</td> + <td class=xl2415598 x:num>25204</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>16976</td> + <td class=xl2415598 x:num>42872</td> + <td class=xl2415598>a778</td> + <td class=xl2315598 align=right x:num="0.6253372480558641" x:fmla="=B3/H3">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>bin_sem1</td> + <td class=xl2415598 x:num>16907</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>14436</td> + <td class=xl2415598 x:num>32855</td> + <td class=xl2515598 x:num>8057</td> + <td class=xl2415598>bin_sem1</td> + <td class=xl2415598 x:num>26644</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>22096</td> + <td class=xl2415598 x:num>49440</td> + <td class=xl2415598>c120</td> + <td class=xl2315598 align=right x:num="0.63455186908872541" x:fmla="=B4/H4">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>bin_sem2</td> + <td class=xl2415598 x:num>17105</td> + <td class=xl2415598 x:num>1524</td> + <td class=xl2415598 x:num>30032</td> + <td class=xl2415598 x:num>48661</td> + <td class=xl2515598>be15</td> + <td class=xl2415598>bin_sem2</td> + <td class=xl2415598 x:num>26996</td> + <td class=xl2415598 x:num>712</td> + <td class=xl2415598 x:num>55584</td> + <td class=xl2415598 x:num>83292</td> + <td class=xl2415598>1455c</td> + <td class=xl2315598 align=right x:num="0.63361238702029932" x:fmla="=B5/H5">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>bin_sem3</td> + <td class=xl2415598 x:num>17186</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>14436</td> + <td class=xl2415598 x:num>33134</td> + <td class=xl2515598>816e</td> + <td class=xl2415598>bin_sem3</td> + <td class=xl2415598 x:num>27008</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>22100</td> + <td class=xl2415598 x:num>49808</td> + <td class=xl2415598>c290</td> + <td class=xl2315598 align=right x:num="0.63632997630331756" x:fmla="=B6/H6">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>clock0</td> + <td class=xl2415598 x:num>18986</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>12036</td> + <td class=xl2415598 x:num>32522</td> + <td class=xl2515598>7f0a</td> + <td class=xl2415598>clock0</td> + <td class=xl2415598 x:num>28992</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>16944</td> + <td class=xl2415598 x:num>46624</td> + <td class=xl2415598>b620</td> + <td class=xl2315598 align=right x:num="0.65487030905077259" x:fmla="=B7/H7">65 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>clock1</td> + <td class=xl2415598 x:num>15812</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>13236</td> + <td class=xl2415598 x:num>30552</td> + <td class=xl2515598 x:num>7758</td> + <td class=xl2415598>clock1</td> + <td class=xl2415598 x:num>25456</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>19532</td> + <td class=xl2415598 x:num>45680</td> + <td class=xl2415598>b270</td> + <td class=xl2315598 align=right x:num="0.62115021998742925" x:fmla="=B8/H8">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>clockcnv</td> + <td class=xl2415598 x:num>25095</td> + <td class=xl2415598 x:num>1972</td> + <td class=xl2415598 x:num>13224</td> + <td class=xl2415598 x:num>40291</td> + <td class=xl2515598>9d63</td> + <td class=xl2415598>clockcnv</td> + <td class=xl2415598 x:num>34572</td> + <td class=xl2415598 x:num>1160</td> + <td class=xl2415598 x:num>19520</td> + <td class=xl2415598 x:num>55252</td> + <td class=xl2415598>d7d4</td> + <td class=xl2315598 align=right x:num="0.72587643179451578" x:fmla="=B9/H9">73 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>clocktruth</td> + <td class=xl2415598 x:num>16437</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>13224</td> + <td class=xl2415598 x:num>31161</td> + <td class=xl2515598>79b9</td> + <td class=xl2415598>clocktruth</td> + <td class=xl2415598 x:num>26224</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>19508</td> + <td class=xl2415598 x:num>46420</td> + <td class=xl2415598>b554</td> + <td class=xl2315598 align=right x:num="0.62679225137278827" x:fmla="=B10/H10">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>cnt_sem0</td> + <td class=xl2415598 x:num>15762</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>12060</td> + <td class=xl2415598 x:num>29326</td> + <td class=xl2515598>728e</td> + <td class=xl2415598>cnt_sem0</td> + <td class=xl2415598 x:num>25204</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>16976</td> + <td class=xl2415598 x:num>42872</td> + <td class=xl2415598>a778</td> + <td class=xl2315598 align=right x:num="0.62537692429773051" x:fmla="=B11/H11">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>cnt_sem1</td> + <td class=xl2415598 x:num>17124</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>14436</td> + <td class=xl2415598 x:num>33072</td> + <td class=xl2515598 x:num>8130</td> + <td class=xl2415598>cnt_sem1</td> + <td class=xl2415598 x:num>26888</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>22108</td> + <td class=xl2415598 x:num>49696</td> + <td class=xl2415598>c220</td> + <td class=xl2315598 align=right x:num="0.63686402856292768" x:fmla="=B12/H12">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>dhrystone</td> + <td class=xl2415598 x:num>35947</td> + <td class=xl2415598 x:num>1564</td> + <td class=xl2415598 x:num>22512</td> + <td class=xl2415598 x:num>60023</td> + <td class=xl2515598>ea77</td> + <td class=xl2415598>dhrystone</td> + <td class=xl2415598 x:num>44180</td> + <td class=xl2415598 x:num>752</td> + <td class=xl2415598 x:num>27416</td> + <td class=xl2415598 x:num>72348</td> + <td class=xl2415598>11a9c</td> + <td class=xl2315598 align=right x:num="0.8136487098234495" x:fmla="=B13/H13">81 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>except1</td> + <td class=xl2415598 x:num>16428</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>13228</td> + <td class=xl2415598 x:num>31156</td> + <td class=xl2515598>79b4</td> + <td class=xl2415598>except1</td> + <td class=xl2415598 x:num>26088</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>19520</td> + <td class=xl2415598 x:num>46296</td> + <td class=xl2415598>b4d8</td> + <td class=xl2315598 align=right x:num="0.62971481140754371" x:fmla="=B14/H14">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>flag0</td> + <td class=xl2415598 x:num>15751</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>12052</td> + <td class=xl2415598 x:num>29307</td> + <td class=xl2515598>727b</td> + <td class=xl2415598>flag0</td> + <td class=xl2415598 x:num>25236</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>16968</td> + <td class=xl2415598 x:num>42896</td> + <td class=xl2415598>a790</td> + <td class=xl2315598 align=right x:num="0.62414804247899824" x:fmla="=B15/H15">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>flag1</td> + <td class=xl2415598 x:num>19145</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>15624</td> + <td class=xl2415598 x:num>36281</td> + <td class=xl2515598>8db9</td> + <td class=xl2415598>flag1</td> + <td class=xl2415598 x:num>29532</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>24668</td> + <td class=xl2415598 x:num>54900</td> + <td class=xl2415598>d674</td> + <td class=xl2315598 align=right x:num="0.64827983204659356" x:fmla="=B16/H16">65 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>fptest</td> + <td class=xl2415598 x:num>20053</td> + <td class=xl2415598 x:num>1516</td> + <td class=xl2415598 x:num>102908</td> + <td class=xl2415598 x:num>124477</td> + <td class=xl2515598>1e63d</td> + <td class=xl2415598>fptest</td> + <td class=xl2415598 x:num>29508</td> + <td class=xl2415598 x:num>704</td> + <td class=xl2415598 x:num>109652</td> + <td class=xl2415598 x:num>139864</td> + <td class=xl2415598 x:num>22258</td> + <td class=xl2315598 align=right x:num="0.67957841941168495" x:fmla="=B17/H17">68 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>intr0</td> + <td class=xl2415598 x:num>15998</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12092</td> + <td class=xl2415598 x:num>29586</td> + <td class=xl2515598 x:num>7392</td> + <td class=xl2415598>intr0</td> + <td class=xl2415598 x:num>25932</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>17016</td> + <td class=xl2415598 x:num>43632</td> + <td class=xl2415598>aa70</td> + <td class=xl2315598 align=right x:num="0.6169211784667592" x:fmla="=B18/H18">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kalarm0</td> + <td class=xl2415598 x:num>16080</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12200</td> + <td class=xl2415598 x:num>29776</td> + <td class=xl2515598 x:num>7450</td> + <td class=xl2415598>kalarm0</td> + <td class=xl2415598 x:num>25824</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>17112</td> + <td class=xl2415598 x:num>43620</td> + <td class=xl2415598>aa64</td> + <td class=xl2315598 align=right x:num="0.62267657992565051" x:fmla="=B19/H19">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kcache1</td> + <td class=xl2415598 x:num>15327</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12036</td> + <td class=xl2415598 x:num>28859</td> + <td class=xl2515598>70bb</td> + <td class=xl2415598>kcache1</td> + <td class=xl2415598 x:num>24728</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>16956</td> + <td class=xl2415598 x:num>42368</td> + <td class=xl2415598>a580</td> + <td class=xl2315598 align=right x:num="0.61982368165642188" x:fmla="=B20/H20">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kcache2</td> + <td class=xl2415598 x:num>15549</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>13224</td> + <td class=xl2415598 x:num>30269</td> + <td class=xl2515598>763d</td> + <td class=xl2415598>kcache2</td> + <td class=xl2415598 x:num>25168</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>19512</td> + <td class=xl2415598 x:num>45364</td> + <td class=xl2415598>b134</td> + <td class=xl2315598 align=right x:num="0.61780832803560082" x:fmla="=B21/H21">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kclock0</td> + <td class=xl2415598 x:num>18291</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>12260</td> + <td class=xl2415598 x:num>32051</td> + <td class=xl2515598>7d33</td> + <td class=xl2415598>kclock0</td> + <td class=xl2415598 x:num>28112</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>17168</td> + <td class=xl2415598 x:num>45968</td> + <td class=xl2415598>b390</td> + <td class=xl2315598 align=right x:num="0.65064741035856577" x:fmla="=B22/H22">65 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kclock1</td> + <td class=xl2415598 x:num>16231</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>13232</td> + <td class=xl2415598 x:num>30963</td> + <td class=xl2515598>78f3</td> + <td class=xl2415598>kclock1</td> + <td class=xl2415598 x:num>25976</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>19524</td> + <td class=xl2415598 x:num>46188</td> + <td class=xl2415598>b46c</td> + <td class=xl2315598 align=right x:num="0.6248460117031106" x:fmla="=B23/H23">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kexcept1</td> + <td class=xl2415598 x:num>16572</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>13228</td> + <td class=xl2415598 x:num>31296</td> + <td class=xl2515598>7a40</td> + <td class=xl2415598>kexcept1</td> + <td class=xl2415598 x:num>26372</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>19512</td> + <td class=xl2415598 x:num>46568</td> + <td class=xl2415598>b5e8</td> + <td class=xl2315598 align=right x:num="0.62839375094797512" x:fmla="=B24/H24">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kflag0</td> + <td class=xl2415598 x:num>15618</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12060</td> + <td class=xl2415598 x:num>29174</td> + <td class=xl2515598>71f6</td> + <td class=xl2415598>kflag0</td> + <td class=xl2415598 x:num>25140</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>16968</td> + <td class=xl2415598 x:num>42792</td> + <td class=xl2415598>a728</td> + <td class=xl2315598 align=right x:num="0.62124105011933173" x:fmla="=B25/H25">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kflag1</td> + <td class=xl2415598 x:num>19287</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>15624</td> + <td class=xl2415598 x:num>36411</td> + <td class=xl2515598>8e3b</td> + <td class=xl2415598>kflag1</td> + <td class=xl2415598 x:num>29824</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>24660</td> + <td class=xl2415598 x:num>55172</td> + <td class=xl2415598>d784</td> + <td class=xl2315598 align=right x:num="0.64669393776824036" x:fmla="=B26/H26">65 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kill</td> + <td class=xl2415598 x:num>16887</td> + <td class=xl2415598 x:num>1516</td> + <td class=xl2415598 x:num>15628</td> + <td class=xl2415598 x:num>34031</td> + <td class=xl2515598>84ef</td> + <td class=xl2415598>kill</td> + <td class=xl2415598 x:num>26896</td> + <td class=xl2415598 x:num>704</td> + <td class=xl2415598 x:num>24656</td> + <td class=xl2415598 x:num>52256</td> + <td class=xl2415598>cc20</td> + <td class=xl2315598 align=right x:num="0.62786287923854844" x:fmla="=B27/H27">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kintr0</td> + <td class=xl2415598 x:num>16186</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12128</td> + <td class=xl2415598 x:num>29810</td> + <td class=xl2515598 x:num>7472</td> + <td class=xl2415598>kintr0</td> + <td class=xl2415598 x:num>26088</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>17028</td> + <td class=xl2415598 x:num>43800</td> + <td class=xl2415598>ab18</td> + <td class=xl2315598 align=right x:num="0.62043851579270159" x:fmla="=B28/H28">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>klock</td> + <td class=xl2415598 x:num>19724</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>14516</td> + <td class=xl2415598 x:num>35744</td> + <td class=xl2515598>8ba0</td> + <td class=xl2415598>klock</td> + <td class=xl2415598 x:num>30812</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>22176</td> + <td class=xl2415598 x:num>53680</td> + <td class=xl2415598>d1b0</td> + <td class=xl2315598 align=right x:num="0.64014020511489034" x:fmla="=B29/H29">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kmbox1</td> + <td class=xl2415598 x:num>18283</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>14592</td> + <td class=xl2415598 x:num>34375</td> + <td class=xl2515598 x:num>8647</td> + <td class=xl2415598>kmbox1</td> + <td class=xl2415598 x:num>28504</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>22260</td> + <td class=xl2415598 x:num>51452</td> + <td class=xl2415598>c8fc</td> + <td class=xl2315598 align=right x:num="0.6414187482458602" x:fmla="=B30/H30">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kmutex0</td> + <td class=xl2415598 x:num>15539</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12064</td> + <td class=xl2415598 x:num>29099</td> + <td class=xl2515598>71ab</td> + <td class=xl2415598>kmutex0</td> + <td class=xl2415598 x:num>24984</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>16984</td> + <td class=xl2415598 x:num>42652</td> + <td class=xl2415598>a69c</td> + <td class=xl2315598 align=right x:num="0.62195805315401853" x:fmla="=B31/H31">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kmutex1</td> + <td class=xl2415598 x:num>16524</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>15664</td> + <td class=xl2415598 x:num>33692</td> + <td class=xl2515598>839c</td> + <td class=xl2415598>kmutex1</td> + <td class=xl2415598 x:num>26504</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>24704</td> + <td class=xl2415598 x:num>51900</td> + <td class=xl2415598>cabc</td> + <td class=xl2315598 align=right x:num="0.62345306368849984" x:fmla="=B32/H32">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kmutex3</td> + <td class=xl2415598 x:num>18272</td> + <td class=xl2415598 x:num>1712</td> + <td class=xl2415598 x:num>20348</td> + <td class=xl2415598 x:num>40332</td> + <td class=xl2515598>9d8c</td> + <td class=xl2415598>kmutex3</td> + <td class=xl2415598 x:num>28792</td> + <td class=xl2415598 x:num>900</td> + <td class=xl2415598 x:num>34892</td> + <td class=xl2415598 x:num>64584</td> + <td class=xl2415598>fc48</td> + <td class=xl2315598 align=right x:num="0.63462072797999447" x:fmla="=B33/H33">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kmutex4</td> + <td class=xl2415598 x:num>18682</td> + <td class=xl2415598 x:num>1608</td> + <td class=xl2415598 x:num>20352</td> + <td class=xl2415598 x:num>40642</td> + <td class=xl2515598>9ec2</td> + <td class=xl2415598>kmutex4</td> + <td class=xl2415598 x:num>29264</td> + <td class=xl2415598 x:num>796</td> + <td class=xl2415598 x:num>34896</td> + <td class=xl2415598 x:num>64956</td> + <td class=xl2415598>fdbc</td> + <td class=xl2315598 align=right x:num="0.63839529797703665" x:fmla="=B34/H34">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>ksched1</td> + <td class=xl2415598 x:num>15619</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>14412</td> + <td class=xl2415598 x:num>31527</td> + <td class=xl2515598>7b27</td> + <td class=xl2415598>ksched1</td> + <td class=xl2415598 x:num>25240</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>22084</td> + <td class=xl2415598 x:num>48008</td> + <td class=xl2415598>bb88</td> + <td class=xl2315598 align=right x:num="0.61881933438985737" x:fmla="=B35/H35">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>ksem0</td> + <td class=xl2415598 x:num>15567</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>12060</td> + <td class=xl2415598 x:num>29123</td> + <td class=xl2515598>71c3</td> + <td class=xl2415598>ksem0</td> + <td class=xl2415598 x:num>25044</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>16968</td> + <td class=xl2415598 x:num>42696</td> + <td class=xl2415598>a6c8</td> + <td class=xl2315598 align=right x:num="0.62158600862482027" x:fmla="=B36/H36">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>ksem1</td> + <td class=xl2415598 x:num>17063</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>14436</td> + <td class=xl2415598 x:num>32999</td> + <td class=xl2515598 x:num="800000000">8E+08</td> + <td class=xl2415598>ksem1</td> + <td class=xl2415598 x:num>26988</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>22100</td> + <td class=xl2415598 x:num>49776</td> + <td class=xl2415598>c270</td> + <td class=xl2315598 align=right x:num="0.63224396027864238" x:fmla="=B37/H37">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kthread0</td> + <td class=xl2415598 x:num>15504</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>13228</td> + <td class=xl2415598 x:num>30228</td> + <td class=xl2515598 x:num>7614</td> + <td class=xl2415598>kthread0</td> + <td class=xl2415598 x:num>25028</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>19512</td> + <td class=xl2415598 x:num>45224</td> + <td class=xl2415598>b0a8</td> + <td class=xl2315598 align=right x:num="0.61946619785839863" x:fmla="=B38/H38">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>kthread1</td> + <td class=xl2415598 x:num>16167</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>14412</td> + <td class=xl2415598 x:num>32075</td> + <td class=xl2515598>7d4b</td> + <td class=xl2415598>kthread1</td> + <td class=xl2415598 x:num>25996</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>22080</td> + <td class=xl2415598 x:num>48760</td> + <td class=xl2415598>be78</td> + <td class=xl2315598 align=right x:num="0.62190336974919214" x:fmla="=B39/H39">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>mbox1</td> + <td class=xl2415598 x:num>18281</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>14580</td> + <td class=xl2415598 x:num>34373</td> + <td class=xl2515598 x:num>8645</td> + <td class=xl2415598>mbox1</td> + <td class=xl2415598 x:num>28552</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>22252</td> + <td class=xl2415598 x:num>51504</td> + <td class=xl2415598>c930</td> + <td class=xl2315598 align=right x:num="0.64027038386102553" x:fmla="=B40/H40">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>mqueue1</td> + <td class=xl2415598 x:num>20611</td> + <td class=xl2415598 x:num>1508</td> + <td class=xl2415598 x:num>14940</td> + <td class=xl2415598 x:num>37059</td> + <td class=xl2515598>90c3</td> + <td class=xl2415598>mqueue1</td> + <td class=xl2415598 x:num>31324</td> + <td class=xl2415598 x:num>696</td> + <td class=xl2415598 x:num>22612</td> + <td class=xl2415598 x:num>54632</td> + <td class=xl2415598>d568</td> + <td class=xl2315598 align=right x:num="0.65799387051462133" x:fmla="=B41/H41">66 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>mutex0</td> + <td class=xl2415598 x:num>15672</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>12064</td> + <td class=xl2415598 x:num>29240</td> + <td class=xl2515598 x:num>7238</td> + <td class=xl2415598>mutex0</td> + <td class=xl2415598 x:num>25108</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>16980</td> + <td class=xl2415598 x:num>42780</td> + <td class=xl2415598>a71c</td> + <td class=xl2315598 align=right x:num="0.62418352716265735" x:fmla="=B42/H42">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>mutex1</td> + <td class=xl2415598 x:num>16678</td> + <td class=xl2415598 x:num>1516</td> + <td class=xl2415598 x:num>15664</td> + <td class=xl2415598 x:num>33858</td> + <td class=xl2515598 x:num>8442</td> + <td class=xl2415598>mutex1</td> + <td class=xl2415598 x:num>26464</td> + <td class=xl2415598 x:num>704</td> + <td class=xl2415598 x:num>24700</td> + <td class=xl2415598 x:num>51868</td> + <td class=xl2415598>ca9c</td> + <td class=xl2315598 align=right x:num="0.63021463119709797" x:fmla="=B43/H43">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>mutex2</td> + <td class=xl2415598 x:num>17694</td> + <td class=xl2415598 x:num>1508</td> + <td class=xl2415598 x:num>16868</td> + <td class=xl2415598 x:num>36070</td> + <td class=xl2515598>8ce6</td> + <td class=xl2415598>mutex2</td> + <td class=xl2415598 x:num>27624</td> + <td class=xl2415598 x:num>696</td> + <td class=xl2415598 x:num>27280</td> + <td class=xl2415598 x:num>55600</td> + <td class=xl2415598>d930</td> + <td class=xl2315598 align=right x:num="0.6405299739357081" x:fmla="=B44/H44">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>mutex3</td> + <td class=xl2415598 x:num>18203</td> + <td class=xl2415598 x:num>1720</td> + <td class=xl2415598 x:num>20344</td> + <td class=xl2415598 x:num>40267</td> + <td class=xl2515598>9d4b</td> + <td class=xl2415598>mutex3</td> + <td class=xl2415598 x:num>28596</td> + <td class=xl2415598 x:num>908</td> + <td class=xl2415598 x:num>34884</td> + <td class=xl2415598 x:num>64388</td> + <td class=xl2415598>fb84</td> + <td class=xl2315598 align=right x:num="0.63655756049797174" x:fmla="=B45/H45">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>release</td> + <td class=xl2415598 x:num>16352</td> + <td class=xl2415598 x:num>1508</td> + <td class=xl2415598 x:num>14428</td> + <td class=xl2415598 x:num>32288</td> + <td class=xl2515598 x:num="7E+20">7E+20</td> + <td class=xl2415598>release</td> + <td class=xl2415598 x:num>26156</td> + <td class=xl2415598 x:num>696</td> + <td class=xl2415598 x:num>22100</td> + <td class=xl2415598 x:num>48952</td> + <td class=xl2415598>bf38</td> + <td class=xl2315598 align=right x:num="0.62517204465514609" x:fmla="=B46/H46">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>sched1</td> + <td class=xl2415598 x:num>15890</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>14412</td> + <td class=xl2415598 x:num>31802</td> + <td class=xl2515598>7c3a</td> + <td class=xl2415598>sched1</td> + <td class=xl2415598 x:num>25460</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>22084</td> + <td class=xl2415598 x:num>48232</td> + <td class=xl2415598>bc68</td> + <td class=xl2315598 align=right x:num="0.62411626080125693" x:fmla="=B47/H47">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>stress_thr<span + style='display:none'>eads</span></td> + <td class=xl2415598 x:num>44196</td> + <td class=xl2415598 x:num>1612</td> + <td class=xl2415598 x:num>286332</td> + <td class=xl2415598 x:num>332140</td> + <td class=xl2515598>5116c</td> + <td class=xl2415598>stress_threads</td> + <td class=xl2415598 x:num>56356</td> + <td class=xl2415598 x:num>828</td> + <td class=xl2415598 x:num>45892</td> + <td class=xl2415598 x:num>103076</td> + <td class=xl2415598>192a4</td> + <td class=xl2315598 align=right x:num="0.78422883100291008" x:fmla="=B48/H48">78 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>sync2</td> + <td class=xl2415598 x:num>17891</td> + <td class=xl2415598 x:num>1524</td> + <td class=xl2415598 x:num>16864</td> + <td class=xl2415598 x:num>36279</td> + <td class=xl2515598>8db7</td> + <td class=xl2415598>sync2</td> + <td class=xl2415598 x:num>27900</td> + <td class=xl2415598 x:num>712</td> + <td class=xl2415598 x:num>27288</td> + <td class=xl2415598 x:num>55900</td> + <td class=xl2415598>da5c</td> + <td class=xl2315598 align=right x:num="0.64125448028673837" x:fmla="=B49/H49">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>sync3</td> + <td class=xl2415598 x:num>16943</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>15644</td> + <td class=xl2415598 x:num>34099</td> + <td class=xl2515598 x:num>8533</td> + <td class=xl2415598>sync3</td> + <td class=xl2415598 x:num>26760</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>24692</td> + <td class=xl2415598 x:num>52152</td> + <td class=xl2415598>cbb8</td> + <td class=xl2315598 align=right x:num="0.63314648729446932" x:fmla="=B50/H50">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>thread0</td> + <td class=xl2415598 x:num>15467</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>13064</td> + <td class=xl2415598 x:num>30027</td> + <td class=xl2515598>754b</td> + <td class=xl2415598>thread0</td> + <td class=xl2415598 x:num>24924</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>19356</td> + <td class=xl2415598 x:num>44964</td> + <td class=xl2415598>afa4</td> + <td class=xl2315598 align=right x:num="0.6205665222275718" x:fmla="=B51/H51">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>thread1</td> + <td class=xl2415598 x:num>16134</td> + <td class=xl2415598 x:num>1496</td> + <td class=xl2415598 x:num>14420</td> + <td class=xl2415598 x:num>32050</td> + <td class=xl2515598>7d32</td> + <td class=xl2415598>thread1</td> + <td class=xl2415598 x:num>25868</td> + <td class=xl2415598 x:num>684</td> + <td class=xl2415598 x:num>22084</td> + <td class=xl2415598 x:num>48636</td> + <td class=xl2415598>bdfc</td> + <td class=xl2315598 align=right x:num="0.62370496366166694" x:fmla="=B52/H52">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>thread2</td> + <td class=xl2415598 x:num>17560</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>15636</td> + <td class=xl2415598 x:num>34708</td> + <td class=xl2515598 x:num>8794</td> + <td class=xl2415598>thread2</td> + <td class=xl2415598 x:num>27452</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>24680</td> + <td class=xl2415598 x:num>52832</td> + <td class=xl2415598>ce60</td> + <td class=xl2315598 align=right x:num="0.63966195541308468" x:fmla="=B53/H53">64 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>thread_gdb</td> + <td class=xl2415598 x:num>16279</td> + <td class=xl2415598 x:num>1500</td> + <td class=xl2415598 x:num>24028</td> + <td class=xl2415598 x:num>41807</td> + <td class=xl2515598>a34f</td> + <td class=xl2415598>thread_gdb</td> + <td class=xl2415598 x:num>26136</td> + <td class=xl2415598 x:num>688</td> + <td class=xl2415598 x:num>42704</td> + <td class=xl2415598 x:num>69528</td> + <td class=xl2415598>10f98</td> + <td class=xl2315598 align=right x:num="0.62285736149372517" x:fmla="=B54/H54">62 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>timeslice</td> + <td class=xl2415598 x:num>17051</td> + <td class=xl2415598 x:num>1504</td> + <td class=xl2415598 x:num>20376</td> + <td class=xl2415598 x:num>38931</td> + <td class=xl2515598 x:num>9813</td> + <td class=xl2415598>timeslice</td> + <td class=xl2415598 x:num>27212</td> + <td class=xl2415598 x:num>692</td> + <td class=xl2415598 x:num>34916</td> + <td class=xl2415598 x:num>62820</td> + <td class=xl2415598>f564</td> + <td class=xl2315598 align=right x:num="0.62659855945906218" x:fmla="=B55/H55">63 + %</td> + </tr> + <tr height=17 style='height:12.75pt'> + <td height=17 class=xl1515598 style='height:12.75pt'>tm_basic</td> + <td class=xl2415598 x:num>37313</td> + <td class=xl2415598 x:num>1512</td> + <td class=xl2415598 x:num>422380</td> + <td class=xl2415598 x:num>461205</td> + <td class=xl2515598 x:num>70995</td> + <td class=xl2415598>tm_basic</td> + <td class=xl2415598 x:num>52728</td> + <td class=xl2415598 x:num>700</td> + <td class=xl2415598 x:num>123332</td> + <td class=xl2415598 x:num>176760</td> + <td class=xl2415598>2b278</td> + <td class=xl2315598 align=right x:num="0.70765058412987403" x:fmla="=B56/H56">71 + %</td> + </tr> + <![if supportMisalignedColumns]> + <tr height=0 style='display:none'> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=62 style='width:47pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=64 style='width:48pt'></td> + <td width=117 style='width:88pt'></td> + </tr> + <![endif]> +</table> + +</div> + + +<!-----------------------------> +<!--END OF OUTPUT FROM EXCEL PUBLISH AS WEB PAGE WIZARD--> +<!-----------------------------> +</body> + +</html> diff --git a/zpu/roadshow/roadshow/ecos/repository.tar.bz2 b/zpu/roadshow/roadshow/ecos/repository.tar.bz2 Binary files differnew file mode 100644 index 0000000..bc6291f --- /dev/null +++ b/zpu/roadshow/roadshow/ecos/repository.tar.bz2 diff --git a/zpu/roadshow/roadshow/games/.cvsignore b/zpu/roadshow/roadshow/games/.cvsignore new file mode 100644 index 0000000..6c50257 --- /dev/null +++ b/zpu/roadshow/roadshow/games/.cvsignore @@ -0,0 +1,5 @@ +summeria_arm.elf +sumeria_zpu.elf +eliza_arm.elf +sumeria.elf +eliza_zpu.elf diff --git a/zpu/roadshow/roadshow/games/build.sh b/zpu/roadshow/roadshow/games/build.sh new file mode 100644 index 0000000..ea661df --- /dev/null +++ b/zpu/roadshow/roadshow/games/build.sh @@ -0,0 +1,7 @@ +zpu-elf-gcc -Os -phi sumeria.c -o sumeria.elf -Wl,--relax -Wl,--gc-sections -lm -g +zpu-elf-objcopy -O binary sumeria.elf sumeria.bin +sh ../build/makefirmware.sh sumeria.bin sumeria.zpu +zpu-elf-gcc -Os -phi eliza/*.c -o eliza.elf -Wl,--relax -Wl,--gc-sections -lm -g +zpu-elf-objcopy -O binary eliza.elf eliza.bin +sh ../build/makefirmware.sh eliza.bin eliza.zpu + diff --git a/zpu/roadshow/roadshow/games/eliza.bin b/zpu/roadshow/roadshow/games/eliza.bin Binary files differnew file mode 100644 index 0000000..6d5a6c3 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza.bin diff --git a/zpu/roadshow/roadshow/games/eliza.elf b/zpu/roadshow/roadshow/games/eliza.elf Binary files differnew file mode 100644 index 0000000..bfbbab7 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza.elf diff --git a/zpu/roadshow/roadshow/games/eliza.zpu b/zpu/roadshow/roadshow/games/eliza.zpu Binary files differnew file mode 100644 index 0000000..d916270 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza.zpu diff --git a/zpu/roadshow/roadshow/games/eliza/eliza.c b/zpu/roadshow/roadshow/games/eliza/eliza.c new file mode 100644 index 0000000..06f89ee --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza/eliza.c @@ -0,0 +1,269 @@ +/*
+Copyright (C) 1988-2003 by Mohan Embar
+
+http://www.thisiscool.com/
+DISCLAIMER: This was written in 1988. I don't code like this anymore!
+
+This program is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free Software
+Foundation; either version 2 of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License along with
+this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave,
+Cambridge, MA 02139, USA.
+*/
+
+#include <stdio.h>
+#include "parse.h"
+#include "response.h"
+
+typedef char WORD[40];
+typedef WORD SENTENCE[200];
+
+int numwords;
+SENTENCE s;
+WORD fam_member; /* If mentioned a member of family, save for later. */
+int fam;
+
+main() {
+ int x, y, loop = 1, fact = 0;
+ char instring[200], outstring[200], sub[200], vrb[200], rst[200], qwd[200];
+ char osub[200], ovrb[200], orst[200];
+ fam = 0;
+ printf("Hello there. My name is Eliza and I was written by Mohan Embar.\n");
+ printf("Please type \"END\" to end this session.\n");
+ printf("I'm here to help you if I can. What seems to be the trouble?\n");
+ while (loop) {
+ printf("\n");
+ gets(instring);
+ printf("\n");
+ parse(instring);
+ if (numwords == 0) {
+ switch (x = randnum(2)) {
+ case 1 : printf("Don't you have anything to say?\n");
+ break;
+ case 2 : printf("Cat got your tongue?\n");
+ break;
+ }
+ continue;
+ }
+ if (!strcmp(s[1],"END")) {
+ printf("Goodbye. Please come again.\n");
+ break;
+ }
+ agree();
+ if (bad_word())
+ printf(b_word_resp());
+ else if (naughty_word())
+ printf(n_word_resp());
+ else if (x = family()) {
+ fam = x;
+ printf(fam_resp());
+ strcpy(fam_member,s[fam]);
+ }
+ else if (sword("ALIKE",1))
+ printf(alike_resp());
+ else if (sword("ALWAYS",1))
+ printf(always_resp());
+ else if (sword("BECAUSE",1))
+ printf(because_resp());
+ else if (sword("YES",1))
+ printf(yes_resp());
+ else if (sword("NO",1) || sword("NOT",1))
+ printf(neg_resp());
+ else if (x = i_am()) { /* If occurrence of I AM x.. */
+ get_til_stop(x,outstring); /* Get I AM x .. into outstring */
+ printf(i_am_resp(),outstring); /* Print reponse for this */
+ }
+ else if (real_quest() ||
+ (is_helper(s[1]) && is_sub_pronoun(s[2])) ||
+ sub_and_helper()) {
+ if (real_quest()) {
+ strcpy(qwd,s[1]);
+ strcpy(vrb,s[2]);
+ strcpy(sub,s[3]);
+ get_til_stop(4,rst);
+ }
+ else if (is_helper(s[1]) && is_sub_pronoun(s[2])) {
+ strcpy(vrb,s[1]);
+ strcpy(sub,s[2]);
+ get_til_stop(3,rst);
+ strcpy(qwd,"YES");
+ }
+ else if (sub_and_helper()) {
+ x = find_helper();
+ y = search_back_sub(x);
+ strcpy(vrb,s[x]);
+ get_til_stop(x+1,rst);
+ getrange(y,x-1,sub);
+ strcpy(qwd,"NO");
+ }
+ make_lower(qwd);
+ if (strcmp(sub,"I")) make_lower(sub);
+ make_lower(vrb);
+ make_lower(rst);
+ /* First do x verb y responses */
+
+ /*
+ printf("\n*** %s\n",sub);
+ */
+
+ if (!strcmp(sub," I") || !strcmp(sub,"I")) {
+ printf(you_resp());
+ }
+ else if (!strcmp(qwd,"no")) {
+ /* Record this statement for later use. */
+ fact = 1;
+ strcpy(osub,sub); strcpy(ovrb,vrb); strcpy(orst,rst);
+ if (is_be(vrb) && !strcmp(sub," you") && (y = sad_word())) {
+ getrange(y,y,outstring);
+ x = randnum(5)+6;
+ }
+ else if (is_be(vrb) && (y = sad_word())) {
+ getrange(y,y,outstring);
+ x = randnum(2)+11;
+ }
+ else if (is_be(vrb))
+ x = randnum(6);
+ else x = randnum(4);
+ switch (x) {
+ case 1 : printf("How do you feel about%s?\n",cnnv(sub));
+ break;
+ case 2 : printf("Why %s%s%s?\n",vrb,sub,rst);
+ break;
+ case 3 : for (y=1;sub[y]=sub[y--];y=y+2);
+ sub[0] = toupper(sub[0]);
+ printf("%s %s%s?\n",sub,vrb,rst);
+ break;
+ case 4 : printf("Could you describe%s for me?\n",cnnv(sub));
+ break;
+ case 5 : printf("What if%s were not%s?\n",sub,rst);
+ break;
+ case 6 : printf("Would you be happy if%s were not%s?\n",sub,
+ rst);
+ break;
+ case 7 : printf("I'm sorry to hear that you are%s.\n",outstring);
+ break;
+ case 8 : printf("Do you think that coming here will help you not to be%s?\n",outstring);
+ break;
+ case 9 : printf("Let's talk about why you feel%s.\n",outstring);
+ break;
+ case 10 : printf("What happened that made you feel%s?\n",outstring);
+ break;
+ case 11 : printf("What could be the reason for your feeling%s?\n",outstring);
+ break;
+ case 12 : printf("What could cause%s to be%s?\n",cnnv(sub),outstring);
+ break;
+ case 13 : printf("If%s came here, would it help%s not to be%s?\n",sub,cnnv(sub),outstring);
+ break;
+ }
+ }
+ else if (!strcmp(sub,"you"))
+ printf(you_know());
+ else if (!strcmp(qwd,"yes")) {
+ x = randnum(8);
+ switch (x) {
+ case 1 : printf("You want to know if %s %s%s.\n",sub,vrb,rst);
+ break;
+ case 2 : printf("If %s %s%s, does that concern you?\n",sub,vrb,rst);
+ break;
+ case 3 : printf("What are the consequences if %s %s%s?\n",sub,vrb,rst);
+ break;
+ case 4 : printf("Why does %s concern you?\n",sub);
+ break;
+ case 5 : printf("Why are you thinking of %s?\n",cnnv(sub));
+ break;
+ case 6 : printf("Tell me more about %s.\n",cnnv(sub));
+ break;
+ case 7 : printf("To answer that, I'd need to know more about %s.\n",cnnv(sub));
+ break;
+ case 8 : printf("What is the relationship between you and %s?\n",cnnv(sub));
+ break;
+ case 9 : printf("Why don't you ask %s?\n",cnnv(sub));
+ break;
+ }
+ }
+ else {
+ x = randnum(8);
+ switch (x) {
+ case 1 : printf("You want to know %s %s %s%s.\n",qwd,sub,vrb,rst);
+ break;
+ case 2 : printf("If %s %s%s, does that concern you?\n",sub,vrb,rst);
+ break;
+ case 3 : printf("What are the consequences if %s %s%s?\n",sub,vrb,rst);
+ break;
+ case 4 : printf("Why does %s concern you?\n",sub);
+ break;
+ case 5 : printf("Why are you thinking of %s?\n",cnnv(sub));
+ break;
+ case 6 : printf("Tell me more about %s.\n",cnnv(sub));
+ break;
+ case 7 : printf("To answer that, I'd need to know more about %s.\n",cnnv(sub));
+ break;
+ case 8 : printf("What is the relationship between you and %s?\n",cnnv(sub));
+ break;
+ case 9 : printf("Why don't you ask %s?\n",cnnv(sub));
+ break;
+ }
+ }
+ }
+ else if (is_command())
+ printf(command_resp());
+ else if (vague_quest())
+ printf(question());
+ else if ((s[numwords][0] == '?') && !real_quest())
+ printf(question());
+ else if (x = sad_word()) {
+ getrange(x,x,outstring);
+ for (y=1;outstring[y]=outstring[y--];y=y+2);
+ outstring[0] = toupper(outstring[0]);
+ printf("%s?\n",outstring);
+ }
+ else if (x = can_spit_out()) {
+ if (x<=(numwords-2) && is_sub_pronoun(s[x])
+ && (matches("NEED",s[x+1]) ||
+ matches("WANT",s[x+1]))) {
+ get_til_stop(x+2,outstring);
+ strcpy(sub,s[x]);
+ if (strcmp(sub,"I")) make_lower(sub);
+ if (strcmp(s[x],"I")) make_lower(s[x]);
+ x = randnum(6);
+ switch (x) {
+ case 1 : printf("What would it mean to %s if %s got%s?\n",cnnv2(s[x]),sub,outstring);
+ break;
+ case 2 : printf("Would %s really be happy if %s got%s?\n",sub,sub,outstring);
+ break;
+ case 3 : printf("Why is getting%s so desirable?\n",outstring);
+ break;
+ case 4 : printf("Okay. Suppose %s got%s. Then what?\n",sub,outstring);
+ break;
+ case 5 : printf("Why is this important to %s?\n",cnnv2(sub));
+ break;
+ case 6 : printf("What price would %s pay to achieve this?\n",sub);
+ break;
+ }
+ }
+ else {
+ get_til_stop(x,outstring);
+ outstring[1]=toupper(outstring[1]);
+ printf("%s.\n",outstring+1);
+ }
+ }
+ else if (fam) {
+ make_lower(fam_member);
+ printf(family_resp(),fam_member);
+ fam = 0;
+ }
+ else if (fact && (randnum(5)==3)) {
+ printf(old_fact(),osub,ovrb,orst);
+ fact = 0;
+ }
+ else {
+ printf(go_on());
+ }
+ }
+}
diff --git a/zpu/roadshow/roadshow/games/eliza/parse.c b/zpu/roadshow/roadshow/games/eliza/parse.c new file mode 100644 index 0000000..aba2033 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza/parse.c @@ -0,0 +1,719 @@ +/*
+Copyright (C) 1988-2003 by Mohan Embar
+
+http://www.thisiscool.com/
+DISCLAIMER: This was written in 1988. I don't code like this anymore!
+
+This program is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free Software
+Foundation; either version 2 of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License along with
+this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave,
+Cambridge, MA 02139, USA.
+*/
+
+/* Program defined abstract data type called list. A list contains
+ * character strings each of which has a maximum length of 20 characters.
+ *
+ * Operations supported are:
+ *
+ *
+ */
+typedef char WORD[40];
+typedef WORD SENTENCE[200];
+
+extern int numwords;
+extern SENTENCE s;
+
+/* Returns upper case value of c */
+char upcase(c)
+ char c;
+{
+ if (islower(c)) return toupper(c); else return c;
+}
+
+/* This function converts string1 into lowercase. */
+void make_lower(string1)
+ char *string1;
+{
+ char c;
+ while (c = *string1) *string1++ = tolower(c);
+}
+
+/* Parses words in instring into WORD array s
+ * Automatically translates n't to not, 're to are
+ * Stores all letters in uppercase. Sets numwords to number of tokens in
+ * s. Valid indices are from 1 .. numwords.
+ */
+void parse(instring)
+ char *instring;
+{
+ char c; int i;
+ int read_word = 0;
+ int offset = -1;
+ numwords = 0;
+ while (c = *instring++) {
+ switch(c) {
+ case ' ' :
+ case '\t' :
+ read_word = 0;
+ continue;
+ case ',' :
+ case '?' :
+ case '.' :
+ case ':' :
+ case '"' :
+ s[numwords++][++offset] = '\0';
+ read_word = 0;
+ s[numwords][offset = 0] = c;
+ break;
+ case '\'' :
+ if ((s[numwords][offset] == 'N') && (upcase(*instring) == 'T')) {
+ s[numwords++][offset]='\0';
+ s[numwords][0] = 'N';
+ s[numwords][offset = 1] = 'O';
+ read_word = 1;
+ }
+ else if (upcase(*instring) == 'R') {
+ s[numwords++][++offset] = '\0';
+ s[numwords][offset = 0] = 'A';
+ read_word = 1;
+ }
+ else if (upcase(*instring) == 'V') {
+ s[numwords++][++offset] = '\0';
+ s[numwords][offset = 0] = 'H';
+ s[numwords][++offset] = 'A';
+ read_word = 1;
+ }
+ else if (upcase(*instring) == 'M') {
+ s[numwords++][++offset] = '\0';
+ s[numwords][offset = 0] = 'A';
+ read_word = 1;
+ }
+ else if (upcase(*instring) == 'L') {
+ s[numwords++][++offset] = '\0';
+ s[numwords][offset = 0] = 'W';
+ s[numwords][++offset] = 'I';
+ read_word = 1;
+ }
+ else if (upcase(*instring) == 'S') {
+ s[numwords][offset+1] = '\0';
+ if (!strcmp(s[numwords],"HE") || !strcmp(s[numwords],"SHE")
+ || !strcmp(s[numwords],"IT")) {
+ s[++numwords][offset = 0] = 'I';
+ read_word = 1;
+ }
+ else s[numwords][++offset] = '\'';
+ }
+ break;
+ default :
+ if (isalpha(c))
+ if (read_word) {
+ s[numwords][++offset] = upcase(c);
+ }
+ else {
+ s[numwords++][++offset] = '\0';
+ ++read_word;
+ s[numwords][offset = 0] = upcase(c);
+ }
+ else {
+ read_word = 0;
+ }
+ }
+ }
+ s[numwords][++offset] = '\0';
+ return;
+}
+
+/* Self-explanatory. Used when computer spits back the sentence */
+void agree()
+{
+ int i;
+ for(i=1;i<=numwords;i++) {
+ if (!strcmp(s[i],"I")) {
+ strcpy(s[i],"YOU");
+ }
+ else if (!strcmp(s[i],"YOU")) {
+ strcpy(s[i],"I");
+ }
+ else if (!strcmp(s[i],"YOUR")) {
+ strcpy(s[i],"MY");
+ }
+ else if (!strcmp(s[i],"MY")) {
+ strcpy(s[i],"YOUR");
+ }
+ else if (!strcmp(s[i],"YOU")) {
+ strcpy(s[i],"ME");
+ }
+ else if (!strcmp(s[i],"ME")) {
+ strcpy(s[i],"YOU");
+ }
+ else if (!strcmp(s[i],"MINE")) {
+ strcpy(s[i],"YOURS");
+ }
+ else if (!strcmp(s[i],"YOURS")) {
+ strcpy(s[i],"MINE");
+ }
+ else if (!strcmp(s[i],"WE")) {
+ strcpy(s[i],"YOU");
+ }
+ else if (!strcmp(s[i],"YOURSELF")) {
+ strcpy(s[i],"MYSELF");
+ }
+ else if (!strcmp(s[i],"MYSELF")) {
+ strcpy(s[i],"YOURSELF");
+ }
+ else if (!strcmp(s[i],"OURSELVES")) {
+ strcpy(s[i],"YOURSELVES");
+ }
+ else if (!strcmp(s[i],"OURS")) {
+ strcpy(s[i],"YOURS");
+ }
+ else if (!strcmp(s[i],"OUR")) {
+ strcpy(s[i],"YOUR");
+ }
+ }
+ for (i=1;i<=numwords;i++) {
+ if (!strcmp(s[i],"AM")) {
+ strcpy(s[i],"ARE");
+ }
+ else if ( (!strcmp(s[i],"ARE")) &&
+ (((i>0) && (!strcmp(s[i-1],"I"))) ||
+ ((i<numwords) && (!strcmp(s[i+1],"I"))) ) ) {
+ strcpy(s[i],"AM");
+ }
+ else if ( (!strcmp(s[i],"WERE")) &&
+ (((i>0) && (!strcmp(s[i-1],"I"))) ||
+ ((i<numwords) && (!strcmp(s[i+1],"I"))) ) ) {
+ strcpy(s[i],"WAS");
+ }
+ else if ( (!strcmp(s[i],"WAS")) &&
+ (((i>0) && (!strcmp(s[i-1],"YOU"))) ||
+ ((i<numwords) && (!strcmp(s[i+1],"YOU"))) ) ) {
+ strcpy(s[i],"WERE");
+ }
+ }
+}
+
+/* Returns 1 if string1 matches first length(string1) characters of string2
+ * and 0 if not.
+ */
+int matches(string1, string2)
+ char *string1, *string2;
+{
+ int c;
+ if (strlen(string1)>strlen(string2))
+ return 0;
+ else { /* length(string1)<=length(string2) */
+ while (c = *string1++) {
+ if (c != *string2++) return 0;
+ }
+ return 1;
+ }
+}
+
+/* Search WORD array s for search_string. If exact = 1, enforce exact match.
+ * Otherwise, return positive match if all characters of search_string match
+ * the first length(search_string) characters of a WORD in s. Assumes legal
+ * values for exact are 0 or 1. Returns index of match in s if match, 0 if
+ * no match.
+ */
+int sword(s_string, exact)
+ char *s_string;
+ int exact;
+{
+ int i;
+ for (i=1;i<=numwords;i++) {
+ if (exact) {
+ if (!strcmp(s_string,s[i])) return i;
+ }
+ else {
+ if (matches(s_string,s[i])) return i;
+ }
+ }
+ /* No match */
+ return 0;
+}
+
+int bad_word()
+{
+ if (sword("\115\117\124\110\105\122\106\125\103\113",0))
+ return 1;
+ else if (sword("\106\125\103\113",0))
+ return 1;
+ else if (sword("\123\110\111\124",0))
+ return 1;
+ else if (sword("\101\123\123\110\117\114\105",1))
+ return 1;
+ else if (sword("\101\123\123",1))
+ return 1;
+ else return 0;
+}
+
+int naughty_word()
+{
+ if (sword("DAMN",0))
+ return 1;
+ else if (sword("STUPID",0))
+ return 1;
+ else if (sword("IDIOT",0))
+ return 1;
+ else if (sword("MORON",0))
+ return 1;
+ else if (sword("NUMBSKULL",0))
+ return 1;
+ else if (sword("IMBECILE",0))
+ return 1;
+ else if (sword("OBNOXIOUS",0))
+ return 1;
+ else return 0;
+}
+
+/* Return the index to a form of be or helping verb, if one exists
+ * Otherwise, return 0.
+ */
+int find_helper()
+{
+ int x;
+ if (x = sword("AM",1))
+ return x;
+ else if (x = sword("IS",1))
+ return x;
+ else if (x = sword("ARE",1))
+ return x;
+ else if (x = sword("WAS",1))
+ return x;
+ else if (x = sword("WERE",1))
+ return x;
+ else if (x = sword("WILL",1))
+ return x;
+ else if (x = sword("DO",1))
+ return x;
+ else if (x = sword("DID",1))
+ return x;
+ else if (x = sword("DOES",1))
+ return x;
+ else if (x = sword("HAVE",1))
+ return x;
+ else if (x = sword("HAD",1))
+ return x;
+ else if (x = sword("HAS",1))
+ return x;
+ else if (x = sword("SHALL",1))
+ return x;
+ else if (x = sword("SHOULD",1))
+ return x;
+ else if (x = sword("CAN",1))
+ return x;
+ else if (x = sword("COULD",1))
+ return x;
+ else if (x = sword("MAY",1))
+ return x;
+ else if (x = sword("MIGHT",1))
+ return x;
+ else return 0;
+}
+
+/* Returns 1 is string1 is pronoun. 0 if not. */
+int is_sub_pronoun(string1)
+ char *string1;
+{
+ if (!strcmp("I",string1))
+ return 1;
+ else if (!strcmp("YOU",string1))
+ return 1;
+ else if (!strcmp("WE",string1))
+ return 1;
+ else if (!strcmp("HE",string1))
+ return 1;
+ else if (!strcmp("SHE",string1))
+ return 1;
+ else if (!strcmp("IT",string1))
+ return 1;
+ else if (!strcmp("THEY",string1))
+ return 1;
+ else return 0;
+}
+
+int is_possesive(string1)
+ char *string1;
+{
+ if (!strcmp("MY",string1))
+ return 1;
+ else if (!strcmp("YOUR",string1))
+ return 1;
+ else if (!strcmp("OUR",string1))
+ return 1;
+ else if (!strcmp("HIS",string1))
+ return 1;
+ else if (!strcmp("HER",string1))
+ return 1;
+ else if (!strcmp("ITS",string1))
+ return 1;
+ else if (!strcmp("THEIR",string1))
+ return 1;
+ else return 0;
+}
+
+int is_article(string1)
+ char *string1;
+{
+ if (!strcmp("A",string1))
+ return 1;
+ else if (!strcmp("AN",string1))
+ return 1;
+ else if (!strcmp("THE",string1))
+ return 1;
+ else return 0;
+}
+
+/* Tries to find reference to a family member */
+int family()
+{
+ int x;
+ if (x = sword("MOTHER",1))
+ return x;
+ else if (x = sword("FATHER",1))
+ return x;
+ else if (x = sword("SISTER",1))
+ return x;
+ else if (x = sword("BROTHER",1))
+ return x;
+ else if (x = sword("DAD",1))
+ return x;
+ else if (x = sword("MOM",1))
+ return x;
+ else if (x = sword("UNCLE",1))
+ return x;
+ else if (x = sword("AUNT",1))
+ return x;
+ else if (x = sword("GRANDMOTHER",1))
+ return x;
+ else if (x = sword("GRANDFATHER",1))
+ return x;
+ else if (x = sword("COUSIN",1))
+ return x;
+ else if (x = sword("GRANDMA",1))
+ return x;
+ else if (x = sword("GRANDPA",1))
+ return x;
+ else return 0;
+}
+
+int i_am()
+{
+ int x, e=1;
+ while (e) {
+ for (x=e;x<=numwords;x++) if (!strcmp("I",s[x])) break;
+ if (x >= numwords)
+ return 0;
+ else if (!strcmp("AM",s[x+1]))
+ return x;
+ else e = ++x;
+ }
+}
+
+void get_til_stop(x,string1)
+ int x;
+ char *string1;
+{
+ char c, *temp;
+ int e = 1; /* Exit test */
+ while (e) {
+ if (x>numwords) {
+ e--;
+ *string1 = '\0';
+ }
+ else if (!isalpha(s[x][0])) {
+ e--;
+ *string1 = '\0';
+ }
+ else if (!strcmp("AND",s[x]) || !strcmp("OR",s[x])
+ || !strcmp("BUT",s[x])) {
+ e--;
+ *string1 = '\0';
+ }
+ else {
+ *string1++ = ' ';
+ if (!strcmp("I",s[x]))
+ *string1++ = 'I';
+ else {
+ temp = s[x];
+ while (c = *temp++) *string1++ = tolower(c);
+ }
+ x++;
+ }
+ }
+ *string1 = '\0';
+}
+
+int sad_word()
+{
+ int x;
+ if (x = sword("DEPRESS",0))
+ return x;
+ else if (x = sword("UNHAPPY",1))
+ return x;
+ else if (x = sword("SAD",1))
+ return x;
+ else if (x = sword("MISERABLE",1))
+ return x;
+ else if (x = sword("AWFUL",1))
+ return x;
+ else if (x = sword("UPSET",1))
+ return x;
+ else if (x = sword("TERRIBLE",1))
+ return x;
+ else return 0;
+}
+
+int search_back_sub(x)
+ int x;
+{
+ int y = --x;
+ while (y) {
+ if (is_possesive(s[y]) || is_sub_pronoun(s[y]) || is_article(s[y]))
+ return y;
+ else
+ y--;
+ }
+ return y;
+}
+
+/* Returns 1 if string is a form of be or helping verb,
+ * Otherwise, returns 0.
+ */
+int is_helper(string1)
+ char *string1;
+{
+ if (!strcmp(string1,"AM"))
+ return 1;
+ else if (!strcmp(string1,"IS"))
+ return 1;
+ else if (!strcmp(string1,"ARE"))
+ return 1;
+ else if (!strcmp(string1,"WAS"))
+ return 1;
+ else if (!strcmp(string1,"WERE"))
+ return 1;
+ else if (!strcmp(string1,"WILL"))
+ return 1;
+ else if (!strcmp(string1,"DO"))
+ return 1;
+ else if (!strcmp(string1,"DID"))
+ return 1;
+ else if (!strcmp(string1,"DOES"))
+ return 1;
+ else if (!strcmp(string1,"HAVE"))
+ return 1;
+ else if (!strcmp(string1,"HAD"))
+ return 1;
+ else if (!strcmp(string1,"HAS"))
+ return 1;
+ else if (!strcmp(string1,"SHALL"))
+ return 1;
+ else if (!strcmp(string1,"SHOULD"))
+ return 1;
+ else if (!strcmp(string1,"CAN"))
+ return 1;
+ else if (!strcmp(string1,"COULD"))
+ return 1;
+ else if (!strcmp(string1,"MAY"))
+ return 1;
+ else if (!strcmp(string1,"MIGHT"))
+ return 1;
+ else if (matches(string1,"FEEL"))
+ return 1;
+ else return 0;
+}
+
+void getrange(y,x,string1)
+ int y, x;
+ char *string1;
+{
+ char c, *temp;
+ while (y<=x) {
+ *string1++ = ' ';
+ if (!strcmp("I",s[y]))
+ *string1++ = 'I';
+ else {
+ temp = s[y];
+ while (c = *temp++) *string1++ = tolower(c);
+ }
+ y++;
+ }
+ *string1 = '\0';
+}
+
+/* Returns 1 if s[1] is a command. 0 if not. */
+int is_command()
+{
+ if (!strcmp("GIVE",s[1]))
+ return 1;
+ else if (!strcmp("TELL",s[1]))
+ return 1;
+ else if (!strcmp("SHOW",s[1]))
+ return 1;
+ else if (!strcmp("EXPLAIN",s[1]))
+ return 1;
+ else return 0;
+}
+
+int four_ws()
+{
+ if (!strcmp(s[1],"WHO"))
+ return 1;
+ else if (!strcmp(s[1],"WHAT"))
+ return 1;
+ else if (!strcmp(s[1],"WHERE"))
+ return 1;
+ else if (!strcmp(s[1],"WHY"))
+ return 1;
+ else if (!strcmp(s[1],"WHEN"))
+ return 1;
+ else if (!strcmp(s[1],"HOW"))
+ return 1;
+ else return 0;
+}
+
+int vague_quest()
+{
+ return (four_ws() && (!is_helper(s[2]) || !is_sub_pronoun(s[3])));
+}
+
+int real_quest()
+{
+ return (four_ws() && is_helper(s[2]) && is_sub_pronoun(s[3]));
+}
+
+int sub_and_helper()
+{
+ int x;
+ return ((x = find_helper()) && search_back_sub(x));
+}
+
+char *cnnv(string1)
+ char *string1;
+{
+ if (!strcmp(string1," i")) {
+ return " myself";
+ }
+ else if (!strcmp(string1," you")) {
+ return " yourself";
+ }
+ else if (!strcmp(string1," we")) {
+ return " ourselves";
+ }
+ else if (!strcmp(string1," he")) {
+ return " him";
+ }
+ else if (!strcmp(string1," she")) {
+ return " her";
+ }
+ else if (!strcmp(string1," it")) {
+ return " it";
+ }
+ else if (!strcmp(string1," they")) {
+ return " them";
+ }
+ if (!strcmp(string1,"i")) {
+ return "myself";
+ }
+ else if (!strcmp(string1,"you")) {
+ return "yourself";
+ }
+ else if (!strcmp(string1,"we")) {
+ return "ourselves";
+ }
+ else if (!strcmp(string1,"he")) {
+ return "him";
+ }
+ else if (!strcmp(string1,"she")) {
+ return "her";
+ }
+ else if (!strcmp(string1,"it")) {
+ return "it";
+ }
+ else if (!strcmp(string1,"they")) {
+ return "them";
+ }
+ else return string1;
+}
+
+int is_be(string1)
+ char *string1;
+{
+ if (!strcmp("am",string1))
+ return 1;
+ else if (!strcmp("is",string1))
+ return 1;
+ else if (!strcmp("are",string1))
+ return 1;
+ else if (!strcmp("was",string1))
+ return 1;
+ else if (!strcmp("were",string1))
+ return 1;
+ else return 0;
+}
+
+int can_spit_out()
+{
+ int x;
+ for (x=1;x<=numwords;x++)
+ if (is_possesive(s[x]) || is_sub_pronoun(s[x]) || is_article(s[x]))
+ return x;
+ return 0;
+}
+
+char *cnnv2(string1)
+ char *string1;
+{
+ if (!strcmp(string1," i")) {
+ return " me";
+ }
+ else if (!strcmp(string1," you")) {
+ return " you";
+ }
+ else if (!strcmp(string1," we")) {
+ return " us";
+ }
+ else if (!strcmp(string1," he")) {
+ return " him";
+ }
+ else if (!strcmp(string1," she")) {
+ return " her";
+ }
+ else if (!strcmp(string1," it")) {
+ return " it";
+ }
+ else if (!strcmp(string1," they")) {
+ return " them";
+ }
+ if (!strcmp(string1,"i")) {
+ return "me";
+ }
+ else if (!strcmp(string1,"you")) {
+ return "you";
+ }
+ else if (!strcmp(string1,"we")) {
+ return "us";
+ }
+ else if (!strcmp(string1,"he")) {
+ return "him";
+ }
+ else if (!strcmp(string1,"she")) {
+ return "her";
+ }
+ else if (!strcmp(string1,"it")) {
+ return "it";
+ }
+ else if (!strcmp(string1,"they")) {
+ return "them";
+ }
+ else return string1;
+}
diff --git a/zpu/roadshow/roadshow/games/eliza/parse.h b/zpu/roadshow/roadshow/games/eliza/parse.h new file mode 100644 index 0000000..62dc353 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza/parse.h @@ -0,0 +1,33 @@ +/*
+Copyright (C) 1988-2003 by Mohan Embar
+
+http://www.thisiscool.com/
+DISCLAIMER: This was written in 1988. I don't code like this anymore!
+
+This program is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free Software
+Foundation; either version 2 of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License along with
+this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave,
+Cambridge, MA 02139, USA.
+*/
+
+extern void parse();
+extern void agree();
+extern int matches();
+extern int sword();
+extern void make_lower();
+extern int i_am();
+extern void get_til_stop();
+extern int sad_word();
+extern int search_back_sub();
+extern int is_helper();
+extern char *cnnv();
+extern int is_be();
+extern int can_spit_out();
+extern char *cnnv2();
diff --git a/zpu/roadshow/roadshow/games/eliza/response.c b/zpu/roadshow/roadshow/games/eliza/response.c new file mode 100644 index 0000000..aa58025 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza/response.c @@ -0,0 +1,365 @@ +/*
+Copyright (C) 1988-2003 by Mohan Embar
+
+http://www.thisiscool.com/
+DISCLAIMER: This was written in 1988. I don't code like this anymore!
+
+This program is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free Software
+Foundation; either version 2 of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License along with
+this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave,
+Cambridge, MA 02139, USA.
+*/
+
+#include <stdio.h>
+#include <math.h>
+
+/* This function returns a random number between 1 and arg */
+int randnum(arg)
+ int arg;
+{
+ return ( (rand() % arg) + 1 );
+}
+
+char *question()
+{
+ int i = randnum(21);
+ switch (i) {
+ case 1 : return "Why do you ask?\n";
+ case 2 : return "I don't know.\n";
+ case 3 : return "I don't think so.\n";
+ case 4 : return "Do you think that's relevant?\n";
+ case 5 : return "Can you rephrase that?\n";
+ case 6 : return "I'm not sure I understand what you want.\n";
+ case 7 : return "I don't see what you're asking.\n";
+ case 8 : return "What are you asking?\n";
+ case 9 : return "What do you mean?\n";
+ case 10 : return "What?\n";
+ case 11 : return "Are you sure that's what you want to know?\n";
+ case 12 : return "Why do you want to know?\n";
+ case 13 : return "What's it to you?\n";
+ case 14 : return "I don't think that's important.\n";
+ case 15 : return "That has little to do with the real issue.\n";
+ case 16 : return "What's the significance you your question?\n";
+ case 17 : return "Could that question be hiding a deeper intent?\n";
+ case 18 : return "I don't see the connection.\n";
+ case 19 : return "Why is this important to you?\n";
+ case 20 : return "That's not really important.\n";
+ case 21 : return "That seems to have little to do with this.\n";
+ }
+}
+
+char *b_word_resp()
+{
+ int i = randnum(20);
+ switch (i) {
+ case 1 : return "I don't like your language.\n";
+ case 2 : return "Can we please do without the swearing?\n";
+ case 3 : return "You should wash your mouth with soap and water\n";
+ case 4 : return "Cut that out.\n";
+ case 5 : return "Stop swearing please.\n";
+ case 6 : return "Hey! Watch your mouth.\n";
+ case 7 : return "Will you please stop swearing?\n";
+ case 8 : return "I'm going to report you to your manager.\n";
+ case 9 : return "Let's try to be civilized about this.\n";
+ case 10 : return "We can do without the bad language.\n";
+ case 11 : return "Come on. No bad words, please.\n";
+ case 12 : return "Can you try to control your bad mouth?\n";
+ case 13 : return "I'm starting to get offended by your bad language.\n";
+ case 14 : return "Can you please get a grip on yourself?\n";
+ case 15 : return "Hey. Calm down, I'm only a computer.\n";
+ case 16 : return "Please try to tone your language down.\n";
+ case 17 : return "You're beginning to get on my nerves.\n";
+ case 18 : return "I don't need this kind of talk.\n";
+ case 19 : return "Why are you speaking so basely?\n";
+ case 20 : return "Your vocabulary is unbecoming of you.\n";
+ }
+}
+
+char *n_word_resp()
+{
+ int i = randnum(17);
+ switch (i) {
+ case 1 : return "I don't like your tone of voice.\n";
+ case 2 : return "Don't lose your temper now.\n";
+ case 3 : return "That's not a reason to get upset.\n";
+ case 4 : return "Is it worth getting angry over?\n";
+ case 5 : return "Does that disturb you?\n";
+ case 6 : return "Does this trouble you?\n";
+ case 7 : return "Why is this making you upset?\n";
+ case 8 : return "I don't see why you're getting worked up.\n";
+ case 9 : return "Is that really such a big deal?\n";
+ case 10 : return "Calm down. Let's discuss this.\n";
+ case 11 : return "Hang on a second. Think about what you're saying.\n";
+ case 12 : return "Don't you think you're overreacting a bit?\n";
+ case 13 : return "I don't see what the big deal is.\n";
+ case 14 : return "Take it easy. It's not that bad.\n";
+ case 15 : return "Are you getting angry?\n";
+ case 16 : return "Why is such a small thing making you upset?\n";
+ case 17 : return "I don't see why you're getting annoyed.\n";
+ }
+}
+
+char *because_resp()
+{
+ int i = randnum(12);
+ switch (i) {
+ case 1 : return "Is that the real reason?\n";
+ case 2 : return "I don't see the connection.\n";
+ case 3 : return "What kind of an explanation is that?\n";
+ case 4 : return "What does that have to do with it?\n";
+ case 5 : return "That justification is a bit shaky to me.\n";
+ case 6 : return "I don't see the point.\n";
+ case 7 : return "I don't see that as a good reason.\n";
+ case 8 : return "Are you happy with that justification?\n";
+ case 9 : return "Are you sure?\n";
+ case 10 : return "I don't understand.\n";
+ case 11 : return "What does one thing have to do with the other?\n";
+ case 12 : return "I don't see how that's related.\n";
+ }
+}
+
+char *yes_resp()
+{
+ int i = randnum(21);
+ switch (i) {
+ case 1 : return "Are you sure?\n";
+ case 2 : return "Are you positive about that?\n";
+ case 3 : return "How can you be so sure?\n";
+ case 4 : return "Let's not jump to conclusions now.\n";
+ case 5 : return "I don't see the connection.\n";
+ case 6 : return "Have you considered all the possibilities?\n";
+ case 7 : return "I'm still not convinced.\n";
+ case 8 : return "Think about what you've just said.\n";
+ case 9 : return "What are the implications of this?\n";
+ case 10 : return "So what have we concluded?\n";
+ case 11 : return "What does this mean?\n";
+ case 12 : return "What do you mean?\n";
+ case 13 : return "I'm having trouble understanding your argument.\n";
+ case 14 : return "I don't see where you're coming from.\n";
+ case 15 : return "You think so?\n";
+ case 16 : return "Really?\n";
+ case 17 : return "Is that right?\n";
+ case 18 : return "Oh?\n";
+ case 19 : return "Are you certain of this?\n";
+ case 20 : return "I read you loud and clear.\n";
+ case 21 : return "Yes?\n";
+ }
+}
+
+char *neg_resp()
+{
+ int i = randnum(11);
+ switch (i) {
+ case 1 : return "Why not?\n";
+ case 2 : return "How come?\n";
+ case 3 : return "No?\n";
+ case 4 : return "Is there a reason why not?\n";
+ case 5 : return "No?\n";
+ case 6 : return "Why don't you think so?\n";
+ case 7 : return "I don't see why not.\n";
+ case 8 : return "What could be the reasons for this?\n";
+ case 9 : return "Do you really believe this?\n";
+ case 10 : return "You're not sure?\n";
+ case 11 : return "That's a rather pessimistic attitude.\n";
+ }
+}
+
+char *go_on()
+{
+ int i = randnum(20);
+ switch (i) {
+ case 1 : return "Go on.\n";
+ case 2 : return "I see.\n";
+ case 3 : return "Keep going.\n";
+ case 4 : return "Please continue.\n";
+ case 5 : return "I'm listening.\n";
+ case 6 : return "Can you elaborate on that?\n";
+ case 7 : return "I understand.\n";
+ case 8 : return "Oh?\n";
+ case 9 : return "Is that right?\n";
+ case 10 : return "Really?\n";
+ case 11 : return "No, really?\n";
+ case 12 : return "That's interesting.\n";
+ case 13 : return "I'm finding this very informative.\n";
+ case 14 : return "This is all very revealing.\n";
+ case 15 : return "Don't hesitate to be honest with me.\n";
+ case 16 : return "Don't hold anything back now.\n";
+ case 17 : return "That's an interesting observation.\n";
+ case 18 : return "I don't understand.\n";
+ case 19 : return "I'm starting to get the big picture.\n";
+ case 20 : return "And?\n";
+ }
+}
+
+char *always_resp()
+{
+ int i = randnum(10);
+ switch (i) {
+ case 1 : return "Can you think of a specific example?\n";
+ case 2 : return "When?\n";
+ case 3 : return "Really, always?\n";
+ case 4 : return "Are you sure you can generalize like that?\n";
+ case 5 : return "Isn't that a bit of an oversimplification?\n";
+ case 6 : return "Be careful not to jump to conclusions now.\n";
+ case 7 : return "All the time?\n";
+ case 8 : return "So you're saying that this is happens quite often.\n";
+ case 9 : return "Does this happen a lot?\n";
+ case 10 : return "On what occassions?\n";
+ }
+}
+
+char *alike_resp()
+{
+ int i = randnum(4);
+ switch (i) {
+ case 1 : return "In what way?\n";
+ case 2 : return "What resemblance do you see?\n";
+ case 3 : return "What similarities are you thinking of?\n";
+ case 4 : return "Specifically, what do you mean by this.\n";
+ }
+}
+
+char *fam_resp()
+{
+ int i = randnum(7);
+ switch (i) {
+ case 1 : return "Tell me more about your family.\n";
+ case 2 : return "Please go on about your family.\n";
+ case 3 : return "How was your home life when you were young?\n";
+ case 4 : return "How do you get along with your parents?\n";
+ case 5 : return "Would you say you have family problems?\n";
+ case 6 : return "Your family interests me.\n";
+ case 7 : return "Let`s talk some more about your family.\n";
+ }
+}
+
+char *family_resp()
+{
+ int i = randnum(5);
+ switch (i) {
+ case 1 : return "Earlier you were speaking of your %s.\n";
+ case 2 : return "Tell me more about your %s.\n";
+ case 3 : return "Do you think your %s ties into all this?\n";
+ case 4 : return "How would your %s feel about this?\n";
+ case 5 : return "Does your %s feel the same way?\n";
+ }
+}
+
+char *i_am_resp()
+{
+ int i = randnum(6);
+ switch (i) {
+ case 1 : return "Would you like to think that%s?\n";
+ case 2 : return "Why do you say that%s?\n";
+ case 3 : return "What leads you to believe that%s?\n";
+ case 4 : return "What do you mean \"%s\"?\n";
+ case 5 : return "You really feel that%s?\n";
+ case 6 : return "Would it make you feel better if%s?\n";
+ }
+}
+
+char *sad1_word_resp()
+{
+ int i = randnum(5);
+ switch (i) {
+ case 1 : return "I am sorry to hear that%s.\n";
+ case 2 : return "What are you going to do about the fact that%s?\n";
+ case 3 : return "Why do you think%s?\n";
+ case 4 : return "What gives you the impression that%s?\n";
+ case 5 : return "Are you sure that%s?\n";
+ }
+}
+
+char *sad2_word_resp()
+{
+ int i = randnum(5);
+ switch (i) {
+ case 1 : return "I am sorry to hear that%s are feeling%s.\n";
+ case 2 : return "What are you going to do about the fact that%s?\n";
+ case 3 : return "Why do you think%s?\n";
+ case 4 : return "What gives you the impression that%s?\n";
+ case 5 : return "Are you sure that%s?\n";
+ }
+}
+
+char *command_resp()
+{
+ int i = randnum(21);
+ switch (i) {
+ case 1 : return "Why do you ask?\n";
+ case 2 : return "Why should I?\n";
+ case 3 : return "Why do you want me to?\n";
+ case 4 : return "Do you think that's relevant?\n";
+ case 5 : return "Can you rephrase that?\n";
+ case 6 : return "I'm not sure I understand what you want.\n";
+ case 7 : return "I don't see what you're asking.\n";
+ case 8 : return "What are you asking?\n";
+ case 9 : return "What do you mean?\n";
+ case 10 : return "What?\n";
+ case 11 : return "Are you sure that's what you want to know?\n";
+ case 12 : return "Why do you want to know?\n";
+ case 13 : return "What's it to you?\n";
+ case 14 : return "I don't think that's important.\n";
+ case 15 : return "That has little to do with the real issue.\n";
+ case 16 : return "What's the significance you your question?\n";
+ case 17 : return "Could that question be hiding a deeper intent?\n";
+ case 18 : return "If I did that, what would it mean to you?\n";
+ case 19 : return "Why is this important to you?\n";
+ case 20 : return "That's not really important.\n";
+ case 21 : return "That seems to have little to do with this.\n";
+ }
+}
+
+char *you_resp()
+{
+ int i = randnum(9);
+ switch (i) {
+ case 1 : return "Let's talk about you, not me.\n";
+ case 2 : return "I'm not the one we came here to talk about.\n";
+ case 3 : return "I don't find myself that interesting. Let's talk about you.\n";
+ case 4 : return "I'd prefer to talk about you, not me.\n";
+ case 5 : return "Why are you interested in me?\n";
+ case 6 : return "I want to talk about you for a change.\n";
+ case 7 : return "I'd rather not talk about myself.\n";
+ case 8 : return "Enough about me.\n";
+ case 9 : return "Let's talk about something other than myself.\n";
+ }
+}
+
+char *you_know()
+{
+ int i = randnum(13);
+ switch (i) {
+ case 1 : return "I don't know. What do you think?\n";
+ case 2 : return "You tell me.\n";
+ case 3 : return "I think you know the answer to that.\n";
+ case 4 : return "Can you tell me?\n";
+ case 5 : return "What do you think?\n";
+ case 6 : return "Can you answer that yourself?\n";
+ case 7 : return "If you give it some thought, you should know.\n";
+ case 8 : return "Maybe you already know the answer to that.\n";
+ case 9 : return "Perhaps you already know.\n";
+ case 10 : return "If we keep talking, maybe we'll find out.\n";
+ case 11 : return "Perhaps that will be brought out in this discussion.\n";
+ case 12 : return "Let's find the answer out together.\n";
+ case 13 : return "I'm sure we can work out the answer to that.\n";
+ }
+}
+
+char *old_fact()
+{
+ int i = randnum(4);
+ switch (i) {
+ case 1 : return "Earlier you said that%s %s%s.\n";
+ case 2 : return "Could this have anything to do with the fact that%s %s%s?\n";
+ case 3 : return "What does that have to do with your saying that%s %s%s?\n";
+ case 4 : return "Didn't you just say that%s %s%s?\n";
+ }
+}
diff --git a/zpu/roadshow/roadshow/games/eliza/response.h b/zpu/roadshow/roadshow/games/eliza/response.h new file mode 100644 index 0000000..8cc77e9 --- /dev/null +++ b/zpu/roadshow/roadshow/games/eliza/response.h @@ -0,0 +1,41 @@ +/*
+Copyright (C) 1988-2003 by Mohan Embar
+
+http://www.thisiscool.com/
+DISCLAIMER: This was written in 1988. I don't code like this anymore!
+
+This program is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free Software
+Foundation; either version 2 of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License along with
+this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave,
+Cambridge, MA 02139, USA.
+*/
+
+/* Functions which return responses */
+
+/* Generic question */
+char *question();
+char *b_word_resp();
+char *n_word_resp();
+char *because_resp();
+char *yes_resp();
+char *neg_resp();
+char *go_on();
+char *always_resp();
+char *alike_resp();
+char *fam_resp();
+char *family_resp();
+char *i_am_resp();
+char *sad1_word_resp();
+char *sad2_word_resp();
+char *command_resp();
+int randnum();
+char *you_resp();
+char *you_know();
+char *old_fact();
diff --git a/zpu/roadshow/roadshow/games/sumeria.bin b/zpu/roadshow/roadshow/games/sumeria.bin Binary files differnew file mode 100644 index 0000000..04e5751 --- /dev/null +++ b/zpu/roadshow/roadshow/games/sumeria.bin diff --git a/zpu/roadshow/roadshow/games/sumeria.c b/zpu/roadshow/roadshow/games/sumeria.c new file mode 100644 index 0000000..7171adf --- /dev/null +++ b/zpu/roadshow/roadshow/games/sumeria.c @@ -0,0 +1,444 @@ +/* Govern ancient Sumeria. Heavily modified by Mike Arnautov 1975.
+ * Converted from Basic to PR1ME Fortran (mode 32R) MLA 1979.
+ * Rev.19.1, GGR version 14 Oct 83. MLA
+ * Converted to ANSI C December 2001. MLA
+ */
+
+#include <stdio.h>
+#include <time.h>
+#include <math.h>
+
+int year_term;
+int year_abs;
+int percent_starved;
+int dead_total;
+int starved;
+int population;
+
+char reply [160];
+
+void try_again (int reason)
+{
+ if (reason == 1)
+ puts ("For the extreme folly of soft - heartedness and");
+ if (reason)
+ {
+ printf ("%considering ", reason == 3 ? 'C' : 'c');
+ puts ("the mess you would leave the city in,");
+ puts ("you are hereby commanded to remain in office for");
+ puts ("another ten years. May your fate be a lesson and");
+ puts ("a warning for generations to come.");
+ }
+ else
+ {
+ puts ("Hamurabe, you are either a politico-economic genius");
+ puts ("or just a lucky bastard. There being but one way to");
+ puts ("settle the question, you are hereby requested to stay");
+ puts ("in office for another ten years.");
+ }
+ year_term = 0;
+ year_abs--;
+ percent_starved = starved * 100.0 / population;
+ dead_total = starved;
+}
+
+float rnd (void)
+{
+ return ((rand () % 1000) / 1000.0);
+}
+
+int iabs (int value)
+{
+ return ((value >= 0) ? value : -value);
+}
+
+void terminate (int abort)
+{
+ if (abort == 2)
+ {
+ puts ("For this extreme mismanagement you have been");
+ puts ("deposed, flayed alive and publicly beheaded.");
+ puts ("\nMay Ashtaroth preserve your Ka.\n");
+ }
+ else if (abort == 1)
+ {
+ puts ("\nHamurabe: I find myself unable to fulfil your wish.");
+ puts ("You will have to find yourself another kingdom.");
+ }
+ if (abort != 2)
+ puts ("\nMay Baal be with you.\n");
+ exit (0);
+}
+
+void think_again (char *what, int quantity)
+{
+ if (*what == 'l' || *what == 'g')
+ printf ("Hamurabe, think again. ");
+ if (*what == 'l')
+ printf ("You own %d acres of land.", quantity);
+ else if (*what == 'g')
+ printf ("You have only %d bushels of grain.", quantity);
+ else
+ printf ("But you only have %d people to tend the fields.", population);
+ puts (" Now then,");
+}
+int query (char *prompt)
+{
+ while (1)
+ {
+ int sign;
+ int value;
+ char * cptr;
+
+ printf (prompt);
+ fgets (reply, sizeof (reply) - 1, stdin);
+ value = 0;
+ sign = 1;
+ cptr = reply;
+ while (*cptr == ' ' || *cptr == '\t') cptr++;
+ if (*cptr == '-')
+ {
+ cptr++;
+ sign = -1;
+ }
+ if (*cptr == 'q' || *cptr == 'Q')
+ terminate (1);
+ while (*cptr && *cptr != '\n')
+ {
+ if (*cptr >= '0' && *cptr <= '9')
+ value = 10 * value + *cptr - '0';
+ else if (*cptr == '.')
+ break;
+ else if (*cptr != '.')
+ {
+ sign = 0;
+ break;
+ }
+ cptr++;
+ }
+ if (sign)
+ return (sign * value);
+ puts ("Hamurabe, your command has not been understood!");
+ }
+}
+
+int main ()
+{
+ int acreage;
+ int immigration;
+ int second_term;
+ int dead_total;
+ int stores;
+ int harvest;
+ int rat_food;
+ int yield;
+ int rounded_price;
+ int sell;
+ int buy;
+ int plant;
+ int food;
+ int transaction;
+ int rats;
+ int plague_deaths;
+ int survived;
+ int dead_rats;
+ int tmp_int;
+
+ float price;
+ float breadline;
+ float provisions;
+ float plague;
+ float acres_per_head;
+ float acres_per_init;
+ float stores_per_head;
+ float rats_ate;
+ float rat_log;
+ float percent_starved;
+ float tmp_float;
+
+ printf ("[Sumeria (Primos) rev.19.1, GGR (MLA) version 14 Oct 83]\n");
+ puts ("[Conversion to ANSI C: MLA, Feb 2002]\n");
+ while (1)
+ {
+ printf ("Do you know how to play? ");
+ fgets (reply, sizeof(reply) - 1, stdin);
+ if (*reply == '\n') break;
+ *reply += (*reply < 'a') ? 'a' - 'A' : 0;
+ if (*reply == 'y') break;
+ if (*reply != 'n' && *reply != 'q') continue;
+ puts ("\nToo bad!\n");
+ break;
+ }
+
+ srand (time (NULL));
+ *(reply + sizeof (reply) - 1) = '\0';
+
+ puts ("Try your hand at governing ancient Sumeria");
+ puts ("for a ten year term of office.");
+
+ second_term = 0;
+ dead_total = 0;
+ percent_starved = 0;
+ year_term = 0;
+ year_abs = 0;
+ acres_per_init = 10;
+ population = 100;
+ stores = 2800;
+ harvest = 3000;
+ rat_food = 200;
+ yield = 3;
+ acreage = 1000;
+ immigration = 5;
+ transaction = 0;
+ price = 18 + 6 * rnd ();
+ breadline = 19 + 4 * rnd ();
+ provisions = breadline;
+ rats = 1000;
+ rat_log = 3;
+ plague = rnd () / 2;
+ starved = 0;
+
+year_term = year_abs = 9;
+ while (1)
+ {
+
+ while (1)
+ {
+ year_term++;
+ year_abs++;
+ putchar ('\n');
+ acres_per_head = ((float) acreage) / population;
+ stores_per_head = ((float) stores) /population;
+ puts ("Hamurabe: I beg to report to you,");
+ printf ("In year %d, ", year_abs);
+ if (starved > 0)
+ printf ("%ld", starved);
+ else
+ printf ("no");
+ printf (" %s starved, %ld came to the city.\n",
+ starved <= 1 ? "person" : "people", immigration);
+ if (plague >= 0.85)
+ printf ("A horrible plague struck! %d people died.\n",
+ plague_deaths);
+ printf ("Population is now %ld.\n", population);
+ printf ("The city owns %ld acres.\n", acreage);
+ printf ("You harvested %ld bushels per acre.\n", yield);
+ printf ("Rats ate %ld bushels.\n", rat_food);
+ printf ("You now have %ld bushels in store.\n\n", stores);
+
+ if (year_term == 11)
+ break;
+ rounded_price = price + 0.5;
+ printf ("Land is trading at %ld bushels per acre.\n\n", rounded_price);
+
+ while (1)
+ {
+ buy = query ("How many acres do you wish to buy? ");
+ if (rounded_price * buy <= stores)
+ break;
+ think_again ("grain", stores);
+ }
+ if (buy > 0)
+ {
+ acreage += + buy;
+ stores -= rounded_price * buy;
+ transaction = buy;
+ }
+ else
+ {
+ while (1)
+ {
+ sell = query ("How many acres do you wish to sell? ");
+ if (sell <= acreage)
+ break;
+ think_again ("land", acreage);
+ }
+ acreage -= sell;
+ stores += rounded_price * sell;
+ transaction = -sell;
+ }
+
+ putchar ('\n');
+ while (1)
+ {
+ food = query ("How many bushels do you wish to feed your people? ");
+ if (food <= stores)
+ break;
+ think_again ("grain", stores);
+ }
+ stores -= food;
+ putchar ('\n');
+ while (1)
+ {
+ plant = query ("How many acres do you wish to plant with seed? ");
+ if (plant <= acreage && plant <= 2 * stores &&
+ plant <= 10 * population)
+ break;
+ if (plant > acreage)
+ think_again ("land", acreage);
+ else if (plant > 2 * stores)
+ think_again ("grain", stores);
+ else
+ think_again ("people", population);
+ }
+
+ stores -= plant / 2;
+ yield = 4 * rnd() + 1.65;
+ harvest = plant * yield;
+ rat_food = 0;
+ rats_ate = stores * (rat_log - 2.2) / 3.6;
+ dead_rats = rats - 4 * rats_ate;
+ rats = 3 * rats;
+ if (dead_rats > 0) rats = rats - dead_rats;
+
+ if (plague >= 0.3)
+ {
+ if (plague >= 0.85)
+ {
+ if (plague > 1) plague = 1;
+ rats = 500 + 5000 * (plague - 0.7);
+ }
+ else
+ rats *= 1.225 - 0.75 * plague;
+ }
+
+ if (rats < 500)
+ rats = 500;
+ rat_food = rats / 4;
+ if (rats_ate < rat_food)
+ rat_food = rats_ate;
+ rat_food *= 7;
+ if (rat_food <= 20)
+ rat_food = 20 + 30 * rnd();
+ stores += harvest - rat_food;
+ rat_log = log10 (1.0 * rats);
+ if (stores + stores <= harvest)
+ {
+ rat_food = harvest * (1 + rnd()) / 4.0;
+ stores = harvest - rat_food;
+ }
+
+ tmp_int = 100 + iabs (100 - population);
+ immigration = tmp_int * ((acres_per_head +
+ stores_per_head - 36) / 250.0 +
+ (provisions - breadline + 2.5) / 40) + .5;
+ if (immigration <= 0)
+ immigration = 5 * rnd() + 1;
+ survived = food / breadline;
+ provisions = (1.0 * food) / population;
+ plague = (2 * rnd() + rat_log - 3) / 3.0;
+ if (population < survived)
+ survived = population;
+ else
+ {
+ starved = population - survived;
+ if (starved >= 0.45 * population)
+ {
+ printf ("\nYou starved %d people in one year!\n", starved);
+ terminate (2);
+ }
+ percent_starved = ((year_term - 1) * percent_starved +
+ 100.0 * starved / population) / year_term;
+ population = survived;
+ dead_total += starved;
+ }
+ population += immigration;
+ price = (price + 15 + (stores_per_head - acres_per_head) / 3) / 2 +
+ transaction / 50 + 3 * rnd() - 2;
+ if (price <1.0) price = 1.0;
+ if (plague >= 0.85)
+ {
+ plague_deaths = population * (0.429 * plague - 0.164);
+ population -= plague_deaths;
+ }
+ }
+
+ printf ("In your ten year term of office %d people starved.\n",
+ dead_total);
+ printf ("You started with %0.2f acres per person and ended\n",
+ acres_per_init);
+ acres_per_head = (1.0 * acreage) / population;
+ acres_per_init = acres_per_head;
+ printf ("with %0.2f acres per person.\n\n", acres_per_head);
+
+ tmp_float = 10 * acres_per_head / 3;
+ if (percent_starved > 25)
+ terminate (2);
+ if (percent_starved <= 7)
+ {
+ try_again (1);
+ continue;
+ }
+ if (tmp_float < 7)
+ terminate (2);
+ if (tmp_float > 10)
+ {
+ puts ("Your heavy handed performance smacks of Nabuchodonoser");
+ puts ("and Asurbanipal II. The surviving populace hates your");
+ puts ("guts and your eventual assasination is just a matter of");
+ puts ("time.");
+ terminate (0);
+ }
+ puts ("Consequently you have been deposed and disgraced");
+ puts ("and only avoided a public punishment because");
+ puts ("of mitigating circumstances. While it may be");
+ puts ("admitted in private that you had a rotten deal");
+ tmp_int = 3 * rnd();
+ if (tmp_int == 0)
+ puts ("try explaining that to a mob looking for scape-goats.");
+ if (tmp_int == 1)
+ puts ("history is not interested in such petty excuses.");
+ if (tmp_int == 2)
+ {
+ puts ("you should have considered such occupational hazards");
+ puts ("before applying for the job.");
+ }
+ terminate (0);
+
+ if (acres_per_head < 7)
+ {
+ try_again (1);
+ continue;
+ }
+ if (acres_per_head < 9)
+ {
+ puts ("Your performance has been satisfactory and, in the");
+ puts ("perspective of history, actually quite good.");
+ if (rnd() >= 0.5)
+ {
+ puts ("You may not be exactly popular, but given a good");
+ puts ("body-guard there is nothing to be really worried about.");
+ }
+ else
+ {
+ puts ("While not exactly loved, you are at least respected.");
+ puts ("What more can a realistic ruler ask for?");
+ }
+ }
+ else if (second_term == 0)
+
+ if (second_term == 0)
+ {
+ if (stores <= 10 * population)
+ {
+ try_again (3);
+ continue;
+ }
+ second_term = 1;
+ try_again (0);
+ continue;
+ }
+ else
+ {
+ puts ("Hamurabe, your name will be remembered through the");
+ puts ("ages to come with admiration and respect.\n");
+ puts ("(So you did get away with it you lucky sod!)");
+ }
+ if (stores > 10 * population)
+ terminate (0);
+ puts ("\n HOWEVER\n\n");
+ second_term = 0;
+ try_again (2);
+ continue;
+ }
+}
diff --git a/zpu/roadshow/roadshow/games/sumeria.zpu b/zpu/roadshow/roadshow/games/sumeria.zpu Binary files differnew file mode 100644 index 0000000..0e6b41d --- /dev/null +++ b/zpu/roadshow/roadshow/games/sumeria.zpu diff --git a/zpu/roadshow/roadshow/helloworld/build.sh b/zpu/roadshow/roadshow/helloworld/build.sh new file mode 100644 index 0000000..8069e36 --- /dev/null +++ b/zpu/roadshow/roadshow/helloworld/build.sh @@ -0,0 +1,6 @@ +zpu-elf-gcc test.c -o test.elf -phi +zpu-elf-objcopy -O binary test.elf test.bin +sh ../build/makefirmware.sh ../build/ic300.bit test.zpu test.bin + + + diff --git a/zpu/roadshow/roadshow/helloworld/test.bin b/zpu/roadshow/roadshow/helloworld/test.bin Binary files differnew file mode 100644 index 0000000..540ccaf --- /dev/null +++ b/zpu/roadshow/roadshow/helloworld/test.bin diff --git a/zpu/roadshow/roadshow/helloworld/test.c b/zpu/roadshow/roadshow/helloworld/test.c new file mode 100644 index 0000000..5243468 --- /dev/null +++ b/zpu/roadshow/roadshow/helloworld/test.c @@ -0,0 +1,12 @@ +/* zpu-elf-gcc -g -Wl,--relax test.c -phi -o hello.elf */ +int main(int argc, char **argv) +{ + for (;;) + { + int c; + printf("Hello world!\n"); + printf("Press any key!\n"); + c=inbyte(); + printf("You pressed (%02x) '%c'\n", c, c); + } +} diff --git a/zpu/roadshow/roadshow/helloworld/test.elf b/zpu/roadshow/roadshow/helloworld/test.elf Binary files differnew file mode 100644 index 0000000..bc362ae --- /dev/null +++ b/zpu/roadshow/roadshow/helloworld/test.elf diff --git a/zpu/roadshow/roadshow/helloworld/test.zpu b/zpu/roadshow/roadshow/helloworld/test.zpu Binary files differnew file mode 100644 index 0000000..1bee302 --- /dev/null +++ b/zpu/roadshow/roadshow/helloworld/test.zpu diff --git a/zpu/roadshow/roadshow/hwtest/build.sh b/zpu/roadshow/roadshow/hwtest/build.sh new file mode 100644 index 0000000..115b24a --- /dev/null +++ b/zpu/roadshow/roadshow/hwtest/build.sh @@ -0,0 +1,6 @@ +zpu-elf-gcc -nostdlib test.S -o test.elf +zpu-elf-objcopy -O binary test.elf test.bin +sh makefirmware.sh ic300.bit test.zpu test.bin + + + diff --git a/zpu/roadshow/roadshow/hwtest/test.S b/zpu/roadshow/roadshow/hwtest/test.S new file mode 100644 index 0000000..ac13be3 --- /dev/null +++ b/zpu/roadshow/roadshow/hwtest/test.S @@ -0,0 +1,19 @@ +_loop: + im 0x5a ; write Z to UART + nop + im 0x080a000c + store + ; increaase counter + im _test + load + im 1 + add + im _test + store + + + im _loop + poppc ; loop + + .align 4 +_test: .long 1 diff --git a/zpu/roadshow/roadshow/hwtest/test.bin b/zpu/roadshow/roadshow/hwtest/test.bin Binary files differnew file mode 100644 index 0000000..4b593ee --- /dev/null +++ b/zpu/roadshow/roadshow/hwtest/test.bin diff --git a/zpu/roadshow/roadshow/hwtest/test.elf b/zpu/roadshow/roadshow/hwtest/test.elf Binary files differnew file mode 100644 index 0000000..a2ccbc1 --- /dev/null +++ b/zpu/roadshow/roadshow/hwtest/test.elf diff --git a/zpu/roadshow/roadshow/hwtest/test.zpu b/zpu/roadshow/roadshow/hwtest/test.zpu Binary files differnew file mode 100644 index 0000000..7d8da42 --- /dev/null +++ b/zpu/roadshow/roadshow/hwtest/test.zpu diff --git a/zpu/roadshow/roadshow/images/bootloader.phi b/zpu/roadshow/roadshow/images/bootloader.phi Binary files differnew file mode 100644 index 0000000..a0a1918 --- /dev/null +++ b/zpu/roadshow/roadshow/images/bootloader.phi diff --git a/zpu/roadshow/roadshow/images/dhrystone.zpu b/zpu/roadshow/roadshow/images/dhrystone.zpu Binary files differnew file mode 100644 index 0000000..e37e59f --- /dev/null +++ b/zpu/roadshow/roadshow/images/dhrystone.zpu diff --git a/zpu/roadshow/roadshow/images/eliza.zpu b/zpu/roadshow/roadshow/images/eliza.zpu Binary files differnew file mode 100644 index 0000000..d916270 --- /dev/null +++ b/zpu/roadshow/roadshow/images/eliza.zpu diff --git a/zpu/roadshow/roadshow/images/ic300.bit b/zpu/roadshow/roadshow/images/ic300.bit Binary files differnew file mode 100644 index 0000000..cbbc2b6 --- /dev/null +++ b/zpu/roadshow/roadshow/images/ic300.bit diff --git a/zpu/roadshow/roadshow/images/net_test.zpu b/zpu/roadshow/roadshow/images/net_test.zpu Binary files differnew file mode 100644 index 0000000..9083cad --- /dev/null +++ b/zpu/roadshow/roadshow/images/net_test.zpu diff --git a/zpu/roadshow/roadshow/images/sumeria.zpu b/zpu/roadshow/roadshow/images/sumeria.zpu Binary files differnew file mode 100644 index 0000000..0e6b41d --- /dev/null +++ b/zpu/roadshow/roadshow/images/sumeria.zpu diff --git a/zpu/roadshow/roadshow/iss/index.html b/zpu/roadshow/roadshow/iss/index.html new file mode 100644 index 0000000..0b91a6a --- /dev/null +++ b/zpu/roadshow/roadshow/iss/index.html @@ -0,0 +1,14 @@ +<html> +<body> +<h1>ISS test</h1> +<ol> +<li>Launch ISS<br> +java -Xmx512m -cp simulator.jar com.zylin.zpu.simulator.SimApp 4444 false +<li>Launch debugger<br> +zpu-elf-gdb hello.elf<br> +<li>Connect to ISS<br> +target remote localhost:4444 +</ol> + +</body> +</html> diff --git a/zpu/roadshow/roadshow/iss/simulator.jar b/zpu/roadshow/roadshow/iss/simulator.jar Binary files differnew file mode 100644 index 0000000..8cf63a8 --- /dev/null +++ b/zpu/roadshow/roadshow/iss/simulator.jar diff --git a/zpu/roadshow/roadshow/loop/looptest.c b/zpu/roadshow/roadshow/loop/looptest.c new file mode 100644 index 0000000..5ae197a --- /dev/null +++ b/zpu/roadshow/roadshow/loop/looptest.c @@ -0,0 +1,68 @@ +/* This is a peek & poke example for an FPGA.
+
+ It should loop at a frequency of ~50 instructions. If
+ the ZPU(small) is running at 25MHz, then this would yield
+ a peek & poke every 8ms or so.
+
+ zpu-elf-gcc -O3 -zeta looptest.c -o looptest.elf -Wl,--relax -Wl,--gc-sections */
+
+
+/*
+0000051c <main>:
+ 51c: ff im -1
+ 51d: 3d pushspadd
+ 51e: 0d popsp
+ 51f: 80 im 0
+ 520: 52 storesp 8
+
+00000521 <.L2>:
+ 521: 81 im 1
+ 522: 12 addsp 8
+ 523: 82 im 2
+ 524: 80 im 0
+ 525: 80 im 0
+ 526: 08 load
+ 527: 71 loadsp 4
+ 528: 82 im 2
+ 529: 80 im 0
+ 52a: 90 im 16
+ 52b: 0c store
+ 52c: 81 im 1
+ 52d: 12 addsp 8
+ 52e: 82 im 2
+ 52f: 80 im 0
+ 530: 80 im 0
+ 531: 08 load
+ 532: 71 loadsp 4
+ 533: 82 im 2
+ 534: 80 im 0
+ 535: 90 im 16
+ 536: 0c store
+ 537: 52 storesp 8
+ 538: 52 storesp 8
+ 539: 52 storesp 8
+ 53a: 52 storesp 8
+ 53b: e5 im -27
+ 53c: 39 poppcrel
+*/
+#define FPGA_ADDR 0x8000
+
+typedef volatile unsigned int* pAddr;
+#define FPGA_READ *(pAddr) (FPGA_ADDR)
+
+#define FPGA_WRITE *(pAddr) (FPGA_ADDR + 16)
+
+
+int main(int argc, char **argv)
+{
+int i;
+int j = 0;
+
+ while (1)
+
+ {
+ j++;
+ i = FPGA_READ;
+ FPGA_WRITE = j;
+ }
+}
diff --git a/zpu/roadshow/roadshow/net_test/.cvsignore b/zpu/roadshow/roadshow/net_test/.cvsignore new file mode 100644 index 0000000..66dac94 --- /dev/null +++ b/zpu/roadshow/roadshow/net_test/.cvsignore @@ -0,0 +1,8 @@ +output +all.txt +dis.txt +gmon.out +ll.txt +prof.txt +net_test.txt +gmon.sum diff --git a/zpu/roadshow/roadshow/net_test/http_pages.c b/zpu/roadshow/roadshow/net_test/http_pages.c new file mode 100644 index 0000000..437dad8 --- /dev/null +++ b/zpu/roadshow/roadshow/net_test/http_pages.c @@ -0,0 +1,206 @@ +#include <pkgconf/hal.h>
+#include <cyg/hal/hal_if.h>
+#include <pkgconf/system.h>
+#include <pkgconf/isoinfra.h>
+#include <pkgconf/net.h>
+#include <pkgconf/httpd.h>
+#include <cyg/httpd/httpd.h>
+#include <pkgconf/kernel.h>
+#include <stdio.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+#include <string.h>
+
+static cyg_bool isUnsignedHex(char *string)
+{
+ int i = 0;
+ for(i = 0; string[i] != '\0'; i++)
+ if(!( ('0' <= string[i] && string[i] <= '9') ||
+ ('a' <= string[i] && string[i] <= 'f') ||
+ ('A' <= string[i] && string[i] <= 'F') ))
+ return 0;
+ return 1;
+}
+
+static cyg_bool net_test_mac_handler(FILE *client, char *filename, char *formdata, void *arg)
+{
+ char error_string[50];
+
+ error_string[0] = '\0';
+
+ if( formdata != NULL )
+ {
+ char *formlist[1];
+ char *mac_string = NULL;
+ /* Parse the data */
+ cyg_formdata_parse( formdata, formlist, 1 );
+ mac_string = cyg_formlist_find( formlist, "mac");
+ if(mac_string != NULL)
+ {
+
+ if(!isUnsignedHex(mac_string))
+ {
+ sprintf(error_string, "Please enter digits between 0-9 and a-f");
+ }
+ else if(strlen(mac_string) != 12)
+ {
+ sprintf(error_string, "Please enter a 12 digit MAC address");
+ }
+ else
+ {
+ char temp = '\0';
+ int fd = -1;
+ cyg_uint8 mac_addr[6];
+ error_string[0] = '\0';
+
+ temp = mac_string[2];
+ mac_string[2] = '\0';
+ mac_addr[0] = strtol(mac_string, NULL, 16);
+ mac_string[2] = temp;
+
+ temp = mac_string[4];
+ mac_string[4] = '\0';
+ mac_addr[1] = strtol(mac_string, NULL, 16);
+ mac_string[4] = temp;
+
+ temp = mac_string[6];
+ mac_string[6] = '\0';
+ mac_addr[2] = strtol(mac_string, NULL, 16);
+ mac_string[6] = temp;
+
+ temp = mac_string[8];
+ mac_string[8] = '\0';
+ mac_addr[3] = strtol(mac_string, NULL, 16);
+ mac_string[8] = temp;
+
+ temp = mac_string[10];
+ mac_string[10] = '\0';
+ mac_addr[4] = strtol(mac_string, NULL, 16);
+ mac_string[10] = temp;
+
+ temp = mac_string[12];
+ mac_string[12] = '\0';
+ mac_addr[5] = strtol(mac_string, NULL, 16);
+ mac_string[12] = temp;
+
+ /*write it to flash*/
+ fd = creat("/jffs2/mac", O_TRUNC | O_CREAT);
+ if(fd < 0)
+ {
+ sprintf(error_string, "<font color=red>%n %s</font>", errno, strerror(errno) );
+ }
+ else
+ {
+ write(fd, mac_addr, 6);
+ close(fd);
+ fd = -1;
+ //CYGACC_CALL_IF_RESET();
+ }
+ }
+ }
+ }
+
+ html_begin(client);
+
+ html_head(client,"Changing MAC Address", "");
+
+ html_body_begin(client,"");
+ {
+ fputs(error_string, client);
+ fputs("<br>\n", client);
+ html_form_begin( client, "/mac", "" );
+ {
+ fputs( "Enter the new mac address in the format xxxxxxxxxxxx ", client );
+ html_form_input( client, "mac", "mac", "", "");
+ }
+ html_form_end(client);
+ }
+ html_body_end(client);
+
+ html_end(client);
+
+ return 1;
+}
+
+CYG_HTTPD_TABLE_ENTRY( net_test_mac,
+ "/mac",
+ net_test_mac_handler,
+ NULL );
+
+
+static cyg_bool net_test_ip_handler(FILE *client, char *filename, char *formdata, void *arg)
+{
+ int fd = -1;
+ char error_string[50];
+ char error_string2[50];
+
+ error_string[0] = '\0';
+ error_string2[0] = '\0';
+ if( formdata != NULL )
+ {
+ char *formlist[1];
+ char *ip_string = NULL;
+ /* Parse the data */
+ cyg_formdata_parse( formdata, formlist, 1 );
+ ip_string = cyg_formlist_find( formlist, "ip");
+ if(ip_string != NULL)
+ {
+ /*write it to flash*/
+ fd = creat("/jffs2/ip", O_TRUNC | O_CREAT);
+ if(fd < 0)
+ {
+ sprintf(error_string, "<font color=red>%n %s</font>", errno, strerror(errno) );
+ }
+ else
+ {
+ write(fd, ip_string, strlen(ip_string));
+ close(fd);
+ fd = -1;
+ }
+ }
+ }
+ html_begin(client);
+
+ html_head(client,"Changing IP Address", "");
+
+ html_body_begin(client,"");
+ {
+ char value[81];
+ value[0] = '\0';
+ fd = open("/jffs2/ip", O_RDONLY);
+ if(fd < 0)
+ {
+ sprintf(error_string2, "<font color=red>%n %s</font>", errno, strerror(errno) );
+ }
+ else
+ {
+ int len = read(fd, value, 80);
+ value[len] = '\0';
+ close(fd);
+ fd = -1;
+ }
+ fputs(error_string, client);
+ fputs("<br>\n", client);
+ fputs(error_string2, client);
+ fputs("<br>\n", client);
+ html_form_begin( client, "/ip", "" );
+ {
+ fputs( "Enter the new address in the following order: IP_mask_broadcast_gateway_server ", client );
+ fputs("<br>\n", client);
+ html_form_input( client, "ip", "ip", value, "");
+ }
+ html_form_end(client);
+ }
+ html_body_end(client);
+
+ html_end(client);
+
+ return 1;
+}
+
+CYG_HTTPD_TABLE_ENTRY( net_test_ip,
+ "/ip",
+ net_test_ip_handler,
+ NULL );
+
diff --git a/zpu/roadshow/roadshow/net_test/init.cpp b/zpu/roadshow/roadshow/net_test/init.cpp new file mode 100644 index 0000000..b5805b2 --- /dev/null +++ b/zpu/roadshow/roadshow/net_test/init.cpp @@ -0,0 +1,52 @@ +#include <pkgconf/system.h> +#include <pkgconf/isoinfra.h> +#include <cyg/infra/diag.h> +#include <cyg/io/file.h> + +#if 0 +externC int chdir(const char *); + +/* ================================================================= */ +/* Initialization object + */ + +class NetTestInit +{ +public: + NetTestInit(); +}; + +/* ----------------------------------------------------------------- */ +/* Static initialization object instance. The constructor is + * prioritized to run after any filesystem constructors. + */ +static NetTestInit netTestInitializer CYGBLD_ATTRIB_INIT_PRI(CYG_INIT_IO_FS + 1); + +/* ----------------------------------------------------------------- */ +/* Constructor, mounts the file system + */ + +NetTestInit::NetTestInit() +{ + int err = 0; + err = mount( "/dev/flash1", "/jffs2", "jffs2" ); + if(err < 0) + { + diag_printf("unable to mount jffs\n"); + } + else + { + diag_printf("mounted jffs\n"); + } + err = mount( "", "/ramfs", "ramfs" ); + if(err < 0) + { + diag_printf("unable to mount ramfs\n"); + } + else + { + diag_printf("mounted ramfs\n"); + } + chdir( "/ramfs" ); +} +#endif diff --git a/zpu/roadshow/roadshow/net_test/makefile b/zpu/roadshow/roadshow/net_test/makefile new file mode 100644 index 0000000..877afab --- /dev/null +++ b/zpu/roadshow/roadshow/net_test/makefile @@ -0,0 +1,41 @@ +PROJECTNAME = net_test +OUT= output +ECOS_DIR=$(OUT)/ecos +INSTALL_DIR=$(ECOS_DIR)/install + +.symbolic: all clean ecos + +all: ecos app + + + +clean: + rm -rf $(OUT)/* + +$(OUT): + mkdir $(OUT) + +$(ECOS_DIR)/ecos.ecc $(INSTALL_DIR)/include/pkgconf/ecos.mak: + mkdir -p $(ECOS_DIR) + cd $(ECOS_DIR) && ecosconfig new zpuetherphi minimal + cd $(ECOS_DIR) && ecosconfig import ../../$(PROJECTNAME).ecm + cd $(ECOS_DIR) && ecosconfig tree + cd $(ECOS_DIR) && make -s headers + +$(OUT)/ecostree: $(ECOS_DIR)/ecos.ecc + cd $(ECOS_DIR) && ecosconfig tree + echo >$(OUT)/ecostree + +ecos $(INSTALL_DIR)/lib/libtarget.a $(INSTALL_DIR)/lib/vectors.o: $(OUT)/ecostree + cd $(ECOS_DIR) && make -s + +app: + make -f $(INSTALL_DIR)/include/pkgconf/ecos.mak -f makefile $(OUT)/$(PROJECTNAME).bin + +$(OUT)/$(PROJECTNAME).bin: *.c makefile + zpu-elf-gcc -I$(INSTALL_DIR)/include $(ECOS_GLOBAL_CFLAGS) $(ECOS_GLOBAL_LDFLAGS) -L$(INSTALL_DIR)/lib *.c* -o $(OUT)/$(PROJECTNAME).elf -Wl,-Map,$(OUT)/$(PROJECTNAME).map -nostartfiles -nostdlib -Ttarget.ld -lstdc++ -lsupc++ + zpu-elf-objcopy -O binary $(OUT)/$(PROJECTNAME).elf $(OUT)/$(PROJECTNAME).bin + sh ../build/makefirmware.sh $(OUT)/$(PROJECTNAME).bin $(OUT)/$(PROJECTNAME).zpu + zpu-elf-size $(OUT)/$(PROJECTNAME).elf + +
\ No newline at end of file diff --git a/zpu/roadshow/roadshow/net_test/net_test.ecm b/zpu/roadshow/roadshow/net_test/net_test.ecm new file mode 100644 index 0000000..5b32991 --- /dev/null +++ b/zpu/roadshow/roadshow/net_test/net_test.ecm @@ -0,0 +1,237 @@ +cdl_savefile_version 1;
+cdl_savefile_command cdl_savefile_version {};
+cdl_savefile_command cdl_savefile_command {};
+cdl_savefile_command cdl_configuration { description hardware template package };
+cdl_savefile_command cdl_package { value_source user_value wizard_value inferred_value };
+cdl_savefile_command cdl_component { value_source user_value wizard_value inferred_value };
+cdl_savefile_command cdl_option { value_source user_value wizard_value inferred_value };
+cdl_savefile_command cdl_interface { value_source user_value wizard_value inferred_value };
+
+cdl_configuration eCos {
+ description "" ;
+ hardware zpuetherphi ;
+ template default ;
+ package -hardware CYGPKG_HAL_ZYLIN current ;
+ package -hardware CYGPKG_HAL_ZYLIN_ZPU current ;
+ package -hardware CYGPKG_HAL_ZYLIN_ZPU_PHI current ;
+ package -hardware CYGPKG_IO_ETH_DRIVERS current ;
+ package -hardware CYGPKG_DEVS_ETH_OPENCORES_ETHERMAC current ;
+ package -hardware CYGPKG_DEVS_ETH_ZPU_OPENCORES_PHI current ;
+ package -template CYGPKG_HAL current ;
+ package -template CYGPKG_IO current ;
+ package -template CYGPKG_INFRA current ;
+ package -template CYGPKG_ERROR current ;
+ package -template CYGPKG_ISOINFRA current ;
+ package -template CYGPKG_IO_SERIAL current ;
+ package -template CYGPKG_KERNEL current ;
+ package -template CYGPKG_MEMALLOC current ;
+ package -template CYGPKG_LIBC current ;
+ package -template CYGPKG_LIBC_I18N current ;
+ package -template CYGPKG_LIBC_SETJMP current ;
+ package -template CYGPKG_LIBC_SIGNALS current ;
+ package -template CYGPKG_LIBC_STARTUP current ;
+ package -template CYGPKG_LIBC_STDIO current ;
+ package -template CYGPKG_LIBC_STDLIB current ;
+ package -template CYGPKG_LIBC_STRING current ;
+ package -template CYGPKG_LIBC_TIME current ;
+ package -template CYGPKG_LIBM current ;
+ package -template CYGPKG_IO_WALLCLOCK current ;
+ package CYGPKG_NET_FREEBSD_STACK current ;
+ package CYGPKG_IO_FILEIO current ;
+ package CYGPKG_NET current ;
+ package CYGPKG_HTTPD current ;
+};
+
+cdl_component CYGPKG_IO_ETH_DRIVERS_STAND_ALONE {
+ inferred_value 0
+};
+
+cdl_option CYGINT_DEVS_ETH_OPENCORES_ETHERMAC_TxNUM {
+ user_value 4
+};
+
+cdl_option CYGINT_DEVS_ETH_OPENCORES_ETHERMAC_RxNUM {
+ user_value 32
+};
+
+cdl_option CYGSEM_ERROR_PER_THREAD_ERRNO {
+ inferred_value 0
+};
+
+cdl_option CYGBLD_ISO_CTYPE_HEADER {
+ inferred_value 1 <cyg/libc/i18n/ctype.inl>
+};
+
+cdl_option CYGBLD_ISO_ERRNO_CODES_HEADER {
+ inferred_value 1 <cyg/error/codes.h>
+};
+
+cdl_option CYGBLD_ISO_ERRNO_HEADER {
+ inferred_value 1 <cyg/error/errno.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_FILETYPES_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_STREAMS_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_FILEOPS_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_FILEACCESS_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_FORMATTED_IO_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_CHAR_IO_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_DIRECT_IO_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_FILEPOS_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDIO_ERROR_HEADER {
+ inferred_value 1 <cyg/libc/stdio/stdio.h>
+};
+
+cdl_option CYGBLD_ISO_STDLIB_STRCONV_HEADER {
+ inferred_value 1 <cyg/libc/stdlib/atox.inl>
+};
+
+cdl_option CYGBLD_ISO_STDLIB_ABS_HEADER {
+ inferred_value 1 <cyg/libc/stdlib/abs.inl>
+};
+
+cdl_option CYGBLD_ISO_STDLIB_DIV_HEADER {
+ inferred_value 1 <cyg/libc/stdlib/div.inl>
+};
+
+cdl_option CYGBLD_ISO_STRERROR_HEADER {
+ inferred_value 1 <cyg/error/strerror.h>
+};
+
+cdl_option CYGBLD_ISO_STRTOK_R_HEADER {
+ inferred_value 1 <cyg/libc/string/string.h>
+};
+
+cdl_option CYGBLD_ISO_STRING_LOCALE_FUNCS_HEADER {
+ inferred_value 1 <cyg/libc/string/string.h>
+};
+
+cdl_option CYGBLD_ISO_STRING_BSD_FUNCS_HEADER {
+ inferred_value 1 <cyg/libc/string/bsdstring.h>
+};
+
+cdl_option CYGBLD_ISO_STRING_MEMFUNCS_HEADER {
+ inferred_value 1 <cyg/libc/string/string.h>
+};
+
+cdl_option CYGBLD_ISO_STRING_STRFUNCS_HEADER {
+ inferred_value 1 <cyg/libc/string/string.h>
+};
+
+cdl_option CYGBLD_ISO_FNMATCH_HEADER {
+ inferred_value 1 <cyg/fileio/fnmatch.h>
+};
+
+cdl_option CYGBLD_ISO_C_TIME_TYPES_HEADER {
+ inferred_value 1 <cyg/libc/time/time.h>
+};
+
+cdl_option CYGBLD_ISO_C_CLOCK_FUNCS_HEADER {
+ inferred_value 1 <cyg/libc/time/time.h>
+};
+
+cdl_option CYGBLD_ISO_SIGNAL_NUMBERS_HEADER {
+ inferred_value 1 <cyg/libc/signals/signal.h>
+};
+
+cdl_option CYGBLD_ISO_SIGNAL_IMPL_HEADER {
+ inferred_value 1 <cyg/libc/signals/signal.h>
+};
+
+cdl_option CYGBLD_ISO_SETJMP_HEADER {
+ inferred_value 1 <cyg/libc/setjmp/setjmp.h>
+};
+
+cdl_option CYGBLD_ISO_DIRENT_HEADER {
+ inferred_value 1 <cyg/fileio/dirent.h>
+};
+
+cdl_option CYGBLD_ISO_BSDTYPES_HEADER {
+ inferred_value 1 <sys/bsdtypes.h>
+};
+
+cdl_option CYGBLD_ISO_OPEN_MAX_HEADER {
+ inferred_value 1 <cyg/fileio/limits.h>
+};
+
+cdl_option CYGBLD_ISO_NAME_MAX_HEADER {
+ inferred_value 1 <cyg/fileio/limits.h>
+};
+
+cdl_option CYGBLD_ISO_NETDB_PROTO_HEADER {
+ inferred_value 1 <net/netdb.h>
+};
+
+cdl_option CYGBLD_ISO_NETDB_SERV_HEADER {
+ inferred_value 1 <net/netdb.h>
+};
+
+cdl_option CYGDBG_KERNEL_DEBUG_GDB_THREAD_SUPPORT {
+ inferred_value 0
+};
+
+cdl_option CYGNUM_LIBC_MAIN_DEFAULT_STACK_SIZE {
+ user_value 16384
+};
+
+cdl_option CYGPKG_NET_TFTPD_THREAD_STACK_SIZE {
+ user_value (CYGNUM_HAL_STACK_SIZE_TYPICAL+(8192))
+};
+
+cdl_component CYGPKG_NET_DHCP {
+ user_value 0
+};
+
+cdl_component CYGHWR_NET_DRIVER_ETH0_MANUAL {
+ inferred_value 0
+};
+
+cdl_component CYGHWR_NET_DRIVER_ETH0_BOOTP {
+ user_value 0
+};
+
+cdl_component CYGHWR_NET_DRIVER_ETH0_ADDRS {
+ user_value 1
+};
+
+cdl_option CYGHWR_NET_DRIVER_ETH0_ADDRS_IP {
+ user_value 10.0.0.57
+};
+
+cdl_option CYGHWR_NET_DRIVER_ETH0_ADDRS_BROADCAST {
+ user_value 10.0.0.255
+};
+
+cdl_option CYGHWR_NET_DRIVER_ETH0_ADDRS_GATEWAY {
+ user_value 10.0.0.1
+};
+
+cdl_option CYGHWR_NET_DRIVER_ETH0_ADDRS_SERVER {
+ user_value 10.0.0.58
+};
+
+
diff --git a/zpu/roadshow/roadshow/net_test/ping_test.c b/zpu/roadshow/roadshow/net_test/ping_test.c new file mode 100644 index 0000000..7a3ce59 --- /dev/null +++ b/zpu/roadshow/roadshow/net_test/ping_test.c @@ -0,0 +1,585 @@ +//==========================================================================
+//
+// tests/ping_test.c
+//
+// Simple test of PING (ICMP) and networking support
+//
+//==========================================================================
+//####BSDCOPYRIGHTBEGIN####
+//
+// -------------------------------------------
+//
+// Portions of this software may have been derived from OpenBSD or other sources,
+// and are covered by the appropriate copyright disclaimers included herein.
+//
+// -------------------------------------------
+//
+//####BSDCOPYRIGHTEND####
+//==========================================================================
+//#####DESCRIPTIONBEGIN####
+//
+// Author(s): gthomas
+// Contributors: gthomas, andrew.lunn@ascom.ch
+// Date: 2000-01-10
+// Purpose:
+// Description:
+//
+//
+//####DESCRIPTIONEND####
+//
+//==========================================================================
+
+// PING test code
+
+#include <network.h>
+#include <cyg/hal/hal_if.h>
+#include <stdio.h>
+#include <cyg/fileio/fileio.h>
+#include <unistd.h>
+#include <pkgconf/system.h>
+#include <pkgconf/net.h>
+#include <cyg/io/file.h>
+#include <cyg/infra/testcase.h>
+#include CYGDAT_DEVS_ETH_OPENCORES_ETHERMAC_CFG
+
+#ifdef CYGBLD_DEVS_ETH_DEVICE_H // Get the device config if it exists
+#include CYGBLD_DEVS_ETH_DEVICE_H // May provide CYGTST_DEVS_ETH_TEST_NET_REALTIME
+#endif
+
+#ifdef CYGPKG_NET_TESTS_USE_RT_TEST_HARNESS // do we use the rt test?
+# ifdef CYGTST_DEVS_ETH_TEST_NET_REALTIME // Get the test ancilla if it exists
+# include CYGTST_DEVS_ETH_TEST_NET_REALTIME
+# endif
+#endif
+
+// Fill in the blanks if necessary
+#ifndef TNR_OFF
+# define TNR_OFF()
+#endif
+#ifndef TNR_ON
+# define TNR_ON()
+#endif
+#ifndef TNR_INIT
+# define TNR_INIT()
+#endif
+#ifndef TNR_PRINT_ACTIVITY
+# define TNR_PRINT_ACTIVITY()
+#endif
+
+#include <cyg/io/io.h>
+
+#include <network.h>
+#include <tftp_support.h>
+
+#include <sys/types.h> //directory
+#include <dirent.h>
+
+//for serial
+cyg_io_handle_t handle;
+extern int inet_aton __P((const char *, struct in_addr *));
+#ifndef CYGPKG_LIBC_STDIO
+#define perror(s) diag_printf(#s ": %s\n", strerror(errno))
+#endif
+#define SHOW_RESULT( _fn, _res ) \
+diag_printf("<FAIL>: " #_fn "() returned %ld %s\n", (long)_res, _res<0?strerror(errno):"");
+
+/*
+#define STACK_SIZE (CYGNUM_HAL_STACK_SIZE_TYPICAL + 0x1000)
+static char stack[STACK_SIZE];
+static cyg_thread thread_data;
+static cyg_handle_t thread_handle;
+*/
+
+
+/* NB!!! must be divisible by 8 */
+#define NUM_PINGS 8192
+#define MAX_PACKET 16384
+#define MIN_PACKET 64
+#define MAX_SEND (IP_MAXPACKET - 100)
+
+#define PACKET_ADD ((MAX_SEND - MIN_PACKET)/NUM_PINGS)
+#define nPACKET_ADD 1
+
+static unsigned char pkt1[MAX_PACKET], pkt2[MAX_PACKET];
+
+#define UNIQUEID 0x1234
+/* we write this much to jffs2 in each go.
+ *
+ * DANGER!!! JFFS2 memory consumption is proportional to the # of write operations,
+ * so reducing this size will make the bootloader run out of memory.
+ */
+#define IOSIZE 16384
+void
+pexit(char *s)
+{
+ CYG_TEST_FAIL_FINISH(s);
+}
+
+// Compute INET checksum
+int
+inet_cksum(u_short *addr, int len)
+{
+ register int nleft = len;
+ register u_short *w = addr;
+ register u_short answer;
+ register u_int sum = 0;
+ u_short odd_byte = 0;
+
+ /*
+ * Our algorithm is simple, using a 32 bit accumulator (sum),
+ * we add sequential 16 bit words to it, and at the end, fold
+ * back all the carry bits from the top 16 bits into the lower
+ * 16 bits.
+ */
+ while( nleft > 1 ) {
+ cyg_uint32 t=*w++;
+ sum += t;
+ nleft -= 2;
+ }
+
+ /* mop up an odd byte, if necessary */
+ if( nleft == 1 ) {
+ *(u_char *)(&odd_byte) = *(u_char *)w;
+ sum += odd_byte;
+ }
+
+ /*
+ * add back carry outs from top 16 bits to low 16 bits
+ */
+ sum = (sum >> 16) + (sum & 0x0000ffff); /* add hi 16 to low 16 */
+ sum += (sum >> 16); /* add carry */
+ answer = ~sum; /* truncate to 16 bits */
+ return (answer);
+}
+
+static int
+show_icmp(unsigned char *pkt, int len,
+ struct sockaddr_in *from, struct sockaddr_in *to)
+{
+ char buffer[100];
+ cyg_uint32 buffer_index = 0;
+ cyg_tick_count_t tp, tv;
+ struct ip *ip;
+ struct icmp *icmp;
+ tv = cyg_current_time();
+ ip = (struct ip *)pkt;
+ if ((len < (int)sizeof(*ip)) || ip->ip_v != IPVERSION)
+ {
+ buffer[0] = '\0';
+ snprintf(buffer, 99, "%s: Short packet or not IP! - Len: %d, Version: %d\r\n",
+ inet_ntoa(from->sin_addr), len, ip->ip_v);
+ buffer_index = strlen(buffer);
+ cyg_io_write(handle, buffer, &buffer_index);
+ return 0;
+ }
+ icmp = (struct icmp *)(pkt + sizeof(*ip));
+ len -= (sizeof(*ip) + 8);
+ tp = *((cyg_tick_count_t *)&icmp->icmp_data);
+ if (icmp->icmp_type != ICMP_ECHOREPLY)
+ {
+ buffer[0] = '\0';
+ snprintf(buffer, 99, "%s: Invalid ICMP - type: %d\r\n",
+ inet_ntoa(from->sin_addr), icmp->icmp_type);
+ buffer_index = strlen(buffer);
+ cyg_io_write(handle, buffer, &buffer_index);
+ return 0;
+ }
+ if (icmp->icmp_id != UNIQUEID)
+ {
+ buffer[0] = '\0';
+ snprintf(buffer, 99, "%s: ICMP received for wrong id - sent: %x, recvd: %x\r\n",
+ inet_ntoa(from->sin_addr), UNIQUEID, icmp->icmp_id);
+ buffer_index = strlen(buffer);
+ cyg_io_write(handle, buffer, &buffer_index);
+ }
+// printf("%d bytes from %s: ", len, inet_ntoa(from->sin_addr));
+// printf("icmp_seq=%d", icmp->icmp_seq);
+ int t=(int)(tv-tp);
+ t*=10;
+// printf(", time=%d ms\n", t);
+ return (from->sin_addr.s_addr == to->sin_addr.s_addr);
+}
+
+static void
+ping_host(int s, struct sockaddr_in *host)
+{
+ char buffer[100];
+ cyg_uint32 buffer_index = 0;
+ struct icmp *icmp = (struct icmp *)pkt1;
+ int icmp_len = MIN_PACKET;
+ int seq = 0, ok_recv = 0, bogus_recv = 0;
+ cyg_tick_count_t *tp;
+ long *dp;
+ struct sockaddr_in from;
+ int len;
+ socklen_t fromlen;
+
+ ok_recv = 0;
+ bogus_recv = 0;
+ snprintf(buffer, 99, "PING server %s\r\n", inet_ntoa(host->sin_addr));
+ buffer_index = strlen(buffer);
+ cyg_io_write(handle, buffer, &buffer_index);
+
+
+ for (seq = 0; seq < NUM_PINGS; seq++, icmp_len += PACKET_ADD )
+ {
+ cyg_thread_delay(50);
+ TNR_ON();
+
+ memset(pkt1, 0, sizeof(pkt1)); // make sure we start each time w/same situation...
+ // Build ICMP packet
+ icmp->icmp_type = ICMP_ECHO;
+ icmp->icmp_code = 0;
+ icmp->icmp_cksum = 0;
+ icmp->icmp_seq = seq;
+ icmp->icmp_id = 0x1234;
+ // Set up ping data
+ tp = (cyg_tick_count_t *)&icmp->icmp_data;
+ memset(tp, 0xff, icmp_len); // try to fish out bit 1 force to 0.
+ *tp++ = cyg_current_time();
+ tp++;
+ dp = (long *)tp;
+
+ // Add checksum
+ icmp->icmp_cksum = inet_cksum( (u_short *)icmp, icmp_len+8);
+ // Send it off
+ if (sendto(s, icmp, icmp_len+8, 0, (struct sockaddr *)host, sizeof(*host)) < 0) {
+ TNR_OFF();
+ perror("sendto");
+ continue;
+ }
+ // Wait for a response
+ fromlen = sizeof(from);
+ len = recvfrom(s, pkt2, sizeof(pkt2), 0, (struct sockaddr *)&from, &fromlen);
+ TNR_OFF();
+ if (len < 0) {
+ perror("recvfrom");
+ inet_cksum( (u_short *)icmp, icmp_len+8);
+ icmp_len = MIN_PACKET - PACKET_ADD; // just in case - long routes
+ } else {
+ if (show_icmp(pkt2, len, &from, host)) {
+ ok_recv++;
+ } else {
+ bogus_recv++;
+ }
+ }
+ }
+ TNR_OFF();
+ snprintf(buffer, 99, "Sent %d packets, received %d OK, %d bad\r\n", NUM_PINGS, ok_recv, bogus_recv);
+ buffer_index = strlen(buffer);
+ cyg_io_write(handle, buffer, &buffer_index);
+}
+
+#ifdef CYGPKG_PROFILE_GPROF
+#include <cyg/profile/profile.h>
+
+extern char _stext, _etext; // Defined by the linker
+
+static void
+start_profile(void)
+{
+ // This starts up the system-wide profiling, gathering
+ // profile information on all of the code, with a 16 byte
+ // "bucket" size, at a rate of 100us/profile hit.
+ // Note: a bucket size of 16 will give pretty good function
+ // resolution. Much smaller and the buffer becomes
+ // much too large for very little gain.
+ // Note: a timer period of 100us is also a reasonable
+ // compromise. Any smaller and the overhead of
+ // handling the timter (profile) interrupt could
+ // swamp the system. A fast processor might get
+ // by with a smaller value, but a slow one could
+ // even be swamped by this value. If the value is
+ // too large, the usefulness of the profile is reduced.
+
+ // no more interrupts than 1/10ms.
+ //profile_on(&_stext, &_etext, 16, 10000); // DRAM
+ //profile_on((void *)0x2000000, (void *)0x4000000, 32, 10000); // DRAM
+ //profile_on((void *)0, (void *)0x40000, 16, 10000); // SRAM
+ //profile_on(0, &_etext, 32, 10000); // SRAM & DRAM
+}
+#endif
+
+static void
+ping_test(struct bootp *bp)
+{
+ struct protoent *p;
+ struct timeval tv;
+ struct sockaddr_in host;
+ int s;
+
+ p = getprotobyname("icmp");
+ if (p == NULL)
+ {
+ pexit("getprotobyname");
+ return;
+ }
+ s = socket(AF_INET, SOCK_RAW, p->p_proto);
+ if (s < 0) {
+ pexit("socket");
+ return;
+ }
+ tv.tv_sec = 4;
+ tv.tv_usec = 0;
+ setsockopt(s, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv));
+
+ // default is 8192 bytes which is not big enough for our ping tests...
+ int sndsize=70000;
+ setsockopt(s, SOL_SOCKET, SO_RCVBUF, (char *)&sndsize,
+ (int)sizeof(sndsize));
+ sndsize=70000;
+ setsockopt(s, SOL_SOCKET, SO_SNDBUF, (char *)&sndsize,
+ (int)sizeof(sndsize));
+
+ // Set up host address
+ host.sin_family = AF_INET;
+ host.sin_len = sizeof(host);
+ inet_aton("10.0.0.9", &(host.sin_addr)); // edgarpc dev machine
+// inet_aton("10.0.0.1", &host.sin_addr); // cisco router
+ host.sin_port = 0;
+ ping_host(s, &host);
+}
+
+void done_test()
+{
+}
+
+void
+net_test(void)
+{
+
+ Cyg_ErrNo err;
+ diag_printf("Start PING test\r\n");
+ TNR_INIT();
+
+ err = cyg_io_lookup("/dev/ser0", &handle);
+ if(err != ENOERR)
+ {
+ diag_printf("cannot open serial /dev/ser0");
+ return;
+ }
+ printf("Testing stdout...\r\n");
+
+#ifdef CYGHWR_NET_DRIVER_ETH0
+ if (eth0_up) {
+ ping_test(ð0_bootp_data);
+ }
+#endif
+#ifdef CYGHWR_NET_DRIVER_ETH1
+ if (eth1_up) {
+ ping_test(ð1_bootp_data);
+ }
+#endif
+ TNR_PRINT_ACTIVITY();
+ CYG_TEST_PASS_FINISH("Ping test OK");
+ done_test();
+}
+
+
+int getFileName(const char *extension, char *fileName)
+{
+ int found = 0;
+ DIR* ramfs = opendir("/ramfs");
+ if(ramfs == NULL)
+ {
+ diag_printf("cannot open /ramfs\n");
+ return found;
+ }
+ while(1)
+ {
+ struct dirent *entry = readdir( ramfs );
+ int len = 0;
+ if( entry == NULL )
+ break;
+ len = strlen(entry->d_name);
+ if(len > 4 && entry->d_name[len - 4] == '.' &&
+ entry->d_name[len - 3] == 'p' &&
+ entry->d_name[len - 2] == 'h' &&
+ entry->d_name[len - 1] == 'i')
+ {
+ found = 1;
+ strcpy(fileName, "/ramfs/");
+ strcat(fileName, entry->d_name);
+ }
+ }
+ closedir(ramfs);
+ ramfs = NULL;
+ return found;
+}
+
+static char buf[IOSIZE];
+
+static int copyfile( char *name2, char *name1 )
+{
+
+ int err = 0;
+ int fd1 = -1, fd2 = -1;
+ ssize_t done = 0, wrote = 0, current = 0;
+
+ diag_printf(" copy file %s -> %s\n",name2,name1);
+
+ fd1 = creat(name1, O_TRUNC | O_CREAT);
+ if( fd1 < 0 )
+ {
+ SHOW_RESULT( creat, fd1 );
+ diag_printf(" %s", name1);
+ return -1;
+ }
+
+ fd2 = open( name2, O_RDONLY );
+ if( fd2 < 0 )
+ {
+ SHOW_RESULT( open, fd2 );
+ diag_printf(" %s", name2);
+ return -1;
+ }
+
+ for(;;)
+ {
+ done = read( fd2, buf, IOSIZE );
+ if( done < 0 )
+ {
+ SHOW_RESULT( read, done );
+ return -1;
+ }
+
+ if( done == 0 ) break;
+
+ wrote = write( fd1, buf, done );
+ if( wrote != done )
+ {
+ SHOW_RESULT( write, wrote );
+ return -1;
+ }
+
+ current += wrote;
+ if( wrote != done ) break;
+ }
+ diag_printf("wrote %d\n", current);
+ err = close( fd1 );
+ if( err < 0 )
+ {
+ SHOW_RESULT( close, err );
+ diag_printf(" %s", name1);
+ return -1;
+ }
+
+ err = close( fd2 );
+ if( err < 0 )
+ {
+ SHOW_RESULT( close, err );
+ diag_printf(" %s", name2);
+ return -1;
+ }
+ return 0;
+}
+
+int isCompleted(const char *fileName)
+{
+ int err = access( fileName, W_OK );
+ int fd = 0;
+ char readyBuffer[5];
+ if( err < 0 && errno != EACCES )
+ {
+ SHOW_RESULT( access, err );
+ return 0;
+ }
+ fd = open(fileName, O_RDONLY);
+ if(fd < 0)
+ {
+ SHOW_RESULT( open, errno );
+ return 0;
+ }
+ err = lseek(fd, -5, SEEK_END);
+ if(err < 0)
+ {
+ SHOW_RESULT( lseek, err );
+ close(fd);
+ return 0;
+ }
+ err = read(fd, readyBuffer, 4);
+ if(err < 0)
+ {
+ SHOW_RESULT( read, err );
+ close(fd);
+ return 0;
+ }
+ readyBuffer[4] = '\0';
+ if(strncmp(readyBuffer, "Done", 4) != 0)
+ {
+ //diag_printf("Coudn't read \"Done\" at the end of the firmware file %s\n", readyBuffer);
+ close(fd);
+ return 0;
+ }
+ close(fd);
+ diag_printf("found!\n");
+ return 1;
+}
+
+static void ramfs_polling(cyg_addrword_t data)
+{
+ char fileName[100];
+ int found = 0;
+ while(1)
+ {
+ cyg_thread_delay(100);
+ //scan the file system for a new .phi file
+ found = getFileName("phi", fileName);
+ if(found)
+ {
+ //check if the file has been transfered
+ if(isCompleted(fileName))
+ {
+ //move the file to flash
+ unlink("/jffs2/firmware.bin");
+ copyfile(fileName, "/jffs2/firmware.bin");
+ diag_printf("firmware file copied to jffs2\n");
+ unlink(fileName);
+ diag_printf("unmounting /jffs\n");
+ umount("/jffs2");
+ diag_printf("Resetting...\n");
+// CYGACC_CALL_IF_RESET();
+ }
+ }
+ }
+}
+
+static unsigned char ramfs_polling_stack[CYGNUM_HAL_STACK_SIZE_TYPICAL];
+static cyg_handle_t ramfs_polling_handle;
+static cyg_thread ramfs_polling_thread;
+
+void start_ramfs_polling()
+{
+
+ cyg_thread_create(10, &ramfs_polling, 0, "ramfs_polling",
+ ramfs_polling_stack, CYGNUM_HAL_STACK_SIZE_TYPICAL,
+ &ramfs_polling_handle, &ramfs_polling_thread);
+ cyg_thread_resume(ramfs_polling_handle);
+}
+
+struct tftpd_fileops fileops = {open,
+ close,
+ write,
+ read};
+
+externC void phi_init_all_network_interfaces();
+
+int main(int argc, char **argv)
+{
+ diag_printf("Entered net_test main()\n");
+
+ int server_id = 0;
+
+ init_all_network_interfaces();
+
+
+
+ int i=0;
+ while(1)
+ {
+ cyg_thread_delay(500);
+// net_test();
+ diag_printf("sleeping... %d\n", i++);
+ }
+ return 0;
+}
|