From ae35b126ee44efbddf03986f3b5b075268e3209d Mon Sep 17 00:00:00 2001
From: Prajjwal Bajpai <prajjwal8166@gmail.com>
Date: Sun, 22 Mar 2026 20:48:43 +0530
Subject: [PATCH] bench: refactor to use dynamic memory allocation in
 `blas/ext/base/scusum`

---
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: passed
  - 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
---
---
 .../base/scusum/benchmark/c/benchmark.length.c   | 16 ++++++++++++----
 1 file changed, 12 insertions(+), 4 deletions(-)

diff --git a/lib/node_modules/@stdlib/blas/ext/base/scusum/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/scusum/benchmark/c/benchmark.length.c
index 62ffb33c4416..9884aafa60b1 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/scusum/benchmark/c/benchmark.length.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/scusum/benchmark/c/benchmark.length.c
@@ -96,11 +96,13 @@ static float rand_float( void ) {
 */
 static double benchmark1( int iterations, int len ) {
 	double elapsed;
-	float x[ len ];
-	float y[ len ];
+	float *x;
+	float *y;
 	double t;
 	int i;
 
+	x = (float *) malloc( len * sizeof( float ) );
+	y = (float *) malloc( len * sizeof( float ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = ( rand_float() * 20000.0f ) - 10000.0f;
 		y[ i ] = 0.0f;
@@ -118,6 +120,8 @@ static double benchmark1( int iterations, int len ) {
 	if ( y[ len-1 ] != y[ len-1 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
+	free( y );
 	return elapsed;
 }
 
@@ -130,11 +134,13 @@ static double benchmark1( int iterations, int len ) {
 */
 static double benchmark2( int iterations, int len ) {
 	double elapsed;
-	float x[ len ];
-	float y[ len ];
+	float *x;
+	float *y;
 	double t;
 	int i;
 
+	x = (float *) malloc( len * sizeof( float ) );
+	y = (float *) malloc( len * sizeof( float ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = ( rand_float() * 20000.0f ) - 10000.0f;
 		y[ i ] = 0.0f;
@@ -152,6 +158,8 @@ static double benchmark2( int iterations, int len ) {
 	if ( y[ len-1 ] != y[ len-1 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
+	free( y );
 	return elapsed;
 }