14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
513 /* > \brief \b ZHFRK performs a Hermitian rank-k operation for matrix in RFP format. */
515 /* =========== DOCUMENTATION =========== */
517 /* Online html documentation available at */
518 /* http://www.netlib.org/lapack/explore-html/ */
521 /* > Download ZHFRK + dependencies */
522 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zhfrk.f
525 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zhfrk.f
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zhfrk.f
536 /* SUBROUTINE ZHFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, */
539 /* DOUBLE PRECISION ALPHA, BETA */
540 /* INTEGER K, LDA, N */
541 /* CHARACTER TRANS, TRANSR, UPLO */
542 /* COMPLEX*16 A( LDA, * ), C( * ) */
545 /* > \par Purpose: */
550 /* > Level 3 BLAS like routine for C in RFP Format. */
552 /* > ZHFRK performs one of the Hermitian rank--k operations */
554 /* > C := alpha*A*A**H + beta*C, */
558 /* > C := alpha*A**H*A + beta*C, */
560 /* > where alpha and beta are real scalars, C is an n--by--n Hermitian */
561 /* > matrix and A is an n--by--k matrix in the first case and a k--by--n */
562 /* > matrix in the second case. */
568 /* > \param[in] TRANSR */
570 /* > TRANSR is CHARACTER*1 */
571 /* > = 'N': The Normal Form of RFP A is stored; */
572 /* > = 'C': The Conjugate-transpose Form of RFP A is stored. */
575 /* > \param[in] UPLO */
577 /* > UPLO is CHARACTER*1 */
578 /* > On entry, UPLO specifies whether the upper or lower */
579 /* > triangular part of the array C is to be referenced as */
582 /* > UPLO = 'U' or 'u' Only the upper triangular part of C */
583 /* > is to be referenced. */
585 /* > UPLO = 'L' or 'l' Only the lower triangular part of C */
586 /* > is to be referenced. */
588 /* > Unchanged on exit. */
591 /* > \param[in] TRANS */
593 /* > TRANS is CHARACTER*1 */
594 /* > On entry, TRANS specifies the operation to be performed as */
597 /* > TRANS = 'N' or 'n' C := alpha*A*A**H + beta*C. */
599 /* > TRANS = 'C' or 'c' C := alpha*A**H*A + beta*C. */
601 /* > Unchanged on exit. */
607 /* > On entry, N specifies the order of the matrix C. N must be */
608 /* > at least zero. */
609 /* > Unchanged on exit. */
615 /* > On entry with TRANS = 'N' or 'n', K specifies the number */
616 /* > of columns of the matrix A, and on entry with */
617 /* > TRANS = 'C' or 'c', K specifies the number of rows of the */
618 /* > matrix A. K must be at least zero. */
619 /* > Unchanged on exit. */
622 /* > \param[in] ALPHA */
624 /* > ALPHA is DOUBLE PRECISION */
625 /* > On entry, ALPHA specifies the scalar alpha. */
626 /* > Unchanged on exit. */
631 /* > A is COMPLEX*16 array, dimension (LDA,ka) */
633 /* > is K when TRANS = 'N' or 'n', and is N otherwise. Before */
634 /* > entry with TRANS = 'N' or 'n', the leading N--by--K part of */
635 /* > the array A must contain the matrix A, otherwise the leading */
636 /* > K--by--N part of the array A must contain the matrix A. */
637 /* > Unchanged on exit. */
640 /* > \param[in] LDA */
642 /* > LDA is INTEGER */
643 /* > On entry, LDA specifies the first dimension of A as declared */
644 /* > in the calling (sub) program. When TRANS = 'N' or 'n' */
645 /* > then LDA must be at least f2cmax( 1, n ), otherwise LDA must */
646 /* > be at least f2cmax( 1, k ). */
647 /* > Unchanged on exit. */
650 /* > \param[in] BETA */
652 /* > BETA is DOUBLE PRECISION */
653 /* > On entry, BETA specifies the scalar beta. */
654 /* > Unchanged on exit. */
657 /* > \param[in,out] C */
659 /* > C is COMPLEX*16 array, dimension (N*(N+1)/2) */
660 /* > On entry, the matrix A in RFP Format. RFP Format is */
661 /* > described by TRANSR, UPLO and N. Note that the imaginary */
662 /* > parts of the diagonal elements need not be set, they are */
663 /* > assumed to be zero, and on exit they are set to zero. */
669 /* > \author Univ. of Tennessee */
670 /* > \author Univ. of California Berkeley */
671 /* > \author Univ. of Colorado Denver */
672 /* > \author NAG Ltd. */
674 /* > \date June 2017 */
676 /* > \ingroup complex16OTHERcomputational */
678 /* ===================================================================== */
679 /* Subroutine */ int zhfrk_(char *transr, char *uplo, char *trans, integer *n,
680 integer *k, doublereal *alpha, doublecomplex *a, integer *lda,
681 doublereal *beta, doublecomplex *c__)
683 /* System generated locals */
684 integer a_dim1, a_offset, i__1, i__2;
687 /* Local variables */
690 logical normaltransr;
691 extern logical lsame_(char *, char *);
692 extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
693 integer *, doublecomplex *, doublecomplex *, integer *,
694 doublecomplex *, integer *, doublecomplex *, doublecomplex *,
695 integer *), zherk_(char *, char *, integer *,
696 integer *, doublereal *, doublecomplex *, integer *, doublereal *,
697 doublecomplex *, integer *);
701 doublecomplex calpha;
703 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
704 logical nisodd, notrans;
707 /* -- LAPACK computational routine (version 3.7.1) -- */
708 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
709 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
713 /* ===================================================================== */
717 /* Test the input parameters. */
719 /* Parameter adjustments */
721 a_offset = 1 + a_dim1 * 1;
727 normaltransr = lsame_(transr, "N");
728 lower = lsame_(uplo, "L");
729 notrans = lsame_(trans, "N");
737 if (! normaltransr && ! lsame_(transr, "C")) {
739 } else if (! lower && ! lsame_(uplo, "U")) {
741 } else if (! notrans && ! lsame_(trans, "C")) {
747 } else if (*lda < f2cmax(1,nrowa)) {
752 xerbla_("ZHFRK ", &i__1, (ftnlen)6);
756 /* Quick return if possible. */
758 /* The quick return case: ((ALPHA.EQ.0).AND.(BETA.NE.ZERO)) is not */
759 /* done (it is in ZHERK for example) and left in the general case. */
761 if (*n == 0 || (*alpha == 0. || *k == 0) && *beta == 1.) {
765 if (*alpha == 0. && *beta == 0.) {
766 i__1 = *n * (*n + 1) / 2;
767 for (j = 1; j <= i__1; ++j) {
769 c__[i__2].r = 0., c__[i__2].i = 0.;
774 z__1.r = *alpha, z__1.i = 0.;
775 calpha.r = z__1.r, calpha.i = z__1.i;
776 z__1.r = *beta, z__1.i = 0.;
777 cbeta.r = z__1.r, cbeta.i = z__1.i;
780 /* If N is odd, set NISODD = .TRUE., and N1 and N2. */
781 /* If N is even, NISODD = .FALSE., and NK. */
803 /* N is odd and TRANSR = 'N' */
807 /* N is odd, TRANSR = 'N', and UPLO = 'L' */
811 /* N is odd, TRANSR = 'N', UPLO = 'L', and TRANS = 'N' */
813 zherk_("L", "N", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
815 zherk_("U", "N", &n2, k, alpha, &a[n1 + 1 + a_dim1], lda,
816 beta, &c__[*n + 1], n);
817 zgemm_("N", "C", &n2, &n1, k, &calpha, &a[n1 + 1 + a_dim1]
818 , lda, &a[a_dim1 + 1], lda, &cbeta, &c__[n1 + 1],
823 /* N is odd, TRANSR = 'N', UPLO = 'L', and TRANS = 'C' */
825 zherk_("L", "C", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
827 zherk_("U", "C", &n2, k, alpha, &a[(n1 + 1) * a_dim1 + 1],
828 lda, beta, &c__[*n + 1], n)
830 zgemm_("C", "N", &n2, &n1, k, &calpha, &a[(n1 + 1) *
831 a_dim1 + 1], lda, &a[a_dim1 + 1], lda, &cbeta, &
838 /* N is odd, TRANSR = 'N', and UPLO = 'U' */
842 /* N is odd, TRANSR = 'N', UPLO = 'U', and TRANS = 'N' */
844 zherk_("L", "N", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
846 zherk_("U", "N", &n2, k, alpha, &a[n2 + a_dim1], lda,
847 beta, &c__[n1 + 1], n);
848 zgemm_("N", "C", &n1, &n2, k, &calpha, &a[a_dim1 + 1],
849 lda, &a[n2 + a_dim1], lda, &cbeta, &c__[1], n);
853 /* N is odd, TRANSR = 'N', UPLO = 'U', and TRANS = 'C' */
855 zherk_("L", "C", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
857 zherk_("U", "C", &n2, k, alpha, &a[n2 * a_dim1 + 1], lda,
858 beta, &c__[n1 + 1], n);
859 zgemm_("C", "N", &n1, &n2, k, &calpha, &a[a_dim1 + 1],
860 lda, &a[n2 * a_dim1 + 1], lda, &cbeta, &c__[1], n);
868 /* N is odd, and TRANSR = 'C' */
872 /* N is odd, TRANSR = 'C', and UPLO = 'L' */
876 /* N is odd, TRANSR = 'C', UPLO = 'L', and TRANS = 'N' */
878 zherk_("U", "N", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
880 zherk_("L", "N", &n2, k, alpha, &a[n1 + 1 + a_dim1], lda,
882 zgemm_("N", "C", &n1, &n2, k, &calpha, &a[a_dim1 + 1],
883 lda, &a[n1 + 1 + a_dim1], lda, &cbeta, &c__[n1 *
888 /* N is odd, TRANSR = 'C', UPLO = 'L', and TRANS = 'C' */
890 zherk_("U", "C", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
892 zherk_("L", "C", &n2, k, alpha, &a[(n1 + 1) * a_dim1 + 1],
893 lda, beta, &c__[2], &n1);
894 zgemm_("C", "N", &n1, &n2, k, &calpha, &a[a_dim1 + 1],
895 lda, &a[(n1 + 1) * a_dim1 + 1], lda, &cbeta, &c__[
902 /* N is odd, TRANSR = 'C', and UPLO = 'U' */
906 /* N is odd, TRANSR = 'C', UPLO = 'U', and TRANS = 'N' */
908 zherk_("U", "N", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
909 &c__[n2 * n2 + 1], &n2);
910 zherk_("L", "N", &n2, k, alpha, &a[n1 + 1 + a_dim1], lda,
911 beta, &c__[n1 * n2 + 1], &n2);
912 zgemm_("N", "C", &n2, &n1, k, &calpha, &a[n1 + 1 + a_dim1]
913 , lda, &a[a_dim1 + 1], lda, &cbeta, &c__[1], &n2);
917 /* N is odd, TRANSR = 'C', UPLO = 'U', and TRANS = 'C' */
919 zherk_("U", "C", &n1, k, alpha, &a[a_dim1 + 1], lda, beta,
920 &c__[n2 * n2 + 1], &n2);
921 zherk_("L", "C", &n2, k, alpha, &a[(n1 + 1) * a_dim1 + 1],
922 lda, beta, &c__[n1 * n2 + 1], &n2);
923 zgemm_("C", "N", &n2, &n1, k, &calpha, &a[(n1 + 1) *
924 a_dim1 + 1], lda, &a[a_dim1 + 1], lda, &cbeta, &
939 /* N is even and TRANSR = 'N' */
943 /* N is even, TRANSR = 'N', and UPLO = 'L' */
947 /* N is even, TRANSR = 'N', UPLO = 'L', and TRANS = 'N' */
950 zherk_("L", "N", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
953 zherk_("U", "N", &nk, k, alpha, &a[nk + 1 + a_dim1], lda,
954 beta, &c__[1], &i__1);
956 zgemm_("N", "C", &nk, &nk, k, &calpha, &a[nk + 1 + a_dim1]
957 , lda, &a[a_dim1 + 1], lda, &cbeta, &c__[nk + 2],
962 /* N is even, TRANSR = 'N', UPLO = 'L', and TRANS = 'C' */
965 zherk_("L", "C", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
968 zherk_("U", "C", &nk, k, alpha, &a[(nk + 1) * a_dim1 + 1],
969 lda, beta, &c__[1], &i__1);
971 zgemm_("C", "N", &nk, &nk, k, &calpha, &a[(nk + 1) *
972 a_dim1 + 1], lda, &a[a_dim1 + 1], lda, &cbeta, &
979 /* N is even, TRANSR = 'N', and UPLO = 'U' */
983 /* N is even, TRANSR = 'N', UPLO = 'U', and TRANS = 'N' */
986 zherk_("L", "N", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
987 &c__[nk + 2], &i__1);
989 zherk_("U", "N", &nk, k, alpha, &a[nk + 1 + a_dim1], lda,
990 beta, &c__[nk + 1], &i__1);
992 zgemm_("N", "C", &nk, &nk, k, &calpha, &a[a_dim1 + 1],
993 lda, &a[nk + 1 + a_dim1], lda, &cbeta, &c__[1], &
998 /* N is even, TRANSR = 'N', UPLO = 'U', and TRANS = 'C' */
1001 zherk_("L", "C", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
1002 &c__[nk + 2], &i__1);
1004 zherk_("U", "C", &nk, k, alpha, &a[(nk + 1) * a_dim1 + 1],
1005 lda, beta, &c__[nk + 1], &i__1);
1007 zgemm_("C", "N", &nk, &nk, k, &calpha, &a[a_dim1 + 1],
1008 lda, &a[(nk + 1) * a_dim1 + 1], lda, &cbeta, &c__[
1017 /* N is even, and TRANSR = 'C' */
1021 /* N is even, TRANSR = 'C', and UPLO = 'L' */
1025 /* N is even, TRANSR = 'C', UPLO = 'L', and TRANS = 'N' */
1027 zherk_("U", "N", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
1029 zherk_("L", "N", &nk, k, alpha, &a[nk + 1 + a_dim1], lda,
1030 beta, &c__[1], &nk);
1031 zgemm_("N", "C", &nk, &nk, k, &calpha, &a[a_dim1 + 1],
1032 lda, &a[nk + 1 + a_dim1], lda, &cbeta, &c__[(nk +
1037 /* N is even, TRANSR = 'C', UPLO = 'L', and TRANS = 'C' */
1039 zherk_("U", "C", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
1041 zherk_("L", "C", &nk, k, alpha, &a[(nk + 1) * a_dim1 + 1],
1042 lda, beta, &c__[1], &nk);
1043 zgemm_("C", "N", &nk, &nk, k, &calpha, &a[a_dim1 + 1],
1044 lda, &a[(nk + 1) * a_dim1 + 1], lda, &cbeta, &c__[
1045 (nk + 1) * nk + 1], &nk);
1051 /* N is even, TRANSR = 'C', and UPLO = 'U' */
1055 /* N is even, TRANSR = 'C', UPLO = 'U', and TRANS = 'N' */
1057 zherk_("U", "N", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
1058 &c__[nk * (nk + 1) + 1], &nk);
1059 zherk_("L", "N", &nk, k, alpha, &a[nk + 1 + a_dim1], lda,
1060 beta, &c__[nk * nk + 1], &nk);
1061 zgemm_("N", "C", &nk, &nk, k, &calpha, &a[nk + 1 + a_dim1]
1062 , lda, &a[a_dim1 + 1], lda, &cbeta, &c__[1], &nk);
1066 /* N is even, TRANSR = 'C', UPLO = 'U', and TRANS = 'C' */
1068 zherk_("U", "C", &nk, k, alpha, &a[a_dim1 + 1], lda, beta,
1069 &c__[nk * (nk + 1) + 1], &nk);
1070 zherk_("L", "C", &nk, k, alpha, &a[(nk + 1) * a_dim1 + 1],
1071 lda, beta, &c__[nk * nk + 1], &nk);
1072 zgemm_("C", "N", &nk, &nk, k, &calpha, &a[(nk + 1) *
1073 a_dim1 + 1], lda, &a[a_dim1 + 1], lda, &cbeta, &