LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_chprfs_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 chprfs
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_chprfs_work( int matrix_layout, char uplo, lapack_int n,
36 lapack_int nrhs, const lapack_complex_float* ap,
37 const lapack_complex_float* afp,
38 const lapack_int* ipiv,
39 const lapack_complex_float* b, lapack_int ldb,
41 float* ferr, float* berr,
42 lapack_complex_float* work, float* rwork )
43{
44 lapack_int info = 0;
45 if( matrix_layout == LAPACK_COL_MAJOR ) {
46 /* Call LAPACK function and adjust info */
47 LAPACK_chprfs( &uplo, &n, &nrhs, ap, afp, ipiv, b, &ldb, x, &ldx, ferr,
48 berr, work, rwork, &info );
49 if( info < 0 ) {
50 info = info - 1;
51 }
52 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
53 lapack_int ldb_t = MAX(1,n);
54 lapack_int ldx_t = MAX(1,n);
55 lapack_complex_float* b_t = NULL;
56 lapack_complex_float* x_t = NULL;
57 lapack_complex_float* ap_t = NULL;
58 lapack_complex_float* afp_t = NULL;
59 /* Check leading dimension(s) */
60 if( ldb < nrhs ) {
61 info = -9;
62 LAPACKE_xerbla( "LAPACKE_chprfs_work", info );
63 return info;
64 }
65 if( ldx < nrhs ) {
66 info = -11;
67 LAPACKE_xerbla( "LAPACKE_chprfs_work", info );
68 return info;
69 }
70 /* Allocate memory for temporary array(s) */
73 ldb_t * MAX(1,nrhs) );
74 if( b_t == NULL ) {
76 goto exit_level_0;
77 }
80 ldx_t * MAX(1,nrhs) );
81 if( x_t == NULL ) {
83 goto exit_level_1;
84 }
85 ap_t = (lapack_complex_float*)
87 ( MAX(1,n) * MAX(2,n+1) ) / 2 );
88 if( ap_t == NULL ) {
90 goto exit_level_2;
91 }
92 afp_t = (lapack_complex_float*)
94 ( MAX(1,n) * MAX(2,n+1) ) / 2 );
95 if( afp_t == NULL ) {
97 goto exit_level_3;
98 }
99 /* Transpose input matrices */
100 LAPACKE_cge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
101 LAPACKE_cge_trans( matrix_layout, n, nrhs, x, ldx, x_t, ldx_t );
102 LAPACKE_chp_trans( matrix_layout, uplo, n, ap, ap_t );
103 LAPACKE_chp_trans( matrix_layout, uplo, n, afp, afp_t );
104 /* Call LAPACK function and adjust info */
105 LAPACK_chprfs( &uplo, &n, &nrhs, ap_t, afp_t, ipiv, b_t, &ldb_t, x_t,
106 &ldx_t, ferr, berr, work, rwork, &info );
107 if( info < 0 ) {
108 info = info - 1;
109 }
110 /* Transpose output matrices */
111 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
112 /* Release memory and exit */
113 LAPACKE_free( afp_t );
114exit_level_3:
115 LAPACKE_free( ap_t );
116exit_level_2:
117 LAPACKE_free( x_t );
118exit_level_1:
119 LAPACKE_free( b_t );
120exit_level_0:
121 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
122 LAPACKE_xerbla( "LAPACKE_chprfs_work", info );
123 }
124 } else {
125 info = -1;
126 LAPACKE_xerbla( "LAPACKE_chprfs_work", info );
127 }
128 return info;
129}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_chprfs(...)
Definition: lapack.h:8800
#define lapack_complex_float
Definition: lapack.h:46
#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_chprfs_work(int matrix_layout, char uplo, lapack_int n, lapack_int nrhs, const lapack_complex_float *ap, const lapack_complex_float *afp, const lapack_int *ipiv, const lapack_complex_float *b, lapack_int ldb, lapack_complex_float *x, lapack_int ldx, float *ferr, float *berr, lapack_complex_float *work, float *rwork)
void LAPACKE_xerbla(const char *name, lapack_int info)
#define MAX(x, y)
Definition: lapacke_utils.h:46
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)
void LAPACKE_chp_trans(int matrix_layout, char uplo, lapack_int n, const lapack_complex_float *in, lapack_complex_float *out)