Skip to content

chore: fix C lint errors (issue #6502) #6520

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
Closed

chore: fix C lint errors (issue #6502) #6520

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
44 changes: 32 additions & 12 deletions lib/node_modules/@stdlib/math/strided/special/dabs2/benchmark/c/benchmark.length.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -94,29 +94,49 @@ static double rand_double( void ) {
* @param len array length
* @return elapsed time in seconds
*/
static double benchmark( int iterations, int len ) {
static double benchmark(int iterations, int len) {
double elapsed;
double x[ len ];
double y[ len ];
double *x;
double *y;
double t;
int i;

for ( i = 0; i < len; i++ ) {
x[ i ] = ( rand_double()*200.0 ) - 100.0;
y[ i ] = 0.0;
// Allocate input array:
x = (double*) malloc(len * sizeof(double));
if (x == NULL) {
printf("Error allocating memory.\n");
exit(1);
}

// Allocate output array:
y = (double*) malloc(len * sizeof(double));
if (y == NULL) {
free(x);
printf("Error allocating memory.\n");
exit(1);
}

for (i = 0; i < len; i++) {
x[i] = (rand_double()*200.0) - 100.0;
y[i] = 0.0;
}
t = tic();
for ( i = 0; i < iterations; i++ ) {
stdlib_strided_dabs2( len, x, 1, y, 1 );
if ( y[ 0 ] != y[ 0 ] ) {
printf( "should not return NaN\n" );
for (i = 0; i < iterations; i++) {
stdlib_strided_dabs2(len, x, 1, y, 1);
if (y[0] != y[0]) {
printf("should not return NaN\n");
break;
}
}
elapsed = tic() - t;
if ( y[ 0 ] != y[ 0 ] ) {
printf( "should not return NaN\n" );
if (y[0] != y[0]) {
printf("should not return NaN\n");
}

// Free allocated memory:
free(x);
free(y);

return elapsed;
}

Expand Down
Loading