URL https://opencores.org/ocsvn/or1k/or1k/trunk

Subversion Repositories or1k

[/] [or1k/] [trunk/] [or1ksim/] [testbench/] [dhry.c] - Blame information for rev 1770

Go to most recent revision | Details | Compare with Previous | View Log


/*
 ****************************************************************************
 *
 *                   "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 "support.h"
#include "dhry.h"
 
#define NUM_RUNS (20)
#define DLX_FREQ 200  /* in MHz */
#define PROC_6 0
 
#ifndef strcpy
char *strcpy (char *dst0, char *src0)
{
  char *s = dst0;
 
  while ((*dst0++ = *src0++));
 
  return s;
}
#endif
 
#ifndef strcmp
int strcmp (const char *s1, const char *s2)
{
  while (*s1 && *s2 && *s1 == *s2) {
    s1++;
    s2++;
  }
  return (*(unsigned char *) s1) - (*(unsigned char *) s2);
}
#endif
 
#define DETECTNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080)
#define UNALIGNED(X, Y) \
  (((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1)))
 
 
/* 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];
 
 
  /* 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: */
 
#if DLX || OR1K
#define Too_Small_Time DLX_FREQ
#else
#define Too_Small_Time 1
#endif
 
#define TIMER0 0
#define TIMER1 1
 
 
 
 
 
unsigned int    Begin_Time,
                End_Time,
                User_Time,
                Microseconds,
                Dhrystones_Per_Second;
 
/* end of variables for time measurement */
 
 
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 Proc_5();
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);
Boolean Func_2(Str_30 Str_1_Par_Ref, Str_30 Str_2_Par_Ref);
Boolean Func_3(Enumeration     Enum_Par_Val);
 
int main ()
/*****/
 
  /* main program, corresponds to procedures        */
  /* Main and Proc_0 in the Ada version             */
{
        One_Fifty       Int_1_Loc;
  REG   One_Fifty       Int_2_Loc;
        One_Fifty       Int_3_Loc;
  REG   char            Ch_Index;
        Enumeration     Enum_Loc;
        Str_30          Str_1_Loc;
        Str_30          Str_2_Loc;
  REG   int             Run_Index;
  REG   int             Number_Of_Runs;
  Rec_Type              x, y;
 
  /* Initializations */
 
  Next_Ptr_Glob = (Rec_Pointer) &x;
  Ptr_Glob = (Rec_Pointer) &y;
 
  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.                   */
 
/* Initalize Data and Instruction Cache */
 
 
/*  printf ("\n");
  printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n");
  printf ("\n");
  if (Reg)
  {
    printf ("Program compiled with 'register' attribute\n");
    printf ("\n");
  }
  else
  {
    printf ("Program compiled without 'register' attribute\n");
    printf ("\n");
  }
  printf ("Please give the number of runs through the benchmark: ");
 */
  {
    int n;
    /* scanf ("%d", &n);
 */
    n = NUM_RUNS;
    Number_Of_Runs = n;
  }
  printf ("\n");
 
  printf ("Execution starts, %d runs through Dhrystone\n", Number_Of_Runs);
 
 
  /***************/
  /* Start timer */
  /***************/
 
/*  printf("%d", my_test2(Number_Of_Runs));*/
        start_timer(TIMER0);
        Begin_Time = read_timer(TIMER0);
 
  for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index)
  {
 
        report(1);
        report(Run_Index);
    Proc_5();
        report(2);
    Proc_4();
        report(3);
      /* 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;
        report(0x31);
        report((unsigned long)Str_1_Loc);
        report((unsigned long)Str_2_Loc);
 
    Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc);
      /* Bool_Glob == 1 */
        report(4);
    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 */
        report(5);
      /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
#if DBG
      printf("a) Int_1_Loc: %x\n", Int_1_Loc);
      printf("a) Int_2_Loc: %x\n", Int_2_Loc);
      printf("a) Int_3_Loc: %x\n\n", Int_3_Loc);
#endif
    Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc);
      /* Int_Glob == 5 */
#if DBG
      printf("b) Int_1_Loc: %x\n", Int_1_Loc);
      printf("b) Int_2_Loc: %x\n", Int_2_Loc);
      printf("b) Int_3_Loc: %x\n\n", Int_3_Loc);
#endif
        report(6);
 
    Proc_1 (Ptr_Glob);
#if DBG
      printf("c) Int_1_Loc: %x\n", Int_1_Loc);
      printf("c) Int_2_Loc: %x\n", Int_2_Loc);
      printf("c) Int_3_Loc: %x\n\n", Int_3_Loc);
#endif
        report(7);
 
    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;
#if DBG
      printf("d) Int_1_Loc: %x\n", Int_1_Loc);
      printf("d) Int_2_Loc: %x\n", Int_2_Loc);
      printf("d) Int_3_Loc: %x\n\n", Int_3_Loc);
#endif
        }
    }
        report(8);
 
      /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
#if DBG
      printf("e) Int_1_Loc: %x\n", Int_1_Loc);
      printf("e) Int_2_Loc: %x\n", Int_2_Loc);
      printf("e) Int_3_Loc: %x\n", Int_3_Loc);
      printf("e) Ch_1_Glob: %c\n\n", Ch_1_Glob);
#endif
    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);
        report(9);
 
      /* Int_1_Loc == 5 */
#if DBG
      printf("f) Int_1_Loc: %x\n", Int_1_Loc);
      printf("f) Int_2_Loc: %x\n", Int_2_Loc);
      printf("f) Int_3_Loc: %x\n\n", Int_3_Loc);
#endif
 
  } /* loop "for Run_Index" */
 
  /**************/
  /* Stop timer */
  /**************/
 
  End_Time = read_timer(TIMER0);
 
/*  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");
 
*/
 
 
  User_Time = End_Time - Begin_Time;
 /* microseconds */
 
  printf("Begin Time = %d\n",Begin_Time);
  printf("End Time   = %d\n",End_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
  {
#if DLX || OR1K
    User_Time /= DLX_FREQ;
#if DLX
    printf("DLX ");
#else
#if OR1K
    printf("OR1K ");
#else
    printf("Unknown CPU ");
#endif
#endif
    printf("at %u MHz  ", DLX_FREQ);
    if (PROC_6)
            printf("(+PROC_6)");
    printf("\n");
#endif
    Microseconds = User_Time / Number_Of_Runs;
    Dhrystones_Per_Second = Number_Of_Runs * 1000 / User_Time;
    printf ("Microseconds for one run through Dhrystone: ");
    printf ("%d us / %d runs\n", User_Time,Number_Of_Runs);
    printf ("Dhrystones per Second:                      ");
    printf ("%d \n", Dhrystones_Per_Second);
  }
  report (0xdeaddead);
  return 0;
}
 
 
void 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           */
 
        report(0x20010);
 
        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);
        report(0x20011);
        /*
         * 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);
        report(0x20012);
        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);
        report(0x20013);
 
}               /* Proc_1 */
 
 
void
  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 = 0;
 
        report(0x20020);
 
        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 */
 
 
void
  Proc_3(Ptr_Ref_Par)
/******************/
 /* executed once */
 /* Ptr_Ref_Par becomes Ptr_Glob */
 
        Rec_Pointer    *Ptr_Ref_Par;
 
{
        report(0x20030);
 
        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 */
 
 
void
  Proc_4()
{               /* without parameters */
        /*******/
        /* executed once */
        Boolean         Bool_Loc;
 
        report(0x20040);
 
        Bool_Loc = Ch_1_Glob == 'A';
        Bool_Glob = Bool_Loc | Bool_Glob;
        Ch_2_Glob = 'B';
}               /* Proc_4 */
 
 
void
  Proc_5()
{               /* without parameters */
        /*******/
        /* executed once */
        report(0x20050);
 
        Ch_1_Glob = 'A';
        Bool_Glob = false;
}               /* Proc_5 */
 
/* @(#)dhry_2.c 1.2 92/05/28 14:44:54, AMD */
/*
 ****************************************************************************
 *
 *                   "DHRYSTONE" Benchmark Program
 *                   -----------------------------
 *
 *  Version:    C, Version 2.1
 *
 *  File:       dhry_2.c (part 3 of 3)
 *
 *  Date:       May 25, 1988
 *
 *  Author:     Reinhold P. Weicker
 *
 ****************************************************************************
 */
 
#ifndef REG
#define REG
 /* REG becomes defined as empty */
 /* i.e. no register variables   */
#ifdef _AM29K
#undef REG
#define REG register    /* Define REG; saves room on 127-char MS-DOS cmd line */
#endif
#endif
 
 
void
  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;
{
#if PROC_6
        report(0x20060);
 
    *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 */
#endif
    return;
}                               /* Proc_6 */
 
 
void
  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;
 
        report(0x20070);
 
    Int_Loc = Int_1_Par_Val + 2;
    *Int_Par_Ref = Int_2_Par_Val + Int_Loc;
}                               /* Proc_7 */
 
 
void
  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;
 
#if DBG
      printf("X) Int_1_Par_Val: %x\n", Int_1_Par_Val);
      printf("X) Int_2_Par_Val: %x\n", Int_2_Par_Val);
#endif
 
        report(0x20080);
 
    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;
 
#if DBG
      printf("Y) Int_1_Par_Val: %x\n", Int_1_Par_Val);
      printf("Y) Int_2_Par_Val: %x\n", Int_2_Par_Val);
#endif
 
}                               /* 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;
 
        report(0x30010);
 
    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 = 0;
 
        report(0x30020);
 
    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 */
        report(0x30021);
 
    if (Ch_Loc >= 'W' && Ch_Loc < 'Z')
        /* then, not executed */
        Int_Loc = 7;
        report(0x30022);
    if (Ch_Loc == 'R')
        /* then, not executed */
        return (true);
    else {                      /* executed */
        report(0x30023);
        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;
        report(0x30030);
    if (Enum_Loc == Ident_3)
        /* then, executed */
        return (true);
    else                        /* not executed */
        return (false);
}                               /* Func_3 */

Line No.	Rev	Author	Line
1	224	markom	`/*`
2			`****************************************************************************`
3			`*`
4			`* "DHRYSTONE" Benchmark Program`
5			`* -----------------------------`
6			`*`
7			`* Version: C, Version 2.1`
8			`*`
9			`* File: dhry_1.c (part 2 of 3)`
10			`*`
11			`* Date: May 25, 1988`
12			`*`
13			`* Author: Reinhold P. Weicker`
14			`*`
15			`****************************************************************************`
16			`*/`
17			`#include "support.h"`
18			`#include "dhry.h"`
19
20	532	markom	`#define NUM_RUNS (20)`
21	224	markom	`#define DLX_FREQ 200 /* in MHz */`
22			`#define PROC_6 0`
23
24	381	markom	`#ifndef strcpy`
25	224	markom	`char strcpy (char dst0, char *src0)`
26			`{`
27			`char *s = dst0;`
28
29			`while ((dst0++ = src0++));`
30
31			`return s;`
32			`}`
33	381	markom	`#endif`
34	224	markom
35	381	markom	`#ifndef strcmp`
36	224	markom	`int strcmp (const char s1, const char s2)`
37			`{`
38	715	markom	`while (s1 && s2 && s1 == s2) {`
39			`s1++;`
40			`s2++;`
41			`}`
42	224	markom	`return ((unsigned char ) s1) - ((unsigned char ) s2);`
43			`}`
44	381	markom	`#endif`
45	224	markom
46			`#define DETECTNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080)`
47			`#define UNALIGNED(X, Y) \`
48			`(((long)X & (sizeof (long) - 1)) \| ((long)Y & (sizeof (long) - 1)))`
49
50
51			`/* Global Variables: */`
52
53			`Rec_Pointer Ptr_Glob,`
54			`Next_Ptr_Glob;`
55			`int Int_Glob;`
56			`Boolean Bool_Glob;`
57			`char Ch_1_Glob,`
58			`Ch_2_Glob;`
59			`int Arr_1_Glob [50];`
60			`int Arr_2_Glob [50] [50];`
61
62
63			`/* forward declaration necessary since Enumeration may not simply be int */`
64
65			`#ifndef REG`
66			`Boolean Reg = false;`
67			`#define REG`
68			`/* REG becomes defined as empty */`
69			`/* i.e. no register variables */`
70			`#else`
71			`Boolean Reg = true;`
72			`#endif`
73
74			`/* variables for time measurement: */`
75
76			`#if DLX \|\| OR1K`
77			`#define Too_Small_Time DLX_FREQ`
78			`#else`
79			`#define Too_Small_Time 1`
80			`#endif`
81
82			`#define TIMER0 0`
83			`#define TIMER1 1`
84
85
86
87
88
89			`unsigned int Begin_Time,`
90			`End_Time,`
91			`User_Time,`
92			`Microseconds,`
93			`Dhrystones_Per_Second;`
94
95			`/* end of variables for time measurement */`
96
97
98			`void Proc_1(REG Rec_Pointer Ptr_Val_Par);`
99			`void Proc_2(One_Fifty *Int_Par_Ref);`
100			`void Proc_3(Rec_Pointer *Ptr_Ref_Par);`
101			`void Proc_4();`
102			`void Proc_5();`
103			`void Proc_6(`
104			`Enumeration Enum_Val_Par,`
105			`Enumeration *Enum_Ref_Par);`
106			`void Proc_7(`
107			`One_Fifty Int_1_Par_Val,`
108			`One_Fifty Int_2_Par_Val,`
109			`One_Fifty *Int_Par_Ref);`
110			`void Proc_8(`
111			`Arr_1_Dim Arr_1_Par_Ref,`
112			`Arr_2_Dim Arr_2_Par_Ref,`
113			`int Int_1_Par_Val,`
114			`int Int_2_Par_Val);`
115			`Enumeration Func_1(Capital_Letter Ch_1_Par_Val,`
116			`Capital_Letter Ch_2_Par_Val);`
117			`Boolean Func_2(Str_30 Str_1_Par_Ref, Str_30 Str_2_Par_Ref);`
118			`Boolean Func_3(Enumeration Enum_Par_Val);`
119
120			`int main ()`
121			`/*****/`
122
123			`/* main program, corresponds to procedures */`
124			`/* Main and Proc_0 in the Ada version */`
125			`{`
126			`One_Fifty Int_1_Loc;`
127			`REG One_Fifty Int_2_Loc;`
128			`One_Fifty Int_3_Loc;`
129			`REG char Ch_Index;`
130			`Enumeration Enum_Loc;`
131			`Str_30 Str_1_Loc;`
132			`Str_30 Str_2_Loc;`
133			`REG int Run_Index;`
134			`REG int Number_Of_Runs;`
135			`Rec_Type x, y;`
136
137			`/* Initializations */`
138
139			`Next_Ptr_Glob = (Rec_Pointer) &x;`
140			`Ptr_Glob = (Rec_Pointer) &y;`
141
142			`Ptr_Glob->Ptr_Comp = Next_Ptr_Glob;`
143			`Ptr_Glob->Discr = Ident_1;`
144			`Ptr_Glob->variant.var_1.Enum_Comp = Ident_3;`
145			`Ptr_Glob->variant.var_1.Int_Comp = 40;`
146			`strcpy (Ptr_Glob->variant.var_1.Str_Comp,`
147			`"DHRYSTONE PROGRAM, SOME STRING");`
148			`strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");`
149
150			`Arr_2_Glob [8][7] = 10;`
151			`/* Was missing in published program. Without this statement, */`
152			`/* Arr_2_Glob [8][7] would have an undefined value. */`
153			`/* Warning: With 16-Bit processors and Number_Of_Runs > 32000, */`
154			`/* overflow may occur for this array element. */`
155
156			`/* Initalize Data and Instruction Cache */`
157
158
159	1024	simons	`/* printf ("\n");`
160			`printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n");`
161			`printf ("\n");`
162	224	markom	`if (Reg)`
163			`{`
164	1024	simons	`printf ("Program compiled with 'register' attribute\n");`
165			`printf ("\n");`
166	224	markom	`}`
167			`else`
168			`{`
169	1024	simons	`printf ("Program compiled without 'register' attribute\n");`
170			`printf ("\n");`
171	224	markom	`}`
172	1024	simons	`printf ("Please give the number of runs through the benchmark: ");`
173	224	markom	`*/`
174			`{`
175			`int n;`
176			`/* scanf ("%d", &n);`
177			`*/`
178			`n = NUM_RUNS;`
179			`Number_Of_Runs = n;`
180			`}`
181	1024	simons	`printf ("\n");`
182	224	markom
183	1024	simons	`printf ("Execution starts, %d runs through Dhrystone\n", Number_Of_Runs);`
184	224	markom
185
186			`/***************/`
187			`/* Start timer */`
188			`/***************/`
189
190	1024	simons	`/* printf("%d", my_test2(Number_Of_Runs));*/`
191	224	markom	`start_timer(TIMER0);`
192			`Begin_Time = read_timer(TIMER0);`
193
194			`for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index)`
195			`{`
196
197			`report(1);`
198			`report(Run_Index);`
199			`Proc_5();`
200			`report(2);`
201			`Proc_4();`
202			`report(3);`
203			`/* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */`
204			`Int_1_Loc = 2;`
205			`Int_2_Loc = 3;`
206			`strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");`
207			`Enum_Loc = Ident_2;`
208			`report(0x31);`
209			`report((unsigned long)Str_1_Loc);`
210			`report((unsigned long)Str_2_Loc);`
211
212			`Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc);`
213			`/* Bool_Glob == 1 */`
214			`report(4);`
215			`while (Int_1_Loc < Int_2_Loc) /* loop body executed once */`
216			`{`
217			`Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc;`
218			`/* Int_3_Loc == 7 */`
219			`Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc);`
220			`/* Int_3_Loc == 7 */`
221			`Int_1_Loc += 1;`
222			`} /* while */`
223			`report(5);`
224			`/* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */`
225			`#if DBG`
226	1024	simons	`printf("a) Int_1_Loc: %x\n", Int_1_Loc);`
227			`printf("a) Int_2_Loc: %x\n", Int_2_Loc);`
228			`printf("a) Int_3_Loc: %x\n\n", Int_3_Loc);`
229	224	markom	`#endif`
230			`Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc);`
231			`/* Int_Glob == 5 */`
232			`#if DBG`
233	1024	simons	`printf("b) Int_1_Loc: %x\n", Int_1_Loc);`
234			`printf("b) Int_2_Loc: %x\n", Int_2_Loc);`
235			`printf("b) Int_3_Loc: %x\n\n", Int_3_Loc);`
236	224	markom	`#endif`
237			`report(6);`
238
239			`Proc_1 (Ptr_Glob);`
240			`#if DBG`
241	1024	simons	`printf("c) Int_1_Loc: %x\n", Int_1_Loc);`
242			`printf("c) Int_2_Loc: %x\n", Int_2_Loc);`
243			`printf("c) Int_3_Loc: %x\n\n", Int_3_Loc);`
244	224	markom	`#endif`
245			`report(7);`
246
247			`for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index)`
248			`/* loop body executed twice */`
249			`{`
250			`if (Enum_Loc == Func_1 (Ch_Index, 'C'))`
251			`/* then, not executed */`
252			`{`
253			`Proc_6 (Ident_1, &Enum_Loc);`
254			`strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");`
255			`Int_2_Loc = Run_Index;`
256			`Int_Glob = Run_Index;`
257			`#if DBG`
258	1024	simons	`printf("d) Int_1_Loc: %x\n", Int_1_Loc);`
259			`printf("d) Int_2_Loc: %x\n", Int_2_Loc);`
260			`printf("d) Int_3_Loc: %x\n\n", Int_3_Loc);`
261	224	markom	`#endif`
262			`}`
263			`}`
264			`report(8);`
265
266			`/* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */`
267			`#if DBG`
268	1024	simons	`printf("e) Int_1_Loc: %x\n", Int_1_Loc);`
269			`printf("e) Int_2_Loc: %x\n", Int_2_Loc);`
270			`printf("e) Int_3_Loc: %x\n", Int_3_Loc);`
271			`printf("e) Ch_1_Glob: %c\n\n", Ch_1_Glob);`
272	224	markom	`#endif`
273			`Int_2_Loc = Int_2_Loc * Int_1_Loc;`
274			`Int_1_Loc = Int_2_Loc / Int_3_Loc;`
275			`Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc;`
276			`/* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */`
277			`Proc_2 (&Int_1_Loc);`
278			`report(9);`
279
280			`/* Int_1_Loc == 5 */`
281			`#if DBG`
282	1024	simons	`printf("f) Int_1_Loc: %x\n", Int_1_Loc);`
283			`printf("f) Int_2_Loc: %x\n", Int_2_Loc);`
284			`printf("f) Int_3_Loc: %x\n\n", Int_3_Loc);`
285	224	markom	`#endif`
286
287			`} /* loop "for Run_Index" */`
288
289			`/**************/`
290			`/* Stop timer */`
291			`/**************/`
292
293			`End_Time = read_timer(TIMER0);`
294
295	1024	simons	`/* printf ("Execution ends\n");`
296			`printf ("\n");`
297			`printf ("Final values of the variables used in the benchmark:\n");`
298			`printf ("\n");`
299			`printf ("Int_Glob: %d\n", Int_Glob);`
300			`printf (" should be: %d\n", 5);`
301			`printf ("Bool_Glob: %d\n", Bool_Glob);`
302			`printf (" should be: %d\n", 1);`
303			`printf ("Ch_1_Glob: %c\n", Ch_1_Glob);`
304			`printf (" should be: %c\n", 'A');`
305			`printf ("Ch_2_Glob: %c\n", Ch_2_Glob);`
306			`printf (" should be: %c\n", 'B');`
307			`printf ("Arr_1_Glob[8]: %d\n", Arr_1_Glob[8]);`
308			`printf (" should be: %d\n", 7);`
309			`printf ("Arr_2_Glob[8][7]: %d\n", Arr_2_Glob[8][7]);`
310			`printf (" should be: Number_Of_Runs + 10\n");`
311			`printf ("Ptr_Glob->\n");`
312			`printf (" Ptr_Comp: %d\n", (int) Ptr_Glob->Ptr_Comp);`
313			`printf (" should be: (implementation-dependent)\n");`
314			`printf (" Discr: %d\n", Ptr_Glob->Discr);`
315			`printf (" should be: %d\n", 0);`
316			`printf (" Enum_Comp: %d\n", Ptr_Glob->variant.var_1.Enum_Comp);`
317			`printf (" should be: %d\n", 2);`
318			`printf (" Int_Comp: %d\n", Ptr_Glob->variant.var_1.Int_Comp);`
319			`printf (" should be: %d\n", 17);`
320			`printf (" Str_Comp: %s\n", Ptr_Glob->variant.var_1.Str_Comp);`
321			`printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");`
322			`printf ("Next_Ptr_Glob->\n");`
323			`printf (" Ptr_Comp: %d\n", (int) Next_Ptr_Glob->Ptr_Comp);`
324			`printf (" should be: (implementation-dependent), same as above\n");`
325			`printf (" Discr: %d\n", Next_Ptr_Glob->Discr);`
326			`printf (" should be: %d\n", 0);`
327			`printf (" Enum_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp);`
328			`printf (" should be: %d\n", 1);`
329			`printf (" Int_Comp: %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp);`
330			`printf (" should be: %d\n", 18);`
331			`printf (" Str_Comp: %s\n",`
332	224	markom	`Next_Ptr_Glob->variant.var_1.Str_Comp);`
333	1024	simons	`printf (" should be: DHRYSTONE PROGRAM, SOME STRING\n");`
334			`printf ("Int_1_Loc: %d\n", Int_1_Loc);`
335			`printf (" should be: %d\n", 5);`
336			`printf ("Int_2_Loc: %d\n", Int_2_Loc);`
337			`printf (" should be: %d\n", 13);`
338			`printf ("Int_3_Loc: %d\n", Int_3_Loc);`
339			`printf (" should be: %d\n", 7);`
340			`printf ("Enum_Loc: %d\n", Enum_Loc);`
341			`printf (" should be: %d\n", 1);`
342			`printf ("Str_1_Loc: %s\n", Str_1_Loc);`
343			`printf (" should be: DHRYSTONE PROGRAM, 1'ST STRING\n");`
344			`printf ("Str_2_Loc: %s\n", Str_2_Loc);`
345			`printf (" should be: DHRYSTONE PROGRAM, 2'ND STRING\n");`
346	224	markom
347			`*/`
348
349
350			`User_Time = End_Time - Begin_Time;`
351			`/* microseconds */`
352
353	1024	simons	`printf("Begin Time = %d\n",Begin_Time);`
354			`printf("End Time = %d\n",End_Time);`
355	224	markom
356
357			`if (User_Time < Too_Small_Time)`
358			`{`
359	1024	simons	`printf ("Measured time too small to obtain meaningful results\n");`
360			`printf ("Please increase number of runs\n");`
361			`printf ("\n");`
362	224	markom	`}`
363			`else`
364			`{`
365			`#if DLX \|\| OR1K`
366			`User_Time /= DLX_FREQ;`
367			`#if DLX`
368	1024	simons	`printf("DLX ");`
369	224	markom	`#else`
370			`#if OR1K`
371	1024	simons	`printf("OR1K ");`
372	224	markom	`#else`
373	1024	simons	`printf("Unknown CPU ");`
374	224	markom	`#endif`
375			`#endif`
376	1024	simons	`printf("at %u MHz ", DLX_FREQ);`
377	224	markom	`if (PROC_6)`
378	1024	simons	`printf("(+PROC_6)");`
379			`printf("\n");`
380	224	markom	`#endif`
381			`Microseconds = User_Time / Number_Of_Runs;`
382			`Dhrystones_Per_Second = Number_Of_Runs * 1000 / User_Time;`
383	1024	simons	`printf ("Microseconds for one run through Dhrystone: ");`
384			`printf ("%d us / %d runs\n", User_Time,Number_Of_Runs);`
385			`printf ("Dhrystones per Second: ");`
386			`printf ("%d \n", Dhrystones_Per_Second);`
387	224	markom	`}`
388			`report (0xdeaddead);`
389			`return 0;`
390			`}`
391
392
393			`void Proc_1(Ptr_Val_Par)`
394			`/******************/`
395
396			`REG Rec_Pointer Ptr_Val_Par;`
397			`/* executed once */`
398			`{`
399			`REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp;`
400			`/* == Ptr_Glob_Next */`
401			`/* Local variable, initialized with Ptr_Val_Par->Ptr_Comp, */`
402			`/* corresponds to "rename" in Ada, "with" in Pascal */`
403
404			`report(0x20010);`
405
406			`structassign(Ptr_Val_Par->Ptr_Comp, Ptr_Glob);`
407			`Ptr_Val_Par->variant.var_1.Int_Comp = 5;`
408			`Next_Record->variant.var_1.Int_Comp`
409			`= Ptr_Val_Par->variant.var_1.Int_Comp;`
410			`Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp;`
411			`Proc_3(&Next_Record->Ptr_Comp);`
412			`report(0x20011);`
413			`/*`
414			`* Ptr_Val_Par->Ptr_Comp->Ptr_Comp == Ptr_Glob->Ptr_Comp`
415			`*/`
416			`if (Next_Record->Discr == Ident_1)`
417			`/* then, executed */`
418			`{`
419			`Next_Record->variant.var_1.Int_Comp = 6;`
420			`Proc_6(Ptr_Val_Par->variant.var_1.Enum_Comp,`
421			`&Next_Record->variant.var_1.Enum_Comp);`
422			`report(0x20012);`
423			`Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp;`
424			`Proc_7(Next_Record->variant.var_1.Int_Comp, 10,`
425			`&Next_Record->variant.var_1.Int_Comp);`
426			`} else /* not executed */`
427			`structassign(Ptr_Val_Par, Ptr_Val_Par->Ptr_Comp);`
428			`report(0x20013);`
429
430			`} /* Proc_1 */`
431
432
433			`void`
434			`Proc_2(Int_Par_Ref)`
435			`/******************/`
436			`/* executed once */`
437			`/* Int_Par_Ref == 1, becomes 4 /`
438
439			`One_Fifty *Int_Par_Ref;`
440			`{`
441			`One_Fifty Int_Loc;`
442			`Enumeration Enum_Loc = 0;`
443
444			`report(0x20020);`
445
446			`Int_Loc = *Int_Par_Ref + 10;`
447			`do /* executed once */`
448			`if (Ch_1_Glob == 'A')`
449			`/* then, executed */`
450			`{`
451			`Int_Loc -= 1;`
452			`*Int_Par_Ref = Int_Loc - Int_Glob;`
453			`Enum_Loc = Ident_1;`
454			`} /* if */`
455			`while (Enum_Loc != Ident_1);/* true */`
456			`} /* Proc_2 */`
457
458
459			`void`
460			`Proc_3(Ptr_Ref_Par)`
461			`/******************/`
462			`/* executed once */`
463			`/* Ptr_Ref_Par becomes Ptr_Glob */`
464
465			`Rec_Pointer *Ptr_Ref_Par;`
466
467			`{`
468			`report(0x20030);`
469
470			`if (Ptr_Glob != Null)`
471			`/* then, executed */`
472			`*Ptr_Ref_Par = Ptr_Glob->Ptr_Comp;`
473			`Proc_7(10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp);`
474			`} /* Proc_3 */`
475
476
477			`void`
478			`Proc_4()`
479			`{ /* without parameters */`
480			`/*******/`
481			`/* executed once */`
482			`Boolean Bool_Loc;`
483
484			`report(0x20040);`
485
486			`Bool_Loc = Ch_1_Glob == 'A';`
487			`Bool_Glob = Bool_Loc \| Bool_Glob;`
488			`Ch_2_Glob = 'B';`
489			`} /* Proc_4 */`
490
491
492			`void`
493			`Proc_5()`
494			`{ /* without parameters */`
495			`/*******/`
496			`/* executed once */`
497			`report(0x20050);`
498
499			`Ch_1_Glob = 'A';`
500			`Bool_Glob = false;`

Browse

Tools

Subversion Repositories or1k

[/] [or1k/] [trunk/] [or1ksim/] [testbench/] [dhry.c] - Blame information for rev 1770