Remove redundant code from C benchmark files

and rename files to java to make diff easier

Change-Id: I1544b2d199d2e331b37d5587c018e91711c8180f

1 files changed, 160 insertions, 0 deletions

diff --git a/benchmarks/stanford/Oscar.java b/benchmarks/stanford/Oscar.java
new file mode 100644
index 0000000..3c1f7f3
--- /dev/null
+++ b/benchmarks/stanford/Oscar.java
@@ -0,0 +1,160 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+    /* fft */
+#define fftsize 	 256
+#define fftsize2 	 129
+
+    /* FFT */
+struct    complex { float rp, ip; } ;
+struct complex    z[fftsize+1], w[fftsize+1], e[fftsize2+1];
+float    zr, zi;
+
+long    seed;  /* converted to long for 16 bit WR*/
+
+float Cos (float x) {
+/* computes cos of x (x in radians) by an expansion */
+int i, factor;
+float    result, power;
+
+   result = 1.0f;
+   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( int arg1, int arg2) {
+    if ( arg1 < arg2 ) 	return (arg1);
+    else  return (arg2);
+}
+
+void Printcomplex(struct complex zarray[], int start, int finish, int increment) {     /* removed unused arg1, arg2 arguments WR*/
+    int i;
+    printf("\n") ;
+
+    i = start;
+    do {
+		printf("  %15.3f%15.3f",zarray[i].rp,zarray[i].ip) ;
+		i = i + increment;
+		printf("  %15.3f%15.3f",zarray[i].rp,zarray[i].ip) ;
+		printf("\n");
+		i = i + increment ;
+    } while ( i <= finish );
+
+}
+
+void Uniform11(int *iy, float *yfl) {
+    *iy = (4855 * *iy + 1731) & 8191;
+    *yfl = *iy/8192.0f;
+} /* uniform */ 
+
+void Exptab(int n, struct complex e[]) { /* exptab */
+    float theta, divisor, h[26];
+    int i, j, k, l, m;
+
+    theta = 3.1415926536f;
+    divisor = 4.0f;
+    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.0f;
+    e[1].ip = 0.0f;
+    e[l+1].rp = 0.0f;
+    e[l+1].ip = 1.0f;
+    e[m+1].rp = -1.0f;
+    e[m+1].ip = 0.0f;
+
+    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 */
+
+void Fft( int n, struct complex z[], struct complex 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;
+	}
+
+}
+
+void Oscar() { /* oscar */
+	int i;
+	Exptab(fftsize,e) ;
+	seed = 5767 ;
+	for ( i = 1; i <= fftsize; i++ ) {
+		int s = seed;
+	    Uniform11( &s, &zr ); /* typecast seed for 16 bit WR*/
+		seed = s;
+	    Uniform11( &s, &zi ); /* typecast seed for 16 bit WR*/
+		seed = s;
+	    z[i].rp = 20.0f*zr - 10.0f;
+	    z[i].ip = 20.0f*zi - 10.0f;
+	}
+	for ( i = 1; i <= 20; i++ ) {
+	   Fft(fftsize,z,w,e,0.0625f) ;
+	}
+	    Printcomplex( z, 1, 256, 17 );   /* removed 1st 2 args 6, 99, unused by printcomplex WR*/
+} /* oscar */
+
+int main()
+{
+	int i;
+	for (i = 0; i < 10; i++) Oscar();
+	return 0;
+}