LAPACK  3.10.1
LAPACK: Linear Algebra PACKage
lapacke_dlarfb_work.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 middle-level C interface to LAPACK function dlarfb
30 * Author: Intel Corporation
31 *****************************************************************************/
32 
33 #include "lapacke_utils.h"
34 
35 lapack_int LAPACKE_dlarfb_work( int matrix_layout, char side, char trans,
36  char direct, char storev, lapack_int m,
37  lapack_int n, lapack_int k, const double* v,
38  lapack_int ldv, const double* t, lapack_int ldt,
39  double* c, lapack_int ldc, double* work,
40  lapack_int ldwork )
41 {
42  lapack_int info = 0;
43  lapack_int nrows_v, ncols_v;
44  lapack_int ldc_t, ldt_t, ldv_t;
45  double *v_t = NULL, *t_t = NULL, *c_t = NULL;
46  if( matrix_layout == LAPACK_COL_MAJOR ) {
47  /* Call LAPACK function and adjust info */
48  LAPACK_dlarfb( &side, &trans, &direct, &storev, &m, &n, &k, v, &ldv, t,
49  &ldt, c, &ldc, work, &ldwork );
50  if( info < 0 ) {
51  info = info - 1;
52  }
53  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
54  nrows_v = ( LAPACKE_lsame( storev, 'c' ) &&
55  LAPACKE_lsame( side, 'l' ) ) ? m :
56  ( ( LAPACKE_lsame( storev, 'c' ) &&
57  LAPACKE_lsame( side, 'r' ) ) ? n :
58  ( LAPACKE_lsame( storev, 'r' ) ? k : 1) );
59  ncols_v = LAPACKE_lsame( storev, 'c' ) ? k :
60  ( ( LAPACKE_lsame( storev, 'r' ) &&
61  LAPACKE_lsame( side, 'l' ) ) ? m :
62  ( ( LAPACKE_lsame( storev, 'r' ) &&
63  LAPACKE_lsame( side, 'r' ) ) ? n : 1) );
64  ldc_t = MAX(1,m);
65  ldt_t = MAX(1,k);
66  ldv_t = MAX(1,nrows_v);
67  /* Check leading dimension(s) */
68  if( ldc < n ) {
69  info = -14;
70  LAPACKE_xerbla( "LAPACKE_dlarfb_work", info );
71  return info;
72  }
73  if( ldt < k ) {
74  info = -12;
75  LAPACKE_xerbla( "LAPACKE_dlarfb_work", info );
76  return info;
77  }
78  if( ldv < ncols_v ) {
79  info = -10;
80  LAPACKE_xerbla( "LAPACKE_dlarfb_work", info );
81  return info;
82  }
83  /* Allocate memory for temporary array(s) */
84  v_t = (double*)
85  LAPACKE_malloc( sizeof(double) * ldv_t * MAX(1,ncols_v) );
86  if( v_t == NULL ) {
88  goto exit_level_0;
89  }
90  t_t = (double*)LAPACKE_malloc( sizeof(double) * ldt_t * MAX(1,k) );
91  if( t_t == NULL ) {
93  goto exit_level_1;
94  }
95  c_t = (double*)LAPACKE_malloc( sizeof(double) * ldc_t * MAX(1,n) );
96  if( c_t == NULL ) {
98  goto exit_level_2;
99  }
100  /* Transpose input matrices */
101  if( LAPACKE_lsame( storev, 'c' ) && LAPACKE_lsame( direct, 'f' ) ) {
102  LAPACKE_dtr_trans( matrix_layout, 'l', 'u', k, v, ldv, v_t, ldv_t );
103  LAPACKE_dge_trans( matrix_layout, nrows_v-k, ncols_v, &v[k*ldv], ldv,
104  &v_t[k], ldv_t );
105  } else if( LAPACKE_lsame( storev, 'c' ) &&
106  LAPACKE_lsame( direct, 'b' ) ) {
107  if( k > nrows_v ) {
108  LAPACKE_xerbla( "LAPACKE_dlarfb_work", -8 );
109  return -8;
110  }
111  LAPACKE_dtr_trans( matrix_layout, 'u', 'u', k, &v[(nrows_v-k)*ldv],
112  ldv, &v_t[nrows_v-k], ldv_t );
113  LAPACKE_dge_trans( matrix_layout, nrows_v-k, ncols_v, v, ldv, v_t,
114  ldv_t );
115  } else if( LAPACKE_lsame( storev, 'r' ) &&
116  LAPACKE_lsame( direct, 'f' ) ) {
117  LAPACKE_dtr_trans( matrix_layout, 'u', 'u', k, v, ldv, v_t, ldv_t );
118  LAPACKE_dge_trans( matrix_layout, nrows_v, ncols_v-k, &v[k], ldv,
119  &v_t[k*ldv_t], ldv_t );
120  } else if( LAPACKE_lsame( storev, 'r' ) &&
121  LAPACKE_lsame( direct, 'b' ) ) {
122  if( k > ncols_v ) {
123  LAPACKE_xerbla( "LAPACKE_dlarfb_work", -8 );
124  return -8;
125  }
126  LAPACKE_dtr_trans( matrix_layout, 'l', 'u', k, &v[ncols_v-k], ldv,
127  &v_t[(ncols_v-k)*ldv_t], ldv_t );
128  LAPACKE_dge_trans( matrix_layout, nrows_v, ncols_v-k, v, ldv, v_t,
129  ldv_t );
130  }
131  LAPACKE_dge_trans( matrix_layout, k, k, t, ldt, t_t, ldt_t );
132  LAPACKE_dge_trans( matrix_layout, m, n, c, ldc, c_t, ldc_t );
133  /* Call LAPACK function and adjust info */
134  LAPACK_dlarfb( &side, &trans, &direct, &storev, &m, &n, &k, v_t, &ldv_t,
135  t_t, &ldt_t, c_t, &ldc_t, work, &ldwork );
136  info = 0; /* LAPACK call is ok! */
137  /* Transpose output matrices */
138  LAPACKE_dge_trans( LAPACK_COL_MAJOR, m, n, c_t, ldc_t, c, ldc );
139  /* Release memory and exit */
140  LAPACKE_free( c_t );
141 exit_level_2:
142  LAPACKE_free( t_t );
143 exit_level_1:
144  LAPACKE_free( v_t );
145 exit_level_0:
146  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
147  LAPACKE_xerbla( "LAPACKE_dlarfb_work", info );
148  }
149  } else {
150  info = -1;
151  LAPACKE_xerbla( "LAPACKE_dlarfb_work", info );
152  }
153  return info;
154 }
#define LAPACK_dlarfb(...)
Definition: lapack.h:10467
#define lapack_int
Definition: lapack.h:83
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
lapack_int LAPACKE_dlarfb_work(int matrix_layout, char side, char trans, char direct, char storev, lapack_int m, lapack_int n, lapack_int k, const double *v, lapack_int ldv, const double *t, lapack_int ldt, double *c, lapack_int ldc, double *work, lapack_int ldwork)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_dtr_trans(int matrix_layout, char uplo, char diag, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)