floraachy
/
OpenBLAS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add NaN tests

This commit is contained in:
Martin Kroeker 2023-08-14 22:25:50 +02:00 committed by GitHub
parent 9a8d090eaa
commit 4f21cdf688
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
kernel/mips/iamax.c
View File

@ -1,5 +1,5 @@
/*************************************************************************** /***************************************************************************
Copyright (c) 2016, The OpenBLAS Project Copyright (c) 2013, The OpenBLAS Project
All rights reserved. All rights reserved.
Redistribution and use in source and binary forms, with or without Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are modification, are permitted provided that the following conditions are
@ -25,6 +25,15 @@ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*****************************************************************************/ *****************************************************************************/
/**************************************************************************************
* 2013/09/14 Saar
* BLASTEST float : NoTest
* BLASTEST double : NoTest
* CTEST : OK
* TEST : OK
*
**************************************************************************************/
#include "common.h" #include "common.h"
#include <math.h> #include <math.h>
@ -47,13 +56,15 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x)
BLASLONG max=0; BLASLONG max=0;
if (n <= 0 || inc_x <= 0) return(max); if (n <= 0 || inc_x <= 0) return(max);
if (n==1) return(1);
if (x[0]!=x[0]) return(1);
maxf=ABS(x[0]); maxf=ABS(x[0]);
ix += inc_x; ix += inc_x;
i++; i++;
while(i < n) while(i < n)
{ {
if (x[ix]!=x[ix]) return(i+1);
if( ABS(x[ix]) > maxf ) if( ABS(x[ix]) > maxf )
{ {
max = i; max = i;