From da2692a4581adc86bc73c6c74523ba344dc1a09b Mon Sep 17 00:00:00 2001 From: Kathlene Magnus Date: Wed, 18 Dec 2024 14:45:09 -0600 Subject: [PATCH 1/4] Simple framework for creating test elfs --- test/elfs/CMakeLists.txt | 45 ++ test/elfs/README.md | 7 + test/elfs/common/TEST_TEMPLATE.s | 25 + test/elfs/common/host.s | 8 + test/elfs/common/macros.s | 26 + test/elfs/common/main.ld | 13 + test/elfs/src/.DS_Store | Bin 0 -> 6148 bytes test/elfs/src/CMakeLists.txt | 11 + test/elfs/src/add/CMakeLists.txt | 3 + test/elfs/src/add/add.s | 27 + test/elfs/src/add_bne/CMakeLists.txt | 3 + test/elfs/src/add_bne/add_bne.s | 30 + test/elfs/src/dhrystone/CMakeLists.txt | 7 + test/elfs/src/dhrystone/Makefile | 18 + test/elfs/src/dhrystone/dhry.h | 431 ++++++++++ test/elfs/src/dhrystone/dhry_1.c | 405 ++++++++++ test/elfs/src/dhrystone/dhry_2.c | 192 +++++ test/elfs/src/dhrystone/dhrystone.c | 1023 ++++++++++++++++++++++++ test/elfs/src/dhrystone/strcmp.S | 160 ++++ test/elfs/src/lui/CMakeLists.txt | 3 + test/elfs/src/lui/lui.s | 30 + test/elfs/src/misalign/CMakeLists.txt | 3 + test/elfs/src/misalign/misalign.s | 48 ++ test/elfs/src/nop/CMakeLists.txt | 3 + test/elfs/src/nop/nop.s | 25 + test/elfs/src/sub_bgeu/CMakeLists.txt | 3 + test/elfs/src/sub_bgeu/sub_bgeu.s | 30 + test/elfs/src/sw_lw_blt/CMakeLists.txt | 3 + test/elfs/src/sw_lw_blt/sw_lw_blt.s | 45 ++ 29 files changed, 2627 insertions(+) create mode 100644 test/elfs/CMakeLists.txt create mode 100644 test/elfs/README.md create mode 100644 test/elfs/common/TEST_TEMPLATE.s create mode 100644 test/elfs/common/host.s create mode 100644 test/elfs/common/macros.s create mode 100644 test/elfs/common/main.ld create mode 100644 test/elfs/src/.DS_Store create mode 100644 test/elfs/src/CMakeLists.txt create mode 100644 test/elfs/src/add/CMakeLists.txt create mode 100644 test/elfs/src/add/add.s create mode 100644 test/elfs/src/add_bne/CMakeLists.txt create mode 100644 test/elfs/src/add_bne/add_bne.s create mode 100644 test/elfs/src/dhrystone/CMakeLists.txt create mode 100644 test/elfs/src/dhrystone/Makefile create mode 100644 test/elfs/src/dhrystone/dhry.h create mode 100644 test/elfs/src/dhrystone/dhry_1.c create mode 100644 test/elfs/src/dhrystone/dhry_2.c create mode 100644 test/elfs/src/dhrystone/dhrystone.c create mode 100644 test/elfs/src/dhrystone/strcmp.S create mode 100644 test/elfs/src/lui/CMakeLists.txt create mode 100644 test/elfs/src/lui/lui.s create mode 100644 test/elfs/src/misalign/CMakeLists.txt create mode 100644 test/elfs/src/misalign/misalign.s create mode 100644 test/elfs/src/nop/CMakeLists.txt create mode 100644 test/elfs/src/nop/nop.s create mode 100644 test/elfs/src/sub_bgeu/CMakeLists.txt create mode 100644 test/elfs/src/sub_bgeu/sub_bgeu.s create mode 100644 test/elfs/src/sw_lw_blt/CMakeLists.txt create mode 100644 test/elfs/src/sw_lw_blt/sw_lw_blt.s diff --git a/test/elfs/CMakeLists.txt b/test/elfs/CMakeLists.txt new file mode 100644 index 0000000..32fac60 --- /dev/null +++ b/test/elfs/CMakeLists.txt @@ -0,0 +1,45 @@ +cmake_minimum_required(VERSION 3.27.6) + +project(riscv_assembly_tests ASM) + +# Unset these variables to prevent include of Mac SDK +set(CMAKE_OSX_SYSROOT "/") +set(CMAKE_OSX_DEPLOYMENT_TARGET "") + +if(NOT RISCV_TOOLCHAIN) + message(FATAL_ERROR "You must supply a -DRISCV_TOOLCHAIN=/path") +else() + message("-- Using RISCV_TOOLCHAIN: ${RISCV_TOOLCHAIN}") + if(EXISTS ${RISCV_TOOLCHAIN}/bin/riscv64-unknown-elf-as) + set(CMAKE_ASM_COMPILER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-elf-as") + set(CMAKE_C_COMPILER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-elf-gcc") + set(CMAKE_CXX_COMPILER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-elf-g++") + set(CMAKE_LINKER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-elf-ld") + elseif(EXISTS ${RISCV_TOOLCHAIN}//bin/riscv64-unknown-linux-gnu-as) + set(CMAKE_ASM_COMPILER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-linux-gnu-as") + set(CMAKE_C_COMPILER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-linux-gnu-gcc") + set(CMAKE_CXX_COMPILER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-linux-gnu-g++") + set(CMAKE_LINKER "${RISCV_TOOLCHAIN}/bin/riscv64-unknown-linux-gnu-ld") + else() + message(FATAL_ERROR "Cannot find tools in the given RISCV_TOOLCHAIN") + endif() +endif() + +set(BASE_DIR ${PROJECT_SOURCE_DIR}) + +# Don't test compilers. The riscv toolchain's linker does not support the option '-search_paths_first' +set(CMAKE_C_COMPILER_WORKS 1) +#set(CMAKE_C_FLAGS "-march=rv64gc") +#set(CMAKE_LINK_C_FLAGS "") +set(CMAKE_CXX_COMPILER_WORKS 1) +#set(CMAKE_CXX_FLAGS "-march=rv64gc") +#set(CMAKE_LINK_CXX_FLAGS "") + +# Linker setup +set(LINKER_SCRIPT ${BASE_DIR}/common/main.ld) +set(CMAKE_ASM_LINKER_FLAGS "-T ${LINKER_SCRIPT} -e main") +set(CMAKE_ASM_LINK_EXECUTABLE "${CMAKE_LINKER} ${CMAKE_ASM_LINKER_FLAGS} -o ") + +include_directories(common) + +add_subdirectory(src) diff --git a/test/elfs/README.md b/test/elfs/README.md new file mode 100644 index 0000000..5919a15 --- /dev/null +++ b/test/elfs/README.md @@ -0,0 +1,7 @@ +Build directions: +``` +mkdir build +cd build +cmake .. -DRISCV_TOOLCHAIN= +make +``` diff --git a/test/elfs/common/TEST_TEMPLATE.s b/test/elfs/common/TEST_TEMPLATE.s new file mode 100644 index 0000000..2d925dd --- /dev/null +++ b/test/elfs/common/TEST_TEMPLATE.s @@ -0,0 +1,25 @@ +/* Test: [test name] + * ISA: [isa string required] + * Description: [description of test] + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +// Insert your test in main +main: + +// Jump or fall through here if test is successful +pass: + test_pass + +// Jump here if test is unsuccessful +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/common/host.s b/test/elfs/common/host.s new file mode 100644 index 0000000..8ecc3ce --- /dev/null +++ b/test/elfs/common/host.s @@ -0,0 +1,8 @@ +.section .tohost,"aw" +.globl tohost +.globl fromhost + +tohost: + .dword 0 +fromhost: + .dword 0 diff --git a/test/elfs/common/macros.s b/test/elfs/common/macros.s new file mode 100644 index 0000000..7ee9b60 --- /dev/null +++ b/test/elfs/common/macros.s @@ -0,0 +1,26 @@ +/* Test: nop.elf + * ISA: rv64i + * Description: Stream of nops. + */ + +.macro test_pass + li x1, 1 + la x2, tohost + sw x1, 0(x2) + wfi +.endm + +.macro test_fail + li x1, 2 + la x2, tohost + sw x1, 0(x2) + wfi +.endm + +.macro start_tracepoint + xor x0, x0, x0 +.endm + +.macro stop_tracepoint + xor x0, x1, x1 +.endm diff --git a/test/elfs/common/main.ld b/test/elfs/common/main.ld new file mode 100644 index 0000000..5f30a67 --- /dev/null +++ b/test/elfs/common/main.ld @@ -0,0 +1,13 @@ +OUTPUT_ARCH("riscv") + +SECTIONS +{ + . = 0x80000000; + .text : { *(.text) } + . = ALIGN(0x1000); + .tohost : { *(.tohost) } + . = ALIGN(0x1000); + .data : { *(.data) } + . = ALIGN(0x1000); + .bss : { *(.bss) } +} diff --git a/test/elfs/src/.DS_Store b/test/elfs/src/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..6f6e0a4c4d82b564d36aa74d4dacf74e03a67dd5 GIT binary patch literal 6148 zcmeHKJ5Iwu5S_)5FrOkNMG9XaMJieonGVrJLUe@SC?GjF5=68HBu;>Y-~vz~QE&uq zKtqE-IRIDS&F(5*+nZDfA+#gyK4)jf@A>7kSt1hcaoi%R6OoU>SX;(q3C{DV#DZRF z00rNp)j3Fqqe`7ya1J;J{-y)`-SudnVv3W2`TZ5wd1jbKQ7=h*Sn;2BU+>SaUN+2Z zJSRIkH18UqjTRLj?NN`8sbAv#s8*Q#>&bZGfZPLa0`tY8Cp3Ayhlo16>zt%oM72 z5|SDB(ab`hP=sX1dLYY5gbLm49B>X49q`o4I`99Rv(Nv}8b(uohf=O@3@`AVGH4GWZ1$+SvHD(I2f^dHXqz!Iz4*aSE-!=Z; AZ~y=R literal 0 HcmV?d00001 diff --git a/test/elfs/src/CMakeLists.txt b/test/elfs/src/CMakeLists.txt new file mode 100644 index 0000000..d8cfbb8 --- /dev/null +++ b/test/elfs/src/CMakeLists.txt @@ -0,0 +1,11 @@ +project (BASE_TESTS) + +set (CMAKE_ASM_FLAGS "-march=rv64i_zicsr_zifencei") + +add_subdirectory (nop) +add_subdirectory (add) +add_subdirectory (add_bne) +add_subdirectory (sub_bgeu) +add_subdirectory (lui) +add_subdirectory (sw_lw_blt) +add_subdirectory (misalign) diff --git a/test/elfs/src/add/CMakeLists.txt b/test/elfs/src/add/CMakeLists.txt new file mode 100644 index 0000000..2d41e9c --- /dev/null +++ b/test/elfs/src/add/CMakeLists.txt @@ -0,0 +1,3 @@ +project(add_test) + +add_executable (add.elf add.s) diff --git a/test/elfs/src/add/add.s b/test/elfs/src/add/add.s new file mode 100644 index 0000000..4eead84 --- /dev/null +++ b/test/elfs/src/add/add.s @@ -0,0 +1,27 @@ +/* Test: add.elf + * ISA: rv64i + * Description: Stream of reg-reg add instructions. + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +main: + start_tracepoint + .rept 1000 + add x7, x6, x5 + .endr + stop_tracepoint + +pass: + test_pass + +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/add_bne/CMakeLists.txt b/test/elfs/src/add_bne/CMakeLists.txt new file mode 100644 index 0000000..3b49bc7 --- /dev/null +++ b/test/elfs/src/add_bne/CMakeLists.txt @@ -0,0 +1,3 @@ +project(add_bne_test) + +add_executable (add_bne.elf add_bne.s) diff --git a/test/elfs/src/add_bne/add_bne.s b/test/elfs/src/add_bne/add_bne.s new file mode 100644 index 0000000..0a8fcbf --- /dev/null +++ b/test/elfs/src/add_bne/add_bne.s @@ -0,0 +1,30 @@ +/* Test: add.elf + * ISA: rv64i + * Description: Stream of reg-reg add instructions with a branch. + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +main: + addi x28, x0, 10 + addi x7, x0, 1 +loop: + .rept 100 + add x5, x5, x7 + .endr + addi x28, x28, -1 + bne x28, zero, loop + +pass: + test_pass + +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/dhrystone/CMakeLists.txt b/test/elfs/src/dhrystone/CMakeLists.txt new file mode 100644 index 0000000..3b9b633 --- /dev/null +++ b/test/elfs/src/dhrystone/CMakeLists.txt @@ -0,0 +1,7 @@ +project(dhrystone_test) + +set(CMAKE_C_INCLUDES "/Library/Developer/CommandLineTools/SDKs/MacOSX.sdk/usr/include") +set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -O3 -DTIME -DNOENUM -Wno-implicit -save-temps") +set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -fno-builtin-printf -fno-common -falign-functions=4") +set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Xlinker --defsym=__stack_size=0x800 -Xlinker --defsym=__heap_size=0x1000") +add_executable(dhrystone.elf dhry_1.c dhry_2.c strcmp.S) diff --git a/test/elfs/src/dhrystone/Makefile b/test/elfs/src/dhrystone/Makefile new file mode 100644 index 0000000..6fb3e5a --- /dev/null +++ b/test/elfs/src/dhrystone/Makefile @@ -0,0 +1,18 @@ +DHRY-LFLAGS = + +DHRY-CFLAGS := -O3 -DTIME -DNOENUM -Wno-implicit -save-temps +DHRY-CFLAGS += -fno-builtin-printf -fno-common -falign-functions=4 + +#Uncomment below for FPGA run, default DHRY_ITERS is 2000 for RTL +#DHRY-CFLAGS += -DDHRY_ITERS=20000000 + +SRC = dhry_1.c dhry_2.c strcmp.S +HDR = dhry.h + +override CFLAGS += $(DHRY-CFLAGS) $(XCFLAGS) -Xlinker --defsym=__stack_size=0x800 -Xlinker --defsym=__heap_size=0x1000 +dhrystone: $(SRC) $(HDR) + $(CC) $(CFLAGS) $(SRC) $(LDFLAGS) $(LOADLIBES) $(LDLIBS) -o $@ + +clean: + rm -f *.i *.s *.o dhrystone dhrystone.hex + diff --git a/test/elfs/src/dhrystone/dhry.h b/test/elfs/src/dhrystone/dhry.h new file mode 100644 index 0000000..861e316 --- /dev/null +++ b/test/elfs/src/dhrystone/dhry.h @@ -0,0 +1,431 @@ +/* + **************************************************************************** + * + * "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, E STE 35 + * Postfach 3240 + * 8520 Erlangen + * Germany (West) + * Phone: [xxx-49]-9131-7-20330 + * (8-17 Central European Time) + * Usenet: ..!mcvax!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 aX * + * + * 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 +#undef TIMES +#define TIMES +#endif + /* Use times(2) time function unless */ + /* explicitly defined otherwise */ + +#ifdef MSC_CLOCK +#undef HZ +#undef TIMES +#include +#define HZ CLK_TCK +#endif + /* Use Microsoft C hi-res clock */ + +#ifdef TIMES +#include +#include + /* 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 + /* 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/test/elfs/src/dhrystone/dhry_1.c b/test/elfs/src/dhrystone/dhry_1.c new file mode 100644 index 0000000..2c3f40e --- /dev/null +++ b/test/elfs/src/dhrystone/dhry_1.c @@ -0,0 +1,405 @@ +/* + **************************************************************************** + * + * "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" + +#ifndef DHRY_ITERS +#define DHRY_ITERS 2000 +#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]; + +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 (2*HZ) + /* 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 +#ifdef MSC_CLOCK +extern clock_t clock(); +#define Too_Small_Time (2*HZ) +#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"); + } +#ifdef DHRY_ITERS + Number_Of_Runs = DHRY_ITERS; +#else + printf ("Please give the number of runs through the benchmark: "); + { + int n; + scanf ("%d", &n); + Number_Of_Runs = n; + } + printf ("\n"); +#endif + + 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 +#ifdef MSC_CLOCK + Begin_Time = clock(); +#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 +#ifdef MSC_CLOCK + End_Time = clock(); +#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 ("%d \n", (int)Microseconds); + printf ("Dhrystones per Second: "); + //printf ("%6.1f \n", Dhrystones_Per_Second); + printf ("%d \n", (int)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 + + diff --git a/test/elfs/src/dhrystone/dhry_2.c b/test/elfs/src/dhrystone/dhry_2.c new file mode 100644 index 0000000..63a3d3e --- /dev/null +++ b/test/elfs/src/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/test/elfs/src/dhrystone/dhrystone.c b/test/elfs/src/dhrystone/dhrystone.c new file mode 100644 index 0000000..d5180ed --- /dev/null +++ b/test/elfs/src/dhrystone/dhrystone.c @@ -0,0 +1,1023 @@ +#ifdef NOTDEFINED /* To compile and run this file, say "sh dry.c" */ + case $0 in + *.c) ;; + sh) echo 'Use "sh dry.c", not "sh < dry.c"' >&2; exit 1;; + *) echo 'Filename must end in ".c"' >&2; exit 1;; + esac + + echo "${CC=cc} -c ${CFLAGS} $0 -o dry1.o" + ${CC} -c ${CFLAGS} $0 -o dry1.o || exit 1 + echo "${CC} -DPASS2 ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2" + ${CC} -DPASS2 ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2 || exit 1 + ./dry2 ${1-50000} 2>/dev/null + echo "${CC=cc} -c -DREG ${CFLAGS} $0 -o dry1.o" + ${CC} -c -DREG ${CFLAGS} $0 -o dry1.o || exit 1 + echo "${CC} -DPASS2 -DREG ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2nr" + ${CC} -DPASS2 -DREG ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2nr || exit 1 + ./dry2nr ${1-50000} 2>/dev/null + echo "${CC=cc} -c -O ${CFLAGS} $0 -o dry1.o" + ${CC} -c -O ${CFLAGS} $0 -o dry1.o || exit 1 + echo "${CC} -DPASS2 -O ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2o" + ${CC} -DPASS2 -O ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2o || exit 1 + ./dry2o ${1-50000} 2>/dev/null + rm -f dry1.o + + exit 0 +#endif + +/****************** "DHRYSTONE" Benchmark Program ***************************/ +#define Version "C, Version 2.2" +/* File: dhry_1.c (part 2 of 3) + * Author: Reinhold P. Weicker + * Siemens Nixdorf, Paderborn/Germany + * weicker@specbench.org + * Date: May 25, 1988 + * Modified: Steven Pemberton, CWI, Amsterdam; Steven.Pemberton@cwi.nl + * Date: October, 1993; March 1995 + * Included both files into one source, that gets compiled + * in two passes. Made program auto-compiling, and auto-running, + * and generally made it much easier to use. + * + * 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. + * + *************************************************************************** + * + * Defines: The following "Defines" are possible: + * -DREG (default: Not defined) + * As an approximation to what an average C programmer + * might do, causes the "register" storage class to be applied + * - 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. + * + *************************************************************************** + * + * History: Version C/2.1 was made for two reasons: + * + * 1) There was 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. + * + * Version C/2.2, Steven Pemberton, October 1993 + * Functionally, identical to version 2.2; the changes are in + * how you compile and use it: + * - Everything is in one file now, but compiled in 2 passes + * - Compile (and run) by running the file through the shell: 'sh dhry.c" + * - Uses the system definition of HZ if one can be found + * - HZ must be defined, otherwise it won't compile (no defaults here) + * - The (uninteresting) output is printed to stderr (dhry2 > /dev/null) + * - The number of loops is passed as a parameter, rather than read + * (dhry2 500000) + * - If the number of loops is insufficient to get a good result, + * it repeats it with loops*10 until it is enough (rather than just + * stopping) + * - Output says which sort of clock it is using, and the HZ value + * - You can use -DREG instead of the -DREG=register of previous versions + * - Some stylistic cleanups. + * + *************************************************************************** + * + * Compilation model and measurement (IMPORTANT): + * + * 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 aX * + * + * 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: */ + +/* variables for time measurement: */ + +#ifdef TIME + +#define CLOCK_TYPE "time()" +#undef HZ +#define HZ (1) /* time() returns time in seconds */ +extern long time(); /* see library function "time" */ +#define Too_Small_Time 2 /* Measurements should last at least 2 seconds */ +#define Start_Timer() Begin_Time = time ( (long *) 0) +#define Stop_Timer() End_Time = time ( (long *) 0) + +#else + +#ifdef MSC_CLOCK /* Use Microsoft C hi-res clock */ + +#undef HZ +#undef TIMES +#include +#define HZ CLK_TCK +#define CLOCK_TYPE "MSC clock()" +extern clock_t clock(); +#define Too_Small_Time (2*HZ) +#define Start_Timer() Begin_Time = clock() +#define Stop_Timer() End_Time = clock() + +#else + /* Use times(2) time function unless */ + /* explicitly defined otherwise */ +#define CLOCK_TYPE "times()" +#include +#include +#ifndef HZ /* Added by SP 900619 */ +#include /* If your system doesn't have this, use -DHZ=xxx */ +#else + *** You must define HZ!!! *** +#endif /* HZ */ +#ifndef PASS2 +struct tms time_info; +#endif +/*extern int times ();*/ + /* see library function "times" */ +#define Too_Small_Time (2*HZ) + /* Measurements should last at least about 2 seconds */ +#define Start_Timer() times(&time_info); Begin_Time=(long)time_info.tms_utime +#define Stop_Timer() times(&time_info); End_Time = (long)time_info.tms_utime + +#endif /* MSC_CLOCK */ +#endif /* TIME */ + + +#define Mic_secs_Per_Second 1000000.0 +#define NUMBER_OF_RUNS 50000 /* Default number of runs */ + +#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 + /* 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; + +#ifndef PASS2 + +/* 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; +#undef REG +#define REG register +#endif + +Boolean Done; + +long Begin_Time, + End_Time, + User_Time; +float Microseconds, + Dhrystones_Per_Second; + +/* end of variables for time measurement */ + + +main (argc, argv) int argc; char *argv[]; +/*****/ + + /* 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; + + /* Arguments */ + if (argc > 2) + { + printf ("Usage: %s [number of loops]\n", argv[0]); + exit (1); + } + if (argc == 2) + { + Number_Of_Runs = atoi (argv[1]); + } else + { + Number_Of_Runs = NUMBER_OF_RUNS; + } + if (Number_Of_Runs <= 0) + { + Number_Of_Runs = NUMBER_OF_RUNS; + } + + /* Initializations */ + + /* Turn on FP unit */ + __asm__ volatile ("li t0, 0x2000" ::: "t0"); + __asm__ volatile ("csrs mstatus, t0"); + + 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 %s\n", Version); + if (Reg) + { + printf ("Program compiled with 'register' attribute\n"); + } + else + { + printf ("Program compiled without 'register' attribute\n"); + } + printf ("Using %s, HZ=%d\n", CLOCK_TYPE, HZ); + printf ("\n"); + + Done = false; + while (!Done) { + + printf ("Trying %d runs through Dhrystone:\n", Number_Of_Runs); + + /***************/ + /* Start timer */ + /***************/ + + Start_Timer(); + + 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 */ + /**************/ + + Stop_Timer(); + + User_Time = End_Time - Begin_Time; + + if (User_Time < Too_Small_Time) + { + printf ("Measured time too small to obtain meaningful results\n"); + Number_Of_Runs = Number_Of_Runs * 10; + printf ("\n"); + } else Done = true; + } + + fprintf (stderr, "Final values of the variables used in the benchmark:\n"); + fprintf (stderr, "\n"); + fprintf (stderr, "Int_Glob: %d\n", Int_Glob); + fprintf (stderr, " should be: %d\n", 5); + fprintf (stderr, "Bool_Glob: %d\n", Bool_Glob); + fprintf (stderr, " should be: %d\n", 1); + fprintf (stderr, "Ch_1_Glob: %c\n", Ch_1_Glob); + fprintf (stderr, " should be: %c\n", 'A'); + fprintf (stderr, "Ch_2_Glob: %c\n", Ch_2_Glob); + fprintf (stderr, " should be: %c\n", 'B'); + fprintf (stderr, "Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]); + fprintf (stderr, " should be: %d\n", 7); + fprintf (stderr, "Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]); + fprintf (stderr, " should be: Number_Of_Runs + 10\n"); + fprintf (stderr, "Ptr_Glob->\n"); + fprintf (stderr, " Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp); + fprintf (stderr, " should be: (implementation-dependent)\n"); + fprintf (stderr, " Discr: %d\n", Ptr_Glob->Discr); + fprintf (stderr, " should be: %d\n", 0); + fprintf (stderr, " Enum_Comp: %d\n", Ptr_Glob->variant.var_1.Enum_Comp); + fprintf (stderr, " should be: %d\n", 2); + fprintf (stderr, " Int_Comp: %d\n", Ptr_Glob->variant.var_1.Int_Comp); + fprintf (stderr, " should be: %d\n", 17); + fprintf (stderr, " Str_Comp: %s\n", Ptr_Glob->variant.var_1.Str_Comp); + fprintf (stderr, " should be: DHRYSTONE PROGRAM, SOME STRING\n"); + fprintf (stderr, "Next_Ptr_Glob->\n"); + fprintf (stderr, " Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp); + fprintf (stderr, " should be: (implementation-dependent), same as above\n"); + fprintf (stderr, " Discr: %d\n", Next_Ptr_Glob->Discr); + fprintf (stderr, " should be: %d\n", 0); + fprintf (stderr, " Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp); + fprintf (stderr, " should be: %d\n", 1); + fprintf (stderr, " Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp); + fprintf (stderr, " should be: %d\n", 18); + fprintf (stderr, " Str_Comp: %s\n", + Next_Ptr_Glob->variant.var_1.Str_Comp); + fprintf (stderr, " should be: DHRYSTONE PROGRAM, SOME STRING\n"); + fprintf (stderr, "Int_1_Loc: %d\n", Int_1_Loc); + fprintf (stderr, " should be: %d\n", 5); + fprintf (stderr, "Int_2_Loc: %d\n", Int_2_Loc); + fprintf (stderr, " should be: %d\n", 13); + fprintf (stderr, "Int_3_Loc: %d\n", Int_3_Loc); + fprintf (stderr, " should be: %d\n", 7); + fprintf (stderr, "Enum_Loc: %d\n", Enum_Loc); + fprintf (stderr, " should be: %d\n", 1); + fprintf (stderr, "Str_1_Loc: %s\n", Str_1_Loc); + fprintf (stderr, " should be: DHRYSTONE PROGRAM, 1'ST STRING\n"); + fprintf (stderr, "Str_2_Loc: %s\n", Str_2_Loc); + fprintf (stderr, " should be: DHRYSTONE PROGRAM, 2'ND STRING\n"); + fprintf (stderr, "\n"); + + + 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; + + printf ("Microseconds for one run through Dhrystone: "); + printf ("%10.1f \n", Microseconds); + printf ("Dhrystones per Second: "); + printf ("%10.0f \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 + + +#else /* PASS2 */ + +#ifndef REG +#define REG + /* REG becomes defined as empty */ + /* i.e. no register variables */ +#else +#undef REG +#define REG register +#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 */ + +#endif /* PASS2 */ + diff --git a/test/elfs/src/dhrystone/strcmp.S b/test/elfs/src/dhrystone/strcmp.S new file mode 100644 index 0000000..dd74a8a --- /dev/null +++ b/test/elfs/src/dhrystone/strcmp.S @@ -0,0 +1,160 @@ +/* Copyright (c) 2017 SiFive Inc. All rights reserved. + + This copyrighted material is made available to anyone wishing to use, + modify, copy, or redistribute it subject to the terms and conditions + of the FreeBSD License. This program is distributed in the hope that + it will be useful, but WITHOUT ANY WARRANTY expressed or implied, + including the implied warranties of MERCHANTABILITY or FITNESS FOR + A PARTICULAR PURPOSE. A copy of this license is available at + http://www.opensource.org/licenses. +*/ + +#if __riscv_xlen == 64 +# define PTRLOG 3 +# define SZREG 8 +# define REG_S sd +# define REG_L ld +#elif __riscv_xlen == 32 +# define PTRLOG 2 +# define SZREG 4 +# define REG_S sw +# define REG_L lw +#else +# error __riscv_xlen must equal 32 or 64 +#endif + +#if BYTE_ORDER != LITTLE_ENDIAN +# error +#endif + +.text +.globl strcmp +.type strcmp, @function +strcmp: + or a4, a0, a1 + li t2, -1 + and a4, a4, SZREG-1 + bnez a4, .Lmisaligned + +#if SZREG == 4 + li a5, 0x7f7f7f7f +#else + ld a5, mask +#endif + + .macro check_one_word i n + REG_L a2, \i*SZREG(a0) + REG_L a3, \i*SZREG(a1) + + and t0, a2, a5 + or t1, a2, a5 + add t0, t0, a5 + or t0, t0, t1 + + bne t0, t2, .Lnull\i + .if \i+1-\n + bne a2, a3, .Lmismatch + .else + add a0, a0, \n*SZREG + add a1, a1, \n*SZREG + beq a2, a3, .Lloop + # fall through to .Lmismatch + .endif + .endm + + .macro foundnull i n + .ifne \i + .Lnull\i: + add a0, a0, \i*SZREG + add a1, a1, \i*SZREG + .ifeq \i-1 + .Lnull0: + .endif + bne a2, a3, .Lmisaligned + li a0, 0 + ret + .endif + .endm + +.Lloop: + # examine full words at a time, favoring strings of a couple dozen chars +#if __riscv_xlen == 32 + check_one_word 0 5 + check_one_word 1 5 + check_one_word 2 5 + check_one_word 3 5 + check_one_word 4 5 +#else + check_one_word 0 3 + check_one_word 1 3 + check_one_word 2 3 +#endif + # backwards branch to .Lloop contained above + +.Lmismatch: + # words don't match, but a2 has no null byte. +#if __riscv_xlen == 64 + sll a4, a2, 48 + sll a5, a3, 48 + bne a4, a5, .Lmismatch_upper + sll a4, a2, 32 + sll a5, a3, 32 + bne a4, a5, .Lmismatch_upper +#endif + sll a4, a2, 16 + sll a5, a3, 16 + bne a4, a5, .Lmismatch_upper + + srl a4, a2, 8*SZREG-16 + srl a5, a3, 8*SZREG-16 + sub a0, a4, a5 + and a1, a0, 0xff + bnez a1, 1f + ret + +.Lmismatch_upper: + srl a4, a4, 8*SZREG-16 + srl a5, a5, 8*SZREG-16 + sub a0, a4, a5 + and a1, a0, 0xff + bnez a1, 1f + ret + +1:and a4, a4, 0xff + and a5, a5, 0xff + sub a0, a4, a5 + ret + +.Lmisaligned: + # misaligned + lbu a2, 0(a0) + lbu a3, 0(a1) + add a0, a0, 1 + add a1, a1, 1 + bne a2, a3, 1f + bnez a2, .Lmisaligned + +1: + sub a0, a2, a3 + ret + + # cases in which a null byte was detected +#if __riscv_xlen == 32 + foundnull 0 5 + foundnull 1 5 + foundnull 2 5 + foundnull 3 5 + foundnull 4 5 +#else + foundnull 0 3 + foundnull 1 3 + foundnull 2 3 +#endif +.size strcmp, .-strcmp + +#if SZREG == 8 +.section .srodata.cst8,"aM",@progbits,8 +.align 3 +mask: +.dword 0x7f7f7f7f7f7f7f7f +#endif diff --git a/test/elfs/src/lui/CMakeLists.txt b/test/elfs/src/lui/CMakeLists.txt new file mode 100644 index 0000000..e0d26b5 --- /dev/null +++ b/test/elfs/src/lui/CMakeLists.txt @@ -0,0 +1,3 @@ +project(lui_test) + +add_executable (lui.elf lui.s) diff --git a/test/elfs/src/lui/lui.s b/test/elfs/src/lui/lui.s new file mode 100644 index 0000000..edaa444 --- /dev/null +++ b/test/elfs/src/lui/lui.s @@ -0,0 +1,30 @@ +/* Test: add.elf + * ISA: rv64i + * Description: Stream of reg-reg load upper immediate instruction + *. + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +main: + .rept 200 + lui x5, 0xFFFFF + lui x5, 0x00001 + lui x5, 0x7FFFF + lui x5, 0x00000 + lui x5, 0xF0000 + .endr + +pass: + test_pass + +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/misalign/CMakeLists.txt b/test/elfs/src/misalign/CMakeLists.txt new file mode 100644 index 0000000..63ea5a8 --- /dev/null +++ b/test/elfs/src/misalign/CMakeLists.txt @@ -0,0 +1,3 @@ +project(misalign_test) + +add_executable (misalign.elf misalign.s) diff --git a/test/elfs/src/misalign/misalign.s b/test/elfs/src/misalign/misalign.s new file mode 100644 index 0000000..1f79bad --- /dev/null +++ b/test/elfs/src/misalign/misalign.s @@ -0,0 +1,48 @@ +/* Test: misalgn.elf + * ISA: rv64i + * Description: Stream of misaligned loads and stores. + */ + +.section .text + .global main + +main: + # First double-word access will be aligned (0x1ff8) + # Each subsequent access with be misligned by +1B + # Final access will be completely on the next page (0x2000) + lui x3, 1 + addi x6, x3, -8 + add x6, x6, x3 + + # Init x5 to 0xaaccaacc + addi x29, x29, 8 + addi x5, x5, 0xaa + sll x5, x5, x29 + addi x5, x5, 0xcc + sll x5, x5, x29 + addi x5, x5, 0xaa + sll x5, x5, x29 + addi x5, x5, 0xcc + sll x5, x5, x29 + addi x5, x5, 0xaa + sll x5, x5, x29 + addi x5, x5, 0xcc + sll x5, x5, x29 + addi x5, x5, 0xaa + sll x5, x5, x29 + addi x5, x5, 0xcc + + # Counter for loop + addi x28, x0, -9 + +loop: + sd x5, 0(x6) + ld x7, 0(x6) + addi x6, x6, 1 + addi x28, x28, 1 + blt x28, zero, loop + wfi + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/nop/CMakeLists.txt b/test/elfs/src/nop/CMakeLists.txt new file mode 100644 index 0000000..e4c7305 --- /dev/null +++ b/test/elfs/src/nop/CMakeLists.txt @@ -0,0 +1,3 @@ +project(nop_test) + +add_executable (nop.elf nop.s) diff --git a/test/elfs/src/nop/nop.s b/test/elfs/src/nop/nop.s new file mode 100644 index 0000000..3c97426 --- /dev/null +++ b/test/elfs/src/nop/nop.s @@ -0,0 +1,25 @@ +/* Test: nop.elf + * ISA: rv64i + * Description: Stream of nops. + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +main: + .rept 1000 + nop + .endr + +pass: + test_pass + +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/sub_bgeu/CMakeLists.txt b/test/elfs/src/sub_bgeu/CMakeLists.txt new file mode 100644 index 0000000..fe4cae2 --- /dev/null +++ b/test/elfs/src/sub_bgeu/CMakeLists.txt @@ -0,0 +1,3 @@ +project(sub_bgeu_test) + +add_executable (sub_bgeu.elf sub_bgeu.s) diff --git a/test/elfs/src/sub_bgeu/sub_bgeu.s b/test/elfs/src/sub_bgeu/sub_bgeu.s new file mode 100644 index 0000000..05bd6a0 --- /dev/null +++ b/test/elfs/src/sub_bgeu/sub_bgeu.s @@ -0,0 +1,30 @@ +/* Test: add.elf + * ISA: rv64i + * Description: Stream of reg-reg sub instructions. + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +main: + addi x28, x0, 10 + addi x29, x0, 1 +loop: + .rept 100 + sub x30, x28, x29 + .endr + addi x29, x29, 1 + bgeu x28, x29, loop + +pass: + test_pass + +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/sw_lw_blt/CMakeLists.txt b/test/elfs/src/sw_lw_blt/CMakeLists.txt new file mode 100644 index 0000000..6e0dc1b --- /dev/null +++ b/test/elfs/src/sw_lw_blt/CMakeLists.txt @@ -0,0 +1,3 @@ +project(sw_lw_blt_test) + +add_executable (sw_lw_blt.elf sw_lw_blt.s) diff --git a/test/elfs/src/sw_lw_blt/sw_lw_blt.s b/test/elfs/src/sw_lw_blt/sw_lw_blt.s new file mode 100644 index 0000000..1c63617 --- /dev/null +++ b/test/elfs/src/sw_lw_blt/sw_lw_blt.s @@ -0,0 +1,45 @@ +/* Test: add.elf + * ISA: rv64i + * Description: Stream of store and load instructions. + */ + +.include "host.s" +.include "macros.s" + +.section .text + .global main + +main: + # Temp - address of data is x1000 + lui x6, 1 + + # Init x5: 0xaaccaacc + addi x29, x29, 8 + addi x5, x5, 0xaa + sll x5, x5, x29 + addi x5, x5, 0xcc + sll x5, x5, x29 + addi x5, x5, 0xaa + sll x5, x5, x29 + addi x5, x5, 0xcc + + # Counter for loop + addi x28, x0, -10 +loop: + .rept 100 + sw x5, 0(x6) + lw x7, 0(x6) + addi x6, x6, 4 + .endr + addi x28, x28, 1 + blt x28, zero, loop + +pass: + test_pass + +fail: + test_fail + +.section .data +data: + .fill 64, 4, 0xFFFFFFFF From e567f33e2a1ad7c952dd6554925fee81380bd9ec Mon Sep 17 00:00:00 2001 From: Kathlene Magnus Date: Wed, 18 Dec 2024 15:15:17 -0600 Subject: [PATCH 2/4] Removed extra tests --- test/elfs/src/CMakeLists.txt | 6 - test/elfs/src/add/CMakeLists.txt | 3 - test/elfs/src/add/add.s | 27 - test/elfs/src/add_bne/CMakeLists.txt | 3 - test/elfs/src/add_bne/add_bne.s | 30 - test/elfs/src/dhrystone/CMakeLists.txt | 7 - test/elfs/src/dhrystone/Makefile | 18 - test/elfs/src/dhrystone/dhry.h | 431 ---------- test/elfs/src/dhrystone/dhry_1.c | 405 ---------- test/elfs/src/dhrystone/dhry_2.c | 192 ----- test/elfs/src/dhrystone/dhrystone.c | 1023 ------------------------ test/elfs/src/dhrystone/strcmp.S | 160 ---- test/elfs/src/lui/CMakeLists.txt | 3 - test/elfs/src/lui/lui.s | 30 - test/elfs/src/misalign/CMakeLists.txt | 3 - test/elfs/src/misalign/misalign.s | 48 -- test/elfs/src/sub_bgeu/CMakeLists.txt | 3 - test/elfs/src/sub_bgeu/sub_bgeu.s | 30 - test/elfs/src/sw_lw_blt/CMakeLists.txt | 3 - test/elfs/src/sw_lw_blt/sw_lw_blt.s | 45 -- 20 files changed, 2470 deletions(-) delete mode 100644 test/elfs/src/add/CMakeLists.txt delete mode 100644 test/elfs/src/add/add.s delete mode 100644 test/elfs/src/add_bne/CMakeLists.txt delete mode 100644 test/elfs/src/add_bne/add_bne.s delete mode 100644 test/elfs/src/dhrystone/CMakeLists.txt delete mode 100644 test/elfs/src/dhrystone/Makefile delete mode 100644 test/elfs/src/dhrystone/dhry.h delete mode 100644 test/elfs/src/dhrystone/dhry_1.c delete mode 100644 test/elfs/src/dhrystone/dhry_2.c delete mode 100644 test/elfs/src/dhrystone/dhrystone.c delete mode 100644 test/elfs/src/dhrystone/strcmp.S delete mode 100644 test/elfs/src/lui/CMakeLists.txt delete mode 100644 test/elfs/src/lui/lui.s delete mode 100644 test/elfs/src/misalign/CMakeLists.txt delete mode 100644 test/elfs/src/misalign/misalign.s delete mode 100644 test/elfs/src/sub_bgeu/CMakeLists.txt delete mode 100644 test/elfs/src/sub_bgeu/sub_bgeu.s delete mode 100644 test/elfs/src/sw_lw_blt/CMakeLists.txt delete mode 100644 test/elfs/src/sw_lw_blt/sw_lw_blt.s diff --git a/test/elfs/src/CMakeLists.txt b/test/elfs/src/CMakeLists.txt index d8cfbb8..e4efc7c 100644 --- a/test/elfs/src/CMakeLists.txt +++ b/test/elfs/src/CMakeLists.txt @@ -3,9 +3,3 @@ project (BASE_TESTS) set (CMAKE_ASM_FLAGS "-march=rv64i_zicsr_zifencei") add_subdirectory (nop) -add_subdirectory (add) -add_subdirectory (add_bne) -add_subdirectory (sub_bgeu) -add_subdirectory (lui) -add_subdirectory (sw_lw_blt) -add_subdirectory (misalign) diff --git a/test/elfs/src/add/CMakeLists.txt b/test/elfs/src/add/CMakeLists.txt deleted file mode 100644 index 2d41e9c..0000000 --- a/test/elfs/src/add/CMakeLists.txt +++ /dev/null @@ -1,3 +0,0 @@ -project(add_test) - -add_executable (add.elf add.s) diff --git a/test/elfs/src/add/add.s b/test/elfs/src/add/add.s deleted file mode 100644 index 4eead84..0000000 --- a/test/elfs/src/add/add.s +++ /dev/null @@ -1,27 +0,0 @@ -/* Test: add.elf - * ISA: rv64i - * Description: Stream of reg-reg add instructions. - */ - -.include "host.s" -.include "macros.s" - -.section .text - .global main - -main: - start_tracepoint - .rept 1000 - add x7, x6, x5 - .endr - stop_tracepoint - -pass: - test_pass - -fail: - test_fail - -.section .data -data: - .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/add_bne/CMakeLists.txt b/test/elfs/src/add_bne/CMakeLists.txt deleted file mode 100644 index 3b49bc7..0000000 --- a/test/elfs/src/add_bne/CMakeLists.txt +++ /dev/null @@ -1,3 +0,0 @@ -project(add_bne_test) - -add_executable (add_bne.elf add_bne.s) diff --git a/test/elfs/src/add_bne/add_bne.s b/test/elfs/src/add_bne/add_bne.s deleted file mode 100644 index 0a8fcbf..0000000 --- a/test/elfs/src/add_bne/add_bne.s +++ /dev/null @@ -1,30 +0,0 @@ -/* Test: add.elf - * ISA: rv64i - * Description: Stream of reg-reg add instructions with a branch. - */ - -.include "host.s" -.include "macros.s" - -.section .text - .global main - -main: - addi x28, x0, 10 - addi x7, x0, 1 -loop: - .rept 100 - add x5, x5, x7 - .endr - addi x28, x28, -1 - bne x28, zero, loop - -pass: - test_pass - -fail: - test_fail - -.section .data -data: - .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/dhrystone/CMakeLists.txt b/test/elfs/src/dhrystone/CMakeLists.txt deleted file mode 100644 index 3b9b633..0000000 --- a/test/elfs/src/dhrystone/CMakeLists.txt +++ /dev/null @@ -1,7 +0,0 @@ -project(dhrystone_test) - -set(CMAKE_C_INCLUDES "/Library/Developer/CommandLineTools/SDKs/MacOSX.sdk/usr/include") -set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -O3 -DTIME -DNOENUM -Wno-implicit -save-temps") -set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -fno-builtin-printf -fno-common -falign-functions=4") -set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Xlinker --defsym=__stack_size=0x800 -Xlinker --defsym=__heap_size=0x1000") -add_executable(dhrystone.elf dhry_1.c dhry_2.c strcmp.S) diff --git a/test/elfs/src/dhrystone/Makefile b/test/elfs/src/dhrystone/Makefile deleted file mode 100644 index 6fb3e5a..0000000 --- a/test/elfs/src/dhrystone/Makefile +++ /dev/null @@ -1,18 +0,0 @@ -DHRY-LFLAGS = - -DHRY-CFLAGS := -O3 -DTIME -DNOENUM -Wno-implicit -save-temps -DHRY-CFLAGS += -fno-builtin-printf -fno-common -falign-functions=4 - -#Uncomment below for FPGA run, default DHRY_ITERS is 2000 for RTL -#DHRY-CFLAGS += -DDHRY_ITERS=20000000 - -SRC = dhry_1.c dhry_2.c strcmp.S -HDR = dhry.h - -override CFLAGS += $(DHRY-CFLAGS) $(XCFLAGS) -Xlinker --defsym=__stack_size=0x800 -Xlinker --defsym=__heap_size=0x1000 -dhrystone: $(SRC) $(HDR) - $(CC) $(CFLAGS) $(SRC) $(LDFLAGS) $(LOADLIBES) $(LDLIBS) -o $@ - -clean: - rm -f *.i *.s *.o dhrystone dhrystone.hex - diff --git a/test/elfs/src/dhrystone/dhry.h b/test/elfs/src/dhrystone/dhry.h deleted file mode 100644 index 861e316..0000000 --- a/test/elfs/src/dhrystone/dhry.h +++ /dev/null @@ -1,431 +0,0 @@ -/* - **************************************************************************** - * - * "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, E STE 35 - * Postfach 3240 - * 8520 Erlangen - * Germany (West) - * Phone: [xxx-49]-9131-7-20330 - * (8-17 Central European Time) - * Usenet: ..!mcvax!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 aX * - * - * 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 -#undef TIMES -#define TIMES -#endif - /* Use times(2) time function unless */ - /* explicitly defined otherwise */ - -#ifdef MSC_CLOCK -#undef HZ -#undef TIMES -#include -#define HZ CLK_TCK -#endif - /* Use Microsoft C hi-res clock */ - -#ifdef TIMES -#include -#include - /* 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 - /* 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/test/elfs/src/dhrystone/dhry_1.c b/test/elfs/src/dhrystone/dhry_1.c deleted file mode 100644 index 2c3f40e..0000000 --- a/test/elfs/src/dhrystone/dhry_1.c +++ /dev/null @@ -1,405 +0,0 @@ -/* - **************************************************************************** - * - * "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" - -#ifndef DHRY_ITERS -#define DHRY_ITERS 2000 -#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]; - -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 (2*HZ) - /* 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 -#ifdef MSC_CLOCK -extern clock_t clock(); -#define Too_Small_Time (2*HZ) -#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"); - } -#ifdef DHRY_ITERS - Number_Of_Runs = DHRY_ITERS; -#else - printf ("Please give the number of runs through the benchmark: "); - { - int n; - scanf ("%d", &n); - Number_Of_Runs = n; - } - printf ("\n"); -#endif - - 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 -#ifdef MSC_CLOCK - Begin_Time = clock(); -#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 -#ifdef MSC_CLOCK - End_Time = clock(); -#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 ("%d \n", (int)Microseconds); - printf ("Dhrystones per Second: "); - //printf ("%6.1f \n", Dhrystones_Per_Second); - printf ("%d \n", (int)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 - - diff --git a/test/elfs/src/dhrystone/dhry_2.c b/test/elfs/src/dhrystone/dhry_2.c deleted file mode 100644 index 63a3d3e..0000000 --- a/test/elfs/src/dhrystone/dhry_2.c +++ /dev/null @@ -1,192 +0,0 @@ -/* - **************************************************************************** - * - * "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/test/elfs/src/dhrystone/dhrystone.c b/test/elfs/src/dhrystone/dhrystone.c deleted file mode 100644 index d5180ed..0000000 --- a/test/elfs/src/dhrystone/dhrystone.c +++ /dev/null @@ -1,1023 +0,0 @@ -#ifdef NOTDEFINED /* To compile and run this file, say "sh dry.c" */ - case $0 in - *.c) ;; - sh) echo 'Use "sh dry.c", not "sh < dry.c"' >&2; exit 1;; - *) echo 'Filename must end in ".c"' >&2; exit 1;; - esac - - echo "${CC=cc} -c ${CFLAGS} $0 -o dry1.o" - ${CC} -c ${CFLAGS} $0 -o dry1.o || exit 1 - echo "${CC} -DPASS2 ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2" - ${CC} -DPASS2 ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2 || exit 1 - ./dry2 ${1-50000} 2>/dev/null - echo "${CC=cc} -c -DREG ${CFLAGS} $0 -o dry1.o" - ${CC} -c -DREG ${CFLAGS} $0 -o dry1.o || exit 1 - echo "${CC} -DPASS2 -DREG ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2nr" - ${CC} -DPASS2 -DREG ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2nr || exit 1 - ./dry2nr ${1-50000} 2>/dev/null - echo "${CC=cc} -c -O ${CFLAGS} $0 -o dry1.o" - ${CC} -c -O ${CFLAGS} $0 -o dry1.o || exit 1 - echo "${CC} -DPASS2 -O ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2o" - ${CC} -DPASS2 -O ${CFLAGS} $0 dry1.o ${LFLAGS} -o dry2o || exit 1 - ./dry2o ${1-50000} 2>/dev/null - rm -f dry1.o - - exit 0 -#endif - -/****************** "DHRYSTONE" Benchmark Program ***************************/ -#define Version "C, Version 2.2" -/* File: dhry_1.c (part 2 of 3) - * Author: Reinhold P. Weicker - * Siemens Nixdorf, Paderborn/Germany - * weicker@specbench.org - * Date: May 25, 1988 - * Modified: Steven Pemberton, CWI, Amsterdam; Steven.Pemberton@cwi.nl - * Date: October, 1993; March 1995 - * Included both files into one source, that gets compiled - * in two passes. Made program auto-compiling, and auto-running, - * and generally made it much easier to use. - * - * 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. - * - *************************************************************************** - * - * Defines: The following "Defines" are possible: - * -DREG (default: Not defined) - * As an approximation to what an average C programmer - * might do, causes the "register" storage class to be applied - * - 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. - * - *************************************************************************** - * - * History: Version C/2.1 was made for two reasons: - * - * 1) There was 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. - * - * Version C/2.2, Steven Pemberton, October 1993 - * Functionally, identical to version 2.2; the changes are in - * how you compile and use it: - * - Everything is in one file now, but compiled in 2 passes - * - Compile (and run) by running the file through the shell: 'sh dhry.c" - * - Uses the system definition of HZ if one can be found - * - HZ must be defined, otherwise it won't compile (no defaults here) - * - The (uninteresting) output is printed to stderr (dhry2 > /dev/null) - * - The number of loops is passed as a parameter, rather than read - * (dhry2 500000) - * - If the number of loops is insufficient to get a good result, - * it repeats it with loops*10 until it is enough (rather than just - * stopping) - * - Output says which sort of clock it is using, and the HZ value - * - You can use -DREG instead of the -DREG=register of previous versions - * - Some stylistic cleanups. - * - *************************************************************************** - * - * Compilation model and measurement (IMPORTANT): - * - * 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 aX * - * - * 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: */ - -/* variables for time measurement: */ - -#ifdef TIME - -#define CLOCK_TYPE "time()" -#undef HZ -#define HZ (1) /* time() returns time in seconds */ -extern long time(); /* see library function "time" */ -#define Too_Small_Time 2 /* Measurements should last at least 2 seconds */ -#define Start_Timer() Begin_Time = time ( (long *) 0) -#define Stop_Timer() End_Time = time ( (long *) 0) - -#else - -#ifdef MSC_CLOCK /* Use Microsoft C hi-res clock */ - -#undef HZ -#undef TIMES -#include -#define HZ CLK_TCK -#define CLOCK_TYPE "MSC clock()" -extern clock_t clock(); -#define Too_Small_Time (2*HZ) -#define Start_Timer() Begin_Time = clock() -#define Stop_Timer() End_Time = clock() - -#else - /* Use times(2) time function unless */ - /* explicitly defined otherwise */ -#define CLOCK_TYPE "times()" -#include -#include -#ifndef HZ /* Added by SP 900619 */ -#include /* If your system doesn't have this, use -DHZ=xxx */ -#else - *** You must define HZ!!! *** -#endif /* HZ */ -#ifndef PASS2 -struct tms time_info; -#endif -/*extern int times ();*/ - /* see library function "times" */ -#define Too_Small_Time (2*HZ) - /* Measurements should last at least about 2 seconds */ -#define Start_Timer() times(&time_info); Begin_Time=(long)time_info.tms_utime -#define Stop_Timer() times(&time_info); End_Time = (long)time_info.tms_utime - -#endif /* MSC_CLOCK */ -#endif /* TIME */ - - -#define Mic_secs_Per_Second 1000000.0 -#define NUMBER_OF_RUNS 50000 /* Default number of runs */ - -#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 - /* 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; - -#ifndef PASS2 - -/* 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; -#undef REG -#define REG register -#endif - -Boolean Done; - -long Begin_Time, - End_Time, - User_Time; -float Microseconds, - Dhrystones_Per_Second; - -/* end of variables for time measurement */ - - -main (argc, argv) int argc; char *argv[]; -/*****/ - - /* 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; - - /* Arguments */ - if (argc > 2) - { - printf ("Usage: %s [number of loops]\n", argv[0]); - exit (1); - } - if (argc == 2) - { - Number_Of_Runs = atoi (argv[1]); - } else - { - Number_Of_Runs = NUMBER_OF_RUNS; - } - if (Number_Of_Runs <= 0) - { - Number_Of_Runs = NUMBER_OF_RUNS; - } - - /* Initializations */ - - /* Turn on FP unit */ - __asm__ volatile ("li t0, 0x2000" ::: "t0"); - __asm__ volatile ("csrs mstatus, t0"); - - 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 %s\n", Version); - if (Reg) - { - printf ("Program compiled with 'register' attribute\n"); - } - else - { - printf ("Program compiled without 'register' attribute\n"); - } - printf ("Using %s, HZ=%d\n", CLOCK_TYPE, HZ); - printf ("\n"); - - Done = false; - while (!Done) { - - printf ("Trying %d runs through Dhrystone:\n", Number_Of_Runs); - - /***************/ - /* Start timer */ - /***************/ - - Start_Timer(); - - 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 */ - /**************/ - - Stop_Timer(); - - User_Time = End_Time - Begin_Time; - - if (User_Time < Too_Small_Time) - { - printf ("Measured time too small to obtain meaningful results\n"); - Number_Of_Runs = Number_Of_Runs * 10; - printf ("\n"); - } else Done = true; - } - - fprintf (stderr, "Final values of the variables used in the benchmark:\n"); - fprintf (stderr, "\n"); - fprintf (stderr, "Int_Glob: %d\n", Int_Glob); - fprintf (stderr, " should be: %d\n", 5); - fprintf (stderr, "Bool_Glob: %d\n", Bool_Glob); - fprintf (stderr, " should be: %d\n", 1); - fprintf (stderr, "Ch_1_Glob: %c\n", Ch_1_Glob); - fprintf (stderr, " should be: %c\n", 'A'); - fprintf (stderr, "Ch_2_Glob: %c\n", Ch_2_Glob); - fprintf (stderr, " should be: %c\n", 'B'); - fprintf (stderr, "Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]); - fprintf (stderr, " should be: %d\n", 7); - fprintf (stderr, "Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]); - fprintf (stderr, " should be: Number_Of_Runs + 10\n"); - fprintf (stderr, "Ptr_Glob->\n"); - fprintf (stderr, " Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp); - fprintf (stderr, " should be: (implementation-dependent)\n"); - fprintf (stderr, " Discr: %d\n", Ptr_Glob->Discr); - fprintf (stderr, " should be: %d\n", 0); - fprintf (stderr, " Enum_Comp: %d\n", Ptr_Glob->variant.var_1.Enum_Comp); - fprintf (stderr, " should be: %d\n", 2); - fprintf (stderr, " Int_Comp: %d\n", Ptr_Glob->variant.var_1.Int_Comp); - fprintf (stderr, " should be: %d\n", 17); - fprintf (stderr, " Str_Comp: %s\n", Ptr_Glob->variant.var_1.Str_Comp); - fprintf (stderr, " should be: DHRYSTONE PROGRAM, SOME STRING\n"); - fprintf (stderr, "Next_Ptr_Glob->\n"); - fprintf (stderr, " Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp); - fprintf (stderr, " should be: (implementation-dependent), same as above\n"); - fprintf (stderr, " Discr: %d\n", Next_Ptr_Glob->Discr); - fprintf (stderr, " should be: %d\n", 0); - fprintf (stderr, " Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp); - fprintf (stderr, " should be: %d\n", 1); - fprintf (stderr, " Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp); - fprintf (stderr, " should be: %d\n", 18); - fprintf (stderr, " Str_Comp: %s\n", - Next_Ptr_Glob->variant.var_1.Str_Comp); - fprintf (stderr, " should be: DHRYSTONE PROGRAM, SOME STRING\n"); - fprintf (stderr, "Int_1_Loc: %d\n", Int_1_Loc); - fprintf (stderr, " should be: %d\n", 5); - fprintf (stderr, "Int_2_Loc: %d\n", Int_2_Loc); - fprintf (stderr, " should be: %d\n", 13); - fprintf (stderr, "Int_3_Loc: %d\n", Int_3_Loc); - fprintf (stderr, " should be: %d\n", 7); - fprintf (stderr, "Enum_Loc: %d\n", Enum_Loc); - fprintf (stderr, " should be: %d\n", 1); - fprintf (stderr, "Str_1_Loc: %s\n", Str_1_Loc); - fprintf (stderr, " should be: DHRYSTONE PROGRAM, 1'ST STRING\n"); - fprintf (stderr, "Str_2_Loc: %s\n", Str_2_Loc); - fprintf (stderr, " should be: DHRYSTONE PROGRAM, 2'ND STRING\n"); - fprintf (stderr, "\n"); - - - 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; - - printf ("Microseconds for one run through Dhrystone: "); - printf ("%10.1f \n", Microseconds); - printf ("Dhrystones per Second: "); - printf ("%10.0f \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 - - -#else /* PASS2 */ - -#ifndef REG -#define REG - /* REG becomes defined as empty */ - /* i.e. no register variables */ -#else -#undef REG -#define REG register -#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 */ - -#endif /* PASS2 */ - diff --git a/test/elfs/src/dhrystone/strcmp.S b/test/elfs/src/dhrystone/strcmp.S deleted file mode 100644 index dd74a8a..0000000 --- a/test/elfs/src/dhrystone/strcmp.S +++ /dev/null @@ -1,160 +0,0 @@ -/* Copyright (c) 2017 SiFive Inc. All rights reserved. - - This copyrighted material is made available to anyone wishing to use, - modify, copy, or redistribute it subject to the terms and conditions - of the FreeBSD License. This program is distributed in the hope that - it will be useful, but WITHOUT ANY WARRANTY expressed or implied, - including the implied warranties of MERCHANTABILITY or FITNESS FOR - A PARTICULAR PURPOSE. A copy of this license is available at - http://www.opensource.org/licenses. -*/ - -#if __riscv_xlen == 64 -# define PTRLOG 3 -# define SZREG 8 -# define REG_S sd -# define REG_L ld -#elif __riscv_xlen == 32 -# define PTRLOG 2 -# define SZREG 4 -# define REG_S sw -# define REG_L lw -#else -# error __riscv_xlen must equal 32 or 64 -#endif - -#if BYTE_ORDER != LITTLE_ENDIAN -# error -#endif - -.text -.globl strcmp -.type strcmp, @function -strcmp: - or a4, a0, a1 - li t2, -1 - and a4, a4, SZREG-1 - bnez a4, .Lmisaligned - -#if SZREG == 4 - li a5, 0x7f7f7f7f -#else - ld a5, mask -#endif - - .macro check_one_word i n - REG_L a2, \i*SZREG(a0) - REG_L a3, \i*SZREG(a1) - - and t0, a2, a5 - or t1, a2, a5 - add t0, t0, a5 - or t0, t0, t1 - - bne t0, t2, .Lnull\i - .if \i+1-\n - bne a2, a3, .Lmismatch - .else - add a0, a0, \n*SZREG - add a1, a1, \n*SZREG - beq a2, a3, .Lloop - # fall through to .Lmismatch - .endif - .endm - - .macro foundnull i n - .ifne \i - .Lnull\i: - add a0, a0, \i*SZREG - add a1, a1, \i*SZREG - .ifeq \i-1 - .Lnull0: - .endif - bne a2, a3, .Lmisaligned - li a0, 0 - ret - .endif - .endm - -.Lloop: - # examine full words at a time, favoring strings of a couple dozen chars -#if __riscv_xlen == 32 - check_one_word 0 5 - check_one_word 1 5 - check_one_word 2 5 - check_one_word 3 5 - check_one_word 4 5 -#else - check_one_word 0 3 - check_one_word 1 3 - check_one_word 2 3 -#endif - # backwards branch to .Lloop contained above - -.Lmismatch: - # words don't match, but a2 has no null byte. -#if __riscv_xlen == 64 - sll a4, a2, 48 - sll a5, a3, 48 - bne a4, a5, .Lmismatch_upper - sll a4, a2, 32 - sll a5, a3, 32 - bne a4, a5, .Lmismatch_upper -#endif - sll a4, a2, 16 - sll a5, a3, 16 - bne a4, a5, .Lmismatch_upper - - srl a4, a2, 8*SZREG-16 - srl a5, a3, 8*SZREG-16 - sub a0, a4, a5 - and a1, a0, 0xff - bnez a1, 1f - ret - -.Lmismatch_upper: - srl a4, a4, 8*SZREG-16 - srl a5, a5, 8*SZREG-16 - sub a0, a4, a5 - and a1, a0, 0xff - bnez a1, 1f - ret - -1:and a4, a4, 0xff - and a5, a5, 0xff - sub a0, a4, a5 - ret - -.Lmisaligned: - # misaligned - lbu a2, 0(a0) - lbu a3, 0(a1) - add a0, a0, 1 - add a1, a1, 1 - bne a2, a3, 1f - bnez a2, .Lmisaligned - -1: - sub a0, a2, a3 - ret - - # cases in which a null byte was detected -#if __riscv_xlen == 32 - foundnull 0 5 - foundnull 1 5 - foundnull 2 5 - foundnull 3 5 - foundnull 4 5 -#else - foundnull 0 3 - foundnull 1 3 - foundnull 2 3 -#endif -.size strcmp, .-strcmp - -#if SZREG == 8 -.section .srodata.cst8,"aM",@progbits,8 -.align 3 -mask: -.dword 0x7f7f7f7f7f7f7f7f -#endif diff --git a/test/elfs/src/lui/CMakeLists.txt b/test/elfs/src/lui/CMakeLists.txt deleted file mode 100644 index e0d26b5..0000000 --- a/test/elfs/src/lui/CMakeLists.txt +++ /dev/null @@ -1,3 +0,0 @@ -project(lui_test) - -add_executable (lui.elf lui.s) diff --git a/test/elfs/src/lui/lui.s b/test/elfs/src/lui/lui.s deleted file mode 100644 index edaa444..0000000 --- a/test/elfs/src/lui/lui.s +++ /dev/null @@ -1,30 +0,0 @@ -/* Test: add.elf - * ISA: rv64i - * Description: Stream of reg-reg load upper immediate instruction - *. - */ - -.include "host.s" -.include "macros.s" - -.section .text - .global main - -main: - .rept 200 - lui x5, 0xFFFFF - lui x5, 0x00001 - lui x5, 0x7FFFF - lui x5, 0x00000 - lui x5, 0xF0000 - .endr - -pass: - test_pass - -fail: - test_fail - -.section .data -data: - .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/misalign/CMakeLists.txt b/test/elfs/src/misalign/CMakeLists.txt deleted file mode 100644 index 63ea5a8..0000000 --- a/test/elfs/src/misalign/CMakeLists.txt +++ /dev/null @@ -1,3 +0,0 @@ -project(misalign_test) - -add_executable (misalign.elf misalign.s) diff --git a/test/elfs/src/misalign/misalign.s b/test/elfs/src/misalign/misalign.s deleted file mode 100644 index 1f79bad..0000000 --- a/test/elfs/src/misalign/misalign.s +++ /dev/null @@ -1,48 +0,0 @@ -/* Test: misalgn.elf - * ISA: rv64i - * Description: Stream of misaligned loads and stores. - */ - -.section .text - .global main - -main: - # First double-word access will be aligned (0x1ff8) - # Each subsequent access with be misligned by +1B - # Final access will be completely on the next page (0x2000) - lui x3, 1 - addi x6, x3, -8 - add x6, x6, x3 - - # Init x5 to 0xaaccaacc - addi x29, x29, 8 - addi x5, x5, 0xaa - sll x5, x5, x29 - addi x5, x5, 0xcc - sll x5, x5, x29 - addi x5, x5, 0xaa - sll x5, x5, x29 - addi x5, x5, 0xcc - sll x5, x5, x29 - addi x5, x5, 0xaa - sll x5, x5, x29 - addi x5, x5, 0xcc - sll x5, x5, x29 - addi x5, x5, 0xaa - sll x5, x5, x29 - addi x5, x5, 0xcc - - # Counter for loop - addi x28, x0, -9 - -loop: - sd x5, 0(x6) - ld x7, 0(x6) - addi x6, x6, 1 - addi x28, x28, 1 - blt x28, zero, loop - wfi - -.section .data -data: - .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/sub_bgeu/CMakeLists.txt b/test/elfs/src/sub_bgeu/CMakeLists.txt deleted file mode 100644 index fe4cae2..0000000 --- a/test/elfs/src/sub_bgeu/CMakeLists.txt +++ /dev/null @@ -1,3 +0,0 @@ -project(sub_bgeu_test) - -add_executable (sub_bgeu.elf sub_bgeu.s) diff --git a/test/elfs/src/sub_bgeu/sub_bgeu.s b/test/elfs/src/sub_bgeu/sub_bgeu.s deleted file mode 100644 index 05bd6a0..0000000 --- a/test/elfs/src/sub_bgeu/sub_bgeu.s +++ /dev/null @@ -1,30 +0,0 @@ -/* Test: add.elf - * ISA: rv64i - * Description: Stream of reg-reg sub instructions. - */ - -.include "host.s" -.include "macros.s" - -.section .text - .global main - -main: - addi x28, x0, 10 - addi x29, x0, 1 -loop: - .rept 100 - sub x30, x28, x29 - .endr - addi x29, x29, 1 - bgeu x28, x29, loop - -pass: - test_pass - -fail: - test_fail - -.section .data -data: - .fill 64, 4, 0xFFFFFFFF diff --git a/test/elfs/src/sw_lw_blt/CMakeLists.txt b/test/elfs/src/sw_lw_blt/CMakeLists.txt deleted file mode 100644 index 6e0dc1b..0000000 --- a/test/elfs/src/sw_lw_blt/CMakeLists.txt +++ /dev/null @@ -1,3 +0,0 @@ -project(sw_lw_blt_test) - -add_executable (sw_lw_blt.elf sw_lw_blt.s) diff --git a/test/elfs/src/sw_lw_blt/sw_lw_blt.s b/test/elfs/src/sw_lw_blt/sw_lw_blt.s deleted file mode 100644 index 1c63617..0000000 --- a/test/elfs/src/sw_lw_blt/sw_lw_blt.s +++ /dev/null @@ -1,45 +0,0 @@ -/* Test: add.elf - * ISA: rv64i - * Description: Stream of store and load instructions. - */ - -.include "host.s" -.include "macros.s" - -.section .text - .global main - -main: - # Temp - address of data is x1000 - lui x6, 1 - - # Init x5: 0xaaccaacc - addi x29, x29, 8 - addi x5, x5, 0xaa - sll x5, x5, x29 - addi x5, x5, 0xcc - sll x5, x5, x29 - addi x5, x5, 0xaa - sll x5, x5, x29 - addi x5, x5, 0xcc - - # Counter for loop - addi x28, x0, -10 -loop: - .rept 100 - sw x5, 0(x6) - lw x7, 0(x6) - addi x6, x6, 4 - .endr - addi x28, x28, 1 - blt x28, zero, loop - -pass: - test_pass - -fail: - test_fail - -.section .data -data: - .fill 64, 4, 0xFFFFFFFF From 5a2401b2f9f3c6cc54a02465d24e4234e690fd78 Mon Sep 17 00:00:00 2001 From: Kathlene Magnus Date: Wed, 18 Dec 2024 15:37:03 -0600 Subject: [PATCH 3/4] Fixed missing workload error --- sim/atlas.cpp | 32 +++++++++++++++++--------------- 1 file changed, 17 insertions(+), 15 deletions(-) diff --git a/sim/atlas.cpp b/sim/atlas.cpp index 8dabf59..17a0d74 100644 --- a/sim/atlas.cpp +++ b/sim/atlas.cpp @@ -2,7 +2,8 @@ #include "sparta/app/CommandLineSimulator.hpp" -const char USAGE[] = "TODO" +const char USAGE[] = "Usage:\n" + "./atlas [-i inst limit] " "\n"; int main(int argc, char** argv) @@ -49,28 +50,29 @@ int main(int argc, char** argv) return err_code; // Any errors already printed to cerr } - if (workload.empty()) - { - std::cerr << "ERROR: Missing a workload to run. Provide an ELF or JSON to run" - << std::endl; - std::cerr << USAGE; - return -1; - } - // Create the simulator sparta::Scheduler scheduler; atlas::AtlasSim sim(&scheduler, workload, ilimit); cls.populateSimulation(&sim); - cls.runSimulator(&sim); + if (workload.empty() == false) + { + cls.runSimulator(&sim); - cls.postProcess(&sim); + cls.postProcess(&sim); - // Get workload exit code - const atlas::AtlasState::SimState* sim_state = sim.getAtlasState()->getSimState(); - exit_code = sim_state->workload_exit_code; - std::cout << "Workload exit code: " << std::dec << exit_code << std::endl; + // Get workload exit code + const atlas::AtlasState::SimState* sim_state = sim.getAtlasState()->getSimState(); + exit_code = sim_state->workload_exit_code; + std::cout << "Workload exit code: " << std::dec << exit_code << std::endl; + } + else + { + std::cout << "ERROR: Missing a workload to run. Provide an ELF or JSON to run" << std::endl; + std::cout << USAGE; + return 0; + } } catch (...) { From 2c2b8df24106802cec4893d86883faa49207ddd0 Mon Sep 17 00:00:00 2001 From: Kathlene Magnus Date: Fri, 20 Dec 2024 15:22:12 -0600 Subject: [PATCH 4/4] Ran clangformat --- sim/atlas.cpp | 13 +++++++------ 1 file changed, 7 insertions(+), 6 deletions(-) diff --git a/sim/atlas.cpp b/sim/atlas.cpp index 17a0d74..e166346 100644 --- a/sim/atlas.cpp +++ b/sim/atlas.cpp @@ -60,19 +60,20 @@ int main(int argc, char** argv) { cls.runSimulator(&sim); - cls.postProcess(&sim); + cls.postProcess(&sim); - // Get workload exit code + // Get workload exit code const atlas::AtlasState::SimState* sim_state = sim.getAtlasState()->getSimState(); exit_code = sim_state->workload_exit_code; std::cout << "Workload exit code: " << std::dec << exit_code << std::endl; } - else + else { - std::cout << "ERROR: Missing a workload to run. Provide an ELF or JSON to run" << std::endl; + std::cout << "ERROR: Missing a workload to run. Provide an ELF or JSON to run" + << std::endl; std::cout << USAGE; - return 0; - } + return 0; + } } catch (...) {