Subversion Repositories openrisc

//=============================================================================

//####UNSUPPORTEDBEGIN####

//

// -------------------------------------------

// This source file has been contributed to eCos/Red Hat. It may have been

// changed slightly to provide an interface consistent with those of other 

// files.

//

// The functionality and contents of this file is supplied "AS IS"

// without any form of support and will not necessarily be kept up

// to date by Red Hat.

//

// The style of programming used in this file may not comply with the

// eCos programming guidelines. Please do not use as a base for other

// files.

//

// All inquiries about this file, or the functionality provided by it,

// should be directed to the 'ecos-discuss' mailing list (see

// http://sourceware.cygnus.com/ecos/intouch.html for details).

//

// -------------------------------------------

//

//####UNSUPPORTEDEND####

//=============================================================================

// Originally three different files, dhry.h, dhry21a.c and dhry21b.c

// Merged into one file and changed a little to avoid compilation warnings.

// The files were found at:

// FTP ftp.nosc.mil/pub/aburto/dhrystone

//=============================================================================

#include <pkgconf/system.h>

#include <pkgconf/infra.h>

#include <pkgconf/kernel.h>

#include <cyg/infra/cyg_type.h>

#include <cyg/infra/testcase.h>

#if !defined(CYGPKG_ISOINFRA)

# define NA_MSG "Requires CYGPKG_ISOINFRA"

#else

# include <pkgconf/isoinfra.h>

# if !defined(CYGFUN_KERNEL_API_C) \

    || !defined(CYGINT_ISO_STDIO_FORMATTED_IO) \

    || CYGINT_ISO_MALLOC == 0 \

    || !defined(CYGINT_ISO_STRING_STRFUNCS)

#  define NA_MSG "Requires CYGFUN_KERNEL_API_C && CYGINT_ISO_STDIO_FORMATTED_IO && CYGINT_ISO_MALLOC && CYGINT_ISO_STRING_STRFUNCS"

# elif !defined(__OPTIMIZE__) \

    || defined(CYGPKG_INFRA_DEBUG) \

    || defined(CYGPKG_KERNEL_INSTRUMENT)

#  define NA_MSG "Only runs with optimized code, no tracing and no asserts"

# elif defined(CYGDBG_INFRA_DIAG_USE_DEVICE)

#  define NA_MSG "Must use HAL diag output to avoid background DSR activity"

# endif

#endif

#ifndef NA_MSG

#include <cyg/hal/hal_cache.h>

#include <cyg/kernel/kapi.h>

#include <stdlib.h>

#include <string.h>

// Time in seconds.

double

dtime(void)

{

    return (double) cyg_current_time() / 100;

}

// Number of loops to run.

#if defined(CYGPRI_KERNEL_TESTS_DHRYSTONE_PASSES)

# define PASSES CYGPRI_KERNEL_TESTS_DHRYSTONE_PASSES

#else

# define PASSES 400000

#endif

// Used in the code below to mark changes to the code.

#define __ECOS__

#undef true

#undef false

/*

 *************************************************************************

 *

 *                   "DHRYSTONE" Benchmark Program

 *                   -----------------------------

 *

 *  Version:    C, Version 2.1

 *

 *  File:       dhry.h (part 1 of 3)

 *

 *  Date:       May 25, 1988

 *

 *  Author:     Reinhold P. Weicker

 *              Siemens Nixdorf Inf. Syst.

 *              STM OS 32

 *              Otto-Hahn-Ring 6

 *              W-8000 Muenchen 83

 *              Germany

 *                      Phone:    [+49]-89-636-42436

 *                                (8-17 Central European Time)

 *                      UUCP:     weicker@ztivax.uucp@unido.uucp

 *                      Internet: weicker@ztivax.siemens.com

 *

 *              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)

 *

 *  Collection of Results:

 *              Reinhold Weicker (address see above) and

 *

 *              Rick Richardson

 *              PC Research. Inc.

 *              94 Apple Orchard Drive

 *              Tinton Falls, NJ 07724

 *                      Phone:  (201) 834-1378 (9-17 EST)

 *                      UUCP:   ...!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:

 *              -DROPT         (default: Not defined)

 *                      As an approximation to what an average C

 *                      programmer might do, the "register" storage class

 *                      is applied (if enabled by -DROPT)

 *                      - 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.

 *

 *************************************************************************

 *

 *  Compilation model and measurement (IMPORTANT):

 *

 *  This C version of Dhrystone consists of three files:

 *  - dhry.h (this file, containing global definitions and comments)

 *  - dhry_1.c (containing the code corresponding to Ada package Pack_1)

 *  - dhry_2.c (containing the code corresponding to Ada package Pack_2)

 *

 *  The following "ground rules" apply for measurements:

 *  - Separate compilation

 *  - No procedure merging

 *  - Otherwise, compiler optimizations are allowed but should be

 *    indicated

 *  - Default results are those without register declarations

 *  See the companion paper "Rationale for Dhrystone Version 2" for a more

 *  detailed discussion of these ground rules.

 *

 *  For 16-Bit processors (e.g. 80186, 80286), times for all compilation

 *  models ("small", "medium", "large" etc.) should be given if possible,

 *  together with a definition of these models for the compiler system

 *  used.

 *

 *************************************************************************

 *

 *  Dhrystone (C version) statistics:

 *

 *  [Comment from the first distribution, updated for version 2.

 *   Note that because of language differences, the numbers are slightly

 *   different from the Ada version.]

 *

 *  The following program contains statements of a high level programming

 *  language (here: C) in a distribution considered representative:

 *

 *    assignments                  52 (51.0 %)

 *    control statements           33 (32.4 %)

 *    procedure, function calls    17 (16.7 %)

 *

 *  103 statements are dynamically executed. The program is balanced with

 *  respect to the three aspects:

 *

 *    - statement type

 *    - operand type

 *    - operand locality

 *         operand global, local, parameter, or constant.

 *

 *  The combination of these three aspects is balanced only approximately.

 *

 *  1. Statement Type:

 *  -----------------             number

 *

 *     V1 = V2                     9

 *       (incl. V1 = F(..)

 *     V = Constant               12

 *     Assignment,                 7

 *       with array element

 *     Assignment,                 6

 *       with record component

 *                                --

 *                                34       34

 *

 *     X = Y +|-|"&&"|"|" Z        5

 *     X = Y +|-|"==" Constant     6

 *     X = X +|- 1                 3

 *     X = Y *|/ Z                 2

 *     X = Expression,             1

 *           two operators

 *     X = Expression,             1

 *           three operators

 *                                --

 *                                18       18

 *

 *     if ....                    14

 *       with "else"      7

 *       without "else"   7

 *           executed        3

 *           not executed    4

 *     for ...                     7  |  counted every time

 *     while ...                   4  |  the loop condition

 *     do ... while                1  |  is evaluated

 *     switch ...                  1

 *     break                       1

 *     declaration with            1

 *       initialization

 *                                --

 *                                34       34

 *

 *     P (...)  procedure call    11

 *       user procedure      10

 *       library procedure    1

 *     X = F (...)

 *             function  call      6

 *       user function        5

 *       library function     1

 *                                --

 *                                17       17

 *                                        ---

 *                                        103

 *

 *    The average number of parameters in procedure or function calls

 *    is 1.82 (not counting the function values as implicit parameters).

 *

 *

 *  2. Operators

 *  ------------

 *                          number    approximate

 *                                    percentage

 *

 *    Arithmetic             32          50.8

 *

 *       +                     21          33.3

 *       -                      7          11.1

 *       *                      3           4.8

 *       / (int div)            1           1.6

 *

 *    Comparison             27           42.8

 *

 *       ==                     9           14.3

 *       /=                     4            6.3

 *       >                      1            1.6

 *       <                      3            4.8

 *       >=                     1            1.6

 *       <=                     9           14.3

 *

 *    Logic                   4            6.3

 *

 *       && (AND-THEN)          1            1.6

 *       |  (OR)                1            1.6

 *       !  (NOT)               2            3.2

 *

 *                           --          -----

 *                           63          100.1

 *

 *

 *  3. Operand Type (counted once per operand reference):

 *  ---------------

 *                          number    approximate

 *                                    percentage

 *

 *     Integer               175        72.3 %

 *     Character              45        18.6 %

 *     Pointer                12         5.0 %

 *     String30                6         2.5 %

 *     Array                   2         0.8 %

 *     Record                  2         0.8 %

 *                           ---       -------

 *                           242       100.0 %

 *

 *  When there is an access path leading to the final operand (e.g. a

 *  record component), only the final data type on the access path is

 *  counted.

 *

 *

 *  4. Operand Locality:

 *  -------------------

 *                                number    approximate

 *                                          percentage

 *

 *     local variable              114        47.1 %

 *     global variable              22         9.1 %

 *     parameter                    45        18.6 %

 *        value                        23         9.5 %

 *        reference                    22         9.1 %

 *     function result               6         2.5 %

 *     constant                     55        22.7 %

 *                                 ---       -------

 *                                 242       100.0 %

 *

 *

 *  The program does not compute anything meaningful, but it is

 *  syntactically and semantically correct. All variables have a value

 *  assigned to them before they are used as a source operand.

 *

 *  There has been no explicit effort to account for the effects of a

 *  cache, or to balance the use of long or short displacements for code

 *  or data.

 *

 *************************************************************************

 */

/* Compiler and system dependent definitions: */

#define Mic_secs_Per_Second     1000000.0

                /* Berkeley UNIX C returns process times in seconds/HZ */

#ifdef  NOSTRUCTASSIGN

#define structassign(d, s)      memcpy(&(d), &(s), sizeof(d))

#else

#define structassign(d, s)      d = s

#endif

#ifdef  NOENUM

#define Ident_1 0

#define Ident_2 1

#define Ident_3 2

#define Ident_4 3

#define Ident_5 4

  typedef int   Enumeration;

#else

  typedef       enum    {Ident_1, Ident_2, Ident_3, Ident_4, Ident_5}

                Enumeration;

#endif

        /* for boolean and enumeration types in Ada, Pascal */

/* General definitions: */

#include <stdio.h>

                /* for strcpy, strcmp */

#define Null 0 

                /* Value of a Null pointer */

#define true  1

#define false 0

typedef int     One_Thirty;

typedef int     One_Fifty;

typedef char    Capital_Letter;

typedef int     Boolean;

typedef char    Str_30 [31];

typedef int     Arr_1_Dim [50];

typedef int     Arr_2_Dim [50] [50];

typedef struct record

    {

    struct record *Ptr_Comp;

    Enumeration    Discr;

    union {

          struct {

                  Enumeration Enum_Comp;

                  int         Int_Comp;

                  char        Str_Comp [31];

                  } var_1;

          struct {

                  Enumeration E_Comp_2;

                  char        Str_2_Comp [31];

                  } var_2;

          struct {

                  char        Ch_1_Comp;

                  char        Ch_2_Comp;

                  } var_3;

          } variant;

      } Rec_Type, *Rec_Pointer;

#ifdef __ECOS__

#ifndef ROPT

#define REG

        /* REG becomes defined as empty */

        /* i.e. no register variables   */

#else

#define REG register

#endif

Boolean Func_2 (Str_30 Str_1_Par_Ref, Str_30 Str_2_Par_Ref);

Boolean Func_3 (Enumeration Enum_Par_Val);

void Proc_1 (REG Rec_Pointer Ptr_Val_Par);

void Proc_2 (One_Fifty* Int_Par_Ref);

void Proc_3 (Rec_Pointer *Ptr_Ref_Par);

void Proc_4 (void);

void Proc_5 (void);

void Proc_6 (Enumeration Enum_Val_Par, Enumeration* Enum_Ref_Par);

void Proc_7 (One_Fifty Int_1_Par_Val, One_Fifty Int_2_Par_Val,

            One_Fifty* Int_Par_Ref);

void Proc_8 (Arr_1_Dim Arr_1_Par_Ref, Arr_2_Dim Arr_2_Par_Ref,

             int Int_1_Par_Val, int Int_2_Par_Val);

Enumeration Func_1 (Capital_Letter Ch_1_Par_Val, Capital_Letter Ch_2_Par_Val);

#endif // __ECOS__

/*

 *************************************************************************

 *

 *                   "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 <stdio.h>

#ifndef __ECOS__

#include "dhry.h"

#endif // __ECOS__

/* 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];

char Reg_Define[] = "Register option selected.";

#ifndef __ECOS__

extern char     *malloc ();

Enumeration     Func_1 ();

#endif

  /*

  forward declaration necessary since Enumeration may not simply be int

  */

#ifndef __ECOS__

#ifndef ROPT

#define REG

        /* REG becomes defined as empty */

        /* i.e. no register variables   */

#else

#define REG register

#endif

#endif

/* variables for time measurement: */

#define Too_Small_Time 2

                /* Measurements should last at least 2 seconds */

double          Begin_Time,

                End_Time,

                User_Time;

double          Microseconds,

                Dhrystones_Per_Second,

                Vax_Mips;

/* end of variables for time measurement */

#ifndef __ECOS__

void main ()

#else // __ECOS__

int main (void)

#endif // __ECOS__

/*****/

  /* main program, corresponds to procedures        */

  /* Main and Proc_0 in the Ada version             */

{

#ifndef __ECOS__

  double   dtime();

#endif // __ECOS__

        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;

#ifdef __ECOS__

    CYG_TEST_INIT();

#ifdef CYG_HAL_I386_LINUX

    CYG_TEST_NA("Only runs on hardware...");

#else

    if (cyg_test_is_simulator)

        CYG_TEST_NA("Only runs on hardware...");

#endif

#else // __ECOS__

        FILE            *Ap;

  /* Initializations */

  if ((Ap = fopen("dhry.res","a+")) == NULL)

    {

       printf("Can not open dhry.res\n\n");

       exit(1);

    }

#endif // __ECOS__

  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 __ECOS__

  Number_Of_Runs = PASSES;

#else // __ECOS__

  printf ("Please give the number of runs through the benchmark: ");

  {

    int n;

    scanf ("%d", &n);

    Number_Of_Runs = n;

  }

  printf ("\n");

#endif // __ECOS__

  printf ("Execution starts, %d runs through Dhrystone\n",Number_Of_Runs);

  /***************/

  /* Start timer */

  /***************/

  Begin_Time = dtime();

  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 */

  /**************/

  End_Time = dtime();

  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);