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

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

Author: sujalcharati

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

@@ -97,11 +97,13 @@ static float rand_float( void ) {
 */
 static double benchmark1( int iterations, int len ) {
 	stdlib_complex64_t alpha;
-	float x[ len*2 ];
 	double elapsed;
 	double t;
+	float *x;
 	int i;
 
+	x = (float *) malloc( len * 2 * sizeof( float ) );
+
 	alpha = stdlib_complex64( 1.0f, 0.0f );
 	for ( i = 0; i < len*2; i += 2 ) {
 		x[ i ] = ( rand_float()*2.0f ) - 1.0f;
@@ -120,6 +122,7 @@ static double benchmark1( int iterations, int len ) {
 	if ( x[ 0 ] != x[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }
 
@@ -132,11 +135,13 @@ static double benchmark1( int iterations, int len ) {
 */
 static double benchmark2( int iterations, int len ) {
 	stdlib_complex64_t alpha;
-	float x[ len*2 ];
 	double elapsed;
 	double t;
+	float *x;
 	int i;
 
+	x = (float *) malloc( len * 2 * sizeof( float ) );
+
 	alpha = stdlib_complex64( 1.0f, 0.0f );
 	for ( i = 0; i < len*2; i += 2 ) {
 		x[ i ] = ( rand_float()*2.0f ) - 1.0f;
@@ -155,6 +160,7 @@ static double benchmark2( int iterations, int len ) {
 	if ( x[ 0 ] != x[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }