You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

c_dblat1c.c 33 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191
  1. #include <math.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #include <stdio.h>
  5. #include <complex.h>
  6. #ifdef complex
  7. #undef complex
  8. #endif
  9. #ifdef I
  10. #undef I
  11. #endif
  12. #include "common.h"
  13. typedef blasint integer;
  14. typedef unsigned int uinteger;
  15. typedef char *address;
  16. typedef short int shortint;
  17. typedef float real;
  18. typedef double doublereal;
  19. typedef struct { real r, i; } complex;
  20. typedef struct { doublereal r, i; } doublecomplex;
  21. #ifdef _MSC_VER
  22. static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
  23. static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
  24. static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
  25. static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
  26. #else
  27. static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
  28. static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
  29. static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
  30. static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
  31. #endif
  32. #define pCf(z) (*_pCf(z))
  33. #define pCd(z) (*_pCd(z))
  34. typedef int logical;
  35. typedef short int shortlogical;
  36. typedef char logical1;
  37. typedef char integer1;
  38. #define TRUE_ (1)
  39. #define FALSE_ (0)
  40. /* Extern is for use with -E */
  41. #ifndef Extern
  42. #define Extern extern
  43. #endif
  44. /* I/O stuff */
  45. typedef int flag;
  46. typedef int ftnlen;
  47. typedef int ftnint;
  48. /*external read, write*/
  49. typedef struct
  50. { flag cierr;
  51. ftnint ciunit;
  52. flag ciend;
  53. char *cifmt;
  54. ftnint cirec;
  55. } cilist;
  56. /*internal read, write*/
  57. typedef struct
  58. { flag icierr;
  59. char *iciunit;
  60. flag iciend;
  61. char *icifmt;
  62. ftnint icirlen;
  63. ftnint icirnum;
  64. } icilist;
  65. /*open*/
  66. typedef struct
  67. { flag oerr;
  68. ftnint ounit;
  69. char *ofnm;
  70. ftnlen ofnmlen;
  71. char *osta;
  72. char *oacc;
  73. char *ofm;
  74. ftnint orl;
  75. char *oblnk;
  76. } olist;
  77. /*close*/
  78. typedef struct
  79. { flag cerr;
  80. ftnint cunit;
  81. char *csta;
  82. } cllist;
  83. /*rewind, backspace, endfile*/
  84. typedef struct
  85. { flag aerr;
  86. ftnint aunit;
  87. } alist;
  88. /* inquire */
  89. typedef struct
  90. { flag inerr;
  91. ftnint inunit;
  92. char *infile;
  93. ftnlen infilen;
  94. ftnint *inex; /*parameters in standard's order*/
  95. ftnint *inopen;
  96. ftnint *innum;
  97. ftnint *innamed;
  98. char *inname;
  99. ftnlen innamlen;
  100. char *inacc;
  101. ftnlen inacclen;
  102. char *inseq;
  103. ftnlen inseqlen;
  104. char *indir;
  105. ftnlen indirlen;
  106. char *infmt;
  107. ftnlen infmtlen;
  108. char *inform;
  109. ftnint informlen;
  110. char *inunf;
  111. ftnlen inunflen;
  112. ftnint *inrecl;
  113. ftnint *innrec;
  114. char *inblank;
  115. ftnlen inblanklen;
  116. } inlist;
  117. #define VOID void
  118. union Multitype { /* for multiple entry points */
  119. integer1 g;
  120. shortint h;
  121. integer i;
  122. /* longint j; */
  123. real r;
  124. doublereal d;
  125. complex c;
  126. doublecomplex z;
  127. };
  128. typedef union Multitype Multitype;
  129. struct Vardesc { /* for Namelist */
  130. char *name;
  131. char *addr;
  132. ftnlen *dims;
  133. int type;
  134. };
  135. typedef struct Vardesc Vardesc;
  136. struct Namelist {
  137. char *name;
  138. Vardesc **vars;
  139. int nvars;
  140. };
  141. typedef struct Namelist Namelist;
  142. #define abs(x) ((x) >= 0 ? (x) : -(x))
  143. #define dabs(x) (fabs(x))
  144. #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
  145. #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
  146. #define dmin(a,b) (f2cmin(a,b))
  147. #define dmax(a,b) (f2cmax(a,b))
  148. #define bit_test(a,b) ((a) >> (b) & 1)
  149. #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
  150. #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
  151. #define abort_() { sig_die("Fortran abort routine called", 1); }
  152. #define c_abs(z) (cabsf(Cf(z)))
  153. #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
  154. #ifdef _MSC_VER
  155. #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]);}
  156. #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]);}
  157. #else
  158. #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
  159. #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
  160. #endif
  161. #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
  162. #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
  163. #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
  164. //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
  165. #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
  166. #define d_abs(x) (fabs(*(x)))
  167. #define d_acos(x) (acos(*(x)))
  168. #define d_asin(x) (asin(*(x)))
  169. #define d_atan(x) (atan(*(x)))
  170. #define d_atn2(x, y) (atan2(*(x),*(y)))
  171. #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
  172. #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
  173. #define d_cos(x) (cos(*(x)))
  174. #define d_cosh(x) (cosh(*(x)))
  175. #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
  176. #define d_exp(x) (exp(*(x)))
  177. #define d_imag(z) (cimag(Cd(z)))
  178. #define r_imag(z) (cimagf(Cf(z)))
  179. #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  180. #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  181. #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  182. #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  183. #define d_log(x) (log(*(x)))
  184. #define d_mod(x, y) (fmod(*(x), *(y)))
  185. #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
  186. #define d_nint(x) u_nint(*(x))
  187. #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
  188. #define d_sign(a,b) u_sign(*(a),*(b))
  189. #define r_sign(a,b) u_sign(*(a),*(b))
  190. #define d_sin(x) (sin(*(x)))
  191. #define d_sinh(x) (sinh(*(x)))
  192. #define d_sqrt(x) (sqrt(*(x)))
  193. #define d_tan(x) (tan(*(x)))
  194. #define d_tanh(x) (tanh(*(x)))
  195. #define i_abs(x) abs(*(x))
  196. #define i_dnnt(x) ((integer)u_nint(*(x)))
  197. #define i_len(s, n) (n)
  198. #define i_nint(x) ((integer)u_nint(*(x)))
  199. #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
  200. #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
  201. #define pow_si(B,E) spow_ui(*(B),*(E))
  202. #define pow_ri(B,E) spow_ui(*(B),*(E))
  203. #define pow_di(B,E) dpow_ui(*(B),*(E))
  204. #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
  205. #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
  206. #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
  207. #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++ = ' '; }
  208. #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
  209. #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]; }
  210. #define sig_die(s, kill) { exit(1); }
  211. #define s_stop(s, n) {exit(0);}
  212. #define z_abs(z) (cabs(Cd(z)))
  213. #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
  214. #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
  215. #define myexit_() break;
  216. #define mycycle_() continue;
  217. #define myceiling_(w) {ceil(w)}
  218. #define myhuge_(w) {HUGE_VAL}
  219. //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
  220. #define mymaxloc_(w,s,e,n) dmaxloc_(w,*(s),*(e),n)
  221. /* procedure parameter types for -A and -C++ */
  222. #define F2C_proc_par_types 1
  223. #ifdef __cplusplus
  224. typedef logical (*L_fp)(...);
  225. #else
  226. typedef logical (*L_fp)();
  227. #endif
  228. #if 0
  229. static float spow_ui(float x, integer n) {
  230. float pow=1.0; unsigned long int u;
  231. if(n != 0) {
  232. if(n < 0) n = -n, x = 1/x;
  233. for(u = n; ; ) {
  234. if(u & 01) pow *= x;
  235. if(u >>= 1) x *= x;
  236. else break;
  237. }
  238. }
  239. return pow;
  240. }
  241. static double dpow_ui(double x, integer n) {
  242. double pow=1.0; unsigned long int u;
  243. if(n != 0) {
  244. if(n < 0) n = -n, x = 1/x;
  245. for(u = n; ; ) {
  246. if(u & 01) pow *= x;
  247. if(u >>= 1) x *= x;
  248. else break;
  249. }
  250. }
  251. return pow;
  252. }
  253. #ifdef _MSC_VER
  254. static _Fcomplex cpow_ui(complex x, integer n) {
  255. complex pow={1.0,0.0}; unsigned long int u;
  256. if(n != 0) {
  257. if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
  258. for(u = n; ; ) {
  259. if(u & 01) pow.r *= x.r, pow.i *= x.i;
  260. if(u >>= 1) x.r *= x.r, x.i *= x.i;
  261. else break;
  262. }
  263. }
  264. _Fcomplex p={pow.r, pow.i};
  265. return p;
  266. }
  267. #else
  268. static _Complex float cpow_ui(_Complex float x, integer n) {
  269. _Complex float pow=1.0; unsigned long int u;
  270. if(n != 0) {
  271. if(n < 0) n = -n, x = 1/x;
  272. for(u = n; ; ) {
  273. if(u & 01) pow *= x;
  274. if(u >>= 1) x *= x;
  275. else break;
  276. }
  277. }
  278. return pow;
  279. }
  280. #endif
  281. #ifdef _MSC_VER
  282. static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
  283. _Dcomplex pow={1.0,0.0}; unsigned long int u;
  284. if(n != 0) {
  285. if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
  286. for(u = n; ; ) {
  287. if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
  288. if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
  289. else break;
  290. }
  291. }
  292. _Dcomplex p = {pow._Val[0], pow._Val[1]};
  293. return p;
  294. }
  295. #else
  296. static _Complex double zpow_ui(_Complex double x, integer n) {
  297. _Complex double pow=1.0; unsigned long int u;
  298. if(n != 0) {
  299. if(n < 0) n = -n, x = 1/x;
  300. for(u = n; ; ) {
  301. if(u & 01) pow *= x;
  302. if(u >>= 1) x *= x;
  303. else break;
  304. }
  305. }
  306. return pow;
  307. }
  308. #endif
  309. static integer pow_ii(integer x, integer n) {
  310. integer pow; unsigned long int u;
  311. if (n <= 0) {
  312. if (n == 0 || x == 1) pow = 1;
  313. else if (x != -1) pow = x == 0 ? 1/x : 0;
  314. else n = -n;
  315. }
  316. if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
  317. u = n;
  318. for(pow = 1; ; ) {
  319. if(u & 01) pow *= x;
  320. if(u >>= 1) x *= x;
  321. else break;
  322. }
  323. }
  324. return pow;
  325. }
  326. static integer dmaxloc_(double *w, integer s, integer e, integer *n)
  327. {
  328. double m; integer i, mi;
  329. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  330. if (w[i-1]>m) mi=i ,m=w[i-1];
  331. return mi-s+1;
  332. }
  333. static integer smaxloc_(float *w, integer s, integer e, integer *n)
  334. {
  335. float m; integer i, mi;
  336. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  337. if (w[i-1]>m) mi=i ,m=w[i-1];
  338. return mi-s+1;
  339. }
  340. #endif
  341. /* Common Block Declarations */
  342. struct {
  343. integer icase, n, incx, incy, mode;
  344. logical pass;
  345. } combla_;
  346. #define combla_1 combla_
  347. /* Table of constant values */
  348. static integer c__1 = 1;
  349. static doublereal c_b34 = 1.;
  350. /* Main program */ int main()
  351. {
  352. /* Initialized data */
  353. static doublereal sfac = 9.765625e-4;
  354. /* Local variables */
  355. extern /* Subroutine */ int check0_(), check1_(), check2_(), check3_();
  356. static integer ic;
  357. extern /* Subroutine */ int header_();
  358. /* Test program for the DOUBLE PRECISION Level 1 CBLAS. */
  359. /* Based upon the original CBLAS test routine together with: */
  360. /* F06EAF Example Program Text */
  361. /* .. Parameters .. */
  362. /* .. Scalars in Common .. */
  363. /* .. Local Scalars .. */
  364. /* .. External Subroutines .. */
  365. /* .. Common blocks .. */
  366. /* .. Data statements .. */
  367. /* .. Executable Statements .. */
  368. printf("Real CBLAS Test Program Results\n");
  369. for (ic = 1; ic <= 11; ++ic) {
  370. combla_1.icase = ic;
  371. header_();
  372. /* .. Initialize PASS, INCX, INCY, and MODE for a new case. .. */
  373. /* .. the value 9999 for INCX, INCY or MODE will appear in the .. */
  374. /* .. detailed output, if any, for cases that do not involve .. */
  375. /* .. these parameters .. */
  376. combla_1.pass = TRUE_;
  377. combla_1.incx = 9999;
  378. combla_1.incy = 9999;
  379. combla_1.mode = 9999;
  380. if (combla_1.icase == 3) {
  381. check0_(&sfac);
  382. } else if (combla_1.icase == 7 || combla_1.icase == 8 ||
  383. combla_1.icase == 9 || combla_1.icase == 10) {
  384. check1_(&sfac);
  385. } else if (combla_1.icase == 1 || combla_1.icase == 2 ||
  386. combla_1.icase == 5 || combla_1.icase == 6) {
  387. check2_(&sfac);
  388. } else if (combla_1.icase == 4 || combla_1.icase == 11) {
  389. check3_(&sfac);
  390. }
  391. /* -- Print */
  392. if (combla_1.pass) {
  393. printf(" ----- PASS -----\n");
  394. }
  395. /* L20: */
  396. }
  397. exit(0);
  398. } /* MAIN__ */
  399. /* Subroutine */ int header_()
  400. {
  401. /* Initialized data */
  402. static char l[15][13] = {"CBLAS_DDOT " , "CBLAS_DAXPY " , "CBLAS_DROTG " ,
  403. "CBLAS_DROT " , "CBLAS_DCOPY " , "CBLAS_DSWAP " , "CBLAS_DNRM2 " , "CBLAS_DASUM ",
  404. "CBLAS_DSCAL " , "CBLAS_IDAMAX" , "CBLAS_DROTM "};
  405. /* .. Parameters .. */
  406. /* .. Scalars in Common .. */
  407. /* .. Local Arrays .. */
  408. /* .. Common blocks .. */
  409. /* .. Data statements .. */
  410. /* .. Executable Statements .. */
  411. printf("Test of subprogram number %3d %15s", combla_1.icase, l[combla_1.icase -1]);
  412. return 0;
  413. } /* header_ */
  414. /* Subroutine */ int check0_(sfac)
  415. doublereal *sfac;
  416. {
  417. /* Initialized data */
  418. static doublereal ds1[8] = { .8,.6,.8,-.6,.8,0.,1.,0. };
  419. static doublereal datrue[8] = { .5,.5,.5,-.5,-.5,0.,1.,1. };
  420. static doublereal dbtrue[8] = { 0.,.6,0.,-.6,0.,0.,1.,0. };
  421. static doublereal da1[8] = { .3,.4,-.3,-.4,-.3,0.,0.,1. };
  422. static doublereal db1[8] = { .4,.3,.4,.3,-.4,0.,1.,0. };
  423. static doublereal dc1[8] = { .6,.8,-.6,.8,.6,1.,0.,1. };
  424. /* Local variables */
  425. static integer k;
  426. extern /* Subroutine */ int drotgtest_(), stest1_();
  427. static doublereal sa, sb, sc, ss;
  428. /* .. Parameters .. */
  429. /* .. Scalar Arguments .. */
  430. /* .. Scalars in Common .. */
  431. /* .. Local Scalars .. */
  432. /* .. Local Arrays .. */
  433. /* .. External Subroutines .. */
  434. /* .. Common blocks .. */
  435. /* .. Data statements .. */
  436. /* .. Executable Statements .. */
  437. /* Compute true values which cannot be prestored */
  438. /* in decimal notation */
  439. dbtrue[0] = 1.6666666666666667;
  440. dbtrue[2] = -1.6666666666666667;
  441. dbtrue[4] = 1.6666666666666667;
  442. for (k = 1; k <= 8; ++k) {
  443. /* .. Set N=K for identification in output if any .. */
  444. combla_1.n = k;
  445. if (combla_1.icase == 3) {
  446. /* .. DROTGTEST .. */
  447. if (k > 8) {
  448. goto L40;
  449. }
  450. sa = da1[k - 1];
  451. sb = db1[k - 1];
  452. drotgtest_(&sa, &sb, &sc, &ss);
  453. stest1_(&sa, &datrue[k - 1], &datrue[k - 1], sfac);
  454. stest1_(&sb, &dbtrue[k - 1], &dbtrue[k - 1], sfac);
  455. stest1_(&sc, &dc1[k - 1], &dc1[k - 1], sfac);
  456. stest1_(&ss, &ds1[k - 1], &ds1[k - 1], sfac);
  457. } else {
  458. fprintf(stderr, " Shouldn't be here in CHECK0\n");
  459. exit(0);
  460. }
  461. /* L20: */
  462. }
  463. L40:
  464. return 0;
  465. } /* check0_ */
  466. /* Subroutine */ int check1_(sfac)
  467. doublereal *sfac;
  468. {
  469. /* Initialized data */
  470. static doublereal sa[10] = { .3,-1.,0.,1.,.3,.3,.3,.3,.3,.3 };
  471. static doublereal dv[80] /* was [8][5][2] */ = { .1,2.,2.,2.,2.,2.,2.,
  472. 2.,.3,3.,3.,3.,3.,3.,3.,3.,.3,-.4,4.,4.,4.,4.,4.,4.,.2,-.6,.3,5.,
  473. 5.,5.,5.,5.,.1,-.3,.5,-.1,6.,6.,6.,6.,.1,8.,8.,8.,8.,8.,8.,8.,.3,
  474. 9.,9.,9.,9.,9.,9.,9.,.3,2.,-.4,2.,2.,2.,2.,2.,.2,3.,-.6,5.,.3,2.,
  475. 2.,2.,.1,4.,-.3,6.,-.5,7.,-.1,3. };
  476. static doublereal dtrue1[5] = { 0.,.3,.5,.7,.6 };
  477. static doublereal dtrue3[5] = { 0.,.3,.7,1.1,1. };
  478. static doublereal dtrue5[80] /* was [8][5][2] */ = { .1,2.,2.,2.,
  479. 2.,2.,2.,2.,-.3,3.,3.,3.,3.,3.,3.,3.,0.,0.,4.,4.,4.,4.,4.,4.,.2,
  480. -.6,.3,5.,5.,5.,5.,5.,.03,-.09,.15,-.03,6.,6.,6.,6.,.1,8.,8.,8.,
  481. 8.,8.,8.,8.,.09,9.,9.,9.,9.,9.,9.,9.,.09,2.,-.12,2.,2.,2.,2.,2.,
  482. .06,3.,-.18,5.,.09,2.,2.,2.,.03,4.,-.09,6.,-.15,7.,-.03,3. };
  483. static integer itrue2[5] = { 0,1,2,2,3 };
  484. /* System generated locals */
  485. integer i__1;
  486. doublereal d__1;
  487. /* Local variables */
  488. static integer i__;
  489. extern doublereal dnrm2test_();
  490. static doublereal stemp[1], strue[8];
  491. extern /* Subroutine */ int stest_(), dscaltest_();
  492. extern doublereal dasumtest_();
  493. extern /* Subroutine */ int itest1_(), stest1_();
  494. static doublereal sx[8];
  495. static integer np1;
  496. extern integer idamaxtest_();
  497. static integer len;
  498. /* .. Parameters .. */
  499. /* .. Scalar Arguments .. */
  500. /* .. Scalars in Common .. */
  501. /* .. Local Scalars .. */
  502. /* .. Local Arrays .. */
  503. /* .. External Functions .. */
  504. /* .. External Subroutines .. */
  505. /* .. Intrinsic Functions .. */
  506. /* .. Common blocks .. */
  507. /* .. Data statements .. */
  508. /* .. Executable Statements .. */
  509. for (combla_1.incx = 1; combla_1.incx <= 2; ++combla_1.incx) {
  510. for (np1 = 1; np1 <= 5; ++np1) {
  511. combla_1.n = np1 - 1;
  512. len = f2cmax(combla_1.n,1) << 1;
  513. /* .. Set vector arguments .. */
  514. i__1 = len;
  515. for (i__ = 1; i__ <= i__1; ++i__) {
  516. sx[i__ - 1] = dv[i__ + (np1 + combla_1.incx * 5 << 3) - 49];
  517. /* L20: */
  518. }
  519. if (combla_1.icase == 7) {
  520. /* .. DNRM2TEST .. */
  521. stemp[0] = dtrue1[np1 - 1];
  522. d__1 = dnrm2test_(&combla_1.n, sx, &combla_1.incx);
  523. stest1_(&d__1, stemp, stemp, sfac);
  524. } else if (combla_1.icase == 8) {
  525. /* .. DASUMTEST .. */
  526. stemp[0] = dtrue3[np1 - 1];
  527. d__1 = dasumtest_(&combla_1.n, sx, &combla_1.incx);
  528. stest1_(&d__1, stemp, stemp, sfac);
  529. } else if (combla_1.icase == 9) {
  530. /* .. DSCALTEST .. */
  531. dscaltest_(&combla_1.n, &sa[(combla_1.incx - 1) * 5 + np1 - 1]
  532. , sx, &combla_1.incx);
  533. i__1 = len;
  534. for (i__ = 1; i__ <= i__1; ++i__) {
  535. strue[i__ - 1] = dtrue5[i__ + (np1 + combla_1.incx * 5 <<
  536. 3) - 49];
  537. /* L40: */
  538. }
  539. stest_(&len, sx, strue, strue, sfac);
  540. } else if (combla_1.icase == 10) {
  541. /* .. IDAMAXTEST .. */
  542. i__1 = idamaxtest_(&combla_1.n, sx, &combla_1.incx);
  543. itest1_(&i__1, &itrue2[np1 - 1]);
  544. } else {
  545. fprintf(stderr, " Shouldn't be here in CHECK1\n");
  546. exit(0);
  547. }
  548. /* L60: */
  549. }
  550. /* L80: */
  551. }
  552. return 0;
  553. } /* check1_ */
  554. /* Subroutine */ int check2_(sfac)
  555. doublereal *sfac;
  556. {
  557. /* Initialized data */
  558. static doublereal sa = .3;
  559. static integer incxs[4] = { 1,2,-2,-1 };
  560. static integer incys[4] = { 1,-2,1,-2 };
  561. static integer lens[8] /* was [4][2] */ = { 1,1,2,4,1,1,3,7 };
  562. static integer ns[4] = { 0,1,2,4 };
  563. static doublereal dx1[7] = { .6,.1,-.5,.8,.9,-.3,-.4 };
  564. static doublereal dy1[7] = { .5,-.9,.3,.7,-.6,.2,.8 };
  565. static doublereal dt7[16] /* was [4][4] */ = { 0.,.3,.21,.62,0.,.3,-.07,
  566. .85,0.,.3,-.79,-.74,0.,.3,.33,1.27 };
  567. static doublereal dt8[112] /* was [7][4][4] */ = { .5,0.,0.,0.,0.,0.,0.,
  568. .68,0.,0.,0.,0.,0.,0.,.68,-.87,0.,0.,0.,0.,0.,.68,-.87,.15,.94,0.,
  569. 0.,0.,.5,0.,0.,0.,0.,0.,0.,.68,0.,0.,0.,0.,0.,0.,.35,-.9,.48,0.,
  570. 0.,0.,0.,.38,-.9,.57,.7,-.75,.2,.98,.5,0.,0.,0.,0.,0.,0.,.68,0.,
  571. 0.,0.,0.,0.,0.,.35,-.72,0.,0.,0.,0.,0.,.38,-.63,.15,.88,0.,0.,0.,
  572. .5,0.,0.,0.,0.,0.,0.,.68,0.,0.,0.,0.,0.,0.,.68,-.9,.33,0.,0.,0.,
  573. 0.,.68,-.9,.33,.7,-.75,.2,1.04 };
  574. static doublereal dt10x[112] /* was [7][4][4] */ = { .6,0.,0.,0.,
  575. 0.,0.,0.,.5,0.,0.,0.,0.,0.,0.,.5,-.9,0.,0.,0.,0.,0.,.5,-.9,.3,.7,
  576. 0.,0.,0.,.6,0.,0.,0.,0.,0.,0.,.5,0.,0.,0.,0.,0.,0.,.3,.1,.5,0.,0.,
  577. 0.,0.,.8,.1,-.6,.8,.3,-.3,.5,.6,0.,0.,0.,0.,0.,0.,.5,0.,0.,0.,0.,
  578. 0.,0.,-.9,.1,.5,0.,0.,0.,0.,.7,.1,.3,.8,-.9,-.3,.5,.6,0.,0.,0.,0.,
  579. 0.,0.,.5,0.,0.,0.,0.,0.,0.,.5,.3,0.,0.,0.,0.,0.,.5,.3,-.6,.8,0.,
  580. 0.,0. };
  581. static doublereal dt10y[112] /* was [7][4][4] */ = { .5,0.,0.,0.,
  582. 0.,0.,0.,.6,0.,0.,0.,0.,0.,0.,.6,.1,0.,0.,0.,0.,0.,.6,.1,-.5,.8,
  583. 0.,0.,0.,.5,0.,0.,0.,0.,0.,0.,.6,0.,0.,0.,0.,0.,0.,-.5,-.9,.6,0.,
  584. 0.,0.,0.,-.4,-.9,.9,.7,-.5,.2,.6,.5,0.,0.,0.,0.,0.,0.,.6,0.,0.,0.,
  585. 0.,0.,0.,-.5,.6,0.,0.,0.,0.,0.,-.4,.9,-.5,.6,0.,0.,0.,.5,0.,0.,0.,
  586. 0.,0.,0.,.6,0.,0.,0.,0.,0.,0.,.6,-.9,.1,0.,0.,0.,0.,.6,-.9,.1,.7,
  587. -.5,.2,.8 };
  588. static doublereal ssize1[4] = { 0.,.3,1.6,3.2 };
  589. static doublereal ssize2[28] /* was [14][2] */ = { 0.,0.,0.,0.,0.,
  590. 0.,0.,0.,0.,0.,0.,0.,0.,0.,1.17,1.17,1.17,1.17,1.17,1.17,1.17,
  591. 1.17,1.17,1.17,1.17,1.17,1.17,1.17 };
  592. /* System generated locals */
  593. integer i__1;
  594. doublereal d__1;
  595. /* Local variables */
  596. static integer lenx, leny;
  597. extern doublereal ddottest_();
  598. static integer i__, j, ksize;
  599. extern /* Subroutine */ int stest_(), dcopytest_(), dswaptest_(),
  600. daxpytest_(), stest1_();
  601. static integer ki, kn, mx, my;
  602. static doublereal sx[7], sy[7], stx[7], sty[7];
  603. /* .. Parameters .. */
  604. /* .. Scalar Arguments .. */
  605. /* .. Scalars in Common .. */
  606. /* .. Local Scalars .. */
  607. /* .. Local Arrays .. */
  608. /* .. External Functions .. */
  609. /* .. External Subroutines .. */
  610. /* .. Intrinsic Functions .. */
  611. /* .. Common blocks .. */
  612. /* .. Data statements .. */
  613. /* .. Executable Statements .. */
  614. for (ki = 1; ki <= 4; ++ki) {
  615. combla_1.incx = incxs[ki - 1];
  616. combla_1.incy = incys[ki - 1];
  617. mx = abs(combla_1.incx);
  618. my = abs(combla_1.incy);
  619. for (kn = 1; kn <= 4; ++kn) {
  620. combla_1.n = ns[kn - 1];
  621. ksize = f2cmin(2,kn);
  622. lenx = lens[kn + (mx << 2) - 5];
  623. leny = lens[kn + (my << 2) - 5];
  624. /* .. Initialize all argument arrays .. */
  625. for (i__ = 1; i__ <= 7; ++i__) {
  626. sx[i__ - 1] = dx1[i__ - 1];
  627. sy[i__ - 1] = dy1[i__ - 1];
  628. /* L20: */
  629. }
  630. if (combla_1.icase == 1) {
  631. /* .. DDOTTEST .. */
  632. d__1 = ddottest_(&combla_1.n, sx, &combla_1.incx, sy, &
  633. combla_1.incy);
  634. stest1_(&d__1, &dt7[kn + (ki << 2) - 5], &ssize1[kn - 1],
  635. sfac);
  636. } else if (combla_1.icase == 2) {
  637. /* .. DAXPYTEST .. */
  638. daxpytest_(&combla_1.n, &sa, sx, &combla_1.incx, sy, &
  639. combla_1.incy);
  640. i__1 = leny;
  641. for (j = 1; j <= i__1; ++j) {
  642. sty[j - 1] = dt8[j + (kn + (ki << 2)) * 7 - 36];
  643. /* L40: */
  644. }
  645. stest_(&leny, sy, sty, &ssize2[ksize * 14 - 14], sfac);
  646. } else if (combla_1.icase == 5) {
  647. /* .. DCOPYTEST .. */
  648. for (i__ = 1; i__ <= 7; ++i__) {
  649. sty[i__ - 1] = dt10y[i__ + (kn + (ki << 2)) * 7 - 36];
  650. /* L60: */
  651. }
  652. dcopytest_(&combla_1.n, sx, &combla_1.incx, sy, &
  653. combla_1.incy);
  654. stest_(&leny, sy, sty, ssize2, &c_b34);
  655. } else if (combla_1.icase == 6) {
  656. /* .. DSWAPTEST .. */
  657. dswaptest_(&combla_1.n, sx, &combla_1.incx, sy, &
  658. combla_1.incy);
  659. for (i__ = 1; i__ <= 7; ++i__) {
  660. stx[i__ - 1] = dt10x[i__ + (kn + (ki << 2)) * 7 - 36];
  661. sty[i__ - 1] = dt10y[i__ + (kn + (ki << 2)) * 7 - 36];
  662. /* L80: */
  663. }
  664. stest_(&lenx, sx, stx, ssize2, &c_b34);
  665. stest_(&leny, sy, sty, ssize2, &c_b34);
  666. } else {
  667. fprintf(stderr," Shouldn't be here in CHECK2\n");
  668. exit(0);
  669. }
  670. /* L100: */
  671. }
  672. /* L120: */
  673. }
  674. return 0;
  675. } /* check2_ */
  676. /* Subroutine */ int check3_(sfac)
  677. doublereal *sfac;
  678. {
  679. /* Initialized data */
  680. static integer incxs[7] = { 1,1,2,2,-2,-1,-2 };
  681. static integer incys[7] = { 1,2,2,-2,1,-2,-2 };
  682. static integer ns[5] = { 0,1,2,4,5 };
  683. static doublereal dx[10] = { .6,.1,-.5,.8,.9,-.3,-.4,.7,.5,.2 };
  684. static doublereal dy[10] = { .5,-.9,.3,.7,-.6,.2,.8,-.5,.1,-.3 };
  685. static doublereal sc = .8;
  686. static doublereal ss = .6;
  687. static integer len = 10;
  688. static doublereal param[20] /* was [5][4] */ = { -2.,1.,0.,0.,1.,-1.,.2,
  689. .3,.4,.5,0.,1.,.3,.4,1.,1.,.2,-1.,1.,.5 };
  690. static doublereal ssize2[20] /* was [10][2] */ = { 0.,0.,0.,0.,0.,
  691. 0.,0.,0.,0.,0.,1.17,1.17,1.17,1.17,1.17,1.17,1.17,1.17,1.17,1.17 }
  692. ;
  693. /* Local variables */
  694. extern /* Subroutine */ int drottest_();
  695. static integer i__, k, ksize;
  696. extern /* Subroutine */int stest_(), drotmtest_();
  697. static integer ki, kn;
  698. static doublereal dparam[5], sx[10], sy[10], stx[10], sty[10];
  699. /* .. Parameters .. */
  700. /* .. Scalar Arguments .. */
  701. /* .. Scalars in Common .. */
  702. /* .. Local Scalars .. */
  703. /* .. Local Arrays .. */
  704. /* .. External Subroutines .. */
  705. /* .. Intrinsic Functions .. */
  706. /* .. Common blocks .. */
  707. /* .. Data statements .. */
  708. /* .. Executable Statements .. */
  709. for (ki = 1; ki <= 7; ++ki) {
  710. combla_1.incx = incxs[ki - 1];
  711. combla_1.incy = incys[ki - 1];
  712. for (kn = 1; kn <= 5; ++kn) {
  713. combla_1.n = ns[kn - 1];
  714. ksize = f2cmin(2,kn);
  715. if (combla_1.icase == 4) {
  716. /* .. DROTTEST .. */
  717. for (i__ = 1; i__ <= 10; ++i__) {
  718. sx[i__ - 1] = dx[i__ - 1];
  719. sy[i__ - 1] = dy[i__ - 1];
  720. stx[i__ - 1] = dx[i__ - 1];
  721. sty[i__ - 1] = dy[i__ - 1];
  722. /* L20: */
  723. }
  724. drottest_(&combla_1.n, sx, &combla_1.incx, sy, &combla_1.incy,
  725. &sc, &ss);
  726. drot_(&combla_1.n, stx, &combla_1.incx, sty, &combla_1.incy, &
  727. sc, &ss);
  728. stest_(&len, sx, stx, &ssize2[ksize * 10 - 10], sfac);
  729. stest_(&len, sy, sty, &ssize2[ksize * 10 - 10], sfac);
  730. } else if (combla_1.icase == 11) {
  731. /* .. DROTMTEST .. */
  732. for (i__ = 1; i__ <= 10; ++i__) {
  733. sx[i__ - 1] = dx[i__ - 1];
  734. sy[i__ - 1] = dy[i__ - 1];
  735. stx[i__ - 1] = dx[i__ - 1];
  736. sty[i__ - 1] = dy[i__ - 1];
  737. /* L90: */
  738. }
  739. for (i__ = 1; i__ <= 4; ++i__) {
  740. for (k = 1; k <= 5; ++k) {
  741. dparam[k - 1] = param[k + i__ * 5 - 6];
  742. /* L80: */
  743. }
  744. drotmtest_(&combla_1.n, sx, &combla_1.incx, sy, &
  745. combla_1.incy, dparam);
  746. drotm_(&combla_1.n, stx, &combla_1.incx, sty, &
  747. combla_1.incy, dparam);
  748. stest_(&len, sx, stx, &ssize2[ksize * 10 - 10], sfac);
  749. stest_(&len, sy, sty, &ssize2[ksize * 10 - 10], sfac);
  750. /* L70: */
  751. }
  752. } else {
  753. fprintf(stderr," Shouldn't be here in CHECK3\n");
  754. exit(0);
  755. }
  756. /* L40: */
  757. }
  758. /* L60: */
  759. }
  760. return 0;
  761. } /* check3_ */
  762. /* Subroutine */ int stest_(len, scomp, strue, ssize, sfac)
  763. integer *len;
  764. doublereal *scomp, *strue, *ssize, *sfac;
  765. {
  766. /* System generated locals */
  767. integer i__1;
  768. doublereal d__1, d__2, d__3, d__4, d__5;
  769. /* Local variables */
  770. static integer i__;
  771. extern doublereal sdiff_();
  772. static doublereal sd;
  773. /* ********************************* STEST ************************** */
  774. /* THIS SUBR COMPARES ARRAYS SCOMP() AND STRUE() OF LENGTH LEN TO */
  775. /* SEE IF THE TERM BY TERM DIFFERENCES, MULTIPLIED BY SFAC, ARE */
  776. /* NEGLIGIBLE. */
  777. /* C. L. LAWSON, JPL, 1974 DEC 10 */
  778. /* .. Parameters .. */
  779. /* .. Scalar Arguments .. */
  780. /* .. Array Arguments .. */
  781. /* .. Scalars in Common .. */
  782. /* .. Local Scalars .. */
  783. /* .. External Functions .. */
  784. /* .. Intrinsic Functions .. */
  785. /* .. Common blocks .. */
  786. /* .. Executable Statements .. */
  787. /* Parameter adjustments */
  788. --ssize;
  789. --strue;
  790. --scomp;
  791. /* Function Body */
  792. i__1 = *len;
  793. for (i__ = 1; i__ <= i__1; ++i__) {
  794. sd = scomp[i__] - strue[i__];
  795. d__4 = (d__1 = ssize[i__], abs(d__1)) + (d__2 = *sfac * sd, abs(d__2))
  796. ;
  797. d__5 = (d__3 = ssize[i__], abs(d__3));
  798. if (sdiff_(&d__4, &d__5) == 0.) {
  799. goto L40;
  800. }
  801. /* HERE SCOMP(I) IS NOT CLOSE TO STRUE(I). */
  802. if (! combla_1.pass) {
  803. goto L20;
  804. }
  805. /* PRINT FAIL MESSAGE AND HEADER. */
  806. combla_1.pass = FALSE_;
  807. printf(" FAIL\n");
  808. printf("CASE N INCX INCY MODE I COMP(I) TRUE(I) DIFFERENCE SIZE(I)\n");
  809. L20:
  810. printf("%4d %3d %5d %5d %5d %3d %36.8f %36.8f %12.4f %12.4f\n",combla_1.icase, combla_1.n, combla_1.incx, combla_1.incy, combla_1.mode,
  811. i__, scomp[i__], strue[i__], sd, ssize[i__]);
  812. L40:
  813. ;
  814. }
  815. return 0;
  816. } /* stest_ */
  817. /* Subroutine */ int stest1_(scomp1, strue1, ssize, sfac)
  818. doublereal *scomp1, *strue1, *ssize, *sfac;
  819. {
  820. static doublereal scomp[1], strue[1];
  821. extern /* Subroutine */ int stest_();
  822. /* ************************* STEST1 ***************************** */
  823. /* THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN */
  824. /* REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE */
  825. /* ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT. */
  826. /* C.L. LAWSON, JPL, 1978 DEC 6 */
  827. /* .. Scalar Arguments .. */
  828. /* .. Array Arguments .. */
  829. /* .. Local Arrays .. */
  830. /* .. External Subroutines .. */
  831. /* .. Executable Statements .. */
  832. /* Parameter adjustments */
  833. --ssize;
  834. /* Function Body */
  835. scomp[0] = *scomp1;
  836. strue[0] = *strue1;
  837. stest_(&c__1, scomp, strue, &ssize[1], sfac);
  838. return 0;
  839. } /* stest1_ */
  840. doublereal sdiff_(sa, sb)
  841. doublereal *sa, *sb;
  842. {
  843. /* System generated locals */
  844. doublereal ret_val;
  845. /* ********************************* SDIFF ************************** */
  846. /* COMPUTES DIFFERENCE OF TWO NUMBERS. C. L. LAWSON, JPL 1974 FEB 15 */
  847. /* .. Scalar Arguments .. */
  848. /* .. Executable Statements .. */
  849. ret_val = *sa - *sb;
  850. return ret_val;
  851. } /* sdiff_ */
  852. /* Subroutine */ int itest1_(icomp, itrue)
  853. integer *icomp, *itrue;
  854. {
  855. /* Local variables */
  856. static integer id;
  857. /* ********************************* ITEST1 ************************* */
  858. /* THIS SUBROUTINE COMPARES THE VARIABLES ICOMP AND ITRUE FOR */
  859. /* EQUALITY. */
  860. /* C. L. LAWSON, JPL, 1974 DEC 10 */
  861. /* .. Parameters .. */
  862. /* .. Scalar Arguments .. */
  863. /* .. Scalars in Common .. */
  864. /* .. Local Scalars .. */
  865. /* .. Common blocks .. */
  866. /* .. Executable Statements .. */
  867. if (*icomp == *itrue) {
  868. goto L40;
  869. }
  870. /* HERE ICOMP IS NOT EQUAL TO ITRUE. */
  871. if (! combla_1.pass) {
  872. goto L20;
  873. }
  874. /* PRINT FAIL MESSAGE AND HEADER. */
  875. combla_1.pass = FALSE_;
  876. printf(" FAILn");
  877. printf("(CASE N INCX INCY MODE COMP TRUE DIFFERENCE\n");
  878. L20:
  879. id = *icomp - *itrue;
  880. printf("%4d %3d %5d %5d %5d %36d %36d %12d\n",combla_1.icase, combla_1.n, combla_1.incx, combla_1.incy,
  881. combla_1.mode, *icomp, *itrue, id);
  882. L40:
  883. return 0;
  884. } /* itest1_ */
  885. #if 0
  886. /* Subroutine */ int drot_(n, dx, incx, dy, incy, c__, s)
  887. integer *n;
  888. doublereal *dx;
  889. integer *incx;
  890. doublereal *dy;
  891. integer *incy;
  892. doublereal *c__, *s;
  893. {
  894. /* System generated locals */
  895. integer i__1;
  896. /* Local variables */
  897. static integer i__;
  898. static doublereal dtemp;
  899. static integer ix, iy;
  900. /* .. Scalar Arguments .. */
  901. /* .. */
  902. /* .. Array Arguments .. */
  903. /* .. */
  904. /* applies a plane rotation. */
  905. /* jack dongarra, linpack, 3/11/78. */
  906. /* modified 12/3/93, array(1) declarations changed to array(*) */
  907. /* .. Local Scalars .. */
  908. /* .. */
  909. /* Parameter adjustments */
  910. --dy;
  911. --dx;
  912. /* Function Body */
  913. if (*n <= 0) {
  914. return 0;
  915. }
  916. if (*incx == 1 && *incy == 1) {
  917. goto L20;
  918. }
  919. ix = 1;
  920. iy = 1;
  921. if (*incx < 0) {
  922. ix = (-(*n) + 1) * *incx + 1;
  923. }
  924. if (*incy < 0) {
  925. iy = (-(*n) + 1) * *incy + 1;
  926. }
  927. i__1 = *n;
  928. for (i__ = 1; i__ <= i__1; ++i__) {
  929. dtemp = *c__ * dx[ix] + *s * dy[iy];
  930. dy[iy] = *c__ * dy[iy] - *s * dx[ix];
  931. dx[ix] = dtemp;
  932. ix += *incx;
  933. iy += *incy;
  934. /* L10: */
  935. }
  936. return 0;
  937. L20:
  938. i__1 = *n;
  939. for (i__ = 1; i__ <= i__1; ++i__) {
  940. dtemp = *c__ * dx[i__] + *s * dy[i__];
  941. dy[i__] = *c__ * dy[i__] - *s * dx[i__];
  942. dx[i__] = dtemp;
  943. /* L30: */
  944. }
  945. return 0;
  946. } /* drot_ */
  947. /* Subroutine */ int drotm_(n, dx, incx, dy, incy, dparam)
  948. integer *n;
  949. doublereal *dx;
  950. integer *incx;
  951. doublereal *dy;
  952. integer *incy;
  953. doublereal *dparam;
  954. {
  955. /* Initialized data */
  956. static doublereal zero = 0.;
  957. static doublereal two = 2.;
  958. /* System generated locals */
  959. integer i__1, i__2;
  960. /* Local variables */
  961. static integer i__;
  962. static doublereal dflag, w, z__;
  963. static integer kx, ky, nsteps;
  964. static doublereal dh11, dh12, dh21, dh22;
  965. /* -- Reference BLAS level1 routine (version 3.8.0) -- */
  966. /* -- Reference BLAS is a software package provided by Univ. of Tennessee, -- */
  967. /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  968. /* November 2017 */
  969. /* .. Scalar Arguments .. */
  970. /* .. */
  971. /* .. Array Arguments .. */
  972. /* .. */
  973. /* ===================================================================== */
  974. /* .. Local Scalars .. */
  975. /* .. */
  976. /* .. Data statements .. */
  977. /* Parameter adjustments */
  978. --dparam;
  979. --dy;
  980. --dx;
  981. /* Function Body */
  982. /* .. */
  983. dflag = dparam[1];
  984. if (*n <= 0 || dflag + two == zero) {
  985. return 0;
  986. }
  987. if (*incx == *incy && *incx > 0) {
  988. nsteps = *n * *incx;
  989. if (dflag < zero) {
  990. dh11 = dparam[2];
  991. dh12 = dparam[4];
  992. dh21 = dparam[3];
  993. dh22 = dparam[5];
  994. i__1 = nsteps;
  995. i__2 = *incx;
  996. for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
  997. w = dx[i__];
  998. z__ = dy[i__];
  999. dx[i__] = w * dh11 + z__ * dh12;
  1000. dy[i__] = w * dh21 + z__ * dh22;
  1001. }
  1002. } else if (dflag == zero) {
  1003. dh12 = dparam[4];
  1004. dh21 = dparam[3];
  1005. i__2 = nsteps;
  1006. i__1 = *incx;
  1007. for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
  1008. w = dx[i__];
  1009. z__ = dy[i__];
  1010. dx[i__] = w + z__ * dh12;
  1011. dy[i__] = w * dh21 + z__;
  1012. }
  1013. } else {
  1014. dh11 = dparam[2];
  1015. dh22 = dparam[5];
  1016. i__1 = nsteps;
  1017. i__2 = *incx;
  1018. for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
  1019. w = dx[i__];
  1020. z__ = dy[i__];
  1021. dx[i__] = w * dh11 + z__;
  1022. dy[i__] = -w + dh22 * z__;
  1023. }
  1024. }
  1025. } else {
  1026. kx = 1;
  1027. ky = 1;
  1028. if (*incx < 0) {
  1029. kx = (1 - *n) * *incx + 1;
  1030. }
  1031. if (*incy < 0) {
  1032. ky = (1 - *n) * *incy + 1;
  1033. }
  1034. if (dflag < zero) {
  1035. dh11 = dparam[2];
  1036. dh12 = dparam[4];
  1037. dh21 = dparam[3];
  1038. dh22 = dparam[5];
  1039. i__2 = *n;
  1040. for (i__ = 1; i__ <= i__2; ++i__) {
  1041. w = dx[kx];
  1042. z__ = dy[ky];
  1043. dx[kx] = w * dh11 + z__ * dh12;
  1044. dy[ky] = w * dh21 + z__ * dh22;
  1045. kx += *incx;
  1046. ky += *incy;
  1047. }
  1048. } else if (dflag == zero) {
  1049. dh12 = dparam[4];
  1050. dh21 = dparam[3];
  1051. i__2 = *n;
  1052. for (i__ = 1; i__ <= i__2; ++i__) {
  1053. w = dx[kx];
  1054. z__ = dy[ky];
  1055. dx[kx] = w + z__ * dh12;
  1056. dy[ky] = w * dh21 + z__;
  1057. kx += *incx;
  1058. ky += *incy;
  1059. }
  1060. } else {
  1061. dh11 = dparam[2];
  1062. dh22 = dparam[5];
  1063. i__2 = *n;
  1064. for (i__ = 1; i__ <= i__2; ++i__) {
  1065. w = dx[kx];
  1066. z__ = dy[ky];
  1067. dx[kx] = w * dh11 + z__;
  1068. dy[ky] = -w + dh22 * z__;
  1069. kx += *incx;
  1070. ky += *incy;
  1071. }
  1072. }
  1073. }
  1074. return 0;
  1075. } /* drotm_ */
  1076. #endif