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

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

Author: prajjwalbajpai

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

@@ -97,12 +97,13 @@ static double rand_double( void ) {
 */
 static double benchmark1( int iterations, int len ) {
 	double elapsed;
-	double x[ len ];
+	double *x;
 	CBLAS_INT n;
 	double v;
 	double t;
 	int i;
 
+	x = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		if ( rand_double() < 0.2 ) {
 			x[ i ] = 0.0 / 0.0; // NaN
@@ -125,6 +126,7 @@ static double benchmark1( int iterations, int len ) {
 	if ( v != v || n < 0 ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }
 
@@ -137,12 +139,13 @@ static double benchmark1( int iterations, int len ) {
 */
 static double benchmark2( int iterations, int len ) {
 	double elapsed;
-	double x[ len ];
+	double *x;
 	CBLAS_INT n;
 	double v;
 	double t;
 	int i;
 
+	x = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		if ( rand_double() < 0.2 ) {
 			x[ i ] = 0.0 / 0.0; // NaN
@@ -165,6 +168,7 @@ static double benchmark2( int iterations, int len ) {
 	if ( v != v || n < 0 ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }