/* I changed some constants (to get loanger run times and commented
   out the main() function - Anton Ertl */

/*  This is a suite of benchmarks that are relatively short, both in program
    size and execution time.  It requires no input, and prints the execution
    time for each program, using the system- dependent routine Getclock,
    below, to find out the current CPU time.  It does a rudimentary check to
    make sure each program gets the right output.  These programs were
    gathered by John Hennessy and modified by Peter Nye. 

4.1 VERSION   */

#define  nil		 0
#define	 false		 0
#define  true		 1
#define  bubblebase 	 1.61
#define  dnfbase 	 3.5
#define  permbase 	 1.75
#define  queensbase 	 1.83
#define  towersbase 	 2.39
#define  quickbase 	 1.92
#define  intmmbase 	 1.46
#define  treebase 	  2.5
#define  mmbase 	 0.0
#define  fpmmbase 	 2.92
#define  puzzlebase 	 0.5
#define  fftbase 	 0.0
#define  fpfftbase 	 4.44
    /* Towers */
#define maxcells 	 18

    /* Intmm, Mm */
#define rowsize 	 200

    /* Puzzle */
#define size	 	 511
#define classmax 	 3
#define typemax 	 12
#define d 		 8

    /* Bubble, Quick */
#define sortelements 	 6000
#define srtelements 	 6000

    /* fft */
#define fftsize 	 256 
#define fftsize2 	 129  
/*
type */
    /* Perm */
#define    permrange 10

   /* tree */
struct node {
	struct node *left,*right;
	int val;
    };

    /* Towers */ /*
    discsizrange = 1..maxcells; */
#define    stackrange	3
/*    cellcursor = 0..maxcells; */
struct    element {
	    int discsize;
	    int next;
	};
/*    emsgtype = packed array[1..15] of char;
*/
    /* Intmm, Mm */ /*
    index = 1 .. rowsize;
    intmatrix = array [index,index] of integer;
    realmatrix = array [index,index] of real;
*/
    /* Puzzle */ /*
    piececlass = 0..classmax;
    piecetype = 0..typemax;
    position = 0..size;
*/
    /* Bubble, Quick */ /*
    listsize = 0..sortelements;
    sortarray = array [listsize] of integer;
*/
    /* FFT */
struct    complex { float rp, ip; } ;
/*
    carray = array [1..fftsize] of complex ;
    c2array = array [1..fftsize2] of complex ;
*/

float value;
float    fixed,floated;

    /* global */
int    seed;

    /* Perm */
int    permarray[permrange+1];
int    pctr;

    /* tree */
struct node *tree;

    /* Towers */
    stack[stackrange+1];
struct element    cellspace[maxcells+1];
int    freelist,
       movesdone;

    /* Intmm, Mm */
int ima[rowsize+1][rowsize+1], imb[rowsize+1][rowsize+1], imr[rowsize+1][rowsize+1];
float rma[rowsize+1][rowsize+1], rmb[rowsize+1][rowsize+1], rmr[rowsize+1][rowsize+1];

    /* Puzzle */
int	piececount[classmax+1],
	class[typemax+1],
	piecemax[typemax+1],
	puzzl[size+1],
	p[typemax+1][size+1],
	n,
	kount;

    /* Bubble, Quick */
int    sortlist[sortelements+1],
    biggest, littlest,
    top;

    /* FFT */
struct complex    z[fftsize+1], w[fftsize+1],
    e[fftsize2+1];
float    zr, zi;

/* global procedures */

#include <sys/param.h>

#ifdef BSD
#include <sys/time.h>
#include <sys/resource.h>
double Getclock ()
{
    struct rusage ru;
    getrusage (RUSAGE_SELF, &ru);
    return (double)ru.ru_utime.tv_sec + (double)ru.ru_utime.tv_usec*1e-6;
}
#else
#include <sys/types.h>
#include <sys/times.h>
double Getclock ()
    {
    struct tms rusage;
    times (&rusage);
    return (double)rusage.tms_utime/(double)HZ;
    }
#endif


Initrand ()
    {
    seed = 74755;
    };

int Rand ()
    {
    seed = (seed * 1309 + 13849) & 65535;
    return( seed );
    };



    /* Permutation program, heavily recursive, written by Denny Brown. */

    Swap ( a,b )
	int *a, *b;
	{
	int t;
	t = *a;  *a = *b;  *b = t;
	};

    Initialize ()
	{
	int i;
	for ( i = 1; i <= 7; i++ ) {
	    permarray[i]=i-1;
	    };
	};

    Permute (n)
	int n;
	{   /* permute */
	int k;
	pctr = pctr + 1;
	if ( n!=1 )  {
	    Permute(n-1);
	    for ( k = n-1; k >= 1; k-- ) {
		Swap(&permarray[n],&permarray[k]);
		Permute(n-1);
		Swap(&permarray[n],&permarray[k]);
		};
	    };
	}     /* permute */;

Perm ()    {   /* Perm */
    int i;
    pctr = 0;
    for ( i = 1; i <= 5; i++ ) {
	Initialize();
	Permute(7);
	};
    if ( pctr != 43300 )
	printf(" Error in Perm.\n");
    }     /* Perm */;



    /*  Program to Solve the Towers of Hanoi */

    Error (emsg) char *emsg;
	{
	printf(" Error in Towers: %s\n",emsg);
	};

    Makenull (s)
	{
	stack[s]=0;
	};

    int Getelement ()
	{
	int temp;
	if ( freelist>0 )
	    {
	    temp = freelist;
	    freelist = cellspace[freelist].next;
	    }
	else
	    Error("out of space   ");
	return (temp);
	};

    Push(i,s) int i, s;
	{
        int errorfound, localel;
	errorfound=false;
	if ( stack[s] > 0 )
	    if ( cellspace[stack[s]].discsize<=i )
		{
		errorfound=true;
		Error("disc size error");
		};
	if ( ! errorfound )
	    {
	    localel=Getelement();
	    cellspace[localel].next=stack[s];
	    stack[s]=localel;
	    cellspace[localel].discsize=i;
	    }
	};

    Init (s,n) int s, n;
	{
	int discctr;
	Makenull(s);
	for ( discctr = n; discctr >= 1; discctr-- )
	    Push(discctr,s);
	};

    int Pop (s) int s;
	{
	 int temp, temp1;
	if ( stack[s] > 0 )
	    {
	    temp1 = cellspace[stack[s]].discsize;
	    temp = cellspace[stack[s]].next;
	    cellspace[stack[s]].next=freelist;
	    freelist=stack[s];
	    stack[s]=temp;
	    return (temp1);
	    }
	else
	    Error("nothing to pop ");
	};

    Move (s1,s2) int s1, s2;
	{
	Push(Pop(s1),s2);
	movesdone=movesdone+1;
	};

    tower(i,j,k) int i,j,k;
	{
	int other;
	if ( k==1 )
	    Move(i,j);
	else
	    {
	    other=6-i-j;
	    tower(i,other,k-1);
	    Move(i,j);
	    tower(other,j,k-1);
	    }
	};


Towers ()    { /* Towers */
    int i;
    for ( i=1; i <= maxcells; i++ )
	cellspace[i].next=i-1;
    freelist=maxcells;
    Init(1,14);
    Makenull(2);
    Makenull(3);
    movesdone=0;
    tower(1,2,14);
    if ( movesdone != 16383 )
	printf (" Error in Towers.\n");
    }; /* Towers */


    /* The eight queens problem, solved 50 times. */
/*
	type    
	    doubleboard =   2..16;
	    doublenorm  =   -7..7;
	    boardrange  =   1..8;
	    aarray      =   array [boardrange] of boolean;
	    barray      =   array [doubleboard] of boolean;
	    carray      =   array [doublenorm] of boolean;
	    xarray      =   array [boardrange] of boardrange;
*/

	Try(i, q, a, b, c, x) int i, *q, a[], b[], c[], x[];
	    {
	    int     j;
	    j = 0;
	    *q = false;
	    while ( (! *q) && (j != 8) )
		{ j = j + 1;
		*q = false;
		if ( b[j] && a[i+j] && c[i-j+7] )
		    { x[i] = j;
		    b[j] = false;
		    a[i+j] = false;
		    c[i-j+7] = false;
		    if ( i < 8 )
			{ Try(i+1,q,a,b,c,x);
			if ( ! *q )
			    { b[j] = true;
			    a[i+j] = true;
			    c[i-j+7] = true;
			    }
			}
		    else *q = true;
		    }
		}
	    };
	
    Doit ()
	{
	int i,q;
	int a[9], b[17], c[15], x[9];
	i = 0 - 7;
	while ( i <= 16 )
	    { if ( (i >= 1) && (i <= 8) ) a[i] = true;
	    if ( i >= 2 ) b[i] = true;
	    if ( i <= 7 ) c[i+7] = true;
	    i = i + 1;
	    };

	Try(1, &q, b, a, c, x);
	if ( ! q )
	    printf (" Error in Queens.\n");
	};

Queens ()
    {
    int i;
    for ( i = 1; i <= 50; i++ ) Doit();
    };

    /* Multiplies two integer matrices. */

    Initmatrix ( m ) int m[rowsize+1][rowsize+1];
	{
	int temp, i, j;
	for ( i = 1; i <= rowsize; i++ )
	    for ( j = 1; j <= rowsize; j++ )
	    {	temp = Rand();
		m[i][j] = temp - (temp/120)*120 - 60;
            };
	};

    Innerproduct( result,a,b, row,column)
	int *result,a[rowsize+1][rowsize+1],b[rowsize+1][rowsize+1],row,column;
	/* computes the inner product of A[row,*] and B[*,column] */
	{
	int i;
	*result = 0;
	for(i = 1; i <= rowsize; i++ )*result = *result+a[row][i]*b[i][column];
	};

Intmm ()
    {
    int i, j;
    Initrand();
    Initmatrix (ima);
    Initmatrix (imb);
    for ( i = 1; i <= rowsize; i++ )
	for ( j = 1; j <= rowsize; j++ ) Innerproduct(&imr[i][j],ima,imb,i,j);
    };


    /* Multiplies two real matrices. */

    rInitmatrix ( m ) float m[rowsize+1][rowsize+1];
	{
	int temp, i, j;
	for ( i = 1; i <= rowsize; i++ )
	    for ( j = 1; j <= rowsize; j++ )
	    {   temp = Rand();
		m[i][j] = (temp - (temp/120)*120 - 60)/3;
            }
	};

    rInnerproduct(result,a,b,row,column)
	float *result,a[rowsize+1][rowsize+1],b[rowsize+1][rowsize+1];
	int row,column;
	/* computes the inner product of A[row,*] and B[*,column] */
	{
	int i;
	*result = 0.0;
	for (i = 1; i<=rowsize; i++) *result = *result+a[row][i]*b[i][column];
	};

Mm ()    {
    int i, j;
    Initrand();
    rInitmatrix (rma);
    rInitmatrix (rmb);
    for ( i = 1; i <= rowsize; i++ )
	for ( j = 1; j <= rowsize; j++ ) rInnerproduct(&rmr[i][j],rma,rmb,i,j);
    };




    /* A compute-bound program from Forest Baskett. */

    int Fit (i, j) int i, j;
	{
	int k;
	for ( k = 0; k <= piecemax[i]; k++ )
	    if ( p[i][k] ) if ( puzzl[j+k] ) return (false);
	return (true);
	};

    int Place (i, j) int i,j;
	{
	int k;
	for ( k = 0; k <= piecemax[i]; k++ )
	    if ( p[i][k] ) puzzl[j+k] = true;
	piececount[class[i]] = piececount[class[i]] - 1;
	for ( k = j; k <= size; k++ )
	    if ( ! puzzl[k] ) {
		return (k);
		};
	return (0);
	};

    Remove (i, j) int i, j;
	{
	int k;
	for ( k = 0; k <= piecemax[i]; k++ )
	    if ( p[i][k] ) puzzl[j+k] = false;
	piececount[class[i]] = piececount[class[i]] + 1;
	};

    int Trial (j) int j;
	{
	int i, k;
	kount = kount + 1;
	for ( i = 0; i <= typemax; i++ )
	    if ( piececount[class[i]] != 0 )
		if ( Fit (i, j) ) {
		    k = Place (i, j);
		    if ( Trial(k) || (k == 0) ) {
			return (true);
			}
		    else Remove (i, j);
		    };
	return (false);
	};

Puzzle ()
    {
    int i, j, k, m;
    for ( m = 0; m <= size; m++ ) puzzl[m] = true;
    for( i = 1; i <= 5; i++ )for( j = 1; j <= 5; j++ )for( k = 1; k <= 5; k++ )
	puzzl[i+d*(j+d*k)] = false;
    for( i = 0; i <= typemax; i++ )for( m = 0; m<= size; m++ ) p[i][m] = false;
    for( i = 0; i <= 3; i++ )for( j = 0; j <= 1; j++ )for( k = 0; k <= 0; k++ )
	p[0][i+d*(j+d*k)] = true;
    class[0] = 0;
    piecemax[0] = 3+d*1+d*d*0;
    for( i = 0; i <= 1; i++ )for( j = 0; j <= 0; j++ )for( k = 0; k <= 3; k++ )
	p[1][i+d*(j+d*k)] = true;
    class[1] = 0;
    piecemax[1] = 1+d*0+d*d*3;
    for( i = 0; i <= 0; i++ )for( j = 0; j <= 3; j++ )for( k = 0; k <= 1; k++ )
	p[2][i+d*(j+d*k)] = true;
    class[2] = 0;
    piecemax[2] = 0+d*3+d*d*1;
    for( i = 0; i <= 1; i++ )for( j = 0; j <= 3; j++ )for( k = 0; k <= 0; k++ )
	p[3][i+d*(j+d*k)] = true;
    class[3] = 0;
    piecemax[3] = 1+d*3+d*d*0;
    for( i = 0; i <= 3; i++ )for( j = 0; j <= 0; j++ )for( k = 0; k <= 1; k++ )
	p[4][i+d*(j+d*k)] = true;
    class[4] = 0;
    piecemax[4] = 3+d*0+d*d*1;
    for( i = 0; i <= 0; i++ )for( j = 0; j <= 1; j++ )for( k = 0; k <= 3; k++ )
	p[5][i+d*(j+d*k)] = true;
    class[5] = 0;
    piecemax[5] = 0+d*1+d*d*3;
    for( i = 0; i <= 2; i++ )for( j = 0; j <= 0; j++ )for( k = 0; k <= 0; k++ )
	p[6][i+d*(j+d*k)] = true;
    class[6] = 1;
    piecemax[6] = 2+d*0+d*d*0;
    for( i = 0; i <= 0; i++ )for( j = 0; j <= 2; j++ )for( k = 0; k <= 0; k++ )
	p[7][i+d*(j+d*k)] = true;
    class[7] = 1;
    piecemax[7] = 0+d*2+d*d*0;
    for( i = 0; i <= 0; i++ )for( j = 0; j <= 0; j++ )for( k = 0; k <= 2; k++ )
	p[8][i+d*(j+d*k)] = true;
    class[8] = 1;
    piecemax[8] = 0+d*0+d*d*2;
    for( i = 0; i <= 1; i++ )for( j = 0; j <= 1; j++ )for( k = 0; k <= 0; k++ )
	p[9][i+d*(j+d*k)] = true;
    class[9] = 2;
    piecemax[9] = 1+d*1+d*d*0;
    for( i = 0; i <= 1; i++ )for( j = 0; j <= 0; j++ )for( k = 0; k <= 1; k++ )
	p[10][i+d*(j+d*k)] = true;
    class[10] = 2;
    piecemax[10] = 1+d*0+d*d*1;
    for( i = 0; i <= 0; i++ )for( j = 0; j <= 1; j++ )for( k = 0; k <= 1; k++ )
	p[11][i+d*(j+d*k)] = true;
    class[11] = 2;
    piecemax[11] = 0+d*1+d*d*1;
    for( i = 0; i <= 1; i++ )for( j = 0; j <= 1; j++ )for( k = 0; k <= 1; k++ )
	p[12][i+d*(j+d*k)] = true;
    class[12] = 3;
    piecemax[12] = 1+d*1+d*d*1;
    piececount[0] = 13;
    piececount[1] = 3;
    piececount[2] = 1;
    piececount[3] = 1;
    m = 1+d*(1+d*1);
    kount = 0;
    if ( Fit(0, m) ) n = Place(0, m);
    else printf("Error1 in Puzzle\n");
    if ( ! Trial(n) ) printf ("Error2 in Puzzle.\n");
    else if ( kount != 2005 ) printf ( "Error3 in Puzzle.\n");
    };



    /* Sorts an array using quicksort */

    Initarr()
	{
	int i, temp;
	Initrand();
	biggest = 0; littlest = 0;
	for ( i = 1; i <= sortelements; i++ )
	    {
	    temp = Rand();
	    sortlist[i] = temp - (temp/100000)*100000 - 50000;
	    if ( sortlist[i] > biggest ) biggest = sortlist[i];
	    else if ( sortlist[i] < littlest ) littlest = sortlist[i];
	    };
	};

    Quicksort( a,l,r) int a[], l, r;
	/* quicksort the array A from start to finish */
	{
	int i,j,x,w;

	i=l; j=r;
	x=a[(l+r) / 2];
	do {
	    while ( a[i]<x ) i = i+1;
	    while ( x<a[j] ) j = j-1;
	    if ( i<=j ) {
		w = a[i];
		a[i] = a[j];
		a[j] = w;
		i = i+1;    j= j-1;
		}
	} while ( i<=j );
	if ( l <j ) Quicksort(a,l,j);
	if ( i<r ) Quicksort(a,i,r);
	};


Quick ()
    {
    Initarr();
    Quicksort(sortlist,1,sortelements);
    if ( (sortlist[1] != littlest) || (sortlist[sortelements] != biggest) )
	printf ( " Error in Quick.\n");
    };


    /* Sorts an array using treesort */

    tInitarr()
	{
	int i, temp;
	Initrand();
	biggest = 0; littlest = 0;
	for ( i = 1; i <= sortelements; i++ )
	    {
	    temp = Rand();
	    sortlist[i] = temp - (temp/100000)*100000 - 50000;
	    if ( sortlist[i] > biggest ) biggest = sortlist[i];
	    else if ( sortlist[i] < littlest ) littlest = sortlist[i];
	    };
	};

	CreateNode (t,n) struct node **t; int n;
	{
		*t = (struct node *)malloc(sizeof(struct node)); 
		(*t)->left = nil; (*t)->right = nil;
		(*t)->val = n;
	};

    Insert(n, t) int n; struct node *t;
	/* insert n into tree */
    {
	   if ( n > t->val ) 
		if ( t->left == nil ) CreateNode(&t->left,n);
		else Insert(n,t->left);
    	   else if ( n < t->val )
		if ( t->right == nil ) CreateNode(&t->right,n);
		else Insert(n,t->right);
    };

    int Checktree(p) struct node *p;
    /* check by inorder traversal */
    {
    int result;
        result = true;
		if ( p->left != nil ) 
		   if ( p->left->val <= p->val ) result=false;
		   else result = Checktree(p->left) && result;
		if ( p->right != nil )
		   if ( p->right->val >= p->val ) result = false;
		   else result = Checktree(p->right) && result;
	return( result);
    }; /* checktree */

Trees()
    {
    int i;
    tInitarr();
    tree = (struct node *)malloc(sizeof(struct node)); 
    tree->left = nil; tree->right=nil; tree->val=sortlist[1];
    for ( i = 2; i <= sortelements; i++ ) Insert(sortlist[i],tree);
    if ( ! Checktree(tree) ) printf ( " Error in Tree.\n");
    };


    /* Sorts an array using bubblesort */

    bInitarr()
	{
	int i, temp;
	Initrand();
	biggest = 0; littlest = 0;
	for ( i = 1; i <= srtelements; i++ )
	    {
	    temp = Rand();
	    sortlist[i] = temp - (temp/100000)*100000 - 50000;
	    if ( sortlist[i] > biggest ) biggest = sortlist[i];
	    else if ( sortlist[i] < littlest ) littlest = sortlist[i];
	    };
	};

Bubble()
    {
    int i, j;
    bInitarr();
    top=srtelements;

    while ( top>1 ) {

	i=1;
	while ( i<top ) {

	    if ( sortlist[i] > sortlist[i+1] ) {
		j = sortlist[i];
		sortlist[i] = sortlist[i+1];
		sortlist[i+1] = j;
		};
	    i=i+1;
	    };

	top=top-1;
	};
    if ( (sortlist[1] != littlest) || (sortlist[srtelements] != biggest) )
	printf ( "Error3 in Bubble.\n");
    };


float Cos (x) float x;
/* computes cos of x (x in radians) by an expansion */
{
int i, factor;
float    result,power;

   result = 1.0; factor = 1;  power = x;
   for ( i = 2; i <= 10; i++ ) {
      factor = factor * i;  power = power*x;
      if ( (i & 1) == 0 )  {
        if ( (i & 3) == 0 ) result = result + power/factor;
	else result = result - power/factor;
      };
   };
   return (result);
};

int Min0( arg1, arg2) int arg1, arg2;
    {
    if ( arg1 < arg2 )
	return (arg1);
    else
	return (arg2);
    };

Printcomplex(  arg1, arg2, zarray, start, finish, increment)
	int arg1, arg2, start, finish, increment;
	struct complex zarray[];
    {
    int i;
    printf("\n") ;

    i = start;
    do {
	printf("  %15.3e%15.3e",zarray[i].rp,zarray[i].ip) ;
	i = i + increment;
	printf("  %15.3e%15.3e",zarray[i].rp,zarray[i].ip) ;
	printf("\n");
	i = i + increment ;
    } while ( i <= finish );

    } ;

Uniform11(iy, yfl) int *iy; float *yfl;
    {
    *iy = (4855 * *iy + 1731) & 8191;
    *yfl = *iy/8192.0;
    } /* uniform */ ;

Exptab(n, e) int n; struct complex e[];

    { /* exptab */
    float theta, divisor, h[26];
    int i, j, k, l, m;

    theta = 3.1415926536;
    divisor = 4.0;
    for ( i=1; i <= 25; i++ )
	{
	h[i] = 1/(2*Cos( theta/divisor ));
	divisor = divisor + divisor;
	};

    m = n / 2 ;
    l = m / 2 ;
    j = 1 ;
    e[1].rp = 1.0 ;
    e[1].ip = 0.0;
    e[l+1].rp = 0.0;
    e[l+1].ip = 1.0 ;
    e[m+1].rp = -1.0 ;
    e[m+1].ip = 0.0 ;

    do {
	i = l / 2 ;
	k = i ;

	do {
	    e[k+1].rp = h[j]*(e[k+i+1].rp+e[k-i+1].rp) ;
	    e[k+1].ip = h[j]*(e[k+i+1].ip+e[k-i+1].ip) ;
	    k = k+l ;
	} while ( k <= m );

	j = Min0( j+1, 25);
	l = i ;
    } while ( l > 1 );

    } /* exptab */ ;

Fft( n, z, w, e, sqrinv)
    int n; struct complex z[], w[]; struct complex e[]; float sqrinv;
    {
    int i, j, k, l, m, index;
    m = n / 2 ;
    l = 1 ;

    do {
	k = 0 ;
	j = l ;
	i = 1 ;

	do {

	    do {
		w[i+k].rp = z[i].rp+z[m+i].rp ;
		w[i+k].ip = z[i].ip+z[m+i].ip ;
		w[i+j].rp = e[k+1].rp*(z[i].rp-z[i+m].rp)
		-e[k+1].ip*(z[i].ip-z[i+m].ip) ;
		w[i+j].ip = e[k+1].rp*(z[i].ip-z[i+m].ip)
		+e[k+1].ip*(z[i].rp-z[i+m].rp) ;
		i = i+1 ;
	    } while ( i <= j );

	    k = j ;
	    j = k+l ;
	} while ( j <= m );

	/*z = w ;*/ index = 1;
	do {
	    z[index] = w[index];
	    index = index+1;
	} while ( index <= n );
	l = l+l ;
    } while ( l <= m );

    for ( i = 1; i <= n; i++ )
	{
	z[i].rp = sqrinv*z[i].rp ;
	z[i].ip = -sqrinv*z[i].ip;
	} ;

    } ;

Oscar()
{ /* oscar */
int i;
Exptab(fftsize,e) ;
seed = 5767 ;
for ( i = 1; i <= fftsize; i++ )
    {
    Uniform11( &seed, &zr );
    Uniform11( &seed, &zi );
    z[i].rp = 20.0*zr - 10.0;
    z[i].ip = 20.0*zi - 10.0;
    } ;


for ( i = 1; i <= 20; i++ ) {
   Fft(fftsize,z,w,e,0.0625) ;
   /* Printcomplex( 6, 99, z, 1, 256, 17 ); */
};
} /* oscar */ ;

#ifdef undef
main (argc, argv)
    unsigned argc;
    char **argv;
{
/*  Bubble();*/
  double t;
  double xtimes[11];
  int i;
  double gm;
  extern double pow();

#define TIME(_i, _p) \
{ \
  t = Getclock(); \
  for (i = 10; i > 0; i -= 1) _p(); \
  xtimes[_i] = Getclock() - t; \
}

  TIME(1, Perm);
  TIME(2, Towers);
  TIME(3, Queens);
  TIME(4, Intmm);
  TIME(5, Puzzle);
  TIME(6, Quick); 
  TIME(7, Bubble);
  TIME(8, Trees); 
  TIME(9, Mm);
  TIME(10, Oscar); 

  for (i = 1; i <= 10; i += 1) xtimes[i] /= 10.0;

  fixed = 0.0;
  floated = 0.0;
  fixed = fixed + permbase*xtimes[1];
  floated = floated + permbase*xtimes[1];
  fixed = fixed + towersbase*xtimes[2];
  floated = floated + towersbase*xtimes[2];
  fixed = fixed + queensbase*xtimes[3];
  floated = floated + queensbase*xtimes[3];
  fixed = fixed + intmmbase*xtimes[4];
  floated = floated + intmmbase*xtimes[4];
  fixed = fixed + puzzlebase*xtimes[5];
  floated = floated + puzzlebase*xtimes[5];
  fixed = fixed + quickbase*xtimes[6];
  floated = floated + quickbase*xtimes[6];
  fixed = fixed + bubblebase*xtimes[7];
  floated = floated + bubblebase*xtimes[7];
  fixed = fixed + treebase*xtimes[8];
  floated = floated + treebase*xtimes[8];
  fixed = fixed + mmbase*xtimes[9];
  floated = floated + fpmmbase*xtimes[9];
  fixed = fixed + fftbase*xtimes[10];
  floated = floated + fpfftbase*xtimes[10];

  printf("    Perm  %7.3f\n", xtimes[1]);
  printf("  Towers  %7.3f\n", xtimes[2]);
  printf("  Queens  %7.3f\n", xtimes[3]);
  printf("   Intmm  %7.3f\n", xtimes[4]);
  printf("  Puzzle  %7.3f\n", xtimes[5]);
  printf("   Quick  %7.3f\n", xtimes[6]);
  printf("  Bubble  %7.3f\n", xtimes[7]);
  printf("    Tree  %7.3f\n", xtimes[8]);
  printf("      Mm  %7.3f\n", xtimes[9]);
  printf("     FFT  %7.3f\n", xtimes[10]);
  printf("\n");
  printf("Nonfloating point composite is %7.3f\n", fixed);
  printf("Floating point composite is    %7.3f\n", floated);

  gm = 1.0;
  for ( i = 1; i <= 8; i++ ) gm *= xtimes[i];
  printf("Nonfloating geometric mean is %7.3f\n", pow(gm, 1.0/8.0));
  gm = gm * xtimes[9] * xtimes[10];
  printf("Geometric mean is             %7.3f\n", pow(gm, 1.0/10.0));
}
#endif