bench: refactor to use dynamic memory allocation in blas/ext/base

PR-URL: #11695
Reviewed-by: Athan Reines <kgryte@gmail.com>
Ref: #8643

Author: udaykakade25

lib/node_modules/@stdlib/blas/ext/base/scusumkbn/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;
 }
 

lib/node_modules/@stdlib/blas/ext/base/scusumkbn2/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;
@@ -130,11 +132,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 +156,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;
 }
 

lib/node_modules/@stdlib/blas/ext/base/snancount/benchmark/c/benchmark.length.c

@@ -96,11 +96,12 @@ static float rand_float( void ) {
 */
 static double benchmark1( int iterations, int len ) {
 	double elapsed;
-	float x[ len ];
+	float *x;
 	double t;
 	int v;
 	int i;
 
+	x = (float *) malloc( len * sizeof( float ) );
 	for ( i = 0; i < len; i++ ) {
 		if ( rand_float() < 0.2f ) {
 			x[ i ] = 0.0f / 0.0f; // NaN
@@ -122,6 +123,7 @@ static double benchmark1( int iterations, int len ) {
 	if ( v < 0 ) {
 		printf( "should return a non-negative integer\n" );
 	}
+	free( x );
 	return elapsed;
 }
 
@@ -134,11 +136,12 @@ static double benchmark1( int iterations, int len ) {
 */
 static double benchmark2( int iterations, int len ) {
 	double elapsed;
-	float x[ len ];
+	float *x;
 	double t;
 	int v;
 	int i;
 
+	x = (float *) malloc( len * sizeof( float ) );
 	for ( i = 0; i < len; i++ ) {
 		if ( rand_float() < 0.2f ) {
 			x[ i ] = 0.0f / 0.0f; // NaN
@@ -160,6 +163,7 @@ static double benchmark2( int iterations, int len ) {
 	if ( v < 0 ) {
 		printf( "should return a non-negative integer\n" );
 	}
+	free( x );
 	return elapsed;
 }