From 46a02f7fe1c44d64f89f0eead7ea7c1f759832a6 Mon Sep 17 00:00:00 2001 From: Prajjwal Bajpai Date: Mon, 2 Mar 2026 19:39:43 +0530 Subject: [PATCH] bench: refactor to use dynamic memory allocation in `blas/ext/base/dlinspace` --- type: pre_commit_static_analysis_report description: Results of running static analysis checks when committing changes. report: - task: lint_filenames status: passed - task: lint_editorconfig status: passed - task: lint_markdown status: na - task: lint_package_json status: na - task: lint_repl_help status: na - task: lint_javascript_src status: na - task: lint_javascript_cli status: na - task: lint_javascript_examples status: na - task: lint_javascript_tests status: na - task: lint_javascript_benchmarks status: na - task: lint_python status: na - task: lint_r status: na - task: lint_c_src status: na - task: lint_c_examples status: na - task: lint_c_benchmarks status: missing_dependencies - task: lint_c_tests_fixtures status: na - task: lint_shell status: na - task: lint_typescript_declarations status: passed - task: lint_typescript_tests status: na - task: lint_license_headers status: passed --- --- .../ext/base/dlinspace/benchmark/c/benchmark.length.c | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/lib/node_modules/@stdlib/blas/ext/base/dlinspace/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/dlinspace/benchmark/c/benchmark.length.c index e4cee654d2e7..66f058d73c76 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/dlinspace/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/blas/ext/base/dlinspace/benchmark/c/benchmark.length.c @@ -97,10 +97,11 @@ static double rand_double( void ) { */ static double benchmark1( int iterations, int len ) { double elapsed; - double x[ len ]; + double *x; double t; int i; + x = (double *) malloc( len * sizeof( double ) ); for ( i = 0; i < len; i++ ) { x[ i ] = ( rand_double()*200.0 ) - 100.0; } @@ -116,6 +117,7 @@ static double benchmark1( int iterations, int len ) { if ( x[ 0 ] != x[ 0 ] ) { printf( "should not return NaN\n" ); } + free( x ); return elapsed; } @@ -128,10 +130,11 @@ static double benchmark1( int iterations, int len ) { */ static double benchmark2( int iterations, int len ) { double elapsed; - double x[ len ]; + double *x; double t; int i; + x = (double *) malloc( len * sizeof( double ) ); for ( i = 0; i < len; i++ ) { x[ i ] = ( rand_double()*200.0 ) - 100.0; } @@ -147,6 +150,7 @@ static double benchmark2( int iterations, int len ) { if ( x[ 0 ] != x[ 0 ] ) { printf( "should not return NaN\n" ); } + free( x ); return elapsed; }