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/bicg.c
// Author.............Cedric Nugteren
// Last modified on...03-April-2012
//

#include "common.h"

// This is 'bicg', a biconjugate gradients method kernel
int main(void) {
	int i,j;
	
	// Declare arrays on the stack
	float A[NX][NY];
	float p[NY];
	float q[NX];
	float r[NX];
	float s[NY];
	
	// Set the input data
	for (i=0; i<NY; i++) {
		p[i] = i*3.14159;
	}
	for (i=0; i<NX; i++) {
		r[i] = i*3.14159;
		for (j=0; j<NY; j++) {
			A[i][j] = ((float) i*(j+1)) / NX;
		}
	}
	
	// Perform the computation
	#pragma species kernel 0:NX-1|full ^ 0:NX-1,0:NY-1|chunk(0:NX-1,0:0) -> 0:NY-1|element
	for (j=0; j<NY; j++) {
		s[j] = 0;
		for (i=0; i<NX; i++) {
			s[j] = s[j] + r[i] * A[i][j];
		}
	}
	#pragma species endkernel bicg-part1
	#pragma species kernel 0:NX-1,0:NY-1|chunk(0:0,0:NY-1) ^ 0:NY-1|full -> 0:NX-1|element
	for (i=0; i<NX; i++) {
		q[i] = 0;
		for (j=0; j<NY; j++) {
			q[i] = q[i] + A[i][j] * p[j];
		}
	}
	#pragma species endkernel bicg-part2
	
	// Clean-up and exit the function
	fflush(stdout);
	return 0;
}

Version data entries

1 entries across 1 versions & 1 rubygems

Version	Path
bones-compiler-1.1.0	examples/benchmarks/bicg.c