Sha256: 62425fc98351150d26993fe9a07cd8b23ccb0b3955ef9b3a9ecb486d706f362d

Contents?: true

Size: 1.49 KB

Versions: 2

Compression:

Stored size: 1.49 KB

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 <pouchet@cse.ohio-state.edu>
// Web address........http://polybench.sourceforge.net/
// 
// == More information on Bones
// Contact............Cedric Nugteren <c.nugteren@tue.nl>
// Web address........http://parse.ele.tue.nl/bones/
//
// == File information
// Filename...........benchmark/trisolv.c
// Author.............Cedric Nugteren
// Last modified on...03-Jul-2012
//

#include "common.h"

// This is 'trisolv', a solver for linear systems with triangular matrices
int main(void) {
	int i,j;
	float A_i_i;
	
	// Declare arrays on the stack
	float A[NX][NX];
	float c[NX];
	float x[NX];
	
	// Set the input data
	for (i=0; i<NX; i++) {
		c[i] = ((float) i) / NX;
		x[i] = ((float) i) / NX;
		for (j=0; j<NX; j++) {
			A[i][j] = ((float) i*j) / NX;
		}
	}
	
	// Perform the computation
	#pragma scop
	for (i=0; i<NX; i++) {
		x[i] = c[i];
		A_i_i = A[i][i];
		//#pragma species kernel i:i,0:i-1|element -> i:i|shared
		for (j=0; j<= i-1; j++) {
			x[i] = x[i] - A[i][j] * x[j];
			x[i] = x[i] / A_i_i;
		}
		//#pragma species endkernel trisolv
	}
	#pragma endscop
	
	// Clean-up and exit the function
	fflush(stdout);
	x[8] = x[8];
	return 0;
}

Version data entries

2 entries across 2 versions & 1 rubygems

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