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.

xerbla_array.c 15 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  1. /* f2c.h -- Standard Fortran to C header file */
  2. /** barf [ba:rf] 2. "He suggested using FORTRAN, and everybody barfed."
  3. - From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition) */
  4. #ifndef F2C_INCLUDE
  5. #define F2C_INCLUDE
  6. #include <math.h>
  7. #include <stdlib.h>
  8. #include <string.h>
  9. #include <stdio.h>
  10. #include <complex.h>
  11. #ifdef complex
  12. #undef complex
  13. #endif
  14. #ifdef I
  15. #undef I
  16. #endif
  17. typedef int integer;
  18. typedef unsigned int uinteger;
  19. typedef char *address;
  20. typedef short int shortint;
  21. typedef float real;
  22. typedef double doublereal;
  23. typedef struct { real r, i; } complex;
  24. typedef struct { doublereal r, i; } doublecomplex;
  25. static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
  26. static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
  27. static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
  28. static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
  29. #define pCf(z) (*_pCf(z))
  30. #define pCd(z) (*_pCd(z))
  31. typedef int logical;
  32. typedef short int shortlogical;
  33. typedef char logical1;
  34. typedef char integer1;
  35. #define TRUE_ (1)
  36. #define FALSE_ (0)
  37. /* Extern is for use with -E */
  38. #ifndef Extern
  39. #define Extern extern
  40. #endif
  41. /* I/O stuff */
  42. typedef int flag;
  43. typedef int ftnlen;
  44. typedef int ftnint;
  45. /*external read, write*/
  46. typedef struct
  47. { flag cierr;
  48. ftnint ciunit;
  49. flag ciend;
  50. char *cifmt;
  51. ftnint cirec;
  52. } cilist;
  53. /*internal read, write*/
  54. typedef struct
  55. { flag icierr;
  56. char *iciunit;
  57. flag iciend;
  58. char *icifmt;
  59. ftnint icirlen;
  60. ftnint icirnum;
  61. } icilist;
  62. /*open*/
  63. typedef struct
  64. { flag oerr;
  65. ftnint ounit;
  66. char *ofnm;
  67. ftnlen ofnmlen;
  68. char *osta;
  69. char *oacc;
  70. char *ofm;
  71. ftnint orl;
  72. char *oblnk;
  73. } olist;
  74. /*close*/
  75. typedef struct
  76. { flag cerr;
  77. ftnint cunit;
  78. char *csta;
  79. } cllist;
  80. /*rewind, backspace, endfile*/
  81. typedef struct
  82. { flag aerr;
  83. ftnint aunit;
  84. } alist;
  85. /* inquire */
  86. typedef struct
  87. { flag inerr;
  88. ftnint inunit;
  89. char *infile;
  90. ftnlen infilen;
  91. ftnint *inex; /*parameters in standard's order*/
  92. ftnint *inopen;
  93. ftnint *innum;
  94. ftnint *innamed;
  95. char *inname;
  96. ftnlen innamlen;
  97. char *inacc;
  98. ftnlen inacclen;
  99. char *inseq;
  100. ftnlen inseqlen;
  101. char *indir;
  102. ftnlen indirlen;
  103. char *infmt;
  104. ftnlen infmtlen;
  105. char *inform;
  106. ftnint informlen;
  107. char *inunf;
  108. ftnlen inunflen;
  109. ftnint *inrecl;
  110. ftnint *innrec;
  111. char *inblank;
  112. ftnlen inblanklen;
  113. } inlist;
  114. #define VOID void
  115. union Multitype { /* for multiple entry points */
  116. integer1 g;
  117. shortint h;
  118. integer i;
  119. /* longint j; */
  120. real r;
  121. doublereal d;
  122. complex c;
  123. doublecomplex z;
  124. };
  125. typedef union Multitype Multitype;
  126. struct Vardesc { /* for Namelist */
  127. char *name;
  128. char *addr;
  129. ftnlen *dims;
  130. int type;
  131. };
  132. typedef struct Vardesc Vardesc;
  133. struct Namelist {
  134. char *name;
  135. Vardesc **vars;
  136. int nvars;
  137. };
  138. typedef struct Namelist Namelist;
  139. #define abs(x) ((x) >= 0 ? (x) : -(x))
  140. #define dabs(x) (fabs(x))
  141. #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
  142. #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
  143. #define dmin(a,b) (f2cmin(a,b))
  144. #define dmax(a,b) (f2cmax(a,b))
  145. #define bit_test(a,b) ((a) >> (b) & 1)
  146. #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
  147. #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
  148. #define abort_() { sig_die("Fortran abort routine called", 1); }
  149. #define c_abs(z) (cabsf(Cf(z)))
  150. #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
  151. #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
  152. #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
  153. #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
  154. #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
  155. #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
  156. //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
  157. #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
  158. #define d_abs(x) (fabs(*(x)))
  159. #define d_acos(x) (acos(*(x)))
  160. #define d_asin(x) (asin(*(x)))
  161. #define d_atan(x) (atan(*(x)))
  162. #define d_atn2(x, y) (atan2(*(x),*(y)))
  163. #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
  164. #define r_cnjg(R, Z) { pCf(R) = conj(Cf(Z)); }
  165. #define d_cos(x) (cos(*(x)))
  166. #define d_cosh(x) (cosh(*(x)))
  167. #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
  168. #define d_exp(x) (exp(*(x)))
  169. #define d_imag(z) (cimag(Cd(z)))
  170. #define r_imag(z) (cimag(Cf(z)))
  171. #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  172. #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  173. #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  174. #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  175. #define d_log(x) (log(*(x)))
  176. #define d_mod(x, y) (fmod(*(x), *(y)))
  177. #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
  178. #define d_nint(x) u_nint(*(x))
  179. #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
  180. #define d_sign(a,b) u_sign(*(a),*(b))
  181. #define r_sign(a,b) u_sign(*(a),*(b))
  182. #define d_sin(x) (sin(*(x)))
  183. #define d_sinh(x) (sinh(*(x)))
  184. #define d_sqrt(x) (sqrt(*(x)))
  185. #define d_tan(x) (tan(*(x)))
  186. #define d_tanh(x) (tanh(*(x)))
  187. #define i_abs(x) abs(*(x))
  188. #define i_dnnt(x) ((integer)u_nint(*(x)))
  189. //#define i_len(s, n) (n)
  190. #define i_len(s, n) strlen(s)
  191. #define i_nint(x) ((integer)u_nint(*(x)))
  192. #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
  193. #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
  194. #define pow_si(B,E) spow_ui(*(B),*(E))
  195. #define pow_ri(B,E) spow_ui(*(B),*(E))
  196. #define pow_di(B,E) dpow_ui(*(B),*(E))
  197. #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
  198. #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
  199. #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
  200. #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++ = ' '; }
  201. #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
  202. #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]; }
  203. #define sig_die(s, kill) { exit(1); }
  204. #define s_stop(s, n) {exit(0);}
  205. static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
  206. #define z_abs(z) (cabs(Cd(z)))
  207. #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
  208. #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
  209. #define myexit_() break;
  210. #define mycycle_() continue;
  211. #define myceiling_(w) ceil(w)
  212. #define myhuge_(w) HUGE_VAL
  213. //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
  214. #define mymaxloc_(w,s,e,n) dmaxloc_(w,*(s),*(e),n)
  215. /* procedure parameter types for -A and -C++ */
  216. #define F2C_proc_par_types 1
  217. #ifdef __cplusplus
  218. typedef logical (*L_fp)(...);
  219. #else
  220. typedef logical (*L_fp)();
  221. #endif
  222. static float spow_ui(float x, integer n) {
  223. float pow=1.0; unsigned long int u;
  224. if(n != 0) {
  225. if(n < 0) n = -n, x = 1/x;
  226. for(u = n; ; ) {
  227. if(u & 01) pow *= x;
  228. if(u >>= 1) x *= x;
  229. else break;
  230. }
  231. }
  232. return pow;
  233. }
  234. static double dpow_ui(double x, integer n) {
  235. double pow=1.0; unsigned long int u;
  236. if(n != 0) {
  237. if(n < 0) n = -n, x = 1/x;
  238. for(u = n; ; ) {
  239. if(u & 01) pow *= x;
  240. if(u >>= 1) x *= x;
  241. else break;
  242. }
  243. }
  244. return pow;
  245. }
  246. static _Complex float cpow_ui(_Complex float x, integer n) {
  247. _Complex float pow=1.0; unsigned long int u;
  248. if(n != 0) {
  249. if(n < 0) n = -n, x = 1/x;
  250. for(u = n; ; ) {
  251. if(u & 01) pow *= x;
  252. if(u >>= 1) x *= x;
  253. else break;
  254. }
  255. }
  256. return pow;
  257. }
  258. static _Complex double zpow_ui(_Complex double x, integer n) {
  259. _Complex double pow=1.0; unsigned long int u;
  260. if(n != 0) {
  261. if(n < 0) n = -n, x = 1/x;
  262. for(u = n; ; ) {
  263. if(u & 01) pow *= x;
  264. if(u >>= 1) x *= x;
  265. else break;
  266. }
  267. }
  268. return pow;
  269. }
  270. static integer pow_ii(integer x, integer n) {
  271. integer pow; unsigned long int u;
  272. if (n <= 0) {
  273. if (n == 0 || x == 1) pow = 1;
  274. else if (x != -1) pow = x == 0 ? 1/x : 0;
  275. else n = -n;
  276. }
  277. if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
  278. u = n;
  279. for(pow = 1; ; ) {
  280. if(u & 01) pow *= x;
  281. if(u >>= 1) x *= x;
  282. else break;
  283. }
  284. }
  285. return pow;
  286. }
  287. static integer dmaxloc_(double *w, integer s, integer e, integer *n)
  288. {
  289. double m; integer i, mi;
  290. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  291. if (w[i-1]>m) mi=i ,m=w[i-1];
  292. return mi-s+1;
  293. }
  294. static integer smaxloc_(float *w, integer s, integer e, integer *n)
  295. {
  296. float m; integer i, mi;
  297. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  298. if (w[i-1]>m) mi=i ,m=w[i-1];
  299. return mi-s+1;
  300. }
  301. static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  302. integer n = *n_, incx = *incx_, incy = *incy_, i;
  303. _Complex float zdotc = 0.0;
  304. if (incx == 1 && incy == 1) {
  305. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  306. zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
  307. }
  308. } else {
  309. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  310. zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
  311. }
  312. }
  313. pCf(z) = zdotc;
  314. }
  315. static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  316. integer n = *n_, incx = *incx_, incy = *incy_, i;
  317. _Complex double zdotc = 0.0;
  318. if (incx == 1 && incy == 1) {
  319. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  320. zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
  321. }
  322. } else {
  323. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  324. zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
  325. }
  326. }
  327. pCd(z) = zdotc;
  328. }
  329. static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
  330. integer n = *n_, incx = *incx_, incy = *incy_, i;
  331. _Complex float zdotc = 0.0;
  332. if (incx == 1 && incy == 1) {
  333. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  334. zdotc += Cf(&x[i]) * Cf(&y[i]);
  335. }
  336. } else {
  337. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  338. zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
  339. }
  340. }
  341. pCf(z) = zdotc;
  342. }
  343. static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
  344. integer n = *n_, incx = *incx_, incy = *incy_, i;
  345. _Complex double zdotc = 0.0;
  346. if (incx == 1 && incy == 1) {
  347. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  348. zdotc += Cd(&x[i]) * Cd(&y[i]);
  349. }
  350. } else {
  351. for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
  352. zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
  353. }
  354. }
  355. pCd(z) = zdotc;
  356. }
  357. #endif
  358. /* -- translated by f2c (version 20000121).
  359. You must link the resulting object file with the libraries:
  360. -lf2c -lm (in that order)
  361. */
  362. /* > \brief \b XERBLA_ARRAY */
  363. /* =========== DOCUMENTATION =========== */
  364. /* Online html documentation available at */
  365. /* http://www.netlib.org/lapack/explore-html/ */
  366. /* > \htmlonly */
  367. /* > Download XERBLA_ARRAY + dependencies */
  368. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/xerbla_
  369. array.f"> */
  370. /* > [TGZ]</a> */
  371. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/xerbla_
  372. array.f"> */
  373. /* > [ZIP]</a> */
  374. /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/xerbla_
  375. array.f"> */
  376. /* > [TXT]</a> */
  377. /* > \endhtmlonly */
  378. /* Definition: */
  379. /* =========== */
  380. /* SUBROUTINE XERBLA_ARRAY( SRNAME_ARRAY, SRNAME_LEN, INFO) */
  381. /* INTEGER SRNAME_LEN, INFO */
  382. /* CHARACTER SRNAME_ARRAY(SRNAME_LEN) */
  383. /* > \par Purpose: */
  384. /* ============= */
  385. /* > */
  386. /* > \verbatim */
  387. /* > */
  388. /* > XERBLA_ARRAY assists other languages in calling XERBLA, the LAPACK */
  389. /* > and BLAS error handler. Rather than taking a Fortran string argument */
  390. /* > as the function's name, XERBLA_ARRAY takes an array of single */
  391. /* > characters along with the array's length. XERBLA_ARRAY then copies */
  392. /* > up to 32 characters of that array into a Fortran string and passes */
  393. /* > that to XERBLA. If called with a non-positive SRNAME_LEN, */
  394. /* > XERBLA_ARRAY will call XERBLA with a string of all blank characters. */
  395. /* > */
  396. /* > Say some macro or other device makes XERBLA_ARRAY available to C99 */
  397. /* > by a name lapack_xerbla and with a common Fortran calling convention. */
  398. /* > Then a C99 program could invoke XERBLA via: */
  399. /* > { */
  400. /* > int flen = strlen(__func__); */
  401. /* > lapack_xerbla(__func__, &flen, &info); */
  402. /* > } */
  403. /* > */
  404. /* > Providing XERBLA_ARRAY is not necessary for intercepting LAPACK */
  405. /* > errors. XERBLA_ARRAY calls XERBLA. */
  406. /* > \endverbatim */
  407. /* Arguments: */
  408. /* ========== */
  409. /* > \param[in] SRNAME_ARRAY */
  410. /* > \verbatim */
  411. /* > SRNAME_ARRAY is CHARACTER array, dimension (SRNAME_LEN) */
  412. /* > The name of the routine which called XERBLA_ARRAY. */
  413. /* > \endverbatim */
  414. /* > */
  415. /* > \param[in] SRNAME_LEN */
  416. /* > \verbatim */
  417. /* > SRNAME_LEN is INTEGER */
  418. /* > The length of the name in SRNAME_ARRAY. */
  419. /* > \endverbatim */
  420. /* > */
  421. /* > \param[in] INFO */
  422. /* > \verbatim */
  423. /* > INFO is INTEGER */
  424. /* > The position of the invalid parameter in the parameter list */
  425. /* > of the calling routine. */
  426. /* > \endverbatim */
  427. /* Authors: */
  428. /* ======== */
  429. /* > \author Univ. of Tennessee */
  430. /* > \author Univ. of California Berkeley */
  431. /* > \author Univ. of Colorado Denver */
  432. /* > \author NAG Ltd. */
  433. /* > \date December 2016 */
  434. /* > \ingroup OTHERauxiliary */
  435. /* ===================================================================== */
  436. /* Subroutine */ int xerbla_array_(char *srname_array__, integer *
  437. srname_len__, integer *info, integer srname_array_len)
  438. {
  439. /* System generated locals */
  440. integer i__1, i__2, i__3;
  441. /* Local variables */
  442. integer i__;
  443. extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
  444. char srname[32];
  445. /* -- LAPACK auxiliary routine (version 3.7.0) -- */
  446. /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
  447. /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
  448. /* December 2016 */
  449. /* CHARACTER SRNAME_ARRAY(SRNAME_LEN) */
  450. /* ===================================================================== */
  451. /* Parameter adjustments */
  452. --srname_array__;
  453. /* Function Body */
  454. s_copy(srname, "", (ftnlen)32, (ftnlen)0);
  455. /* Computing MIN */
  456. i__2 = *srname_len__, i__3 = i_len(srname, (ftnlen)32);
  457. i__1 = f2cmin(i__2,i__3);
  458. for (i__ = 1; i__ <= i__1; ++i__) {
  459. *(unsigned char *)&srname[i__ - 1] = *(unsigned char *)&
  460. srname_array__[i__];
  461. }
  462. fprintf(stderr,"xerbla_array calling xerbla with srname #%s#\n",srname);
  463. xerbla_(srname, info, (ftnlen)strlen(srname));
  464. return 0;
  465. } /* xerbla_array__ */