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]/Cd(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 ZLA_GBAMV performs a matrix-vector operation to calculate error bounds. */
515 /* =========== DOCUMENTATION =========== */
517 /* Online html documentation available at */
518 /* http://www.netlib.org/lapack/explore-html/ */
521 /* > Download ZLA_GBAMV + dependencies */
522 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zla_gba
525 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zla_gba
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zla_gba
536 /* SUBROUTINE ZLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X, */
537 /* INCX, BETA, Y, INCY ) */
539 /* DOUBLE PRECISION ALPHA, BETA */
540 /* INTEGER INCX, INCY, LDAB, M, N, KL, KU, TRANS */
541 /* COMPLEX*16 AB( LDAB, * ), X( * ) */
542 /* DOUBLE PRECISION Y( * ) */
545 /* > \par Purpose: */
550 /* > ZLA_GBAMV performs one of the matrix-vector operations */
552 /* > y := alpha*abs(A)*abs(x) + beta*abs(y), */
553 /* > or y := alpha*abs(A)**T*abs(x) + beta*abs(y), */
555 /* > where alpha and beta are scalars, x and y are vectors and A is an */
556 /* > m by n matrix. */
558 /* > This function is primarily used in calculating error bounds. */
559 /* > To protect against underflow during evaluation, components in */
560 /* > the resulting vector are perturbed away from zero by (N+1) */
561 /* > times the underflow threshold. To prevent unnecessarily large */
562 /* > errors for block-structure embedded in general matrices, */
563 /* > "symbolically" zero components are not perturbed. A zero */
564 /* > entry is considered "symbolic" if all multiplications involved */
565 /* > in computing that entry have at least one zero multiplicand. */
571 /* > \param[in] TRANS */
573 /* > TRANS is INTEGER */
574 /* > On entry, TRANS specifies the operation to be performed as */
577 /* > BLAS_NO_TRANS y := alpha*abs(A)*abs(x) + beta*abs(y) */
578 /* > BLAS_TRANS y := alpha*abs(A**T)*abs(x) + beta*abs(y) */
579 /* > BLAS_CONJ_TRANS y := alpha*abs(A**T)*abs(x) + beta*abs(y) */
581 /* > Unchanged on exit. */
587 /* > On entry, M specifies the number of rows of the matrix A. */
588 /* > M must be at least zero. */
589 /* > Unchanged on exit. */
595 /* > On entry, N specifies the number of columns of the matrix A. */
596 /* > N must be at least zero. */
597 /* > Unchanged on exit. */
600 /* > \param[in] KL */
602 /* > KL is INTEGER */
603 /* > The number of subdiagonals within the band of A. KL >= 0. */
606 /* > \param[in] KU */
608 /* > KU is INTEGER */
609 /* > The number of superdiagonals within the band of A. KU >= 0. */
612 /* > \param[in] ALPHA */
614 /* > ALPHA is DOUBLE PRECISION */
615 /* > On entry, ALPHA specifies the scalar alpha. */
616 /* > Unchanged on exit. */
619 /* > \param[in] AB */
621 /* > AB is COMPLEX*16 array, dimension ( LDAB, n ) */
622 /* > Before entry, the leading m by n part of the array AB must */
623 /* > contain the matrix of coefficients. */
624 /* > Unchanged on exit. */
627 /* > \param[in] LDAB */
629 /* > LDAB is INTEGER */
630 /* > On entry, LDAB specifies the first dimension of AB as declared */
631 /* > in the calling (sub) program. LDAB must be at least */
632 /* > f2cmax( 1, m ). */
633 /* > Unchanged on exit. */
638 /* > X is COMPLEX*16 array, dimension */
639 /* > ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' */
641 /* > ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. */
642 /* > Before entry, the incremented array X must contain the */
644 /* > Unchanged on exit. */
647 /* > \param[in] INCX */
649 /* > INCX is INTEGER */
650 /* > On entry, INCX specifies the increment for the elements of */
651 /* > X. INCX must not be zero. */
652 /* > Unchanged on exit. */
655 /* > \param[in] BETA */
657 /* > BETA is DOUBLE PRECISION */
658 /* > On entry, BETA specifies the scalar beta. When BETA is */
659 /* > supplied as zero then Y need not be set on input. */
660 /* > Unchanged on exit. */
663 /* > \param[in,out] Y */
665 /* > Y is DOUBLE PRECISION array, dimension */
666 /* > ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' */
668 /* > ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. */
669 /* > Before entry with BETA non-zero, the incremented array Y */
670 /* > must contain the vector y. On exit, Y is overwritten by the */
671 /* > updated vector y. */
674 /* > \param[in] INCY */
676 /* > INCY is INTEGER */
677 /* > On entry, INCY specifies the increment for the elements of */
678 /* > Y. INCY must not be zero. */
679 /* > Unchanged on exit. */
681 /* > Level 2 Blas routine. */
687 /* > \author Univ. of Tennessee */
688 /* > \author Univ. of California Berkeley */
689 /* > \author Univ. of Colorado Denver */
690 /* > \author NAG Ltd. */
692 /* > \date June 2017 */
694 /* > \ingroup complex16GBcomputational */
696 /* ===================================================================== */
697 /* Subroutine */ int zla_gbamv_(integer *trans, integer *m, integer *n,
698 integer *kl, integer *ku, doublereal *alpha, doublecomplex *ab,
699 integer *ldab, doublecomplex *x, integer *incx, doublereal *beta,
700 doublereal *y, integer *incy)
702 /* System generated locals */
703 integer ab_dim1, ab_offset, i__1, i__2, i__3, i__4;
704 doublereal d__1, d__2;
706 /* Local variables */
710 extern integer ilatrans_(char *);
715 extern doublereal dlamch_(char *);
716 integer iy, jx, kx, ky;
717 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
720 /* -- LAPACK computational routine (version 3.7.1) -- */
721 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
722 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
726 /* ===================================================================== */
729 /* Test the input parameters. */
731 /* Parameter adjustments */
733 ab_offset = 1 + ab_dim1 * 1;
740 if (! (*trans == ilatrans_("N") || *trans == ilatrans_("T") || *trans == ilatrans_("C"))) {
746 } else if (*kl < 0 || *kl > *m - 1) {
748 } else if (*ku < 0 || *ku > *n - 1) {
750 } else if (*ldab < *kl + *ku + 1) {
752 } else if (*incx == 0) {
754 } else if (*incy == 0) {
758 xerbla_("ZLA_GBAMV ", &info, (ftnlen)10);
762 /* Quick return if possible. */
764 if (*m == 0 || *n == 0 || *alpha == 0. && *beta == 1.) {
768 /* Set LENX and LENY, the lengths of the vectors x and y, and set */
769 /* up the start points in X and Y. */
771 if (*trans == ilatrans_("N")) {
781 kx = 1 - (lenx - 1) * *incx;
786 ky = 1 - (leny - 1) * *incy;
789 /* Set SAFE1 essentially to be the underflow threshold times the */
790 /* number of additions in each row. */
792 safe1 = dlamch_("Safe minimum");
793 safe1 = (*n + 1) * safe1;
795 /* Form y := alpha*abs(A)*abs(x) + beta*abs(y). */
797 /* The O(M*N) SYMB_ZERO tests could be replaced by O(N) queries to */
798 /* the inexact flag. Still doesn't help change the iteration order */
805 if (*trans == ilatrans_("N")) {
807 for (i__ = 1; i__ <= i__1; ++i__) {
811 } else if (y[iy] == 0.) {
814 symb_zero__ = FALSE_;
815 y[iy] = *beta * (d__1 = y[iy], abs(d__1));
822 i__3 = f2cmin(i__4,lenx);
823 for (j = f2cmax(i__2,1); j <= i__3; ++j) {
824 i__2 = kd + i__ - j + j * ab_dim1;
825 temp = (d__1 = ab[i__2].r, abs(d__1)) + (d__2 =
826 d_imag(&ab[kd + i__ - j + j * ab_dim1]), abs(
829 symb_zero__ = symb_zero__ && (x[i__2].r == 0. && x[
830 i__2].i == 0. || temp == 0.);
832 y[iy] += *alpha * ((d__1 = x[i__2].r, abs(d__1)) + (
833 d__2 = d_imag(&x[j]), abs(d__2))) * temp;
837 y[iy] += d_sign(&safe1, &y[iy]);
843 for (i__ = 1; i__ <= i__1; ++i__) {
847 } else if (y[iy] == 0.) {
850 symb_zero__ = FALSE_;
851 y[iy] = *beta * (d__1 = y[iy], abs(d__1));
858 i__2 = f2cmin(i__4,lenx);
859 for (j = f2cmax(i__3,1); j <= i__2; ++j) {
860 i__3 = ke - i__ + j + i__ * ab_dim1;
861 temp = (d__1 = ab[i__3].r, abs(d__1)) + (d__2 =
862 d_imag(&ab[ke - i__ + j + i__ * ab_dim1]),
865 symb_zero__ = symb_zero__ && (x[i__3].r == 0. && x[
866 i__3].i == 0. || temp == 0.);
868 y[iy] += *alpha * ((d__1 = x[i__3].r, abs(d__1)) + (
869 d__2 = d_imag(&x[j]), abs(d__2))) * temp;
873 y[iy] += d_sign(&safe1, &y[iy]);
879 if (*trans == ilatrans_("N")) {
881 for (i__ = 1; i__ <= i__1; ++i__) {
885 } else if (y[iy] == 0.) {
888 symb_zero__ = FALSE_;
889 y[iy] = *beta * (d__1 = y[iy], abs(d__1));
897 i__3 = f2cmin(i__4,lenx);
898 for (j = f2cmax(i__2,1); j <= i__3; ++j) {
899 i__2 = kd + i__ - j + j * ab_dim1;
900 temp = (d__1 = ab[i__2].r, abs(d__1)) + (d__2 =
901 d_imag(&ab[kd + i__ - j + j * ab_dim1]), abs(
904 symb_zero__ = symb_zero__ && (x[i__2].r == 0. && x[
905 i__2].i == 0. || temp == 0.);
907 y[iy] += *alpha * ((d__1 = x[i__2].r, abs(d__1)) + (
908 d__2 = d_imag(&x[jx]), abs(d__2))) * temp;
913 y[iy] += d_sign(&safe1, &y[iy]);
919 for (i__ = 1; i__ <= i__1; ++i__) {
923 } else if (y[iy] == 0.) {
926 symb_zero__ = FALSE_;
927 y[iy] = *beta * (d__1 = y[iy], abs(d__1));
935 i__2 = f2cmin(i__4,lenx);
936 for (j = f2cmax(i__3,1); j <= i__2; ++j) {
937 i__3 = ke - i__ + j + i__ * ab_dim1;
938 temp = (d__1 = ab[i__3].r, abs(d__1)) + (d__2 =
939 d_imag(&ab[ke - i__ + j + i__ * ab_dim1]),
942 symb_zero__ = symb_zero__ && (x[i__3].r == 0. && x[
943 i__3].i == 0. || temp == 0.);
945 y[iy] += *alpha * ((d__1 = x[i__3].r, abs(d__1)) + (
946 d__2 = d_imag(&x[jx]), abs(d__2))) * temp;
951 y[iy] += d_sign(&safe1, &y[iy]);
960 /* End of ZLA_GBAMV */