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