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_zblat3c.c 116 kB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276
  1. #include <math.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #include <stdio.h>
  5. #include <complex.h>
  6. #ifdef complex
  7. #undef complex
  8. #endif
  9. #ifdef I
  10. #undef I
  11. #endif
  12. #include "common.h"
  13. typedef blasint integer;
  14. typedef unsigned int uinteger;
  15. typedef char *address;
  16. typedef short int shortint;
  17. typedef float real;
  18. typedef double doublereal;
  19. typedef struct { real r, i; } complex;
  20. typedef struct { doublereal r, i; } doublecomplex;
  21. #ifdef _MSC_VER
  22. static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
  23. static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
  24. static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
  25. static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
  26. #else
  27. static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
  28. static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
  29. static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
  30. static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
  31. #endif
  32. #define pCf(z) (*_pCf(z))
  33. #define pCd(z) (*_pCd(z))
  34. typedef int logical;
  35. typedef short int shortlogical;
  36. typedef char logical1;
  37. typedef char integer1;
  38. #define TRUE_ (1)
  39. #define FALSE_ (0)
  40. /* Extern is for use with -E */
  41. #ifndef Extern
  42. #define Extern extern
  43. #endif
  44. /* I/O stuff */
  45. typedef int flag;
  46. typedef int ftnlen;
  47. typedef int ftnint;
  48. /*external read, write*/
  49. typedef struct
  50. { flag cierr;
  51. ftnint ciunit;
  52. flag ciend;
  53. char *cifmt;
  54. ftnint cirec;
  55. } cilist;
  56. /*internal read, write*/
  57. typedef struct
  58. { flag icierr;
  59. char *iciunit;
  60. flag iciend;
  61. char *icifmt;
  62. ftnint icirlen;
  63. ftnint icirnum;
  64. } icilist;
  65. /*open*/
  66. typedef struct
  67. { flag oerr;
  68. ftnint ounit;
  69. char *ofnm;
  70. ftnlen ofnmlen;
  71. char *osta;
  72. char *oacc;
  73. char *ofm;
  74. ftnint orl;
  75. char *oblnk;
  76. } olist;
  77. /*close*/
  78. typedef struct
  79. { flag cerr;
  80. ftnint cunit;
  81. char *csta;
  82. } cllist;
  83. /*rewind, backspace, endfile*/
  84. typedef struct
  85. { flag aerr;
  86. ftnint aunit;
  87. } alist;
  88. /* inquire */
  89. typedef struct
  90. { flag inerr;
  91. ftnint inunit;
  92. char *infile;
  93. ftnlen infilen;
  94. ftnint *inex; /*parameters in standard's order*/
  95. ftnint *inopen;
  96. ftnint *innum;
  97. ftnint *innamed;
  98. char *inname;
  99. ftnlen innamlen;
  100. char *inacc;
  101. ftnlen inacclen;
  102. char *inseq;
  103. ftnlen inseqlen;
  104. char *indir;
  105. ftnlen indirlen;
  106. char *infmt;
  107. ftnlen infmtlen;
  108. char *inform;
  109. ftnint informlen;
  110. char *inunf;
  111. ftnlen inunflen;
  112. ftnint *inrecl;
  113. ftnint *innrec;
  114. char *inblank;
  115. ftnlen inblanklen;
  116. } inlist;
  117. #define VOID void
  118. union Multitype { /* for multiple entry points */
  119. integer1 g;
  120. shortint h;
  121. integer i;
  122. /* longint j; */
  123. real r;
  124. doublereal d;
  125. complex c;
  126. doublecomplex z;
  127. };
  128. typedef union Multitype Multitype;
  129. struct Vardesc { /* for Namelist */
  130. char *name;
  131. char *addr;
  132. ftnlen *dims;
  133. int type;
  134. };
  135. typedef struct Vardesc Vardesc;
  136. struct Namelist {
  137. char *name;
  138. Vardesc **vars;
  139. int nvars;
  140. };
  141. typedef struct Namelist Namelist;
  142. #define abs(x) ((x) >= 0 ? (x) : -(x))
  143. #define dabs(x) (fabs(x))
  144. #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
  145. #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
  146. #define dmin(a,b) (f2cmin(a,b))
  147. #define dmax(a,b) (f2cmax(a,b))
  148. #define bit_test(a,b) ((a) >> (b) & 1)
  149. #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
  150. #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
  151. #define abort_() { sig_die("Fortran abort routine called", 1); }
  152. #define c_abs(z) (cabsf(Cf(z)))
  153. #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
  154. #ifdef _MSC_VER
  155. #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
  156. #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/Cd(b)._Val[1]);}
  157. #else
  158. #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
  159. #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
  160. #endif
  161. #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
  162. #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
  163. #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
  164. //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
  165. #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
  166. #define d_abs(x) (fabs(*(x)))
  167. #define d_acos(x) (acos(*(x)))
  168. #define d_asin(x) (asin(*(x)))
  169. #define d_atan(x) (atan(*(x)))
  170. #define d_atn2(x, y) (atan2(*(x),*(y)))
  171. #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
  172. #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
  173. #define d_cos(x) (cos(*(x)))
  174. #define d_cosh(x) (cosh(*(x)))
  175. #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
  176. #define d_exp(x) (exp(*(x)))
  177. #define d_imag(z) (cimag(Cd(z)))
  178. #define r_imag(z) (cimagf(Cf(z)))
  179. #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  180. #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
  181. #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  182. #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
  183. #define d_log(x) (log(*(x)))
  184. #define d_mod(x, y) (fmod(*(x), *(y)))
  185. #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
  186. #define d_nint(x) u_nint(*(x))
  187. #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
  188. #define d_sign(a,b) u_sign(*(a),*(b))
  189. #define r_sign(a,b) u_sign(*(a),*(b))
  190. #define d_sin(x) (sin(*(x)))
  191. #define d_sinh(x) (sinh(*(x)))
  192. #define d_sqrt(x) (sqrt(*(x)))
  193. #define d_tan(x) (tan(*(x)))
  194. #define d_tanh(x) (tanh(*(x)))
  195. #define i_abs(x) abs(*(x))
  196. #define i_dnnt(x) ((integer)u_nint(*(x)))
  197. #define i_len(s, n) (n)
  198. #define i_nint(x) ((integer)u_nint(*(x)))
  199. #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
  200. #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
  201. #define pow_si(B,E) spow_ui(*(B),*(E))
  202. #define pow_ri(B,E) spow_ui(*(B),*(E))
  203. #define pow_di(B,E) dpow_ui(*(B),*(E))
  204. #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
  205. #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
  206. #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
  207. #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
  208. #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
  209. #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
  210. #define sig_die(s, kill) { exit(1); }
  211. #define s_stop(s, n) {exit(0);}
  212. #define z_abs(z) (cabs(Cd(z)))
  213. #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
  214. #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
  215. #define myexit_() break;
  216. #define mycycle_() continue;
  217. #define myceiling_(w) {ceil(w)}
  218. #define myhuge_(w) {HUGE_VAL}
  219. //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
  220. #define mymaxloc_(w,s,e,n) dmaxloc_(w,*(s),*(e),n)
  221. /* procedure parameter types for -A and -C++ */
  222. #define F2C_proc_par_types 1
  223. #ifdef __cplusplus
  224. typedef logical (*L_fp)(...);
  225. #else
  226. typedef logical (*L_fp)();
  227. #endif
  228. #if 0
  229. static float spow_ui(float x, integer n) {
  230. float pow=1.0; unsigned long int u;
  231. if(n != 0) {
  232. if(n < 0) n = -n, x = 1/x;
  233. for(u = n; ; ) {
  234. if(u & 01) pow *= x;
  235. if(u >>= 1) x *= x;
  236. else break;
  237. }
  238. }
  239. return pow;
  240. }
  241. static double dpow_ui(double x, integer n) {
  242. double pow=1.0; unsigned long int u;
  243. if(n != 0) {
  244. if(n < 0) n = -n, x = 1/x;
  245. for(u = n; ; ) {
  246. if(u & 01) pow *= x;
  247. if(u >>= 1) x *= x;
  248. else break;
  249. }
  250. }
  251. return pow;
  252. }
  253. #ifdef _MSC_VER
  254. static _Fcomplex cpow_ui(complex x, integer n) {
  255. complex pow={1.0,0.0}; unsigned long int u;
  256. if(n != 0) {
  257. if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
  258. for(u = n; ; ) {
  259. if(u & 01) pow.r *= x.r, pow.i *= x.i;
  260. if(u >>= 1) x.r *= x.r, x.i *= x.i;
  261. else break;
  262. }
  263. }
  264. _Fcomplex p={pow.r, pow.i};
  265. return p;
  266. }
  267. #else
  268. static _Complex float cpow_ui(_Complex float x, integer n) {
  269. _Complex float pow=1.0; unsigned long int u;
  270. if(n != 0) {
  271. if(n < 0) n = -n, x = 1/x;
  272. for(u = n; ; ) {
  273. if(u & 01) pow *= x;
  274. if(u >>= 1) x *= x;
  275. else break;
  276. }
  277. }
  278. return pow;
  279. }
  280. #endif
  281. #ifdef _MSC_VER
  282. static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
  283. _Dcomplex pow={1.0,0.0}; unsigned long int u;
  284. if(n != 0) {
  285. if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
  286. for(u = n; ; ) {
  287. if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
  288. if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
  289. else break;
  290. }
  291. }
  292. _Dcomplex p = {pow._Val[0], pow._Val[1]};
  293. return p;
  294. }
  295. #else
  296. static _Complex double zpow_ui(_Complex double x, integer n) {
  297. _Complex double pow=1.0; unsigned long int u;
  298. if(n != 0) {
  299. if(n < 0) n = -n, x = 1/x;
  300. for(u = n; ; ) {
  301. if(u & 01) pow *= x;
  302. if(u >>= 1) x *= x;
  303. else break;
  304. }
  305. }
  306. return pow;
  307. }
  308. #endif
  309. static integer pow_ii(integer x, integer n) {
  310. integer pow; unsigned long int u;
  311. if (n <= 0) {
  312. if (n == 0 || x == 1) pow = 1;
  313. else if (x != -1) pow = x == 0 ? 1/x : 0;
  314. else n = -n;
  315. }
  316. if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
  317. u = n;
  318. for(pow = 1; ; ) {
  319. if(u & 01) pow *= x;
  320. if(u >>= 1) x *= x;
  321. else break;
  322. }
  323. }
  324. return pow;
  325. }
  326. static integer dmaxloc_(double *w, integer s, integer e, integer *n)
  327. {
  328. double m; integer i, mi;
  329. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  330. if (w[i-1]>m) mi=i ,m=w[i-1];
  331. return mi-s+1;
  332. }
  333. static integer smaxloc_(float *w, integer s, integer e, integer *n)
  334. {
  335. float m; integer i, mi;
  336. for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
  337. if (w[i-1]>m) mi=i ,m=w[i-1];
  338. return mi-s+1;
  339. }
  340. #endif
  341. /* Common Block Declarations */
  342. struct {
  343. integer infot, noutc;
  344. logical ok, lerr;
  345. } infoc_;
  346. #define infoc_1 infoc_
  347. struct {
  348. char srnamt[12];
  349. } srnamc_;
  350. #define srnamc_1 srnamc_
  351. /* Table of constant values */
  352. static doublecomplex c_b1 = {0.,0.};
  353. static doublecomplex c_b2 = {1.,0.};
  354. static integer c__1 = 1;
  355. static integer c__65 = 65;
  356. static doublereal c_b92 = 1.;
  357. static integer c__6 = 6;
  358. static logical c_true = TRUE_;
  359. static integer c__0 = 0;
  360. static logical c_false = FALSE_;
  361. /* Main program MAIN__() */ int main()
  362. {
  363. /* Initialized data */
  364. static char snames[9][13] = { "cblas_zgemm ", "cblas_zhemm ", "cblas_zsymm ", "cblas_ztrmm ",
  365. "cblas_ztrsm ", "cblas_zherk ", "cblas_zsyrk ", "cblas_zher2k", "cblas_zsyr2k"};
  366. /* System generated locals */
  367. integer i__1, i__2, i__3, i__4, i__5;
  368. doublereal d__1;
  369. /* Builtin functions */
  370. integer s_rsle(), do_lio(), e_rsle(), f_open(), s_wsfe(), do_fio(),
  371. e_wsfe(), s_wsle(), e_wsle(), s_rsfe(), e_rsfe();
  372. /* Local variables */
  373. static integer nalf, idim[9];
  374. static logical same;
  375. static integer nbet, ntra;
  376. static logical rewi;
  377. extern /* Subroutine */ int zchk1_(), zchk2_(), zchk3_(), zchk4_(),
  378. zchk5_();
  379. static doublecomplex c__[4225] /* was [65][65] */;
  380. static doublereal g[65];
  381. static integer i__, j;
  382. extern doublereal ddiff_();
  383. static integer n;
  384. static logical fatal;
  385. static doublecomplex w[130];
  386. static logical trace;
  387. static integer nidim;
  388. extern /* Subroutine */ int zmmch_();
  389. static char snaps[32];
  390. static integer isnum;
  391. static logical ltest[9];
  392. static doublecomplex aa[4225], ab[8450] /* was [65][130] */, bb[4225],
  393. cc[4225], as[4225], bs[4225], cs[4225], ct[65];
  394. static logical sfatal, corder;
  395. static char snamet[12], transa[1], transb[1];
  396. static doublereal thresh;
  397. static logical rorder;
  398. static integer layout;
  399. static logical ltestt, tsterr;
  400. extern /* Subroutine */ int cz3chke_();
  401. static doublecomplex alf[7], bet[7];
  402. static doublereal eps, err;
  403. extern logical lze_();
  404. char tmpchar;
  405. /* Test program for the COMPLEX*16 Level 3 Blas. */
  406. /* The program must be driven by a short data file. The first 13 records */
  407. /* of the file are read using list-directed input, the last 9 records */
  408. /* are read using the format ( A12,L2 ). An annotated example of a data */
  409. /* file can be obtained by deleting the first 3 characters from the */
  410. /* following 22 lines: */
  411. /* 'CBLAT3.SNAP' NAME OF SNAPSHOT OUTPUT FILE */
  412. /* -1 UNIT NUMBER OF SNAPSHOT FILE (NOT USED IF .LT. 0) */
  413. /* F LOGICAL FLAG, T TO REWIND SNAPSHOT FILE AFTER EACH RECORD. */
  414. /* F LOGICAL FLAG, T TO STOP ON FAILURES. */
  415. /* T LOGICAL FLAG, T TO TEST ERROR EXITS. */
  416. /* 2 0 TO TEST COLUMN-MAJOR, 1 TO TEST ROW-MAJOR, 2 TO TEST BOTH */
  417. /* 16.0 THRESHOLD VALUE OF TEST RATIO */
  418. /* 6 NUMBER OF VALUES OF N */
  419. /* 0 1 2 3 5 9 VALUES OF N */
  420. /* 3 NUMBER OF VALUES OF ALPHA */
  421. /* (0.0,0.0) (1.0,0.0) (0.7,-0.9) VALUES OF ALPHA */
  422. /* 3 NUMBER OF VALUES OF BETA */
  423. /* (0.0,0.0) (1.0,0.0) (1.3,-1.1) VALUES OF BETA */
  424. /* ZGEMM T PUT F FOR NO TEST. SAME COLUMNS. */
  425. /* ZHEMM T PUT F FOR NO TEST. SAME COLUMNS. */
  426. /* ZSYMM T PUT F FOR NO TEST. SAME COLUMNS. */
  427. /* ZTRMM T PUT F FOR NO TEST. SAME COLUMNS. */
  428. /* ZTRSM T PUT F FOR NO TEST. SAME COLUMNS. */
  429. /* ZHERK T PUT F FOR NO TEST. SAME COLUMNS. */
  430. /* ZSYRK T PUT F FOR NO TEST. SAME COLUMNS. */
  431. /* ZHER2K T PUT F FOR NO TEST. SAME COLUMNS. */
  432. /* ZSYR2K T PUT F FOR NO TEST. SAME COLUMNS. */
  433. /* See: */
  434. /* Dongarra J. J., Du Croz J. J., Duff I. S. and Hammarling S. */
  435. /* A Set of Level 3 Basic Linear Algebra Subprograms. */
  436. /* Technical Memorandum No.88 (Revision 1), Mathematics and */
  437. /* Computer Science Division, Argonne National Laboratory, 9700 */
  438. /* South Cass Avenue, Argonne, Illinois 60439, US. */
  439. /* -- Written on 8-February-1989. */
  440. /* Jack Dongarra, Argonne National Laboratory. */
  441. /* Iain Duff, AERE Harwell. */
  442. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  443. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  444. /* .. Parameters .. */
  445. /* .. Local Scalars .. */
  446. /* .. Local Arrays .. */
  447. /* .. External Functions .. */
  448. /* .. External Subroutines .. */
  449. /* .. Intrinsic Functions .. */
  450. /* .. Scalars in Common .. */
  451. /* .. Common blocks .. */
  452. /* .. Data statements .. */
  453. /* .. Executable Statements .. */
  454. infoc_1.noutc = 6;
  455. /* Read name and unit number for snapshot output file and open file. */
  456. char line[80];
  457. fgets(line,80,stdin);
  458. sscanf(line,"'%s'",snaps);
  459. fgets(line,80,stdin);
  460. #ifdef USE64BITINT
  461. sscanf(line,"%ld",&ntra);
  462. #else
  463. sscanf(line,"%d",&ntra);
  464. #endif
  465. trace = ntra >= 0;
  466. if (trace) {
  467. /* o__1.oerr = 0;
  468. o__1.ounit = ntra;
  469. o__1.ofnmlen = 32;
  470. o__1.ofnm = snaps;
  471. o__1.orl = 0;
  472. o__1.osta = "NEW";
  473. o__1.oacc = 0;
  474. o__1.ofm = 0;
  475. o__1.oblnk = 0;
  476. f_open(&o__1);*/
  477. }
  478. /* Read the flag that directs rewinding of the snapshot file. */
  479. fgets(line,80,stdin);
  480. sscanf(line,"%d",&rewi);
  481. rewi = rewi && trace;
  482. /* Read the flag that directs stopping on any failure. */
  483. fgets(line,80,stdin);
  484. sscanf(line,"%c",&tmpchar);
  485. sfatal=FALSE_;
  486. if (tmpchar=='T')sfatal=TRUE_;
  487. /* Read the flag that indicates whether error exits are to be tested. */
  488. fgets(line,80,stdin);
  489. sscanf(line,"%c",&tmpchar);
  490. tsterr=FALSE_;
  491. if (tmpchar=='T')tsterr=TRUE_;
  492. /* Read the flag that indicates whether row-major data layout to be tested. */
  493. fgets(line,80,stdin);
  494. sscanf(line,"%d",&layout);
  495. /* Read the threshold value of the test ratio */
  496. fgets(line,80,stdin);
  497. sscanf(line,"%lf",&thresh);
  498. /* Read and check the parameter values for the tests. */
  499. /* Values of N */
  500. fgets(line,80,stdin);
  501. #ifdef USE64BITINT
  502. sscanf(line,"%d",&nidim);
  503. #else
  504. sscanf(line,"%d",&nidim);
  505. #endif
  506. if (nidim < 1 || nidim > 9) {
  507. fprintf(stderr,"NUMBER OF VALUES OF N IS LESS THAN 1 OR GREATER THAN 9");
  508. goto L220;
  509. }
  510. fgets(line,80,stdin);
  511. #ifdef USE64BITINT
  512. sscanf(line,"%ld %ld %ld %ld %ld %ld %ld %ld %ld",&idim[0],&idim[1],&idim[2],
  513. &idim[3],&idim[4],&idim[5],&idim[6],&idim[7],&idim[8]);
  514. #else
  515. sscanf(line,"%d %d %d %d %d %d %d %d %d",&idim[0],&idim[1],&idim[2],
  516. &idim[3],&idim[4],&idim[5],&idim[6],&idim[7],&idim[8]);
  517. #endif
  518. i__1 = nidim;
  519. for (i__ = 1; i__ <= i__1; ++i__) {
  520. if (idim[i__ - 1] < 0 || idim[i__ - 1] > 65) {
  521. fprintf(stderr,"VALUE OF N IS LESS THAN 0 OR GREATER THAN 65\n");
  522. goto L220;
  523. }
  524. /* L10: */
  525. }
  526. /* Values of ALPHA */
  527. fgets(line,80,stdin);
  528. #ifdef USE64BITINT
  529. sscanf(line,"%ld",&nalf);
  530. #else
  531. sscanf(line,"%d",&nalf);
  532. #endif
  533. if (nalf < 1 || nalf > 7) {
  534. fprintf(stderr,"VALUE OF ALPHA IS LESS THAN 0 OR GREATER THAN 7\n");
  535. goto L220;
  536. }
  537. fgets(line,80,stdin);
  538. sscanf(line,"(%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf)",&alf[0].r,&alf[0].i,&alf[1].r,&alf[1].i,&alf[2].r,&alf[2].i,&alf[3].r,&alf[3].i,
  539. &alf[4].r,&alf[4].i,&alf[5].r,&alf[5].i,&alf[6].r,&alf[6].i);
  540. /* Values of BETA */
  541. fgets(line,80,stdin);
  542. #ifdef USE64BITINT
  543. sscanf(line,"%ld",&nbet);
  544. #else
  545. sscanf(line,"%d",&nbet);
  546. #endif
  547. if (nalf < 1 || nbet > 7) {
  548. fprintf(stderr,"VALUE OF BETA IS LESS THAN 0 OR GREATER THAN 7\n");
  549. goto L220;
  550. }
  551. fgets(line,80,stdin);
  552. sscanf(line,"(%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf) (%lf,%lf)",&bet[0].r,&bet[0].i,&bet[1].r,&bet[1].i,&bet[2].r,&bet[2].i,&bet[3].r,&bet[3].i,
  553. &bet[4].r,&bet[4].i,&bet[5].r,&bet[5].i,&bet[6].r,&bet[6].i);
  554. /* Report values of parameters. */
  555. printf("TESTS OF THE DOUBLE PRECISION COMPLEX LEVEL 3 BLAS\nTHE FOLLOWING PARAMETER VALUES WILL BE USED:\n");
  556. printf(" FOR N");
  557. for (i__ =1; i__ <=nidim;++i__) printf(" %d",idim[i__-1]);
  558. printf("\n");
  559. printf(" FOR ALPHA");
  560. for (i__ =1; i__ <=nalf;++i__) printf(" (%lf,%lf)",alf[i__-1].r,alf[i__-1].i);
  561. printf("\n");
  562. printf(" FOR BETA");
  563. for (i__ =1; i__ <=nbet;++i__) printf(" (%lf,%lf)",bet[i__-1].r,bet[i__-1].i);
  564. printf("\n");
  565. if (! tsterr) {
  566. printf(" ERROR-EXITS WILL NOT BE TESTED\n");
  567. }
  568. printf("ROUTINES PASS COMPUTATIONAL TESTS IF TEST RATIO IS LESS THAN %lf\n",thresh);
  569. rorder = FALSE_;
  570. corder = FALSE_;
  571. if (layout == 2) {
  572. rorder = TRUE_;
  573. corder = TRUE_;
  574. printf("COLUMN-MAJOR AND ROW-MAJOR DATA LAYOUTS ARE TESTED\n");
  575. } else if (layout == 1) {
  576. rorder = TRUE_;
  577. printf("ROW-MAJOR DATA LAYOUT IS TESTED\n");
  578. } else if (layout == 0) {
  579. corder = TRUE_;
  580. printf("COLUMN-MAJOR DATA LAYOUT IS TESTED\n");
  581. }
  582. /* Read names of subroutines and flags which indicate */
  583. /* whether they are to be tested. */
  584. for (i__ = 1; i__ <= 9; ++i__) {
  585. ltest[i__ - 1] = FALSE_;
  586. /* L20: */
  587. }
  588. L30:
  589. if (! fgets(line,80,stdin)) {
  590. goto L60;
  591. }
  592. i__1 = sscanf(line,"%12c %c",snamet,&tmpchar);
  593. ltestt=FALSE_;
  594. if (tmpchar=='T')ltestt=TRUE_;
  595. if (i__1 < 2) {
  596. goto L60;
  597. }
  598. for (i__ = 1; i__ <= 9; ++i__) {
  599. if (s_cmp(snamet, snames[i__ - 1] , (ftnlen)12, (ftnlen)12) ==
  600. 0) {
  601. goto L50;
  602. }
  603. /* L40: */
  604. }
  605. printf("SUBPROGRAM NAME %s NOT RECOGNIZED\n****** TESTS ABANDONED ******\n",snamet);
  606. exit(1);
  607. L50:
  608. ltest[i__ - 1] = ltestt;
  609. goto L30;
  610. L60:
  611. /* cl__1.cerr = 0;
  612. cl__1.cunit = 5;
  613. cl__1.csta = 0;
  614. f_clos(&cl__1);*/
  615. /* Compute EPS (the machine precision). */
  616. eps = 1.;
  617. L70:
  618. d__1 = eps + 1.;
  619. if (ddiff_(&d__1, &c_b92) == 0.) {
  620. goto L80;
  621. }
  622. eps *= .5;
  623. goto L70;
  624. L80:
  625. eps += eps;
  626. printf("RELATIVE MACHINE PRECISION IS TAKEN TO BE %9.1g\n",eps);
  627. /* Check the reliability of ZMMCH using exact data. */
  628. n = 32;
  629. i__1 = n;
  630. for (j = 1; j <= i__1; ++j) {
  631. i__2 = n;
  632. for (i__ = 1; i__ <= i__2; ++i__) {
  633. i__3 = i__ + j * 65 - 66;
  634. /* Computing MAX */
  635. i__5 = i__ - j + 1;
  636. i__4 = f2cmax(i__5,0);
  637. ab[i__3].r = (doublereal) i__4, ab[i__3].i = 0.;
  638. /* L90: */
  639. }
  640. i__2 = j + 4224;
  641. ab[i__2].r = (doublereal) j, ab[i__2].i = 0.;
  642. i__2 = (j + 65) * 65 - 65;
  643. ab[i__2].r = (doublereal) j, ab[i__2].i = 0.;
  644. i__2 = j - 1;
  645. c__[i__2].r = 0., c__[i__2].i = 0.;
  646. /* L100: */
  647. }
  648. i__1 = n;
  649. for (j = 1; j <= i__1; ++j) {
  650. i__2 = j - 1;
  651. i__3 = j * ((j + 1) * j) / 2 - (j + 1) * j * (j - 1) / 3;
  652. cc[i__2].r = (doublereal) i__3, cc[i__2].i = 0.;
  653. /* L110: */
  654. }
  655. /* CC holds the exact result. On exit from ZMMCH CT holds */
  656. /* the result computed by ZMMCH. */
  657. *(unsigned char *)transa = 'N';
  658. *(unsigned char *)transb = 'N';
  659. zmmch_(transa, transb, &n, &c__1, &n, &c_b2, ab, &c__65, &ab[4225], &
  660. c__65, &c_b1, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &fatal,
  661. &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  662. same = lze_(cc, ct, &n);
  663. if (! same || err != 0.) {
  664. printf("ERROR IN ZMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  665. printf("ZMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  666. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  667. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  668. printf("****** TESTS ABANDONED ******\n");
  669. exit(1);
  670. }
  671. *(unsigned char *)transb = 'C';
  672. zmmch_(transa, transb, &n, &c__1, &n, &c_b2, ab, &c__65, &ab[4225], &
  673. c__65, &c_b1, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &fatal,
  674. &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  675. same = lze_(cc, ct, &n);
  676. if (! same || err != 0.) {
  677. printf("ERROR IN ZMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  678. printf("ZMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  679. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  680. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  681. printf("****** TESTS ABANDONED ******\n");
  682. exit(1);
  683. }
  684. i__1 = n;
  685. for (j = 1; j <= i__1; ++j) {
  686. i__2 = j + 4224;
  687. i__3 = n - j + 1;
  688. ab[i__2].r = (doublereal) i__3, ab[i__2].i = 0.;
  689. i__2 = (j + 65) * 65 - 65;
  690. i__3 = n - j + 1;
  691. ab[i__2].r = (doublereal) i__3, ab[i__2].i = 0.;
  692. /* L120: */
  693. }
  694. i__1 = n;
  695. for (j = 1; j <= i__1; ++j) {
  696. i__2 = n - j;
  697. i__3 = j * ((j + 1) * j) / 2 - (j + 1) * j * (j - 1) / 3;
  698. cc[i__2].r = (doublereal) i__3, cc[i__2].i = 0.;
  699. /* L130: */
  700. }
  701. *(unsigned char *)transa = 'C';
  702. *(unsigned char *)transb = 'N';
  703. zmmch_(transa, transb, &n, &c__1, &n, &c_b2, ab, &c__65, &ab[4225], &
  704. c__65, &c_b1, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &fatal,
  705. &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  706. same = lze_(cc, ct, &n);
  707. if (! same || err != 0.) {
  708. printf("ERROR IN ZMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  709. printf("ZMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  710. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  711. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  712. printf("****** TESTS ABANDONED ******\n");
  713. exit(1);
  714. }
  715. *(unsigned char *)transb = 'C';
  716. zmmch_(transa, transb, &n, &c__1, &n, &c_b2, ab, &c__65, &ab[4225], &
  717. c__65, &c_b1, c__, &c__65, ct, g, cc, &c__65, &eps, &err, &fatal,
  718. &c__6, &c_true, (ftnlen)1, (ftnlen)1);
  719. same = lze_(cc, ct, &n);
  720. if (! same || err != 0.) {
  721. printf("ERROR IN ZMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALUATED WRONGLY\n");
  722. printf("ZMMCH WAS CALLED WITH TRANSA = %s AND TRANSB = %s\n", transa,transb);
  723. printf("AND RETURNED SAME = %c AND ERR = %12.3f.\n",(same==FALSE_? 'F':'T'),err);
  724. printf("THIS MAY BE DUE TO FAULTS IN THE ARITHMETIC OR THE COMPILER.\n");
  725. printf("****** TESTS ABANDONED ******\n");
  726. exit(1);
  727. }
  728. /* Test each subroutine in turn. */
  729. for (isnum = 1; isnum <= 9; ++isnum) {
  730. if (! ltest[isnum - 1]) {
  731. /* Subprogram is not to be tested. */
  732. printf("%12s WAS NOT TESTED\n",snames[isnum-1]);
  733. } else {
  734. s_copy(srnamc_1.srnamt, snames[isnum - 1], (ftnlen)12, (
  735. ftnlen)12);
  736. /* Test error exits. */
  737. if (tsterr) {
  738. cz3chke_(snames[isnum - 1], (ftnlen)12);
  739. }
  740. /* Test computations. */
  741. infoc_1.infot = 0;
  742. infoc_1.ok = TRUE_;
  743. fatal = FALSE_;
  744. switch ((int)isnum) {
  745. case 1: goto L140;
  746. case 2: goto L150;
  747. case 3: goto L150;
  748. case 4: goto L160;
  749. case 5: goto L160;
  750. case 6: goto L170;
  751. case 7: goto L170;
  752. case 8: goto L180;
  753. case 9: goto L180;
  754. }
  755. /* Test ZGEMM, 01. */
  756. L140:
  757. if (corder) {
  758. zchk1_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  759. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  760. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  761. cc, cs, ct, g, &c__0, (ftnlen)12);
  762. }
  763. if (rorder) {
  764. zchk1_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  765. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  766. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  767. cc, cs, ct, g, &c__1, (ftnlen)12);
  768. }
  769. goto L190;
  770. /* Test ZHEMM, 02, ZSYMM, 03. */
  771. L150:
  772. if (corder) {
  773. zchk2_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  774. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  775. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  776. cc, cs, ct, g, &c__0, (ftnlen)12);
  777. }
  778. if (rorder) {
  779. zchk2_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  780. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  781. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  782. cc, cs, ct, g, &c__1, (ftnlen)12);
  783. }
  784. goto L190;
  785. /* Test ZTRMM, 04, ZTRSM, 05. */
  786. L160:
  787. if (corder) {
  788. zchk3_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  789. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  790. c__65, ab, aa, as, &ab[4225], bb, bs, ct, g, c__, &
  791. c__0, (ftnlen)12);
  792. }
  793. if (rorder) {
  794. zchk3_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  795. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  796. c__65, ab, aa, as, &ab[4225], bb, bs, ct, g, c__, &
  797. c__1, (ftnlen)12);
  798. }
  799. goto L190;
  800. /* Test ZHERK, 06, ZSYRK, 07. */
  801. L170:
  802. if (corder) {
  803. zchk4_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  804. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  805. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  806. cc, cs, ct, g, &c__0, (ftnlen)12);
  807. }
  808. if (rorder) {
  809. zchk4_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  810. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  811. nbet, bet, &c__65, ab, aa, as, &ab[4225], bb, bs, c__,
  812. cc, cs, ct, g, &c__1, (ftnlen)12);
  813. }
  814. goto L190;
  815. /* Test ZHER2K, 08, ZSYR2K, 09. */
  816. L180:
  817. if (corder) {
  818. zchk5_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  819. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  820. nbet, bet, &c__65, ab, aa, as, bb, bs, c__, cc, cs,
  821. ct, g, w, &c__0, (ftnlen)12);
  822. }
  823. if (rorder) {
  824. zchk5_(snames[isnum - 1], &eps, &thresh, &c__6, &ntra,
  825. &trace, &rewi, &fatal, &nidim, idim, &nalf, alf, &
  826. nbet, bet, &c__65, ab, aa, as, bb, bs, c__, cc, cs,
  827. ct, g, w, &c__1, (ftnlen)12);
  828. }
  829. goto L190;
  830. L190:
  831. if (fatal && sfatal) {
  832. goto L210;
  833. }
  834. }
  835. /* L200: */
  836. }
  837. printf("\nEND OF TESTS\n");
  838. goto L230;
  839. L210:
  840. printf("\n****** FATAL ERROR - TESTS ABANDONED ******\n");
  841. goto L230;
  842. L220:
  843. printf("AMEND DATA FILE OR INCREASE ARRAY SIZES IN PROGRAM\n");
  844. printf("****** TESTS ABANDONED ******\n");
  845. L230:
  846. if (trace) {
  847. /* cl__1.cerr = 0;
  848. cl__1.cunit = ntra;
  849. cl__1.csta = 0;
  850. f_clos(&cl__1);*/
  851. }
  852. /* cl__1.cerr = 0;
  853. cl__1.cunit = 6;
  854. cl__1.csta = 0;
  855. f_clos(&cl__1);*/
  856. exit(0);
  857. /* End of ZBLAT3. */
  858. } /* MAIN__ */
  859. /* Subroutine */ int zchk1_(sname, eps, thresh, nout, ntra, trace, rewi,
  860. fatal, nidim, idim, nalf, alf, nbet, bet, nmax, a, aa, as, b, bb, bs,
  861. c__, cc, cs, ct, g, iorder, sname_len)
  862. char *sname;
  863. doublereal *eps, *thresh;
  864. integer *nout, *ntra;
  865. logical *trace, *rewi, *fatal;
  866. integer *nidim, *idim, *nalf;
  867. doublecomplex *alf;
  868. integer *nbet;
  869. doublecomplex *bet;
  870. integer *nmax;
  871. doublecomplex *a, *aa, *as, *b, *bb, *bs, *c__, *cc, *cs, *ct;
  872. doublereal *g;
  873. integer *iorder;
  874. ftnlen sname_len;
  875. {
  876. /* Initialized data */
  877. static char ich[3+1] = "NTC";
  878. /* System generated locals */
  879. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  880. i__3, i__4, i__5, i__6, i__7, i__8;
  881. /* Local variables */
  882. static doublecomplex beta;
  883. static integer ldas, ldbs, ldcs;
  884. static logical same, null;
  885. static integer i__, k, m, n;
  886. static doublecomplex alpha;
  887. static logical isame[13], trana, tranb;
  888. extern /* Subroutine */ int zmake_();
  889. static integer nargs;
  890. extern /* Subroutine */ int zmmch_();
  891. static logical reset;
  892. static integer ia, ib;
  893. extern /* Subroutine */ int zprcn1_();
  894. static integer ma, mb, na, nb, nc, ik, im, in, ks, ms, ns;
  895. extern /* Subroutine */ int czgemm_();
  896. static char tranas[1], tranbs[1], transa[1], transb[1];
  897. static doublereal errmax;
  898. extern logical lzeres_();
  899. static integer ica, icb, laa, lbb, lda, lcc, ldb, ldc;
  900. static doublecomplex als, bls;
  901. static doublereal err;
  902. extern logical lze_();
  903. /* Tests ZGEMM. */
  904. /* Auxiliary routine for test program for Level 3 Blas. */
  905. /* -- Written on 8-February-1989. */
  906. /* Jack Dongarra, Argonne National Laboratory. */
  907. /* Iain Duff, AERE Harwell. */
  908. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  909. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  910. /* .. Parameters .. */
  911. /* .. Scalar Arguments .. */
  912. /* .. Array Arguments .. */
  913. /* .. Local Scalars .. */
  914. /* .. Local Arrays .. */
  915. /* .. External Functions .. */
  916. /* .. External Subroutines .. */
  917. /* .. Intrinsic Functions .. */
  918. /* .. Scalars in Common .. */
  919. /* .. Common blocks .. */
  920. /* .. Data statements .. */
  921. /* Parameter adjustments */
  922. --idim;
  923. --alf;
  924. --bet;
  925. --g;
  926. --ct;
  927. --cs;
  928. --cc;
  929. c_dim1 = *nmax;
  930. c_offset = 1 + c_dim1 * 1;
  931. c__ -= c_offset;
  932. --bs;
  933. --bb;
  934. b_dim1 = *nmax;
  935. b_offset = 1 + b_dim1 * 1;
  936. b -= b_offset;
  937. --as;
  938. --aa;
  939. a_dim1 = *nmax;
  940. a_offset = 1 + a_dim1 * 1;
  941. a -= a_offset;
  942. /* Function Body */
  943. /* .. Executable Statements .. */
  944. nargs = 13;
  945. nc = 0;
  946. reset = TRUE_;
  947. errmax = 0.;
  948. i__1 = *nidim;
  949. for (im = 1; im <= i__1; ++im) {
  950. m = idim[im];
  951. i__2 = *nidim;
  952. for (in = 1; in <= i__2; ++in) {
  953. n = idim[in];
  954. /* Set LDC to 1 more than minimum value if room. */
  955. ldc = m;
  956. if (ldc < *nmax) {
  957. ++ldc;
  958. }
  959. /* Skip tests if not enough room. */
  960. if (ldc > *nmax) {
  961. goto L100;
  962. }
  963. lcc = ldc * n;
  964. null = n <= 0 || m <= 0;
  965. i__3 = *nidim;
  966. for (ik = 1; ik <= i__3; ++ik) {
  967. k = idim[ik];
  968. for (ica = 1; ica <= 3; ++ica) {
  969. *(unsigned char *)transa = *(unsigned char *)&ich[ica - 1]
  970. ;
  971. trana = *(unsigned char *)transa == 'T' || *(unsigned
  972. char *)transa == 'C';
  973. if (trana) {
  974. ma = k;
  975. na = m;
  976. } else {
  977. ma = m;
  978. na = k;
  979. }
  980. /* Set LDA to 1 more than minimum value if room. */
  981. lda = ma;
  982. if (lda < *nmax) {
  983. ++lda;
  984. }
  985. /* Skip tests if not enough room. */
  986. if (lda > *nmax) {
  987. goto L80;
  988. }
  989. laa = lda * na;
  990. /* Generate the matrix A. */
  991. zmake_("ge", " ", " ", &ma, &na, &a[a_offset], nmax, &aa[
  992. 1], &lda, &reset, &c_b1, (ftnlen)2, (ftnlen)1, (
  993. ftnlen)1);
  994. for (icb = 1; icb <= 3; ++icb) {
  995. *(unsigned char *)transb = *(unsigned char *)&ich[icb
  996. - 1];
  997. tranb = *(unsigned char *)transb == 'T' || *(unsigned
  998. char *)transb == 'C';
  999. if (tranb) {
  1000. mb = n;
  1001. nb = k;
  1002. } else {
  1003. mb = k;
  1004. nb = n;
  1005. }
  1006. /* Set LDB to 1 more than minimum value if room. */
  1007. ldb = mb;
  1008. if (ldb < *nmax) {
  1009. ++ldb;
  1010. }
  1011. /* Skip tests if not enough room. */
  1012. if (ldb > *nmax) {
  1013. goto L70;
  1014. }
  1015. lbb = ldb * nb;
  1016. /* Generate the matrix B. */
  1017. zmake_("ge", " ", " ", &mb, &nb, &b[b_offset], nmax, &
  1018. bb[1], &ldb, &reset, &c_b1, (ftnlen)2, (
  1019. ftnlen)1, (ftnlen)1);
  1020. i__4 = *nalf;
  1021. for (ia = 1; ia <= i__4; ++ia) {
  1022. i__5 = ia;
  1023. alpha.r = alf[i__5].r, alpha.i = alf[i__5].i;
  1024. i__5 = *nbet;
  1025. for (ib = 1; ib <= i__5; ++ib) {
  1026. i__6 = ib;
  1027. beta.r = bet[i__6].r, beta.i = bet[i__6].i;
  1028. /* Generate the matrix C. */
  1029. zmake_("ge", " ", " ", &m, &n, &c__[c_offset],
  1030. nmax, &cc[1], &ldc, &reset, &c_b1, (
  1031. ftnlen)2, (ftnlen)1, (ftnlen)1);
  1032. ++nc;
  1033. /* Save every datum before calling the */
  1034. /* subroutine. */
  1035. *(unsigned char *)tranas = *(unsigned char *)
  1036. transa;
  1037. *(unsigned char *)tranbs = *(unsigned char *)
  1038. transb;
  1039. ms = m;
  1040. ns = n;
  1041. ks = k;
  1042. als.r = alpha.r, als.i = alpha.i;
  1043. i__6 = laa;
  1044. for (i__ = 1; i__ <= i__6; ++i__) {
  1045. i__7 = i__;
  1046. i__8 = i__;
  1047. as[i__7].r = aa[i__8].r, as[i__7].i = aa[
  1048. i__8].i;
  1049. /* L10: */
  1050. }
  1051. ldas = lda;
  1052. i__6 = lbb;
  1053. for (i__ = 1; i__ <= i__6; ++i__) {
  1054. i__7 = i__;
  1055. i__8 = i__;
  1056. bs[i__7].r = bb[i__8].r, bs[i__7].i = bb[
  1057. i__8].i;
  1058. /* L20: */
  1059. }
  1060. ldbs = ldb;
  1061. bls.r = beta.r, bls.i = beta.i;
  1062. i__6 = lcc;
  1063. for (i__ = 1; i__ <= i__6; ++i__) {
  1064. i__7 = i__;
  1065. i__8 = i__;
  1066. cs[i__7].r = cc[i__8].r, cs[i__7].i = cc[
  1067. i__8].i;
  1068. /* L30: */
  1069. }
  1070. ldcs = ldc;
  1071. /* Call the subroutine. */
  1072. if (*trace) {
  1073. zprcn1_(ntra, &nc, sname, iorder, transa,
  1074. transb, &m, &n, &k, &alpha, &lda,
  1075. &ldb, &beta, &ldc, (ftnlen)12, (
  1076. ftnlen)1, (ftnlen)1);
  1077. }
  1078. if (*rewi) {
  1079. /* al__1.aerr = 0;
  1080. al__1.aunit = *ntra;
  1081. f_rew(&al__1);*/
  1082. }
  1083. czgemm_(iorder, transa, transb, &m, &n, &k, &
  1084. alpha, &aa[1], &lda, &bb[1], &ldb, &
  1085. beta, &cc[1], &ldc, (ftnlen)1, (
  1086. ftnlen)1);
  1087. /* Check if error-exit was taken incorrectly. */
  1088. if (! infoc_1.ok) {
  1089. printf(" *** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  1090. *fatal = TRUE_;
  1091. goto L120;
  1092. }
  1093. /* See what data changed inside subroutines. */
  1094. isame[0] = *(unsigned char *)transa == *(
  1095. unsigned char *)tranas;
  1096. isame[1] = *(unsigned char *)transb == *(
  1097. unsigned char *)tranbs;
  1098. isame[2] = ms == m;
  1099. isame[3] = ns == n;
  1100. isame[4] = ks == k;
  1101. isame[5] = als.r == alpha.r && als.i ==
  1102. alpha.i;
  1103. isame[6] = lze_(&as[1], &aa[1], &laa);
  1104. isame[7] = ldas == lda;
  1105. isame[8] = lze_(&bs[1], &bb[1], &lbb);
  1106. isame[9] = ldbs == ldb;
  1107. isame[10] = bls.r == beta.r && bls.i ==
  1108. beta.i;
  1109. if (null) {
  1110. isame[11] = lze_(&cs[1], &cc[1], &lcc);
  1111. } else {
  1112. isame[11] = lzeres_("ge", " ", &m, &n, &
  1113. cs[1], &cc[1], &ldc, (ftnlen)2, (
  1114. ftnlen)1);
  1115. }
  1116. isame[12] = ldcs == ldc;
  1117. /* If data was incorrectly changed, report */
  1118. /* and return. */
  1119. same = TRUE_;
  1120. i__6 = nargs;
  1121. for (i__ = 1; i__ <= i__6; ++i__) {
  1122. same = same && isame[i__ - 1];
  1123. if (! isame[i__ - 1]) {
  1124. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  1125. }
  1126. /* L40: */
  1127. }
  1128. if (! same) {
  1129. *fatal = TRUE_;
  1130. goto L120;
  1131. }
  1132. if (! null) {
  1133. /* Check the result. */
  1134. zmmch_(transa, transb, &m, &n, &k, &alpha,
  1135. &a[a_offset], nmax, &b[b_offset],
  1136. nmax, &beta, &c__[c_offset],
  1137. nmax, &ct[1], &g[1], &cc[1], &ldc,
  1138. eps, &err, fatal, nout, &c_true,
  1139. (ftnlen)1, (ftnlen)1);
  1140. errmax = f2cmax(errmax,err);
  1141. /* If got really bad answer, report and */
  1142. /* return. */
  1143. if (*fatal) {
  1144. goto L120;
  1145. }
  1146. }
  1147. /* L50: */
  1148. }
  1149. /* L60: */
  1150. }
  1151. L70:
  1152. ;
  1153. }
  1154. L80:
  1155. ;
  1156. }
  1157. /* L90: */
  1158. }
  1159. L100:
  1160. ;
  1161. }
  1162. /* L110: */
  1163. }
  1164. /* Report result. */
  1165. if (errmax < *thresh) {
  1166. if (*iorder == 0) {
  1167. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1168. }
  1169. if (*iorder == 1) {
  1170. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1171. }
  1172. } else {
  1173. if (*iorder == 0) {
  1174. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1175. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1176. }
  1177. if (*iorder == 1) {
  1178. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1179. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1180. }
  1181. }
  1182. goto L130;
  1183. L120:
  1184. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  1185. zprcn1_(nout, &nc, sname, iorder, transa, transb, &m, &n, &k, &alpha, &
  1186. lda, &ldb, &beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  1187. L130:
  1188. return 0;
  1189. /* 9995 FORMAT( 1X, I6, ': ', A12,'(''', A1, ''',''', A1, ''',', */
  1190. /* $ 3( I3, ',' ), '(', F4.1, ',', F4.1, '), A,', I3, ', B,', I3, */
  1191. /* $ ',(', F4.1, ',', F4.1, '), C,', I3, ').' ) */
  1192. /* End of ZCHK1. */
  1193. } /* zchk1_ */
  1194. /* Subroutine */ int zprcn1_(nout, nc, sname, iorder, transa, transb, m, n, k,
  1195. alpha, lda, ldb, beta, ldc, sname_len, transa_len, transb_len)
  1196. integer *nout, *nc;
  1197. char *sname;
  1198. integer *iorder;
  1199. char *transa, *transb;
  1200. integer *m, *n, *k;
  1201. doublecomplex *alpha;
  1202. integer *lda, *ldb;
  1203. doublecomplex *beta;
  1204. integer *ldc;
  1205. ftnlen sname_len;
  1206. ftnlen transa_len;
  1207. ftnlen transb_len;
  1208. {
  1209. /* Local variables */
  1210. static char crc[14], cta[14], ctb[14];
  1211. if (*(unsigned char *)transa == 'N') {
  1212. s_copy(cta, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  1213. } else if (*(unsigned char *)transa == 'T') {
  1214. s_copy(cta, " CblasTrans", (ftnlen)14, (ftnlen)14);
  1215. } else {
  1216. s_copy(cta, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  1217. }
  1218. if (*(unsigned char *)transb == 'N') {
  1219. s_copy(ctb, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  1220. } else if (*(unsigned char *)transb == 'T') {
  1221. s_copy(ctb, " CblasTrans", (ftnlen)14, (ftnlen)14);
  1222. } else {
  1223. s_copy(ctb, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  1224. }
  1225. if (*iorder == 1) {
  1226. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  1227. } else {
  1228. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  1229. }
  1230. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cta,ctb);
  1231. printf("%d %d %d (%4.1lf,%4.1lf) , A, %d, B, %d, (%4.1lf,%4.1lf) , C, %d.\n",*m,*n,*k,alpha->r,alpha->i,*lda,*ldb,beta->r,beta->i,*ldc);
  1232. return 0;
  1233. } /* zprcn1_ */
  1234. /* Subroutine */ int zchk2_(sname, eps, thresh, nout, ntra, trace, rewi,
  1235. fatal, nidim, idim, nalf, alf, nbet, bet, nmax, a, aa, as, b, bb, bs,
  1236. c__, cc, cs, ct, g, iorder, sname_len)
  1237. char *sname;
  1238. doublereal *eps, *thresh;
  1239. integer *nout, *ntra;
  1240. logical *trace, *rewi, *fatal;
  1241. integer *nidim, *idim, *nalf;
  1242. doublecomplex *alf;
  1243. integer *nbet;
  1244. doublecomplex *bet;
  1245. integer *nmax;
  1246. doublecomplex *a, *aa, *as, *b, *bb, *bs, *c__, *cc, *cs, *ct;
  1247. doublereal *g;
  1248. integer *iorder;
  1249. ftnlen sname_len;
  1250. {
  1251. /* Initialized data */
  1252. static char ichs[2+1] = "LR";
  1253. static char ichu[2+1] = "UL";
  1254. /* System generated locals */
  1255. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  1256. i__3, i__4, i__5, i__6, i__7;
  1257. /* Local variables */
  1258. static doublecomplex beta;
  1259. static integer ldas, ldbs, ldcs;
  1260. static logical same;
  1261. static char side[1];
  1262. static logical isconj, left, null;
  1263. static char uplo[1];
  1264. static integer i__, m, n;
  1265. static doublecomplex alpha;
  1266. static logical isame[13];
  1267. static char sides[1];
  1268. extern /* Subroutine */ int zmake_();
  1269. static integer nargs;
  1270. extern /* Subroutine */ int zmmch_();
  1271. static logical reset;
  1272. static char uplos[1];
  1273. static integer ia, ib;
  1274. extern /* Subroutine */ int zprcn2_();
  1275. static integer na, nc, im, in, ms, ns;
  1276. extern /* Subroutine */ int czhemm_();
  1277. static doublereal errmax;
  1278. extern logical lzeres_();
  1279. extern /* Subroutine */ int czsymm_();
  1280. static integer laa, lbb, lda, lcc, ldb, ldc, ics;
  1281. static doublecomplex als, bls;
  1282. static integer icu;
  1283. static doublereal err;
  1284. extern logical lze_();
  1285. /* Tests ZHEMM and ZSYMM. */
  1286. /* Auxiliary routine for test program for Level 3 Blas. */
  1287. /* -- Written on 8-February-1989. */
  1288. /* Jack Dongarra, Argonne National Laboratory. */
  1289. /* Iain Duff, AERE Harwell. */
  1290. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  1291. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  1292. /* .. Parameters .. */
  1293. /* .. Scalar Arguments .. */
  1294. /* .. Array Arguments .. */
  1295. /* .. Local Scalars .. */
  1296. /* .. Local Arrays .. */
  1297. /* .. External Functions .. */
  1298. /* .. External Subroutines .. */
  1299. /* .. Intrinsic Functions .. */
  1300. /* .. Scalars in Common .. */
  1301. /* .. Common blocks .. */
  1302. /* .. Data statements .. */
  1303. /* Parameter adjustments */
  1304. --idim;
  1305. --alf;
  1306. --bet;
  1307. --g;
  1308. --ct;
  1309. --cs;
  1310. --cc;
  1311. c_dim1 = *nmax;
  1312. c_offset = 1 + c_dim1 * 1;
  1313. c__ -= c_offset;
  1314. --bs;
  1315. --bb;
  1316. b_dim1 = *nmax;
  1317. b_offset = 1 + b_dim1 * 1;
  1318. b -= b_offset;
  1319. --as;
  1320. --aa;
  1321. a_dim1 = *nmax;
  1322. a_offset = 1 + a_dim1 * 1;
  1323. a -= a_offset;
  1324. /* Function Body */
  1325. /* .. Executable Statements .. */
  1326. isconj = s_cmp(sname + 7, "he", (ftnlen)2, (ftnlen)2) == 0;
  1327. nargs = 12;
  1328. nc = 0;
  1329. reset = TRUE_;
  1330. errmax = 0.;
  1331. i__1 = *nidim;
  1332. for (im = 1; im <= i__1; ++im) {
  1333. m = idim[im];
  1334. i__2 = *nidim;
  1335. for (in = 1; in <= i__2; ++in) {
  1336. n = idim[in];
  1337. /* Set LDC to 1 more than minimum value if room. */
  1338. ldc = m;
  1339. if (ldc < *nmax) {
  1340. ++ldc;
  1341. }
  1342. /* Skip tests if not enough room. */
  1343. if (ldc > *nmax) {
  1344. goto L90;
  1345. }
  1346. lcc = ldc * n;
  1347. null = n <= 0 || m <= 0;
  1348. /* Set LDB to 1 more than minimum value if room. */
  1349. ldb = m;
  1350. if (ldb < *nmax) {
  1351. ++ldb;
  1352. }
  1353. /* Skip tests if not enough room. */
  1354. if (ldb > *nmax) {
  1355. goto L90;
  1356. }
  1357. lbb = ldb * n;
  1358. /* Generate the matrix B. */
  1359. zmake_("ge", " ", " ", &m, &n, &b[b_offset], nmax, &bb[1], &ldb, &
  1360. reset, &c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)1);
  1361. for (ics = 1; ics <= 2; ++ics) {
  1362. *(unsigned char *)side = *(unsigned char *)&ichs[ics - 1];
  1363. left = *(unsigned char *)side == 'L';
  1364. if (left) {
  1365. na = m;
  1366. } else {
  1367. na = n;
  1368. }
  1369. /* Set LDA to 1 more than minimum value if room. */
  1370. lda = na;
  1371. if (lda < *nmax) {
  1372. ++lda;
  1373. }
  1374. /* Skip tests if not enough room. */
  1375. if (lda > *nmax) {
  1376. goto L80;
  1377. }
  1378. laa = lda * na;
  1379. for (icu = 1; icu <= 2; ++icu) {
  1380. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  1381. /* Generate the hermitian or symmetric matrix A. */
  1382. zmake_(sname + 7, uplo, " ", &na, &na, &a[a_offset], nmax,
  1383. &aa[1], &lda, &reset, &c_b1, (ftnlen)2, (ftnlen)
  1384. 1, (ftnlen)1);
  1385. i__3 = *nalf;
  1386. for (ia = 1; ia <= i__3; ++ia) {
  1387. i__4 = ia;
  1388. alpha.r = alf[i__4].r, alpha.i = alf[i__4].i;
  1389. i__4 = *nbet;
  1390. for (ib = 1; ib <= i__4; ++ib) {
  1391. i__5 = ib;
  1392. beta.r = bet[i__5].r, beta.i = bet[i__5].i;
  1393. /* Generate the matrix C. */
  1394. zmake_("ge", " ", " ", &m, &n, &c__[c_offset],
  1395. nmax, &cc[1], &ldc, &reset, &c_b1, (
  1396. ftnlen)2, (ftnlen)1, (ftnlen)1);
  1397. ++nc;
  1398. /* Save every datum before calling the */
  1399. /* subroutine. */
  1400. *(unsigned char *)sides = *(unsigned char *)side;
  1401. *(unsigned char *)uplos = *(unsigned char *)uplo;
  1402. ms = m;
  1403. ns = n;
  1404. als.r = alpha.r, als.i = alpha.i;
  1405. i__5 = laa;
  1406. for (i__ = 1; i__ <= i__5; ++i__) {
  1407. i__6 = i__;
  1408. i__7 = i__;
  1409. as[i__6].r = aa[i__7].r, as[i__6].i = aa[i__7]
  1410. .i;
  1411. /* L10: */
  1412. }
  1413. ldas = lda;
  1414. i__5 = lbb;
  1415. for (i__ = 1; i__ <= i__5; ++i__) {
  1416. i__6 = i__;
  1417. i__7 = i__;
  1418. bs[i__6].r = bb[i__7].r, bs[i__6].i = bb[i__7]
  1419. .i;
  1420. /* L20: */
  1421. }
  1422. ldbs = ldb;
  1423. bls.r = beta.r, bls.i = beta.i;
  1424. i__5 = lcc;
  1425. for (i__ = 1; i__ <= i__5; ++i__) {
  1426. i__6 = i__;
  1427. i__7 = i__;
  1428. cs[i__6].r = cc[i__7].r, cs[i__6].i = cc[i__7]
  1429. .i;
  1430. /* L30: */
  1431. }
  1432. ldcs = ldc;
  1433. /* Call the subroutine. */
  1434. if (*trace) {
  1435. zprcn2_(ntra, &nc, sname, iorder, side, uplo,
  1436. &m, &n, &alpha, &lda, &ldb, &beta, &
  1437. ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1)
  1438. ;
  1439. }
  1440. if (*rewi) {
  1441. /* al__1.aerr = 0;
  1442. al__1.aunit = *ntra;
  1443. f_rew(&al__1);*/
  1444. }
  1445. if (isconj) {
  1446. czhemm_(iorder, side, uplo, &m, &n, &alpha, &
  1447. aa[1], &lda, &bb[1], &ldb, &beta, &cc[
  1448. 1], &ldc, (ftnlen)1, (ftnlen)1);
  1449. } else {
  1450. czsymm_(iorder, side, uplo, &m, &n, &alpha, &
  1451. aa[1], &lda, &bb[1], &ldb, &beta, &cc[
  1452. 1], &ldc, (ftnlen)1, (ftnlen)1);
  1453. }
  1454. /* Check if error-exit was taken incorrectly. */
  1455. if (! infoc_1.ok) {
  1456. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  1457. *fatal = TRUE_;
  1458. goto L110;
  1459. }
  1460. /* See what data changed inside subroutines. */
  1461. isame[0] = *(unsigned char *)sides == *(unsigned
  1462. char *)side;
  1463. isame[1] = *(unsigned char *)uplos == *(unsigned
  1464. char *)uplo;
  1465. isame[2] = ms == m;
  1466. isame[3] = ns == n;
  1467. isame[4] = als.r == alpha.r && als.i == alpha.i;
  1468. isame[5] = lze_(&as[1], &aa[1], &laa);
  1469. isame[6] = ldas == lda;
  1470. isame[7] = lze_(&bs[1], &bb[1], &lbb);
  1471. isame[8] = ldbs == ldb;
  1472. isame[9] = bls.r == beta.r && bls.i == beta.i;
  1473. if (null) {
  1474. isame[10] = lze_(&cs[1], &cc[1], &lcc);
  1475. } else {
  1476. isame[10] = lzeres_("ge", " ", &m, &n, &cs[1],
  1477. &cc[1], &ldc, (ftnlen)2, (ftnlen)1);
  1478. }
  1479. isame[11] = ldcs == ldc;
  1480. /* If data was incorrectly changed, report and */
  1481. /* return. */
  1482. same = TRUE_;
  1483. i__5 = nargs;
  1484. for (i__ = 1; i__ <= i__5; ++i__) {
  1485. same = same && isame[i__ - 1];
  1486. if (! isame[i__ - 1]) {
  1487. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  1488. }
  1489. /* L40: */
  1490. }
  1491. if (! same) {
  1492. *fatal = TRUE_;
  1493. goto L110;
  1494. }
  1495. if (! null) {
  1496. /* Check the result. */
  1497. if (left) {
  1498. zmmch_("N", "N", &m, &n, &m, &alpha, &a[
  1499. a_offset], nmax, &b[b_offset],
  1500. nmax, &beta, &c__[c_offset], nmax,
  1501. &ct[1], &g[1], &cc[1], &ldc, eps,
  1502. &err, fatal, nout, &c_true, (
  1503. ftnlen)1, (ftnlen)1);
  1504. } else {
  1505. zmmch_("N", "N", &m, &n, &n, &alpha, &b[
  1506. b_offset], nmax, &a[a_offset],
  1507. nmax, &beta, &c__[c_offset], nmax,
  1508. &ct[1], &g[1], &cc[1], &ldc, eps,
  1509. &err, fatal, nout, &c_true, (
  1510. ftnlen)1, (ftnlen)1);
  1511. }
  1512. errmax = f2cmax(errmax,err);
  1513. /* If got really bad answer, report and */
  1514. /* return. */
  1515. if (*fatal) {
  1516. goto L110;
  1517. }
  1518. }
  1519. /* L50: */
  1520. }
  1521. /* L60: */
  1522. }
  1523. /* L70: */
  1524. }
  1525. L80:
  1526. ;
  1527. }
  1528. L90:
  1529. ;
  1530. }
  1531. /* L100: */
  1532. }
  1533. /* Report result. */
  1534. if (errmax < *thresh) {
  1535. if (*iorder == 0) {
  1536. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1537. }
  1538. if (*iorder == 1) {
  1539. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1540. }
  1541. } else {
  1542. if (*iorder == 0) {
  1543. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1544. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1545. }
  1546. if (*iorder == 1) {
  1547. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1548. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1549. }
  1550. }
  1551. goto L120;
  1552. L110:
  1553. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  1554. zprcn2_(nout, &nc, sname, iorder, side, uplo, &m, &n, &alpha, &lda, &ldb,
  1555. &beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  1556. L120:
  1557. return 0;
  1558. /* 9995 FORMAT(1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  1559. /* $ '(', F4.1, ',', F4.1, '), A,', I3, ', B,', I3, ',(', F4.1, */
  1560. /* $ ',', F4.1, '), C,', I3, ') .' ) */
  1561. /* End of ZCHK2. */
  1562. } /* zchk2_ */
  1563. /* Subroutine */ int zprcn2_(nout, nc, sname, iorder, side, uplo, m, n, alpha,
  1564. lda, ldb, beta, ldc, sname_len, side_len, uplo_len)
  1565. integer *nout, *nc;
  1566. char *sname;
  1567. integer *iorder;
  1568. char *side, *uplo;
  1569. integer *m, *n;
  1570. doublecomplex *alpha;
  1571. integer *lda, *ldb;
  1572. doublecomplex *beta;
  1573. integer *ldc;
  1574. ftnlen sname_len;
  1575. ftnlen side_len;
  1576. ftnlen uplo_len;
  1577. {
  1578. /* Local variables */
  1579. static char cs[14], cu[14], crc[14];
  1580. if (*(unsigned char *)side == 'L') {
  1581. s_copy(cs, " CblasLeft", (ftnlen)14, (ftnlen)14);
  1582. } else {
  1583. s_copy(cs, " CblasRight", (ftnlen)14, (ftnlen)14);
  1584. }
  1585. if (*(unsigned char *)uplo == 'U') {
  1586. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  1587. } else {
  1588. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  1589. }
  1590. if (*iorder == 1) {
  1591. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  1592. } else {
  1593. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  1594. }
  1595. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cs,cu);
  1596. printf("%d %d (%4.1lf,%4.1lf) , A, %d, B, %d, (%4.1lf,%4.1lf) , C, %d.\n",*m,*n,alpha->r,alpha->i,*lda,*ldb,beta->r,beta->i,*ldc);
  1597. return 0;
  1598. } /* zprcn2_ */
  1599. /* Subroutine */ int zchk3_(sname, eps, thresh, nout, ntra, trace, rewi,
  1600. fatal, nidim, idim, nalf, alf, nmax, a, aa, as, b, bb, bs, ct, g, c__,
  1601. iorder, sname_len)
  1602. char *sname;
  1603. doublereal *eps, *thresh;
  1604. integer *nout, *ntra;
  1605. logical *trace, *rewi, *fatal;
  1606. integer *nidim, *idim, *nalf;
  1607. doublecomplex *alf;
  1608. integer *nmax;
  1609. doublecomplex *a, *aa, *as, *b, *bb, *bs, *ct;
  1610. doublereal *g;
  1611. doublecomplex *c__;
  1612. integer *iorder;
  1613. ftnlen sname_len;
  1614. {
  1615. /* Initialized data */
  1616. static char ichu[2+1] = "UL";
  1617. static char icht[3+1] = "NTC";
  1618. static char ichd[2+1] = "UN";
  1619. static char ichs[2+1] = "LR";
  1620. /* System generated locals */
  1621. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  1622. i__3, i__4, i__5, i__6, i__7;
  1623. doublecomplex z__1;
  1624. /* Local variables */
  1625. static char diag[1];
  1626. static integer ldas, ldbs;
  1627. static logical same;
  1628. static char side[1];
  1629. static logical left, null;
  1630. static char uplo[1];
  1631. static integer i__, j, m, n;
  1632. static doublecomplex alpha;
  1633. static char diags[1];
  1634. static logical isame[13];
  1635. static char sides[1];
  1636. extern /* Subroutine */ int zmake_();
  1637. static integer nargs;
  1638. extern /* Subroutine */ int zmmch_();
  1639. static logical reset;
  1640. static char uplos[1];
  1641. static integer ia, na;
  1642. extern /* Subroutine */ int zprcn3_();
  1643. static integer nc, im, in, ms, ns;
  1644. static char tranas[1], transa[1];
  1645. static doublereal errmax;
  1646. extern logical lzeres_();
  1647. extern /* Subroutine */ int cztrmm_(), cztrsm_();
  1648. static integer laa, icd, lbb, lda, ldb, ics;
  1649. static doublecomplex als;
  1650. static integer ict, icu;
  1651. static doublereal err;
  1652. extern logical lze_();
  1653. /* Tests ZTRMM and ZTRSM. */
  1654. /* Auxiliary routine for test program for Level 3 Blas. */
  1655. /* -- Written on 8-February-1989. */
  1656. /* Jack Dongarra, Argonne National Laboratory. */
  1657. /* Iain Duff, AERE Harwell. */
  1658. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  1659. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  1660. /* .. Parameters .. */
  1661. /* .. Scalar Arguments .. */
  1662. /* .. Array Arguments .. */
  1663. /* .. Local Scalars .. */
  1664. /* .. Local Arrays .. */
  1665. /* .. External Functions .. */
  1666. /* .. External Subroutines .. */
  1667. /* .. Intrinsic Functions .. */
  1668. /* .. Scalars in Common .. */
  1669. /* .. Common blocks .. */
  1670. /* .. Data statements .. */
  1671. /* Parameter adjustments */
  1672. --idim;
  1673. --alf;
  1674. c_dim1 = *nmax;
  1675. c_offset = 1 + c_dim1 * 1;
  1676. c__ -= c_offset;
  1677. --g;
  1678. --ct;
  1679. --bs;
  1680. --bb;
  1681. b_dim1 = *nmax;
  1682. b_offset = 1 + b_dim1 * 1;
  1683. b -= b_offset;
  1684. --as;
  1685. --aa;
  1686. a_dim1 = *nmax;
  1687. a_offset = 1 + a_dim1 * 1;
  1688. a -= a_offset;
  1689. /* Function Body */
  1690. /* .. Executable Statements .. */
  1691. nargs = 11;
  1692. nc = 0;
  1693. reset = TRUE_;
  1694. errmax = 0.;
  1695. /* Set up zero matrix for ZMMCH. */
  1696. i__1 = *nmax;
  1697. for (j = 1; j <= i__1; ++j) {
  1698. i__2 = *nmax;
  1699. for (i__ = 1; i__ <= i__2; ++i__) {
  1700. i__3 = i__ + j * c_dim1;
  1701. c__[i__3].r = 0., c__[i__3].i = 0.;
  1702. /* L10: */
  1703. }
  1704. /* L20: */
  1705. }
  1706. i__1 = *nidim;
  1707. for (im = 1; im <= i__1; ++im) {
  1708. m = idim[im];
  1709. i__2 = *nidim;
  1710. for (in = 1; in <= i__2; ++in) {
  1711. n = idim[in];
  1712. /* Set LDB to 1 more than minimum value if room. */
  1713. ldb = m;
  1714. if (ldb < *nmax) {
  1715. ++ldb;
  1716. }
  1717. /* Skip tests if not enough room. */
  1718. if (ldb > *nmax) {
  1719. goto L130;
  1720. }
  1721. lbb = ldb * n;
  1722. null = m <= 0 || n <= 0;
  1723. for (ics = 1; ics <= 2; ++ics) {
  1724. *(unsigned char *)side = *(unsigned char *)&ichs[ics - 1];
  1725. left = *(unsigned char *)side == 'L';
  1726. if (left) {
  1727. na = m;
  1728. } else {
  1729. na = n;
  1730. }
  1731. /* Set LDA to 1 more than minimum value if room. */
  1732. lda = na;
  1733. if (lda < *nmax) {
  1734. ++lda;
  1735. }
  1736. /* Skip tests if not enough room. */
  1737. if (lda > *nmax) {
  1738. goto L130;
  1739. }
  1740. laa = lda * na;
  1741. for (icu = 1; icu <= 2; ++icu) {
  1742. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  1743. for (ict = 1; ict <= 3; ++ict) {
  1744. *(unsigned char *)transa = *(unsigned char *)&icht[
  1745. ict - 1];
  1746. for (icd = 1; icd <= 2; ++icd) {
  1747. *(unsigned char *)diag = *(unsigned char *)&ichd[
  1748. icd - 1];
  1749. i__3 = *nalf;
  1750. for (ia = 1; ia <= i__3; ++ia) {
  1751. i__4 = ia;
  1752. alpha.r = alf[i__4].r, alpha.i = alf[i__4].i;
  1753. /* Generate the matrix A. */
  1754. zmake_("tr", uplo, diag, &na, &na, &a[
  1755. a_offset], nmax, &aa[1], &lda, &reset,
  1756. &c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)
  1757. 1);
  1758. /* Generate the matrix B. */
  1759. zmake_("ge", " ", " ", &m, &n, &b[b_offset],
  1760. nmax, &bb[1], &ldb, &reset, &c_b1, (
  1761. ftnlen)2, (ftnlen)1, (ftnlen)1);
  1762. ++nc;
  1763. /* Save every datum before calling the */
  1764. /* subroutine. */
  1765. *(unsigned char *)sides = *(unsigned char *)
  1766. side;
  1767. *(unsigned char *)uplos = *(unsigned char *)
  1768. uplo;
  1769. *(unsigned char *)tranas = *(unsigned char *)
  1770. transa;
  1771. *(unsigned char *)diags = *(unsigned char *)
  1772. diag;
  1773. ms = m;
  1774. ns = n;
  1775. als.r = alpha.r, als.i = alpha.i;
  1776. i__4 = laa;
  1777. for (i__ = 1; i__ <= i__4; ++i__) {
  1778. i__5 = i__;
  1779. i__6 = i__;
  1780. as[i__5].r = aa[i__6].r, as[i__5].i = aa[
  1781. i__6].i;
  1782. /* L30: */
  1783. }
  1784. ldas = lda;
  1785. i__4 = lbb;
  1786. for (i__ = 1; i__ <= i__4; ++i__) {
  1787. i__5 = i__;
  1788. i__6 = i__;
  1789. bs[i__5].r = bb[i__6].r, bs[i__5].i = bb[
  1790. i__6].i;
  1791. /* L40: */
  1792. }
  1793. ldbs = ldb;
  1794. /* Call the subroutine. */
  1795. if (s_cmp(sname + 9, "mm", (ftnlen)2, (ftnlen)
  1796. 2) == 0) {
  1797. if (*trace) {
  1798. zprcn3_(ntra, &nc, sname, iorder,
  1799. side, uplo, transa, diag, &m,
  1800. &n, &alpha, &lda, &ldb, (
  1801. ftnlen)12, (ftnlen)1, (ftnlen)
  1802. 1, (ftnlen)1, (ftnlen)1);
  1803. }
  1804. if (*rewi) {
  1805. /* al__1.aerr = 0;
  1806. al__1.aunit = *ntra;
  1807. f_rew(&al__1);*/
  1808. }
  1809. cztrmm_(iorder, side, uplo, transa, diag,
  1810. &m, &n, &alpha, &aa[1], &lda, &bb[
  1811. 1], &ldb, (ftnlen)1, (ftnlen)1, (
  1812. ftnlen)1, (ftnlen)1);
  1813. } else if (s_cmp(sname + 9, "sm", (ftnlen)2, (
  1814. ftnlen)2) == 0) {
  1815. if (*trace) {
  1816. zprcn3_(ntra, &nc, sname, iorder,
  1817. side, uplo, transa, diag, &m,
  1818. &n, &alpha, &lda, &ldb, (
  1819. ftnlen)12, (ftnlen)1, (ftnlen)
  1820. 1, (ftnlen)1, (ftnlen)1);
  1821. }
  1822. if (*rewi) {
  1823. /* al__1.aerr = 0;
  1824. al__1.aunit = *ntra;
  1825. f_rew(&al__1);*/
  1826. }
  1827. cztrsm_(iorder, side, uplo, transa, diag,
  1828. &m, &n, &alpha, &aa[1], &lda, &bb[
  1829. 1], &ldb, (ftnlen)1, (ftnlen)1, (
  1830. ftnlen)1, (ftnlen)1);
  1831. }
  1832. /* Check if error-exit was taken incorrectly. */
  1833. if (! infoc_1.ok) {
  1834. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  1835. *fatal = TRUE_;
  1836. goto L150;
  1837. }
  1838. /* See what data changed inside subroutines. */
  1839. isame[0] = *(unsigned char *)sides == *(
  1840. unsigned char *)side;
  1841. isame[1] = *(unsigned char *)uplos == *(
  1842. unsigned char *)uplo;
  1843. isame[2] = *(unsigned char *)tranas == *(
  1844. unsigned char *)transa;
  1845. isame[3] = *(unsigned char *)diags == *(
  1846. unsigned char *)diag;
  1847. isame[4] = ms == m;
  1848. isame[5] = ns == n;
  1849. isame[6] = als.r == alpha.r && als.i ==
  1850. alpha.i;
  1851. isame[7] = lze_(&as[1], &aa[1], &laa);
  1852. isame[8] = ldas == lda;
  1853. if (null) {
  1854. isame[9] = lze_(&bs[1], &bb[1], &lbb);
  1855. } else {
  1856. isame[9] = lzeres_("ge", " ", &m, &n, &bs[
  1857. 1], &bb[1], &ldb, (ftnlen)2, (
  1858. ftnlen)1);
  1859. }
  1860. isame[10] = ldbs == ldb;
  1861. /* If data was incorrectly changed, report and */
  1862. /* return. */
  1863. same = TRUE_;
  1864. i__4 = nargs;
  1865. for (i__ = 1; i__ <= i__4; ++i__) {
  1866. same = same && isame[i__ - 1];
  1867. if (! isame[i__ - 1]) {
  1868. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  1869. }
  1870. /* L50: */
  1871. }
  1872. if (! same) {
  1873. *fatal = TRUE_;
  1874. goto L150;
  1875. }
  1876. if (! null) {
  1877. if (s_cmp(sname + 9, "mm", (ftnlen)2, (
  1878. ftnlen)2) == 0) {
  1879. /* Check the result. */
  1880. if (left) {
  1881. zmmch_(transa, "N", &m, &n, &m, &
  1882. alpha, &a[a_offset], nmax,
  1883. &b[b_offset], nmax, &
  1884. c_b1, &c__[c_offset],
  1885. nmax, &ct[1], &g[1], &bb[
  1886. 1], &ldb, eps, &err,
  1887. fatal, nout, &c_true, (
  1888. ftnlen)1, (ftnlen)1);
  1889. } else {
  1890. zmmch_("N", transa, &m, &n, &n, &
  1891. alpha, &b[b_offset], nmax,
  1892. &a[a_offset], nmax, &
  1893. c_b1, &c__[c_offset],
  1894. nmax, &ct[1], &g[1], &bb[
  1895. 1], &ldb, eps, &err,
  1896. fatal, nout, &c_true, (
  1897. ftnlen)1, (ftnlen)1);
  1898. }
  1899. } else if (s_cmp(sname + 9, "sm", (ftnlen)
  1900. 2, (ftnlen)2) == 0) {
  1901. /* Compute approximation to original */
  1902. /* matrix. */
  1903. i__4 = n;
  1904. for (j = 1; j <= i__4; ++j) {
  1905. i__5 = m;
  1906. for (i__ = 1; i__ <= i__5; ++i__)
  1907. {
  1908. i__6 = i__ + j * c_dim1;
  1909. i__7 = i__ + (j - 1) * ldb;
  1910. c__[i__6].r = bb[i__7].r, c__[i__6].i = bb[i__7].i;
  1911. i__6 = i__ + (j - 1) * ldb;
  1912. i__7 = i__ + j * b_dim1;
  1913. z__1.r = alpha.r * b[i__7].r - alpha.i * b[i__7].i,
  1914. z__1.i = alpha.r * b[i__7].i + alpha.i * b[
  1915. i__7].r;
  1916. bb[i__6].r = z__1.r, bb[i__6].i = z__1.i;
  1917. /* L60: */
  1918. }
  1919. /* L70: */
  1920. }
  1921. if (left) {
  1922. zmmch_(transa, "N", &m, &n, &m, &
  1923. c_b2, &a[a_offset], nmax,
  1924. &c__[c_offset], nmax, &
  1925. c_b1, &b[b_offset], nmax,
  1926. &ct[1], &g[1], &bb[1], &
  1927. ldb, eps, &err, fatal,
  1928. nout, &c_false, (ftnlen)1,
  1929. (ftnlen)1);
  1930. } else {
  1931. zmmch_("N", transa, &m, &n, &n, &
  1932. c_b2, &c__[c_offset],
  1933. nmax, &a[a_offset], nmax,
  1934. &c_b1, &b[b_offset], nmax,
  1935. &ct[1], &g[1], &bb[1], &
  1936. ldb, eps, &err, fatal,
  1937. nout, &c_false, (ftnlen)1,
  1938. (ftnlen)1);
  1939. }
  1940. }
  1941. errmax = f2cmax(errmax,err);
  1942. /* If got really bad answer, report and */
  1943. /* return. */
  1944. if (*fatal) {
  1945. goto L150;
  1946. }
  1947. }
  1948. /* L80: */
  1949. }
  1950. /* L90: */
  1951. }
  1952. /* L100: */
  1953. }
  1954. /* L110: */
  1955. }
  1956. /* L120: */
  1957. }
  1958. L130:
  1959. ;
  1960. }
  1961. /* L140: */
  1962. }
  1963. /* Report result. */
  1964. if (errmax < *thresh) {
  1965. if (*iorder == 0) {
  1966. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1967. }
  1968. if (*iorder == 1) {
  1969. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  1970. }
  1971. } else {
  1972. if (*iorder == 0) {
  1973. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1974. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1975. }
  1976. if (*iorder == 1) {
  1977. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  1978. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  1979. }
  1980. }
  1981. goto L160;
  1982. L150:
  1983. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  1984. if (*trace) {
  1985. zprcn3_(ntra, &nc, sname, iorder, side, uplo, transa, diag, &m, &n, &
  1986. alpha, &lda, &ldb, (ftnlen)12, (ftnlen)1, (ftnlen)1, (ftnlen)
  1987. 1, (ftnlen)1);
  1988. }
  1989. L160:
  1990. return 0;
  1991. /* 9995 FORMAT(1X, I6, ': ', A12,'(', 4( '''', A1, ''',' ), 2( I3, ',' ), */
  1992. /* $ '(', F4.1, ',', F4.1, '), A,', I3, ', B,', I3, ') ', */
  1993. /* $ ' .' ) */
  1994. /* End of ZCHK3. */
  1995. } /* zchk3_ */
  1996. /* Subroutine */ int zprcn3_(nout, nc, sname, iorder, side, uplo, transa,
  1997. diag, m, n, alpha, lda, ldb, sname_len, side_len, uplo_len,
  1998. transa_len, diag_len)
  1999. integer *nout, *nc;
  2000. char *sname;
  2001. integer *iorder;
  2002. char *side, *uplo, *transa, *diag;
  2003. integer *m, *n;
  2004. doublecomplex *alpha;
  2005. integer *lda, *ldb;
  2006. ftnlen sname_len;
  2007. ftnlen side_len;
  2008. ftnlen uplo_len;
  2009. ftnlen transa_len;
  2010. ftnlen diag_len;
  2011. {
  2012. /* Local variables */
  2013. static char ca[14], cd[14], cs[14], cu[14], crc[14];
  2014. if (*(unsigned char *)side == 'L') {
  2015. s_copy(cs, " CblasLeft", (ftnlen)14, (ftnlen)14);
  2016. } else {
  2017. s_copy(cs, " CblasRight", (ftnlen)14, (ftnlen)14);
  2018. }
  2019. if (*(unsigned char *)uplo == 'U') {
  2020. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  2021. } else {
  2022. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  2023. }
  2024. if (*(unsigned char *)transa == 'N') {
  2025. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  2026. } else if (*(unsigned char *)transa == 'T') {
  2027. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  2028. } else {
  2029. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  2030. }
  2031. if (*(unsigned char *)diag == 'N') {
  2032. s_copy(cd, " CblasNonUnit", (ftnlen)14, (ftnlen)14);
  2033. } else {
  2034. s_copy(cd, " CblasUnit", (ftnlen)14, (ftnlen)14);
  2035. }
  2036. if (*iorder == 1) {
  2037. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  2038. } else {
  2039. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  2040. }
  2041. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cs,cu);
  2042. printf(" %s %s %d %d (%4.1lf,%4.1lf) A %d B %d\n",ca,cd,*m,*n,alpha->r,alpha->i,*lda,*ldb);
  2043. return 0;
  2044. } /* zprcn3_ */
  2045. /* Subroutine */ int zchk4_(sname, eps, thresh, nout, ntra, trace, rewi,
  2046. fatal, nidim, idim, nalf, alf, nbet, bet, nmax, a, aa, as, b, bb, bs,
  2047. c__, cc, cs, ct, g, iorder, sname_len)
  2048. char *sname;
  2049. doublereal *eps, *thresh;
  2050. integer *nout, *ntra;
  2051. logical *trace, *rewi, *fatal;
  2052. integer *nidim, *idim, *nalf;
  2053. doublecomplex *alf;
  2054. integer *nbet;
  2055. doublecomplex *bet;
  2056. integer *nmax;
  2057. doublecomplex *a, *aa, *as, *b, *bb, *bs, *c__, *cc, *cs, *ct;
  2058. doublereal *g;
  2059. integer *iorder;
  2060. ftnlen sname_len;
  2061. {
  2062. /* Initialized data */
  2063. static char icht[2+1] = "NC";
  2064. static char ichu[2+1] = "UL";
  2065. /* System generated locals */
  2066. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
  2067. i__3, i__4, i__5, i__6, i__7;
  2068. doublecomplex z__1;
  2069. /* Local variables */
  2070. static doublecomplex beta;
  2071. static integer ldas, ldcs;
  2072. static logical same, isconj;
  2073. static doublecomplex bets;
  2074. static doublereal rals;
  2075. static logical tran, null;
  2076. static char uplo[1];
  2077. static integer i__, j, k, n;
  2078. static doublecomplex alpha;
  2079. static doublereal rbeta;
  2080. static logical isame[13];
  2081. extern /* Subroutine */ int zmake_();
  2082. static integer nargs;
  2083. extern /* Subroutine */ int zmmch_();
  2084. static doublereal rbets;
  2085. static logical reset;
  2086. static char trans[1];
  2087. static logical upper;
  2088. static char uplos[1];
  2089. static integer ia, ib, jc, ma, na;
  2090. extern /* Subroutine */ int zprcn4_();
  2091. static integer nc;
  2092. extern /* Subroutine */ int zprcn6_();
  2093. static integer ik, in, jj, lj, ks, ns;
  2094. static doublereal ralpha;
  2095. extern /* Subroutine */ int czherk_();
  2096. static doublereal errmax;
  2097. extern logical lzeres_();
  2098. static char transs[1], transt[1];
  2099. extern /* Subroutine */ int czsyrk_();
  2100. static integer laa, lda, lcc, ldc;
  2101. static doublecomplex als;
  2102. static integer ict, icu;
  2103. static doublereal err;
  2104. extern logical lze_();
  2105. /* Tests ZHERK and ZSYRK. */
  2106. /* Auxiliary routine for test program for Level 3 Blas. */
  2107. /* -- Written on 8-February-1989. */
  2108. /* Jack Dongarra, Argonne National Laboratory. */
  2109. /* Iain Duff, AERE Harwell. */
  2110. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2111. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2112. /* .. Parameters .. */
  2113. /* .. Scalar Arguments .. */
  2114. /* .. Array Arguments .. */
  2115. /* .. Local Scalars .. */
  2116. /* .. Local Arrays .. */
  2117. /* .. External Functions .. */
  2118. /* .. External Subroutines .. */
  2119. /* .. Intrinsic Functions .. */
  2120. /* .. Scalars in Common .. */
  2121. /* .. Common blocks .. */
  2122. /* .. Data statements .. */
  2123. /* Parameter adjustments */
  2124. --idim;
  2125. --alf;
  2126. --bet;
  2127. --g;
  2128. --ct;
  2129. --cs;
  2130. --cc;
  2131. c_dim1 = *nmax;
  2132. c_offset = 1 + c_dim1 * 1;
  2133. c__ -= c_offset;
  2134. --bs;
  2135. --bb;
  2136. b_dim1 = *nmax;
  2137. b_offset = 1 + b_dim1 * 1;
  2138. b -= b_offset;
  2139. --as;
  2140. --aa;
  2141. a_dim1 = *nmax;
  2142. a_offset = 1 + a_dim1 * 1;
  2143. a -= a_offset;
  2144. /* Function Body */
  2145. /* .. Executable Statements .. */
  2146. isconj = s_cmp(sname + 7, "he", (ftnlen)2, (ftnlen)2) == 0;
  2147. nargs = 10;
  2148. nc = 0;
  2149. reset = TRUE_;
  2150. errmax = 0.;
  2151. rals = 1.;
  2152. rbets = 1.;
  2153. i__1 = *nidim;
  2154. for (in = 1; in <= i__1; ++in) {
  2155. n = idim[in];
  2156. /* Set LDC to 1 more than minimum value if room. */
  2157. ldc = n;
  2158. if (ldc < *nmax) {
  2159. ++ldc;
  2160. }
  2161. /* Skip tests if not enough room. */
  2162. if (ldc > *nmax) {
  2163. goto L100;
  2164. }
  2165. lcc = ldc * n;
  2166. i__2 = *nidim;
  2167. for (ik = 1; ik <= i__2; ++ik) {
  2168. k = idim[ik];
  2169. for (ict = 1; ict <= 2; ++ict) {
  2170. *(unsigned char *)trans = *(unsigned char *)&icht[ict - 1];
  2171. tran = *(unsigned char *)trans == 'C';
  2172. if (tran && ! isconj) {
  2173. *(unsigned char *)trans = 'T';
  2174. }
  2175. if (tran) {
  2176. ma = k;
  2177. na = n;
  2178. } else {
  2179. ma = n;
  2180. na = k;
  2181. }
  2182. /* Set LDA to 1 more than minimum value if room. */
  2183. lda = ma;
  2184. if (lda < *nmax) {
  2185. ++lda;
  2186. }
  2187. /* Skip tests if not enough room. */
  2188. if (lda > *nmax) {
  2189. goto L80;
  2190. }
  2191. laa = lda * na;
  2192. /* Generate the matrix A. */
  2193. zmake_("ge", " ", " ", &ma, &na, &a[a_offset], nmax, &aa[1], &
  2194. lda, &reset, &c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)1);
  2195. for (icu = 1; icu <= 2; ++icu) {
  2196. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  2197. upper = *(unsigned char *)uplo == 'U';
  2198. i__3 = *nalf;
  2199. for (ia = 1; ia <= i__3; ++ia) {
  2200. i__4 = ia;
  2201. alpha.r = alf[i__4].r, alpha.i = alf[i__4].i;
  2202. if (isconj) {
  2203. ralpha = alpha.r;
  2204. z__1.r = ralpha, z__1.i = 0.;
  2205. alpha.r = z__1.r, alpha.i = z__1.i;
  2206. }
  2207. i__4 = *nbet;
  2208. for (ib = 1; ib <= i__4; ++ib) {
  2209. i__5 = ib;
  2210. beta.r = bet[i__5].r, beta.i = bet[i__5].i;
  2211. if (isconj) {
  2212. rbeta = beta.r;
  2213. z__1.r = rbeta, z__1.i = 0.;
  2214. beta.r = z__1.r, beta.i = z__1.i;
  2215. }
  2216. null = n <= 0;
  2217. if (isconj) {
  2218. null = null ||( (k <= 0 || ralpha == 0.) &&
  2219. rbeta == 1.);
  2220. }
  2221. /* Generate the matrix C. */
  2222. zmake_(sname + 7, uplo, " ", &n, &n, &c__[
  2223. c_offset], nmax, &cc[1], &ldc, &reset, &
  2224. c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)1);
  2225. ++nc;
  2226. /* Save every datum before calling the subroutine. */
  2227. *(unsigned char *)uplos = *(unsigned char *)uplo;
  2228. *(unsigned char *)transs = *(unsigned char *)
  2229. trans;
  2230. ns = n;
  2231. ks = k;
  2232. if (isconj) {
  2233. rals = ralpha;
  2234. } else {
  2235. als.r = alpha.r, als.i = alpha.i;
  2236. }
  2237. i__5 = laa;
  2238. for (i__ = 1; i__ <= i__5; ++i__) {
  2239. i__6 = i__;
  2240. i__7 = i__;
  2241. as[i__6].r = aa[i__7].r, as[i__6].i = aa[i__7]
  2242. .i;
  2243. /* L10: */
  2244. }
  2245. ldas = lda;
  2246. if (isconj) {
  2247. rbets = rbeta;
  2248. } else {
  2249. bets.r = beta.r, bets.i = beta.i;
  2250. }
  2251. i__5 = lcc;
  2252. for (i__ = 1; i__ <= i__5; ++i__) {
  2253. i__6 = i__;
  2254. i__7 = i__;
  2255. cs[i__6].r = cc[i__7].r, cs[i__6].i = cc[i__7]
  2256. .i;
  2257. /* L20: */
  2258. }
  2259. ldcs = ldc;
  2260. /* Call the subroutine. */
  2261. if (isconj) {
  2262. if (*trace) {
  2263. zprcn6_(ntra, &nc, sname, iorder, uplo,
  2264. trans, &n, &k, &ralpha, &lda, &
  2265. rbeta, &ldc, (ftnlen)12, (ftnlen)
  2266. 1, (ftnlen)1);
  2267. }
  2268. if (*rewi) {
  2269. /* al__1.aerr = 0;
  2270. al__1.aunit = *ntra;
  2271. f_rew(&al__1);*/
  2272. }
  2273. czherk_(iorder, uplo, trans, &n, &k, &ralpha,
  2274. &aa[1], &lda, &rbeta, &cc[1], &ldc, (
  2275. ftnlen)1, (ftnlen)1);
  2276. } else {
  2277. if (*trace) {
  2278. zprcn4_(ntra, &nc, sname, iorder, uplo,
  2279. trans, &n, &k, &alpha, &lda, &
  2280. beta, &ldc, (ftnlen)12, (ftnlen)1,
  2281. (ftnlen)1);
  2282. }
  2283. if (*rewi) {
  2284. /* al__1.aerr = 0;
  2285. al__1.aunit = *ntra;
  2286. f_rew(&al__1);*/
  2287. }
  2288. czsyrk_(iorder, uplo, trans, &n, &k, &alpha, &
  2289. aa[1], &lda, &beta, &cc[1], &ldc, (
  2290. ftnlen)1, (ftnlen)1);
  2291. }
  2292. /* Check if error-exit was taken incorrectly. */
  2293. if (! infoc_1.ok) {
  2294. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  2295. *fatal = TRUE_;
  2296. goto L120;
  2297. }
  2298. /* See what data changed inside subroutines. */
  2299. isame[0] = *(unsigned char *)uplos == *(unsigned
  2300. char *)uplo;
  2301. isame[1] = *(unsigned char *)transs == *(unsigned
  2302. char *)trans;
  2303. isame[2] = ns == n;
  2304. isame[3] = ks == k;
  2305. if (isconj) {
  2306. isame[4] = rals == ralpha;
  2307. } else {
  2308. isame[4] = als.r == alpha.r && als.i ==
  2309. alpha.i;
  2310. }
  2311. isame[5] = lze_(&as[1], &aa[1], &laa);
  2312. isame[6] = ldas == lda;
  2313. if (isconj) {
  2314. isame[7] = rbets == rbeta;
  2315. } else {
  2316. isame[7] = bets.r == beta.r && bets.i ==
  2317. beta.i;
  2318. }
  2319. if (null) {
  2320. isame[8] = lze_(&cs[1], &cc[1], &lcc);
  2321. } else {
  2322. isame[8] = lzeres_(sname + 7, uplo, &n, &n, &
  2323. cs[1], &cc[1], &ldc, (ftnlen)2, (
  2324. ftnlen)1);
  2325. }
  2326. isame[9] = ldcs == ldc;
  2327. /* If data was incorrectly changed, report and */
  2328. /* return. */
  2329. same = TRUE_;
  2330. i__5 = nargs;
  2331. for (i__ = 1; i__ <= i__5; ++i__) {
  2332. same = same && isame[i__ - 1];
  2333. if (! isame[i__ - 1]) {
  2334. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  2335. }
  2336. /* L30: */
  2337. }
  2338. if (! same) {
  2339. *fatal = TRUE_;
  2340. goto L120;
  2341. }
  2342. if (! null) {
  2343. /* Check the result column by column. */
  2344. if (isconj) {
  2345. *(unsigned char *)transt = 'C';
  2346. } else {
  2347. *(unsigned char *)transt = 'T';
  2348. }
  2349. jc = 1;
  2350. i__5 = n;
  2351. for (j = 1; j <= i__5; ++j) {
  2352. if (upper) {
  2353. jj = 1;
  2354. lj = j;
  2355. } else {
  2356. jj = j;
  2357. lj = n - j + 1;
  2358. }
  2359. if (tran) {
  2360. zmmch_(transt, "N", &lj, &c__1, &k, &
  2361. alpha, &a[jj * a_dim1 + 1],
  2362. nmax, &a[j * a_dim1 + 1],
  2363. nmax, &beta, &c__[jj + j *
  2364. c_dim1], nmax, &ct[1], &g[1],
  2365. &cc[jc], &ldc, eps, &err,
  2366. fatal, nout, &c_true, (ftnlen)
  2367. 1, (ftnlen)1);
  2368. } else {
  2369. zmmch_("N", transt, &lj, &c__1, &k, &
  2370. alpha, &a[jj + a_dim1], nmax,
  2371. &a[j + a_dim1], nmax, &beta, &
  2372. c__[jj + j * c_dim1], nmax, &
  2373. ct[1], &g[1], &cc[jc], &ldc,
  2374. eps, &err, fatal, nout, &
  2375. c_true, (ftnlen)1, (ftnlen)1);
  2376. }
  2377. if (upper) {
  2378. jc += ldc;
  2379. } else {
  2380. jc = jc + ldc + 1;
  2381. }
  2382. errmax = f2cmax(errmax,err);
  2383. /* If got really bad answer, report and */
  2384. /* return. */
  2385. if (*fatal) {
  2386. goto L110;
  2387. }
  2388. /* L40: */
  2389. }
  2390. }
  2391. /* L50: */
  2392. }
  2393. /* L60: */
  2394. }
  2395. /* L70: */
  2396. }
  2397. L80:
  2398. ;
  2399. }
  2400. /* L90: */
  2401. }
  2402. L100:
  2403. ;
  2404. }
  2405. /* Report result. */
  2406. if (errmax < *thresh) {
  2407. if (*iorder == 0) {
  2408. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2409. }
  2410. if (*iorder == 1) {
  2411. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2412. }
  2413. } else {
  2414. if (*iorder == 0) {
  2415. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2416. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2417. }
  2418. if (*iorder == 1) {
  2419. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2420. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2421. }
  2422. }
  2423. goto L130;
  2424. L110:
  2425. if (n > 1) {
  2426. printf(" THESE ARE THE RESULTS FOR COLUMN %d:\n",j);
  2427. }
  2428. L120:
  2429. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  2430. if (isconj) {
  2431. zprcn6_(nout, &nc, sname, iorder, uplo, trans, &n, &k, &ralpha, &lda,
  2432. &rbeta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  2433. } else {
  2434. zprcn4_(nout, &nc, sname, iorder, uplo, trans, &n, &k, &alpha, &lda, &
  2435. beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  2436. }
  2437. L130:
  2438. return 0;
  2439. /* 9994 FORMAT(1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  2440. /* $ F4.1, ', A,', I3, ',', F4.1, ', C,', I3, ') ', */
  2441. /* $ ' .' ) */
  2442. /* 9993 FORMAT(1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  2443. /* $ '(', F4.1, ',', F4.1, ') , A,', I3, ',(', F4.1, ',', F4.1, */
  2444. /* $ '), C,', I3, ') .' ) */
  2445. /* End of CCHK4. */
  2446. } /* zchk4_ */
  2447. /* Subroutine */ int zprcn4_(nout, nc, sname, iorder, uplo, transa, n, k,
  2448. alpha, lda, beta, ldc, sname_len, uplo_len, transa_len)
  2449. integer *nout, *nc;
  2450. char *sname;
  2451. integer *iorder;
  2452. char *uplo, *transa;
  2453. integer *n, *k;
  2454. doublecomplex *alpha;
  2455. integer *lda;
  2456. doublecomplex *beta;
  2457. integer *ldc;
  2458. ftnlen sname_len;
  2459. ftnlen uplo_len;
  2460. ftnlen transa_len;
  2461. {
  2462. /* Local variables */
  2463. static char ca[14], cu[14], crc[14];
  2464. if (*(unsigned char *)uplo == 'U') {
  2465. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  2466. } else {
  2467. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  2468. }
  2469. if (*(unsigned char *)transa == 'N') {
  2470. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  2471. } else if (*(unsigned char *)transa == 'T') {
  2472. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  2473. } else {
  2474. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  2475. }
  2476. if (*iorder == 1) {
  2477. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  2478. } else {
  2479. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  2480. }
  2481. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cu,ca);
  2482. printf("( %d %d (%4.1lf,%4.1lf) A %d (%4.1lf,%4.1lf) C %d\n",*n,*k,alpha->r,alpha->i,*lda,beta->r,beta->i,*ldc);
  2483. return 0;
  2484. } /* zprcn4_ */
  2485. /* Subroutine */ int zprcn6_(nout, nc, sname, iorder, uplo, transa, n, k,
  2486. alpha, lda, beta, ldc, sname_len, uplo_len, transa_len)
  2487. integer *nout, *nc;
  2488. char *sname;
  2489. integer *iorder;
  2490. char *uplo, *transa;
  2491. integer *n, *k;
  2492. doublereal *alpha;
  2493. integer *lda;
  2494. doublereal *beta;
  2495. integer *ldc;
  2496. ftnlen sname_len;
  2497. ftnlen uplo_len;
  2498. ftnlen transa_len;
  2499. {
  2500. /* Local variables */
  2501. static char ca[14], cu[14], crc[14];
  2502. if (*(unsigned char *)uplo == 'U') {
  2503. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  2504. } else {
  2505. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  2506. }
  2507. if (*(unsigned char *)transa == 'N') {
  2508. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  2509. } else if (*(unsigned char *)transa == 'T') {
  2510. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  2511. } else {
  2512. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  2513. }
  2514. if (*iorder == 1) {
  2515. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  2516. } else {
  2517. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  2518. }
  2519. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cu,ca);
  2520. printf("( %d %d %4.1lf A %d %4.1lf C %d\n",*n,*k,*alpha,*lda,*beta,*ldc);
  2521. return 0;
  2522. } /* zprcn6_ */
  2523. /* Subroutine */ int zchk5_(sname, eps, thresh, nout, ntra, trace, rewi,
  2524. fatal, nidim, idim, nalf, alf, nbet, bet, nmax, ab, aa, as, bb, bs,
  2525. c__, cc, cs, ct, g, w, iorder, sname_len)
  2526. char *sname;
  2527. doublereal *eps, *thresh;
  2528. integer *nout, *ntra;
  2529. logical *trace, *rewi, *fatal;
  2530. integer *nidim, *idim, *nalf;
  2531. doublecomplex *alf;
  2532. integer *nbet;
  2533. doublecomplex *bet;
  2534. integer *nmax;
  2535. doublecomplex *ab, *aa, *as, *bb, *bs, *c__, *cc, *cs, *ct;
  2536. doublereal *g;
  2537. doublecomplex *w;
  2538. integer *iorder;
  2539. ftnlen sname_len;
  2540. {
  2541. /* Initialized data */
  2542. static char icht[2+1] = "NC";
  2543. static char ichu[2+1] = "UL";
  2544. /* System generated locals */
  2545. integer c_dim1, c_offset, i__1, i__2, i__3, i__4, i__5, i__6, i__7, i__8;
  2546. doublecomplex z__1, z__2;
  2547. /* Local variables */
  2548. static integer jjab;
  2549. static doublecomplex beta;
  2550. static integer ldas, ldbs, ldcs;
  2551. static logical same, isconj;
  2552. static doublecomplex bets;
  2553. static logical tran, null;
  2554. static char uplo[1];
  2555. static integer i__, j, k, n;
  2556. static doublecomplex alpha;
  2557. static doublereal rbeta;
  2558. static logical isame[13];
  2559. extern /* Subroutine */ int zmake_();
  2560. static integer nargs;
  2561. extern /* Subroutine */ int zmmch_();
  2562. static doublereal rbets;
  2563. static logical reset;
  2564. static char trans[1];
  2565. static logical upper;
  2566. static char uplos[1];
  2567. static integer ia, ib, jc, ma, na, nc;
  2568. extern /* Subroutine */ int zprcn5_(), zprcn7_();
  2569. static integer ik, in, jj, lj, ks, ns;
  2570. static doublereal errmax;
  2571. extern logical lzeres_();
  2572. static char transs[1], transt[1];
  2573. extern /* Subroutine */ int czher2k_();
  2574. static integer laa, lbb, lda, lcc, ldb, ldc;
  2575. static doublecomplex als;
  2576. static integer ict, icu;
  2577. extern /* Subroutine */ int czsyr2k_();
  2578. static doublereal err;
  2579. extern logical lze_();
  2580. /* Tests ZHER2K and ZSYR2K. */
  2581. /* Auxiliary routine for test program for Level 3 Blas. */
  2582. /* -- Written on 8-February-1989. */
  2583. /* Jack Dongarra, Argonne National Laboratory. */
  2584. /* Iain Duff, AERE Harwell. */
  2585. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  2586. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  2587. /* .. Parameters .. */
  2588. /* .. Scalar Arguments .. */
  2589. /* .. Array Arguments .. */
  2590. /* .. Local Scalars .. */
  2591. /* .. Local Arrays .. */
  2592. /* .. External Functions .. */
  2593. /* .. External Subroutines .. */
  2594. /* .. Intrinsic Functions .. */
  2595. /* .. Scalars in Common .. */
  2596. /* .. Common blocks .. */
  2597. /* .. Data statements .. */
  2598. /* Parameter adjustments */
  2599. --idim;
  2600. --alf;
  2601. --bet;
  2602. --w;
  2603. --g;
  2604. --ct;
  2605. --cs;
  2606. --cc;
  2607. c_dim1 = *nmax;
  2608. c_offset = 1 + c_dim1 * 1;
  2609. c__ -= c_offset;
  2610. --bs;
  2611. --bb;
  2612. --as;
  2613. --aa;
  2614. --ab;
  2615. /* Function Body */
  2616. /* .. Executable Statements .. */
  2617. isconj = s_cmp(sname + 7, "he", (ftnlen)2, (ftnlen)2) == 0;
  2618. nargs = 12;
  2619. nc = 0;
  2620. reset = TRUE_;
  2621. errmax = 0.;
  2622. i__1 = *nidim;
  2623. for (in = 1; in <= i__1; ++in) {
  2624. n = idim[in];
  2625. /* Set LDC to 1 more than minimum value if room. */
  2626. ldc = n;
  2627. if (ldc < *nmax) {
  2628. ++ldc;
  2629. }
  2630. /* Skip tests if not enough room. */
  2631. if (ldc > *nmax) {
  2632. goto L130;
  2633. }
  2634. lcc = ldc * n;
  2635. i__2 = *nidim;
  2636. for (ik = 1; ik <= i__2; ++ik) {
  2637. k = idim[ik];
  2638. for (ict = 1; ict <= 2; ++ict) {
  2639. *(unsigned char *)trans = *(unsigned char *)&icht[ict - 1];
  2640. tran = *(unsigned char *)trans == 'C';
  2641. if (tran && ! isconj) {
  2642. *(unsigned char *)trans = 'T';
  2643. }
  2644. if (tran) {
  2645. ma = k;
  2646. na = n;
  2647. } else {
  2648. ma = n;
  2649. na = k;
  2650. }
  2651. /* Set LDA to 1 more than minimum value if room. */
  2652. lda = ma;
  2653. if (lda < *nmax) {
  2654. ++lda;
  2655. }
  2656. /* Skip tests if not enough room. */
  2657. if (lda > *nmax) {
  2658. goto L110;
  2659. }
  2660. laa = lda * na;
  2661. /* Generate the matrix A. */
  2662. if (tran) {
  2663. i__3 = *nmax << 1;
  2664. zmake_("ge", " ", " ", &ma, &na, &ab[1], &i__3, &aa[1], &
  2665. lda, &reset, &c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)
  2666. 1);
  2667. } else {
  2668. zmake_("ge", " ", " ", &ma, &na, &ab[1], nmax, &aa[1], &
  2669. lda, &reset, &c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)
  2670. 1);
  2671. }
  2672. /* Generate the matrix B. */
  2673. ldb = lda;
  2674. lbb = laa;
  2675. if (tran) {
  2676. i__3 = *nmax << 1;
  2677. zmake_("ge", " ", " ", &ma, &na, &ab[k + 1], &i__3, &bb[1]
  2678. , &ldb, &reset, &c_b1, (ftnlen)2, (ftnlen)1, (
  2679. ftnlen)1);
  2680. } else {
  2681. zmake_("ge", " ", " ", &ma, &na, &ab[k * *nmax + 1], nmax,
  2682. &bb[1], &ldb, &reset, &c_b1, (ftnlen)2, (ftnlen)
  2683. 1, (ftnlen)1);
  2684. }
  2685. for (icu = 1; icu <= 2; ++icu) {
  2686. *(unsigned char *)uplo = *(unsigned char *)&ichu[icu - 1];
  2687. upper = *(unsigned char *)uplo == 'U';
  2688. i__3 = *nalf;
  2689. for (ia = 1; ia <= i__3; ++ia) {
  2690. i__4 = ia;
  2691. alpha.r = alf[i__4].r, alpha.i = alf[i__4].i;
  2692. i__4 = *nbet;
  2693. for (ib = 1; ib <= i__4; ++ib) {
  2694. i__5 = ib;
  2695. beta.r = bet[i__5].r, beta.i = bet[i__5].i;
  2696. if (isconj) {
  2697. rbeta = beta.r;
  2698. z__1.r = rbeta, z__1.i = 0.;
  2699. beta.r = z__1.r, beta.i = z__1.i;
  2700. }
  2701. null = n <= 0;
  2702. if (isconj) {
  2703. null = null ||( (k <= 0 || (alpha.r == 0. &&
  2704. alpha.i == 0.)) && rbeta == 1.);
  2705. }
  2706. /* Generate the matrix C. */
  2707. zmake_(sname + 7, uplo, " ", &n, &n, &c__[
  2708. c_offset], nmax, &cc[1], &ldc, &reset, &
  2709. c_b1, (ftnlen)2, (ftnlen)1, (ftnlen)1);
  2710. ++nc;
  2711. /* Save every datum before calling the subroutine. */
  2712. *(unsigned char *)uplos = *(unsigned char *)uplo;
  2713. *(unsigned char *)transs = *(unsigned char *)
  2714. trans;
  2715. ns = n;
  2716. ks = k;
  2717. als.r = alpha.r, als.i = alpha.i;
  2718. i__5 = laa;
  2719. for (i__ = 1; i__ <= i__5; ++i__) {
  2720. i__6 = i__;
  2721. i__7 = i__;
  2722. as[i__6].r = aa[i__7].r, as[i__6].i = aa[i__7]
  2723. .i;
  2724. /* L10: */
  2725. }
  2726. ldas = lda;
  2727. i__5 = lbb;
  2728. for (i__ = 1; i__ <= i__5; ++i__) {
  2729. i__6 = i__;
  2730. i__7 = i__;
  2731. bs[i__6].r = bb[i__7].r, bs[i__6].i = bb[i__7]
  2732. .i;
  2733. /* L20: */
  2734. }
  2735. ldbs = ldb;
  2736. if (isconj) {
  2737. rbets = rbeta;
  2738. } else {
  2739. bets.r = beta.r, bets.i = beta.i;
  2740. }
  2741. i__5 = lcc;
  2742. for (i__ = 1; i__ <= i__5; ++i__) {
  2743. i__6 = i__;
  2744. i__7 = i__;
  2745. cs[i__6].r = cc[i__7].r, cs[i__6].i = cc[i__7]
  2746. .i;
  2747. /* L30: */
  2748. }
  2749. ldcs = ldc;
  2750. /* Call the subroutine. */
  2751. if (isconj) {
  2752. if (*trace) {
  2753. zprcn7_(ntra, &nc, sname, iorder, uplo,
  2754. trans, &n, &k, &alpha, &lda, &ldb,
  2755. &rbeta, &ldc, (ftnlen)12, (
  2756. ftnlen)1, (ftnlen)1);
  2757. }
  2758. if (*rewi) {
  2759. /* al__1.aerr = 0;
  2760. al__1.aunit = *ntra;
  2761. f_rew(&al__1);*/
  2762. }
  2763. czher2k_(iorder, uplo, trans, &n, &k, &alpha,
  2764. &aa[1], &lda, &bb[1], &ldb, &rbeta, &
  2765. cc[1], &ldc, (ftnlen)1, (ftnlen)1);
  2766. } else {
  2767. if (*trace) {
  2768. zprcn5_(ntra, &nc, sname, iorder, uplo,
  2769. trans, &n, &k, &alpha, &lda, &ldb,
  2770. &beta, &ldc, (ftnlen)12, (ftnlen)
  2771. 1, (ftnlen)1);
  2772. }
  2773. if (*rewi) {
  2774. /* al__1.aerr = 0;
  2775. al__1.aunit = *ntra;
  2776. f_rew(&al__1);*/
  2777. }
  2778. czsyr2k_(iorder, uplo, trans, &n, &k, &alpha,
  2779. &aa[1], &lda, &bb[1], &ldb, &beta, &
  2780. cc[1], &ldc, (ftnlen)1, (ftnlen)1);
  2781. }
  2782. /* Check if error-exit was taken incorrectly. */
  2783. if (! infoc_1.ok) {
  2784. printf("*** FATAL ERROR - ERROR-CALL MYEXIT TAKEN ON VALID CALL\n");
  2785. *fatal = TRUE_;
  2786. goto L150;
  2787. }
  2788. /* See what data changed inside subroutines. */
  2789. isame[0] = *(unsigned char *)uplos == *(unsigned
  2790. char *)uplo;
  2791. isame[1] = *(unsigned char *)transs == *(unsigned
  2792. char *)trans;
  2793. isame[2] = ns == n;
  2794. isame[3] = ks == k;
  2795. isame[4] = als.r == alpha.r && als.i == alpha.i;
  2796. isame[5] = lze_(&as[1], &aa[1], &laa);
  2797. isame[6] = ldas == lda;
  2798. isame[7] = lze_(&bs[1], &bb[1], &lbb);
  2799. isame[8] = ldbs == ldb;
  2800. if (isconj) {
  2801. isame[9] = rbets == rbeta;
  2802. } else {
  2803. isame[9] = bets.r == beta.r && bets.i ==
  2804. beta.i;
  2805. }
  2806. if (null) {
  2807. isame[10] = lze_(&cs[1], &cc[1], &lcc);
  2808. } else {
  2809. isame[10] = lzeres_("he", uplo, &n, &n, &cs[1]
  2810. , &cc[1], &ldc, (ftnlen)2, (ftnlen)1);
  2811. }
  2812. isame[11] = ldcs == ldc;
  2813. /* If data was incorrectly changed, report and */
  2814. /* return. */
  2815. same = TRUE_;
  2816. i__5 = nargs;
  2817. for (i__ = 1; i__ <= i__5; ++i__) {
  2818. same = same && isame[i__ - 1];
  2819. if (! isame[i__ - 1]) {
  2820. printf(" ******* FATAL ERROR - PARAMETER NUMBER %d WAS CHANGED INCORRECTLY *******\n",i__);
  2821. }
  2822. /* L40: */
  2823. }
  2824. if (! same) {
  2825. *fatal = TRUE_;
  2826. goto L150;
  2827. }
  2828. if (! null) {
  2829. /* Check the result column by column. */
  2830. if (isconj) {
  2831. *(unsigned char *)transt = 'C';
  2832. } else {
  2833. *(unsigned char *)transt = 'T';
  2834. }
  2835. jjab = 1;
  2836. jc = 1;
  2837. i__5 = n;
  2838. for (j = 1; j <= i__5; ++j) {
  2839. if (upper) {
  2840. jj = 1;
  2841. lj = j;
  2842. } else {
  2843. jj = j;
  2844. lj = n - j + 1;
  2845. }
  2846. if (tran) {
  2847. i__6 = k;
  2848. for (i__ = 1; i__ <= i__6; ++i__) {
  2849. i__7 = i__;
  2850. i__8 = ((j - 1) << 1) * *nmax + k +
  2851. i__;
  2852. z__1.r = alpha.r * ab[i__8].r -
  2853. alpha.i * ab[i__8].i,
  2854. z__1.i = alpha.r * ab[
  2855. i__8].i + alpha.i * ab[
  2856. i__8].r;
  2857. w[i__7].r = z__1.r, w[i__7].i =
  2858. z__1.i;
  2859. if (isconj) {
  2860. i__7 = k + i__;
  2861. d_cnjg(&z__2, &alpha);
  2862. i__8 = ((j - 1) << 1) * *nmax + i__;
  2863. z__1.r = z__2.r * ab[i__8].r - z__2.i * ab[i__8].i,
  2864. z__1.i = z__2.r * ab[i__8].i + z__2.i * ab[
  2865. i__8].r;
  2866. w[i__7].r = z__1.r, w[i__7].i = z__1.i;
  2867. } else {
  2868. i__7 = k + i__;
  2869. i__8 = ((j - 1) << 1) * *nmax + i__;
  2870. z__1.r = alpha.r * ab[i__8].r - alpha.i * ab[i__8]
  2871. .i, z__1.i = alpha.r * ab[i__8].i + alpha.i
  2872. * ab[i__8].r;
  2873. w[i__7].r = z__1.r, w[i__7].i = z__1.i;
  2874. }
  2875. /* L50: */
  2876. }
  2877. i__6 = k << 1;
  2878. i__7 = *nmax << 1;
  2879. i__8 = *nmax << 1;
  2880. zmmch_(transt, "N", &lj, &c__1, &i__6,
  2881. &c_b2, &ab[jjab], &i__7, &w[
  2882. 1], &i__8, &beta, &c__[jj + j
  2883. * c_dim1], nmax, &ct[1], &g[1]
  2884. , &cc[jc], &ldc, eps, &err,
  2885. fatal, nout, &c_true, (ftnlen)
  2886. 1, (ftnlen)1);
  2887. } else {
  2888. i__6 = k;
  2889. for (i__ = 1; i__ <= i__6; ++i__) {
  2890. if (isconj) {
  2891. i__7 = i__;
  2892. d_cnjg(&z__2, &ab[(k + i__ - 1) * *nmax + j]);
  2893. z__1.r = alpha.r * z__2.r - alpha.i * z__2.i,
  2894. z__1.i = alpha.r * z__2.i + alpha.i *
  2895. z__2.r;
  2896. w[i__7].r = z__1.r, w[i__7].i = z__1.i;
  2897. i__7 = k + i__;
  2898. i__8 = (i__ - 1) * *nmax + j;
  2899. z__2.r = alpha.r * ab[i__8].r - alpha.i * ab[i__8]
  2900. .i, z__2.i = alpha.r * ab[i__8].i + alpha.i
  2901. * ab[i__8].r;
  2902. d_cnjg(&z__1, &z__2);
  2903. w[i__7].r = z__1.r, w[i__7].i = z__1.i;
  2904. } else {
  2905. i__7 = i__;
  2906. i__8 = (k + i__ - 1) * *nmax + j;
  2907. z__1.r = alpha.r * ab[i__8].r - alpha.i * ab[i__8]
  2908. .i, z__1.i = alpha.r * ab[i__8].i + alpha.i
  2909. * ab[i__8].r;
  2910. w[i__7].r = z__1.r, w[i__7].i = z__1.i;
  2911. i__7 = k + i__;
  2912. i__8 = (i__ - 1) * *nmax + j;
  2913. z__1.r = alpha.r * ab[i__8].r - alpha.i * ab[i__8]
  2914. .i, z__1.i = alpha.r * ab[i__8].i + alpha.i
  2915. * ab[i__8].r;
  2916. w[i__7].r = z__1.r, w[i__7].i = z__1.i;
  2917. }
  2918. /* L60: */
  2919. }
  2920. i__6 = k << 1;
  2921. i__7 = *nmax << 1;
  2922. zmmch_("N", "N", &lj, &c__1, &i__6, &
  2923. c_b2, &ab[jj], nmax, &w[1], &
  2924. i__7, &beta, &c__[jj + j *
  2925. c_dim1], nmax, &ct[1], &g[1],
  2926. &cc[jc], &ldc, eps, &err,
  2927. fatal, nout, &c_true, (ftnlen)
  2928. 1, (ftnlen)1);
  2929. }
  2930. if (upper) {
  2931. jc += ldc;
  2932. } else {
  2933. jc = jc + ldc + 1;
  2934. if (tran) {
  2935. jjab += *nmax << 1;
  2936. }
  2937. }
  2938. errmax = f2cmax(errmax,err);
  2939. /* If got really bad answer, report and */
  2940. /* return. */
  2941. if (*fatal) {
  2942. goto L140;
  2943. }
  2944. /* L70: */
  2945. }
  2946. }
  2947. /* L80: */
  2948. }
  2949. /* L90: */
  2950. }
  2951. /* L100: */
  2952. }
  2953. L110:
  2954. ;
  2955. }
  2956. /* L120: */
  2957. }
  2958. L130:
  2959. ;
  2960. }
  2961. /* Report result. */
  2962. if (errmax < *thresh) {
  2963. if (*iorder == 0) {
  2964. printf("%s PASSED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2965. }
  2966. if (*iorder == 1) {
  2967. printf("%s PASSED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)\n",sname,nc);
  2968. }
  2969. } else {
  2970. if (*iorder == 0) {
  2971. printf("%s COMPLETED THE COLUMN-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2972. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2973. }
  2974. if (*iorder == 1) {
  2975. printf("%s COMPLETED THE ROW-MAJOR COMPUTATIONAL TESTS (%d CALLS)/n",sname,nc);
  2976. printf("***** BUT WITH MAXIMUM TEST RATIO %8.2f - SUSPECT *******/n",errmax);
  2977. }
  2978. }
  2979. goto L160;
  2980. L140:
  2981. if (n > 1) {
  2982. printf(" THESE ARE THE RESULTS FOR COLUMN %d:\n",j);
  2983. }
  2984. L150:
  2985. printf(" ******* %s FAILED ON CALL NUMBER:\n",sname);
  2986. if (isconj) {
  2987. zprcn7_(nout, &nc, sname, iorder, uplo, trans, &n, &k, &alpha, &lda, &
  2988. ldb, &rbeta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  2989. } else {
  2990. zprcn5_(nout, &nc, sname, iorder, uplo, trans, &n, &k, &alpha, &lda, &
  2991. ldb, &beta, &ldc, (ftnlen)12, (ftnlen)1, (ftnlen)1);
  2992. }
  2993. L160:
  2994. return 0;
  2995. /* 9994 FORMAT(1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  2996. /* $ '(', F4.1, ',', F4.1, '), A,', I3, ', B,', I3, ',', F4.1, */
  2997. /* $ ', C,', I3, ') .' ) */
  2998. /* 9993 FORMAT(1X, I6, ': ', A12,'(', 2( '''', A1, ''',' ), 2( I3, ',' ), */
  2999. /* $ '(', F4.1, ',', F4.1, '), A,', I3, ', B,', I3, ',(', F4.1, */
  3000. /* $ ',', F4.1, '), C,', I3, ') .' ) */
  3001. /* End of ZCHK5. */
  3002. } /* zchk5_ */
  3003. /* Subroutine */ int zprcn5_(nout, nc, sname, iorder, uplo, transa, n, k,
  3004. alpha, lda, ldb, beta, ldc, sname_len, uplo_len, transa_len)
  3005. integer *nout, *nc;
  3006. char *sname;
  3007. integer *iorder;
  3008. char *uplo, *transa;
  3009. integer *n, *k;
  3010. doublecomplex *alpha;
  3011. integer *lda, *ldb;
  3012. doublecomplex *beta;
  3013. integer *ldc;
  3014. ftnlen sname_len;
  3015. ftnlen uplo_len;
  3016. ftnlen transa_len;
  3017. {
  3018. /* Local variables */
  3019. static char ca[14], cu[14], crc[14];
  3020. if (*(unsigned char *)uplo == 'U') {
  3021. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  3022. } else {
  3023. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  3024. }
  3025. if (*(unsigned char *)transa == 'N') {
  3026. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  3027. } else if (*(unsigned char *)transa == 'T') {
  3028. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  3029. } else {
  3030. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  3031. }
  3032. if (*iorder == 1) {
  3033. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  3034. } else {
  3035. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  3036. }
  3037. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cu,ca);
  3038. printf("%d %d (%4.1lf,%4.1lf) , A, %d, B, %d, (%4.1lf,%4.1lf) , C, %d.\n",*n,*k,alpha->r,alpha->i,*lda,*ldb,beta->r,beta->i,*ldc);
  3039. return 0;
  3040. } /* zprcn5_ */
  3041. /* Subroutine */ int zprcn7_(nout, nc, sname, iorder, uplo, transa, n, k,
  3042. alpha, lda, ldb, beta, ldc, sname_len, uplo_len, transa_len)
  3043. integer *nout, *nc;
  3044. char *sname;
  3045. integer *iorder;
  3046. char *uplo, *transa;
  3047. integer *n, *k;
  3048. doublecomplex *alpha;
  3049. integer *lda, *ldb;
  3050. doublereal *beta;
  3051. integer *ldc;
  3052. ftnlen sname_len;
  3053. ftnlen uplo_len;
  3054. ftnlen transa_len;
  3055. {
  3056. /* Local variables */
  3057. static char ca[14], cu[14], crc[14];
  3058. if (*(unsigned char *)uplo == 'U') {
  3059. s_copy(cu, " CblasUpper", (ftnlen)14, (ftnlen)14);
  3060. } else {
  3061. s_copy(cu, " CblasLower", (ftnlen)14, (ftnlen)14);
  3062. }
  3063. if (*(unsigned char *)transa == 'N') {
  3064. s_copy(ca, " CblasNoTrans", (ftnlen)14, (ftnlen)14);
  3065. } else if (*(unsigned char *)transa == 'T') {
  3066. s_copy(ca, " CblasTrans", (ftnlen)14, (ftnlen)14);
  3067. } else {
  3068. s_copy(ca, "CblasConjTrans", (ftnlen)14, (ftnlen)14);
  3069. }
  3070. if (*iorder == 1) {
  3071. s_copy(crc, " CblasRowMajor", (ftnlen)14, (ftnlen)14);
  3072. } else {
  3073. s_copy(crc, " CblasColMajor", (ftnlen)14, (ftnlen)14);
  3074. }
  3075. printf("%6d: %s %s %s %s\n",*nc,sname,crc,cu,ca);
  3076. printf("%d %d (%4.1lf,%4.1lf), A, %d, B, %d, %4.1lf, C, %d.\n",*n,*k,alpha->r,alpha->i,*lda,*ldb,*beta,*ldc);
  3077. return 0;
  3078. } /* zprcn7_ */
  3079. /* Subroutine */ int zmake_(type__, uplo, diag, m, n, a, nmax, aa, lda, reset,
  3080. transl, type_len, uplo_len, diag_len)
  3081. char *type__, *uplo, *diag;
  3082. integer *m, *n;
  3083. doublecomplex *a;
  3084. integer *nmax;
  3085. doublecomplex *aa;
  3086. integer *lda;
  3087. logical *reset;
  3088. doublecomplex *transl;
  3089. ftnlen type_len;
  3090. ftnlen uplo_len;
  3091. ftnlen diag_len;
  3092. {
  3093. /* System generated locals */
  3094. integer a_dim1, a_offset, i__1, i__2, i__3, i__4;
  3095. doublereal d__1;
  3096. doublecomplex z__1, z__2;
  3097. /* Local variables */
  3098. static integer ibeg, iend;
  3099. extern /* Double Complex */ VOID zbeg_();
  3100. static logical unit;
  3101. static integer i__, j;
  3102. static logical lower, upper;
  3103. static integer jj;
  3104. static logical gen, her, tri, sym;
  3105. /* Generates values for an M by N matrix A. */
  3106. /* Stores the values in the array AA in the data structure required */
  3107. /* by the routine, with unwanted elements set to rogue value. */
  3108. /* TYPE is 'ge', 'he', 'sy' or 'tr'. */
  3109. /* Auxiliary routine for test program for Level 3 Blas. */
  3110. /* -- Written on 8-February-1989. */
  3111. /* Jack Dongarra, Argonne National Laboratory. */
  3112. /* Iain Duff, AERE Harwell. */
  3113. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  3114. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  3115. /* .. Parameters .. */
  3116. /* .. Scalar Arguments .. */
  3117. /* .. Array Arguments .. */
  3118. /* .. Local Scalars .. */
  3119. /* .. External Functions .. */
  3120. /* .. Intrinsic Functions .. */
  3121. /* .. Executable Statements .. */
  3122. /* Parameter adjustments */
  3123. a_dim1 = *nmax;
  3124. a_offset = 1 + a_dim1 * 1;
  3125. a -= a_offset;
  3126. --aa;
  3127. /* Function Body */
  3128. gen = s_cmp(type__, "ge", (ftnlen)2, (ftnlen)2) == 0;
  3129. her = s_cmp(type__, "he", (ftnlen)2, (ftnlen)2) == 0;
  3130. sym = s_cmp(type__, "sy", (ftnlen)2, (ftnlen)2) == 0;
  3131. tri = s_cmp(type__, "tr", (ftnlen)2, (ftnlen)2) == 0;
  3132. upper = (her || sym || tri) && *(unsigned char *)uplo == 'U';
  3133. lower = (her || sym || tri) && *(unsigned char *)uplo == 'L';
  3134. unit = tri && *(unsigned char *)diag == 'U';
  3135. /* Generate data in array A. */
  3136. i__1 = *n;
  3137. for (j = 1; j <= i__1; ++j) {
  3138. i__2 = *m;
  3139. for (i__ = 1; i__ <= i__2; ++i__) {
  3140. if (gen || (upper && i__ <= j) || (lower && i__ >= j)) {
  3141. i__3 = i__ + j * a_dim1;
  3142. zbeg_(&z__2, reset);
  3143. z__1.r = z__2.r + transl->r, z__1.i = z__2.i + transl->i;
  3144. a[i__3].r = z__1.r, a[i__3].i = z__1.i;
  3145. if (i__ != j) {
  3146. /* Set some elements to zero */
  3147. if (*n > 3 && j == *n / 2) {
  3148. i__3 = i__ + j * a_dim1;
  3149. a[i__3].r = 0., a[i__3].i = 0.;
  3150. }
  3151. if (her) {
  3152. i__3 = j + i__ * a_dim1;
  3153. d_cnjg(&z__1, &a[i__ + j * a_dim1]);
  3154. a[i__3].r = z__1.r, a[i__3].i = z__1.i;
  3155. } else if (sym) {
  3156. i__3 = j + i__ * a_dim1;
  3157. i__4 = i__ + j * a_dim1;
  3158. a[i__3].r = a[i__4].r, a[i__3].i = a[i__4].i;
  3159. } else if (tri) {
  3160. i__3 = j + i__ * a_dim1;
  3161. a[i__3].r = 0., a[i__3].i = 0.;
  3162. }
  3163. }
  3164. }
  3165. /* L10: */
  3166. }
  3167. if (her) {
  3168. i__2 = j + j * a_dim1;
  3169. i__3 = j + j * a_dim1;
  3170. d__1 = a[i__3].r;
  3171. z__1.r = d__1, z__1.i = 0.;
  3172. a[i__2].r = z__1.r, a[i__2].i = z__1.i;
  3173. }
  3174. if (tri) {
  3175. i__2 = j + j * a_dim1;
  3176. i__3 = j + j * a_dim1;
  3177. z__1.r = a[i__3].r + 1., z__1.i = a[i__3].i + 0.;
  3178. a[i__2].r = z__1.r, a[i__2].i = z__1.i;
  3179. }
  3180. if (unit) {
  3181. i__2 = j + j * a_dim1;
  3182. a[i__2].r = 1., a[i__2].i = 0.;
  3183. }
  3184. /* L20: */
  3185. }
  3186. /* Store elements in array AS in data structure required by routine. */
  3187. if (s_cmp(type__, "ge", (ftnlen)2, (ftnlen)2) == 0) {
  3188. i__1 = *n;
  3189. for (j = 1; j <= i__1; ++j) {
  3190. i__2 = *m;
  3191. for (i__ = 1; i__ <= i__2; ++i__) {
  3192. i__3 = i__ + (j - 1) * *lda;
  3193. i__4 = i__ + j * a_dim1;
  3194. aa[i__3].r = a[i__4].r, aa[i__3].i = a[i__4].i;
  3195. /* L30: */
  3196. }
  3197. i__2 = *lda;
  3198. for (i__ = *m + 1; i__ <= i__2; ++i__) {
  3199. i__3 = i__ + (j - 1) * *lda;
  3200. aa[i__3].r = -1e10, aa[i__3].i = 1e10;
  3201. /* L40: */
  3202. }
  3203. /* L50: */
  3204. }
  3205. } else if (s_cmp(type__, "he", (ftnlen)2, (ftnlen)2) == 0 || s_cmp(type__,
  3206. "sy", (ftnlen)2, (ftnlen)2) == 0 || s_cmp(type__, "tr", (ftnlen)
  3207. 2, (ftnlen)2) == 0) {
  3208. i__1 = *n;
  3209. for (j = 1; j <= i__1; ++j) {
  3210. if (upper) {
  3211. ibeg = 1;
  3212. if (unit) {
  3213. iend = j - 1;
  3214. } else {
  3215. iend = j;
  3216. }
  3217. } else {
  3218. if (unit) {
  3219. ibeg = j + 1;
  3220. } else {
  3221. ibeg = j;
  3222. }
  3223. iend = *n;
  3224. }
  3225. i__2 = ibeg - 1;
  3226. for (i__ = 1; i__ <= i__2; ++i__) {
  3227. i__3 = i__ + (j - 1) * *lda;
  3228. aa[i__3].r = -1e10, aa[i__3].i = 1e10;
  3229. /* L60: */
  3230. }
  3231. i__2 = iend;
  3232. for (i__ = ibeg; i__ <= i__2; ++i__) {
  3233. i__3 = i__ + (j - 1) * *lda;
  3234. i__4 = i__ + j * a_dim1;
  3235. aa[i__3].r = a[i__4].r, aa[i__3].i = a[i__4].i;
  3236. /* L70: */
  3237. }
  3238. i__2 = *lda;
  3239. for (i__ = iend + 1; i__ <= i__2; ++i__) {
  3240. i__3 = i__ + (j - 1) * *lda;
  3241. aa[i__3].r = -1e10, aa[i__3].i = 1e10;
  3242. /* L80: */
  3243. }
  3244. if (her) {
  3245. jj = j + (j - 1) * *lda;
  3246. i__2 = jj;
  3247. i__3 = jj;
  3248. d__1 = aa[i__3].r;
  3249. z__1.r = d__1, z__1.i = -1e10;
  3250. aa[i__2].r = z__1.r, aa[i__2].i = z__1.i;
  3251. }
  3252. /* L90: */
  3253. }
  3254. }
  3255. return 0;
  3256. /* End of ZMAKE. */
  3257. } /* zmake_ */
  3258. /* Subroutine */ int zmmch_(transa, transb, m, n, kk, alpha, a, lda, b, ldb,
  3259. beta, c__, ldc, ct, g, cc, ldcc, eps, err, fatal, nout, mv,
  3260. transa_len, transb_len)
  3261. char *transa, *transb;
  3262. integer *m, *n, *kk;
  3263. doublecomplex *alpha, *a;
  3264. integer *lda;
  3265. doublecomplex *b;
  3266. integer *ldb;
  3267. doublecomplex *beta, *c__;
  3268. integer *ldc;
  3269. doublecomplex *ct;
  3270. doublereal *g;
  3271. doublecomplex *cc;
  3272. integer *ldcc;
  3273. doublereal *eps, *err;
  3274. logical *fatal;
  3275. integer *nout;
  3276. logical *mv;
  3277. ftnlen transa_len;
  3278. ftnlen transb_len;
  3279. {
  3280. /* System generated locals */
  3281. integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, cc_dim1,
  3282. cc_offset, i__1, i__2, i__3, i__4, i__5, i__6, i__7;
  3283. doublereal d__1, d__2, d__3, d__4, d__5, d__6;
  3284. doublecomplex z__1, z__2, z__3, z__4;
  3285. double sqrt();
  3286. /* Local variables */
  3287. static doublereal erri;
  3288. static integer i__, j, k;
  3289. static logical trana, tranb, ctrana, ctranb;
  3290. /* Checks the results of the computational tests. */
  3291. /* Auxiliary routine for test program for Level 3 Blas. */
  3292. /* -- Written on 8-February-1989. */
  3293. /* Jack Dongarra, Argonne National Laboratory. */
  3294. /* Iain Duff, AERE Harwell. */
  3295. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  3296. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  3297. /* .. Parameters .. */
  3298. /* .. Scalar Arguments .. */
  3299. /* .. Array Arguments .. */
  3300. /* .. Local Scalars .. */
  3301. /* .. Intrinsic Functions .. */
  3302. /* .. Statement Functions .. */
  3303. /* .. Statement Function definitions .. */
  3304. /* .. Executable Statements .. */
  3305. /* Parameter adjustments */
  3306. a_dim1 = *lda;
  3307. a_offset = 1 + a_dim1 * 1;
  3308. a -= a_offset;
  3309. b_dim1 = *ldb;
  3310. b_offset = 1 + b_dim1 * 1;
  3311. b -= b_offset;
  3312. c_dim1 = *ldc;
  3313. c_offset = 1 + c_dim1 * 1;
  3314. c__ -= c_offset;
  3315. --ct;
  3316. --g;
  3317. cc_dim1 = *ldcc;
  3318. cc_offset = 1 + cc_dim1 * 1;
  3319. cc -= cc_offset;
  3320. /* Function Body */
  3321. trana = *(unsigned char *)transa == 'T' || *(unsigned char *)transa ==
  3322. 'C';
  3323. tranb = *(unsigned char *)transb == 'T' || *(unsigned char *)transb ==
  3324. 'C';
  3325. ctrana = *(unsigned char *)transa == 'C';
  3326. ctranb = *(unsigned char *)transb == 'C';
  3327. /* Compute expected result, one column at a time, in CT using data */
  3328. /* in A, B and C. */
  3329. /* Compute gauges in G. */
  3330. i__1 = *n;
  3331. for (j = 1; j <= i__1; ++j) {
  3332. i__2 = *m;
  3333. for (i__ = 1; i__ <= i__2; ++i__) {
  3334. i__3 = i__;
  3335. ct[i__3].r = 0., ct[i__3].i = 0.;
  3336. g[i__] = 0.;
  3337. /* L10: */
  3338. }
  3339. if (! trana && ! tranb) {
  3340. i__2 = *kk;
  3341. for (k = 1; k <= i__2; ++k) {
  3342. i__3 = *m;
  3343. for (i__ = 1; i__ <= i__3; ++i__) {
  3344. i__4 = i__;
  3345. i__5 = i__;
  3346. i__6 = i__ + k * a_dim1;
  3347. i__7 = k + j * b_dim1;
  3348. z__2.r = a[i__6].r * b[i__7].r - a[i__6].i * b[i__7].i,
  3349. z__2.i = a[i__6].r * b[i__7].i + a[i__6].i * b[
  3350. i__7].r;
  3351. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i +
  3352. z__2.i;
  3353. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3354. i__4 = i__ + k * a_dim1;
  3355. i__5 = k + j * b_dim1;
  3356. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 = d_imag(
  3357. &a[i__ + k * a_dim1]), abs(d__2))) * ((d__3 = b[
  3358. i__5].r, abs(d__3)) + (d__4 = d_imag(&b[k + j *
  3359. b_dim1]), abs(d__4)));
  3360. /* L20: */
  3361. }
  3362. /* L30: */
  3363. }
  3364. } else if (trana && ! tranb) {
  3365. if (ctrana) {
  3366. i__2 = *kk;
  3367. for (k = 1; k <= i__2; ++k) {
  3368. i__3 = *m;
  3369. for (i__ = 1; i__ <= i__3; ++i__) {
  3370. i__4 = i__;
  3371. i__5 = i__;
  3372. d_cnjg(&z__3, &a[k + i__ * a_dim1]);
  3373. i__6 = k + j * b_dim1;
  3374. z__2.r = z__3.r * b[i__6].r - z__3.i * b[i__6].i,
  3375. z__2.i = z__3.r * b[i__6].i + z__3.i * b[i__6]
  3376. .r;
  3377. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i +
  3378. z__2.i;
  3379. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3380. i__4 = k + i__ * a_dim1;
  3381. i__5 = k + j * b_dim1;
  3382. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3383. d_imag(&a[k + i__ * a_dim1]), abs(d__2))) * ((
  3384. d__3 = b[i__5].r, abs(d__3)) + (d__4 = d_imag(
  3385. &b[k + j * b_dim1]), abs(d__4)));
  3386. /* L40: */
  3387. }
  3388. /* L50: */
  3389. }
  3390. } else {
  3391. i__2 = *kk;
  3392. for (k = 1; k <= i__2; ++k) {
  3393. i__3 = *m;
  3394. for (i__ = 1; i__ <= i__3; ++i__) {
  3395. i__4 = i__;
  3396. i__5 = i__;
  3397. i__6 = k + i__ * a_dim1;
  3398. i__7 = k + j * b_dim1;
  3399. z__2.r = a[i__6].r * b[i__7].r - a[i__6].i * b[i__7]
  3400. .i, z__2.i = a[i__6].r * b[i__7].i + a[i__6]
  3401. .i * b[i__7].r;
  3402. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i +
  3403. z__2.i;
  3404. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3405. i__4 = k + i__ * a_dim1;
  3406. i__5 = k + j * b_dim1;
  3407. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3408. d_imag(&a[k + i__ * a_dim1]), abs(d__2))) * ((
  3409. d__3 = b[i__5].r, abs(d__3)) + (d__4 = d_imag(
  3410. &b[k + j * b_dim1]), abs(d__4)));
  3411. /* L60: */
  3412. }
  3413. /* L70: */
  3414. }
  3415. }
  3416. } else if (! trana && tranb) {
  3417. if (ctranb) {
  3418. i__2 = *kk;
  3419. for (k = 1; k <= i__2; ++k) {
  3420. i__3 = *m;
  3421. for (i__ = 1; i__ <= i__3; ++i__) {
  3422. i__4 = i__;
  3423. i__5 = i__;
  3424. i__6 = i__ + k * a_dim1;
  3425. d_cnjg(&z__3, &b[j + k * b_dim1]);
  3426. z__2.r = a[i__6].r * z__3.r - a[i__6].i * z__3.i,
  3427. z__2.i = a[i__6].r * z__3.i + a[i__6].i *
  3428. z__3.r;
  3429. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i +
  3430. z__2.i;
  3431. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3432. i__4 = i__ + k * a_dim1;
  3433. i__5 = j + k * b_dim1;
  3434. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3435. d_imag(&a[i__ + k * a_dim1]), abs(d__2))) * ((
  3436. d__3 = b[i__5].r, abs(d__3)) + (d__4 = d_imag(
  3437. &b[j + k * b_dim1]), abs(d__4)));
  3438. /* L80: */
  3439. }
  3440. /* L90: */
  3441. }
  3442. } else {
  3443. i__2 = *kk;
  3444. for (k = 1; k <= i__2; ++k) {
  3445. i__3 = *m;
  3446. for (i__ = 1; i__ <= i__3; ++i__) {
  3447. i__4 = i__;
  3448. i__5 = i__;
  3449. i__6 = i__ + k * a_dim1;
  3450. i__7 = j + k * b_dim1;
  3451. z__2.r = a[i__6].r * b[i__7].r - a[i__6].i * b[i__7]
  3452. .i, z__2.i = a[i__6].r * b[i__7].i + a[i__6]
  3453. .i * b[i__7].r;
  3454. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i +
  3455. z__2.i;
  3456. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3457. i__4 = i__ + k * a_dim1;
  3458. i__5 = j + k * b_dim1;
  3459. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3460. d_imag(&a[i__ + k * a_dim1]), abs(d__2))) * ((
  3461. d__3 = b[i__5].r, abs(d__3)) + (d__4 = d_imag(
  3462. &b[j + k * b_dim1]), abs(d__4)));
  3463. /* L100: */
  3464. }
  3465. /* L110: */
  3466. }
  3467. }
  3468. } else if (trana && tranb) {
  3469. if (ctrana) {
  3470. if (ctranb) {
  3471. i__2 = *kk;
  3472. for (k = 1; k <= i__2; ++k) {
  3473. i__3 = *m;
  3474. for (i__ = 1; i__ <= i__3; ++i__) {
  3475. i__4 = i__;
  3476. i__5 = i__;
  3477. d_cnjg(&z__3, &a[k + i__ * a_dim1]);
  3478. d_cnjg(&z__4, &b[j + k * b_dim1]);
  3479. z__2.r = z__3.r * z__4.r - z__3.i * z__4.i,
  3480. z__2.i = z__3.r * z__4.i + z__3.i *
  3481. z__4.r;
  3482. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i
  3483. + z__2.i;
  3484. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3485. i__4 = k + i__ * a_dim1;
  3486. i__5 = j + k * b_dim1;
  3487. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3488. d_imag(&a[k + i__ * a_dim1]), abs(d__2)))
  3489. * ((d__3 = b[i__5].r, abs(d__3)) + (d__4
  3490. = d_imag(&b[j + k * b_dim1]), abs(d__4)));
  3491. /* L120: */
  3492. }
  3493. /* L130: */
  3494. }
  3495. } else {
  3496. i__2 = *kk;
  3497. for (k = 1; k <= i__2; ++k) {
  3498. i__3 = *m;
  3499. for (i__ = 1; i__ <= i__3; ++i__) {
  3500. i__4 = i__;
  3501. i__5 = i__;
  3502. d_cnjg(&z__3, &a[k + i__ * a_dim1]);
  3503. i__6 = j + k * b_dim1;
  3504. z__2.r = z__3.r * b[i__6].r - z__3.i * b[i__6].i,
  3505. z__2.i = z__3.r * b[i__6].i + z__3.i * b[
  3506. i__6].r;
  3507. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i
  3508. + z__2.i;
  3509. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3510. i__4 = k + i__ * a_dim1;
  3511. i__5 = j + k * b_dim1;
  3512. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3513. d_imag(&a[k + i__ * a_dim1]), abs(d__2)))
  3514. * ((d__3 = b[i__5].r, abs(d__3)) + (d__4
  3515. = d_imag(&b[j + k * b_dim1]), abs(d__4)));
  3516. /* L140: */
  3517. }
  3518. /* L150: */
  3519. }
  3520. }
  3521. } else {
  3522. if (ctranb) {
  3523. i__2 = *kk;
  3524. for (k = 1; k <= i__2; ++k) {
  3525. i__3 = *m;
  3526. for (i__ = 1; i__ <= i__3; ++i__) {
  3527. i__4 = i__;
  3528. i__5 = i__;
  3529. i__6 = k + i__ * a_dim1;
  3530. d_cnjg(&z__3, &b[j + k * b_dim1]);
  3531. z__2.r = a[i__6].r * z__3.r - a[i__6].i * z__3.i,
  3532. z__2.i = a[i__6].r * z__3.i + a[i__6].i *
  3533. z__3.r;
  3534. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i
  3535. + z__2.i;
  3536. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3537. i__4 = k + i__ * a_dim1;
  3538. i__5 = j + k * b_dim1;
  3539. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3540. d_imag(&a[k + i__ * a_dim1]), abs(d__2)))
  3541. * ((d__3 = b[i__5].r, abs(d__3)) + (d__4
  3542. = d_imag(&b[j + k * b_dim1]), abs(d__4)));
  3543. /* L160: */
  3544. }
  3545. /* L170: */
  3546. }
  3547. } else {
  3548. i__2 = *kk;
  3549. for (k = 1; k <= i__2; ++k) {
  3550. i__3 = *m;
  3551. for (i__ = 1; i__ <= i__3; ++i__) {
  3552. i__4 = i__;
  3553. i__5 = i__;
  3554. i__6 = k + i__ * a_dim1;
  3555. i__7 = j + k * b_dim1;
  3556. z__2.r = a[i__6].r * b[i__7].r - a[i__6].i * b[
  3557. i__7].i, z__2.i = a[i__6].r * b[i__7].i +
  3558. a[i__6].i * b[i__7].r;
  3559. z__1.r = ct[i__5].r + z__2.r, z__1.i = ct[i__5].i
  3560. + z__2.i;
  3561. ct[i__4].r = z__1.r, ct[i__4].i = z__1.i;
  3562. i__4 = k + i__ * a_dim1;
  3563. i__5 = j + k * b_dim1;
  3564. g[i__] += ((d__1 = a[i__4].r, abs(d__1)) + (d__2 =
  3565. d_imag(&a[k + i__ * a_dim1]), abs(d__2)))
  3566. * ((d__3 = b[i__5].r, abs(d__3)) + (d__4
  3567. = d_imag(&b[j + k * b_dim1]), abs(d__4)));
  3568. /* L180: */
  3569. }
  3570. /* L190: */
  3571. }
  3572. }
  3573. }
  3574. }
  3575. i__2 = *m;
  3576. for (i__ = 1; i__ <= i__2; ++i__) {
  3577. i__3 = i__;
  3578. i__4 = i__;
  3579. z__2.r = alpha->r * ct[i__4].r - alpha->i * ct[i__4].i, z__2.i =
  3580. alpha->r * ct[i__4].i + alpha->i * ct[i__4].r;
  3581. i__5 = i__ + j * c_dim1;
  3582. z__3.r = beta->r * c__[i__5].r - beta->i * c__[i__5].i, z__3.i =
  3583. beta->r * c__[i__5].i + beta->i * c__[i__5].r;
  3584. z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
  3585. ct[i__3].r = z__1.r, ct[i__3].i = z__1.i;
  3586. i__3 = i__ + j * c_dim1;
  3587. g[i__] = ((d__1 = alpha->r, abs(d__1)) + (d__2 = d_imag(alpha),
  3588. abs(d__2))) * g[i__] + ((d__3 = beta->r, abs(d__3)) + (
  3589. d__4 = d_imag(beta), abs(d__4))) * ((d__5 = c__[i__3].r,
  3590. abs(d__5)) + (d__6 = d_imag(&c__[i__ + j * c_dim1]), abs(
  3591. d__6)));
  3592. /* L200: */
  3593. }
  3594. /* Compute the error ratio for this result. */
  3595. *err = 0.;
  3596. i__2 = *m;
  3597. for (i__ = 1; i__ <= i__2; ++i__) {
  3598. i__3 = i__;
  3599. i__4 = i__ + j * cc_dim1;
  3600. z__2.r = ct[i__3].r - cc[i__4].r, z__2.i = ct[i__3].i - cc[i__4]
  3601. .i;
  3602. z__1.r = z__2.r, z__1.i = z__2.i;
  3603. erri = ((d__1 = z__1.r, abs(d__1)) + (d__2 = d_imag(&z__1), abs(
  3604. d__2))) / *eps;
  3605. if (g[i__] != 0.) {
  3606. erri /= g[i__];
  3607. }
  3608. *err = f2cmax(*err,erri);
  3609. if (*err * sqrt(*eps) >= 1.) {
  3610. goto L230;
  3611. }
  3612. /* L210: */
  3613. }
  3614. /* L220: */
  3615. }
  3616. /* If the loop completes, all results are at least half accurate. */
  3617. goto L250;
  3618. /* Report fatal error. */
  3619. L230:
  3620. *fatal = TRUE_;
  3621. printf(" ******* FATAL ERROR - COMPUTED RESULT IS LESS THAN HALF ACCURATE *******\n");
  3622. printf(" EXPECTED RESULT COMPUTED RESULT\n");
  3623. i__1 = *m;
  3624. for (i__ = 1; i__ <= i__1; ++i__) {
  3625. if (*mv) {
  3626. printf("%7d (%15.6g,%15.6g) (%15.6g,%15.6g)\n",i__,ct[i__].r,ct[i__].i,cc[i__+j*cc_dim1].r,cc[i__+j*cc_dim1].i);
  3627. } else {
  3628. printf("%7d (%15.6g,%15.6g) (%15.6g,%15.6g)\n",i__,cc[i__+j*cc_dim1].r,cc[i__+j*cc_dim1].i,ct[i__].r,ct[i__].i);
  3629. }
  3630. /* L240: */
  3631. }
  3632. if (*n > 1) {
  3633. printf(" THESE ARE THE RESULTS FOR COLUMN %d\n",j);
  3634. }
  3635. L250:
  3636. return 0;
  3637. /* End of ZMMCH. */
  3638. } /* zmmch_ */
  3639. logical lze_(ri, rj, lr)
  3640. doublecomplex *ri, *rj;
  3641. integer *lr;
  3642. {
  3643. /* System generated locals */
  3644. integer i__1, i__2, i__3;
  3645. logical ret_val;
  3646. /* Local variables */
  3647. static integer i__;
  3648. /* Tests if two arrays are identical. */
  3649. /* Auxiliary routine for test program for Level 3 Blas. */
  3650. /* -- Written on 8-February-1989. */
  3651. /* Jack Dongarra, Argonne National Laboratory. */
  3652. /* Iain Duff, AERE Harwell. */
  3653. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  3654. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  3655. /* .. Scalar Arguments .. */
  3656. /* .. Array Arguments .. */
  3657. /* .. Local Scalars .. */
  3658. /* .. Executable Statements .. */
  3659. /* Parameter adjustments */
  3660. --rj;
  3661. --ri;
  3662. /* Function Body */
  3663. i__1 = *lr;
  3664. for (i__ = 1; i__ <= i__1; ++i__) {
  3665. i__2 = i__;
  3666. i__3 = i__;
  3667. if (ri[i__2].r != rj[i__3].r || ri[i__2].i != rj[i__3].i) {
  3668. goto L20;
  3669. }
  3670. /* L10: */
  3671. }
  3672. ret_val = TRUE_;
  3673. goto L30;
  3674. L20:
  3675. ret_val = FALSE_;
  3676. L30:
  3677. return ret_val;
  3678. /* End of LZE. */
  3679. } /* lze_ */
  3680. logical lzeres_(type__, uplo, m, n, aa, as, lda, type_len, uplo_len)
  3681. char *type__, *uplo;
  3682. integer *m, *n;
  3683. doublecomplex *aa, *as;
  3684. integer *lda;
  3685. ftnlen type_len;
  3686. ftnlen uplo_len;
  3687. {
  3688. /* System generated locals */
  3689. integer aa_dim1, aa_offset, as_dim1, as_offset, i__1, i__2, i__3, i__4;
  3690. logical ret_val;
  3691. /* Local variables */
  3692. static integer ibeg, iend, i__, j;
  3693. static logical upper;
  3694. /* Tests if selected elements in two arrays are equal. */
  3695. /* TYPE is 'ge' or 'he' or 'sy'. */
  3696. /* Auxiliary routine for test program for Level 3 Blas. */
  3697. /* -- Written on 8-February-1989. */
  3698. /* Jack Dongarra, Argonne National Laboratory. */
  3699. /* Iain Duff, AERE Harwell. */
  3700. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  3701. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  3702. /* .. Scalar Arguments .. */
  3703. /* .. Array Arguments .. */
  3704. /* .. Local Scalars .. */
  3705. /* .. Executable Statements .. */
  3706. /* Parameter adjustments */
  3707. as_dim1 = *lda;
  3708. as_offset = 1 + as_dim1 * 1;
  3709. as -= as_offset;
  3710. aa_dim1 = *lda;
  3711. aa_offset = 1 + aa_dim1 * 1;
  3712. aa -= aa_offset;
  3713. /* Function Body */
  3714. upper = *(unsigned char *)uplo == 'U';
  3715. if (s_cmp(type__, "ge", (ftnlen)2, (ftnlen)2) == 0) {
  3716. i__1 = *n;
  3717. for (j = 1; j <= i__1; ++j) {
  3718. i__2 = *lda;
  3719. for (i__ = *m + 1; i__ <= i__2; ++i__) {
  3720. i__3 = i__ + j * aa_dim1;
  3721. i__4 = i__ + j * as_dim1;
  3722. if (aa[i__3].r != as[i__4].r || aa[i__3].i != as[i__4].i) {
  3723. goto L70;
  3724. }
  3725. /* L10: */
  3726. }
  3727. /* L20: */
  3728. }
  3729. } else if (s_cmp(type__, "he", (ftnlen)2, (ftnlen)2) == 0 || s_cmp(type__,
  3730. "sy", (ftnlen)2, (ftnlen)2) == 0) {
  3731. i__1 = *n;
  3732. for (j = 1; j <= i__1; ++j) {
  3733. if (upper) {
  3734. ibeg = 1;
  3735. iend = j;
  3736. } else {
  3737. ibeg = j;
  3738. iend = *n;
  3739. }
  3740. i__2 = ibeg - 1;
  3741. for (i__ = 1; i__ <= i__2; ++i__) {
  3742. i__3 = i__ + j * aa_dim1;
  3743. i__4 = i__ + j * as_dim1;
  3744. if (aa[i__3].r != as[i__4].r || aa[i__3].i != as[i__4].i) {
  3745. goto L70;
  3746. }
  3747. /* L30: */
  3748. }
  3749. i__2 = *lda;
  3750. for (i__ = iend + 1; i__ <= i__2; ++i__) {
  3751. i__3 = i__ + j * aa_dim1;
  3752. i__4 = i__ + j * as_dim1;
  3753. if (aa[i__3].r != as[i__4].r || aa[i__3].i != as[i__4].i) {
  3754. goto L70;
  3755. }
  3756. /* L40: */
  3757. }
  3758. /* L50: */
  3759. }
  3760. }
  3761. /* 60 CONTINUE */
  3762. ret_val = TRUE_;
  3763. goto L80;
  3764. L70:
  3765. ret_val = FALSE_;
  3766. L80:
  3767. return ret_val;
  3768. /* End of LZERES. */
  3769. } /* lzeres_ */
  3770. /* Double Complex */ VOID zbeg_( ret_val, reset)
  3771. doublecomplex * ret_val;
  3772. logical *reset;
  3773. {
  3774. /* System generated locals */
  3775. doublereal d__1, d__2;
  3776. doublecomplex z__1;
  3777. /* Local variables */
  3778. static integer i__, j, ic, mi, mj;
  3779. /* Generates complex numbers as pairs of random numbers uniformly */
  3780. /* distributed between -0.5 and 0.5. */
  3781. /* Auxiliary routine for test program for Level 3 Blas. */
  3782. /* -- Written on 8-February-1989. */
  3783. /* Jack Dongarra, Argonne National Laboratory. */
  3784. /* Iain Duff, AERE Harwell. */
  3785. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  3786. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  3787. /* .. Scalar Arguments .. */
  3788. /* .. Local Scalars .. */
  3789. /* .. Save statement .. */
  3790. /* .. Intrinsic Functions .. */
  3791. /* .. Executable Statements .. */
  3792. if (*reset) {
  3793. /* Initialize local variables. */
  3794. mi = 891;
  3795. mj = 457;
  3796. i__ = 7;
  3797. j = 7;
  3798. ic = 0;
  3799. *reset = FALSE_;
  3800. }
  3801. /* The sequence of values of I or J is bounded between 1 and 999. */
  3802. /* If initial I or J = 1,2,3,6,7 or 9, the period will be 50. */
  3803. /* If initial I or J = 4 or 8, the period will be 25. */
  3804. /* If initial I or J = 5, the period will be 10. */
  3805. /* IC is used to break up the period by skipping 1 value of I or J */
  3806. /* in 6. */
  3807. ++ic;
  3808. L10:
  3809. i__ *= mi;
  3810. j *= mj;
  3811. i__ -= i__ / 1000 * 1000;
  3812. j -= j / 1000 * 1000;
  3813. if (ic >= 5) {
  3814. ic = 0;
  3815. goto L10;
  3816. }
  3817. d__1 = (i__ - 500) / 1001.;
  3818. d__2 = (j - 500) / 1001.;
  3819. z__1.r = d__1, z__1.i = d__2;
  3820. ret_val->r = z__1.r, ret_val->i = z__1.i;
  3821. return ;
  3822. /* End of ZBEG. */
  3823. } /* zbeg_ */
  3824. doublereal ddiff_(x, y)
  3825. doublereal *x, *y;
  3826. {
  3827. /* System generated locals */
  3828. doublereal ret_val;
  3829. /* Auxiliary routine for test program for Level 3 Blas. */
  3830. /* -- Written on 8-February-1989. */
  3831. /* Jack Dongarra, Argonne National Laboratory. */
  3832. /* Iain Duff, AERE Harwell. */
  3833. /* Jeremy Du Croz, Numerical Algorithms Group Ltd. */
  3834. /* Sven Hammarling, Numerical Algorithms Group Ltd. */
  3835. /* .. Scalar Arguments .. */
  3836. /* .. Executable Statements .. */
  3837. ret_val = *x - *y;
  3838. return ret_val;
  3839. /* End of DDIFF. */
  3840. } /* ddiff_ */
  3841. /* Main program alias */ /*int zblat3_ () { MAIN__ (); }*/