Skip to content

chore: fix C lint errors (issue #8443) #8445

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
+16 −11
Closed

chore: fix C lint errors (issue #8443) #8445

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 16 additions & 11 deletions lib/node_modules/@stdlib/blas/base/dasum/benchmark/c/benchmark.length.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,12 +16,12 @@
* limitations under the License.
*/

#include <sys/time.h>
#include "stdlib/blas/base/dasum.h"
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>

#define NAME "dasum"
#define ITERATIONS 10000000
Expand Down Expand Up @@ -74,7 +74,7 @@ static void print_results( int iterations, double elapsed ) {
static double tic( void ) {
struct timeval now;
gettimeofday( &now, NULL );
return (double)now.tv_sec + (double)now.tv_usec/1.0e6;
return (double)now.tv_sec + (double)now.tv_usec / 1.0e6;
}

/**
Expand All @@ -96,13 +96,14 @@ static double rand_double( void ) {
*/
static double benchmark1( int iterations, int len ) {
double elapsed;
double x[ len ];
double *x;
x = (double *)malloc( len * sizeof( double ) );
double y;
double t;
int i;

for ( i = 0; i < len; i++ ) {
x[ i ] = ( rand_double()*20000.0 ) - 10000.0;
x[ i ] = ( rand_double() * 20000.0 ) - 10000.0;
}
y = 0.0;
t = tic();
Expand All @@ -117,6 +118,7 @@ static double benchmark1( int iterations, int len ) {
if ( y != y ) {
printf( "should not return NaN\n" );
}
free(x);
return elapsed;
}

Expand All @@ -129,19 +131,20 @@ static double benchmark1( int iterations, int len ) {
*/
static double benchmark2( int iterations, int len ) {
double elapsed;
double x[ len ];
double *x;
x = (double *)malloc( len * sizeof( double ) );
double y;
double t;
int i;

for ( i = 0; i < len; i++ ) {
x[ i ] = ( rand_double()*20000.0 ) - 10000.0;
x[ i ] = ( rand_double() * 20000.0 ) - 10000.0;
}
y = 0.0;
t = tic();
for ( i = 0; i < iterations; i++ ) {
y = c_dasum_ndarray( len, x, 1, 0 );
if ( y != y ) {
y = c_dasum_ndarray( len, x, 1, 0 );
if ( y != y ) {
printf( "should not return NaN\n" );
break;
}
Expand All @@ -150,6 +153,7 @@ static double benchmark2( int iterations, int len ) {
if ( y != y ) {
printf( "should not return NaN\n" );
}
free(x);
return elapsed;
}

Expand All @@ -171,7 +175,7 @@ int main( void ) {
count = 0;
for ( i = MIN; i <= MAX; i++ ) {
len = pow( 10, i );
iter = ITERATIONS / pow( 10, i-1 );
iter = ITERATIONS / pow( 10, i - 1 );
for ( j = 0; j < REPEATS; j++ ) {
count += 1;
printf( "# c::%s:len=%d\n", NAME, len );
Expand All @@ -188,4 +192,5 @@ int main( void ) {
}
}
print_summary( count, count );

}