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 dgejsv
30 * Author: Intel Corporation
31 * Generated June 2016
32 *****************************************************************************/
33
34 #include "lapacke_utils.h"
35
LAPACKE_dgejsv(int matrix_layout,char joba,char jobu,char jobv,char jobr,char jobt,char jobp,lapack_int m,lapack_int n,double * a,lapack_int lda,double * sva,double * u,lapack_int ldu,double * v,lapack_int ldv,double * stat,lapack_int * istat)36 lapack_int LAPACKE_dgejsv( int matrix_layout, char joba, char jobu, char jobv,
37 char jobr, char jobt, char jobp, lapack_int m,
38 lapack_int n, double* a, lapack_int lda, double* sva,
39 double* u, lapack_int ldu, double* v, lapack_int ldv,
40 double* stat, lapack_int* istat )
41 {
42 lapack_int info = 0;
43 lapack_int lwork = (!( LAPACKE_lsame( jobu, 'u' ) ||
44 LAPACKE_lsame( jobu, 'f' ) ||
45 LAPACKE_lsame( jobv, 'v' ) ||
46 LAPACKE_lsame( jobv, 'j' ) ||
47 LAPACKE_lsame( joba, 'e' ) ||
48 LAPACKE_lsame( joba, 'g' ) ) ? MAX3(7,4*n+1,2*m+n) :
49 ( (!( LAPACKE_lsame( jobu, 'u' ) ||
50 LAPACKE_lsame( jobu, 'f' ) ||
51 LAPACKE_lsame( jobv, 'v' ) ||
52 LAPACKE_lsame( jobv, 'j' ) ) &&
53 ( LAPACKE_lsame( joba, 'e' ) ||
54 LAPACKE_lsame( joba, 'g' ) ) ) ? MAX3(7,4*n+n*n,2*m+n) :
55 ( ( LAPACKE_lsame( jobu, 'u' ) ||
56 LAPACKE_lsame( jobu, 'f' ) ) &&
57 (!( LAPACKE_lsame( jobv, 'v' ) ||
58 LAPACKE_lsame( jobv, 'j' ) ) ) ? MAX(7,2*n+m) :
59 ( ( LAPACKE_lsame( jobv, 'v' ) ||
60 LAPACKE_lsame( jobv, 'j' ) ) &&
61 (!( LAPACKE_lsame( jobu, 'u' ) ||
62 LAPACKE_lsame( jobu, 'f' ) ) ) ? MAX(7,2*n+m) :
63 ( ( LAPACKE_lsame( jobu, 'u' ) ||
64 LAPACKE_lsame( jobu, 'f' ) ) &&
65 ( LAPACKE_lsame( jobv, 'v' ) ||
66 LAPACKE_lsame( jobv, 'j' ) ) &&
67 !LAPACKE_lsame( jobv, 'j' ) ? MAX(1,6*n+2*n*n) :
68 ( ( LAPACKE_lsame( jobu, 'u' ) ||
69 LAPACKE_lsame( jobu, 'f' ) ) &&
70 ( LAPACKE_lsame( jobv, 'v' ) ||
71 LAPACKE_lsame( jobv, 'j' ) ) &&
72 LAPACKE_lsame( jobv, 'j' ) ? MAX(7,m+3*n+n*n) :
73 7) ) ) ) ) );
74 lapack_int* iwork = NULL;
75 double* work = NULL;
76 lapack_int i;
77 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
78 LAPACKE_xerbla( "LAPACKE_dgejsv", -1 );
79 return -1;
80 }
81 #ifndef LAPACK_DISABLE_NAN_CHECK
82 if( LAPACKE_get_nancheck() ) {
83 /* Optionally check input matrices for NaNs */
84 if( LAPACKE_dge_nancheck( matrix_layout, m, n, a, lda ) ) {
85 return -10;
86 }
87 }
88 #endif
89 /* Allocate memory for working array(s) */
90 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(3,m+3*n) );
91 if( iwork == NULL ) {
92 info = LAPACK_WORK_MEMORY_ERROR;
93 goto exit_level_0;
94 }
95 lwork = MAX3( lwork, 7, 2*m+n );
96 { /* FIXUP LWORK */
97 int want_u = LAPACKE_lsame( jobu, 'u' ) || LAPACKE_lsame( jobu, 'f' );
98 int want_v = LAPACKE_lsame( jobv, 'v' ) || LAPACKE_lsame( jobv, 'j' );
99 int want_sce = LAPACKE_lsame( joba, 'e' ) || LAPACKE_lsame( joba, 'g' );
100 if( !want_u && !want_v && !want_sce ) lwork = MAX( lwork, 4*n+1 ); // 1.1
101 if( !want_u && !want_v && want_sce ) lwork = MAX( lwork, n*n+4*n ); // 1.2
102 if( !want_u && want_v ) lwork = MAX( lwork, 4*n+1 ); // 2
103 if( want_u && !want_v ) lwork = MAX( lwork, 4*n+1 ); // 3
104 if( want_u && LAPACKE_lsame( jobv, 'v' ) ) lwork = MAX( lwork, 6*n+2*n*n ); // 4.1
105 if( want_u && LAPACKE_lsame( jobv, 'j' ) ) lwork = MAX3( lwork, 4*n+n*n, 2*n+n*n+6 ); // 4.2
106 }
107 work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
108 if( work == NULL ) {
109 info = LAPACK_WORK_MEMORY_ERROR;
110 goto exit_level_1;
111 }
112 /* Call middle-level interface */
113 info = LAPACKE_dgejsv_work( matrix_layout, joba, jobu, jobv, jobr, jobt,
114 jobp, m, n, a, lda, sva, u, ldu, v, ldv, work,
115 lwork, iwork );
116 /* Backup significant data from working array(s) */
117 for( i=0; i<7; i++ ) {
118 stat[i] = work[i];
119 }
120 for( i=0; i<3; i++ ) {
121 istat[i] = iwork[i];
122 }
123 /* Release memory and exit */
124 LAPACKE_free( work );
125 exit_level_1:
126 LAPACKE_free( iwork );
127 exit_level_0:
128 if( info == LAPACK_WORK_MEMORY_ERROR ) {
129 LAPACKE_xerbla( "LAPACKE_dgejsv", info );
130 }
131 return info;
132 }
133