bench: refactor to use dynamic memory allocation in maths/strided/special

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

Author: udaykakade25

lib/node_modules/@stdlib/math/strided/special/dmskabs/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -100.0, 100.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskabs2/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -100.0, 100.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskcbrt/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -100.0, 100.0 );
 		y[ i ] = 0.0;
@@ -139,6 +142,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskceil/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -10.0, 10.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskdeg2rad/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -180.0, 180.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskfloor/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -10.0, 10.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskinv/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -50.0, 50.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmskramp/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -10.0, 10.0 );
 		y[ i ] = 0.0;
@@ -139,6 +142,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/dmsksqrt/benchmark/c/benchmark.length.c

@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	uint8_t m[ len ];
-	double x[ len ];
-	double y[ len ];
+	uint8_t *m;
+	double *x;
+	double *y;
 	double t;
 	int i;
 
+	m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
+	x = (double *) malloc( len * sizeof( double ) );
+	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( 0.0, 200.0 );
 		y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( m );
+	free( x );
+	free( y );
 	return elapsed;
 }
 

lib/node_modules/@stdlib/math/strided/special/sabs/benchmark/c/benchmark.length.c

@@ -96,11 +96,13 @@ static float rand_float( void ) {
 */
 static double benchmark( 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()*200.0f ) - 100.0f;
 		y[ i ] = 0.0f;
@@ -117,6 +119,8 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
+	free( y );
 	return elapsed;
 }