Contents

//
// This file is part of the Bones source-to-source compiler examples. The C-code
// is largely identical in terms of functionality and variable naming to the code
// found in PolyBench/C version 3.2. For more information on PolyBench/C or Bones
// please use the contact information below.
//
// == More information on PolyBench/C
// Contact............Louis-Noel Pouchet <[e-mail]>
// Web address........http://polybench.sourceforge.net/
// 
// == More information on Bones
// Contact............Cedric Nugteren <[e-mail]>
// Web address........http://parse.ele.tue.nl/bones/
//
// == File information
// Filename...........benchmark/syr2k.c
// Author.............Cedric Nugteren
// Last modified on...03-April-2012
//

#include "common.h"

// This is 'syr2k', an algorithm for symmetric rank-2k operations
int main(void) {
	int i,j,k;
	
	// Declare arrays on the stack
	float A[NI][NJ];
	float B[NI][NJ];
	float C[NI][NI];
	
	// Set the constants
	int alpha = 32412;
	int beta = 2123;
	
	// Set the input data
	for (i=0; i<NI; i++) {
		for (j=0; j<NJ; j++) {
			A[i][j] = ((float) i*j) / NI;
			B[i][j] = ((float) i*j) / NI;
		}
	}
	for (i=0; i<NI; i++) {
		for (j=0; j<NI; j++) {
			C[i][j] = ((float) i*j) / NI;
		}
	}
	
	// Perform the computation (C := alpha*A*B' + alpha*B*A' + beta*C)
	#pragma scop
	{
		#pragma species kernel C[0:NI-1,0:NI-1]|element ^ A[0:NI-1,0:NJ-1]|chunk(0:0,0:NJ-1) ^ B[0:NI-1,0:NJ-1]|chunk(0:0,0:NJ-1) -> C[0:NI-1,0:NI-1]|element
		for (i = 0; i < NI; i++) {
			for (j = 0; j < NI; j++) {
				C[i][j] *= beta;
				for (k = 0; k < NJ; k++) {
					C[i][j] += alpha * A[i][k] * B[j][k];
					C[i][j] += alpha * B[i][k] * A[j][k];
				}
			}
		}
		#pragma species endkernel syr2k_k1
	}
	#pragma endscop
	
	// Clean-up and exit the function
	fflush(stdout);
	return 0;
}

Version data entries

2 entries across 2 versions & 1 rubygems

Version	Path
bones-compiler-1.6.0	test/examples/benchmarks/PolyBench/syr2k_species.c
bones-compiler-1.3.1	test/examples/benchmarks/PolyBench/syr2k_species.c