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_sblat1c.c 43 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404
  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. #if 0
  342. static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  343. integer n = *n_, incx = *incx_, incy = *incy_, i;
  344. #ifdef _MSC_VER
  345. _Fcomplex zdotc = {0.0, 0.0};
  346. if (incx == 1 && incy == 1) {
  347. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  348. zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
  349. zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
  350. }
  351. } else {
  352. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  353. zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
  354. zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
  355. }
  356. }
  357. pCf(z) = zdotc;
  358. }
  359. #else
  360. _Complex float zdotc = 0.0;
  361. if (incx == 1 && incy == 1) {
  362. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  363. zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
  364. }
  365. } else {
  366. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  367. zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
  368. }
  369. }
  370. pCf(z) = zdotc;
  371. }
  372. #endif
  373. static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  374. integer n = *n_, incx = *incx_, incy = *incy_, i;
  375. #ifdef _MSC_VER
  376. _Dcomplex zdotc = {0.0, 0.0};
  377. if (incx == 1 && incy == 1) {
  378. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  379. zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
  380. zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
  381. }
  382. } else {
  383. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  384. zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
  385. zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
  386. }
  387. }
  388. pCd(z) = zdotc;
  389. }
  390. #else
  391. _Complex double zdotc = 0.0;
  392. if (incx == 1 && incy == 1) {
  393. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  394. zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
  395. }
  396. } else {
  397. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  398. zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
  399. }
  400. }
  401. pCd(z) = zdotc;
  402. }
  403. #endif
  404. static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  405. integer n = *n_, incx = *incx_, incy = *incy_, i;
  406. #ifdef _MSC_VER
  407. _Fcomplex zdotc = {0.0, 0.0};
  408. if (incx == 1 && incy == 1) {
  409. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  410. zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
  411. zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
  412. }
  413. } else {
  414. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  415. zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
  416. zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
  417. }
  418. }
  419. pCf(z) = zdotc;
  420. }
  421. #else
  422. _Complex float zdotc = 0.0;
  423. if (incx == 1 && incy == 1) {
  424. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  425. zdotc += Cf(&x[i]) * Cf(&y[i]);
  426. }
  427. } else {
  428. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  429. zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
  430. }
  431. }
  432. pCf(z) = zdotc;
  433. }
  434. #endif
  435. static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  436. integer n = *n_, incx = *incx_, incy = *incy_, i;
  437. #ifdef _MSC_VER
  438. _Dcomplex zdotc = {0.0, 0.0};
  439. if (incx == 1 && incy == 1) {
  440. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  441. zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
  442. zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
  443. }
  444. } else {
  445. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  446. zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
  447. zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
  448. }
  449. }
  450. pCd(z) = zdotc;
  451. }
  452. #else
  453. _Complex double zdotc = 0.0;
  454. if (incx == 1 && incy == 1) {
  455. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  456. zdotc += Cd(&x[i]) * Cd(&y[i]);
  457. }
  458. } else {
  459. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  460. zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
  461. }
  462. }
  463. pCd(z) = zdotc;
  464. }
  465. #endif
  466. #endif
  467. /* Common Block Declarations */
  468. struct {
  469. integer icase, n, incx, incy, mode;
  470. logical pass;
  471. } combla_;
  472. #define combla_1 combla_
  473. /* Table of constant values */
  474. static integer c__1 = 1;
  475. static real c_b34 = (float)1.;
  476. /* Main program */ int main ()
  477. {
  478. /* Initialized data */
  479. static real sfac = (float)9.765625e-4;
  480. /* Local variables */
  481. extern /* Subroutine */ int check0_(), check1_(), check2_(), check3_();
  482. static integer ic;
  483. extern /* Subroutine */ int header_();
  484. /* Test program for the REAL Level 1 CBLAS. */
  485. /* Based upon the original CBLAS test routine together with: */
  486. /* F06EAF Example Program Text */
  487. /* .. Parameters .. */
  488. /* .. Scalars in Common .. */
  489. /* .. Local Scalars .. */
  490. /* .. External Subroutines .. */
  491. /* .. Common blocks .. */
  492. /* .. Data statements .. */
  493. /* .. Executable Statements .. */
  494. printf("Real CBLAS Test Program Results\n");
  495. for (ic = 1; ic <= 11; ++ic) {
  496. combla_1.icase = ic;
  497. header_();
  498. /* .. Initialize PASS, INCX, INCY, and MODE for a new case. .. */
  499. /* .. the value 9999 for INCX, INCY or MODE will appear in the .. */
  500. /* .. detailed output, if any, for cases that do not involve .. */
  501. /* .. these parameters .. */
  502. combla_1.pass = TRUE_;
  503. combla_1.incx = 9999;
  504. combla_1.incy = 9999;
  505. combla_1.mode = 9999;
  506. if (combla_1.icase == 3) {
  507. check0_(&sfac);
  508. } else if (combla_1.icase == 7 || combla_1.icase == 8 ||
  509. combla_1.icase == 9 || combla_1.icase == 10) {
  510. check1_(&sfac);
  511. } else if (combla_1.icase == 1 || combla_1.icase == 2 ||
  512. combla_1.icase == 5 || combla_1.icase == 6) {
  513. check2_(&sfac);
  514. } else if (combla_1.icase == 4 || combla_1.icase == 11) {
  515. check3_(&sfac);
  516. }
  517. /* -- Print */
  518. if (combla_1.pass) {
  519. printf(" ----- PASS -----\n");
  520. }
  521. /* L20: */
  522. }
  523. exit(0);
  524. } /* MAIN__ */
  525. /* Subroutine */ int header_()
  526. {
  527. /* Initialized data */
  528. static char l[15][13] = {"CBLAS_SDOT " , "CBLAS_SAXPY " , "CBLAS_SROTG " ,
  529. "CBLAS_SROT " , "CBLAS_SCOPY " , "CBLAS_SSWAP " , "CBLAS_SNRM2 " , "CBLAS_SASUM ",
  530. "CBLAS_SSCAL " , "CBLAS_ISAMAX", "CBLAS_SROTM "};
  531. /* Fortran I/O blocks */
  532. /* .. Parameters .. */
  533. /* .. Scalars in Common .. */
  534. /* .. Local Arrays .. */
  535. /* .. Common blocks .. */
  536. /* .. Data statements .. */
  537. /* .. Executable Statements .. */
  538. printf("\nTest of subprogram number %3d %15s",combla_1.icase,l[combla_1.icase-1]);
  539. return 0;
  540. } /* header_ */
  541. /* Subroutine */ int check0_(sfac)
  542. real *sfac;
  543. {
  544. /* Initialized data */
  545. static real ds1[8] = { (float).8,(float).6,(float).8,(float)-.6,(float).8,
  546. (float)0.,(float)1.,(float)0. };
  547. static real datrue[8] = { (float).5,(float).5,(float).5,(float)-.5,(float)
  548. -.5,(float)0.,(float)1.,(float)1. };
  549. static real dbtrue[8] = { (float)0.,(float).6,(float)0.,(float)-.6,(float)
  550. 0.,(float)0.,(float)1.,(float)0. };
  551. static real da1[8] = { (float).3,(float).4,(float)-.3,(float)-.4,(float)
  552. -.3,(float)0.,(float)0.,(float)1. };
  553. static real db1[8] = { (float).4,(float).3,(float).4,(float).3,(float)-.4,
  554. (float)0.,(float)1.,(float)0. };
  555. static real dc1[8] = { (float).6,(float).8,(float)-.6,(float).8,(float).6,
  556. (float)1.,(float)0.,(float)1. };
  557. /* Local variables */
  558. static integer k;
  559. extern /* Subroutine */ int srotgtest_(), stest1_();
  560. static real sa, sb, sc, ss;
  561. /* .. Parameters .. */
  562. /* .. Scalar Arguments .. */
  563. /* .. Scalars in Common .. */
  564. /* .. Local Scalars .. */
  565. /* .. Local Arrays .. */
  566. /* .. External Subroutines .. */
  567. /* .. Common blocks .. */
  568. /* .. Data statements .. */
  569. /* .. Executable Statements .. */
  570. /* Compute true values which cannot be prestored */
  571. /* in decimal notation */
  572. dbtrue[0] = (float)1.6666666666666667;
  573. dbtrue[2] = (float)-1.6666666666666667;
  574. dbtrue[4] = (float)1.6666666666666667;
  575. for (k = 1; k <= 8; ++k) {
  576. /* .. Set N=K for identification in output if any .. */
  577. combla_1.n = k;
  578. if (combla_1.icase == 3) {
  579. /* .. SROTGTEST .. */
  580. if (k > 8) {
  581. goto L40;
  582. }
  583. sa = da1[k - 1];
  584. sb = db1[k - 1];
  585. srotgtest_(&sa, &sb, &sc, &ss);
  586. stest1_(&sa, &datrue[k - 1], &datrue[k - 1], sfac);
  587. stest1_(&sb, &dbtrue[k - 1], &dbtrue[k - 1], sfac);
  588. stest1_(&sc, &dc1[k - 1], &dc1[k - 1], sfac);
  589. stest1_(&ss, &ds1[k - 1], &ds1[k - 1], sfac);
  590. } else {
  591. fprintf (stderr,"Shouldn't be here in CHECK0\n");
  592. exit(0);
  593. }
  594. /* L20: */
  595. }
  596. L40:
  597. return 0;
  598. } /* check0_ */
  599. /* Subroutine */ int check1_(sfac)
  600. real *sfac;
  601. {
  602. /* Initialized data */
  603. static real sa[10] = { (float).3,(float)-1.,(float)0.,(float)1.,(float).3,
  604. (float).3,(float).3,(float).3,(float).3,(float).3 };
  605. static real dv[80] /* was [8][5][2] */ = { (float).1,(float)2.,(float)2.,
  606. (float)2.,(float)2.,(float)2.,(float)2.,(float)2.,(float).3,(
  607. float)3.,(float)3.,(float)3.,(float)3.,(float)3.,(float)3.,(float)
  608. 3.,(float).3,(float)-.4,(float)4.,(float)4.,(float)4.,(float)4.,(
  609. float)4.,(float)4.,(float).2,(float)-.6,(float).3,(float)5.,(
  610. float)5.,(float)5.,(float)5.,(float)5.,(float).1,(float)-.3,(
  611. float).5,(float)-.1,(float)6.,(float)6.,(float)6.,(float)6.,(
  612. float).1,(float)8.,(float)8.,(float)8.,(float)8.,(float)8.,(float)
  613. 8.,(float)8.,(float).3,(float)9.,(float)9.,(float)9.,(float)9.,(
  614. float)9.,(float)9.,(float)9.,(float).3,(float)2.,(float)-.4,(
  615. float)2.,(float)2.,(float)2.,(float)2.,(float)2.,(float).2,(float)
  616. 3.,(float)-.6,(float)5.,(float).3,(float)2.,(float)2.,(float)2.,(
  617. float).1,(float)4.,(float)-.3,(float)6.,(float)-.5,(float)7.,(
  618. float)-.1,(float)3. };
  619. static real dtrue1[5] = { (float)0.,(float).3,(float).5,(float).7,(float)
  620. .6 };
  621. static real dtrue3[5] = { (float)0.,(float).3,(float).7,(float)1.1,(float)
  622. 1. };
  623. static real dtrue5[80] /* was [8][5][2] */ = { (float).1,(float)2.,(
  624. float)2.,(float)2.,(float)2.,(float)2.,(float)2.,(float)2.,(float)
  625. -.3,(float)3.,(float)3.,(float)3.,(float)3.,(float)3.,(float)3.,(
  626. float)3.,(float)0.,(float)0.,(float)4.,(float)4.,(float)4.,(float)
  627. 4.,(float)4.,(float)4.,(float).2,(float)-.6,(float).3,(float)5.,(
  628. float)5.,(float)5.,(float)5.,(float)5.,(float).03,(float)-.09,(
  629. float).15,(float)-.03,(float)6.,(float)6.,(float)6.,(float)6.,(
  630. float).1,(float)8.,(float)8.,(float)8.,(float)8.,(float)8.,(float)
  631. 8.,(float)8.,(float).09,(float)9.,(float)9.,(float)9.,(float)9.,(
  632. float)9.,(float)9.,(float)9.,(float).09,(float)2.,(float)-.12,(
  633. float)2.,(float)2.,(float)2.,(float)2.,(float)2.,(float).06,(
  634. float)3.,(float)-.18,(float)5.,(float).09,(float)2.,(float)2.,(
  635. float)2.,(float).03,(float)4.,(float)-.09,(float)6.,(float)-.15,(
  636. float)7.,(float)-.03,(float)3. };
  637. static integer itrue2[5] = { 0,1,2,2,3 };
  638. /* System generated locals */
  639. integer i__1;
  640. real r__1;
  641. /* Local variables */
  642. static integer i__;
  643. extern real snrm2test_();
  644. static real stemp[1], strue[8];
  645. extern /* Subroutine */ int stest_(), sscaltest_();
  646. extern real sasumtest_();
  647. extern /* Subroutine */ int itest1_(), stest1_();
  648. static real sx[8];
  649. static integer np1;
  650. extern integer isamaxtest_();
  651. static integer len;
  652. /* .. Parameters .. */
  653. /* .. Scalar Arguments .. */
  654. /* .. Scalars in Common .. */
  655. /* .. Local Scalars .. */
  656. /* .. Local Arrays .. */
  657. /* .. External Functions .. */
  658. /* .. External Subroutines .. */
  659. /* .. Intrinsic Functions .. */
  660. /* .. Common blocks .. */
  661. /* .. Data statements .. */
  662. /* .. Executable Statements .. */
  663. for (combla_1.incx = 1; combla_1.incx <= 2; ++combla_1.incx) {
  664. for (np1 = 1; np1 <= 5; ++np1) {
  665. combla_1.n = np1 - 1;
  666. len = f2cmax(combla_1.n,1) << 1;
  667. /* .. Set vector arguments .. */
  668. i__1 = len;
  669. for (i__ = 1; i__ <= i__1; ++i__) {
  670. sx[i__ - 1] = dv[i__ + (np1 + combla_1.incx * 5 << 3) - 49];
  671. /* L20: */
  672. }
  673. if (combla_1.icase == 7) {
  674. /* .. SNRM2TEST .. */
  675. stemp[0] = dtrue1[np1 - 1];
  676. r__1 = snrm2test_(&combla_1.n, sx, &combla_1.incx);
  677. stest1_(&r__1, stemp, stemp, sfac);
  678. } else if (combla_1.icase == 8) {
  679. /* .. SASUMTEST .. */
  680. stemp[0] = dtrue3[np1 - 1];
  681. r__1 = sasumtest_(&combla_1.n, sx, &combla_1.incx);
  682. stest1_(&r__1, stemp, stemp, sfac);
  683. } else if (combla_1.icase == 9) {
  684. /* .. SSCALTEST .. */
  685. sscaltest_(&combla_1.n, &sa[(combla_1.incx - 1) * 5 + np1 - 1]
  686. , sx, &combla_1.incx);
  687. i__1 = len;
  688. for (i__ = 1; i__ <= i__1; ++i__) {
  689. strue[i__ - 1] = dtrue5[i__ + (np1 + combla_1.incx * 5 <<
  690. 3) - 49];
  691. /* L40: */
  692. }
  693. stest_(&len, sx, strue, strue, sfac);
  694. } else if (combla_1.icase == 10) {
  695. /* .. ISAMAXTEST .. */
  696. i__1 = isamaxtest_(&combla_1.n, sx, &combla_1.incx);
  697. itest1_(&i__1, &itrue2[np1 - 1]);
  698. } else {
  699. fprintf(stderr, " Shouldn't be here in CHECK1\n");
  700. exit(0);
  701. }
  702. /* L60: */
  703. }
  704. /* L80: */
  705. }
  706. return 0;
  707. } /* check1_ */
  708. /* Subroutine */ int check2_(sfac)
  709. real *sfac;
  710. {
  711. /* Initialized data */
  712. static real sa = (float).3;
  713. static integer incxs[4] = { 1,2,-2,-1 };
  714. static integer incys[4] = { 1,-2,1,-2 };
  715. static integer lens[8] /* was [4][2] */ = { 1,1,2,4,1,1,3,7 };
  716. static integer ns[4] = { 0,1,2,4 };
  717. static real dx1[7] = { (float).6,(float).1,(float)-.5,(float).8,(float).9,
  718. (float)-.3,(float)-.4 };
  719. static real dy1[7] = { (float).5,(float)-.9,(float).3,(float).7,(float)
  720. -.6,(float).2,(float).8 };
  721. static real dt7[16] /* was [4][4] */ = { (float)0.,(float).3,(float).21,(
  722. float).62,(float)0.,(float).3,(float)-.07,(float).85,(float)0.,(
  723. float).3,(float)-.79,(float)-.74,(float)0.,(float).3,(float).33,(
  724. float)1.27 };
  725. static real dt8[112] /* was [7][4][4] */ = { (float).5,(float)0.,(
  726. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float).68,(
  727. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  728. .68,(float)-.87,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,
  729. (float).68,(float)-.87,(float).15,(float).94,(float)0.,(float)0.,(
  730. float)0.,(float).5,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  731. 0.,(float)0.,(float).68,(float)0.,(float)0.,(float)0.,(float)0.,(
  732. float)0.,(float)0.,(float).35,(float)-.9,(float).48,(float)0.,(
  733. float)0.,(float)0.,(float)0.,(float).38,(float)-.9,(float).57,(
  734. float).7,(float)-.75,(float).2,(float).98,(float).5,(float)0.,(
  735. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float).68,(
  736. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  737. .35,(float)-.72,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,
  738. (float).38,(float)-.63,(float).15,(float).88,(float)0.,(float)0.,(
  739. float)0.,(float).5,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  740. 0.,(float)0.,(float).68,(float)0.,(float)0.,(float)0.,(float)0.,(
  741. float)0.,(float)0.,(float).68,(float)-.9,(float).33,(float)0.,(
  742. float)0.,(float)0.,(float)0.,(float).68,(float)-.9,(float).33,(
  743. float).7,(float)-.75,(float).2,(float)1.04 };
  744. static real dt10x[112] /* was [7][4][4] */ = { (float).6,(float)0.,(
  745. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float).5,(float)
  746. 0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float).5,(
  747. float)-.9,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(
  748. float).5,(float)-.9,(float).3,(float).7,(float)0.,(float)0.,(
  749. float)0.,(float).6,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  750. 0.,(float)0.,(float).5,(float)0.,(float)0.,(float)0.,(float)0.,(
  751. float)0.,(float)0.,(float).3,(float).1,(float).5,(float)0.,(float)
  752. 0.,(float)0.,(float)0.,(float).8,(float).1,(float)-.6,(float).8,(
  753. float).3,(float)-.3,(float).5,(float).6,(float)0.,(float)0.,(
  754. float)0.,(float)0.,(float)0.,(float)0.,(float).5,(float)0.,(float)
  755. 0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)-.9,(float).1,(
  756. float).5,(float)0.,(float)0.,(float)0.,(float)0.,(float).7,(float)
  757. .1,(float).3,(float).8,(float)-.9,(float)-.3,(float).5,(float).6,(
  758. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  759. .5,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(
  760. float).5,(float).3,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  761. 0.,(float).5,(float).3,(float)-.6,(float).8,(float)0.,(float)0.,(
  762. float)0. };
  763. static real dt10y[112] /* was [7][4][4] */ = { (float).5,(float)0.,(
  764. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float).6,(float)
  765. 0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float).6,(
  766. float).1,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  767. .6,(float).1,(float)-.5,(float).8,(float)0.,(float)0.,(float)0.,(
  768. float).5,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  769. 0.,(float).6,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(
  770. float)0.,(float)-.5,(float)-.9,(float).6,(float)0.,(float)0.,(
  771. float)0.,(float)0.,(float)-.4,(float)-.9,(float).9,(float).7,(
  772. float)-.5,(float).2,(float).6,(float).5,(float)0.,(float)0.,(
  773. float)0.,(float)0.,(float)0.,(float)0.,(float).6,(float)0.,(float)
  774. 0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)-.5,(float).6,(
  775. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)-.4,(
  776. float).9,(float)-.5,(float).6,(float)0.,(float)0.,(float)0.,(
  777. float).5,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  778. 0.,(float).6,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(
  779. float)0.,(float).6,(float)-.9,(float).1,(float)0.,(float)0.,(
  780. float)0.,(float)0.,(float).6,(float)-.9,(float).1,(float).7,(
  781. float)-.5,(float).2,(float).8 };
  782. static real ssize1[4] = { (float)0.,(float).3,(float)1.6,(float)3.2 };
  783. static real ssize2[28] /* was [14][2] */ = { (float)0.,(float)0.,(
  784. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  785. 0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)1.17,(
  786. float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)
  787. 1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(
  788. float)1.17,(float)1.17 };
  789. /* System generated locals */
  790. integer i__1;
  791. real r__1;
  792. /* Local variables */
  793. static integer lenx, leny;
  794. extern real sdottest_();
  795. static integer i__, j, ksize;
  796. extern /* Subroutine */ int stest_(), scopytest_(), sswaptest_(),
  797. saxpytest_();
  798. static integer ki;
  799. extern /* Subroutine */ int stest1_();
  800. static integer kn, mx, my;
  801. static real sx[7], sy[7], stx[7], sty[7];
  802. /* .. Parameters .. */
  803. /* .. Scalar Arguments .. */
  804. /* .. Scalars in Common .. */
  805. /* .. Local Scalars .. */
  806. /* .. Local Arrays .. */
  807. /* .. External Functions .. */
  808. /* .. External Subroutines .. */
  809. /* .. Intrinsic Functions .. */
  810. /* .. Common blocks .. */
  811. /* .. Data statements .. */
  812. /* .. Executable Statements .. */
  813. for (ki = 1; ki <= 4; ++ki) {
  814. combla_1.incx = incxs[ki - 1];
  815. combla_1.incy = incys[ki - 1];
  816. mx = abs(combla_1.incx);
  817. my = abs(combla_1.incy);
  818. for (kn = 1; kn <= 4; ++kn) {
  819. combla_1.n = ns[kn - 1];
  820. ksize = f2cmin(2,kn);
  821. lenx = lens[kn + (mx << 2) - 5];
  822. leny = lens[kn + (my << 2) - 5];
  823. /* .. Initialize all argument arrays .. */
  824. for (i__ = 1; i__ <= 7; ++i__) {
  825. sx[i__ - 1] = dx1[i__ - 1];
  826. sy[i__ - 1] = dy1[i__ - 1];
  827. /* L20: */
  828. }
  829. if (combla_1.icase == 1) {
  830. /* .. SDOTTEST .. */
  831. r__1 = sdottest_(&combla_1.n, sx, &combla_1.incx, sy, &
  832. combla_1.incy);
  833. stest1_(&r__1, &dt7[kn + (ki << 2) - 5], &ssize1[kn - 1],
  834. sfac);
  835. } else if (combla_1.icase == 2) {
  836. /* .. SAXPYTEST .. */
  837. saxpytest_(&combla_1.n, &sa, sx, &combla_1.incx, sy, &
  838. combla_1.incy);
  839. i__1 = leny;
  840. for (j = 1; j <= i__1; ++j) {
  841. sty[j - 1] = dt8[j + (kn + (ki << 2)) * 7 - 36];
  842. /* L40: */
  843. }
  844. stest_(&leny, sy, sty, &ssize2[ksize * 14 - 14], sfac);
  845. } else if (combla_1.icase == 5) {
  846. /* .. SCOPYTEST .. */
  847. for (i__ = 1; i__ <= 7; ++i__) {
  848. sty[i__ - 1] = dt10y[i__ + (kn + (ki << 2)) * 7 - 36];
  849. /* L60: */
  850. }
  851. scopytest_(&combla_1.n, sx, &combla_1.incx, sy, &
  852. combla_1.incy);
  853. stest_(&leny, sy, sty, ssize2, &c_b34);
  854. } else if (combla_1.icase == 6) {
  855. /* .. SSWAPTEST .. */
  856. sswaptest_(&combla_1.n, sx, &combla_1.incx, sy, &
  857. combla_1.incy);
  858. for (i__ = 1; i__ <= 7; ++i__) {
  859. stx[i__ - 1] = dt10x[i__ + (kn + (ki << 2)) * 7 - 36];
  860. sty[i__ - 1] = dt10y[i__ + (kn + (ki << 2)) * 7 - 36];
  861. /* L80: */
  862. }
  863. stest_(&lenx, sx, stx, ssize2, &c_b34);
  864. stest_(&leny, sy, sty, ssize2, &c_b34);
  865. } else {
  866. fprintf(stderr,"Shouldn't be here in CHECK2\n");
  867. exit(0);
  868. }
  869. /* L100: */
  870. }
  871. /* L120: */
  872. }
  873. return 0;
  874. } /* check2_ */
  875. /* Subroutine */ int check3_(sfac)
  876. real *sfac;
  877. {
  878. /* Initialized data */
  879. static integer incxs[7] = { 1,1,2,2,-2,-1,-2 };
  880. static integer incys[7] = { 1,2,2,-2,1,-2,-2 };
  881. static integer ns[7] = { 0,1,2,4,5,8,9 };
  882. static real dx[19] = { (float).6,(float).1,(float)-.5,(float).8,(float).9,
  883. (float)-.3,(float)-.4,(float).5,(float)-.9,(float).3,(float).7,(
  884. float)-.6,(float).2,(float).8,(float)-.46,(float).78,(float)-.46,(
  885. float)-.22,(float)1.06 };
  886. static real dy[19] = { (float).5,(float)-.9,(float).3,(float).7,(float)
  887. -.6,(float).2,(float).6,(float).1,(float)-.5,(float).8,(float).9,(
  888. float)-.3,(float).96,(float).1,(float)-.76,(float).8,(float).9,(
  889. float).66,(float).8 };
  890. static real sc = (float).8;
  891. static real ss = (float).6;
  892. static real param[20] /* was [5][4] */ = { (float)-2.,(float)1.,(
  893. float)0.,(float)0.,(float)1.,(float)-1.,(float).2,(float).3,(
  894. float).4,(float).5,(float)0.,(float)1.,(float).3,(float).4,(float)
  895. 1.,(float)1.,(float).2,(float)-1.,(float)1.,(float).5 };
  896. static integer len = 19;
  897. static real ssize2[38] /* was [19][2] */ = { (float)0.,(float)0.,(
  898. float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)
  899. 0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(float)0.,(
  900. float)0.,(float)0.,(float)0.,(float)0.,(float)1.17,(float)1.17,(
  901. float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)
  902. 1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(
  903. float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)1.17,(float)
  904. 1.17 };
  905. /* Local variables */
  906. extern /* Subroutine */ srottest_();
  907. static integer i__, k, ksize;
  908. extern /* Subroutine */ int stest_(), srotmtest_();
  909. static integer ki, kn;
  910. static real sx[19], sy[19], sparam[5], stx[19], sty[19];
  911. /* .. Parameters .. */
  912. /* .. Scalar Arguments .. */
  913. /* .. Scalars in Common .. */
  914. /* .. Local Scalars .. */
  915. /* .. Local Arrays .. */
  916. /* .. External Subroutines .. */
  917. /* .. Intrinsic Functions .. */
  918. /* .. Common blocks .. */
  919. /* .. Data statements .. */
  920. /* .. Executable Statements .. */
  921. for (ki = 1; ki <= 7; ++ki) {
  922. combla_1.incx = incxs[ki - 1];
  923. combla_1.incy = incys[ki - 1];
  924. for (kn = 1; kn <= 7; ++kn) {
  925. combla_1.n = ns[kn - 1];
  926. ksize = f2cmin(2,kn);
  927. if (combla_1.icase == 4) {
  928. /* .. SROTTEST .. */
  929. for (i__ = 1; i__ <= 19; ++i__) {
  930. sx[i__ - 1] = dx[i__ - 1];
  931. sy[i__ - 1] = dy[i__ - 1];
  932. stx[i__ - 1] = dx[i__ - 1];
  933. sty[i__ - 1] = dy[i__ - 1];
  934. /* L20: */
  935. }
  936. srottest_(&combla_1.n, sx, &combla_1.incx, sy, &combla_1.incy,
  937. &sc, &ss);
  938. srot_(&combla_1.n, stx, &combla_1.incx, sty, &combla_1.incy, &
  939. sc, &ss);
  940. stest_(&len, sx, stx, &ssize2[ksize * 19 - 19], sfac);
  941. stest_(&len, sy, sty, &ssize2[ksize * 19 - 19], sfac);
  942. } else if (combla_1.icase == 11) {
  943. /* .. SROTMTEST .. */
  944. for (i__ = 1; i__ <= 19; ++i__) {
  945. sx[i__ - 1] = dx[i__ - 1];
  946. sy[i__ - 1] = dy[i__ - 1];
  947. stx[i__ - 1] = dx[i__ - 1];
  948. sty[i__ - 1] = dy[i__ - 1];
  949. /* L90: */
  950. }
  951. for (i__ = 1; i__ <= 4; ++i__) {
  952. for (k = 1; k <= 5; ++k) {
  953. sparam[k - 1] = param[k + i__ * 5 - 6];
  954. /* L80: */
  955. }
  956. srotmtest_(&combla_1.n, sx, &combla_1.incx, sy, &
  957. combla_1.incy, sparam);
  958. srotm_(&combla_1.n, stx, &combla_1.incx, sty, &
  959. combla_1.incy, sparam);
  960. stest_(&len, sx, stx, &ssize2[ksize * 19 - 19], sfac);
  961. stest_(&len, sy, sty, &ssize2[ksize * 19 - 19], sfac);
  962. /* L70: */
  963. }
  964. } else {
  965. fprintf(stderr,"Shouldn't be here in CHECK3\n");
  966. exit(0);
  967. }
  968. /* L40: */
  969. }
  970. /* L60: */
  971. }
  972. return 0;
  973. } /* check3_ */
  974. /* Subroutine */ int stest_(len, scomp, strue, ssize, sfac)
  975. integer *len;
  976. real *scomp, *strue, *ssize, *sfac;
  977. {
  978. integer i__1;
  979. real r__1, r__2, r__3, r__4, r__5;
  980. /* Local variables */
  981. static integer i__;
  982. extern doublereal sdiff_();
  983. static real sd;
  984. /* ********************************* STEST ************************** */
  985. /* THIS SUBR COMPARES ARRAYS SCOMP() AND STRUE() OF LENGTH LEN TO */
  986. /* SEE IF THE TERM BY TERM DIFFERENCES, MULTIPLIED BY SFAC, ARE */
  987. /* NEGLIGIBLE. */
  988. /* C. L. LAWSON, JPL, 1974 DEC 10 */
  989. /* .. Parameters .. */
  990. /* .. Scalar Arguments .. */
  991. /* .. Array Arguments .. */
  992. /* .. Scalars in Common .. */
  993. /* .. Local Scalars .. */
  994. /* .. External Functions .. */
  995. /* .. Intrinsic Functions .. */
  996. /* .. Common blocks .. */
  997. /* .. Executable Statements .. */
  998. /* Parameter adjustments */
  999. --ssize;
  1000. --strue;
  1001. --scomp;
  1002. /* Function Body */
  1003. i__1 = *len;
  1004. for (i__ = 1; i__ <= i__1; ++i__) {
  1005. sd = scomp[i__] - strue[i__];
  1006. r__4 = (r__1 = ssize[i__], dabs(r__1)) + (r__2 = *sfac * sd, dabs(
  1007. r__2));
  1008. r__5 = (r__3 = ssize[i__], dabs(r__3));
  1009. if (sdiff_(&r__4, &r__5) == (float)0.) {
  1010. goto L40;
  1011. }
  1012. /* HERE SCOMP(I) IS NOT CLOSE TO STRUE(I). */
  1013. if (! combla_1.pass) {
  1014. goto L20;
  1015. }
  1016. /* PRINT FAIL MESSAGE AND HEADER. */
  1017. combla_1.pass = FALSE_;
  1018. printf(" FAIL\n");
  1019. printf("CASE N INCX INCY MODE I COMP(I) TRUE(I) DIFFERENCE SIZE(I)\n");
  1020. L20:
  1021. printf("%4d %3d %5d %5d %5d %3d %36.8f %36.8f %12.4f %12.4f\n",combla_1.icase, combla_1.n,
  1022. combla_1.incx, combla_1.incy, combla_1.mode, i__, scomp[i__], strue[i__], sd, ssize[i__]);
  1023. L40:
  1024. ;
  1025. }
  1026. return 0;
  1027. } /* stest_ */
  1028. /* Subroutine */ int stest1_(scomp1, strue1, ssize, sfac)
  1029. real *scomp1, *strue1, *ssize, *sfac;
  1030. {
  1031. static real scomp[1], strue[1];
  1032. extern /* Subroutine */ int stest_();
  1033. /* ************************* STEST1 ***************************** */
  1034. /* THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN */
  1035. /* REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE */
  1036. /* ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT. */
  1037. /* C.L. LAWSON, JPL, 1978 DEC 6 */
  1038. /* .. Scalar Arguments .. */
  1039. /* .. Array Arguments .. */
  1040. /* .. Local Arrays .. */
  1041. /* .. External Subroutines .. */
  1042. /* .. Executable Statements .. */
  1043. /* Parameter adjustments */
  1044. --ssize;
  1045. /* Function Body */
  1046. scomp[0] = *scomp1;
  1047. strue[0] = *strue1;
  1048. stest_(&c__1, scomp, strue, &ssize[1], sfac);
  1049. return 0;
  1050. } /* stest1_ */
  1051. doublereal sdiff_(sa, sb)
  1052. real *sa, *sb;
  1053. {
  1054. /* System generated locals */
  1055. real ret_val;
  1056. /* ********************************* SDIFF ************************** */
  1057. /* COMPUTES DIFFERENCE OF TWO NUMBERS. C. L. LAWSON, JPL 1974 FEB 15 */
  1058. /* .. Scalar Arguments .. */
  1059. /* .. Executable Statements .. */
  1060. ret_val = *sa - *sb;
  1061. return ret_val;
  1062. } /* sdiff_ */
  1063. /* Subroutine */ int itest1_(icomp, itrue)
  1064. integer *icomp, *itrue;
  1065. {
  1066. /* Local variables */
  1067. static integer id;
  1068. /* ********************************* ITEST1 ************************* */
  1069. /* THIS SUBROUTINE COMPARES THE VARIABLES ICOMP AND ITRUE FOR */
  1070. /* EQUALITY. */
  1071. /* C. L. LAWSON, JPL, 1974 DEC 10 */
  1072. /* .. Parameters .. */
  1073. /* .. Scalar Arguments .. */
  1074. /* .. Scalars in Common .. */
  1075. /* .. Local Scalars .. */
  1076. /* .. Common blocks .. */
  1077. /* .. Executable Statements .. */
  1078. if (*icomp == *itrue) {
  1079. goto L40;
  1080. }
  1081. /* HERE ICOMP IS NOT EQUAL TO ITRUE. */
  1082. if (! combla_1.pass) {
  1083. goto L20;
  1084. }
  1085. /* PRINT FAIL MESSAGE AND HEADER. */
  1086. combla_1.pass = FALSE_;
  1087. printf(" FAIL\n");
  1088. printf("CASE N INCX INCY MODE COMP TRUE DIFFERENCE\n");
  1089. L20:
  1090. id = *icomp - *itrue;
  1091. printf("%4d %3d %5d %5d %5d %36d %36d %12d\n",
  1092. combla_1.icase, combla_1.n, combla_1.incx, combla_1.incy, combla_1.mode, *icomp,*itrue,id);
  1093. L40:
  1094. return 0;
  1095. } /* itest1_ */
  1096. #if 0
  1097. /* Subroutine */ int srot_(n, sx, incx, sy, incy, c__, s)
  1098. integer *n;
  1099. real *sx;
  1100. integer *incx;
  1101. real *sy;
  1102. integer *incy;
  1103. real *c__, *s;
  1104. {
  1105. /* System generated locals */
  1106. integer i__1;
  1107. /* Local variables */
  1108. static integer i__;
  1109. static real stemp;
  1110. static integer ix, iy;
  1111. /* --Reference BLAS level1 routine (version 3.8.0) -- */
  1112. /* --Reference BLAS is a software package provided by Univ. of Tennessee, -- */
  1113. /* --Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  1114. /* November 2017 */
  1115. /* .. Scalar Arguments .. */
  1116. /* .. */
  1117. /* .. Array Arguments .. */
  1118. /* .. */
  1119. /* .. Local Scalars .. */
  1120. /* .. */
  1121. /* Parameter adjustments */
  1122. --sy;
  1123. --sx;
  1124. /* Function Body */
  1125. if (*n <= 0) {
  1126. return 0;
  1127. }
  1128. if (*incx == 1 && *incy == 1) {
  1129. i__1 = *n;
  1130. for (i__ = 1; i__ <= i__1; ++i__) {
  1131. stemp = *c__ * sx[i__] + *s * sy[i__];
  1132. sy[i__] = *c__ * sy[i__] - *s * sx[i__];
  1133. sx[i__] = stemp;
  1134. }
  1135. } else {
  1136. ix = 1;
  1137. iy = 1;
  1138. if (*incx < 0) {
  1139. ix = (-(*n) + 1) * *incx + 1;
  1140. }
  1141. if (*incy < 0) {
  1142. iy = (-(*n) + 1) * *incy + 1;
  1143. }
  1144. i__1 = *n;
  1145. for (i__ = 1; i__ <= i__1; ++i__) {
  1146. stemp = *c__ * sx[ix] + *s * sy[iy];
  1147. sy[iy] = *c__ * sy[iy] - *s * sx[ix];
  1148. sx[ix] = stemp;
  1149. ix += *incx;
  1150. iy += *incy;
  1151. }
  1152. }
  1153. return 0;
  1154. } /* srot_ */
  1155. /* Subroutine */ int srotm_(n, sx, incx, sy, incy, sparam)
  1156. integer *n;
  1157. real *sx;
  1158. integer *incx;
  1159. real *sy;
  1160. integer *incy;
  1161. real *sparam;
  1162. {
  1163. /* Initialized data */
  1164. static real zero = (float)0.;
  1165. static real two = (float)2.;
  1166. /* System generated locals */
  1167. integer i__1, i__2;
  1168. /* Local variables */
  1169. static integer i__;
  1170. static real w, z__, sflag;
  1171. static integer kx, ky, nsteps;
  1172. static real sh11, sh12, sh21, sh22;
  1173. /* --Reference BLAS level1 routine (version 3.8.0) -- */
  1174. /* --Reference BLAS is a software package provided by Univ. of Tennessee, -- */
  1175. /* --Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  1176. /* November 2017 */
  1177. /* .. Scalar Arguments .. */
  1178. /* .. */
  1179. /* .. Array Arguments .. */
  1180. /* .. */
  1181. /* ==================================================================== */
  1182. /* .. Local Scalars .. */
  1183. /* .. */
  1184. /* .. Data statements .. */
  1185. /* Parameter adjustments */
  1186. --sparam;
  1187. --sy;
  1188. --sx;
  1189. /* Function Body */
  1190. /* .. */
  1191. sflag = sparam[1];
  1192. if (*n <= 0 || sflag + two == zero) {
  1193. return 0;
  1194. }
  1195. if (*incx == *incy && *incx > 0) {
  1196. nsteps = *n * *incx;
  1197. if (sflag < zero) {
  1198. sh11 = sparam[2];
  1199. sh12 = sparam[4];
  1200. sh21 = sparam[3];
  1201. sh22 = sparam[5];
  1202. i__1 = nsteps;
  1203. i__2 = *incx;
  1204. for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
  1205. w = sx[i__];
  1206. z__ = sy[i__];
  1207. sx[i__] = w * sh11 + z__ * sh12;
  1208. sy[i__] = w * sh21 + z__ * sh22;
  1209. }
  1210. } else if (sflag == zero) {
  1211. sh12 = sparam[4];
  1212. sh21 = sparam[3];
  1213. i__2 = nsteps;
  1214. i__1 = *incx;
  1215. for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
  1216. w = sx[i__];
  1217. z__ = sy[i__];
  1218. sx[i__] = w + z__ * sh12;
  1219. sy[i__] = w * sh21 + z__;
  1220. }
  1221. } else {
  1222. sh11 = sparam[2];
  1223. sh22 = sparam[5];
  1224. i__1 = nsteps;
  1225. i__2 = *incx;
  1226. for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
  1227. w = sx[i__];
  1228. z__ = sy[i__];
  1229. sx[i__] = w * sh11 + z__;
  1230. sy[i__] = -w + sh22 * z__;
  1231. }
  1232. }
  1233. } else {
  1234. kx = 1;
  1235. ky = 1;
  1236. if (*incx < 0) {
  1237. kx = (1 - *n) * *incx + 1;
  1238. }
  1239. if (*incy < 0) {
  1240. ky = (1 - *n) * *incy + 1;
  1241. }
  1242. if (sflag < zero) {
  1243. sh11 = sparam[2];
  1244. sh12 = sparam[4];
  1245. sh21 = sparam[3];
  1246. sh22 = sparam[5];
  1247. i__2 = *n;
  1248. for (i__ = 1; i__ <= i__2; ++i__) {
  1249. w = sx[kx];
  1250. z__ = sy[ky];
  1251. sx[kx] = w * sh11 + z__ * sh12;
  1252. sy[ky] = w * sh21 + z__ * sh22;
  1253. kx += *incx;
  1254. ky += *incy;
  1255. }
  1256. } else if (sflag == zero) {
  1257. sh12 = sparam[4];
  1258. sh21 = sparam[3];
  1259. i__2 = *n;
  1260. for (i__ = 1; i__ <= i__2; ++i__) {
  1261. w = sx[kx];
  1262. z__ = sy[ky];
  1263. sx[kx] = w + z__ * sh12;
  1264. sy[ky] = w * sh21 + z__;
  1265. kx += *incx;
  1266. ky += *incy;
  1267. }
  1268. } else {
  1269. sh11 = sparam[2];
  1270. sh22 = sparam[5];
  1271. i__2 = *n;
  1272. for (i__ = 1; i__ <= i__2; ++i__) {
  1273. w = sx[kx];
  1274. z__ = sy[ky];
  1275. sx[kx] = w * sh11 + z__;
  1276. sy[ky] = -w + sh22 * z__;
  1277. kx += *incx;
  1278. ky += *incy;
  1279. }
  1280. }
  1281. }
  1282. return 0;
  1283. } /* srotm_ */
  1284. #endif