LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_dgesvxx.c
Go to the documentation of this file.
1/*****************************************************************************
2 Copyright (c) 2014, Intel Corp.
3 All rights reserved.
4
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
7
8 * Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
13 * Neither the name of Intel Corporation nor the names of its contributors
14 may be used to endorse or promote products derived from this software
15 without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27 THE POSSIBILITY OF SUCH DAMAGE.
28*****************************************************************************
29* Contents: Native high-level C interface to LAPACK function dgesvxx
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_dgesvxx( int matrix_layout, char fact, char trans,
36 lapack_int n, lapack_int nrhs, double* a,
37 lapack_int lda, double* af, lapack_int ldaf,
38 lapack_int* ipiv, char* equed, double* r, double* c,
39 double* b, lapack_int ldb, double* x,
40 lapack_int ldx, double* rcond, double* rpvgrw,
41 double* berr, lapack_int n_err_bnds,
42 double* err_bnds_norm, double* err_bnds_comp,
43 lapack_int nparams, double* params )
44{
45 lapack_int info = 0;
46 lapack_int* iwork = NULL;
47 double* work = NULL;
48 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
49 LAPACKE_xerbla( "LAPACKE_dgesvxx", -1 );
50 return -1;
51 }
52#ifndef LAPACK_DISABLE_NAN_CHECK
53 if( LAPACKE_get_nancheck() ) {
54 /* Optionally check input matrices for NaNs */
55 if( LAPACKE_dge_nancheck( matrix_layout, n, n, a, lda ) ) {
56 return -6;
57 }
58 if( LAPACKE_lsame( fact, 'f' ) ) {
59 if( LAPACKE_dge_nancheck( matrix_layout, n, n, af, ldaf ) ) {
60 return -8;
61 }
62 }
63 if( LAPACKE_dge_nancheck( matrix_layout, n, nrhs, b, ldb ) ) {
64 return -14;
65 }
66 if( LAPACKE_lsame( fact, 'f' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
67 LAPACKE_lsame( *equed, 'c' ) ) ) {
68 if( LAPACKE_d_nancheck( n, c, 1 ) ) {
69 return -13;
70 }
71 }
72 if( nparams>0 ) {
73 if( LAPACKE_d_nancheck( nparams, params, 1 ) ) {
74 return -25;
75 }
76 }
77 if( LAPACKE_lsame( fact, 'f' ) && ( LAPACKE_lsame( *equed, 'b' ) ||
78 LAPACKE_lsame( *equed, 'r' ) ) ) {
79 if( LAPACKE_d_nancheck( n, r, 1 ) ) {
80 return -12;
81 }
82 }
83 }
84#endif
85 /* Allocate memory for working array(s) */
86 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,n) );
87 if( iwork == NULL ) {
89 goto exit_level_0;
90 }
91 work = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,4*n) );
92 if( work == NULL ) {
94 goto exit_level_1;
95 }
96 /* Call middle-level interface */
97 info = LAPACKE_dgesvxx_work( matrix_layout, fact, trans, n, nrhs, a, lda, af,
98 ldaf, ipiv, equed, r, c, b, ldb, x, ldx, rcond,
99 rpvgrw, berr, n_err_bnds, err_bnds_norm,
100 err_bnds_comp, nparams, params, work, iwork );
101 /* Release memory and exit */
102 LAPACKE_free( work );
103exit_level_1:
104 LAPACKE_free( iwork );
105exit_level_0:
106 if( info == LAPACK_WORK_MEMORY_ERROR ) {
107 LAPACKE_xerbla( "LAPACKE_dgesvxx", info );
108 }
109 return info;
110}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
lapack_int LAPACKE_dgesvxx_work(int matrix_layout, char fact, char trans, lapack_int n, lapack_int nrhs, double *a, lapack_int lda, double *af, lapack_int ldaf, lapack_int *ipiv, char *equed, double *r, double *c, double *b, lapack_int ldb, double *x, lapack_int ldx, double *rcond, double *rpvgrw, double *berr, lapack_int n_err_bnds, double *err_bnds_norm, double *err_bnds_comp, lapack_int nparams, double *params, double *work, lapack_int *iwork)
int LAPACKE_get_nancheck(void)
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
lapack_int LAPACKE_dgesvxx(int matrix_layout, char fact, char trans, lapack_int n, lapack_int nrhs, double *a, lapack_int lda, double *af, lapack_int ldaf, lapack_int *ipiv, char *equed, double *r, double *c, double *b, lapack_int ldb, double *x, lapack_int ldx, double *rcond, double *rpvgrw, double *berr, lapack_int n_err_bnds, double *err_bnds_norm, double *err_bnds_comp, lapack_int nparams, double *params)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapack_logical LAPACKE_dge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const double *a, lapack_int lda)