Mentions légales du service

Skip to content
Snippets Groups Projects
Commit cf114251 authored by Mathieu Faverge's avatar Mathieu Faverge
Browse files

Remove paste_code_allocate_matrix from step examples to simplify them and...

Remove paste_code_allocate_matrix from step examples to simplify them and remove the bug in sonarqube about the matrix free not done
parent 5ea33ef2
No related branches found
No related tags found
1 merge request!87Sonarqube /hotfix
......@@ -71,9 +71,10 @@ int main(int argc, char *argv[]) {
* - set of RHS vectors B : size N x NRHS
* - set of solutions vectors X : size N x NRHS
*/
PASTE_CODE_ALLOCATE_MATRIX( A, double, N, N );
PASTE_CODE_ALLOCATE_MATRIX( B, double, N, NRHS );
PASTE_CODE_ALLOCATE_MATRIX( X, double, N, NRHS );
double *A = malloc( N * N * sizeof(double) );
double *Acpy = malloc( N * N * sizeof(double) );
double *B = malloc( N * NRHS * sizeof(double) );
double *X = malloc( N * NRHS * sizeof(double) );
/* generate A matrix with random values such that it is spd */
CORE_dplgsy( (double)N, N, N, A, N, N, N, N, 51 );
......@@ -82,8 +83,7 @@ int main(int argc, char *argv[]) {
CORE_dplrnt( N, NRHS, B, N, N, N, NRHS, 5673 );
/* copy A before facto. in order to check the result */
PASTE_CODE_ALLOCATE_MATRIX( Acpy, double, N, N );
memcpy(Acpy, A, N*N*sizeof(double));
memcpy(Acpy, A, N * N * sizeof(double));
/* copy B in X before solving */
memcpy(X, B, N*NRHS*sizeof(double));
......
......@@ -120,15 +120,4 @@ static void print_header(char *prog_name, int * iparam) {
return;
}
/**
* Macro to allocate a matrix as a 1D array
*/
#define PASTE_CODE_ALLOCATE_MATRIX(_name_, _type_, _m_, _n_) \
_type_ *_name_ = NULL; \
_name_ = (_type_*)malloc( (_m_) * (_n_) * sizeof(_type_) ); \
if ( ! _name_ ) { \
fprintf(stderr, "Out of Memory for %s\n", #_name_); \
return -1; \
}
#endif /* STEP0_H */
......@@ -93,10 +93,10 @@ int main(int argc, char *argv[]) {
* - set of RHS vectors B : size N x NRHS
* - set of solutions vectors X : size N x NRHS
*/
PASTE_CODE_ALLOCATE_MATRIX( A, double, N, N );
PASTE_CODE_ALLOCATE_MATRIX( B, double, N, NRHS );
PASTE_CODE_ALLOCATE_MATRIX( X, double, N, NRHS );
PASTE_CODE_ALLOCATE_MATRIX( Acpy, double, N, N );
double *A = malloc( N * N * sizeof(double) );
double *Acpy = malloc( N * N * sizeof(double) );
double *B = malloc( N * NRHS * sizeof(double) );
double *X = malloc( N * NRHS * sizeof(double) );
/* generate A matrix with random values such that it is spd */
MORSE_dplgsy( (double)N, MorseUpperLower, N, A, N, 51 );
......
......@@ -119,15 +119,4 @@ static void print_header(char *prog_name, int * iparam) {
return;
}
/**
* Macro to allocate a matrix as a 1D array
*/
#define PASTE_CODE_ALLOCATE_MATRIX(_name_, _type_, _m_, _n_) \
_type_ *_name_ = NULL; \
_name_ = (_type_*)malloc( (_m_) * (_n_) * sizeof(_type_) ); \
if ( ! _name_ ) { \
fprintf(stderr, "Out of Memory for %s\n", #_name_); \
return -1; \
}
#endif /* STEP1_H */
......@@ -91,10 +91,10 @@ int main(int argc, char *argv[]) {
* - set of RHS vectors B : size N x NRHS
* - set of solutions vectors X : size N x NRHS
*/
PASTE_CODE_ALLOCATE_MATRIX( A, double, N, N );
PASTE_CODE_ALLOCATE_MATRIX( B, double, N, NRHS );
PASTE_CODE_ALLOCATE_MATRIX( X, double, N, NRHS );
PASTE_CODE_ALLOCATE_MATRIX( Acpy, double, N, N );
double *A = malloc( N * N * sizeof(double) );
double *Acpy = malloc( N * N * sizeof(double) );
double *B = malloc( N * NRHS * sizeof(double) );
double *X = malloc( N * NRHS * sizeof(double) );
/*
* Initialize the structure required for MORSE tile interface
......
......@@ -119,15 +119,4 @@ static void print_header(char *prog_name, int * iparam) {
return;
}
/**
* Macro to allocate a matrix as a 1D array
*/
#define PASTE_CODE_ALLOCATE_MATRIX(_name_, _type_, _m_, _n_) \
_type_ *_name_ = NULL; \
_name_ = (_type_*)malloc( (_m_) * (_n_) * sizeof(_type_) ); \
if ( ! _name_ ) { \
fprintf(stderr, "Out of Memory for %s\n", #_name_); \
return -1; \
}
#endif /* STEP2_H */
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment