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

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