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(_Fcomplex x, integer n) {
296 _Fcomplex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1]=1/x._Val[1];
300 if(u & 01) pow = _FCmulcc(pow,x) ;
301 if(u >>= 1) x = _FCmulcc(x,x);
308 static _Complex float cpow_ui(_Complex float x, integer n) {
309 _Complex float pow=1.0; unsigned long int u;
311 if(n < 0) n = -n, x = 1/x;
322 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
323 _Dcomplex pow={1.0,0.0}; unsigned long int u;
325 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
327 if(u & 01) pow = _Cmulcc(pow,x);
328 if(u >>= 1) x = _Cmulcc(x,x);
335 static _Complex double zpow_ui(_Complex double x, integer n) {
336 _Complex double pow=1.0; unsigned long int u;
338 if(n < 0) n = -n, x = 1/x;
348 static integer pow_ii(integer x, integer n) {
349 integer pow; unsigned long int u;
351 if (n == 0 || x == 1) pow = 1;
352 else if (x != -1) pow = x == 0 ? 1/x : 0;
355 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
365 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
367 double m; integer i, mi;
368 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
369 if (w[i-1]>m) mi=i ,m=w[i-1];
372 static integer smaxloc_(float *w, integer s, integer e, integer *n)
374 float m; integer i, mi;
375 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
376 if (w[i-1]>m) mi=i ,m=w[i-1];
379 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
380 integer n = *n_, incx = *incx_, incy = *incy_, i;
382 _Fcomplex zdotc = {0.0, 0.0};
383 if (incx == 1 && incy == 1) {
384 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
385 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
386 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
389 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
390 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
391 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
397 _Complex float zdotc = 0.0;
398 if (incx == 1 && incy == 1) {
399 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
400 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
403 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
404 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
410 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
411 integer n = *n_, incx = *incx_, incy = *incy_, i;
413 _Dcomplex zdotc = {0.0, 0.0};
414 if (incx == 1 && incy == 1) {
415 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
416 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
417 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
420 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
421 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
422 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
428 _Complex double zdotc = 0.0;
429 if (incx == 1 && incy == 1) {
430 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
431 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
434 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
435 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
441 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
442 integer n = *n_, incx = *incx_, incy = *incy_, i;
444 _Fcomplex zdotc = {0.0, 0.0};
445 if (incx == 1 && incy == 1) {
446 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
447 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
448 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
451 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
452 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
453 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
459 _Complex float zdotc = 0.0;
460 if (incx == 1 && incy == 1) {
461 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
462 zdotc += Cf(&x[i]) * Cf(&y[i]);
465 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
466 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
472 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
473 integer n = *n_, incx = *incx_, incy = *incy_, i;
475 _Dcomplex zdotc = {0.0, 0.0};
476 if (incx == 1 && incy == 1) {
477 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
478 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
479 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
482 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
483 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
484 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
490 _Complex double zdotc = 0.0;
491 if (incx == 1 && incy == 1) {
492 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
493 zdotc += Cd(&x[i]) * Cd(&y[i]);
496 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
497 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
503 /* -- translated by f2c (version 20000121).
504 You must link the resulting object file with the libraries:
505 -lf2c -lm (in that order)
511 /* Table of constant values */
513 static complex c_b1 = {1.f,0.f};
514 static integer c__2 = 2;
516 /* > \brief \b CLAESY computes the eigenvalues and eigenvectors of a 2-by-2 complex symmetric matrix. */
518 /* =========== DOCUMENTATION =========== */
520 /* Online html documentation available at */
521 /* http://www.netlib.org/lapack/explore-html/ */
524 /* > Download CLAESY + dependencies */
525 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/claesy.
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/claesy.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/claesy.
539 /* SUBROUTINE CLAESY( A, B, C, RT1, RT2, EVSCAL, CS1, SN1 ) */
541 /* COMPLEX A, B, C, CS1, EVSCAL, RT1, RT2, SN1 */
544 /* > \par Purpose: */
549 /* > CLAESY computes the eigendecomposition of a 2-by-2 symmetric matrix */
550 /* > ( ( A, B );( B, C ) ) */
551 /* > provided the norm of the matrix of eigenvectors is larger than */
552 /* > some threshold value. */
554 /* > RT1 is the eigenvalue of larger absolute value, and RT2 of */
555 /* > smaller absolute value. If the eigenvectors are computed, then */
556 /* > on return ( CS1, SN1 ) is the unit eigenvector for RT1, hence */
558 /* > [ CS1 SN1 ] . [ A B ] . [ CS1 -SN1 ] = [ RT1 0 ] */
559 /* > [ -SN1 CS1 ] [ B C ] [ SN1 CS1 ] [ 0 RT2 ] */
568 /* > The ( 1, 1 ) element of input matrix. */
574 /* > The ( 1, 2 ) element of input matrix. The ( 2, 1 ) element */
575 /* > is also given by B, since the 2-by-2 matrix is symmetric. */
581 /* > The ( 2, 2 ) element of input matrix. */
584 /* > \param[out] RT1 */
586 /* > RT1 is COMPLEX */
587 /* > The eigenvalue of larger modulus. */
590 /* > \param[out] RT2 */
592 /* > RT2 is COMPLEX */
593 /* > The eigenvalue of smaller modulus. */
596 /* > \param[out] EVSCAL */
598 /* > EVSCAL is COMPLEX */
599 /* > The complex value by which the eigenvector matrix was scaled */
600 /* > to make it orthonormal. If EVSCAL is zero, the eigenvectors */
601 /* > were not computed. This means one of two things: the 2-by-2 */
602 /* > matrix could not be diagonalized, or the norm of the matrix */
603 /* > of eigenvectors before scaling was larger than the threshold */
604 /* > value THRESH (set below). */
607 /* > \param[out] CS1 */
609 /* > CS1 is COMPLEX */
612 /* > \param[out] SN1 */
614 /* > SN1 is COMPLEX */
615 /* > If EVSCAL .NE. 0, ( CS1, SN1 ) is the unit right eigenvector */
622 /* > \author Univ. of Tennessee */
623 /* > \author Univ. of California Berkeley */
624 /* > \author Univ. of Colorado Denver */
625 /* > \author NAG Ltd. */
627 /* > \date December 2016 */
629 /* > \ingroup complexSYauxiliary */
631 /* ===================================================================== */
632 /* Subroutine */ int claesy_(complex *a, complex *b, complex *c__, complex *
633 rt1, complex *rt2, complex *evscal, complex *cs1, complex *sn1)
635 /* System generated locals */
637 complex q__1, q__2, q__3, q__4, q__5, q__6, q__7;
639 /* Local variables */
646 /* -- LAPACK auxiliary routine (version 3.7.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 /* ===================================================================== */
656 /* Special case: The matrix is actually diagonal. */
657 /* To avoid divide by zero later, we treat this case separately. */
659 if (c_abs(b) == 0.f) {
660 rt1->r = a->r, rt1->i = a->i;
661 rt2->r = c__->r, rt2->i = c__->i;
662 if (c_abs(rt1) < c_abs(rt2)) {
663 tmp.r = rt1->r, tmp.i = rt1->i;
664 rt1->r = rt2->r, rt1->i = rt2->i;
665 rt2->r = tmp.r, rt2->i = tmp.i;
666 cs1->r = 0.f, cs1->i = 0.f;
667 sn1->r = 1.f, sn1->i = 0.f;
669 cs1->r = 1.f, cs1->i = 0.f;
670 sn1->r = 0.f, sn1->i = 0.f;
674 /* Compute the eigenvalues and eigenvectors. */
675 /* The characteristic equation is */
676 /* lambda **2 - (A+C) lambda + (A*C - B*B) */
677 /* and we solve it using the quadratic formula. */
679 q__2.r = a->r + c__->r, q__2.i = a->i + c__->i;
680 q__1.r = q__2.r * .5f, q__1.i = q__2.i * .5f;
681 s.r = q__1.r, s.i = q__1.i;
682 q__2.r = a->r - c__->r, q__2.i = a->i - c__->i;
683 q__1.r = q__2.r * .5f, q__1.i = q__2.i * .5f;
684 t.r = q__1.r, t.i = q__1.i;
686 /* Take the square root carefully to avoid over/under flow. */
690 z__ = f2cmax(babs,tabs);
692 q__5.r = t.r / z__, q__5.i = t.i / z__;
693 pow_ci(&q__4, &q__5, &c__2);
694 q__7.r = b->r / z__, q__7.i = b->i / z__;
695 pow_ci(&q__6, &q__7, &c__2);
696 q__3.r = q__4.r + q__6.r, q__3.i = q__4.i + q__6.i;
697 c_sqrt(&q__2, &q__3);
698 q__1.r = z__ * q__2.r, q__1.i = z__ * q__2.i;
699 t.r = q__1.r, t.i = q__1.i;
702 /* Compute the two eigenvalues. RT1 and RT2 are exchanged */
703 /* if necessary so that RT1 will have the greater magnitude. */
705 q__1.r = s.r + t.r, q__1.i = s.i + t.i;
706 rt1->r = q__1.r, rt1->i = q__1.i;
707 q__1.r = s.r - t.r, q__1.i = s.i - t.i;
708 rt2->r = q__1.r, rt2->i = q__1.i;
709 if (c_abs(rt1) < c_abs(rt2)) {
710 tmp.r = rt1->r, tmp.i = rt1->i;
711 rt1->r = rt2->r, rt1->i = rt2->i;
712 rt2->r = tmp.r, rt2->i = tmp.i;
715 /* Choose CS1 = 1 and SN1 to satisfy the first equation, then */
716 /* scale the components of this eigenvector so that the matrix */
717 /* of eigenvectors X satisfies X * X**T = I . (No scaling is */
718 /* done if the norm of the eigenvalue matrix is less than THRESH.) */
720 q__2.r = rt1->r - a->r, q__2.i = rt1->i - a->i;
721 c_div(&q__1, &q__2, b);
722 sn1->r = q__1.r, sn1->i = q__1.i;
725 /* Computing 2nd power */
728 q__5.r = sn1->r / tabs, q__5.i = sn1->i / tabs;
729 pow_ci(&q__4, &q__5, &c__2);
730 q__3.r = r__1 + q__4.r, q__3.i = q__4.i;
731 c_sqrt(&q__2, &q__3);
732 q__1.r = tabs * q__2.r, q__1.i = tabs * q__2.i;
733 t.r = q__1.r, t.i = q__1.i;
735 q__3.r = sn1->r * sn1->r - sn1->i * sn1->i, q__3.i = sn1->r *
736 sn1->i + sn1->i * sn1->r;
737 q__2.r = q__3.r + 1.f, q__2.i = q__3.i + 0.f;
738 c_sqrt(&q__1, &q__2);
739 t.r = q__1.r, t.i = q__1.i;
743 c_div(&q__1, &c_b1, &t);
744 evscal->r = q__1.r, evscal->i = q__1.i;
745 cs1->r = evscal->r, cs1->i = evscal->i;
746 q__1.r = sn1->r * evscal->r - sn1->i * evscal->i, q__1.i = sn1->r
747 * evscal->i + sn1->i * evscal->r;
748 sn1->r = q__1.r, sn1->i = q__1.i;
750 evscal->r = 0.f, evscal->i = 0.f;