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 CSPMV computes a matrix-vector product for complex vectors using a complex symmetric packed mat
516 /* =========== DOCUMENTATION =========== */
518 /* Online html documentation available at */
519 /* http://www.netlib.org/lapack/explore-html/ */
522 /* > Download CSPMV + dependencies */
523 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cspmv.f
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cspmv.f
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cspmv.f
537 /* SUBROUTINE CSPMV( UPLO, N, ALPHA, AP, X, INCX, BETA, Y, INCY ) */
540 /* INTEGER INCX, INCY, N */
541 /* COMPLEX ALPHA, BETA */
542 /* COMPLEX AP( * ), X( * ), Y( * ) */
545 /* > \par Purpose: */
550 /* > CSPMV performs the matrix-vector operation */
552 /* > y := alpha*A*x + beta*y, */
554 /* > where alpha and beta are scalars, x and y are n element vectors and */
555 /* > A is an n by n symmetric matrix, supplied in packed form. */
561 /* > \param[in] UPLO */
563 /* > UPLO is CHARACTER*1 */
564 /* > On entry, UPLO specifies whether the upper or lower */
565 /* > triangular part of the matrix A is supplied in the packed */
566 /* > array AP as follows: */
568 /* > UPLO = 'U' or 'u' The upper triangular part of A is */
569 /* > supplied in AP. */
571 /* > UPLO = 'L' or 'l' The lower triangular part of A is */
572 /* > supplied in AP. */
574 /* > Unchanged on exit. */
580 /* > On entry, N specifies the order of the matrix A. */
581 /* > N must be at least zero. */
582 /* > Unchanged on exit. */
585 /* > \param[in] ALPHA */
587 /* > ALPHA is COMPLEX */
588 /* > On entry, ALPHA specifies the scalar alpha. */
589 /* > Unchanged on exit. */
592 /* > \param[in] AP */
594 /* > AP is COMPLEX array, dimension at least */
595 /* > ( ( N*( N + 1 ) )/2 ). */
596 /* > Before entry, with UPLO = 'U' or 'u', the array AP must */
597 /* > contain the upper triangular part of the symmetric matrix */
598 /* > packed sequentially, column by column, so that AP( 1 ) */
599 /* > contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 1, 2 ) */
600 /* > and a( 2, 2 ) respectively, and so on. */
601 /* > Before entry, with UPLO = 'L' or 'l', the array AP must */
602 /* > contain the lower triangular part of the symmetric matrix */
603 /* > packed sequentially, column by column, so that AP( 1 ) */
604 /* > contains a( 1, 1 ), AP( 2 ) and AP( 3 ) contain a( 2, 1 ) */
605 /* > and a( 3, 1 ) respectively, and so on. */
606 /* > Unchanged on exit. */
611 /* > X is COMPLEX array, dimension at least */
612 /* > ( 1 + ( N - 1 )*abs( INCX ) ). */
613 /* > Before entry, the incremented array X must contain the N- */
614 /* > element vector x. */
615 /* > Unchanged on exit. */
618 /* > \param[in] INCX */
620 /* > INCX is INTEGER */
621 /* > On entry, INCX specifies the increment for the elements of */
622 /* > X. INCX must not be zero. */
623 /* > Unchanged on exit. */
626 /* > \param[in] BETA */
628 /* > BETA is COMPLEX */
629 /* > On entry, BETA specifies the scalar beta. When BETA is */
630 /* > supplied as zero then Y need not be set on input. */
631 /* > Unchanged on exit. */
634 /* > \param[in,out] Y */
636 /* > Y is COMPLEX array, dimension at least */
637 /* > ( 1 + ( N - 1 )*abs( INCY ) ). */
638 /* > Before entry, the incremented array Y must contain the n */
639 /* > element vector y. On exit, Y is overwritten by the updated */
643 /* > \param[in] INCY */
645 /* > INCY is INTEGER */
646 /* > On entry, INCY specifies the increment for the elements of */
647 /* > Y. INCY must not be zero. */
648 /* > Unchanged on exit. */
654 /* > \author Univ. of Tennessee */
655 /* > \author Univ. of California Berkeley */
656 /* > \author Univ. of Colorado Denver */
657 /* > \author NAG Ltd. */
659 /* > \date December 2016 */
661 /* > \ingroup complexOTHERauxiliary */
663 /* ===================================================================== */
664 /* Subroutine */ int cspmv_(char *uplo, integer *n, complex *alpha, complex *
665 ap, complex *x, integer *incx, complex *beta, complex *y, integer *
668 /* System generated locals */
669 integer i__1, i__2, i__3, i__4, i__5;
670 complex q__1, q__2, q__3, q__4;
672 /* Local variables */
674 complex temp1, temp2;
676 extern logical lsame_(char *, char *);
677 integer kk, ix, iy, jx, jy, kx, ky;
678 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
681 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
682 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
683 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
687 /* ===================================================================== */
690 /* Test the input parameters. */
692 /* Parameter adjustments */
699 if (! lsame_(uplo, "U") && ! lsame_(uplo, "L")) {
703 } else if (*incx == 0) {
705 } else if (*incy == 0) {
709 xerbla_("CSPMV ", &info, (ftnlen)6);
713 /* Quick return if possible. */
715 if (*n == 0 || alpha->r == 0.f && alpha->i == 0.f && (beta->r == 1.f &&
720 /* Set up the start points in X and Y. */
725 kx = 1 - (*n - 1) * *incx;
730 ky = 1 - (*n - 1) * *incy;
733 /* Start the operations. In this version the elements of the array AP */
734 /* are accessed sequentially with one pass through AP. */
736 /* First form y := beta*y. */
738 if (beta->r != 1.f || beta->i != 0.f) {
740 if (beta->r == 0.f && beta->i == 0.f) {
742 for (i__ = 1; i__ <= i__1; ++i__) {
744 y[i__2].r = 0.f, y[i__2].i = 0.f;
749 for (i__ = 1; i__ <= i__1; ++i__) {
752 q__1.r = beta->r * y[i__3].r - beta->i * y[i__3].i,
753 q__1.i = beta->r * y[i__3].i + beta->i * y[i__3]
755 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
761 if (beta->r == 0.f && beta->i == 0.f) {
763 for (i__ = 1; i__ <= i__1; ++i__) {
765 y[i__2].r = 0.f, y[i__2].i = 0.f;
771 for (i__ = 1; i__ <= i__1; ++i__) {
774 q__1.r = beta->r * y[i__3].r - beta->i * y[i__3].i,
775 q__1.i = beta->r * y[i__3].i + beta->i * y[i__3]
777 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
784 if (alpha->r == 0.f && alpha->i == 0.f) {
788 if (lsame_(uplo, "U")) {
790 /* Form y when AP contains the upper triangle. */
792 if (*incx == 1 && *incy == 1) {
794 for (j = 1; j <= i__1; ++j) {
796 q__1.r = alpha->r * x[i__2].r - alpha->i * x[i__2].i, q__1.i =
797 alpha->r * x[i__2].i + alpha->i * x[i__2].r;
798 temp1.r = q__1.r, temp1.i = q__1.i;
799 temp2.r = 0.f, temp2.i = 0.f;
802 for (i__ = 1; i__ <= i__2; ++i__) {
806 q__2.r = temp1.r * ap[i__5].r - temp1.i * ap[i__5].i,
807 q__2.i = temp1.r * ap[i__5].i + temp1.i * ap[i__5]
809 q__1.r = y[i__4].r + q__2.r, q__1.i = y[i__4].i + q__2.i;
810 y[i__3].r = q__1.r, y[i__3].i = q__1.i;
813 q__2.r = ap[i__3].r * x[i__4].r - ap[i__3].i * x[i__4].i,
814 q__2.i = ap[i__3].r * x[i__4].i + ap[i__3].i * x[
816 q__1.r = temp2.r + q__2.r, q__1.i = temp2.i + q__2.i;
817 temp2.r = q__1.r, temp2.i = q__1.i;
824 q__3.r = temp1.r * ap[i__4].r - temp1.i * ap[i__4].i, q__3.i =
825 temp1.r * ap[i__4].i + temp1.i * ap[i__4].r;
826 q__2.r = y[i__3].r + q__3.r, q__2.i = y[i__3].i + q__3.i;
827 q__4.r = alpha->r * temp2.r - alpha->i * temp2.i, q__4.i =
828 alpha->r * temp2.i + alpha->i * temp2.r;
829 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
830 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
838 for (j = 1; j <= i__1; ++j) {
840 q__1.r = alpha->r * x[i__2].r - alpha->i * x[i__2].i, q__1.i =
841 alpha->r * x[i__2].i + alpha->i * x[i__2].r;
842 temp1.r = q__1.r, temp1.i = q__1.i;
843 temp2.r = 0.f, temp2.i = 0.f;
847 for (k = kk; k <= i__2; ++k) {
851 q__2.r = temp1.r * ap[i__5].r - temp1.i * ap[i__5].i,
852 q__2.i = temp1.r * ap[i__5].i + temp1.i * ap[i__5]
854 q__1.r = y[i__4].r + q__2.r, q__1.i = y[i__4].i + q__2.i;
855 y[i__3].r = q__1.r, y[i__3].i = q__1.i;
858 q__2.r = ap[i__3].r * x[i__4].r - ap[i__3].i * x[i__4].i,
859 q__2.i = ap[i__3].r * x[i__4].i + ap[i__3].i * x[
861 q__1.r = temp2.r + q__2.r, q__1.i = temp2.i + q__2.i;
862 temp2.r = q__1.r, temp2.i = q__1.i;
870 q__3.r = temp1.r * ap[i__4].r - temp1.i * ap[i__4].i, q__3.i =
871 temp1.r * ap[i__4].i + temp1.i * ap[i__4].r;
872 q__2.r = y[i__3].r + q__3.r, q__2.i = y[i__3].i + q__3.i;
873 q__4.r = alpha->r * temp2.r - alpha->i * temp2.i, q__4.i =
874 alpha->r * temp2.i + alpha->i * temp2.r;
875 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
876 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
885 /* Form y when AP contains the lower triangle. */
887 if (*incx == 1 && *incy == 1) {
889 for (j = 1; j <= i__1; ++j) {
891 q__1.r = alpha->r * x[i__2].r - alpha->i * x[i__2].i, q__1.i =
892 alpha->r * x[i__2].i + alpha->i * x[i__2].r;
893 temp1.r = q__1.r, temp1.i = q__1.i;
894 temp2.r = 0.f, temp2.i = 0.f;
898 q__2.r = temp1.r * ap[i__4].r - temp1.i * ap[i__4].i, q__2.i =
899 temp1.r * ap[i__4].i + temp1.i * ap[i__4].r;
900 q__1.r = y[i__3].r + q__2.r, q__1.i = y[i__3].i + q__2.i;
901 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
904 for (i__ = j + 1; i__ <= i__2; ++i__) {
908 q__2.r = temp1.r * ap[i__5].r - temp1.i * ap[i__5].i,
909 q__2.i = temp1.r * ap[i__5].i + temp1.i * ap[i__5]
911 q__1.r = y[i__4].r + q__2.r, q__1.i = y[i__4].i + q__2.i;
912 y[i__3].r = q__1.r, y[i__3].i = q__1.i;
915 q__2.r = ap[i__3].r * x[i__4].r - ap[i__3].i * x[i__4].i,
916 q__2.i = ap[i__3].r * x[i__4].i + ap[i__3].i * x[
918 q__1.r = temp2.r + q__2.r, q__1.i = temp2.i + q__2.i;
919 temp2.r = q__1.r, temp2.i = q__1.i;
925 q__2.r = alpha->r * temp2.r - alpha->i * temp2.i, q__2.i =
926 alpha->r * temp2.i + alpha->i * temp2.r;
927 q__1.r = y[i__3].r + q__2.r, q__1.i = y[i__3].i + q__2.i;
928 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
936 for (j = 1; j <= i__1; ++j) {
938 q__1.r = alpha->r * x[i__2].r - alpha->i * x[i__2].i, q__1.i =
939 alpha->r * x[i__2].i + alpha->i * x[i__2].r;
940 temp1.r = q__1.r, temp1.i = q__1.i;
941 temp2.r = 0.f, temp2.i = 0.f;
945 q__2.r = temp1.r * ap[i__4].r - temp1.i * ap[i__4].i, q__2.i =
946 temp1.r * ap[i__4].i + temp1.i * ap[i__4].r;
947 q__1.r = y[i__3].r + q__2.r, q__1.i = y[i__3].i + q__2.i;
948 y[i__2].r = q__1.r, y[i__2].i = q__1.i;
952 for (k = kk + 1; k <= i__2; ++k) {
958 q__2.r = temp1.r * ap[i__5].r - temp1.i * ap[i__5].i,
959 q__2.i = temp1.r * ap[i__5].i + temp1.i * ap[i__5]
961 q__1.r = y[i__4].r + q__2.r, q__1.i = y[i__4].i + q__2.i;
962 y[i__3].r = q__1.r, y[i__3].i = q__1.i;
965 q__2.r = ap[i__3].r * x[i__4].r - ap[i__3].i * x[i__4].i,
966 q__2.i = ap[i__3].r * x[i__4].i + ap[i__3].i * x[
968 q__1.r = temp2.r + q__2.r, q__1.i = temp2.i + q__2.i;
969 temp2.r = q__1.r, temp2.i = q__1.i;
974 q__2.r = alpha->r * temp2.r - alpha->i * temp2.i, q__2.i =
975 alpha->r * temp2.i + alpha->i * temp2.r;
976 q__1.r = y[i__3].r + q__2.r, q__1.i = y[i__3].i + q__2.i;
977 y[i__2].r = q__1.r, y[i__2].i = q__1.i;