Sha256: 4afd91484875fe0d0cff10e49bacc4dfeb3654bf90d75f8a876c7c954d52f412
Contents?: true
Size: 1.08 KB
Versions: 1
Compression:
Stored size: 1.08 KB
Contents
// // This file is part of the Bones source-to-source compiler examples. This C-code // example is meant to illustrate the use of Bones. For more information on Bones // use the contact information below. // // == More information on Bones // Contact............Cedric Nugteren <c.nugteren@tue.nl> // Web address........http://parse.ele.tue.nl/bones/ // // == File information // Filename...........element/example2.c // Author.............Cedric Nugteren // Last modified on...06-May-2013 // #include <stdio.h> // This is 'example2', demonstrating unordered element-wise computation int main(void) { int i,j; // Declare input/output arrays int A[4][8]; int B[4][8]; // Set the input data for(i=0;i<4;i++) { for(j=0;j<8;j++) { A[i][j] = i+j; } } // Perform the computation #pragma scop { #pragma species kernel A[0:3,0:7]|element -> B[0:3,0:7]|element for (i = 0; i < 4; i++) { for (j = 0; j < 8; j++) { B[i][j] = A[i][7 - j]; } } #pragma species endkernel example02_k1 } #pragma endscop // 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.3.1 | test/examples/element/example02_species.c |