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 integer c__1 = 1;
517 /* > \brief \b SLARFX applies an elementary reflector to a general rectangular matrix, with loop unrolling whe
518 n the reflector has order ≤ 10. */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download SLARFX + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slarfx.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slarfx.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slarfx.
541 /* SUBROUTINE SLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) */
544 /* INTEGER LDC, M, N */
546 /* REAL C( LDC, * ), V( * ), WORK( * ) */
549 /* > \par Purpose: */
554 /* > SLARFX applies a real elementary reflector H to a real m by n */
555 /* > matrix C, from either the left or the right. H is represented in the */
558 /* > H = I - tau * v * v**T */
560 /* > where tau is a real scalar and v is a real vector. */
562 /* > If tau = 0, then H is taken to be the unit matrix */
564 /* > This version uses inline code if H has order < 11. */
570 /* > \param[in] SIDE */
572 /* > SIDE is CHARACTER*1 */
573 /* > = 'L': form H * C */
574 /* > = 'R': form C * H */
580 /* > The number of rows of the matrix C. */
586 /* > The number of columns of the matrix C. */
591 /* > V is REAL array, dimension (M) if SIDE = 'L' */
592 /* > or (N) if SIDE = 'R' */
593 /* > The vector v in the representation of H. */
596 /* > \param[in] TAU */
599 /* > The value tau in the representation of H. */
602 /* > \param[in,out] C */
604 /* > C is REAL array, dimension (LDC,N) */
605 /* > On entry, the m by n matrix C. */
606 /* > On exit, C is overwritten by the matrix H * C if SIDE = 'L', */
607 /* > or C * H if SIDE = 'R'. */
610 /* > \param[in] LDC */
612 /* > LDC is INTEGER */
613 /* > The leading dimension of the array C. LDC >= (1,M). */
616 /* > \param[out] WORK */
618 /* > WORK is REAL array, dimension */
619 /* > (N) if SIDE = 'L' */
620 /* > or (M) if SIDE = 'R' */
621 /* > WORK is not referenced if H has order < 11. */
627 /* > \author Univ. of Tennessee */
628 /* > \author Univ. of California Berkeley */
629 /* > \author Univ. of Colorado Denver */
630 /* > \author NAG Ltd. */
632 /* > \date December 2016 */
634 /* > \ingroup realOTHERauxiliary */
636 /* ===================================================================== */
637 /* Subroutine */ int slarfx_(char *side, integer *m, integer *n, real *v,
638 real *tau, real *c__, integer *ldc, real *work)
640 /* System generated locals */
641 integer c_dim1, c_offset, i__1;
643 /* Local variables */
645 extern logical lsame_(char *, char *);
646 extern /* Subroutine */ int slarf_(char *, integer *, integer *, real *,
647 integer *, real *, real *, integer *, real *);
648 real t1, t2, t3, t4, t5, t6, t7, t8, t9, v1, v2, v3, v4, v5, v6, v7, v8,
652 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
653 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
654 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
658 /* ===================================================================== */
661 /* Parameter adjustments */
664 c_offset = 1 + c_dim1 * 1;
672 if (lsame_(side, "L")) {
674 /* Form H * C, where H has order m. */
689 /* Code for general M */
691 slarf_(side, m, n, &v[1], &c__1, tau, &c__[c_offset], ldc, &work[1]);
695 /* Special code for 1 x 1 Householder */
697 t1 = 1.f - *tau * v[1] * v[1];
699 for (j = 1; j <= i__1; ++j) {
700 c__[j * c_dim1 + 1] = t1 * c__[j * c_dim1 + 1];
706 /* Special code for 2 x 2 Householder */
713 for (j = 1; j <= i__1; ++j) {
714 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2];
715 c__[j * c_dim1 + 1] -= sum * t1;
716 c__[j * c_dim1 + 2] -= sum * t2;
722 /* Special code for 3 x 3 Householder */
731 for (j = 1; j <= i__1; ++j) {
732 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
734 c__[j * c_dim1 + 1] -= sum * t1;
735 c__[j * c_dim1 + 2] -= sum * t2;
736 c__[j * c_dim1 + 3] -= sum * t3;
742 /* Special code for 4 x 4 Householder */
753 for (j = 1; j <= i__1; ++j) {
754 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
755 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4];
756 c__[j * c_dim1 + 1] -= sum * t1;
757 c__[j * c_dim1 + 2] -= sum * t2;
758 c__[j * c_dim1 + 3] -= sum * t3;
759 c__[j * c_dim1 + 4] -= sum * t4;
765 /* Special code for 5 x 5 Householder */
778 for (j = 1; j <= i__1; ++j) {
779 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
780 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4] + v5 * c__[
782 c__[j * c_dim1 + 1] -= sum * t1;
783 c__[j * c_dim1 + 2] -= sum * t2;
784 c__[j * c_dim1 + 3] -= sum * t3;
785 c__[j * c_dim1 + 4] -= sum * t4;
786 c__[j * c_dim1 + 5] -= sum * t5;
792 /* Special code for 6 x 6 Householder */
807 for (j = 1; j <= i__1; ++j) {
808 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
809 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4] + v5 * c__[
810 j * c_dim1 + 5] + v6 * c__[j * c_dim1 + 6];
811 c__[j * c_dim1 + 1] -= sum * t1;
812 c__[j * c_dim1 + 2] -= sum * t2;
813 c__[j * c_dim1 + 3] -= sum * t3;
814 c__[j * c_dim1 + 4] -= sum * t4;
815 c__[j * c_dim1 + 5] -= sum * t5;
816 c__[j * c_dim1 + 6] -= sum * t6;
822 /* Special code for 7 x 7 Householder */
839 for (j = 1; j <= i__1; ++j) {
840 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
841 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4] + v5 * c__[
842 j * c_dim1 + 5] + v6 * c__[j * c_dim1 + 6] + v7 * c__[j *
844 c__[j * c_dim1 + 1] -= sum * t1;
845 c__[j * c_dim1 + 2] -= sum * t2;
846 c__[j * c_dim1 + 3] -= sum * t3;
847 c__[j * c_dim1 + 4] -= sum * t4;
848 c__[j * c_dim1 + 5] -= sum * t5;
849 c__[j * c_dim1 + 6] -= sum * t6;
850 c__[j * c_dim1 + 7] -= sum * t7;
856 /* Special code for 8 x 8 Householder */
875 for (j = 1; j <= i__1; ++j) {
876 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
877 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4] + v5 * c__[
878 j * c_dim1 + 5] + v6 * c__[j * c_dim1 + 6] + v7 * c__[j *
879 c_dim1 + 7] + v8 * c__[j * c_dim1 + 8];
880 c__[j * c_dim1 + 1] -= sum * t1;
881 c__[j * c_dim1 + 2] -= sum * t2;
882 c__[j * c_dim1 + 3] -= sum * t3;
883 c__[j * c_dim1 + 4] -= sum * t4;
884 c__[j * c_dim1 + 5] -= sum * t5;
885 c__[j * c_dim1 + 6] -= sum * t6;
886 c__[j * c_dim1 + 7] -= sum * t7;
887 c__[j * c_dim1 + 8] -= sum * t8;
893 /* Special code for 9 x 9 Householder */
914 for (j = 1; j <= i__1; ++j) {
915 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
916 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4] + v5 * c__[
917 j * c_dim1 + 5] + v6 * c__[j * c_dim1 + 6] + v7 * c__[j *
918 c_dim1 + 7] + v8 * c__[j * c_dim1 + 8] + v9 * c__[j *
920 c__[j * c_dim1 + 1] -= sum * t1;
921 c__[j * c_dim1 + 2] -= sum * t2;
922 c__[j * c_dim1 + 3] -= sum * t3;
923 c__[j * c_dim1 + 4] -= sum * t4;
924 c__[j * c_dim1 + 5] -= sum * t5;
925 c__[j * c_dim1 + 6] -= sum * t6;
926 c__[j * c_dim1 + 7] -= sum * t7;
927 c__[j * c_dim1 + 8] -= sum * t8;
928 c__[j * c_dim1 + 9] -= sum * t9;
934 /* Special code for 10 x 10 Householder */
957 for (j = 1; j <= i__1; ++j) {
958 sum = v1 * c__[j * c_dim1 + 1] + v2 * c__[j * c_dim1 + 2] + v3 *
959 c__[j * c_dim1 + 3] + v4 * c__[j * c_dim1 + 4] + v5 * c__[
960 j * c_dim1 + 5] + v6 * c__[j * c_dim1 + 6] + v7 * c__[j *
961 c_dim1 + 7] + v8 * c__[j * c_dim1 + 8] + v9 * c__[j *
962 c_dim1 + 9] + v10 * c__[j * c_dim1 + 10];
963 c__[j * c_dim1 + 1] -= sum * t1;
964 c__[j * c_dim1 + 2] -= sum * t2;
965 c__[j * c_dim1 + 3] -= sum * t3;
966 c__[j * c_dim1 + 4] -= sum * t4;
967 c__[j * c_dim1 + 5] -= sum * t5;
968 c__[j * c_dim1 + 6] -= sum * t6;
969 c__[j * c_dim1 + 7] -= sum * t7;
970 c__[j * c_dim1 + 8] -= sum * t8;
971 c__[j * c_dim1 + 9] -= sum * t9;
972 c__[j * c_dim1 + 10] -= sum * t10;
978 /* Form C * H, where H has order n. */
993 /* Code for general N */
995 slarf_(side, m, n, &v[1], &c__1, tau, &c__[c_offset], ldc, &work[1]);
999 /* Special code for 1 x 1 Householder */
1001 t1 = 1.f - *tau * v[1] * v[1];
1003 for (j = 1; j <= i__1; ++j) {
1004 c__[j + c_dim1] = t1 * c__[j + c_dim1];
1010 /* Special code for 2 x 2 Householder */
1017 for (j = 1; j <= i__1; ++j) {
1018 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)];
1019 c__[j + c_dim1] -= sum * t1;
1020 c__[j + (c_dim1 << 1)] -= sum * t2;
1026 /* Special code for 3 x 3 Householder */
1035 for (j = 1; j <= i__1; ++j) {
1036 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1037 c__[j + c_dim1 * 3];
1038 c__[j + c_dim1] -= sum * t1;
1039 c__[j + (c_dim1 << 1)] -= sum * t2;
1040 c__[j + c_dim1 * 3] -= sum * t3;
1046 /* Special code for 4 x 4 Householder */
1057 for (j = 1; j <= i__1; ++j) {
1058 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1059 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)];
1060 c__[j + c_dim1] -= sum * t1;
1061 c__[j + (c_dim1 << 1)] -= sum * t2;
1062 c__[j + c_dim1 * 3] -= sum * t3;
1063 c__[j + (c_dim1 << 2)] -= sum * t4;
1069 /* Special code for 5 x 5 Householder */
1082 for (j = 1; j <= i__1; ++j) {
1083 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1084 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)] + v5 *
1085 c__[j + c_dim1 * 5];
1086 c__[j + c_dim1] -= sum * t1;
1087 c__[j + (c_dim1 << 1)] -= sum * t2;
1088 c__[j + c_dim1 * 3] -= sum * t3;
1089 c__[j + (c_dim1 << 2)] -= sum * t4;
1090 c__[j + c_dim1 * 5] -= sum * t5;
1096 /* Special code for 6 x 6 Householder */
1111 for (j = 1; j <= i__1; ++j) {
1112 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1113 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)] + v5 *
1114 c__[j + c_dim1 * 5] + v6 * c__[j + c_dim1 * 6];
1115 c__[j + c_dim1] -= sum * t1;
1116 c__[j + (c_dim1 << 1)] -= sum * t2;
1117 c__[j + c_dim1 * 3] -= sum * t3;
1118 c__[j + (c_dim1 << 2)] -= sum * t4;
1119 c__[j + c_dim1 * 5] -= sum * t5;
1120 c__[j + c_dim1 * 6] -= sum * t6;
1126 /* Special code for 7 x 7 Householder */
1143 for (j = 1; j <= i__1; ++j) {
1144 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1145 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)] + v5 *
1146 c__[j + c_dim1 * 5] + v6 * c__[j + c_dim1 * 6] + v7 * c__[
1148 c__[j + c_dim1] -= sum * t1;
1149 c__[j + (c_dim1 << 1)] -= sum * t2;
1150 c__[j + c_dim1 * 3] -= sum * t3;
1151 c__[j + (c_dim1 << 2)] -= sum * t4;
1152 c__[j + c_dim1 * 5] -= sum * t5;
1153 c__[j + c_dim1 * 6] -= sum * t6;
1154 c__[j + c_dim1 * 7] -= sum * t7;
1160 /* Special code for 8 x 8 Householder */
1179 for (j = 1; j <= i__1; ++j) {
1180 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1181 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)] + v5 *
1182 c__[j + c_dim1 * 5] + v6 * c__[j + c_dim1 * 6] + v7 * c__[
1183 j + c_dim1 * 7] + v8 * c__[j + (c_dim1 << 3)];
1184 c__[j + c_dim1] -= sum * t1;
1185 c__[j + (c_dim1 << 1)] -= sum * t2;
1186 c__[j + c_dim1 * 3] -= sum * t3;
1187 c__[j + (c_dim1 << 2)] -= sum * t4;
1188 c__[j + c_dim1 * 5] -= sum * t5;
1189 c__[j + c_dim1 * 6] -= sum * t6;
1190 c__[j + c_dim1 * 7] -= sum * t7;
1191 c__[j + (c_dim1 << 3)] -= sum * t8;
1197 /* Special code for 9 x 9 Householder */
1218 for (j = 1; j <= i__1; ++j) {
1219 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1220 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)] + v5 *
1221 c__[j + c_dim1 * 5] + v6 * c__[j + c_dim1 * 6] + v7 * c__[
1222 j + c_dim1 * 7] + v8 * c__[j + (c_dim1 << 3)] + v9 * c__[
1224 c__[j + c_dim1] -= sum * t1;
1225 c__[j + (c_dim1 << 1)] -= sum * t2;
1226 c__[j + c_dim1 * 3] -= sum * t3;
1227 c__[j + (c_dim1 << 2)] -= sum * t4;
1228 c__[j + c_dim1 * 5] -= sum * t5;
1229 c__[j + c_dim1 * 6] -= sum * t6;
1230 c__[j + c_dim1 * 7] -= sum * t7;
1231 c__[j + (c_dim1 << 3)] -= sum * t8;
1232 c__[j + c_dim1 * 9] -= sum * t9;
1238 /* Special code for 10 x 10 Householder */
1261 for (j = 1; j <= i__1; ++j) {
1262 sum = v1 * c__[j + c_dim1] + v2 * c__[j + (c_dim1 << 1)] + v3 *
1263 c__[j + c_dim1 * 3] + v4 * c__[j + (c_dim1 << 2)] + v5 *
1264 c__[j + c_dim1 * 5] + v6 * c__[j + c_dim1 * 6] + v7 * c__[
1265 j + c_dim1 * 7] + v8 * c__[j + (c_dim1 << 3)] + v9 * c__[
1266 j + c_dim1 * 9] + v10 * c__[j + c_dim1 * 10];
1267 c__[j + c_dim1] -= sum * t1;
1268 c__[j + (c_dim1 << 1)] -= sum * t2;
1269 c__[j + c_dim1 * 3] -= sum * t3;
1270 c__[j + (c_dim1 << 2)] -= sum * t4;
1271 c__[j + c_dim1 * 5] -= sum * t5;
1272 c__[j + c_dim1 * 6] -= sum * t6;
1273 c__[j + c_dim1 * 7] -= sum * t7;
1274 c__[j + (c_dim1 << 3)] -= sum * t8;
1275 c__[j + c_dim1 * 9] -= sum * t9;
1276 c__[j + c_dim1 * 10] -= sum * t10;