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_sblat3c.c 96 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333
  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. /* Common Block Declarations */
  224. struct {
  225. integer infot, noutc;
  226. logical ok;
  227. } infoc_;
  228. #define infoc_1 infoc_
  229. struct {
  230. char srnamt[12];
  231. } srnamc_;
  232. #define srnamc_1 srnamc_
  233. /* Table of constant values */
  234. static integer c__1 = 1;
  235. static integer c__65 = 65;
  236. static real c_b89 = (float)1.;
  237. static real c_b103 = (float)0.;
  238. static integer c__6 = 6;
  239. static logical c_true = TRUE_;
  240. static integer c__0 = 0;
  241. static logical c_false = FALSE_;
  242. /* Main program MAIN__() */ int main(void)
  243. {
  244. /* Initialized data */
  245. static char snames[6][13] = {"cblas_sgemm ", "cblas_ssymm ", "cblas_strmm ", "cblas_strsm ", "cblas_ssyrk ", "cblas_ssyr2k"};
  246. /* System generated locals */
  247. integer i__1, i__2, i__3;
  248. real r__1;
  249. /* Local variables */
  250. static integer nalf, idim[9];
  251. static logical same;
  252. static integer nbet, ntra;
  253. static logical rewi;
  254. extern /* Subroutine */ int schk1_(char*, real*, real*, integer*, integer*, logical*, logical*, logical*, integer*, integer*, integer*, real*, integer*, real*, integer*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, integer*, ftnlen);
  255. extern /* Subroutine */ int schk2_(char*, real*, real*, integer*, integer*, logical*, logical*, logical*, integer*, integer*, integer*, real*, integer*, real*, integer*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, integer*, ftnlen);
  256. extern /* Subroutine */ int schk3_(char*, real*, real*, integer*, integer*, logical*, logical*, logical*, integer*, integer*, integer*, real*, integer*, real*, real*, real*, real*, real*, real*, real*, real*, real*, integer*, ftnlen);
  257. extern /* Subroutine */ int schk4_(char*, real*, real*, integer*, integer*, logical*, logical*, logical*, integer*, integer*, integer*, real*, integer*, real*, integer*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, integer*, ftnlen);
  258. extern /* Subroutine */ int schk5_(char*, real*, real*, integer*, integer*, logical*, logical*, logical*, integer*, integer*, integer*, real*, integer*, real*, integer*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, real*, integer*, ftnlen);
  259. static real c__[4225] /* was [65][65] */, g[65];
  260. static integer i__, j, n;
  261. static logical fatal;
  262. static real w[130];
  263. extern doublereal sdiff_(real*, real*);
  264. static logical trace;
  265. static integer nidim;
  266. extern /* Subroutine */ int smmch_(char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, real*, real*, real*, integer*, real*, real*, logical*, integer*, logical*, ftnlen, ftnlen);
  267. static char snaps[32];
  268. static integer isnum;
  269. static logical ltest[6];
  270. static real aa[4225], ab[8450] /* was [65][130] */, bb[4225], cc[
  271. 4225], as[4225], bs[4225], cs[4225], ct[65];
  272. static logical sfatal, corder;
  273. static char snamet[12], transa[1], transb[1];
  274. static real thresh;
  275. static logical rorder;
  276. static integer layout;
  277. static logical ltestt, tsterr;
  278. extern /* Subroutine */ void cs3chke_(char*, ftnlen);
  279. static real alf[7], bet[7];
  280. extern logical lse_(real*, real*, integer*);
  281. static real eps, err;
  282. char tmpchar;
  283. /* Test program for the REAL Level 3 Blas. */
  284. /* The program must be driven by a short data file. The first 13 records */
  285. /* of the file are read using list-directed input, the last 6 records */
  286. /* are read using the format ( A12, L2 ). An annotated example of a data */
  287. /* file can be obtained by deleting the first 3 characters from the */
  288. /* following 19 lines: */
  289. /* 'SBLAT3.SNAP' NAME OF SNAPSHOT OUTPUT FILE */
  290. /* -1 UNIT NUMBER OF SNAPSHOT FILE (NOT USED IF .LT. 0) */
  291. /* F LOGICAL FLAG, T TO REWIND SNAPSHOT FILE AFTER EACH RECORD. */
  292. /* F LOGICAL FLAG, T TO STOP ON FAILURES. */
  293. /* T LOGICAL FLAG, T TO TEST ERROR EXITS. */
  294. /* 2 0 TO TEST COLUMN-MAJOR, 1 TO TEST ROW-MAJOR, 2 TO TEST BOTH */
  295. /* 16.0 THRESHOLD VALUE OF TEST RATIO */
  296. /* 6 NUMBER OF VALUES OF N */
  297. /* 0 1 2 3 5 9 VALUES OF N */
  298. /* 3 NUMBER OF VALUES OF ALPHA */
  299. /* 0.0 1.0 0.7 VALUES OF ALPHA */
  300. /* 3 NUMBER OF VALUES OF BETA */
  301. /* 0.0 1.0 1.3 VALUES OF BETA */
  302. /* cblas_sgemm T PUT F FOR NO TEST. SAME COLUMNS. */
  303. /* cblas_ssymm T PUT F FOR NO TEST. SAME COLUMNS. */
  304. /* cblas_strmm T PUT F FOR NO TEST. SAME COLUMNS. */
  305. /* cblas_strsm T PUT F FOR NO TEST. SAME COLUMNS. */
  306. /* cblas_ssyrk T PUT F FOR NO TEST. SAME COLUMNS. */
  307. /* cblas_ssyr2k T PUT F FOR NO TEST. SAME COLUMNS. */
  308. /* See: */
  309. /* Dongarra J. J., Du Croz J. J., Duff I. S. and Hammarling S. */
  310. /* A Set of Level 3 Basic Linear Algebra Subprograms. */
  311. /* Technical Memorandum No.88 (Revision 1), Mathematics and */
  312. /* Computer Science Division, Argonne National Laboratory, 9700 */
  313. /* South Cass Avenue, Argonne, Illinois 60439, US. */
  314. /* -- Written on 8-February-1989. */
  315. /* Jack Dongarra, Argonne National Laboratory. */
  316. /* Iain Duff, AERE Harwell. */
  317. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  318. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  319. /* .. Parameters .. */
  320. /* .. Local Scalars .. */
  321. /* .. Local Arrays .. */
  322. /* .. External Functions .. */
  323. /* .. External Subroutines .. */
  324. /* .. Intrinsic Functions .. */
  325. /* .. Scalars in Common .. */
  326. /* .. Common blocks .. */
  327. /* .. Data statements .. */
  328. /* .. Executable Statements .. */
  329. infoc_1.noutc = 6;
  330. /* Read name and unit number for summary output file and open file. */
  331. char line[80];
  332. fgets(line,80,stdin);
  333. sscanf(line,"'%s'",snaps);
  334. fgets(line,80,stdin);
  335. #ifdef USE64BITINT
  336. sscanf(line,"%ld",&ntra);
  337. #else
  338. sscanf(line,"%d",&ntra);
  339. #endif
  340. trace = ntra >= 0;
  341. if (trace) {
  342. /* OPEN( NTRA, FILE = SNAPS, STATUS = 'NEW' ) */
  343. /* o__1.ounit = ntra;
  344. o__1.ofnmlen = 32;
  345. o__1.ofnm = snaps;
  346. o__1.orl = 0;
  347. o__1.osta = 0;
  348. o__1.oacc = 0;
  349. o__1.ofm = 0;
  350. o__1.oblnk = 0;
  351. f_open(&o__1);*/
  352. }
  353. /* Read the flag that directs rewinding of the snapshot file. */
  354. fgets(line,80,stdin);
  355. sscanf(line,"%d",&rewi);
  356. rewi = rewi && trace;
  357. /* Read the flag that directs stopping on any failure. */
  358. fgets(line,80,stdin);
  359. sscanf(line,"%c",&tmpchar);
  360. /* Read the flag that indicates whether error exits are to be tested. */
  361. sfatal=FALSE_;
  362. if (tmpchar=='T')sfatal=TRUE_;
  363. fgets(line,80,stdin);
  364. sscanf(line,"%c",&tmpchar);
  365. /* Read the flag that indicates whether error exits are to be tested. */
  366. tsterr=FALSE_;
  367. if (tmpchar=='T')tsterr=TRUE_;
  368. /* Read the flag that indicates whether row-major data layout to be tested. */
  369. fgets(line,80,stdin);
  370. sscanf(line,"%d",&layout);
  371. /* Read the threshold value of the test ratio */
  372. fgets(line,80,stdin);
  373. sscanf(line,"%f",&thresh);
  374. /* Read and check the parameter values for the tests. */
  375. /* Values of N */
  376. fgets(line,80,stdin);
  377. #ifdef USE64BITINT
  378. sscanf(line,"%ld",&nidim);
  379. #else
  380. sscanf(line,"%d",&nidim);
  381. #endif
  382. if (nidim < 1 || nidim > 9) {
  383. fprintf(stderr,"NUMBER OF VALUES OF N IS LESS THAN 1 OR GREATER THAN 9");
  384. goto L220;
  385. }
  386. fgets(line,80,stdin);
  387. #ifdef USE64BITINT
  388. sscanf(line,"%ld %ld %ld %ld %ld %ld %ld %ld %ld",&idim[0],&idim[1],&idim[2],
  389. &idim[3],&idim[4],&idim[5],&idim[6],&idim[7],&idim[8]);
  390. #else
  391. sscanf(line,"%d %d %d %d %d %d %d %d %d",&idim[0],&idim[1],&idim[2],
  392. &idim[3],&idim[4],&idim[5],&idim[6],&idim[7],&idim[8]);
  393. #endif
  394. i__1 = nidim;
  395. for (i__ = 1; i__ <= i__1; ++i__) {
  396. if (idim[i__ - 1] < 0 || idim[i__ - 1] > 65) {
  397. fprintf(stderr,"VALUE OF N IS LESS THAN 0 OR GREATER THAN 65\n");
  398. goto L220;
  399. }
  400. /* L10: */
  401. }
  402. /* Values of ALPHA */
  403. fgets(line,80,stdin);
  404. #ifdef USE64BITINT
  405. sscanf(line,"%ld",&nalf);
  406. #else
  407. sscanf(line,"%d",&nalf);
  408. #endif
  409. if (nalf < 1 || nalf > 7) {
  410. fprintf(stderr,"VALUE OF ALPHA IS LESS THAN 0 OR GREATER THAN 7\n");
  411. goto L220;
  412. }
  413. fgets(line,80,stdin);
  414. sscanf(line,"%f %f %f %f %f %f %f",&alf[0],&alf[1],&alf[2],&alf[3],&alf[4],&alf[5],&alf[6]);
  415. /* Values of BETA */
  416. fgets(line,80,stdin);
  417. #ifdef USE64BITINT
  418. sscanf(line,"%ld",&nbet);
  419. #else
  420. sscanf(line,"%d",&nbet);
  421. #endif
  422. if (nalf < 1 || nbet > 7) {
  423. fprintf(stderr,"VALUE OF BETA IS LESS THAN 0 OR GREATER THAN 7\n");
  424. goto L220;
  425. }
  426. fgets(line,80,stdin);
  427. sscanf(line,"%f %f %f %f %f %f %f",&bet[0],&bet[1],&bet[2],&bet[3],&bet[4],&bet[5],&bet[6]);
  428. /* Report values of parameters. */
  429. printf("TESTS OF THE REAL LEVEL 3 BLAS\nTHE FOLLOWING PARAMETER VALUES WILL BE USED:\n");
  430. printf(" FOR N");
  431. for (i__ =1; i__ <=nidim;++i__) printf(" %d",idim[i__-1]);
  432. printf("\n");
  433. printf(" FOR ALPHA");
  434. for (i__ =1; i__ <=nalf;++i__) printf(" %f",alf[i__-1]);
  435. printf("\n");
  436. printf(" FOR BETA");
  437. for (i__ =1; i__ <=nbet;++i__) printf(" %f",bet[i__-1]);
  438. printf("\n");
  439. if (! tsterr) {
  440. printf(" ERROR-EXITS WILL NOT BE TESTED\n");
  441. }
  442. printf("ROUTINES PASS COMPUTATIONAL TESTS IF TEST RATIO IS LESS THAN %f\n",thresh);
  443. rorder = FALSE_;
  444. corder = FALSE_;
  445. if (layout == 2) {
  446. rorder = TRUE_;
  447. corder = TRUE_;
  448. printf("COLUMN-MAJOR AND ROW-MAJOR DATA LAYOUTS ARE TESTED\n");
  449. } else if (layout == 1) {
  450. rorder = TRUE_;
  451. printf("ROW-MAJOR DATA LAYOUT IS TESTED\n");
  452. } else if (layout == 0) {
  453. corder = TRUE_;
  454. printf("COLUMN-MAJOR DATA LAYOUT IS TESTED\n");
  455. }
  456. /* Read names of subroutines and flags which indicate */
  457. /* whether they are to be tested. */
  458. for (i__ = 1; i__ <= 6; ++i__) {
  459. ltest[i__ - 1] = FALSE_;
  460. /* L20: */
  461. }
  462. L30:
  463. if (! fgets(line,80,stdin)) {
  464. goto L60;
  465. }
  466. i__1 = sscanf(line,"%12c %c",snamet,&tmpchar);
  467. ltestt=FALSE_;
  468. if (tmpchar=='T')ltestt=TRUE_;
  469. if (i__1 < 2) {
  470. goto L60;
  471. }
  472. for (i__ = 1; i__ <= 9; ++i__) {
  473. if (s_cmp(snamet, snames[i__ - 1] , (ftnlen)12, (ftnlen)12) ==
  474. 0) {
  475. goto L50;
  476. }
  477. /* L40: */
  478. }
  479. printf("SUBPROGRAM NAME %s NOT RECOGNIZED\n****** TESTS ABANDONED ******\n",snamet);
  480. exit(1);
  481. L50:
  482. ltest[i__ - 1] = ltestt;
  483. goto L30;
  484. L60:
  485. // f_clos(&cl__1);
  486. /* Compute EPS (the machine precision). */
  487. eps = (float)1.;
  488. L70:
  489. r__1 = eps + (float)1.;
  490. if (sdiff_(&r__1, &c_b89) == (float)0.) {
  491. goto L80;
  492. }
  493. eps *= (float).5;
  494. goto L70;
  495. L80:
  496. eps += eps;
  497. printf("RELATIVE MACHINE PRECISION IS TAKEN TO BE %9.1g\n",eps);
  498. /* Check the reliability of SMMCH using exact data. */
  499. n = 32;
  500. i__1 = n;
  501. for (j = 1; j <= i__1; ++j) {
  502. i__2 = n;
  503. for (i__ = 1; i__ <= i__2; ++i__) {
  504. /* Computing MAX */
  505. i__3 = i__ - j + 1;
  506. ab[i__ + j * 65 - 66] = (real) f2cmax(i__3,0);
  507. /* L90: */
  508. }
  509. ab[j + 4224] = (real) j;
  510. ab[(j + 65) * 65 - 65] = (real) j;
  511. c__[j - 1] = (float)0.;
  512. /* L100: */
  513. }
  514. i__1 = n;
  515. for (j = 1; j <= i__1; ++j) {
  516. cc[j - 1] = (real) (j * ((j + 1) * j) / 2 - (j + 1) * j * (j - 1) / 3)
  517. ;
  518. /* L110: */
  519. }
  520. /* CC holds the exact result. On exit from SMMCH CT holds */
  521. /* the result computed by SMMCH. */
  522. *(unsigned char *)transa = 'N';
  523. *(unsigned char *)transb = 'N';
  524. smmch_(transa, transb, &n, &c__1, &n, &c_b89, ab, &c__65, &ab[4225], &
  525. c__65, &c_b103, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &
  526. fatal, &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  527. same = lse_(cc, ct, &n);
  528. if (! same || err != (float)0.) {
  529. printf("ERROR IN SMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  530. printf("SMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  531. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  532. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  533. printf("****** TESTS ABANDONED ******\n");
  534. exit(1);
  535. }
  536. *(unsigned char *)transb = 'T';
  537. smmch_(transa, transb, &n, &c__1, &n, &c_b89, ab, &c__65, &ab[4225], &
  538. c__65, &c_b103, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &
  539. fatal, &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  540. same = lse_(cc, ct, &n);
  541. if (! same || err != (float)0.) {
  542. printf("ERROR IN SMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  543. printf("SMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  544. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  545. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  546. printf("****** TESTS ABANDONED ******\n");
  547. exit(1);
  548. }
  549. i__1 = n;
  550. for (j = 1; j <= i__1; ++j) {
  551. ab[j + 4224] = (real) (n - j + 1);
  552. ab[(j + 65) * 65 - 65] = (real) (n - j + 1);
  553. /* L120: */
  554. }
  555. i__1 = n;
  556. for (j = 1; j <= i__1; ++j) {
  557. cc[n - j] = (real) (j * ((j + 1) * j) / 2 - (j + 1) * j * (j - 1) / 3)
  558. ;
  559. /* L130: */
  560. }
  561. *(unsigned char *)transa = 'T';
  562. *(unsigned char *)transb = 'N';
  563. smmch_(transa, transb, &n, &c__1, &n, &c_b89, ab, &c__65, &ab[4225], &
  564. c__65, &c_b103, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &
  565. fatal, &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  566. same = lse_(cc, ct, &n);
  567. if (! same || err != (float)0.) {
  568. printf("ERROR IN SMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  569. printf("SMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  570. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  571. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  572. printf("****** TESTS ABANDONED ******\n");
  573. exit(1);
  574. }
  575. *(unsigned char *)transb = 'T';
  576. smmch_(transa, transb, &n, &c__1, &n, &c_b89, ab, &c__65, &ab[4225], &
  577. c__65, &c_b103, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &
  578. fatal, &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  579. same = lse_(cc, ct, &n);
  580. if (! same || err != (float)0.) {
  581. printf("ERROR IN SMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  582. printf("SMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  583. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  584. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  585. printf("****** TESTS ABANDONED ******\n");
  586. exit(1);
  587. }
  588. /* Test each subroutine in turn. */
  589. for (isnum = 1; isnum <= 6; ++isnum) {
  590. if (! ltest[isnum - 1]) {
  591. /* Subprogram is not to be tested. */
  592. printf("%12s WAS NOT TESTED\n",snames[isnum-1]);
  593. } else {
  594. s_copy(srnamc_1.srnamt, snames[isnum - 1], (ftnlen)12, (
  595. ftnlen)12);
  596. /* Test error exits. */
  597. if (tsterr) {
  598. cs3chke_(snames[isnum - 1], (ftnlen)12);
  599. }
  600. /* Test computations. */
  601. infoc_1.infot = 0;
  602. infoc_1.ok = TRUE_;
  603. fatal = FALSE_;
  604. switch ((int)isnum) {
  605. case 1: goto L140;
  606. case 2: goto L150;
  607. case 3: goto L160;
  608. case 4: goto L160;
  609. case 5: goto L170;
  610. case 6: goto L180;
  611. }
  612. /* Test SGEMM, 01. */
  613. L140:
  614. if (corder) {
  615. schk1_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  616. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  617. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  618. cc, cs, ct, g, &c__0, (ftnlen)12);
  619. }
  620. if (rorder) {
  621. schk1_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  622. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  623. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  624. cc, cs, ct, g, &c__1, (ftnlen)12);
  625. }
  626. goto L190;
  627. /* Test SSYMM, 02. */
  628. L150:
  629. if (corder) {
  630. schk2_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  631. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  632. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  633. cc, cs, ct, g, &c__0, (ftnlen)12);
  634. }
  635. if (rorder) {
  636. schk2_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  637. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  638. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  639. cc, cs, ct, g, &c__1, (ftnlen)12);
  640. }
  641. goto L190;
  642. /* Test STRMM, 03, STRSM, 04. */
  643. L160:
  644. if (corder) {
  645. schk3_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  646. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  647. c__65, ab, aa, as, &ab[4225], bb, bs, ct, g, c__, &
  648. c__0, (ftnlen)12);
  649. }
  650. if (rorder) {
  651. schk3_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  652. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  653. c__65, ab, aa, as, &ab[4225], bb, bs, ct, g, c__, &
  654. c__1, (ftnlen)12);
  655. }
  656. goto L190;
  657. /* Test SSYRK, 05. */
  658. L170:
  659. if (corder) {
  660. schk4_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  661. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  662. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  663. cc, cs, ct, g, &c__0, (ftnlen)12);
  664. }
  665. if (rorder) {
  666. schk4_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  667. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  668. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  669. cc, cs, ct, g, &c__1, (ftnlen)12);
  670. }
  671. goto L190;
  672. /* Test SSYR2K, 06. */
  673. L180:
  674. if (corder) {
  675. schk5_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  676. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  677. nbet, bet, &c__65, ab, aa, as, bb, bs, c__, cc, cs,
  678. ct, g, w, &c__0, (ftnlen)12);
  679. }
  680. if (rorder) {
  681. schk5_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  682. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  683. nbet, bet, &c__65, ab, aa, as, bb, bs, c__, cc, cs,
  684. ct, g, w, &c__1, (ftnlen)12);
  685. }
  686. goto L190;
  687. L190:
  688. if (fatal && sfatal) {
  689. goto L210;
  690. }
  691. }
  692. /* L200: */
  693. }
  694. printf("\nEND OF TESTS\n");
  695. goto L230;
  696. L210:
  697. printf("\n****** FATAL ERROR - TESTS ABANDONED ******\n");
  698. goto L230;
  699. L220:
  700. printf("AMEND DATA FILE OR INCREASE ARRAY SIZES IN PROGRAM\n");
  701. printf("****** TESTS ABANDONED ******\n");
  702. L230:
  703. if (trace) {
  704. // f_clos(&cl__1);
  705. }
  706. // f_clos(&cl__1);
  707. exit(0);
  708. /* End of SBLAT3. */
  709. } /* MAIN__ */
  710. /* Subroutine */ int schk1_(char* sname, real* eps, real* thresh, integer* nout, integer* ntra, logical* trace, logical* rewi, logical* fatal, integer* nidim, integer* idim, integer* nalf, real* alf, integer* nbet, real* bet, integer* nmax, real* a, real* aa, real* as, real* b, real* bb, real* bs, real* c__, real* cc, real* cs, real* ct, real* g, integer* iorder, ftnlen sname_len)
  711. {
  712. /* Initialized data */
  713. static char ich[3+1] = "NTC";
  714. /* System generated locals */
  715. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  716. i__3, i__4, i__5, i__6;
  717. /* Local variables */
  718. static real beta;
  719. static integer ldas, ldbs, ldcs;
  720. static logical same, null;
  721. static integer i__, k, m, n;
  722. static real alpha;
  723. static logical isame[13];
  724. static logical trana, tranb;
  725. static integer nargs;
  726. static logical reset;
  727. extern /* Subroutine */ void sprcn1_(integer*, integer*, char*, integer*, char*, char*, integer*, integer*, integer*, real*, integer*, integer*, real*, integer*, ftnlen, ftnlen, ftnlen);
  728. extern /* Subroutine */ int smake_(char*, char*, char*, integer*, integer*, real*, integer*, real*, integer*, logical*, real*, ftnlen, ftnlen, ftnlen);
  729. extern /* Subroutine */ int smmch_(char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, real*, real*, real*, integer*, real*, real*, logical*, integer*, logical*, ftnlen, ftnlen);
  730. static integer ia, ib, ma, mb, na, nb, nc, ik, im, in, ks, ms, ns;
  731. extern /* Subroutine */ void csgemm_(integer*, char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  732. static char tranas[1], tranbs[1], transa[1], transb[1];
  733. static real errmax;
  734. extern logical lseres_(char*, char*, integer*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  735. extern logical lse_(real*, real*, integer*);
  736. static integer ica, icb, laa, lbb, lda, lcc, ldb, ldc;
  737. static real als, bls;
  738. static real err;
  739. /* Tests SGEMM. */
  740. /* Auxiliary routine for test program for Level 3 Blas. */
  741. /* -- Written on 8-February-1989. */
  742. /* Jack Dongarra, Argonne National Laboratory. */
  743. /* Iain Duff, AERE Harwell. */
  744. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  745. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  746. /* .. Parameters .. */
  747. /* .. Scalar Arguments .. */
  748. /* .. Array Arguments .. */
  749. /* .. Local Scalars .. */
  750. /* .. Local Arrays .. */
  751. /* .. External Functions .. */
  752. /* .. External Subroutines .. */
  753. /* .. Intrinsic Functions .. */
  754. /* .. Scalars in Common .. */
  755. /* .. Common blocks .. */
  756. /* .. Data statements .. */
  757. /* Parameter adjustments */
  758. --idim;
  759. --alf;
  760. --bet;
  761. --g;
  762. --ct;
  763. --cs;
  764. --cc;
  765. c_dim1 = *nmax;
  766. c_offset = 1 + c_dim1 * 1;
  767. c__ -= c_offset;
  768. --bs;
  769. --bb;
  770. b_dim1 = *nmax;
  771. b_offset = 1 + b_dim1 * 1;
  772. b -= b_offset;
  773. --as;
  774. --aa;
  775. a_dim1 = *nmax;
  776. a_offset = 1 + a_dim1 * 1;
  777. a -= a_offset;
  778. /* Function Body */
  779. /* .. Executable Statements .. */
  780. nargs = 13;
  781. nc = 0;
  782. reset = TRUE_;
  783. errmax = (float)0.;
  784. i__1 = *nidim;
  785. for (im = 1; im <= i__1; ++im) {
  786. m = idim[im];
  787. i__2 = *nidim;
  788. for (in = 1; in <= i__2; ++in) {
  789. n = idim[in];
  790. /* Set LDC to 1 more than minimum value if room. */
  791. ldc = m;
  792. if (ldc < *nmax) {
  793. ++ldc;
  794. }
  795. /* Skip tests if not enough room. */
  796. if (ldc > *nmax) {
  797. goto L100;
  798. }
  799. lcc = ldc * n;
  800. null = n <= 0 || m <= 0;
  801. i__3 = *nidim;
  802. for (ik = 1; ik <= i__3; ++ik) {
  803. k = idim[ik];
  804. for (ica = 1; ica <= 3; ++ica) {
  805. *(unsigned char *)transa = *(unsigned char *)&ich[ica - 1]
  806. ;
  807. trana = *(unsigned char *)transa == 'T' || *(unsigned
  808. char *)transa == 'C';
  809. if (trana) {
  810. ma = k;
  811. na = m;
  812. } else {
  813. ma = m;
  814. na = k;
  815. }
  816. /* Set LDA to 1 more than minimum value if room. */
  817. lda = ma;
  818. if (lda < *nmax) {
  819. ++lda;
  820. }
  821. /* Skip tests if not enough room. */
  822. if (lda > *nmax) {
  823. goto L80;
  824. }
  825. laa = lda * na;
  826. /* Generate the matrix A. */
  827. smake_("GE", " ", " ", &ma, &na, &a[a_offset], nmax, &aa[
  828. 1], &lda, &reset, &c_b103, (ftnlen)2, (ftnlen)1, (
  829. ftnlen)1);
  830. for (icb = 1; icb <= 3; ++icb) {
  831. *(unsigned char *)transb = *(unsigned char *)&ich[icb
  832. - 1];
  833. tranb = *(unsigned char *)transb == 'T' || *(unsigned
  834. char *)transb == 'C';
  835. if (tranb) {
  836. mb = n;
  837. nb = k;
  838. } else {
  839. mb = k;
  840. nb = n;
  841. }
  842. /* Set LDB to 1 more than minimum value if room. */
  843. ldb = mb;
  844. if (ldb < *nmax) {
  845. ++ldb;
  846. }
  847. /* Skip tests if not enough room. */
  848. if (ldb > *nmax) {
  849. goto L70;
  850. }
  851. lbb = ldb * nb;
  852. /* Generate the matrix B. */
  853. smake_("GE", " ", " ", &mb, &nb, &b[b_offset], nmax, &
  854. bb[1], &ldb, &reset, &c_b103, (ftnlen)2, (
  855. ftnlen)1, (ftnlen)1);
  856. i__4 = *nalf;
  857. for (ia = 1; ia <= i__4; ++ia) {
  858. alpha = alf[ia];
  859. i__5 = *nbet;
  860. for (ib = 1; ib <= i__5; ++ib) {
  861. beta = bet[ib];
  862. /* Generate the matrix C. */
  863. smake_("GE", " ", " ", &m, &n, &c__[c_offset],
  864. nmax, &cc[1], &ldc, &reset, &c_b103,
  865. (ftnlen)2, (ftnlen)1, (ftnlen)1);
  866. ++nc;
  867. /* Save every datum before calling the */
  868. /* subroutine. */
  869. *(unsigned char *)tranas = *(unsigned char *)
  870. transa;
  871. *(unsigned char *)tranbs = *(unsigned char *)
  872. transb;
  873. ms = m;
  874. ns = n;
  875. ks = k;
  876. als = alpha;
  877. i__6 = laa;
  878. for (i__ = 1; i__ <= i__6; ++i__) {
  879. as[i__] = aa[i__];
  880. /* L10: */
  881. }
  882. ldas = lda;
  883. i__6 = lbb;
  884. for (i__ = 1; i__ <= i__6; ++i__) {
  885. bs[i__] = bb[i__];
  886. /* L20: */
  887. }
  888. ldbs = ldb;
  889. bls = beta;
  890. i__6 = lcc;
  891. for (i__ = 1; i__ <= i__6; ++i__) {
  892. cs[i__] = cc[i__];
  893. /* L30: */
  894. }
  895. ldcs = ldc;
  896. /* Call the subroutine. */
  897. if (*trace) {
  898. sprcn1_(ntra, &nc, sname, iorder, transa,
  899. transb, &m, &n, &k, &alpha, &lda,
  900. &ldb, &beta, &ldc, (ftnlen)12, (
  901. ftnlen)1, (ftnlen)1);
  902. }
  903. if (*rewi) {
  904. // f_rew(&al__1);
  905. }
  906. csgemm_(iorder, transa, transb, &m, &n, &k, &
  907. alpha, &aa[1], &lda, &bb[1], &ldb, &
  908. beta, &cc[1], &ldc, (ftnlen)1, (
  909. ftnlen)1);
  910. /* Check if error-exit was taken incorrectly. */
  911. if (! infoc_1.ok) {
  912. printf(" *** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  913. *fatal = TRUE_;
  914. goto L120;
  915. }
  916. /* See what data changed inside subroutines. */
  917. isame[0] = *(unsigned char *)transa == *(
  918. unsigned char *)tranas;
  919. isame[1] = *(unsigned char *)transb == *(
  920. unsigned char *)tranbs;
  921. isame[2] = ms == m;
  922. isame[3] = ns == n;
  923. isame[4] = ks == k;
  924. isame[5] = als == alpha;
  925. isame[6] = lse_(&as[1], &aa[1], &laa);
  926. isame[7] = ldas == lda;
  927. isame[8] = lse_(&bs[1], &bb[1], &lbb);
  928. isame[9] = ldbs == ldb;
  929. isame[10] = bls == beta;
  930. if (null) {
  931. isame[11] = lse_(&cs[1], &cc[1], &lcc);
  932. } else {
  933. isame[11] = lseres_("GE", " ", &m, &n, &
  934. cs[1], &cc[1], &ldc, (ftnlen)2, (
  935. ftnlen)1);
  936. }
  937. isame[12] = ldcs == ldc;
  938. /* If data was incorrectly changed, report */
  939. /* and return. */
  940. same = TRUE_;
  941. i__6 = nargs;
  942. for (i__ = 1; i__ <= i__6; ++i__) {
  943. same = same && isame[i__ - 1];
  944. if (! isame[i__ - 1]) {
  945. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  946. }
  947. /* L40: */
  948. }
  949. if (! same) {
  950. *fatal = TRUE_;
  951. goto L120;
  952. }
  953. if (! null) {
  954. /* Check the result. */
  955. smmch_(transa, transb, &m, &n, &k, &alpha,
  956. &a[a_offset], nmax, &b[b_offset],
  957. nmax, &beta, &c__[c_offset],
  958. nmax, &ct[1], &g[1], &cc[1], &ldc,
  959. eps, &err, fatal, nout, &c_true,
  960. (ftnlen)1, (ftnlen)1);
  961. errmax = dmax(errmax,err);
  962. /* If got really bad answer, report and */
  963. /* return. */
  964. if (*fatal) {
  965. goto L120;
  966. }
  967. }
  968. /* L50: */
  969. }
  970. /* L60: */
  971. }
  972. L70:
  973. ;
  974. }
  975. L80:
  976. ;
  977. }
  978. /* L90: */
  979. }
  980. L100:
  981. ;
  982. }
  983. /* L110: */
  984. }
  985. /* Report result. */
  986. if (errmax < *thresh) {
  987. if (*iorder == 0) {
  988. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  989. }
  990. if (*iorder == 1) {
  991. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  992. }
  993. } else {
  994. if (*iorder == 0) {
  995. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  996. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  997. }
  998. if (*iorder == 1) {
  999. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1000. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1001. }
  1002. }
  1003. goto L130;
  1004. L120:
  1005. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  1006. sprcn1_(nout, &nc, sname, iorder, transa, transb, &m, &n, &k, &alpha, &
  1007. lda, &ldb, &beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  1008. L130:
  1009. return 0;
  1010. /* 9995 FORMAT( 1X, I6, ': ', A12,'(''', A1, ''',''', A1, ''',', */
  1011. /* $ 3( I3, ',' ), F4.1, ', A,', I3, ', B,', I3, ',', F4.1, ', ', */
  1012. /* $ 'C,', I3, ').' ) */
  1013. /* End of SCHK1. */
  1014. } /* schk1_ */
  1015. /* Subroutine */ void sprcn1_(integer* nout, integer* nc, char* sname, integer* iorder, char* transa, char* transb, integer* m, integer* n, integer* k, real* alpha, integer* lda, integer* ldb, real* beta, integer* ldc, ftnlen sname_len, ftnlen transa_len, ftnlen transb_len)
  1016. {
  1017. /* Local variables */
  1018. static char crc[14], cta[14], ctb[14];
  1019. if (*(unsigned char *)transa == 'N') {
  1020. s_copy(cta, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  1021. } else if (*(unsigned char *)transa == 'T') {
  1022. s_copy(cta, " CblasTrans", (ftnlen)14, (ftnlen)14);
  1023. } else {
  1024. s_copy(cta, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  1025. }
  1026. if (*(unsigned char *)transb == 'N') {
  1027. s_copy(ctb, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  1028. } else if (*(unsigned char *)transb == 'T') {
  1029. s_copy(ctb, " CblasTrans", (ftnlen)14, (ftnlen)14);
  1030. } else {
  1031. s_copy(ctb, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  1032. }
  1033. if (*iorder == 1) {
  1034. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  1035. } else {
  1036. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  1037. }
  1038. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cta,ctb);
  1039. printf("%d %d %d %4.1f A, %d, B, %d, %4.1f, C, %d.\n",*m,*n,*k,*alpha,*lda,*ldb,*beta,*ldc);
  1040. } /* sprcn1_ */
  1041. /* Subroutine */ int schk2_(char* sname, real* eps, real* thresh, integer* nout, integer* ntra, logical* trace, logical* rewi, logical* fatal, integer* nidim, integer* idim, integer* nalf, real* alf, integer* nbet, real* bet, integer* nmax, real* a, real* aa, real* as, real* b, real* bb, real* bs, real* c__, real* cc, real* cs, real* ct, real* g, integer* iorder, ftnlen sname_len)
  1042. {
  1043. /* Initialized data */
  1044. static char ichs[2+1] = "LR";
  1045. static char ichu[2+1] = "UL";
  1046. /* System generated locals */
  1047. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  1048. i__3, i__4, i__5;
  1049. /* Local variables */
  1050. static real beta;
  1051. static integer ldas, ldbs, ldcs;
  1052. static logical same;
  1053. static char side[1];
  1054. static logical left, null;
  1055. static char uplo[1];
  1056. static integer i__, m, n;
  1057. static real alpha;
  1058. static logical isame[13];
  1059. static char sides[1];
  1060. static integer nargs;
  1061. static logical reset;
  1062. static char uplos[1];
  1063. static integer ia, ib, na, nc, im, in, ms, ns;
  1064. static real errmax;
  1065. extern logical lseres_(char*, char*, integer*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  1066. extern /* Subroutine */ void cssymm_(integer*, char*, char*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  1067. extern void sprcn2_(integer*, integer*, char*, integer*, char*, char*, integer*, integer*, real*, integer*, integer*, real*, integer*, ftnlen, ftnlen, ftnlen);
  1068. extern /* Subroutine */ int smake_(char*, char*, char*, integer*, integer*, real*, integer*, real*, integer*, logical*, real*, ftnlen, ftnlen, ftnlen);
  1069. extern /* Subroutine */ int smmch_(char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, real*, real*, real*, integer*, real*, real*, logical*, integer*, logical*, ftnlen, ftnlen);
  1070. static integer laa, lbb, lda, lcc, ldb, ldc, ics;
  1071. static real als, bls;
  1072. static integer icu;
  1073. extern logical lse_(real*, real*, integer*);
  1074. static real err;
  1075. /* Tests SSYMM. */
  1076. /* Auxiliary routine for test program for Level 3 Blas. */
  1077. /* -- Written on 8-February-1989. */
  1078. /* Jack Dongarra, Argonne National Laboratory. */
  1079. /* Iain Duff, AERE Harwell. */
  1080. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  1081. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  1082. /* .. Parameters .. */
  1083. /* .. Scalar Arguments .. */
  1084. /* .. Array Arguments .. */
  1085. /* .. Local Scalars .. */
  1086. /* .. Local Arrays .. */
  1087. /* .. External Functions .. */
  1088. /* .. External Subroutines .. */
  1089. /* .. Intrinsic Functions .. */
  1090. /* .. Scalars in Common .. */
  1091. /* .. Common blocks .. */
  1092. /* .. Data statements .. */
  1093. /* Parameter adjustments */
  1094. --idim;
  1095. --alf;
  1096. --bet;
  1097. --g;
  1098. --ct;
  1099. --cs;
  1100. --cc;
  1101. c_dim1 = *nmax;
  1102. c_offset = 1 + c_dim1 * 1;
  1103. c__ -= c_offset;
  1104. --bs;
  1105. --bb;
  1106. b_dim1 = *nmax;
  1107. b_offset = 1 + b_dim1 * 1;
  1108. b -= b_offset;
  1109. --as;
  1110. --aa;
  1111. a_dim1 = *nmax;
  1112. a_offset = 1 + a_dim1 * 1;
  1113. a -= a_offset;
  1114. /* Function Body */
  1115. /* .. Executable Statements .. */
  1116. nargs = 12;
  1117. nc = 0;
  1118. reset = TRUE_;
  1119. errmax = (float)0.;
  1120. i__1 = *nidim;
  1121. for (im = 1; im <= i__1; ++im) {
  1122. m = idim[im];
  1123. i__2 = *nidim;
  1124. for (in = 1; in <= i__2; ++in) {
  1125. n = idim[in];
  1126. /* Set LDC to 1 more than minimum value if room. */
  1127. ldc = m;
  1128. if (ldc < *nmax) {
  1129. ++ldc;
  1130. }
  1131. /* Skip tests if not enough room. */
  1132. if (ldc > *nmax) {
  1133. goto L90;
  1134. }
  1135. lcc = ldc * n;
  1136. null = n <= 0 || m <= 0;
  1137. /* Set LDB to 1 more than minimum value if room. */
  1138. ldb = m;
  1139. if (ldb < *nmax) {
  1140. ++ldb;
  1141. }
  1142. /* Skip tests if not enough room. */
  1143. if (ldb > *nmax) {
  1144. goto L90;
  1145. }
  1146. lbb = ldb * n;
  1147. /* Generate the matrix B. */
  1148. smake_("GE", " ", " ", &m, &n, &b[b_offset], nmax, &bb[1], &ldb, &
  1149. reset, &c_b103, (ftnlen)2, (ftnlen)1, (ftnlen)1);
  1150. for (ics = 1; ics <= 2; ++ics) {
  1151. *(unsigned char *)side = *(unsigned char *)&ichs[ics - 1];
  1152. left = *(unsigned char *)side == 'L';
  1153. if (left) {
  1154. na = m;
  1155. } else {
  1156. na = n;
  1157. }
  1158. /* Set LDA to 1 more than minimum value if room. */
  1159. lda = na;
  1160. if (lda < *nmax) {
  1161. ++lda;
  1162. }
  1163. /* Skip tests if not enough room. */
  1164. if (lda > *nmax) {
  1165. goto L80;
  1166. }
  1167. laa = lda * na;
  1168. for (icu = 1; icu <= 2; ++icu) {
  1169. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  1170. /* Generate the symmetric matrix A. */
  1171. smake_("SY", uplo, " ", &na, &na, &a[a_offset], nmax, &aa[
  1172. 1], &lda, &reset, &c_b103, (ftnlen)2, (ftnlen)1, (
  1173. ftnlen)1);
  1174. i__3 = *nalf;
  1175. for (ia = 1; ia <= i__3; ++ia) {
  1176. alpha = alf[ia];
  1177. i__4 = *nbet;
  1178. for (ib = 1; ib <= i__4; ++ib) {
  1179. beta = bet[ib];
  1180. /* Generate the matrix C. */
  1181. smake_("GE", " ", " ", &m, &n, &c__[c_offset],
  1182. nmax, &cc[1], &ldc, &reset, &c_b103, (
  1183. ftnlen)2, (ftnlen)1, (ftnlen)1);
  1184. ++nc;
  1185. /* Save every datum before calling the */
  1186. /* subroutine. */
  1187. *(unsigned char *)sides = *(unsigned char *)side;
  1188. *(unsigned char *)uplos = *(unsigned char *)uplo;
  1189. ms = m;
  1190. ns = n;
  1191. als = alpha;
  1192. i__5 = laa;
  1193. for (i__ = 1; i__ <= i__5; ++i__) {
  1194. as[i__] = aa[i__];
  1195. /* L10: */
  1196. }
  1197. ldas = lda;
  1198. i__5 = lbb;
  1199. for (i__ = 1; i__ <= i__5; ++i__) {
  1200. bs[i__] = bb[i__];
  1201. /* L20: */
  1202. }
  1203. ldbs = ldb;
  1204. bls = beta;
  1205. i__5 = lcc;
  1206. for (i__ = 1; i__ <= i__5; ++i__) {
  1207. cs[i__] = cc[i__];
  1208. /* L30: */
  1209. }
  1210. ldcs = ldc;
  1211. /* Call the subroutine. */
  1212. if (*trace) {
  1213. sprcn2_(ntra, &nc, sname, iorder, side, uplo,
  1214. &m, &n, &alpha, &lda, &ldb, &beta, &
  1215. ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1)
  1216. ;
  1217. }
  1218. if (*rewi) {
  1219. // f_rew(&al__1);
  1220. }
  1221. cssymm_(iorder, side, uplo, &m, &n, &alpha, &aa[1]
  1222. , &lda, &bb[1], &ldb, &beta, &cc[1], &ldc,
  1223. (ftnlen)1, (ftnlen)1);
  1224. /* Check if error-exit was taken incorrectly. */
  1225. if (! infoc_1.ok) {
  1226. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  1227. *fatal = TRUE_;
  1228. goto L110;
  1229. }
  1230. /* See what data changed inside subroutines. */
  1231. isame[0] = *(unsigned char *)sides == *(unsigned
  1232. char *)side;
  1233. isame[1] = *(unsigned char *)uplos == *(unsigned
  1234. char *)uplo;
  1235. isame[2] = ms == m;
  1236. isame[3] = ns == n;
  1237. isame[4] = als == alpha;
  1238. isame[5] = lse_(&as[1], &aa[1], &laa);
  1239. isame[6] = ldas == lda;
  1240. isame[7] = lse_(&bs[1], &bb[1], &lbb);
  1241. isame[8] = ldbs == ldb;
  1242. isame[9] = bls == beta;
  1243. if (null) {
  1244. isame[10] = lse_(&cs[1], &cc[1], &lcc);
  1245. } else {
  1246. isame[10] = lseres_("GE", " ", &m, &n, &cs[1],
  1247. &cc[1], &ldc, (ftnlen)2, (ftnlen)1);
  1248. }
  1249. isame[11] = ldcs == ldc;
  1250. /* If data was incorrectly changed, report and */
  1251. /* return. */
  1252. same = TRUE_;
  1253. i__5 = nargs;
  1254. for (i__ = 1; i__ <= i__5; ++i__) {
  1255. same = same && isame[i__ - 1];
  1256. if (! isame[i__ - 1]) {
  1257. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  1258. }
  1259. /* L40: */
  1260. }
  1261. if (! same) {
  1262. *fatal = TRUE_;
  1263. goto L110;
  1264. }
  1265. if (! null) {
  1266. /* Check the result. */
  1267. if (left) {
  1268. smmch_("N", "N", &m, &n, &m, &alpha, &a[
  1269. a_offset], nmax, &b[b_offset],
  1270. nmax, &beta, &c__[c_offset], nmax,
  1271. &ct[1], &g[1], &cc[1], &ldc, eps,
  1272. &err, fatal, nout, &c_true, (
  1273. ftnlen)1, (ftnlen)1);
  1274. } else {
  1275. smmch_("N", "N", &m, &n, &n, &alpha, &b[
  1276. b_offset], nmax, &a[a_offset],
  1277. nmax, &beta, &c__[c_offset], nmax,
  1278. &ct[1], &g[1], &cc[1], &ldc, eps,
  1279. &err, fatal, nout, &c_true, (
  1280. ftnlen)1, (ftnlen)1);
  1281. }
  1282. errmax = dmax(errmax,err);
  1283. /* If got really bad answer, report and */
  1284. /* return. */
  1285. if (*fatal) {
  1286. goto L110;
  1287. }
  1288. }
  1289. /* L50: */
  1290. }
  1291. /* L60: */
  1292. }
  1293. /* L70: */
  1294. }
  1295. L80:
  1296. ;
  1297. }
  1298. L90:
  1299. ;
  1300. }
  1301. /* L100: */
  1302. }
  1303. /* Report result. */
  1304. if (errmax < *thresh) {
  1305. if (*iorder == 0) {
  1306. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1307. }
  1308. if (*iorder == 1) {
  1309. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1310. }
  1311. } else {
  1312. if (*iorder == 0) {
  1313. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1314. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1315. }
  1316. if (*iorder == 1) {
  1317. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1318. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1319. }
  1320. }
  1321. goto L120;
  1322. L110:
  1323. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  1324. sprcn2_(nout, &nc, sname, iorder, side, uplo, &m, &n, &alpha, &lda, &ldb,
  1325. &beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  1326. L120:
  1327. return 0;
  1328. /* 9995 FORMAT( 1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  1329. /* $ F4.1, ', A,', I3, ', B,', I3, ',', F4.1, ', C,', I3, ') ', */
  1330. /* $ ' .' ) */
  1331. /* End of SCHK2. */
  1332. } /* schk2_ */
  1333. /* Subroutine */ void sprcn2_(integer* nout, integer* nc, char* sname, integer* iorder, char* side, char* uplo, integer* m, integer* n, real* alpha, integer* lda, integer* ldb, real* beta, integer* ldc, ftnlen sname_len, ftnlen side_len, ftnlen uplo_len)
  1334. {
  1335. /* Local variables */
  1336. static char cs[14], cu[14], crc[14];
  1337. if (*(unsigned char *)side == 'L') {
  1338. s_copy(cs, " CblasLeft", (ftnlen)14, (ftnlen)14);
  1339. } else {
  1340. s_copy(cs, " CblasRight", (ftnlen)14, (ftnlen)14);
  1341. }
  1342. if (*(unsigned char *)uplo == 'U') {
  1343. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  1344. } else {
  1345. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  1346. }
  1347. if (*iorder == 1) {
  1348. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  1349. } else {
  1350. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  1351. }
  1352. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cs,cu);
  1353. printf("%d %d %4.1f A, %d, B, %d, %4.1f C, %d.\n",*m,*n,*alpha,*lda,*ldb,*beta,*ldc);
  1354. } /* sprcn2_ */
  1355. /* Subroutine */ int schk3_(char* sname, real* eps, real* thresh, integer* nout, integer* ntra, logical* trace, logical* rewi, logical* fatal, integer* nidim, integer* idim, integer* nalf, real* alf, integer* nmax, real* a, real* aa, real* as, real* b, real* bb, real* bs, real* ct, real* g, real* c__, integer* iorder, ftnlen sname_len)
  1356. {
  1357. /* Initialized data */
  1358. static char ichu[2+1] = "UL";
  1359. static char icht[3+1] = "NTC";
  1360. static char ichd[2+1] = "UN";
  1361. static char ichs[2+1] = "LR";
  1362. /* System generated locals */
  1363. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  1364. i__3, i__4, i__5;
  1365. /* Local variables */
  1366. static char diag[1];
  1367. static integer ldas, ldbs;
  1368. static logical same;
  1369. static char side[1];
  1370. static logical left, null;
  1371. static char uplo[1];
  1372. static integer i__, j, m, n;
  1373. static real alpha;
  1374. static char diags[1];
  1375. static logical isame[13];
  1376. static char sides[1];
  1377. static integer nargs;
  1378. static logical reset;
  1379. static char uplos[1];
  1380. extern /* Subroutine */ void sprcn3_(integer*, integer*, char*, integer*, char*, char*, char*, char*, integer*, integer*, real*, integer*, integer*, ftnlen , ftnlen, ftnlen, ftnlen, ftnlen);
  1381. static integer ia, na, nc, im, in, ms, ns;
  1382. static char tranas[1], transa[1];
  1383. static real errmax;
  1384. extern /* Subroutine */ int smake_(char*, char*, char*, integer*, integer*, real*, integer*, real*, integer*, logical*, real*, ftnlen, ftnlen, ftnlen);
  1385. extern /* Subroutine */ int smmch_(char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, real*, real*, real*, integer*, real*, real*, logical*, integer*, logical*, ftnlen, ftnlen);
  1386. extern logical lseres_(char*, char*, integer*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  1387. extern /* Subroutine */ void cstrmm_(integer*, char*, char*, char*, char*, integer*, integer*, real*, real*, integer*, real*, integer*, ftnlen, ftnlen, ftnlen, ftnlen);
  1388. extern /* Subroutine */ void cstrsm_(integer*, char*, char*, char*, char*, integer*, integer*, real*, real*, integer*, real*, integer*, ftnlen, ftnlen, ftnlen, ftnlen);
  1389. static integer laa, icd, lbb, lda, ldb, ics;
  1390. static real als;
  1391. static integer ict, icu;
  1392. extern logical lse_(real*, real*, integer*);
  1393. static real err;
  1394. /* Tests STRMM and STRSM. */
  1395. /* Auxiliary routine for test program for Level 3 Blas. */
  1396. /* -- Written on 8-February-1989. */
  1397. /* Jack Dongarra, Argonne National Laboratory. */
  1398. /* Iain Duff, AERE Harwell. */
  1399. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  1400. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  1401. /* .. Parameters .. */
  1402. /* .. Scalar Arguments .. */
  1403. /* .. Array Arguments .. */
  1404. /* .. Local Scalars .. */
  1405. /* .. Local Arrays .. */
  1406. /* .. External Functions .. */
  1407. /* .. External Subroutines .. */
  1408. /* .. Intrinsic Functions .. */
  1409. /* .. Scalars in Common .. */
  1410. /* .. Common blocks .. */
  1411. /* .. Data statements .. */
  1412. /* Parameter adjustments */
  1413. --idim;
  1414. --alf;
  1415. c_dim1 = *nmax;
  1416. c_offset = 1 + c_dim1 * 1;
  1417. c__ -= c_offset;
  1418. --g;
  1419. --ct;
  1420. --bs;
  1421. --bb;
  1422. b_dim1 = *nmax;
  1423. b_offset = 1 + b_dim1 * 1;
  1424. b -= b_offset;
  1425. --as;
  1426. --aa;
  1427. a_dim1 = *nmax;
  1428. a_offset = 1 + a_dim1 * 1;
  1429. a -= a_offset;
  1430. /* Function Body */
  1431. /* .. Executable Statements .. */
  1432. nargs = 11;
  1433. nc = 0;
  1434. reset = TRUE_;
  1435. errmax = (float)0.;
  1436. /* Set up zero matrix for SMMCH. */
  1437. i__1 = *nmax;
  1438. for (j = 1; j <= i__1; ++j) {
  1439. i__2 = *nmax;
  1440. for (i__ = 1; i__ <= i__2; ++i__) {
  1441. c__[i__ + j * c_dim1] = (float)0.;
  1442. /* L10: */
  1443. }
  1444. /* L20: */
  1445. }
  1446. i__1 = *nidim;
  1447. for (im = 1; im <= i__1; ++im) {
  1448. m = idim[im];
  1449. i__2 = *nidim;
  1450. for (in = 1; in <= i__2; ++in) {
  1451. n = idim[in];
  1452. /* Set LDB to 1 more than minimum value if room. */
  1453. ldb = m;
  1454. if (ldb < *nmax) {
  1455. ++ldb;
  1456. }
  1457. /* Skip tests if not enough room. */
  1458. if (ldb > *nmax) {
  1459. goto L130;
  1460. }
  1461. lbb = ldb * n;
  1462. null = m <= 0 || n <= 0;
  1463. for (ics = 1; ics <= 2; ++ics) {
  1464. *(unsigned char *)side = *(unsigned char *)&ichs[ics - 1];
  1465. left = *(unsigned char *)side == 'L';
  1466. if (left) {
  1467. na = m;
  1468. } else {
  1469. na = n;
  1470. }
  1471. /* Set LDA to 1 more than minimum value if room. */
  1472. lda = na;
  1473. if (lda < *nmax) {
  1474. ++lda;
  1475. }
  1476. /* Skip tests if not enough room. */
  1477. if (lda > *nmax) {
  1478. goto L130;
  1479. }
  1480. laa = lda * na;
  1481. for (icu = 1; icu <= 2; ++icu) {
  1482. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  1483. for (ict = 1; ict <= 3; ++ict) {
  1484. *(unsigned char *)transa = *(unsigned char *)&icht[
  1485. ict - 1];
  1486. for (icd = 1; icd <= 2; ++icd) {
  1487. *(unsigned char *)diag = *(unsigned char *)&ichd[
  1488. icd - 1];
  1489. i__3 = *nalf;
  1490. for (ia = 1; ia <= i__3; ++ia) {
  1491. alpha = alf[ia];
  1492. /* Generate the matrix A. */
  1493. smake_("TR", uplo, diag, &na, &na, &a[
  1494. a_offset], nmax, &aa[1], &lda, &reset,
  1495. &c_b103, (ftnlen)2, (ftnlen)1, (
  1496. ftnlen)1);
  1497. /* Generate the matrix B. */
  1498. smake_("GE", " ", " ", &m, &n, &b[b_offset],
  1499. nmax, &bb[1], &ldb, &reset, &c_b103, (
  1500. ftnlen)2, (ftnlen)1, (ftnlen)1);
  1501. ++nc;
  1502. /* Save every datum before calling the */
  1503. /* subroutine. */
  1504. *(unsigned char *)sides = *(unsigned char *)
  1505. side;
  1506. *(unsigned char *)uplos = *(unsigned char *)
  1507. uplo;
  1508. *(unsigned char *)tranas = *(unsigned char *)
  1509. transa;
  1510. *(unsigned char *)diags = *(unsigned char *)
  1511. diag;
  1512. ms = m;
  1513. ns = n;
  1514. als = alpha;
  1515. i__4 = laa;
  1516. for (i__ = 1; i__ <= i__4; ++i__) {
  1517. as[i__] = aa[i__];
  1518. /* L30: */
  1519. }
  1520. ldas = lda;
  1521. i__4 = lbb;
  1522. for (i__ = 1; i__ <= i__4; ++i__) {
  1523. bs[i__] = bb[i__];
  1524. /* L40: */
  1525. }
  1526. ldbs = ldb;
  1527. /* Call the subroutine. */
  1528. if (s_cmp(sname + 9, "mm", (ftnlen)2, (ftnlen)
  1529. 2) == 0) {
  1530. if (*trace) {
  1531. sprcn3_(ntra, &nc, sname, iorder,
  1532. side, uplo, transa, diag, &m,
  1533. &n, &alpha, &lda, &ldb, (
  1534. ftnlen)12, (ftnlen)1, (ftnlen)
  1535. 1, (ftnlen)1, (ftnlen)1);
  1536. }
  1537. if (*rewi) {
  1538. // f_rew(&al__1);
  1539. }
  1540. cstrmm_(iorder, side, uplo, transa, diag,
  1541. &m, &n, &alpha, &aa[1], &lda, &bb[
  1542. 1], &ldb, (ftnlen)1, (ftnlen)1, (
  1543. ftnlen)1, (ftnlen)1);
  1544. } else if (s_cmp(sname + 9, "sm", (ftnlen)2, (
  1545. ftnlen)2) == 0) {
  1546. if (*trace) {
  1547. sprcn3_(ntra, &nc, sname, iorder,
  1548. side, uplo, transa, diag, &m,
  1549. &n, &alpha, &lda, &ldb, (
  1550. ftnlen)12, (ftnlen)1, (ftnlen)
  1551. 1, (ftnlen)1, (ftnlen)1);
  1552. }
  1553. if (*rewi) {
  1554. // f_rew(&al__1);
  1555. }
  1556. cstrsm_(iorder, side, uplo, transa, diag,
  1557. &m, &n, &alpha, &aa[1], &lda, &bb[
  1558. 1], &ldb, (ftnlen)1, (ftnlen)1, (
  1559. ftnlen)1, (ftnlen)1);
  1560. }
  1561. /* Check if error-exit was taken incorrectly. */
  1562. if (! infoc_1.ok) {
  1563. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  1564. *fatal = TRUE_;
  1565. goto L150;
  1566. }
  1567. /* See what data changed inside subroutines. */
  1568. isame[0] = *(unsigned char *)sides == *(
  1569. unsigned char *)side;
  1570. isame[1] = *(unsigned char *)uplos == *(
  1571. unsigned char *)uplo;
  1572. isame[2] = *(unsigned char *)tranas == *(
  1573. unsigned char *)transa;
  1574. isame[3] = *(unsigned char *)diags == *(
  1575. unsigned char *)diag;
  1576. isame[4] = ms == m;
  1577. isame[5] = ns == n;
  1578. isame[6] = als == alpha;
  1579. isame[7] = lse_(&as[1], &aa[1], &laa);
  1580. isame[8] = ldas == lda;
  1581. if (null) {
  1582. isame[9] = lse_(&bs[1], &bb[1], &lbb);
  1583. } else {
  1584. isame[9] = lseres_("GE", " ", &m, &n, &bs[
  1585. 1], &bb[1], &ldb, (ftnlen)2, (
  1586. ftnlen)1);
  1587. }
  1588. isame[10] = ldbs == ldb;
  1589. /* If data was incorrectly changed, report and */
  1590. /* return. */
  1591. same = TRUE_;
  1592. i__4 = nargs;
  1593. for (i__ = 1; i__ <= i__4; ++i__) {
  1594. same = same && isame[i__ - 1];
  1595. if (! isame[i__ - 1]) {
  1596. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  1597. }
  1598. /* L50: */
  1599. }
  1600. if (! same) {
  1601. *fatal = TRUE_;
  1602. goto L150;
  1603. }
  1604. if (! null) {
  1605. if (s_cmp(sname + 9, "mm", (ftnlen)2, (
  1606. ftnlen)2) == 0) {
  1607. /* Check the result. */
  1608. if (left) {
  1609. smmch_(transa, "N", &m, &n, &m, &
  1610. alpha, &a[a_offset], nmax,
  1611. &b[b_offset], nmax, &
  1612. c_b103, &c__[c_offset],
  1613. nmax, &ct[1], &g[1], &bb[
  1614. 1], &ldb, eps, &err,
  1615. fatal, nout, &c_true, (
  1616. ftnlen)1, (ftnlen)1);
  1617. } else {
  1618. smmch_("N", transa, &m, &n, &n, &
  1619. alpha, &b[b_offset], nmax,
  1620. &a[a_offset], nmax, &
  1621. c_b103, &c__[c_offset],
  1622. nmax, &ct[1], &g[1], &bb[
  1623. 1], &ldb, eps, &err,
  1624. fatal, nout, &c_true, (
  1625. ftnlen)1, (ftnlen)1);
  1626. }
  1627. } else if (s_cmp(sname + 9, "sm", (ftnlen)
  1628. 2, (ftnlen)2) == 0) {
  1629. /* Compute approximation to original */
  1630. /* matrix. */
  1631. i__4 = n;
  1632. for (j = 1; j <= i__4; ++j) {
  1633. i__5 = m;
  1634. for (i__ = 1; i__ <= i__5; ++i__)
  1635. {
  1636. c__[i__ + j * c_dim1] = bb[i__ + (j - 1) * ldb];
  1637. bb[i__ + (j - 1) * ldb] = alpha * b[i__ + j *
  1638. b_dim1];
  1639. /* L60: */
  1640. }
  1641. /* L70: */
  1642. }
  1643. if (left) {
  1644. smmch_(transa, "N", &m, &n, &m, &
  1645. c_b89, &a[a_offset], nmax,
  1646. &c__[c_offset], nmax, &
  1647. c_b103, &b[b_offset],
  1648. nmax, &ct[1], &g[1], &bb[
  1649. 1], &ldb, eps, &err,
  1650. fatal, nout, &c_false, (
  1651. ftnlen)1, (ftnlen)1);
  1652. } else {
  1653. smmch_("N", transa, &m, &n, &n, &
  1654. c_b89, &c__[c_offset],
  1655. nmax, &a[a_offset], nmax,
  1656. &c_b103, &b[b_offset],
  1657. nmax, &ct[1], &g[1], &bb[
  1658. 1], &ldb, eps, &err,
  1659. fatal, nout, &c_false, (
  1660. ftnlen)1, (ftnlen)1);
  1661. }
  1662. }
  1663. errmax = dmax(errmax,err);
  1664. /* If got really bad answer, report and */
  1665. /* return. */
  1666. if (*fatal) {
  1667. goto L150;
  1668. }
  1669. }
  1670. /* L80: */
  1671. }
  1672. /* L90: */
  1673. }
  1674. /* L100: */
  1675. }
  1676. /* L110: */
  1677. }
  1678. /* L120: */
  1679. }
  1680. L130:
  1681. ;
  1682. }
  1683. /* L140: */
  1684. }
  1685. /* Report result. */
  1686. if (errmax < *thresh) {
  1687. if (*iorder == 0) {
  1688. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1689. }
  1690. if (*iorder == 1) {
  1691. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1692. }
  1693. } else {
  1694. if (*iorder == 0) {
  1695. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1696. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1697. }
  1698. if (*iorder == 1) {
  1699. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1700. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1701. }
  1702. }
  1703. goto L160;
  1704. L150:
  1705. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  1706. if (*trace) {
  1707. sprcn3_(ntra, &nc, sname, iorder, side, uplo, transa, diag, &m, &n, &
  1708. alpha, &lda, &ldb, (ftnlen)12, (ftnlen)1, (ftnlen)1, (ftnlen)
  1709. 1, (ftnlen)1);
  1710. }
  1711. L160:
  1712. return 0;
  1713. /* 9995 FORMAT( 1X, I6, ': ', A12,'(', 4( '''', A1, ''',' ), 2( I3, ',' ), */
  1714. /* $ F4.1, ', A,', I3, ', B,', I3, ') .' ) */
  1715. /* End of SCHK3. */
  1716. } /* schk3_ */
  1717. /* Subroutine */ void sprcn3_(integer* nout, integer* nc, char* sname, integer* iorder, char* side, char* uplo, char* transa, char* diag, integer* m, integer* n, real* alpha, integer* lda, integer* ldb, ftnlen sname_len, ftnlen side_len, ftnlen uplo_len, ftnlen transa_len, ftnlen diag_len)
  1718. {
  1719. /* Local variables */
  1720. static char ca[14], cd[14], cs[14], cu[14], crc[14];
  1721. if (*(unsigned char *)side == 'L') {
  1722. s_copy(cs, " CblasLeft", (ftnlen)14, (ftnlen)14);
  1723. } else {
  1724. s_copy(cs, " CblasRight", (ftnlen)14, (ftnlen)14);
  1725. }
  1726. if (*(unsigned char *)uplo == 'U') {
  1727. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  1728. } else {
  1729. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  1730. }
  1731. if (*(unsigned char *)transa == 'N') {
  1732. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  1733. } else if (*(unsigned char *)transa == 'T') {
  1734. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  1735. } else {
  1736. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  1737. }
  1738. if (*(unsigned char *)diag == 'N') {
  1739. s_copy(cd, " CblasNonUnit", (ftnlen)14, (ftnlen)14);
  1740. } else {
  1741. s_copy(cd, " CblasUnit", (ftnlen)14, (ftnlen)14);
  1742. }
  1743. if (*iorder == 1) {
  1744. s_copy(crc, "CblasRowMajor", (ftnlen)14, (ftnlen)13);
  1745. } else {
  1746. s_copy(crc, "CblasColMajor", (ftnlen)14, (ftnlen)13);
  1747. }
  1748. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cs,cu);
  1749. printf(" %s %s %d %d %4.1f A %d B %d\n",ca,cd,*m,*n,*alpha,*lda,*ldb);
  1750. } /* sprcn3_ */
  1751. /* Subroutine */ int schk4_(char* sname, real* eps, real* thresh, integer* nout, integer* ntra, logical* trace, logical* rewi, logical* fatal, integer* nidim, integer* idim, integer* nalf, real* alf, integer* nbet, real* bet, integer* nmax, real* a, real* aa, real* as, real* b, real* bb, real* bs, real* c__, real* cc, real* cs, real* ct, real* g, integer* iorder, ftnlen sname_len)
  1752. {
  1753. /* Initialized data */
  1754. static char icht[3+1] = "NTC";
  1755. static char ichu[2+1] = "UL";
  1756. /* System generated locals */
  1757. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  1758. i__3, i__4, i__5;
  1759. /* Local variables */
  1760. static real beta;
  1761. static integer ldas, ldcs;
  1762. static logical same;
  1763. static real bets;
  1764. static logical tran, null;
  1765. static char uplo[1];
  1766. static integer i__, j, k, n;
  1767. static real alpha;
  1768. static logical isame[13];
  1769. static integer nargs;
  1770. static logical reset;
  1771. static char trans[1];
  1772. static logical upper;
  1773. static char uplos[1];
  1774. extern /* Subroutine */ void sprcn4_(integer*, integer*, char*, integer*, char*, char*, integer*, integer*, real*, integer*, real*, integer*, ftnlen, ftnlen, ftnlen);
  1775. extern /* Subroutine */ int smake_(char*, char*, char*, integer*, integer*, real*, integer*, real*, integer*, logical*, real*, ftnlen, ftnlen, ftnlen);
  1776. extern /* Subroutine */ int smmch_(char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, real*, real*, real*, integer*, real*, real*, logical*, integer*, logical*, ftnlen, ftnlen);
  1777. static integer ia, ib, jc, ma, na, nc, ik, in, jj, lj, ks, ns;
  1778. static real errmax;
  1779. extern logical lseres_(char*, char*, integer*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  1780. static char transs[1];
  1781. extern /* Subroutine */ void cssyrk_(integer*, char*, char*, integer*, integer*, real*, real*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  1782. static integer laa, lda, lcc, ldc;
  1783. static real als;
  1784. static integer ict, icu;
  1785. extern logical lse_(real*, real*, integer*);
  1786. static real err;
  1787. /* Tests SSYRK. */
  1788. /* Auxiliary routine for test program for Level 3 Blas. */
  1789. /* -- Written on 8-February-1989. */
  1790. /* Jack Dongarra, Argonne National Laboratory. */
  1791. /* Iain Duff, AERE Harwell. */
  1792. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  1793. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  1794. /* .. Parameters .. */
  1795. /* .. Scalar Arguments .. */
  1796. /* .. Array Arguments .. */
  1797. /* .. Local Scalars .. */
  1798. /* .. Local Arrays .. */
  1799. /* .. External Functions .. */
  1800. /* .. External Subroutines .. */
  1801. /* .. Intrinsic Functions .. */
  1802. /* .. Scalars in Common .. */
  1803. /* .. Common blocks .. */
  1804. /* .. Data statements .. */
  1805. /* Parameter adjustments */
  1806. --idim;
  1807. --alf;
  1808. --bet;
  1809. --g;
  1810. --ct;
  1811. --cs;
  1812. --cc;
  1813. c_dim1 = *nmax;
  1814. c_offset = 1 + c_dim1 * 1;
  1815. c__ -= c_offset;
  1816. --bs;
  1817. --bb;
  1818. b_dim1 = *nmax;
  1819. b_offset = 1 + b_dim1 * 1;
  1820. b -= b_offset;
  1821. --as;
  1822. --aa;
  1823. a_dim1 = *nmax;
  1824. a_offset = 1 + a_dim1 * 1;
  1825. a -= a_offset;
  1826. /* Function Body */
  1827. /* .. Executable Statements .. */
  1828. nargs = 10;
  1829. nc = 0;
  1830. reset = TRUE_;
  1831. errmax = (float)0.;
  1832. i__1 = *nidim;
  1833. for (in = 1; in <= i__1; ++in) {
  1834. n = idim[in];
  1835. /* Set LDC to 1 more than minimum value if room. */
  1836. ldc = n;
  1837. if (ldc < *nmax) {
  1838. ++ldc;
  1839. }
  1840. /* Skip tests if not enough room. */
  1841. if (ldc > *nmax) {
  1842. goto L100;
  1843. }
  1844. lcc = ldc * n;
  1845. null = n <= 0;
  1846. i__2 = *nidim;
  1847. for (ik = 1; ik <= i__2; ++ik) {
  1848. k = idim[ik];
  1849. for (ict = 1; ict <= 3; ++ict) {
  1850. *(unsigned char *)trans = *(unsigned char *)&icht[ict - 1];
  1851. tran = *(unsigned char *)trans == 'T' || *(unsigned char *)
  1852. trans == 'C';
  1853. if (tran) {
  1854. ma = k;
  1855. na = n;
  1856. } else {
  1857. ma = n;
  1858. na = k;
  1859. }
  1860. /* Set LDA to 1 more than minimum value if room. */
  1861. lda = ma;
  1862. if (lda < *nmax) {
  1863. ++lda;
  1864. }
  1865. /* Skip tests if not enough room. */
  1866. if (lda > *nmax) {
  1867. goto L80;
  1868. }
  1869. laa = lda * na;
  1870. /* Generate the matrix A. */
  1871. smake_("GE", " ", " ", &ma, &na, &a[a_offset], nmax, &aa[1], &
  1872. lda, &reset, &c_b103, (ftnlen)2, (ftnlen)1, (ftnlen)1)
  1873. ;
  1874. for (icu = 1; icu <= 2; ++icu) {
  1875. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  1876. upper = *(unsigned char *)uplo == 'U';
  1877. i__3 = *nalf;
  1878. for (ia = 1; ia <= i__3; ++ia) {
  1879. alpha = alf[ia];
  1880. i__4 = *nbet;
  1881. for (ib = 1; ib <= i__4; ++ib) {
  1882. beta = bet[ib];
  1883. /* Generate the matrix C. */
  1884. smake_("SY", uplo, " ", &n, &n, &c__[c_offset],
  1885. nmax, &cc[1], &ldc, &reset, &c_b103, (
  1886. ftnlen)2, (ftnlen)1, (ftnlen)1);
  1887. ++nc;
  1888. /* Save every datum before calling the subroutine. */
  1889. *(unsigned char *)uplos = *(unsigned char *)uplo;
  1890. *(unsigned char *)transs = *(unsigned char *)
  1891. trans;
  1892. ns = n;
  1893. ks = k;
  1894. als = alpha;
  1895. i__5 = laa;
  1896. for (i__ = 1; i__ <= i__5; ++i__) {
  1897. as[i__] = aa[i__];
  1898. /* L10: */
  1899. }
  1900. ldas = lda;
  1901. bets = beta;
  1902. i__5 = lcc;
  1903. for (i__ = 1; i__ <= i__5; ++i__) {
  1904. cs[i__] = cc[i__];
  1905. /* L20: */
  1906. }
  1907. ldcs = ldc;
  1908. /* Call the subroutine. */
  1909. if (*trace) {
  1910. sprcn4_(ntra, &nc, sname, iorder, uplo, trans,
  1911. &n, &k, &alpha, &lda, &beta, &ldc, (
  1912. ftnlen)12, (ftnlen)1, (ftnlen)1);
  1913. }
  1914. if (*rewi) {
  1915. // f_rew(&al__1);
  1916. }
  1917. cssyrk_(iorder, uplo, trans, &n, &k, &alpha, &aa[
  1918. 1], &lda, &beta, &cc[1], &ldc, (ftnlen)1,
  1919. (ftnlen)1);
  1920. /* Check if error-exit was taken incorrectly. */
  1921. if (! infoc_1.ok) {
  1922. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  1923. *fatal = TRUE_;
  1924. goto L120;
  1925. }
  1926. /* See what data changed inside subroutines. */
  1927. isame[0] = *(unsigned char *)uplos == *(unsigned
  1928. char *)uplo;
  1929. isame[1] = *(unsigned char *)transs == *(unsigned
  1930. char *)trans;
  1931. isame[2] = ns == n;
  1932. isame[3] = ks == k;
  1933. isame[4] = als == alpha;
  1934. isame[5] = lse_(&as[1], &aa[1], &laa);
  1935. isame[6] = ldas == lda;
  1936. isame[7] = bets == beta;
  1937. if (null) {
  1938. isame[8] = lse_(&cs[1], &cc[1], &lcc);
  1939. } else {
  1940. isame[8] = lseres_("SY", uplo, &n, &n, &cs[1],
  1941. &cc[1], &ldc, (ftnlen)2, (ftnlen)1);
  1942. }
  1943. isame[9] = ldcs == ldc;
  1944. /* If data was incorrectly changed, report and */
  1945. /* return. */
  1946. same = TRUE_;
  1947. i__5 = nargs;
  1948. for (i__ = 1; i__ <= i__5; ++i__) {
  1949. same = same && isame[i__ - 1];
  1950. if (! isame[i__ - 1]) {
  1951. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  1952. }
  1953. /* L30: */
  1954. }
  1955. if (! same) {
  1956. *fatal = TRUE_;
  1957. goto L120;
  1958. }
  1959. if (! null) {
  1960. /* Check the result column by column. */
  1961. jc = 1;
  1962. i__5 = n;
  1963. for (j = 1; j <= i__5; ++j) {
  1964. if (upper) {
  1965. jj = 1;
  1966. lj = j;
  1967. } else {
  1968. jj = j;
  1969. lj = n - j + 1;
  1970. }
  1971. if (tran) {
  1972. smmch_("T", "N", &lj, &c__1, &k, &
  1973. alpha, &a[jj * a_dim1 + 1],
  1974. nmax, &a[j * a_dim1 + 1],
  1975. nmax, &beta, &c__[jj + j *
  1976. c_dim1], nmax, &ct[1], &g[1],
  1977. &cc[jc], &ldc, eps, &err,
  1978. fatal, nout, &c_true, (ftnlen)
  1979. 1, (ftnlen)1);
  1980. } else {
  1981. smmch_("N", "T", &lj, &c__1, &k, &
  1982. alpha, &a[jj + a_dim1], nmax,
  1983. &a[j + a_dim1], nmax, &beta, &
  1984. c__[jj + j * c_dim1], nmax, &
  1985. ct[1], &g[1], &cc[jc], &ldc,
  1986. eps, &err, fatal, nout, &
  1987. c_true, (ftnlen)1, (ftnlen)1);
  1988. }
  1989. if (upper) {
  1990. jc += ldc;
  1991. } else {
  1992. jc = jc + ldc + 1;
  1993. }
  1994. errmax = dmax(errmax,err);
  1995. /* If got really bad answer, report and */
  1996. /* return. */
  1997. if (*fatal) {
  1998. goto L110;
  1999. }
  2000. /* L40: */
  2001. }
  2002. }
  2003. /* L50: */
  2004. }
  2005. /* L60: */
  2006. }
  2007. /* L70: */
  2008. }
  2009. L80:
  2010. ;
  2011. }
  2012. /* L90: */
  2013. }
  2014. L100:
  2015. ;
  2016. }
  2017. /* Report result. */
  2018. if (errmax < *thresh) {
  2019. if (*iorder == 0) {
  2020. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2021. }
  2022. if (*iorder == 1) {
  2023. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2024. }
  2025. } else {
  2026. if (*iorder == 0) {
  2027. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2028. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2029. }
  2030. if (*iorder == 1) {
  2031. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2032. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2033. }
  2034. }
  2035. goto L130;
  2036. L110:
  2037. if (n > 1) {
  2038. printf(" THESE ARE THE RESULTS FOR COLUMN %d:\n",j);
  2039. }
  2040. L120:
  2041. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  2042. sprcn4_(nout, &nc, sname, iorder, uplo, trans, &n, &k, &alpha, &lda, &
  2043. beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  2044. L130:
  2045. return 0;
  2046. /* 9994 FORMAT( 1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  2047. /* $ F4.1, ', A,', I3, ',', F4.1, ', C,', I3, ') .' ) */
  2048. /* End of SCHK4. */
  2049. } /* schk4_ */
  2050. /* Subroutine */ void sprcn4_(integer* nout, integer* nc, char* sname, integer* iorder, char* uplo, char* transa, integer* n, integer* k, real* alpha, integer* lda, real* beta, integer* ldc, ftnlen sname_len, ftnlen uplo_len, ftnlen transa_len)
  2051. {
  2052. /* Local variables */
  2053. static char ca[14], cu[14], crc[14];
  2054. if (*(unsigned char *)uplo == 'U') {
  2055. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  2056. } else {
  2057. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  2058. }
  2059. if (*(unsigned char *)transa == 'N') {
  2060. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  2061. } else if (*(unsigned char *)transa == 'T') {
  2062. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  2063. } else {
  2064. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  2065. }
  2066. if (*iorder == 1) {
  2067. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  2068. } else {
  2069. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  2070. }
  2071. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cu,ca);
  2072. printf("( %d %d %4.1f A %d %4.1f C %d\n",*n,*k,*alpha,*lda,*beta,*ldc);
  2073. } /* sprcn4_ */
  2074. /* Subroutine */ int schk5_(char* sname, real* eps, real* thresh, integer* nout, integer* ntra, logical* trace, logical* rewi, logical* fatal, integer* nidim, integer* idim, integer* nalf, real* alf, integer* nbet, real* bet, integer* nmax, real* ab, real* aa, real* as, real* bb, real* bs, real* c__, real* cc, real* cs, real* ct, real* g, real* w, integer* iorder, ftnlen sname_len)
  2075. {
  2076. /* Initialized data */
  2077. static char icht[3+1] = "NTC";
  2078. static char ichu[2+1] = "UL";
  2079. /* System generated locals */
  2080. integer c_dim1, c_offset, i__1, i__2, i__3, i__4, i__5, i__6, i__7, i__8;
  2081. /* Local variables */
  2082. static integer jjab;
  2083. static real beta;
  2084. static integer ldas, ldbs, ldcs;
  2085. static logical same;
  2086. static real bets;
  2087. static logical tran, null;
  2088. static char uplo[1];
  2089. static integer i__, j, k, n;
  2090. static real alpha;
  2091. static logical isame[13];
  2092. static integer nargs;
  2093. static logical reset;
  2094. static char trans[1];
  2095. static logical upper;
  2096. static char uplos[1];
  2097. static integer ia, ib;
  2098. extern /* Subroutine */ void sprcn5_(integer*, integer*, char*, integer*, char*, char*, integer*, integer*, real*, integer*, integer*, real*, integer*, ftnlen, ftnlen, ftnlen);
  2099. static integer jc, ma, na, nc, ik, in, jj, lj, ks, ns;
  2100. static real errmax;
  2101. extern logical lseres_(char*, char*, integer*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  2102. extern /* Subroutine */ int smake_(char*, char*, char*, integer*, integer*, real*, integer*, real*, integer*, logical*, real*, ftnlen, ftnlen, ftnlen);
  2103. static char transs[1];
  2104. static integer laa, lbb, lda, lcc, ldb, ldc;
  2105. static real als;
  2106. static integer ict, icu;
  2107. extern /* Subroutine */ void cssyr2k_(integer*, char*, char*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, ftnlen, ftnlen);
  2108. extern logical lse_(real*, real*, integer*);
  2109. extern /* Subroutine */ int smmch_(char*, char*, integer*, integer*, integer*, real*, real*, integer*, real*, integer*, real*, real*, integer*, real*, real*, real*, integer*, real*, real*, logical*, integer*, logical*, ftnlen, ftnlen);
  2110. static real err;
  2111. /* Tests SSYR2K. */
  2112. /* Auxiliary routine for test program for Level 3 Blas. */
  2113. /* -- Written on 8-February-1989. */
  2114. /* Jack Dongarra, Argonne National Laboratory. */
  2115. /* Iain Duff, AERE Harwell. */
  2116. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2117. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2118. /* .. Parameters .. */
  2119. /* .. Scalar Arguments .. */
  2120. /* .. Array Arguments .. */
  2121. /* .. Local Scalars .. */
  2122. /* .. Local Arrays .. */
  2123. /* .. External Functions .. */
  2124. /* .. External Subroutines .. */
  2125. /* .. Intrinsic Functions .. */
  2126. /* .. Scalars in Common .. */
  2127. /* .. Common blocks .. */
  2128. /* .. Data statements .. */
  2129. /* Parameter adjustments */
  2130. --idim;
  2131. --alf;
  2132. --bet;
  2133. --w;
  2134. --g;
  2135. --ct;
  2136. --cs;
  2137. --cc;
  2138. c_dim1 = *nmax;
  2139. c_offset = 1 + c_dim1 * 1;
  2140. c__ -= c_offset;
  2141. --bs;
  2142. --bb;
  2143. --as;
  2144. --aa;
  2145. --ab;
  2146. /* Function Body */
  2147. /* .. Executable Statements .. */
  2148. nargs = 12;
  2149. nc = 0;
  2150. reset = TRUE_;
  2151. errmax = (float)0.;
  2152. i__1 = *nidim;
  2153. for (in = 1; in <= i__1; ++in) {
  2154. n = idim[in];
  2155. /* Set LDC to 1 more than minimum value if room. */
  2156. ldc = n;
  2157. if (ldc < *nmax) {
  2158. ++ldc;
  2159. }
  2160. /* Skip tests if not enough room. */
  2161. if (ldc > *nmax) {
  2162. goto L130;
  2163. }
  2164. lcc = ldc * n;
  2165. null = n <= 0;
  2166. i__2 = *nidim;
  2167. for (ik = 1; ik <= i__2; ++ik) {
  2168. k = idim[ik];
  2169. for (ict = 1; ict <= 3; ++ict) {
  2170. *(unsigned char *)trans = *(unsigned char *)&icht[ict - 1];
  2171. tran = *(unsigned char *)trans == 'T' || *(unsigned char *)
  2172. trans == 'C';
  2173. if (tran) {
  2174. ma = k;
  2175. na = n;
  2176. } else {
  2177. ma = n;
  2178. na = k;
  2179. }
  2180. /* Set LDA to 1 more than minimum value if room. */
  2181. lda = ma;
  2182. if (lda < *nmax) {
  2183. ++lda;
  2184. }
  2185. /* Skip tests if not enough room. */
  2186. if (lda > *nmax) {
  2187. goto L110;
  2188. }
  2189. laa = lda * na;
  2190. /* Generate the matrix A. */
  2191. if (tran) {
  2192. i__3 = *nmax << 1;
  2193. smake_("GE", " ", " ", &ma, &na, &ab[1], &i__3, &aa[1], &
  2194. lda, &reset, &c_b103, (ftnlen)2, (ftnlen)1, (
  2195. ftnlen)1);
  2196. } else {
  2197. smake_("GE", " ", " ", &ma, &na, &ab[1], nmax, &aa[1], &
  2198. lda, &reset, &c_b103, (ftnlen)2, (ftnlen)1, (
  2199. ftnlen)1);
  2200. }
  2201. /* Generate the matrix B. */
  2202. ldb = lda;
  2203. lbb = laa;
  2204. if (tran) {
  2205. i__3 = *nmax << 1;
  2206. smake_("GE", " ", " ", &ma, &na, &ab[k + 1], &i__3, &bb[1]
  2207. , &ldb, &reset, &c_b103, (ftnlen)2, (ftnlen)1, (
  2208. ftnlen)1);
  2209. } else {
  2210. smake_("GE", " ", " ", &ma, &na, &ab[k * *nmax + 1], nmax,
  2211. &bb[1], &ldb, &reset, &c_b103, (ftnlen)2, (
  2212. ftnlen)1, (ftnlen)1);
  2213. }
  2214. for (icu = 1; icu <= 2; ++icu) {
  2215. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  2216. upper = *(unsigned char *)uplo == 'U';
  2217. i__3 = *nalf;
  2218. for (ia = 1; ia <= i__3; ++ia) {
  2219. alpha = alf[ia];
  2220. i__4 = *nbet;
  2221. for (ib = 1; ib <= i__4; ++ib) {
  2222. beta = bet[ib];
  2223. /* Generate the matrix C. */
  2224. smake_("SY", uplo, " ", &n, &n, &c__[c_offset],
  2225. nmax, &cc[1], &ldc, &reset, &c_b103, (
  2226. ftnlen)2, (ftnlen)1, (ftnlen)1);
  2227. ++nc;
  2228. /* Save every datum before calling the subroutine. */
  2229. *(unsigned char *)uplos = *(unsigned char *)uplo;
  2230. *(unsigned char *)transs = *(unsigned char *)
  2231. trans;
  2232. ns = n;
  2233. ks = k;
  2234. als = alpha;
  2235. i__5 = laa;
  2236. for (i__ = 1; i__ <= i__5; ++i__) {
  2237. as[i__] = aa[i__];
  2238. /* L10: */
  2239. }
  2240. ldas = lda;
  2241. i__5 = lbb;
  2242. for (i__ = 1; i__ <= i__5; ++i__) {
  2243. bs[i__] = bb[i__];
  2244. /* L20: */
  2245. }
  2246. ldbs = ldb;
  2247. bets = beta;
  2248. i__5 = lcc;
  2249. for (i__ = 1; i__ <= i__5; ++i__) {
  2250. cs[i__] = cc[i__];
  2251. /* L30: */
  2252. }
  2253. ldcs = ldc;
  2254. /* Call the subroutine. */
  2255. if (*trace) {
  2256. sprcn5_(ntra, &nc, sname, iorder, uplo, trans,
  2257. &n, &k, &alpha, &lda, &ldb, &beta, &
  2258. ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1)
  2259. ;
  2260. }
  2261. if (*rewi) {
  2262. // f_rew(&al__1);
  2263. }
  2264. cssyr2k_(iorder, uplo, trans, &n, &k, &alpha, &aa[
  2265. 1], &lda, &bb[1], &ldb, &beta, &cc[1], &
  2266. ldc, (ftnlen)1, (ftnlen)1);
  2267. /* Check if error-exit was taken incorrectly. */
  2268. if (! infoc_1.ok) {
  2269. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  2270. *fatal = TRUE_;
  2271. goto L150;
  2272. }
  2273. /* See what data changed inside subroutines. */
  2274. isame[0] = *(unsigned char *)uplos == *(unsigned
  2275. char *)uplo;
  2276. isame[1] = *(unsigned char *)transs == *(unsigned
  2277. char *)trans;
  2278. isame[2] = ns == n;
  2279. isame[3] = ks == k;
  2280. isame[4] = als == alpha;
  2281. isame[5] = lse_(&as[1], &aa[1], &laa);
  2282. isame[6] = ldas == lda;
  2283. isame[7] = lse_(&bs[1], &bb[1], &lbb);
  2284. isame[8] = ldbs == ldb;
  2285. isame[9] = bets == beta;
  2286. if (null) {
  2287. isame[10] = lse_(&cs[1], &cc[1], &lcc);
  2288. } else {
  2289. isame[10] = lseres_("SY", uplo, &n, &n, &cs[1]
  2290. , &cc[1], &ldc, (ftnlen)2, (ftnlen)1);
  2291. }
  2292. isame[11] = ldcs == ldc;
  2293. /* If data was incorrectly changed, report and */
  2294. /* return. */
  2295. same = TRUE_;
  2296. i__5 = nargs;
  2297. for (i__ = 1; i__ <= i__5; ++i__) {
  2298. same = same && isame[i__ - 1];
  2299. if (! isame[i__ - 1]) {
  2300. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  2301. }
  2302. /* L40: */
  2303. }
  2304. if (! same) {
  2305. *fatal = TRUE_;
  2306. goto L150;
  2307. }
  2308. if (! null) {
  2309. /* Check the result column by column. */
  2310. jjab = 1;
  2311. jc = 1;
  2312. i__5 = n;
  2313. for (j = 1; j <= i__5; ++j) {
  2314. if (upper) {
  2315. jj = 1;
  2316. lj = j;
  2317. } else {
  2318. jj = j;
  2319. lj = n - j + 1;
  2320. }
  2321. if (tran) {
  2322. i__6 = k;
  2323. for (i__ = 1; i__ <= i__6; ++i__) {
  2324. w[i__] = ab[((j - 1) << 1) * *nmax
  2325. + k + i__];
  2326. w[k + i__] = ab[((j - 1) << 1) * *
  2327. nmax + i__];
  2328. /* L50: */
  2329. }
  2330. i__6 = k << 1;
  2331. i__7 = *nmax << 1;
  2332. i__8 = *nmax << 1;
  2333. smmch_("T", "N", &lj, &c__1, &i__6, &
  2334. alpha, &ab[jjab], &i__7, &w[1]
  2335. , &i__8, &beta, &c__[jj + j *
  2336. c_dim1], nmax, &ct[1], &g[1],
  2337. &cc[jc], &ldc, eps, &err,
  2338. fatal, nout, &c_true, (ftnlen)
  2339. 1, (ftnlen)1);
  2340. } else {
  2341. i__6 = k;
  2342. for (i__ = 1; i__ <= i__6; ++i__) {
  2343. w[i__] = ab[(k + i__ - 1) * *nmax
  2344. + j];
  2345. w[k + i__] = ab[(i__ - 1) * *nmax
  2346. + j];
  2347. /* L60: */
  2348. }
  2349. i__6 = k << 1;
  2350. i__7 = *nmax << 1;
  2351. smmch_("N", "N", &lj, &c__1, &i__6, &
  2352. alpha, &ab[jj], nmax, &w[1], &
  2353. i__7, &beta, &c__[jj + j *
  2354. c_dim1], nmax, &ct[1], &g[1],
  2355. &cc[jc], &ldc, eps, &err,
  2356. fatal, nout, &c_true, (ftnlen)
  2357. 1, (ftnlen)1);
  2358. }
  2359. if (upper) {
  2360. jc += ldc;
  2361. } else {
  2362. jc = jc + ldc + 1;
  2363. if (tran) {
  2364. jjab += *nmax << 1;
  2365. }
  2366. }
  2367. errmax = dmax(errmax,err);
  2368. /* If got really bad answer, report and */
  2369. /* return. */
  2370. if (*fatal) {
  2371. goto L140;
  2372. }
  2373. /* L70: */
  2374. }
  2375. }
  2376. /* L80: */
  2377. }
  2378. /* L90: */
  2379. }
  2380. /* L100: */
  2381. }
  2382. L110:
  2383. ;
  2384. }
  2385. /* L120: */
  2386. }
  2387. L130:
  2388. ;
  2389. }
  2390. /* Report result. */
  2391. if (errmax < *thresh) {
  2392. if (*iorder == 0) {
  2393. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2394. }
  2395. if (*iorder == 1) {
  2396. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2397. }
  2398. } else {
  2399. if (*iorder == 0) {
  2400. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2401. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2402. }
  2403. if (*iorder == 1) {
  2404. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2405. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2406. }
  2407. }
  2408. goto L160;
  2409. L140:
  2410. if (n > 1) {
  2411. printf(" THESE ARE THE RESULTS FOR COLUMN %d:\n",j);
  2412. }
  2413. L150:
  2414. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  2415. sprcn5_(nout, &nc, sname, iorder, uplo, trans, &n, &k, &alpha, &lda, &ldb,
  2416. &beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  2417. L160:
  2418. return 0;
  2419. /* 9994 FORMAT( 1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  2420. /* $ F4.1, ', A,', I3, ', B,', I3, ',', F4.1, ', C,', I3, ') ', */
  2421. /* $ ' .' ) */
  2422. /* End of SCHK5. */
  2423. } /* schk5_ */
  2424. /* Subroutine */ void sprcn5_(integer* nout, integer* nc, char* sname, integer* iorder, char* uplo, char* transa, integer* n, integer* k, real* alpha, integer* lda, integer* ldb, real* beta, integer* ldc, ftnlen sname_len, ftnlen uplo_len, ftnlen transa_len)
  2425. {
  2426. /* Local variables */
  2427. static char ca[14], cu[14], crc[14];
  2428. if (*(unsigned char *)uplo == 'U') {
  2429. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  2430. } else {
  2431. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  2432. }
  2433. if (*(unsigned char *)transa == 'N') {
  2434. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  2435. } else if (*(unsigned char *)transa == 'T') {
  2436. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  2437. } else {
  2438. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  2439. }
  2440. if (*iorder == 1) {
  2441. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  2442. } else {
  2443. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  2444. }
  2445. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cu,ca);
  2446. printf("%d %d %4.1f , A, %d, B, %d, %4.1f , C, %d.\n",*n,*k,*alpha,*lda,*ldb,*beta,*ldc);
  2447. } /* sprcn5_ */
  2448. /* Subroutine */ int smake_(char* type__, char* uplo, char* diag, integer* m, integer* n, real* a, integer* nmax, real* aa, integer* lda, logical* reset, real* transl, ftnlen type_len, ftnlen uplo_len, ftnlen diag_len)
  2449. {
  2450. /* System generated locals */
  2451. integer a_dim1, a_offset, i__1, i__2;
  2452. /* Builtin functions */
  2453. /* Local variables */
  2454. static integer ibeg, iend;
  2455. extern doublereal sbeg_(logical*);
  2456. static logical unit;
  2457. static integer i__, j;
  2458. static logical lower, upper, gen, tri, sym;
  2459. /* Generates values for an M by N matrix A. */
  2460. /* Stores the values in the array AA in the data structure required */
  2461. /* by the routine, with unwanted elements set to rogue value. */
  2462. /* TYPE is 'GE', 'SY' or 'TR'. */
  2463. /* Auxiliary routine for test program for Level 3 Blas. */
  2464. /* -- Written on 8-February-1989. */
  2465. /* Jack Dongarra, Argonne National Laboratory. */
  2466. /* Iain Duff, AERE Harwell. */
  2467. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2468. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2469. /* .. Parameters .. */
  2470. /* .. Scalar Arguments .. */
  2471. /* .. Array Arguments .. */
  2472. /* .. Local Scalars .. */
  2473. /* .. External Functions .. */
  2474. /* .. Executable Statements .. */
  2475. /* Parameter adjustments */
  2476. a_dim1 = *nmax;
  2477. a_offset = 1 + a_dim1 * 1;
  2478. a -= a_offset;
  2479. --aa;
  2480. /* Function Body */
  2481. gen = s_cmp(type__, "GE", (ftnlen)2, (ftnlen)2) == 0;
  2482. sym = s_cmp(type__, "SY", (ftnlen)2, (ftnlen)2) == 0;
  2483. tri = s_cmp(type__, "TR", (ftnlen)2, (ftnlen)2) == 0;
  2484. upper = (sym || tri) && *(unsigned char *)uplo == 'U';
  2485. lower = (sym || tri) && *(unsigned char *)uplo == 'L';
  2486. unit = tri && *(unsigned char *)diag == 'U';
  2487. /* Generate data in array A. */
  2488. i__1 = *n;
  2489. for (j = 1; j <= i__1; ++j) {
  2490. i__2 = *m;
  2491. for (i__ = 1; i__ <= i__2; ++i__) {
  2492. if (gen || (upper && i__ <= j) || (lower && i__ >= j)) {
  2493. a[i__ + j * a_dim1] = sbeg_(reset) + *transl;
  2494. if (i__ != j) {
  2495. /* Set some elements to zero */
  2496. if (*n > 3 && j == *n / 2) {
  2497. a[i__ + j * a_dim1] = (float)0.;
  2498. }
  2499. if (sym) {
  2500. a[j + i__ * a_dim1] = a[i__ + j * a_dim1];
  2501. } else if (tri) {
  2502. a[j + i__ * a_dim1] = (float)0.;
  2503. }
  2504. }
  2505. }
  2506. /* L10: */
  2507. }
  2508. if (tri) {
  2509. a[j + j * a_dim1] += (float)1.;
  2510. }
  2511. if (unit) {
  2512. a[j + j * a_dim1] = (float)1.;
  2513. }
  2514. /* L20: */
  2515. }
  2516. /* Store elements in array AS in data structure required by routine. */
  2517. if (s_cmp(type__, "GE", (ftnlen)2, (ftnlen)2) == 0) {
  2518. i__1 = *n;
  2519. for (j = 1; j <= i__1; ++j) {
  2520. i__2 = *m;
  2521. for (i__ = 1; i__ <= i__2; ++i__) {
  2522. aa[i__ + (j - 1) * *lda] = a[i__ + j * a_dim1];
  2523. /* L30: */
  2524. }
  2525. i__2 = *lda;
  2526. for (i__ = *m + 1; i__ <= i__2; ++i__) {
  2527. aa[i__ + (j - 1) * *lda] = (float)-1e10;
  2528. /* L40: */
  2529. }
  2530. /* L50: */
  2531. }
  2532. } else if (s_cmp(type__, "SY", (ftnlen)2, (ftnlen)2) == 0 || s_cmp(type__,
  2533. "TR", (ftnlen)2, (ftnlen)2) == 0) {
  2534. i__1 = *n;
  2535. for (j = 1; j <= i__1; ++j) {
  2536. if (upper) {
  2537. ibeg = 1;
  2538. if (unit) {
  2539. iend = j - 1;
  2540. } else {
  2541. iend = j;
  2542. }
  2543. } else {
  2544. if (unit) {
  2545. ibeg = j + 1;
  2546. } else {
  2547. ibeg = j;
  2548. }
  2549. iend = *n;
  2550. }
  2551. i__2 = ibeg - 1;
  2552. for (i__ = 1; i__ <= i__2; ++i__) {
  2553. aa[i__ + (j - 1) * *lda] = (float)-1e10;
  2554. /* L60: */
  2555. }
  2556. i__2 = iend;
  2557. for (i__ = ibeg; i__ <= i__2; ++i__) {
  2558. aa[i__ + (j - 1) * *lda] = a[i__ + j * a_dim1];
  2559. /* L70: */
  2560. }
  2561. i__2 = *lda;
  2562. for (i__ = iend + 1; i__ <= i__2; ++i__) {
  2563. aa[i__ + (j - 1) * *lda] = (float)-1e10;
  2564. /* L80: */
  2565. }
  2566. /* L90: */
  2567. }
  2568. }
  2569. return 0;
  2570. /* End of SMAKE. */
  2571. } /* smake_ */
  2572. /* Subroutine */ int smmch_(char* transa, char* transb, integer* m, integer* n, integer* kk, real* alpha, real* a, integer* lda, real* b, integer* ldb, real* beta, real* c__, integer* ldc, real* ct, real* g, real* cc, integer* ldcc, real* eps, real* err, logical* fatal, integer* nout, logical* mv, ftnlen transa_len, ftnlen transb_len)
  2573. {
  2574. /* System generated locals */
  2575. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, cc_dim1,
  2576. cc_offset, i__1, i__2, i__3;
  2577. real r__1, r__2;
  2578. /* Builtin functions */
  2579. double sqrt(double);
  2580. /* Local variables */
  2581. static real erri;
  2582. static integer i__, j, k;
  2583. static logical trana, tranb;
  2584. /* Checks the results of the computational tests. */
  2585. /* Auxiliary routine for test program for Level 3 Blas. */
  2586. /* -- Written on 8-February-1989. */
  2587. /* Jack Dongarra, Argonne National Laboratory. */
  2588. /* Iain Duff, AERE Harwell. */
  2589. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2590. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2591. /* .. Parameters .. */
  2592. /* .. Scalar Arguments .. */
  2593. /* .. Array Arguments .. */
  2594. /* .. Local Scalars .. */
  2595. /* .. Intrinsic Functions .. */
  2596. /* .. Executable Statements .. */
  2597. /* Parameter adjustments */
  2598. a_dim1 = *lda;
  2599. a_offset = 1 + a_dim1 * 1;
  2600. a -= a_offset;
  2601. b_dim1 = *ldb;
  2602. b_offset = 1 + b_dim1 * 1;
  2603. b -= b_offset;
  2604. c_dim1 = *ldc;
  2605. c_offset = 1 + c_dim1 * 1;
  2606. c__ -= c_offset;
  2607. --ct;
  2608. --g;
  2609. cc_dim1 = *ldcc;
  2610. cc_offset = 1 + cc_dim1 * 1;
  2611. cc -= cc_offset;
  2612. /* Function Body */
  2613. trana = *(unsigned char *)transa == 'T' || *(unsigned char *)transa ==
  2614. 'C';
  2615. tranb = *(unsigned char *)transb == 'T' || *(unsigned char *)transb ==
  2616. 'C';
  2617. /* Compute expected result, one column at a time, in CT using data */
  2618. /* in A, B and C. */
  2619. /* Compute gauges in G. */
  2620. i__1 = *n;
  2621. for (j = 1; j <= i__1; ++j) {
  2622. i__2 = *m;
  2623. for (i__ = 1; i__ <= i__2; ++i__) {
  2624. ct[i__] = (float)0.;
  2625. g[i__] = (float)0.;
  2626. /* L10: */
  2627. }
  2628. if (! trana && ! tranb) {
  2629. i__2 = *kk;
  2630. for (k = 1; k <= i__2; ++k) {
  2631. i__3 = *m;
  2632. for (i__ = 1; i__ <= i__3; ++i__) {
  2633. ct[i__] += a[i__ + k * a_dim1] * b[k + j * b_dim1];
  2634. g[i__] += (r__1 = a[i__ + k * a_dim1], dabs(r__1)) * (
  2635. r__2 = b[k + j * b_dim1], dabs(r__2));
  2636. /* L20: */
  2637. }
  2638. /* L30: */
  2639. }
  2640. } else if (trana && ! tranb) {
  2641. i__2 = *kk;
  2642. for (k = 1; k <= i__2; ++k) {
  2643. i__3 = *m;
  2644. for (i__ = 1; i__ <= i__3; ++i__) {
  2645. ct[i__] += a[k + i__ * a_dim1] * b[k + j * b_dim1];
  2646. g[i__] += (r__1 = a[k + i__ * a_dim1], dabs(r__1)) * (
  2647. r__2 = b[k + j * b_dim1], dabs(r__2));
  2648. /* L40: */
  2649. }
  2650. /* L50: */
  2651. }
  2652. } else if (! trana && tranb) {
  2653. i__2 = *kk;
  2654. for (k = 1; k <= i__2; ++k) {
  2655. i__3 = *m;
  2656. for (i__ = 1; i__ <= i__3; ++i__) {
  2657. ct[i__] += a[i__ + k * a_dim1] * b[j + k * b_dim1];
  2658. g[i__] += (r__1 = a[i__ + k * a_dim1], dabs(r__1)) * (
  2659. r__2 = b[j + k * b_dim1], dabs(r__2));
  2660. /* L60: */
  2661. }
  2662. /* L70: */
  2663. }
  2664. } else if (trana && tranb) {
  2665. i__2 = *kk;
  2666. for (k = 1; k <= i__2; ++k) {
  2667. i__3 = *m;
  2668. for (i__ = 1; i__ <= i__3; ++i__) {
  2669. ct[i__] += a[k + i__ * a_dim1] * b[j + k * b_dim1];
  2670. g[i__] += (r__1 = a[k + i__ * a_dim1], dabs(r__1)) * (
  2671. r__2 = b[j + k * b_dim1], dabs(r__2));
  2672. /* L80: */
  2673. }
  2674. /* L90: */
  2675. }
  2676. }
  2677. i__2 = *m;
  2678. for (i__ = 1; i__ <= i__2; ++i__) {
  2679. ct[i__] = *alpha * ct[i__] + *beta * c__[i__ + j * c_dim1];
  2680. g[i__] = dabs(*alpha) * g[i__] + dabs(*beta) * (r__1 = c__[i__ +
  2681. j * c_dim1], dabs(r__1));
  2682. /* L100: */
  2683. }
  2684. /* Compute the error ratio for this result. */
  2685. *err = (float)0.;
  2686. i__2 = *m;
  2687. for (i__ = 1; i__ <= i__2; ++i__) {
  2688. erri = (r__1 = ct[i__] - cc[i__ + j * cc_dim1], dabs(r__1)) / *
  2689. eps;
  2690. if (g[i__] != (float)0.) {
  2691. erri /= g[i__];
  2692. }
  2693. *err = dmax(*err,erri);
  2694. if (*err * sqrt(*eps) >= (float)1.) {
  2695. goto L130;
  2696. }
  2697. /* L110: */
  2698. }
  2699. /* L120: */
  2700. }
  2701. /* If the loop completes, all results are at least half accurate. */
  2702. goto L150;
  2703. /* Report fatal error. */
  2704. L130:
  2705. *fatal = TRUE_;
  2706. printf(" ******* FATAL ERROR - COMPUTED RESULT IS LESS THAN HALF ACCURATE *******\n");
  2707. printf(" EXPECTED RESULT COMPUTED RESULT\n");
  2708. i__1 = *m;
  2709. for (i__ = 1; i__ <= i__1; ++i__) {
  2710. if (*mv) {
  2711. printf("%7d %15.6g %15.6g\n",i__,ct[i__],cc[i__+j*cc_dim1]);
  2712. } else {
  2713. printf("%7d %15.6g %15.6g\n",i__,cc[i__+j*cc_dim1],ct[i__]);
  2714. }
  2715. /* L140: */
  2716. }
  2717. if (*n > 1) {
  2718. printf(" THESE ARE THE RESULTS FOR COLUMN %d\n",j);
  2719. }
  2720. L150:
  2721. return 0;
  2722. /* End of SMMCH. */
  2723. } /* smmch_ */
  2724. logical lse_(real* ri, real* rj, integer* lr)
  2725. {
  2726. /* System generated locals */
  2727. integer i__1;
  2728. logical ret_val;
  2729. /* Local variables */
  2730. static integer i__;
  2731. /* Tests if two arrays are identical. */
  2732. /* Auxiliary routine for test program for Level 3 Blas. */
  2733. /* -- Written on 8-February-1989. */
  2734. /* Jack Dongarra, Argonne National Laboratory. */
  2735. /* Iain Duff, AERE Harwell. */
  2736. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2737. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2738. /* .. Scalar Arguments .. */
  2739. /* .. Array Arguments .. */
  2740. /* .. Local Scalars .. */
  2741. /* .. Executable Statements .. */
  2742. /* Parameter adjustments */
  2743. --rj;
  2744. --ri;
  2745. /* Function Body */
  2746. i__1 = *lr;
  2747. for (i__ = 1; i__ <= i__1; ++i__) {
  2748. if (ri[i__] != rj[i__]) {
  2749. goto L20;
  2750. }
  2751. /* L10: */
  2752. }
  2753. ret_val = TRUE_;
  2754. goto L30;
  2755. L20:
  2756. ret_val = FALSE_;
  2757. L30:
  2758. return ret_val;
  2759. /* End of LSE. */
  2760. } /* lse_ */
  2761. logical lseres_(char* type__, char* uplo, integer* m, integer* n, real* aa, real* as, integer* lda, ftnlen type_len, ftnlen uplo_len)
  2762. {
  2763. /* System generated locals */
  2764. integer aa_dim1, aa_offset, as_dim1, as_offset, i__1, i__2;
  2765. logical ret_val;
  2766. /* Builtin functions */
  2767. /* Local variables */
  2768. static integer ibeg, iend, i__, j;
  2769. static logical upper;
  2770. /* Tests if selected elements in two arrays are equal. */
  2771. /* TYPE is 'GE' or 'SY'. */
  2772. /* Auxiliary routine for test program for Level 3 Blas. */
  2773. /* -- Written on 8-February-1989. */
  2774. /* Jack Dongarra, Argonne National Laboratory. */
  2775. /* Iain Duff, AERE Harwell. */
  2776. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2777. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2778. /* .. Scalar Arguments .. */
  2779. /* .. Array Arguments .. */
  2780. /* .. Local Scalars .. */
  2781. /* .. Executable Statements .. */
  2782. /* Parameter adjustments */
  2783. as_dim1 = *lda;
  2784. as_offset = 1 + as_dim1 * 1;
  2785. as -= as_offset;
  2786. aa_dim1 = *lda;
  2787. aa_offset = 1 + aa_dim1 * 1;
  2788. aa -= aa_offset;
  2789. /* Function Body */
  2790. upper = *(unsigned char *)uplo == 'U';
  2791. if (s_cmp(type__, "GE", (ftnlen)2, (ftnlen)2) == 0) {
  2792. i__1 = *n;
  2793. for (j = 1; j <= i__1; ++j) {
  2794. i__2 = *lda;
  2795. for (i__ = *m + 1; i__ <= i__2; ++i__) {
  2796. if (aa[i__ + j * aa_dim1] != as[i__ + j * as_dim1]) {
  2797. goto L70;
  2798. }
  2799. /* L10: */
  2800. }
  2801. /* L20: */
  2802. }
  2803. } else if (s_cmp(type__, "SY", (ftnlen)2, (ftnlen)2) == 0) {
  2804. i__1 = *n;
  2805. for (j = 1; j <= i__1; ++j) {
  2806. if (upper) {
  2807. ibeg = 1;
  2808. iend = j;
  2809. } else {
  2810. ibeg = j;
  2811. iend = *n;
  2812. }
  2813. i__2 = ibeg - 1;
  2814. for (i__ = 1; i__ <= i__2; ++i__) {
  2815. if (aa[i__ + j * aa_dim1] != as[i__ + j * as_dim1]) {
  2816. goto L70;
  2817. }
  2818. /* L30: */
  2819. }
  2820. i__2 = *lda;
  2821. for (i__ = iend + 1; i__ <= i__2; ++i__) {
  2822. if (aa[i__ + j * aa_dim1] != as[i__ + j * as_dim1]) {
  2823. goto L70;
  2824. }
  2825. /* L40: */
  2826. }
  2827. /* L50: */
  2828. }
  2829. }
  2830. /* 60 CONTINUE */
  2831. ret_val = TRUE_;
  2832. goto L80;
  2833. L70:
  2834. ret_val = FALSE_;
  2835. L80:
  2836. return ret_val;
  2837. /* End of LSERES. */
  2838. } /* lseres_ */
  2839. doublereal sbeg_(logical* reset)
  2840. {
  2841. /* System generated locals */
  2842. real ret_val;
  2843. /* Local variables */
  2844. static integer i__, ic, mi;
  2845. /* Generates random numbers uniformly distributed between -0.5 and 0.5. */
  2846. /* Auxiliary routine for test program for Level 3 Blas. */
  2847. /* -- Written on 8-February-1989. */
  2848. /* Jack Dongarra, Argonne National Laboratory. */
  2849. /* Iain Duff, AERE Harwell. */
  2850. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2851. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2852. /* .. Scalar Arguments .. */
  2853. /* .. Local Scalars .. */
  2854. /* .. Save statement .. */
  2855. /* .. Executable Statements .. */
  2856. if (*reset) {
  2857. /* Initialize local variables. */
  2858. mi = 891;
  2859. i__ = 7;
  2860. ic = 0;
  2861. *reset = FALSE_;
  2862. }
  2863. /* The sequence of values of I is bounded between 1 and 999. */
  2864. /* If initial I = 1,2,3,6,7 or 9, the period will be 50. */
  2865. /* If initial I = 4 or 8, the period will be 25. */
  2866. /* If initial I = 5, the period will be 10. */
  2867. /* IC is used to break up the period by skipping 1 value of I in 6. */
  2868. ++ic;
  2869. L10:
  2870. i__ *= mi;
  2871. i__ -= i__ / 1000 * 1000;
  2872. if (ic >= 5) {
  2873. ic = 0;
  2874. goto L10;
  2875. }
  2876. ret_val = (i__ - 500) / (float)1001.;
  2877. return ret_val;
  2878. /* End of SBEG. */
  2879. } /* sbeg_ */
  2880. doublereal sdiff_(real* x, real* y)
  2881. {
  2882. /* System generated locals */
  2883. real ret_val;
  2884. /* Auxiliary routine for test program for Level 3 Blas. */
  2885. /* -- Written on 8-February-1989. */
  2886. /* Jack Dongarra, Argonne National Laboratory. */
  2887. /* Iain Duff, AERE Harwell. */
  2888. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2889. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2890. /* .. Scalar Arguments .. */
  2891. /* .. Executable Statements .. */
  2892. ret_val = *x - *y;
  2893. return ret_val;
  2894. /* End of SDIFF. */
  2895. } /* sdiff_ */
  2896. /* Main program alias */ /*int sblat3_ () { MAIN__ (); }*/