fix: c/benchmark

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: passed
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

---
type: pre_push_report
description: Results of running various checks prior to pushing changes.
report:
  - task: run_javascript_examples
    status: na
  - task: run_c_examples
    status: passed
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: passed
  - task: run_c_benchmarks
    status: passed
  - task: run_cpp_benchmarks
    status: na
  - task: run_fortran_benchmarks
    status: na
  - task: run_javascript_benchmarks
    status: passed
  - task: run_julia_benchmarks
    status: na
  - task: run_python_benchmarks
    status: na
  - task: run_r_benchmarks
    status: na
  - task: run_javascript_tests
    status: passed
---

Author: DhruvArvindSingh

lib/node_modules/@stdlib/blas/base/srotg/benchmark/c/Makefile

@@ -1,7 +1,7 @@
 #/
 # @license Apache-2.0
 #
-# Copyright (c) 2025 The Stdlib Authors.
+# Copyright (c) 2024 The Stdlib Authors.
 #
 # Licensed under the Apache License, Version 2.0 (the "License");
 # you may not use this file except in compliance with the License.
@@ -82,7 +82,7 @@ LIBRARIES ?=
 LIBPATH ?=
 
 # List of C targets:
-c_targets := benchmark.out
+c_targets := benchmark.length.out
 
 
 # RULES #

lib/node_modules/@stdlib/blas/base/srotg/benchmark/c/benchmark.length.c

@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2025 The Stdlib Authors.
+* Copyright (c) 2024 The Stdlib Authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
@@ -17,17 +17,17 @@
 */
 
 #include "stdlib/blas/base/srotg.h"
-#include "stdlib/math/base/assert/is_nan.h"
-#include "stdlib/constants/float64/eps.h"
 #include <stdlib.h>
 #include <stdio.h>
 #include <math.h>
 #include <time.h>
 #include <sys/time.h>
 
 #define NAME "srotg"
-#define ITERATIONS 1000000
+#define ITERATIONS 10000000
 #define REPEATS 3
+#define MIN 1
+#define MAX 6
 
 /**
 * Prints the TAP version.
@@ -39,7 +39,7 @@ static void print_version( void ) {
 /**
 * Prints the TAP summary.
 *
-* @param total	 total number of tests
+* @param total     total number of tests
 * @param passing   total number of passing tests
 */
 static void print_summary( int total, int passing ) {
@@ -54,12 +54,13 @@ static void print_summary( int total, int passing ) {
 /**
 * Prints benchmarks results.
 *
-* @param elapsed   elapsed time in seconds
+* @param iterations   number of iterations
+* @param elapsed      elapsed time in seconds
 */
-static void print_results( double elapsed ) {
-	double rate = (double)ITERATIONS / elapsed;
+static void print_results( int iterations, double elapsed ) {
+	double rate = (double)iterations / elapsed;
 	printf( "  ---\n" );
-	printf( "  iterations: %d\n", ITERATIONS );
+	printf( "  iterations: %d\n", iterations );
 	printf( "  elapsed: %0.9f\n", elapsed );
 	printf( "  rate: %0.9f\n", rate );
 	printf( "  ...\n" );
@@ -77,46 +78,45 @@ static double tic( void ) {
 }
 
 /**
-* Generates a random number on the interval [min,max).
+* Generates a random number on the interval [0,1).
 *
-* @param min	minimum value (inclusive)
-* @param max	maximum value (exclusive)
-* @return	   random number
+* @return random number
 */
-static double random_uniform( const double min, const double max ) {
-	double v = (double)rand() / ( (double)RAND_MAX + 1.0 );
-	return min + ( v*(max-min) );
+static float rand_float( void ) {
+	int r = rand();
+	return (float)r / ( (float)RAND_MAX + 1.0 );
 }
 
 /**
 * Runs a benchmark.
 *
-* @return elapsed time in seconds
+* @param iterations   number of iterations
+* @param len          array length
+* @return             elapsed time in seconds
 */
-static double benchmark1( void ) {
+static double benchmark1( int iterations, int len ) {
 	double elapsed;
-	float a[ 100 ];
-	float b[ 100 ];
-	float Out[ 4 ];
+	float a[ len ];
+	float b[ len ];
+	float Out[4];
 	double t;
 	int i;
 
-	for ( i = 0; i < 100; i++ ) {
-		a[ i ] = random_uniform( 0.0, 100.0 );
-		b[ i ] = random_uniform( 0.0, 100.0 ) - 50.0;
+	for ( i = 0; i < len; i++ ) {
+		a[ i ] = ( rand_float()*200.0f ) - 100.0f;
+		b[ i ] = ( rand_float()*200.0f ) - 100.0f;
 	}
 
 	t = tic();
-	for ( i = 0; i < ITERATIONS; i++ ) {
-		// cppcheck-suppress uninitvar
-		c_srotg( a[ i % 100 ], b[ i % 100 ], Out, 1 );
-		if ( stdlib_base_is_nan( Out[0] ) || stdlib_base_is_nan( Out[1] ) || stdlib_base_is_nan( Out[2] ) || stdlib_base_is_nan( Out[3] ) ) {
+	for ( i = 0; i < iterations; i++ ) {
+		c_srotg( a[i % len ], b[i % len ], Out, 1 );
+		if ( Out[ 0 ] != Out[ 0 ] ) {
 			printf( "should not return NaN\n" );
 			break;
 		}
 	}
 	elapsed = tic() - t;
-	if ( stdlib_base_is_nan( Out[0] ) || stdlib_base_is_nan( Out[1] ) || stdlib_base_is_nan( Out[2] ) || stdlib_base_is_nan( Out[3] ) ) {
+	if ( Out[ 0 ] != Out[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
 	return elapsed;
@@ -125,32 +125,33 @@ static double benchmark1( void ) {
 /**
 * Runs a benchmark.
 *
-* @return elapsed time in seconds
+* @param iterations   number of iterations
+* @param len          array length
+* @return             elapsed time in seconds
 */
-static double benchmark2( void ) {
+static double benchmark2( int iterations, int len ) {
 	double elapsed;
-	float a[ 100 ];
-	float b[ 100 ];
-	float Out[ 4 ];
+	float a[ len ];
+	float b[ len ];
+	float Out[4];
 	double t;
 	int i;
 
-	for ( i = 0; i < 100; i++ ) {
-		a[ i ] = random_uniform( 0.0, 100.0 );
-		b[ i ] = random_uniform( 0.0, 100.0 ) - 50.0;
+	for ( i = 0; i < len; i++ ) {
+		a[ i ] = ( rand_float()*200.0f ) - 100.0f;
+		b[ i ] = ( rand_float()*200.0f ) - 100.0f;
 	}
 
 	t = tic();
-	for ( i = 0; i < ITERATIONS; i++ ) {
-		// cppcheck-suppress uninitvar
-		c_srotg_assign( a[ i % 100 ], b[ i % 100 ], Out, 1, 0 );
-		if ( stdlib_base_is_nan( Out[0] ) || stdlib_base_is_nan( Out[1] ) || stdlib_base_is_nan( Out[2] ) || stdlib_base_is_nan( Out[3] ) ) {
+	for ( i = 0; i < iterations; i++ ) {
+		c_srotg_assign( a[i % len ], b[i % len ], Out, 1, 0 );
+		if ( Out[ 0 ] != Out[ 0 ] ) {
 			printf( "should not return NaN\n" );
 			break;
 		}
 	}
 	elapsed = tic() - t;
-	if ( stdlib_base_is_nan( Out[0] ) || stdlib_base_is_nan( Out[1] ) || stdlib_base_is_nan( Out[2] ) || stdlib_base_is_nan( Out[3] ) ) {
+	if ( Out[ 0 ] != Out[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
 	return elapsed;
@@ -166,8 +167,10 @@ int main( void ) {
 	int len;
 	int i;
 	int j;
+
 	// Use the current time to seed the random number generator:
 	srand( time( NULL ) );
+
 	print_version();
 	count = 0;
 	for ( i = MIN; i <= MAX; i++ ) {
@@ -180,10 +183,6 @@ int main( void ) {
 			print_results( iter, elapsed );
 			printf( "ok %d benchmark finished\n", count );
 		}
-	}
-	for ( i = MIN; i <= MAX; i++ ) {
-		len = pow( 10, i );
-		iter = ITERATIONS / pow( 10, i-1 );
 		for ( j = 0; j < REPEATS; j++ ) {
 			count += 1;
 			printf( "# c::%s:ndarray:len=%d\n", NAME, len );