amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-05-05 06:51:11 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
8f399c89403d5824ba767df1426706cf2d19d0a7
blis/frame/compat/f2c/bla_hpr.c
Isuru Fernando 766769eeb9 Export functions without def file (#303) 
* Revert "restore bli_extern_defs exporting for now"

This reverts commit 09fb07c350b2acee17645e8e9e1b8d829c73dca8.

* Remove symbols not intended to be public

* No need of def file anymore

* Fix whitespace

* No need of configure option

* Remove export macro from definitions

* Remove blas export macro from definitions
2019-03-11 19:05:32 -05:00

665 lines
22 KiB
C
Raw Blame History

/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2014, The University of Texas at Austin
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name(s) of the copyright holder(s) nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "blis.h"
#ifdef BLIS_ENABLE_BLAS
/* chpr.f -- translated by f2c (version 19991025).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Subroutine */ int PASTEF77(c,hpr)(const bla_character *uplo, const bla_integer *n, const bla_real *alpha, const bla_scomplex *x, const bla_integer *incx, bla_scomplex *ap)
{
/* System generated locals */
bla_integer i__1, i__2, i__3, i__4, i__5;
bla_real r__1;
bla_scomplex q__1, q__2;
/* Builtin functions */
//void bla_r_cnjg(bla_scomplex *, bla_scomplex *);
/* Local variables */
bla_integer info;
bla_scomplex temp;
bla_integer i__, j, k;
//extern bla_logical PASTEF770(lsame)(bla_character *, bla_character *, ftnlen, ftnlen);
bla_integer kk, ix, jx, kx = 0;
//extern /* Subroutine */ int PASTEF770(xerbla)(bla_character *, bla_integer *, ftnlen);
/* .. Scalar Arguments .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* CHPR performs the hermitian rank 1 operation */
/* A := alpha*x*conjg( x' ) + A, */
/* where alpha is a bla_real scalar, x is an n element vector and A is an */
/* n by n hermitian matrix, supplied in packed form. */
/* Parameters */
/* ========== */
/* UPLO - CHARACTER*1. */
/* On entry, UPLO specifies whether the upper or lower */
/* triangular part of the matrix A is supplied in the packed */
/* array AP as follows: */
/* UPLO = 'U' or 'u' The upper triangular part of A is */
/* supplied in AP. */
/* UPLO = 'L' or 'l' The lower triangular part of A is */
/* supplied in AP. */
/* Unchanged on exit. */
/* N - INTEGER. */
/* On entry, N specifies the order of the matrix A. */
/* N must be at least zero. */
/* Unchanged on exit. */
/* ALPHA - REAL . */
/* On entry, ALPHA specifies the scalar alpha. */
/* Unchanged on exit. */
/* X - COMPLEX array of dimension at least */
/* ( 1 + ( n - 1 )*abs( INCX ) ). */
/* Before entry, the incremented array X must contain the n */
/* element vector x. */
/* Unchanged on exit. */
/* INCX - INTEGER. */
/* On entry, INCX specifies the increment for the elements of */
/* X. INCX must not be zero. */
/* Unchanged on exit. */
/* AP - COMPLEX array of DIMENSION at least */
/* ( ( n*( n + 1 ) )/2 ). */
/* Before entry with UPLO = 'U' or 'u', the array AP must */
/* contain the upper triangular part of the hermitian matrix */
/* packed sequentially, column by column, so that AP( 1 ) */
/* contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 1, 2 ) */
/* and a( 2, 2 ) respectively, and so on. On exit, the array */
/* AP is overwritten by the upper triangular part of the */
/* updated matrix. */
/* Before entry with UPLO = 'L' or 'l', the array AP must */
/* contain the lower triangular part of the hermitian matrix */
/* packed sequentially, column by column, so that AP( 1 ) */
/* contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 2, 1 ) */
/* and a( 3, 1 ) respectively, and so on. On exit, the array */
/* AP is overwritten by the lower triangular part of the */
/* updated matrix. */
/* Note that the imaginary parts of the diagonal elements need */
/* not be set, they are assumed to be zero, and on exit they */
/* are set to zero. */
/* Level 2 Blas routine. */
/* -- Written on 22-October-1986. */
/* Jack Dongarra, Argonne National Lab. */
/* Jeremy Du Croz, Nag Central Office. */
/* Sven Hammarling, Nag Central Office. */
/* Richard Hanson, Sandia National Labs. */
/* .. Parameters .. */
/* .. Local Scalars .. */
/* .. External Functions .. */
/* .. External Subroutines .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Test the input parameters. */
/* Parameter adjustments */
--ap;
--x;
/* Function Body */
info = 0;
if (! PASTEF770(lsame)(uplo, "U", (ftnlen)1, (ftnlen)1) && ! PASTEF770(lsame)(uplo, "L", (
ftnlen)1, (ftnlen)1)) {
info = 1;
} else if (*n < 0) {
info = 2;
} else if (*incx == 0) {
info = 5;
}
if (info != 0) {
PASTEF770(xerbla)("CHPR ", &info, (ftnlen)6);
return 0;
}
/* Quick return if possible. */
if (*n == 0 || *alpha == 0.f) {
return 0;
}
/* Set the start point in X if the increment is not unity. */
if (*incx <= 0) {
kx = 1 - (*n - 1) * *incx;
} else if (*incx != 1) {
kx = 1;
}
/* Start the operations. In this version the elements of the array AP */
/* are accessed sequentially with one pass through AP. */
kk = 1;
if (PASTEF770(lsame)(uplo, "U", (ftnlen)1, (ftnlen)1)) {
/* Form A when upper triangle is stored in AP. */
if (*incx == 1) {
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = j;
if (bli_creal(x[i__2]) != 0.f || bli_cimag(x[i__2]) != 0.f) {
bla_r_cnjg(&q__2, &x[j]);
bli_csets( (*alpha * bli_creal(q__2)), (*alpha * bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), temp );
k = kk;
i__2 = j - 1;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = k;
i__4 = k;
i__5 = i__;
bli_csets( (bli_creal(x[i__5]) * bli_creal(temp) - bli_cimag(x[i__5]) * bli_cimag(temp)), (bli_creal(x[i__5]) * bli_cimag(temp) + bli_cimag(x[i__5]) * bli_creal(temp)), q__2 );
bli_csets( (bli_creal(ap[i__4]) + bli_creal(q__2)), (bli_cimag(ap[i__4]) + bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), ap[i__3] );
++k;
/* L10: */
}
i__2 = kk + j - 1;
i__3 = kk + j - 1;
i__4 = j;
bli_csets( (bli_creal(x[i__4]) * bli_creal(temp) - bli_cimag(x[i__4]) * bli_cimag(temp)), (bli_creal(x[i__4]) * bli_cimag(temp) + bli_cimag(x[i__4]) * bli_creal(temp)), q__1 );
r__1 = bli_creal(ap[i__3]) + bli_creal(q__1);
bli_csets( (r__1), (0.f), ap[i__2] );
} else {
i__2 = kk + j - 1;
i__3 = kk + j - 1;
r__1 = bli_creal(ap[i__3]);
bli_csets( (r__1), (0.f), ap[i__2] );
}
kk += j;
/* L20: */
}
} else {
jx = kx;
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = jx;
if (bli_creal(x[i__2]) != 0.f || bli_cimag(x[i__2]) != 0.f) {
bla_r_cnjg(&q__2, &x[jx]);
bli_csets( (*alpha * bli_creal(q__2)), (*alpha * bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), temp );
ix = kx;
i__2 = kk + j - 2;
for (k = kk; k <= i__2; ++k) {
i__3 = k;
i__4 = k;
i__5 = ix;
bli_csets( (bli_creal(x[i__5]) * bli_creal(temp) - bli_cimag(x[i__5]) * bli_cimag(temp)), (bli_creal(x[i__5]) * bli_cimag(temp) + bli_cimag(x[i__5]) * bli_creal(temp)), q__2 );
bli_csets( (bli_creal(ap[i__4]) + bli_creal(q__2)), (bli_cimag(ap[i__4]) + bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), ap[i__3] );
ix += *incx;
/* L30: */
}
i__2 = kk + j - 1;
i__3 = kk + j - 1;
i__4 = jx;
bli_csets( (bli_creal(x[i__4]) * bli_creal(temp) - bli_cimag(x[i__4]) * bli_cimag(temp)), (bli_creal(x[i__4]) * bli_cimag(temp) + bli_cimag(x[i__4]) * bli_creal(temp)), q__1 );
r__1 = bli_creal(ap[i__3]) + bli_creal(q__1);
bli_csets( (r__1), (0.f), ap[i__2] );
} else {
i__2 = kk + j - 1;
i__3 = kk + j - 1;
r__1 = bli_creal(ap[i__3]);
bli_csets( (r__1), (0.f), ap[i__2] );
}
jx += *incx;
kk += j;
/* L40: */
}
}
} else {
/* Form A when lower triangle is stored in AP. */
if (*incx == 1) {
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = j;
if (bli_creal(x[i__2]) != 0.f || bli_cimag(x[i__2]) != 0.f) {
bla_r_cnjg(&q__2, &x[j]);
bli_csets( (*alpha * bli_creal(q__2)), (*alpha * bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), temp );
i__2 = kk;
i__3 = kk;
i__4 = j;
bli_csets( (bli_creal(temp) * bli_creal(x[i__4]) - bli_cimag(temp) * bli_cimag(x[i__4])), (bli_creal(temp) * bli_cimag(x[i__4]) + bli_cimag(temp) * bli_creal(x[i__4])), q__1 );
r__1 = bli_creal(ap[i__3]) + bli_creal(q__1);
bli_csets( (r__1), (0.f), ap[i__2] );
k = kk + 1;
i__2 = *n;
for (i__ = j + 1; i__ <= i__2; ++i__) {
i__3 = k;
i__4 = k;
i__5 = i__;
bli_csets( (bli_creal(x[i__5]) * bli_creal(temp) - bli_cimag(x[i__5]) * bli_cimag(temp)), (bli_creal(x[i__5]) * bli_cimag(temp) + bli_cimag(x[i__5]) * bli_creal(temp)), q__2 );
bli_csets( (bli_creal(ap[i__4]) + bli_creal(q__2)), (bli_cimag(ap[i__4]) + bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), ap[i__3] );
++k;
/* L50: */
}
} else {
i__2 = kk;
i__3 = kk;
r__1 = bli_creal(ap[i__3]);
bli_csets( (r__1), (0.f), ap[i__2] );
}
kk = kk + *n - j + 1;
/* L60: */
}
} else {
jx = kx;
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = jx;
if (bli_creal(x[i__2]) != 0.f || bli_cimag(x[i__2]) != 0.f) {
bla_r_cnjg(&q__2, &x[jx]);
bli_csets( (*alpha * bli_creal(q__2)), (*alpha * bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), temp );
i__2 = kk;
i__3 = kk;
i__4 = jx;
bli_csets( (bli_creal(temp) * bli_creal(x[i__4]) - bli_cimag(temp) * bli_cimag(x[i__4])), (bli_creal(temp) * bli_cimag(x[i__4]) + bli_cimag(temp) * bli_creal(x[i__4])), q__1 );
r__1 = bli_creal(ap[i__3]) + bli_creal(q__1);
bli_csets( (r__1), (0.f), ap[i__2] );
ix = jx;
i__2 = kk + *n - j;
for (k = kk + 1; k <= i__2; ++k) {
ix += *incx;
i__3 = k;
i__4 = k;
i__5 = ix;
bli_csets( (bli_creal(x[i__5]) * bli_creal(temp) - bli_cimag(x[i__5]) * bli_cimag(temp)), (bli_creal(x[i__5]) * bli_cimag(temp) + bli_cimag(x[i__5]) * bli_creal(temp)), q__2 );
bli_csets( (bli_creal(ap[i__4]) + bli_creal(q__2)), (bli_cimag(ap[i__4]) + bli_cimag(q__2)), q__1 );
bli_csets( (bli_creal(q__1)), (bli_cimag(q__1)), ap[i__3] );
/* L70: */
}
} else {
i__2 = kk;
i__3 = kk;
r__1 = bli_creal(ap[i__3]);
bli_csets( (r__1), (0.f), ap[i__2] );
}
jx += *incx;
kk = kk + *n - j + 1;
/* L80: */
}
}
}
return 0;
/* End of CHPR . */
} /* chpr_ */
/* zhpr.f -- translated by f2c (version 19991025).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Subroutine */ int PASTEF77(z,hpr)(const bla_character *uplo, const bla_integer *n, const bla_double *alpha, const bla_dcomplex *x, const bla_integer *incx, bla_dcomplex *ap)
{
/* System generated locals */
bla_integer i__1, i__2, i__3, i__4, i__5;
bla_double d__1;
bla_dcomplex z__1, z__2;
/* Builtin functions */
//void bla_d_cnjg(bla_dcomplex *, bla_dcomplex *);
/* Local variables */
bla_integer info;
bla_dcomplex temp;
bla_integer i__, j, k;
//extern bla_logical PASTEF770(lsame)(bla_character *, bla_character *, ftnlen, ftnlen);
bla_integer kk, ix, jx, kx = 0;
//extern /* Subroutine */ int PASTEF770(xerbla)(bla_character *, bla_integer *, ftnlen);
/* .. Scalar Arguments .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* ZHPR performs the hermitian rank 1 operation */
/* A := alpha*x*conjg( x' ) + A, */
/* where alpha is a bla_real scalar, x is an n element vector and A is an */
/* n by n hermitian matrix, supplied in packed form. */
/* Parameters */
/* ========== */
/* UPLO - CHARACTER*1. */
/* On entry, UPLO specifies whether the upper or lower */
/* triangular part of the matrix A is supplied in the packed */
/* array AP as follows: */
/* UPLO = 'U' or 'u' The upper triangular part of A is */
/* supplied in AP. */
/* UPLO = 'L' or 'l' The lower triangular part of A is */
/* supplied in AP. */
/* Unchanged on exit. */
/* N - INTEGER. */
/* On entry, N specifies the order of the matrix A. */
/* N must be at least zero. */
/* Unchanged on exit. */
/* ALPHA - DOUBLE PRECISION. */
/* On entry, ALPHA specifies the scalar alpha. */
/* Unchanged on exit. */
/* X - COMPLEX*16 array of dimension at least */
/* ( 1 + ( n - 1 )*abs( INCX ) ). */
/* Before entry, the incremented array X must contain the n */
/* element vector x. */
/* Unchanged on exit. */
/* INCX - INTEGER. */
/* On entry, INCX specifies the increment for the elements of */
/* X. INCX must not be zero. */
/* Unchanged on exit. */
/* AP - COMPLEX*16 array of DIMENSION at least */
/* ( ( n*( n + 1 ) )/2 ). */
/* Before entry with UPLO = 'U' or 'u', the array AP must */
/* contain the upper triangular part of the hermitian matrix */
/* packed sequentially, column by column, so that AP( 1 ) */
/* contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 1, 2 ) */
/* and a( 2, 2 ) respectively, and so on. On exit, the array */
/* AP is overwritten by the upper triangular part of the */
/* updated matrix. */
/* Before entry with UPLO = 'L' or 'l', the array AP must */
/* contain the lower triangular part of the hermitian matrix */
/* packed sequentially, column by column, so that AP( 1 ) */
/* contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 2, 1 ) */
/* and a( 3, 1 ) respectively, and so on. On exit, the array */
/* AP is overwritten by the lower triangular part of the */
/* updated matrix. */
/* Note that the imaginary parts of the diagonal elements need */
/* not be set, they are assumed to be zero, and on exit they */
/* are set to zero. */
/* Level 2 Blas routine. */
/* -- Written on 22-October-1986. */
/* Jack Dongarra, Argonne National Lab. */
/* Jeremy Du Croz, Nag Central Office. */
/* Sven Hammarling, Nag Central Office. */
/* Richard Hanson, Sandia National Labs. */
/* .. Parameters .. */
/* .. Local Scalars .. */
/* .. External Functions .. */
/* .. External Subroutines .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Test the input parameters. */
/* Parameter adjustments */
--ap;
--x;
/* Function Body */
info = 0;
if (! PASTEF770(lsame)(uplo, "U", (ftnlen)1, (ftnlen)1) && ! PASTEF770(lsame)(uplo, "L", (
ftnlen)1, (ftnlen)1)) {
info = 1;
} else if (*n < 0) {
info = 2;
} else if (*incx == 0) {
info = 5;
}
if (info != 0) {
PASTEF770(xerbla)("ZHPR ", &info, (ftnlen)6);
return 0;
}
/* Quick return if possible. */
if (*n == 0 || *alpha == 0.) {
return 0;
}
/* Set the start point in X if the increment is not unity. */
if (*incx <= 0) {
kx = 1 - (*n - 1) * *incx;
} else if (*incx != 1) {
kx = 1;
}
/* Start the operations. In this version the elements of the array AP */
/* are accessed sequentially with one pass through AP. */
kk = 1;
if (PASTEF770(lsame)(uplo, "U", (ftnlen)1, (ftnlen)1)) {
/* Form A when upper triangle is stored in AP. */
if (*incx == 1) {
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = j;
if (bli_zreal(x[i__2]) != 0. || bli_zimag(x[i__2]) != 0.) {
bla_d_cnjg(&z__2, &x[j]);
bli_zsets( (*alpha * bli_zreal(z__2)), (*alpha * bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), temp );
k = kk;
i__2 = j - 1;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = k;
i__4 = k;
i__5 = i__;
bli_zsets( (bli_zreal(x[i__5]) * bli_zreal(temp) - bli_zimag(x[i__5]) * bli_zimag(temp)), (bli_zreal(x[i__5]) * bli_zimag(temp) + bli_zimag(x[i__5]) * bli_zreal(temp)), z__2 );
bli_zsets( (bli_zreal(ap[i__4]) + bli_zreal(z__2)), (bli_zimag(ap[i__4]) + bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), ap[i__3] );
++k;
/* L10: */
}
i__2 = kk + j - 1;
i__3 = kk + j - 1;
i__4 = j;
bli_zsets( (bli_zreal(x[i__4]) * bli_zreal(temp) - bli_zimag(x[i__4]) * bli_zimag(temp)), (bli_zreal(x[i__4]) * bli_zimag(temp) + bli_zimag(x[i__4]) * bli_zreal(temp)), z__1 );
d__1 = bli_zreal(ap[i__3]) + bli_zreal(z__1);
bli_zsets( (d__1), (0.), ap[i__2] );
} else {
i__2 = kk + j - 1;
i__3 = kk + j - 1;
d__1 = bli_zreal(ap[i__3]);
bli_zsets( (d__1), (0.), ap[i__2] );
}
kk += j;
/* L20: */
}
} else {
jx = kx;
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = jx;
if (bli_zreal(x[i__2]) != 0. || bli_zimag(x[i__2]) != 0.) {
bla_d_cnjg(&z__2, &x[jx]);
bli_zsets( (*alpha * bli_zreal(z__2)), (*alpha * bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), temp );
ix = kx;
i__2 = kk + j - 2;
for (k = kk; k <= i__2; ++k) {
i__3 = k;
i__4 = k;
i__5 = ix;
bli_zsets( (bli_zreal(x[i__5]) * bli_zreal(temp) - bli_zimag(x[i__5]) * bli_zimag(temp)), (bli_zreal(x[i__5]) * bli_zimag(temp) + bli_zimag(x[i__5]) * bli_zreal(temp)), z__2 );
bli_zsets( (bli_zreal(ap[i__4]) + bli_zreal(z__2)), (bli_zimag(ap[i__4]) + bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), ap[i__3] );
ix += *incx;
/* L30: */
}
i__2 = kk + j - 1;
i__3 = kk + j - 1;
i__4 = jx;
bli_zsets( (bli_zreal(x[i__4]) * bli_zreal(temp) - bli_zimag(x[i__4]) * bli_zimag(temp)), (bli_zreal(x[i__4]) * bli_zimag(temp) + bli_zimag(x[i__4]) * bli_zreal(temp)), z__1 );
d__1 = bli_zreal(ap[i__3]) + bli_zreal(z__1);
bli_zsets( (d__1), (0.), ap[i__2] );
} else {
i__2 = kk + j - 1;
i__3 = kk + j - 1;
d__1 = bli_zreal(ap[i__3]);
bli_zsets( (d__1), (0.), ap[i__2] );
}
jx += *incx;
kk += j;
/* L40: */
}
}
} else {
/* Form A when lower triangle is stored in AP. */
if (*incx == 1) {
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = j;
if (bli_zreal(x[i__2]) != 0. || bli_zimag(x[i__2]) != 0.) {
bla_d_cnjg(&z__2, &x[j]);
bli_zsets( (*alpha * bli_zreal(z__2)), (*alpha * bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), temp );
i__2 = kk;
i__3 = kk;
i__4 = j;
bli_zsets( (bli_zreal(temp) * bli_zreal(x[i__4]) - bli_zimag(temp) * bli_zimag(x[i__4])), (bli_zreal(temp) * bli_zimag(x[i__4]) + bli_zimag(temp) * bli_zreal(x[i__4])), z__1 );
d__1 = bli_zreal(ap[i__3]) + bli_zreal(z__1);
bli_zsets( (d__1), (0.), ap[i__2] );
k = kk + 1;
i__2 = *n;
for (i__ = j + 1; i__ <= i__2; ++i__) {
i__3 = k;
i__4 = k;
i__5 = i__;
bli_zsets( (bli_zreal(x[i__5]) * bli_zreal(temp) - bli_zimag(x[i__5]) * bli_zimag(temp)), (bli_zreal(x[i__5]) * bli_zimag(temp) + bli_zimag(x[i__5]) * bli_zreal(temp)), z__2 );
bli_zsets( (bli_zreal(ap[i__4]) + bli_zreal(z__2)), (bli_zimag(ap[i__4]) + bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), ap[i__3] );
++k;
/* L50: */
}
} else {
i__2 = kk;
i__3 = kk;
d__1 = bli_zreal(ap[i__3]);
bli_zsets( (d__1), (0.), ap[i__2] );
}
kk = kk + *n - j + 1;
/* L60: */
}
} else {
jx = kx;
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = jx;
if (bli_zreal(x[i__2]) != 0. || bli_zimag(x[i__2]) != 0.) {
bla_d_cnjg(&z__2, &x[jx]);
bli_zsets( (*alpha * bli_zreal(z__2)), (*alpha * bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), temp );
i__2 = kk;
i__3 = kk;
i__4 = jx;
bli_zsets( (bli_zreal(temp) * bli_zreal(x[i__4]) - bli_zimag(temp) * bli_zimag(x[i__4])), (bli_zreal(temp) * bli_zimag(x[i__4]) + bli_zimag(temp) * bli_zreal(x[i__4])), z__1 );
d__1 = bli_zreal(ap[i__3]) + bli_zreal(z__1);
bli_zsets( (d__1), (0.), ap[i__2] );
ix = jx;
i__2 = kk + *n - j;
for (k = kk + 1; k <= i__2; ++k) {
ix += *incx;
i__3 = k;
i__4 = k;
i__5 = ix;
bli_zsets( (bli_zreal(x[i__5]) * bli_zreal(temp) - bli_zimag(x[i__5]) * bli_zimag(temp)), (bli_zreal(x[i__5]) * bli_zimag(temp) + bli_zimag(x[i__5]) * bli_zreal(temp)), z__2 );
bli_zsets( (bli_zreal(ap[i__4]) + bli_zreal(z__2)), (bli_zimag(ap[i__4]) + bli_zimag(z__2)), z__1 );
bli_zsets( (bli_zreal(z__1)), (bli_zimag(z__1)), ap[i__3] );
/* L70: */
}
} else {
i__2 = kk;
i__3 = kk;
d__1 = bli_zreal(ap[i__3]);
bli_zsets( (d__1), (0.), ap[i__2] );
}
jx += *incx;
kk = kk + *n - j + 1;
/* L80: */
}
}
}
return 0;
/* End of ZHPR . */
} /* zhpr_ */
#endif
Reference in New Issue View Git Blame Copy Permalink