--- /dev/null
+#include "Matrix_init.h"
+#include <math.h>
+#include "xbt/log.h"
+ XBT_LOG_NEW_DEFAULT_CATEGORY(MM_init,
+ "Messages specific for this msg example");
+#define _unused(x) ((void)x)
+
+
+void matrices_initialisation( double ** p_a, double ** p_b, double ** p_c,
+ size_t m, size_t k_a, size_t k_b, size_t n,
+ size_t row, size_t col)
+{
+
+ size_t x,y,z;
+ size_t lda = k_a;
+ size_t ldb = n;
+ size_t ldc = n;
+ double *a, *b, *c;
+ _unused(row);
+
+ a = malloc(sizeof(double) * m * k_a);
+
+ if ( a == 0 ){
+ perror("Error allocation Matrix A");
+ exit(-1);
+ }
+
+ b = malloc(sizeof(double) * k_b * n);
+
+ if ( b == 0 ){
+ perror("Error allocation Matrix B");
+ exit(-1);
+ }
+
+ c = malloc(sizeof(double) * m * n);
+ if ( c == 0 ){
+ perror("Error allocation Matrix C");
+ exit(-1);
+ }
+
+ *p_a=a;
+ *p_b =b;
+ *p_c=c;
+
+ // size_tialisation of the matrices
+ for( x=0; x<m; x++){
+ for( z=0; z<k_a; z++){
+#ifdef SIMPLE_MATRIX
+ a[x*lda+z] = 1;
+#else
+ a[x*lda+z] = (double)(z+col*n);
+#endif
+ }
+ }
+ for( z=0; z<k_b; z++){
+ for( y=0; y<n; y++){
+#ifdef SIMPLE_MATRIX
+ b[z*ldb+y] = 1;
+#else
+ b[z*ldb+y] = (double)(y);
+#endif
+ }
+ }
+ for( x=0; x<m; x++){
+ for( y=0; y<n; y++){
+ c[x*ldc+y] = 0;
+ }
+ }
+}
+
+void matrices_allocation( double ** p_a, double ** p_b, double ** p_c,
+ size_t m, size_t k_a, size_t k_b, size_t n)
+{
+
+ double * a, *b, *c;
+
+ a = malloc(sizeof(double) * m * k_a);
+
+ if ( a == 0 ){
+ perror("Error allocation Matrix A");
+ exit(-1);
+ }
+
+ b = malloc(sizeof(double) * k_b * n);
+
+ if ( b == 0 ){
+ perror("Error allocation Matrix B");
+ exit(-1);
+ }
+
+ c = malloc(sizeof(double) * m * n);
+ if ( c == 0 ){
+ perror("Error allocation Matrix C");
+ exit(-1);
+ }
+
+ *p_a=a;
+ *p_b =b;
+ *p_c=c;
+
+}
+
+void blocks_initialisation( double ** p_a_local, double ** p_b_local,
+ size_t m, size_t B_k, size_t n)
+{
+ size_t x,y,z;
+ size_t lda = B_k;
+ size_t ldb = n;
+ double * a_local, *b_local;
+
+ a_local = malloc(sizeof(double) * m * B_k);
+
+ if ( a_local == 0 ){
+ perror("Error allocation Matrix A");
+ exit(-1);
+ }
+
+ b_local = malloc(sizeof(double) * B_k * n);
+
+ if ( b_local == 0 ){
+ perror("Error allocation Matrix B");
+ exit(-1);
+ }
+
+ *p_a_local = a_local;
+ *p_b_local = b_local;
+
+ // size_tialisation of the matrices
+ for( x=0; x<m; x++){
+ for( z=0; z<B_k; z++){
+ a_local[x*lda+z] = 0.0;
+ }
+ }
+ for( z=0; z<B_k; z++){
+ for( y=0; y<n; y++){
+ b_local[z*ldb+y] = 0.0;
+ }
+ }
+}
+
+void check_result(double *c, double *a, double *b,
+ size_t m, size_t n, size_t k_a, size_t k_b,
+ size_t row, size_t col,
+ size_t size_row, size_t size_col)
+{
+ size_t x,y;
+ size_t ldc = n;
+ _unused(a);
+ _unused(b);
+ _unused(k_b);
+ _unused(k_a);
+ _unused(row);
+ _unused(col);
+ _unused(size_row);
+ /* these variable could be use to check the result in function of the
+ * matrix initialization */
+
+
+ /*Display for checking */
+#ifdef SIMPLE_MATRIX
+ XBT_INFO("Value get : %f excepted %zu multiply by y\n", c[((int)m/2)*ldc+1],size_row*k_a );
+#else
+ XBT_INFO("Value get : %f excepted %zu multiply by y\n", c[((int)m/2)*ldc+1], 1*(size_col*m)*((size_col*m)-1)/2) ;
+#endif
+ for( x=0; x<m; x++){
+ for( y=0; y<n; y++){
+ /* WARNING this could be lead to some errors ( precision with double )*/
+#ifdef SIMPLE_MATRIX
+ if ( fabs(c[x*ldc + y] - size_row*k_a) > 0.0000001)
+#else
+ if ( fabs(c[x*ldc + y] - y*(size_col*m)*((size_col*m)-1)/2) > 0.0000001)
+#endif
+ {
+#ifdef SIMPLE_MATRIX
+ XBT_INFO( "%f\t%zu, y : %zu x : %zu \n",
+ c[x*ldc+y], size_row*k_a, y, x);
+#else
+ XBT_INFO( "%f\t%zu, y : %zu x : %zu \n",
+ c[x*ldc+y], y*(size_col*m)*((size_col*m)-1)/2, y, x);
+#endif
+ goto error_exit;
+ }
+ }
+ }
+ XBT_INFO("result check: ok\n");
+ return;
+error_exit:
+ XBT_INFO("result check not ok\n"
+ "WARNING the test could be lead to some "
+ "errors ( precision with double )\n");
+ return;
+}
+
+
