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

PR-URL: stdlib-js#8936
Ref: stdlib-js#8643
Ref: stdlib-js#369
Reviewed-by: Athan Reines <kgryte@gmail.com>

Author: opbot-xd

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

@@ -96,11 +96,12 @@ static double rand_double( void ) {
 */
 static double benchmark1( int iterations, int len ) {
 	double elapsed;
-	double x[ len ];
+	double *x;
 	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
@@ -121,6 +122,7 @@ static double benchmark1( int iterations, int len ) {
 	if ( v != v ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }
 
@@ -133,11 +135,12 @@ static double benchmark1( int iterations, int len ) {
 */
 static double benchmark2( int iterations, int len ) {
 	double elapsed;
-	double x[ len ];
+	double *x;
 	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
@@ -158,6 +161,7 @@ static double benchmark2( int iterations, int len ) {
 	if ( v != v ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }