diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskabs/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskabs/benchmark/c/benchmark.length.c index 0a5e7bb79021..0a87305d5cf5 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskabs/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskabs2/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskabs2/benchmark/c/benchmark.length.c index e3c3c385c791..b29532bddd95 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskabs2/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskcbrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskcbrt/benchmark/c/benchmark.length.c index eb5068891bf1..c1c410566611 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskcbrt/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskceil/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskceil/benchmark/c/benchmark.length.c index 90b0cdb06d97..aa857d6cb457 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskceil/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskdeg2rad/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskdeg2rad/benchmark/c/benchmark.length.c index 86625aea24d9..140e2c9ba949 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskdeg2rad/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskfloor/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskfloor/benchmark/c/benchmark.length.c index 2191c1a339b9..7106319251c7 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskfloor/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskinv/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskinv/benchmark/c/benchmark.length.c index 0189276b8454..dd81ce9d3453 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskinv/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmskramp/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmskramp/benchmark/c/benchmark.length.c index 23dbbf9ef10a..edb3632b8f10 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmskramp/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/dmsksqrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/dmsksqrt/benchmark/c/benchmark.length.c index 54f3b6a0f833..281b68c24f87 100644 --- a/lib/node_modules/@stdlib/math/strided/special/dmsksqrt/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sabs/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sabs/benchmark/c/benchmark.length.c index 59b3d8c9839d..5c2c82c46158 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sabs/benchmark/c/benchmark.length.c +++ b/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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sabs2/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sabs2/benchmark/c/benchmark.length.c index 83ee92328da2..150c83fb5f06 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sabs2/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/sabs2/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; @@ -118,6 +120,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/scbrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/scbrt/benchmark/c/benchmark.length.c index 137d6e422617..b0da6b900a59 100644 --- a/lib/node_modules/@stdlib/math/strided/special/scbrt/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/scbrt/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( -100.0f, 100.0f ); y[ i ] = 0.0f; @@ -135,6 +137,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sceil/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sceil/benchmark/c/benchmark.length.c index 8ba752f79e9d..cb79d107c207 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sceil/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/sceil/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -135,6 +137,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sdeg2rad/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sdeg2rad/benchmark/c/benchmark.length.c index 69e96f2ecde3..9e0d73540a9c 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sdeg2rad/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/sdeg2rad/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( -180.0f, 180.0f ); y[ i ] = 0.0f; @@ -136,6 +138,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sfloor/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sfloor/benchmark/c/benchmark.length.c index f5ee56e3c352..a39564d73d18 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sfloor/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/sfloor/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -135,6 +137,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sinv/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sinv/benchmark/c/benchmark.length.c index d5f9086af250..52e3555ad0bd 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sinv/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/sinv/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( -50.0f, 50.0f ); y[ i ] = 0.0f; @@ -136,6 +138,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskabs/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskabs/benchmark/c/benchmark.length.c index 294b59a0d5ea..7650265f6245 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskabs/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskabs/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -100.0f, 100.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskabs2/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskabs2/benchmark/c/benchmark.length.c index ae1fd64b7060..a4388015ece4 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskabs2/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskabs2/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -100.0f, 100.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskcbrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskcbrt/benchmark/c/benchmark.length.c index cbd2caa0d23e..0b321bc1e306 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskcbrt/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskcbrt/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -100.0f, 100.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskceil/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskceil/benchmark/c/benchmark.length.c index 4d183cbddc6e..3678608d038e 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskceil/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskceil/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskfloor/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskfloor/benchmark/c/benchmark.length.c index d41819de930d..142ec00e418d 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskfloor/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskfloor/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskinv/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskinv/benchmark/c/benchmark.length.c index 2a6690bc5ad0..9c883984f112 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskinv/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskinv/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -50.0f, 50.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskramp/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskramp/benchmark/c/benchmark.length.c index 4e6fd36c4b08..34050a47c085 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskramp/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskramp/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smskrsqrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smskrsqrt/benchmark/c/benchmark.length.c index 9f42f8b2116e..cb7d77bb3292 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smskrsqrt/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smskrsqrt/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( 0.0f, 200.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smsksqrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smsksqrt/benchmark/c/benchmark.length.c index 7ebf71f285d8..e17781445b27 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smsksqrt/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smsksqrt/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( 0.0f, 200.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/smsktrunc/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/smsktrunc/benchmark/c/benchmark.length.c index 62a6d4e10f34..f55d6fc257ae 100644 --- a/lib/node_modules/@stdlib/math/strided/special/smsktrunc/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/smsktrunc/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 ]; - float x[ len ]; - float y[ len ]; + uint8_t *m; + float *x; + float *y; double t; int i; + m = (uint8_t *) malloc( len * sizeof( uint8_t ) ); + x = (float *) malloc( len * sizeof( float ) ); + y = (float *) malloc( len * sizeof( float ) ); for ( i = 0; i < len; i++ ) { x[ i ] = rand_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/sramp/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/sramp/benchmark/c/benchmark.length.c index 8a74b4d57106..6a98a8b16f4a 100644 --- a/lib/node_modules/@stdlib/math/strided/special/sramp/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/sramp/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( -10.0f, 10.0f ); y[ i ] = 0.0f; @@ -136,6 +138,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/srsqrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/srsqrt/benchmark/c/benchmark.length.c index 2a2ab594e90b..6f840bc348cd 100644 --- a/lib/node_modules/@stdlib/math/strided/special/srsqrt/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/srsqrt/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( 0.0f, 200.0f ); y[ i ] = 0.0f; @@ -136,6 +138,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; } diff --git a/lib/node_modules/@stdlib/math/strided/special/ssqrt/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/math/strided/special/ssqrt/benchmark/c/benchmark.length.c index 83654bcaaee4..193f6d18846e 100644 --- a/lib/node_modules/@stdlib/math/strided/special/ssqrt/benchmark/c/benchmark.length.c +++ b/lib/node_modules/@stdlib/math/strided/special/ssqrt/benchmark/c/benchmark.length.c @@ -114,11 +114,13 @@ float rand_uniformf( float a, float b ) { */ 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_uniformf( 0.0f, 200.0f ); y[ i ] = 0.0f; @@ -135,6 +137,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; }