Sha256: 160c243e0aa4ee0ca3ca0b6d951b197d40e27dd44b94a1ccb97ebf086d0fca51

Contents?: true

Size: 1.51 KB

Versions: 2

Compression:

Stored size: 1.51 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/trmm.c
// Author.............Cedric Nugteren
// Last modified on...26-Jun-2012
//

#include "common.h"

// This is 'trmm', a triangular matrix multiplication kernel
int main(void) {
	int i,j,k;
	
	// Declare arrays on the stack
	float A[NI][NI];
	float B[NI][NI];
	
	// Set the constants
	int alpha = 32412;
	
	// Set the input data
	for (i=0; i<NI; i++) {
		for (j=0; j<NI; j++) {
			A[i][j] = ((float) i*j) / NI;
			B[i][j] = ((float) i*j) / NI;
		}
	}
	
	// Perform the computation (B := alpha*A'*B, with A triangular)
	#pragma scop
	for (i=1; i<NI; i++) {
		for (j=0; j<NI; j++) {
			#pragma species kernel i:i,0:i-1|element ^ j:j,0:i-1|element -> i:i,j:j|shared
			for (k=0; k<i; k++) {
				B[i][j] += alpha * A[i][k] * B[j][k];
			}
			#pragma species endkernel trmm
		}
	}
	#pragma endscop
	
	// Clean-up and exit the function
	fflush(stdout);
	B[8][9] = B[8][9];
	return 0;
}

Version data entries

2 entries across 2 versions & 1 rubygems

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