Skip to content

bench: refactor to use dynamic memory allocation in blas/base/ddot #8713

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

Merged
merged 9 commits into from
Dec 3, 2025
+12 −4
Merged

bench: refactor to use dynamic memory allocation in blas/base/ddot #8713

Changes from 8 commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
87bfa26
chore: fix JavaScript lint errors (issue #8508)
Nov 15, 2025
89624b3
bench: refactor to use dynamic memory allocation in blas/base/drot
Dec 2, 2025
c354cf2
bench: refactor to use dynamic memory allocation in blas/base/dcopy
Dec 2, 2025
faac90b
bench: refactor to use dynamic memory allocation in blas/base/ddot
Dec 2, 2025
1e62c58
chore: remove empty line
Planeshifter Dec 3, 2025
e8a8d95
Discard changes to lib/node_modules/@stdlib/blas/base/drot/benchmark/…
kgryte Dec 3, 2025
693939b
Discard changes to lib/node_modules/@stdlib/ndarray/base/assert/is-ro…
kgryte Dec 3, 2025
9607b3a
Discard changes to lib/node_modules/@stdlib/blas/base/dcopy/benchmark…
kgryte Dec 3, 2025
f8677a7
Apply suggestions from code review
kgryte Dec 3, 2025
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
18 changes: 14 additions & 4 deletions lib/node_modules/@stdlib/blas/base/ddot/benchmark/c/benchmark.length.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -96,12 +96,15 @@ static double rand_double( void ) {
*/
static double benchmark1( int iterations, int len ) {
double elapsed;
double x[ len ];
double y[ len ];
double *x;
double *y;
double z;
double t;
int i;

x = (double *) malloc( len * sizeof( double ) );
y = (double *) malloc( len * sizeof( double ) );

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

Expand All @@ -131,12 +136,15 @@ static double benchmark1( int iterations, int len ) {
*/
static double benchmark2( int iterations, int len ) {
double elapsed;
double x[ len ];
double y[ len ];
double *x;
double *y;
double z;
double t;
int i;

x = (double *) malloc( len * sizeof( double ) );
y = (double *) malloc( len * sizeof( double ) );

for ( i = 0; i < len; i++ ) {
x[ i ] = ( rand_double()*20000.0 ) - 10000.0;
y[ i ] = ( rand_double()*20000.0 ) - 10000.0;
Expand All @@ -154,6 +162,8 @@ static double benchmark2( int iterations, int len ) {
if ( z != z ) {
printf( "should not return NaN\n" );
}
free( x );
free( y );
return elapsed;
}

Expand Down