00001 /***************************************************************************** 00002 Copyright (c) 2010, Intel Corp. 00003 All rights reserved. 00004 00005 Redistribution and use in source and binary forms, with or without 00006 modification, are permitted provided that the following conditions are met: 00007 00008 * Redistributions of source code must retain the above copyright notice, 00009 this list of conditions and the following disclaimer. 00010 * Redistributions in binary form must reproduce the above copyright 00011 notice, this list of conditions and the following disclaimer in the 00012 documentation and/or other materials provided with the distribution. 00013 * Neither the name of Intel Corporation nor the names of its contributors 00014 may be used to endorse or promote products derived from this software 00015 without specific prior written permission. 00016 00017 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00018 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00019 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00020 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 00021 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00022 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00023 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 00024 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 00025 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00026 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 00027 THE POSSIBILITY OF SUCH DAMAGE. 00028 ****************************************************************************** 00029 * Contents: Native C interface to LAPACK utility function 00030 * Author: Intel Corporation 00031 * Created in February, 2010 00032 *****************************************************************************/ 00033 #include "lapacke_utils.h" 00034 00035 /* Check a matrix for NaN entries. */ 00036 00037 lapack_logical LAPACKE_ctr_nancheck( int matrix_order, char uplo, char diag, 00038 lapack_int n, 00039 const lapack_complex_float *a, 00040 lapack_int lda ) 00041 { 00042 lapack_int i, j, st; 00043 lapack_logical colmaj, lower, unit; 00044 00045 if( a == NULL ) return (lapack_logical) 0; 00046 00047 colmaj = ( matrix_order == LAPACK_COL_MAJOR ); 00048 lower = LAPACKE_lsame( uplo, 'l' ); 00049 unit = LAPACKE_lsame( diag, 'u' ); 00050 00051 if( ( !colmaj && ( matrix_order != LAPACK_ROW_MAJOR ) ) || 00052 ( !lower && !LAPACKE_lsame( uplo, 'u' ) ) || 00053 ( !unit && !LAPACKE_lsame( diag, 'n' ) ) ) { 00054 /* Just exit if any of input parameters are wrong */ 00055 return (lapack_logical) 0; 00056 } 00057 if( unit ) { 00058 /* If unit, then don't touch diagonal, start from 1st column or row */ 00059 st = 1; 00060 } else { 00061 /* If non-unit, then check diagonal also, starting from [0,0] */ 00062 st = 0; 00063 } 00064 00065 /* Since col_major upper and row_major lower are equal, 00066 * and col_major lower and row_major upper are equals too - 00067 * using one code for equal cases. XOR( colmaj, upper ) 00068 */ 00069 if( ( colmaj || lower ) && !( colmaj && lower ) ) { 00070 for( j = st; j < n; j++ ) { 00071 for( i = 0; i < MIN( j+1-st, lda ); i++ ) { 00072 if( LAPACK_CISNAN( a[i+j*lda] ) ) 00073 return (lapack_logical) 1; 00074 } 00075 } 00076 } else { 00077 for( j = 0; j < n-st; j++ ) { 00078 for( i = j+st; i < MIN( n, lda ); i++ ) { 00079 if( LAPACK_CISNAN( a[i+j*lda] ) ) 00080 return (lapack_logical) 1; 00081 } 00082 } 00083 } 00084 return (lapack_logical) 0; 00085 }