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 /* Table of constant values */
515 static complex c_b5 = {1.f,0.f};
517 /* > \brief \b CLARFGP generates an elementary reflector (Householder matrix) with non-negative beta. */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download CLARFGP + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/clarfgp
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/clarfgp
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/clarfgp
540 /* SUBROUTINE CLARFGP( N, ALPHA, X, INCX, TAU ) */
542 /* INTEGER INCX, N */
543 /* COMPLEX ALPHA, TAU */
547 /* > \par Purpose: */
552 /* > CLARFGP generates a complex elementary reflector H of order n, such */
555 /* > H**H * ( alpha ) = ( beta ), H**H * H = I. */
558 /* > where alpha and beta are scalars, beta is real and non-negative, and */
559 /* > x is an (n-1)-element complex vector. H is represented in the form */
561 /* > H = I - tau * ( 1 ) * ( 1 v**H ) , */
564 /* > where tau is a complex scalar and v is a complex (n-1)-element */
565 /* > vector. Note that H is not hermitian. */
567 /* > If the elements of x are all zero and alpha is real, then tau = 0 */
568 /* > and H is taken to be the unit matrix. */
577 /* > The order of the elementary reflector. */
580 /* > \param[in,out] ALPHA */
582 /* > ALPHA is COMPLEX */
583 /* > On entry, the value alpha. */
584 /* > On exit, it is overwritten with the value beta. */
587 /* > \param[in,out] X */
589 /* > X is COMPLEX array, dimension */
590 /* > (1+(N-2)*abs(INCX)) */
591 /* > On entry, the vector x. */
592 /* > On exit, it is overwritten with the vector v. */
595 /* > \param[in] INCX */
597 /* > INCX is INTEGER */
598 /* > The increment between elements of X. INCX > 0. */
601 /* > \param[out] TAU */
603 /* > TAU is COMPLEX */
604 /* > The value tau. */
610 /* > \author Univ. of Tennessee */
611 /* > \author Univ. of California Berkeley */
612 /* > \author Univ. of Colorado Denver */
613 /* > \author NAG Ltd. */
615 /* > \date November 2017 */
617 /* > \ingroup complexOTHERauxiliary */
619 /* ===================================================================== */
620 /* Subroutine */ int clarfgp_(integer *n, complex *alpha, complex *x, integer
623 /* System generated locals */
628 /* Local variables */
631 extern /* Subroutine */ int cscal_(integer *, complex *, complex *,
636 extern real scnrm2_(integer *, complex *, integer *), slapy2_(real *,
637 real *), slapy3_(real *, real *, real *);
638 extern /* Complex */ VOID cladiv_(complex *, complex *, complex *);
639 extern real slamch_(char *);
640 extern /* Subroutine */ int csscal_(integer *, real *, complex *, integer
646 /* -- LAPACK auxiliary routine (version 3.8.0) -- */
647 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
648 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
652 /* ===================================================================== */
655 /* Parameter adjustments */
660 tau->r = 0.f, tau->i = 0.f;
665 xnorm = scnrm2_(&i__1, &x[1], incx);
667 alphi = r_imag(alpha);
671 /* H = [1-alpha/abs(alpha) 0; 0 I], sign chosen so ALPHA >= 0. */
675 /* When TAU.eq.ZERO, the vector is special-cased to be */
676 /* all zeros in the application routines. We do not need */
678 tau->r = 0.f, tau->i = 0.f;
680 /* However, the application routines rely on explicit */
681 /* zero checks when TAU.ne.ZERO, and we must clear X. */
682 tau->r = 2.f, tau->i = 0.f;
684 for (j = 1; j <= i__1; ++j) {
685 i__2 = (j - 1) * *incx + 1;
686 x[i__2].r = 0.f, x[i__2].i = 0.f;
688 q__1.r = -alpha->r, q__1.i = -alpha->i;
689 alpha->r = q__1.r, alpha->i = q__1.i;
692 /* Only "reflecting" the diagonal entry to be real and non-negative. */
693 xnorm = slapy2_(&alphr, &alphi);
694 r__1 = 1.f - alphr / xnorm;
695 r__2 = -alphi / xnorm;
696 q__1.r = r__1, q__1.i = r__2;
697 tau->r = q__1.r, tau->i = q__1.i;
699 for (j = 1; j <= i__1; ++j) {
700 i__2 = (j - 1) * *incx + 1;
701 x[i__2].r = 0.f, x[i__2].i = 0.f;
703 alpha->r = xnorm, alpha->i = 0.f;
709 r__1 = slapy3_(&alphr, &alphi, &xnorm);
710 beta = r_sign(&r__1, &alphr);
711 smlnum = slamch_("S") / slamch_("E");
712 bignum = 1.f / smlnum;
715 if (abs(beta) < smlnum) {
717 /* XNORM, BETA may be inaccurate; scale X and recompute them */
722 csscal_(&i__1, &bignum, &x[1], incx);
726 if (abs(beta) < smlnum && knt < 20) {
730 /* New BETA is at most 1, at least SMLNUM */
733 xnorm = scnrm2_(&i__1, &x[1], incx);
734 q__1.r = alphr, q__1.i = alphi;
735 alpha->r = q__1.r, alpha->i = q__1.i;
736 r__1 = slapy3_(&alphr, &alphi, &xnorm);
737 beta = r_sign(&r__1, &alphr);
739 savealpha.r = alpha->r, savealpha.i = alpha->i;
740 q__1.r = alpha->r + beta, q__1.i = alpha->i;
741 alpha->r = q__1.r, alpha->i = q__1.i;
744 q__2.r = -alpha->r, q__2.i = -alpha->i;
745 q__1.r = q__2.r / beta, q__1.i = q__2.i / beta;
746 tau->r = q__1.r, tau->i = q__1.i;
748 alphr = alphi * (alphi / alpha->r);
749 alphr += xnorm * (xnorm / alpha->r);
751 r__2 = -alphi / beta;
752 q__1.r = r__1, q__1.i = r__2;
753 tau->r = q__1.r, tau->i = q__1.i;
755 q__1.r = r__1, q__1.i = alphi;
756 alpha->r = q__1.r, alpha->i = q__1.i;
758 cladiv_(&q__1, &c_b5, alpha);
759 alpha->r = q__1.r, alpha->i = q__1.i;
761 if (c_abs(tau) <= smlnum) {
763 /* In the case where the computed TAU ends up being a denormalized number, */
764 /* it loses relative accuracy. This is a BIG problem. Solution: flush TAU */
765 /* to ZERO (or TWO or whatever makes a nonnegative real number for BETA). */
767 /* (Bug report provided by Pat Quillen from MathWorks on Jul 29, 2009.) */
768 /* (Thanks Pat. Thanks MathWorks.) */
771 alphi = r_imag(&savealpha);
774 tau->r = 0.f, tau->i = 0.f;
776 tau->r = 2.f, tau->i = 0.f;
778 for (j = 1; j <= i__1; ++j) {
779 i__2 = (j - 1) * *incx + 1;
780 x[i__2].r = 0.f, x[i__2].i = 0.f;
782 q__1.r = -savealpha.r, q__1.i = -savealpha.i;
786 xnorm = slapy2_(&alphr, &alphi);
787 r__1 = 1.f - alphr / xnorm;
788 r__2 = -alphi / xnorm;
789 q__1.r = r__1, q__1.i = r__2;
790 tau->r = q__1.r, tau->i = q__1.i;
792 for (j = 1; j <= i__1; ++j) {
793 i__2 = (j - 1) * *incx + 1;
794 x[i__2].r = 0.f, x[i__2].i = 0.f;
801 /* This is the general case. */
804 cscal_(&i__1, alpha, &x[1], incx);
808 /* If BETA is subnormal, it may lose relative accuracy */
811 for (j = 1; j <= i__1; ++j) {
815 alpha->r = beta, alpha->i = 0.f;