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 middle-level C interface to LAPACK function zunmlq
30 * Author: Intel Corporation
31 * Generated June 2016
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
LAPACKE_zunmlq_work(int matrix_layout,char side,char trans,lapack_int m,lapack_int n,lapack_int k,const lapack_complex_double * a,lapack_int lda,const lapack_complex_double * tau,lapack_complex_double * c,lapack_int ldc,lapack_complex_double * work,lapack_int lwork)36 lapack_int LAPACKE_zunmlq_work( int matrix_layout, char side, char trans,
37                                 lapack_int m, lapack_int n, lapack_int k,
38                                 const lapack_complex_double* a, lapack_int lda,
39                                 const lapack_complex_double* tau,
40                                 lapack_complex_double* c, lapack_int ldc,
41                                 lapack_complex_double* work, lapack_int lwork )
42 {
43     lapack_int info = 0;
44     lapack_int r;
45     if( matrix_layout == LAPACK_COL_MAJOR ) {
46         /* Call LAPACK function and adjust info */
47         LAPACK_zunmlq( &side, &trans, &m, &n, &k, a, &lda, tau, c, &ldc, work,
48                        &lwork, &info );
49         if( info < 0 ) {
50             info = info - 1;
51         }
52     } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
53         r = LAPACKE_lsame( side, 'l' ) ? m : n;
54         lapack_int lda_t = MAX(1,k);
55         lapack_int ldc_t = MAX(1,m);
56         lapack_complex_double* a_t = NULL;
57         lapack_complex_double* c_t = NULL;
58         /* Check leading dimension(s) */
59         if( lda < r ) {
60             info = -8;
61             LAPACKE_xerbla( "LAPACKE_zunmlq_work", info );
62             return info;
63         }
64         if( ldc < n ) {
65             info = -11;
66             LAPACKE_xerbla( "LAPACKE_zunmlq_work", info );
67             return info;
68         }
69         /* Query optimal working array(s) size if requested */
70         if( lwork == -1 ) {
71             LAPACK_zunmlq( &side, &trans, &m, &n, &k, a, &lda_t, tau, c, &ldc_t,
72                            work, &lwork, &info );
73             return (info < 0) ? (info - 1) : info;
74         }
75         /* Allocate memory for temporary array(s) */
76         if( LAPACKE_lsame( side, 'l' ) ) {
77             a_t = (lapack_complex_double*)
78                 LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,m) );
79         } else {
80             a_t = (lapack_complex_double*)
81                 LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
82         }
83         if( a_t == NULL ) {
84             info = LAPACK_TRANSPOSE_MEMORY_ERROR;
85             goto exit_level_0;
86         }
87         c_t = (lapack_complex_double*)
88             LAPACKE_malloc( sizeof(lapack_complex_double) * ldc_t * MAX(1,n) );
89         if( c_t == NULL ) {
90             info = LAPACK_TRANSPOSE_MEMORY_ERROR;
91             goto exit_level_1;
92         }
93         /* Transpose input matrices */
94         LAPACKE_zge_trans( matrix_layout, k, m, a, lda, a_t, lda_t );
95         LAPACKE_zge_trans( matrix_layout, m, n, c, ldc, c_t, ldc_t );
96         /* Call LAPACK function and adjust info */
97         LAPACK_zunmlq( &side, &trans, &m, &n, &k, a_t, &lda_t, tau, c_t, &ldc_t,
98                        work, &lwork, &info );
99         if( info < 0 ) {
100             info = info - 1;
101         }
102         /* Transpose output matrices */
103         LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, c_t, ldc_t, c, ldc );
104         /* Release memory and exit */
105         LAPACKE_free( c_t );
106 exit_level_1:
107         LAPACKE_free( a_t );
108 exit_level_0:
109         if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
110             LAPACKE_xerbla( "LAPACKE_zunmlq_work", info );
111         }
112     } else {
113         info = -1;
114         LAPACKE_xerbla( "LAPACKE_zunmlq_work", info );
115     }
116     return info;
117 }
118