FoxArrayBase.Mod 338 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. CONST
  23. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  24. statistics= FALSE;
  25. conservative=TRUE;
  26. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  27. AddressSize=SIZEOF(ADDRESS);
  28. MathPtrOffset=0*AddressSize;
  29. MathAdrOffset=1*AddressSize;
  30. MathFlagsOffset=2*AddressSize;
  31. MathDimOffset=3*AddressSize;
  32. MathElementSizeOffset=4*AddressSize;
  33. MathLenOffset=5*AddressSize;
  34. MathIncrOffset=6*AddressSize;
  35. GeometryMismatch = 400;
  36. DimensionMismatch=401;
  37. AllocationForbidden=402;
  38. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  39. down = 0; up = 1; (* memory copy modes *)
  40. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  41. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  42. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  43. Size2Flag = 4; (* size = 2 *)
  44. Size3Flag = 5; (* size = 3 *)
  45. Size4Flag = 6; (* size = 4 *)
  46. Size5Flag = 7; (* size = 5 *)
  47. Size6Flag = 8; (* size = 6 *)
  48. Size7Flag = 9; (* size = 7 *)
  49. Size8Flag = 10; (* size = 8 *)
  50. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  51. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  52. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  53. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  54. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  55. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  56. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  57. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  58. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  59. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  60. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  61. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  62. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  63. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  64. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  65. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  66. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  67. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  68. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  69. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  70. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  71. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  72. TYPE
  73. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC, IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: LONGINT ): BOOLEAN;
  74. TransposeP* = PROCEDURE ( ladr, dadr, lstride, linc, dstride, dinc, rows, cols: LONGINT );
  75. LenInc = RECORD
  76. len: SIZE;
  77. inc: SIZE
  78. END;
  79. ArrayDescriptor*= RECORD
  80. ptr*: ANY;
  81. adr*: ADDRESS;
  82. flags*: SET;
  83. dim*: SIZE;
  84. elementSize*: SIZE;
  85. END;
  86. Tensor = POINTER TO ArrayDescriptor;
  87. UnsafeArray*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  88. lens*: ARRAY 8 OF LenInc;
  89. END;
  90. A0 = RECORD(ArrayDescriptor) END;
  91. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  92. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  93. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  94. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  95. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  96. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  97. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  98. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  99. T0 = POINTER TO A0;
  100. T1 = POINTER TO A1;
  101. T2 = POINTER TO A2;
  102. T3 = POINTER TO A3;
  103. T4 = POINTER TO A4;
  104. T5 = POINTER TO A5;
  105. T6 = POINTER TO A6;
  106. T7 = POINTER TO A7;
  107. T8 = POINTER TO A8;
  108. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  109. SmallMatMul* = PROCEDURE(dadr, ladr, radr: LONGINT);
  110. VAR
  111. temporary*: T0;
  112. alloc*: LONGINT; (* statistics *)
  113. allocTemp*: LONGINT; (* statistics *)
  114. (* procedures that might be replaced by ASM methods *)
  115. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  116. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  117. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  118. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  119. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  120. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  121. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  122. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  123. transpose4*: TransposeP; transpose8*: TransposeP;
  124. (* optimizations for small arrays (Alexey Morozov) *)
  125. matMulR2x2*: SmallMatMul;
  126. matMulR3x3*: SmallMatMul;
  127. matMulR4x4*: SmallMatMul;
  128. matVecMulR2x2*: SmallMatMul;
  129. matVecMulR3x3*: SmallMatMul;
  130. matVecMulR4x4*: SmallMatMul;
  131. matMulLR2x2*: SmallMatMul;
  132. matMulLR3x3*: SmallMatMul;
  133. matMulLR4x4*: SmallMatMul;
  134. matVecMulLR2x2*: SmallMatMul;
  135. matVecMulLR3x3*: SmallMatMul;
  136. matVecMulLR4x4*: SmallMatMul;
  137. (*
  138. TensorTypePool: ARRAY 32 OF TensorType;
  139. *)
  140. PROCEDURE SetDefaults*; (* set standard procedures *)
  141. BEGIN
  142. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  143. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  144. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  145. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  146. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  147. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  148. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  149. loopIncMulAXSX := IncMulAXSXLoop;
  150. loopMatMulIncARAR := MatMulIncARARLoop;
  151. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  152. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  153. loopMulAZSZ := MulAZSZLoop;
  154. loopMulALZSLZ := MulALZSLZLoop;
  155. END SetDefaults;
  156. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  157. BEGIN
  158. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  159. END Err;
  160. (* get increment of dimension dim *)
  161. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  162. BEGIN{UNCHECKED}
  163. RETURN base.lens[dim].inc
  164. END GetIncr;
  165. (* set increment of dimension dim *)
  166. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  167. BEGIN{UNCHECKED}
  168. base.lens[dim].inc := val
  169. END PutInc;
  170. (* get length of dimension dim *)
  171. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): LONGINT;
  172. BEGIN{UNCHECKED}
  173. RETURN base.lens[dim].len
  174. END GetLen;
  175. (* set length of dimension dim *)
  176. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  177. BEGIN{UNCHECKED}
  178. base.lens[dim].len := val
  179. END PutLen;
  180. (* get data address *)
  181. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  182. BEGIN
  183. RETURN base.adr;
  184. END GetAdr;
  185. (* set data address *)
  186. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  187. BEGIN
  188. base.adr := value
  189. END PutAdr;
  190. PROCEDURE Align(value: ADDRESS): ADDRESS;
  191. CONST ArrayAlignment = 8;
  192. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  193. END Align;
  194. (* get data base pointer (GC protection) *)
  195. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  196. BEGIN
  197. RETURN base.ptr;
  198. END GetPtr;
  199. (* set data base pointer (GC protection) *)
  200. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  201. BEGIN
  202. base.ptr := value
  203. END PutPtr;
  204. PROCEDURE GetSize( base: UnsafeArray ): LONGINT;
  205. BEGIN
  206. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  207. END GetSize;
  208. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  209. BEGIN
  210. base.elementSize := val
  211. END PutSize;
  212. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  213. VAR dim: LONGINT;
  214. BEGIN
  215. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  216. END GetDim;
  217. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  218. BEGIN
  219. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  220. END GetFlags;
  221. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  222. BEGIN
  223. base.dim := dim
  224. END PutDim;
  225. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  226. BEGIN
  227. base.flags := flags
  228. END PutFlags;
  229. (* report geometry of array passed via address s *)
  230. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  231. VAR i: LONGINT; dim: LONGINT;
  232. PROCEDURE Set( s: SET );
  233. VAR i: LONGINT; first: BOOLEAN;
  234. BEGIN
  235. KernelLog.String( "{" ); first := TRUE;
  236. FOR i := 31 TO 0 BY -1 DO
  237. IF i IN s THEN
  238. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  239. KernelLog.Int( i, 1 );
  240. END;
  241. END;
  242. KernelLog.String( "}" );
  243. END Set;
  244. BEGIN
  245. KernelLog.String( name );
  246. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  247. ELSE
  248. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  249. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  250. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  251. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  252. KernelLog.Ln; dim := GetDim( s );
  253. IF dim > 32 THEN dim := 0 END;
  254. FOR i := 0 TO dim - 1 DO
  255. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  256. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  257. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  258. END;
  259. (*
  260. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  261. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  262. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  263. *)
  264. END;
  265. END Report;
  266. PROCEDURE GetArrayDesc( dim: LONGINT ): Tensor;
  267. VAR (* t: TensorType; *) ptr: Tensor;
  268. p0: T0;
  269. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  270. BEGIN
  271. CASE dim OF
  272. |0: NEW(p0); ptr := p0;
  273. |1:NEW(p1); ptr := p1;
  274. |2:NEW(p2); ptr := p2;
  275. |3:NEW(p3); ptr := p3;
  276. |4:NEW(p4); ptr := p4;
  277. |5:NEW(p5); ptr := p5;
  278. |6:NEW(p6); ptr := p6;
  279. |7:NEW(p7); ptr := p7;
  280. |8:NEW(p8); ptr := p8;
  281. ELSE
  282. HALT(200)
  283. END;
  284. ptr.dim := dim;
  285. ptr.flags := {TensorFlag};
  286. RETURN ptr;
  287. END GetArrayDesc;
  288. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  289. BEGIN
  290. IF d = NIL THEN
  291. d := GetArrayDesc(dim);
  292. ELSIF d.dim # dim THEN
  293. IF ~(TensorFlag IN d.flags) &
  294. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  295. HALT( 100 );
  296. END;
  297. d := GetArrayDesc(dim)
  298. (* ELSE keep as is *)
  299. END;
  300. END EnsureArrayDesc;
  301. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  302. VAR reason: ARRAY 64 OF CHAR;
  303. BEGIN
  304. IF left # 0 THEN Report( "Source operand ", left ) END;
  305. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  306. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  307. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  308. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  309. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  310. ELSE reason := "unknown";
  311. END;
  312. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  313. HALT( 400 );
  314. END Halt;
  315. (** patterns ********************************************************************)
  316. (* find the largest block with a regular pattern of the form offset+{i*li: 0<=i<len}. d is dimension applying to the resulting loop *)
  317. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: LONGINT );
  318. BEGIN
  319. d := dim - 1; len := GetLen( left, d );
  320. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  321. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  322. linc := GetIncr( left, d ); DEC( d );
  323. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  324. len := len * GetLen( left, d ); DEC( d );
  325. END; (* find dimension where pattern does not work any more *)
  326. INC( d );
  327. IF debug THEN
  328. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  329. KernelLog.Ln;
  330. END;
  331. END FindPattern1;
  332. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  333. PROCEDURE FindPattern2( left, right: ADDRESS; dim: LONGINT;
  334. VAR d, len, linc, ri: LONGINT );
  335. (* geometric precondition: lengths must coincide *)
  336. BEGIN
  337. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  338. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  339. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  340. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  341. len := len * GetLen( left, d ); DEC( d );
  342. END;
  343. INC( d );
  344. IF debug THEN
  345. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  346. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  347. END;
  348. END FindPattern2;
  349. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for three arrays simultaneously. d is dimension applying to the resulting loop *)
  350. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: LONGINT;
  351. VAR d, len, linc, ri, di: LONGINT );
  352. (* geometric precondition: lengths must coincide *)
  353. BEGIN
  354. d := dim - 1; len := GetLen( left, d );
  355. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  356. END;
  357. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  358. DEC( d );
  359. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  360. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  361. len := len * GetLen( left, d ); DEC( d );
  362. END;
  363. INC( d );
  364. IF debug THEN
  365. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  366. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  367. END;
  368. END FindPattern3;
  369. PROCEDURE Reverse( src: ADDRESS; dim: LONGINT );
  370. VAR d, sl, sr: LONGINT;
  371. BEGIN
  372. d := 0; sl := GetAdr( src );
  373. WHILE (d < dim) DO
  374. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  375. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  376. END;
  377. PutAdr( src, sl + sr );
  378. END Reverse;
  379. (* check if forward copy may be performed *)
  380. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  381. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  382. (* precondition: len(src,i)=len(dest,i) *)
  383. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  384. Sufficient (but not necessary) conditions:
  385. 1.) no overlap: src right < dest left or src left > dest right or
  386. 2.) same geometry and src left >= dest left
  387. same geometry if ginc(s)=ginc(d) with
  388. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  389. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  390. *)
  391. BEGIN
  392. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  393. dim := GetDim( src );
  394. WHILE (d < dim) DO
  395. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  396. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  397. END;
  398. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  399. ELSIF ((sr - sl) = (dr - dl)) THEN
  400. IF (sl = dl) THEN (* same memory region, both directions possible *)
  401. ELSIF (sl > dl) THEN
  402. EXCL( modes, down ) (* only copy up possible *)
  403. ELSE (*sl < dl*)
  404. EXCL( modes, up ) (* only copy down possible *)
  405. END;
  406. ELSE
  407. modes := modes - {down, up}; (* neither nor *)
  408. END;
  409. END CopyUpCompatible;
  410. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  411. Size: LONGINT ): ANY;
  412. (* allocate a temporary block containing both descriptor and data *)
  413. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  414. BEGIN
  415. HALT(100);
  416. (*
  417. IF statistics THEN INC( allocTemp ) END;
  418. d := 0; len := Size; dim := GetDim( src );
  419. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  420. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  421. dest := SYSTEM.VAL( LONGINT, p );
  422. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  423. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  424. FOR i := 0 TO dim - 1 DO
  425. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  426. len := len * GetLen( src, i );
  427. END;
  428. (* Report("allocdest",dest,dim); *)
  429. RETURN p;
  430. *)
  431. END AllocateTemp;
  432. (*** procedures to traverse arrays and apply operators *)
  433. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  434. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  435. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  436. origdest: ADDRESS; modes: SET;
  437. dest, left: ADDRESS; dim: SIZE;
  438. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  439. VAR len: LONGINT; linc, dinc: LONGINT;
  440. BEGIN
  441. IF dim = loopd THEN
  442. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  443. IF conservative THEN INC( glen, looplen ) END;
  444. ELSE
  445. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  446. dinc := GetIncr( dest, dim ); INC( dim );
  447. WHILE (len > 0) DO
  448. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  449. END;
  450. END;
  451. END Traverse;
  452. BEGIN
  453. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  454. origdest := 0; modes := {up, down};
  455. (* allocate destination, if necessary *)
  456. p := AllocateSame( dest, left, elementSize );
  457. IF p = NIL THEN
  458. CopyUpCompatible( dest, left, modes );
  459. IF up IN modes THEN (* nothing to be done *)
  460. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  461. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  462. END;
  463. END;
  464. (* allocate destination, if necessary *)
  465. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  466. ELSIF CheckGeometry( left, dest, dim )
  467. END; *)
  468. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  469. (* check pattern: longest piece that can be done with a loop *)
  470. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  471. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  472. IF up IN modes THEN (* nothing to be done *)
  473. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  474. ELSE CopyContent( origdest, dest, elementSize );
  475. END;
  476. SYSTEM.PUT( d, dest );
  477. END ApplyGenericUnaryAAOpS;
  478. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  479. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  480. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  481. origdest: LONGINT; modes: SET;
  482. dest, left: ADDRESS; dim: SIZE;
  483. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  484. VAR len: LONGINT; linc, dinc: LONGINT;
  485. BEGIN
  486. IF dim = loopd THEN
  487. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  488. IF conservative THEN INC( glen, looplen ) END;
  489. ELSE
  490. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  491. dinc := GetIncr( dest, dim ); INC( dim );
  492. WHILE (len > 0) DO
  493. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  494. END;
  495. END;
  496. END Traverse;
  497. BEGIN
  498. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  499. origdest := 0; modes := {up, down};
  500. (* allocate destination, if necessary *)
  501. p := AllocateSame( dest, left, elementSize );
  502. IF p = NIL THEN
  503. CopyUpCompatible( dest, left, modes );
  504. IF up IN modes THEN (* nothing to be done *)
  505. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  506. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  507. END;
  508. END;
  509. (* allocate destination, if necessary *)
  510. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  511. ELSIF CheckGeometry( left, dest, dim )
  512. END; *)
  513. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  514. (* check pattern: longest piece that can be done with a loop *)
  515. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  516. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  517. IF up IN modes THEN (* nothing to be done *)
  518. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  519. ELSE CopyContent( origdest, dest, elementSize );
  520. END;
  521. SYSTEM.PUT( d, dest );
  522. END ApplyGenericUnaryAAOpI;
  523. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  524. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  525. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  526. origdest: LONGINT; modes: SET;
  527. dest, left: ADDRESS; dim: SIZE;
  528. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  529. VAR len: LONGINT; linc, dinc: LONGINT;
  530. BEGIN
  531. IF dim = loopd THEN
  532. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  533. IF conservative THEN INC( glen, looplen ) END;
  534. ELSE
  535. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  536. dinc := GetIncr( dest, dim ); INC( dim );
  537. WHILE (len > 0) DO
  538. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  539. END;
  540. END;
  541. END Traverse;
  542. BEGIN
  543. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  544. origdest := 0; modes := {up, down};
  545. (* allocate destination, if necessary *)
  546. p := AllocateSame( dest, left, elementSize );
  547. IF p = NIL THEN
  548. CopyUpCompatible( dest, left, modes );
  549. IF up IN modes THEN (* nothing to be done *)
  550. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  551. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  552. END;
  553. END;
  554. (* allocate destination, if necessary *)
  555. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  556. ELSIF CheckGeometry( left, dest, dim )
  557. END; *)
  558. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  559. (* check pattern: longest piece that can be done with a loop *)
  560. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  561. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  562. IF up IN modes THEN (* nothing to be done *)
  563. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  564. ELSE CopyContent( origdest, dest, elementSize );
  565. END;
  566. SYSTEM.PUT( d, dest );
  567. END ApplyGenericUnaryAAOpL;
  568. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  569. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  570. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  571. origdest: LONGINT; modes: SET;
  572. VAR dest, left: ADDRESS; dim: SIZE;
  573. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  574. VAR len: LONGINT; linc, dinc: LONGINT;
  575. BEGIN
  576. IF dim = loopd THEN
  577. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  578. IF conservative THEN INC( glen, looplen ) END;
  579. ELSE
  580. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  581. dinc := GetIncr( dest, dim ); INC( dim );
  582. WHILE (len > 0) DO
  583. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  584. DEC( len );
  585. END;
  586. END;
  587. END Traverse;
  588. BEGIN
  589. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  590. origdest := 0; modes := {up, down};
  591. (* allocate destination, if necessary *)
  592. p := AllocateSame( dest, left, elementSize );
  593. IF p = NIL THEN
  594. CopyUpCompatible( dest, left, modes );
  595. IF up IN modes THEN (* nothing to be done *)
  596. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  597. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  598. END;
  599. END;
  600. (*
  601. (* allocate destination, if necessary *)
  602. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  603. ELSIF CheckGeometry( left, dest, dim )
  604. END;
  605. *)
  606. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  607. (* check pattern: longest piece that can be done with a loop *)
  608. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  609. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  610. IF up IN modes THEN (* nothing to be done *)
  611. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  612. ELSE CopyContent( origdest, dest, elementSize );
  613. END;
  614. SYSTEM.PUT( d, dest );
  615. END ApplyGenericUnaryAAOpH;
  616. (** apply unary operator to array: array REAL -> array REAL *)
  617. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  618. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  619. origdest: LONGINT; modes: SET;
  620. dest, left: ADDRESS; dim: SIZE;
  621. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  622. VAR len: LONGINT; linc, dinc: LONGINT;
  623. BEGIN
  624. IF dim = loopd THEN
  625. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  626. IF conservative THEN INC( glen, looplen ) END;
  627. ELSE
  628. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  629. dinc := GetIncr( dest, dim ); INC( dim );
  630. WHILE (len > 0) DO
  631. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  632. END;
  633. END;
  634. END Traverse;
  635. BEGIN
  636. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  637. origdest := 0; modes := {up, down};
  638. (* allocate destination, if necessary *)
  639. p := AllocateSame( dest, left, elementSize );
  640. IF p = NIL THEN
  641. CopyUpCompatible( dest, left, modes );
  642. IF up IN modes THEN (* nothing to be done *)
  643. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  644. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  645. END;
  646. END;
  647. (* allocate destination, if necessary *)
  648. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  649. ELSIF CheckGeometry( left, dest, dim )
  650. END; *)
  651. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  652. (* check pattern: longest piece that can be done with a loop *)
  653. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  654. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  655. IF up IN modes THEN (* nothing to be done *)
  656. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  657. ELSE CopyContent( origdest, dest, elementSize );
  658. END;
  659. SYSTEM.PUT( d, dest );
  660. END ApplyGenericUnaryAAOpR;
  661. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  662. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  663. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  664. origdest: LONGINT; modes: SET;
  665. dest, left: ADDRESS; dim: SIZE;
  666. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  667. VAR len: LONGINT; linc, dinc: LONGINT;
  668. BEGIN
  669. IF dim = loopd THEN
  670. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  671. IF conservative THEN INC( glen, looplen ) END;
  672. ELSE
  673. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  674. dinc := GetIncr( dest, dim ); INC( dim );
  675. WHILE (len > 0) DO
  676. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  677. DEC( len );
  678. END;
  679. END;
  680. END Traverse;
  681. BEGIN
  682. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  683. origdest := 0; modes := {up, down};
  684. (* allocate destination, if necessary *)
  685. p := AllocateSame( dest, left, elementSize );
  686. IF p = NIL THEN
  687. CopyUpCompatible( dest, left, modes );
  688. IF up IN modes THEN (* nothing to be done *)
  689. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  690. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  691. END;
  692. END;
  693. (*
  694. (* allocate destination, if necessary *)
  695. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  696. ELSIF CheckGeometry( left, dest, dim )
  697. END;
  698. *)
  699. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  700. (* check pattern: longest piece that can be done with a loop *)
  701. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  702. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  703. IF up IN modes THEN (* nothing to be done *)
  704. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  705. ELSE CopyContent( origdest, dest, elementSize );
  706. END;
  707. SYSTEM.PUT( d, dest );
  708. END ApplyGenericUnaryAAOpX;
  709. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  710. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  711. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  712. origdest: LONGINT; modes: SET;
  713. dest, left: ADDRESS; dim: SIZE;
  714. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  715. VAR len: LONGINT; linc, dinc: LONGINT;
  716. BEGIN
  717. IF dim = loopd THEN
  718. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  719. IF conservative THEN INC( glen, looplen ) END;
  720. ELSE
  721. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  722. dinc := GetIncr( dest, dim ); INC( dim );
  723. WHILE (len > 0) DO
  724. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  725. DEC( len );
  726. END;
  727. END;
  728. END Traverse;
  729. BEGIN
  730. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  731. origdest := 0; modes := {up, down};
  732. (* allocate destination, if necessary *)
  733. p := AllocateSame( dest, left, elementSize );
  734. IF p = NIL THEN
  735. CopyUpCompatible( dest, left, modes );
  736. IF up IN modes THEN (* nothing to be done *)
  737. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  738. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  739. END;
  740. END;
  741. (*
  742. (* allocate destination, if necessary *)
  743. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  744. ELSIF CheckGeometry( left, dest, dim )
  745. END;
  746. *)
  747. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  748. (* check pattern: longest piece that can be done with a loop *)
  749. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  750. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  751. IF up IN modes THEN (* nothing to be done *)
  752. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  753. ELSE CopyContent( origdest, dest, elementSize );
  754. END;
  755. SYSTEM.PUT( d, dest );
  756. END ApplyGenericUnaryAAOpZ;
  757. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  758. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  759. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  760. origdest: LONGINT; modes: SET;
  761. dest, left: ADDRESS; dim: SIZE;
  762. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  763. VAR len: LONGINT; linc, dinc: LONGINT;
  764. BEGIN
  765. IF dim = loopd THEN
  766. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  767. IF conservative THEN INC( glen, looplen ) END;
  768. ELSE
  769. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  770. dinc := GetIncr( dest, dim ); INC( dim );
  771. WHILE (len > 0) DO
  772. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  773. DEC( len );
  774. END;
  775. END;
  776. END Traverse;
  777. BEGIN
  778. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  779. origdest := 0; modes := {up, down};
  780. (* allocate destination, if necessary *)
  781. p := AllocateSame( dest, left, elementSize );
  782. IF p = NIL THEN
  783. CopyUpCompatible( dest, left, modes );
  784. IF up IN modes THEN (* nothing to be done *)
  785. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  786. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  787. END;
  788. END;
  789. (*
  790. (* allocate destination, if necessary *)
  791. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  792. ELSIF CheckGeometry( left, dest, dim )
  793. END;
  794. *)
  795. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  796. (* check pattern: longest piece that can be done with a loop *)
  797. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  798. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  799. IF up IN modes THEN (* nothing to be done *)
  800. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  801. ELSE CopyContent( origdest, dest, elementSize );
  802. END;
  803. SYSTEM.PUT( d, dest );
  804. END ApplyGenericUnaryAAOpLZ;
  805. (** apply unary operator to array: array -> array *)
  806. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: LONGINT;
  807. Loop: UnaryAALoop );
  808. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  809. origdest: LONGINT; modes: SET;
  810. dest, left: ADDRESS; dim: SIZE;
  811. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  812. VAR len: LONGINT; linc, dinc: LONGINT;
  813. BEGIN
  814. IF dim = loopd THEN
  815. Loop( ladr, dadr, loopli, loopdi, looplen );
  816. IF conservative THEN INC( glen, looplen ) END;
  817. ELSE
  818. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  819. dinc := GetIncr( dest, dim ); INC( dim );
  820. WHILE (len > 0) DO
  821. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  822. DEC( len );
  823. END;
  824. END;
  825. END Traverse;
  826. BEGIN
  827. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  828. origdest := 0; modes := {up, down};
  829. (* allocate destination, if necessary *)
  830. p := AllocateSame( dest, left, elementSize );
  831. IF p = NIL THEN
  832. CopyUpCompatible( dest, left, modes );
  833. IF up IN modes THEN (* nothing to be done *)
  834. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  835. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  836. END;
  837. END;
  838. (*
  839. (* allocate destination, if necessary *)
  840. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  841. ELSIF CheckGeometry( left, dest, dim )
  842. END;
  843. *)
  844. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  845. (* check pattern: longest piece that can be done with a loop *)
  846. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  847. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  848. IF up IN modes THEN (* nothing to be done *)
  849. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  850. ELSE CopyContent( origdest, dest, elementSize );
  851. END;
  852. SYSTEM.PUT( d, dest );
  853. END ApplyUnaryAAOp;
  854. (** apply unary operator to array: array -> scalar *)
  855. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  856. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  857. VAR left, dim: LONGINT;
  858. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS );
  859. VAR len: LONGINT; linc: LONGINT;
  860. BEGIN
  861. IF dim = loopd THEN
  862. Loop( ladr, dest, loopli, looplen );
  863. IF conservative THEN INC( glen, looplen ) END;
  864. ELSE
  865. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  866. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  867. END;
  868. END Traverse;
  869. BEGIN
  870. SYSTEM.GET( l, left ); dim := GetDim( left );
  871. IF debug THEN Report( "AS: left", left ); END;
  872. (* check pattern: longest piece that can be done with a loop *)
  873. IF conservative THEN glen := 0 END;
  874. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  875. IF conservative THEN
  876. looplen := 1;
  877. WHILE (dim > 0) DO
  878. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  879. END;
  880. ASSERT( looplen = glen );
  881. END;
  882. END ApplyUnaryASOp;
  883. (** apply unary operator to array: scalar -> array *)
  884. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  885. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  886. VAR dest, dim: LONGINT;
  887. PROCEDURE Traverse( dim: LONGINT; dadr: ADDRESS );
  888. VAR len: LONGINT; dinc: LONGINT;
  889. BEGIN
  890. IF dim = loopd THEN
  891. Loop( right, dadr, loopdi, looplen );
  892. IF conservative THEN INC( glen, looplen ) END;
  893. ELSE
  894. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  895. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  896. END;
  897. END Traverse;
  898. BEGIN
  899. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  900. IF debug THEN Report( "AS: dest", dest ); END;
  901. (* check pattern: longest piece that can be done with a loop *)
  902. IF conservative THEN glen := 0 END;
  903. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  904. IF conservative THEN
  905. looplen := 1;
  906. WHILE (dim > 0) DO
  907. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  908. END;
  909. ASSERT( looplen = glen );
  910. END;
  911. END ApplyUnarySAOp;
  912. (** apply binary operator : array x array -> array *)
  913. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  914. Loop: BinaryAAALoop );
  915. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  916. origdest: LONGINT; modes: SET; left, right, dest: ADDRESS; dim: LONGINT;
  917. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: ADDRESS );
  918. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  919. BEGIN
  920. IF dim = loopd THEN
  921. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  922. IF conservative THEN INC( glen, looplen ) END;
  923. ELSE
  924. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  925. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  926. WHILE (len > 0) DO
  927. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  928. INC( dadr, dinc ); DEC( len );
  929. END;
  930. END;
  931. END Traverse;
  932. BEGIN
  933. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  934. (* allocate destination, if necessary *)
  935. IF ~SameShape( left, right ) THEN
  936. Halt( GeometryMismatch, left, right, 0 )
  937. END;
  938. origdest := 0; modes := {up, down};
  939. p := AllocateSame( dest, left, elementSize );
  940. IF p = NIL THEN
  941. CopyUpCompatible( dest, left, modes );
  942. CopyUpCompatible( dest, right, modes );
  943. IF up IN modes THEN (* nothing to be done *)
  944. ELSIF down IN modes THEN
  945. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  946. ELSE
  947. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  948. END;
  949. END;
  950. (* debugging *)
  951. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  952. (* check pattern: longest piece that can be done with a loop *)
  953. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  954. (* run through dimensions *)
  955. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  956. IF up IN modes THEN (* nothing to be done *)
  957. ELSIF down IN modes THEN
  958. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  959. ELSE CopyContent( origdest, dest, elementSize );
  960. END;
  961. SYSTEM.PUT( d, dest );
  962. END ApplyBinaryAAAOp;
  963. (** apply binary operator: array x scalar -> array *)
  964. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  965. elementSize: LONGINT;
  966. Loop: BinaryASALoop );
  967. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  968. origdest: LONGINT; modes: SET; dest, left: ADDRESS; dim: SIZE;
  969. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  970. VAR len: LONGINT; linc, dinc: LONGINT;
  971. BEGIN
  972. IF dim = loopd THEN
  973. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  974. IF conservative THEN INC( glen, looplen ) END;
  975. ELSE
  976. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  977. dinc := GetIncr( dest, dim ); INC( dim );
  978. WHILE (len > 0) DO
  979. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  980. DEC( len );
  981. END;
  982. END;
  983. END Traverse;
  984. BEGIN
  985. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  986. (* allocate destination, if necessary *)
  987. origdest := 0; modes := {up, down};
  988. p := AllocateSame( dest, left, elementSize );
  989. IF p = NIL THEN
  990. CopyUpCompatible( dest, left, modes );
  991. IF up IN modes THEN (* nothing to be done *)
  992. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  993. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  994. END;
  995. END;
  996. (* debugging *)
  997. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  998. (* check pattern: longest piece that can be done with a loop *)
  999. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1000. (* run through dimensions *)
  1001. IF conservative THEN glen := 0 END;
  1002. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1003. IF conservative THEN
  1004. looplen := 1;
  1005. WHILE (dim > 0) DO
  1006. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1007. END;
  1008. ASSERT( looplen = glen );
  1009. END;
  1010. IF up IN modes THEN (* nothing to be done *)
  1011. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1012. ELSE CopyContent( origdest, dest, elementSize );
  1013. END;
  1014. SYSTEM.PUT( d, dest );
  1015. END ApplyBinaryASAOp;
  1016. (** apply binary operator: array x array -> scalar *)
  1017. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1018. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1019. left, right, dim: LONGINT;
  1020. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS );
  1021. VAR len: LONGINT; linc, rinc: LONGINT;
  1022. BEGIN
  1023. IF dim = loopd THEN
  1024. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1025. IF conservative THEN INC( glen, looplen ) END;
  1026. ELSE
  1027. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1028. rinc := GetIncr( right, dim ); INC( dim );
  1029. WHILE (len > 0) DO
  1030. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1031. DEC( len );
  1032. END;
  1033. END;
  1034. END Traverse;
  1035. BEGIN
  1036. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1037. (* check array lengths *)
  1038. IF ~SameShape( left, right ) THEN
  1039. Halt( GeometryMismatch, left, right, 0 )
  1040. END;
  1041. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1042. (* check pattern: longest piece that can be done with a loop *)
  1043. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1044. (* run through dimensions *)
  1045. IF conservative THEN glen := 0 END;
  1046. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1047. IF conservative THEN
  1048. looplen := 1;
  1049. WHILE (dim > 0) DO
  1050. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1051. END;
  1052. ASSERT( looplen = glen );
  1053. END;
  1054. END ApplyBinaryAASOp;
  1055. (** special binary operator: array x array -> boolean *)
  1056. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1057. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1058. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1059. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS ): BOOLEAN;
  1060. VAR len: LONGINT; linc, rinc: LONGINT;
  1061. BEGIN
  1062. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1063. ELSE
  1064. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1065. rinc := GetIncr( right, dim ); INC( dim );
  1066. WHILE (len > 0) DO
  1067. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1068. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1069. END;
  1070. RETURN TRUE;
  1071. END;
  1072. END Traverse;
  1073. BEGIN
  1074. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1075. (* check array lengths *)
  1076. IF ~SameShape( left, right ) THEN
  1077. RETURN geometryMismatchDefault
  1078. END;
  1079. (* is destination already allocated? (might be a temporary result) *)
  1080. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1081. (* check pattern: longest piece that can be done with a loop *)
  1082. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1083. (* run through dimensions *)
  1084. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1085. END ApplyBinaryAABOp;
  1086. (** special binary operator: array x scalar -> boolean *)
  1087. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1088. Loop: BinaryASBLoop ): BOOLEAN;
  1089. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1090. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS ): BOOLEAN;
  1091. VAR len: LONGINT; linc: LONGINT;
  1092. BEGIN
  1093. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1094. ELSE
  1095. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1096. WHILE (len > 0) DO
  1097. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1098. INC( ladr, linc ); DEC( len );
  1099. END;
  1100. RETURN TRUE;
  1101. END;
  1102. END Traverse;
  1103. BEGIN
  1104. SYSTEM.GET( l, left ); dim := GetDim( left );
  1105. IF debug THEN Report( "AAB:left", left ); END;
  1106. (* check pattern: longest piece that can be done with a loop *)
  1107. FindPattern1( left, dim, loopd, looplen, loopli );
  1108. (* run through dimensions *)
  1109. RETURN Traverse( 0, GetAdr( left ) );
  1110. END ApplyBinaryASBOp;
  1111. (**** operators *)
  1112. (*** copy *)
  1113. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1114. CODE {SYSTEM.i386}
  1115. MOV ECX, [EBP+ladr] ; ECX := ladr
  1116. MOV EDX, [EBP+dadr] ; EDX := dadr
  1117. MOV EBX, [EBP+len] ; EBX := len
  1118. start:
  1119. CMP EBX, 0 ;
  1120. JLE end ; WHILE EBX > 0 DO
  1121. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1122. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1123. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1124. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1125. DEC EBX ; DEC(EBX)
  1126. JMP start
  1127. end:
  1128. END Copy4;
  1129. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1130. CODE {SYSTEM.i386}
  1131. MOV ECX, [EBP+ladr] ; ECX := ladr
  1132. MOV EDX, [EBP+dadr] ; EDX := dadr
  1133. MOV EBX, [EBP+len] ; EBX := len
  1134. start:
  1135. CMP EBX, 0 ;
  1136. JLE end ; WHILE EBX > 0 DO
  1137. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1138. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1139. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1140. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1141. DEC EBX ; DEC(EBX)
  1142. JMP start
  1143. end:
  1144. END Copy2;
  1145. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1146. CODE {SYSTEM.i386}
  1147. MOV ECX, [EBP+ladr] ; ECX := ladr
  1148. MOV EDX, [EBP+dadr] ; EDX := dadr
  1149. MOV EBX, [EBP+len] ; EBX := len
  1150. start:
  1151. CMP EBX, 0 ;
  1152. JLE end ; WHILE EBX > 0 DO
  1153. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1154. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1155. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1156. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1157. DEC EBX ; DEC(EBX)
  1158. JMP start
  1159. end:
  1160. END Copy1;
  1161. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1162. CODE {SYSTEM.i386}
  1163. MOV ECX, [EBP+ladr] ; ECX := ladr
  1164. MOV EDX, [EBP+dadr] ; EDX := dadr
  1165. MOV EBX, [EBP+len] ; EBX := len
  1166. start:
  1167. CMP EBX, 0 ;
  1168. JLE end ; WHILE EBX > 0 DO
  1169. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1170. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1171. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1172. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1173. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1174. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1175. DEC EBX ; DEC(EBX)
  1176. JMP start
  1177. end:
  1178. END Copy8;
  1179. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1180. (** Correct move if overlap, might be important for some array operations,
  1181. do not use SYSTEM.MOVE. *)
  1182. CODE {SYSTEM.i386}
  1183. MOV ECX, [ESP] ; len
  1184. MOV EDI, [ESP+4] ; destadr
  1185. MOV ESI, [ESP+8] ; srcadr
  1186. CMP ESI, EDI
  1187. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1188. MOV EAX, ESI
  1189. ADD EAX, ECX
  1190. CMP EAX, EDI
  1191. JBE moveup ; no overlap, no problem, move up
  1192. MOV ESI, EAX
  1193. ADD EDI, ECX
  1194. DEC ESI
  1195. DEC EDI
  1196. STD ; move down since overlap occured
  1197. REP
  1198. MOVSB
  1199. JMP done
  1200. moveup:
  1201. CLD
  1202. MOV BL, CL
  1203. SHR ECX, 2
  1204. AND BL, 00000003H ; rest to move after 4 byte move
  1205. REP
  1206. MOVSD ; move 4 bytes each step
  1207. MOV CL, BL
  1208. REP
  1209. MOVSB ; move rest in one byte steps
  1210. done:
  1211. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1212. END MoveB;
  1213. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1214. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1215. origdest: ADDRESS; modes: SET; dim: LONGINT;
  1216. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1217. BEGIN
  1218. IF (dinc = elementSize) & (linc = elementSize) THEN
  1219. MoveB( ladr, dadr, len * elementSize );
  1220. (*
  1221. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1222. *)
  1223. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1224. len := len * elementSize;
  1225. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1226. ELSIF elementSize = 1 THEN
  1227. Copy1( ladr, dadr, linc, dinc, len );
  1228. (*
  1229. WHILE (len > 0) DO
  1230. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1231. END;
  1232. *)
  1233. ELSIF elementSize = 2 THEN
  1234. Copy2( ladr, dadr, linc, dinc, len );
  1235. (*
  1236. WHILE (len > 0) DO
  1237. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1238. END;
  1239. *)
  1240. ELSIF elementSize = 4 THEN
  1241. Copy4( ladr, dadr, linc, dinc, len );
  1242. (*
  1243. WHILE (len > 0) DO
  1244. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1245. END;
  1246. *)
  1247. ELSIF elementSize = 8 THEN
  1248. Copy8( ladr, dadr, linc, dinc, len );
  1249. (*
  1250. WHILE (len > 0) DO
  1251. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1252. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1253. INC( dadr, dinc );
  1254. END;
  1255. *)
  1256. ELSE (* SYSTEM.MOVE is expensive ! *)
  1257. WHILE (len > 0) DO
  1258. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1259. INC( dadr, dinc );
  1260. END;
  1261. END;
  1262. END Loop;
  1263. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  1264. VAR len: LONGINT; linc, dinc: LONGINT;
  1265. BEGIN
  1266. IF dim = loopd THEN
  1267. Loop( ladr, dadr, loopli, loopdi, looplen );
  1268. IF conservative THEN INC( glen, looplen ) END;
  1269. ELSE
  1270. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1271. dinc := GetIncr( dest, dim ); INC( dim );
  1272. WHILE (len > 0) DO
  1273. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1274. DEC( len );
  1275. END;
  1276. END;
  1277. END Traverse;
  1278. BEGIN
  1279. dim := GetDim( src );
  1280. origdest := 0; modes := {up, down}; (* copy modes *)
  1281. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1282. CopyUpCompatible( dest, src, modes );
  1283. IF up IN modes THEN (* nothing to be done *)
  1284. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1285. Reverse( src, dim ); Reverse( dest, dim )
  1286. ELSE (* can only copy via double buffer *)
  1287. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1288. END;
  1289. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1290. END;
  1291. (* check pattern: longest piece that can be done with a loop *)
  1292. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1293. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1294. IF up IN modes THEN (* nothing to be done *)
  1295. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1296. ELSE CopyContent( origdest, dest, elementSize );
  1297. END;
  1298. END CopyContent;
  1299. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT ): ANY;
  1300. VAR ptr, data: ANY; Size: LONGINT;
  1301. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1302. PROCEDURE NewData;
  1303. VAR dim, len, size: LONGINT;
  1304. BEGIN
  1305. dim := GetDim( src ); size := elementsize;
  1306. PutDim( dest, dim );
  1307. PutSize( dest, elementsize );
  1308. WHILE (dim > 0) DO
  1309. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1310. PutInc( dest, dim, size ); size := size * len;
  1311. END;
  1312. SYSTEM.NEW( data, size );
  1313. PutAdr( dest, Align(data));
  1314. PutPtr( dest, data );
  1315. END NewData;
  1316. BEGIN
  1317. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1318. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1319. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1320. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1321. PutFlags(dest, {TensorFlag});
  1322. NewData(); RETURN ptr;
  1323. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1324. (* check if re-allocation of descriptor is allowed *)
  1325. IF ~(TensorFlag IN GetFlags( dest )) &
  1326. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1327. HALT( 100 );
  1328. END;
  1329. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1330. PutFlags(dest, {TensorFlag});
  1331. NewData();
  1332. RETURN ptr;
  1333. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1334. (* check if re-allocation of array data is allowed *)
  1335. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1336. HALT( 100 );
  1337. END;
  1338. NewData();
  1339. RETURN data;
  1340. ELSE (* nothing to do *)
  1341. RETURN NIL;
  1342. END;
  1343. END AllocateSame;
  1344. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1345. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1346. BEGIN
  1347. dim := GetDim(src);
  1348. p := GetArrayDesc(dim);
  1349. adr := p;
  1350. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1351. PutAdr( src, 0 );
  1352. PutPtr( src, NIL );
  1353. PutFlags( src, {} );
  1354. RETURN p;
  1355. END TempDescCopy;
  1356. (* used when arrays are passed by value *)
  1357. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: LONGINT );
  1358. VAR p: ANY;
  1359. BEGIN
  1360. ASSERT( src = dest );
  1361. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1362. CopyArray( dest, p, elementsize );
  1363. END CopyArraySelf;
  1364. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1365. VAR p: ANY; srcdim, destdim: LONGINT;
  1366. BEGIN
  1367. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1368. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1369. srcdim := GetDim(src);
  1370. destdim := GetDim(dest);
  1371. (*
  1372. Debugging.Stack("copy array");
  1373. *)
  1374. Report( "copy array source", src ); Report( "copy array des", dest );
  1375. HALT(100);
  1376. ELSIF src = dest THEN (* self copy *)
  1377. CopyArraySelf( dest, src, elementsize );
  1378. ELSE
  1379. p := AllocateSame( dest, src, elementsize );
  1380. CopyContent( dest, src, elementsize )
  1381. END;
  1382. END CopyArray;
  1383. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1384. BEGIN
  1385. dest := 0; CopyTensor( dest, src, elementsize );
  1386. END CopyTensorSelf;
  1387. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1388. elementsize: SIZE );
  1389. VAR p: ANY;
  1390. BEGIN
  1391. (* Report("dest",dest); Report("src",src); *)
  1392. IF (src = NIL) THEN dest := NIL
  1393. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1394. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1395. CopyContent( dest, src, elementsize );
  1396. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1397. ELSE CopyContent( dest, src, elementsize )
  1398. END;
  1399. END CopyTensor;
  1400. (* copy descriptor of src to that of dest. If not existent then create.*)
  1401. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS);
  1402. VAR ptr: ANY; flags: SET;
  1403. PROCEDURE CopyDescriptor;
  1404. BEGIN
  1405. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1406. END CopyDescriptor;
  1407. BEGIN
  1408. (*
  1409. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1410. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1411. *)
  1412. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1413. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1414. CopyDescriptor();
  1415. PutFlags(dest, {TensorFlag});
  1416. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1417. flags := GetFlags(dest);
  1418. (* check if re-allocation of descriptor is allowed *)
  1419. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1420. Halt(DimensionMismatch,src,0,dest);
  1421. END;
  1422. (* create a new descriptor!!! (added by Alexey) *)
  1423. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1424. CopyDescriptor();
  1425. PutFlags(dest, flags);
  1426. ELSE
  1427. flags := GetFlags(dest);
  1428. (* check if re-allocation of array data is allowed *)
  1429. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1430. Halt(AllocationForbidden,src,0,dest);
  1431. END;
  1432. CopyDescriptor();
  1433. PutFlags(dest, flags);
  1434. END;
  1435. END ShallowCopy;
  1436. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1437. BEGIN
  1438. IF debug THEN
  1439. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1440. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1441. END;
  1442. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1443. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1444. END DescriptorCopy;
  1445. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1446. VAR s,d: ADDRESS;
  1447. BEGIN
  1448. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1449. ShallowCopy(d,s);
  1450. SYSTEM.PUT(ADDRESSOF(dest),d);
  1451. END ZeroCopy;
  1452. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1453. BEGIN
  1454. ZeroCopy(src, RESULT);
  1455. RETURN RESULT
  1456. END "ALIAS";
  1457. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1458. VAR dim: LONGINT;
  1459. BEGIN
  1460. dim := GetDim( l );
  1461. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1462. WHILE (dim > 0) DO
  1463. DEC( dim );
  1464. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1465. END;
  1466. RETURN TRUE;
  1467. END SameShape;
  1468. (*
  1469. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1470. (*
  1471. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1472. check if deep copy can be avoided and if so then do a shallow copy
  1473. *)
  1474. BEGIN
  1475. ASSERT( dest # 0 ); (* impossible *)
  1476. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1477. HALT( 100 );
  1478. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1479. (* must copy (and allocate) *)
  1480. CopyArray( dest, src, elementsize );
  1481. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1482. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1483. ELSE CopyContent( dest, src, elementsize )
  1484. END;
  1485. ELSE DescriptorCopy( src, dest )
  1486. END;
  1487. END ZeroCopyArray;
  1488. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1489. (*
  1490. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1491. check if deep copy can be avoided and if so then do a shallow copy
  1492. *)
  1493. BEGIN
  1494. IF debug THEN
  1495. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1496. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1497. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1498. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1499. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1500. END;
  1501. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1502. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1503. ELSE
  1504. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1505. END;
  1506. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1507. (* must copy (and allocate) *)
  1508. CopyTensor( dest, src, elementsize );
  1509. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1510. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1511. ELSE
  1512. HALT( 100 ); (* copy forbidden *)
  1513. END;
  1514. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1515. DescriptorCopy( src, dest );
  1516. ELSE
  1517. HALT( 100 ); (* different shapes: not allowed *)
  1518. END;
  1519. END ZeroCopyTensor;
  1520. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1521. VAR i: LONGINT;
  1522. BEGIN
  1523. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1524. CopyContent( dest, left, elementSize )
  1525. ELSE
  1526. IF debug THEN
  1527. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1528. KernelLog.Ln;
  1529. END;
  1530. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1531. FOR i := 0 TO dim - 1 DO
  1532. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1533. END;
  1534. END;
  1535. END ZeroCopy;
  1536. *)
  1537. (*** conversions ****)
  1538. (** SHORTINT -> INTEGER *)
  1539. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1540. BEGIN
  1541. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1542. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1543. DEC( len );
  1544. END;
  1545. END ConvertASAILoop;
  1546. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1547. BEGIN
  1548. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1549. RETURN RESULT
  1550. END "@Convert";
  1551. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1552. BEGIN
  1553. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1554. RETURN RESULT
  1555. END "LONG";
  1556. (** SHORTINT -> LONGINT *)
  1557. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1558. BEGIN
  1559. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1560. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1561. DEC( len );
  1562. END;
  1563. END ConvertLoopSL;
  1564. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1565. BEGIN
  1566. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1567. RETURN RESULT
  1568. END "@Convert";
  1569. (** SHORTINT -> REAL *)
  1570. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1571. VAR lval: SHORTINT; dval: REAL;
  1572. BEGIN
  1573. WHILE (len > 0) DO
  1574. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1575. INC( dadr, dinc ); DEC( len );
  1576. END;
  1577. END ConvertLoopSR;
  1578. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1579. BEGIN
  1580. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1581. RETURN RESULT
  1582. END "@Convert";
  1583. (** SHORTINT -> LONGREAL *)
  1584. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1585. VAR lval: SHORTINT; dval: LONGREAL;
  1586. BEGIN
  1587. WHILE (len > 0) DO
  1588. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1589. INC( dadr, dinc ); DEC( len );
  1590. END;
  1591. END ConvertLoopSX;
  1592. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1593. BEGIN
  1594. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1595. RETURN RESULT
  1596. END "@Convert";
  1597. (** INTEGER -> SHORTINT (SHORT) *)
  1598. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1599. VAR lval: INTEGER; dval: SHORTINT;
  1600. BEGIN
  1601. WHILE (len > 0) DO
  1602. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1603. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1604. END;
  1605. END ConvertLoopIS;
  1606. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1607. BEGIN
  1608. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1609. RETURN RESULT
  1610. END "@Convert";
  1611. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1612. BEGIN
  1613. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1614. RETURN RESULT
  1615. END "SHORT";
  1616. (** INTEGER -> LONGINT *)
  1617. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1618. BEGIN
  1619. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1620. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1621. DEC( len );
  1622. END;
  1623. END ConvertLoopIL;
  1624. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1625. BEGIN
  1626. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1627. RETURN RESULT
  1628. END "@Convert";
  1629. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1630. BEGIN
  1631. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1632. RETURN RESULT
  1633. END "LONG";
  1634. (** INTEGER -> REAL *)
  1635. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1636. VAR lval: INTEGER; dval: REAL;
  1637. BEGIN
  1638. WHILE (len > 0) DO
  1639. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1640. INC( dadr, dinc ); DEC( len );
  1641. END;
  1642. END ConvertLoopIR;
  1643. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1644. BEGIN
  1645. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1646. RETURN RESULT
  1647. END "@Convert";
  1648. (** INTEGER -> LONGREAL *)
  1649. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1650. VAR lval: INTEGER; dval: LONGREAL;
  1651. BEGIN
  1652. WHILE (len > 0) DO
  1653. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1654. INC( dadr, dinc ); DEC( len );
  1655. END;
  1656. END ConvertLoopIX;
  1657. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1658. BEGIN
  1659. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1660. RETURN RESULT
  1661. END "@Convert";
  1662. (** LONGINT -> INTEGER (SHORT) *)
  1663. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1664. VAR lval: LONGINT; dval: INTEGER;
  1665. BEGIN
  1666. WHILE (len > 0) DO
  1667. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1668. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1669. END;
  1670. END ConvertLoopLI;
  1671. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1672. BEGIN
  1673. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1674. RETURN RESULT
  1675. END "@Convert";
  1676. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1677. BEGIN
  1678. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1679. RETURN RESULT
  1680. END "SHORT";
  1681. (** LONGINT -> REAL *)
  1682. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1683. VAR lval: LONGINT; dval: REAL;
  1684. BEGIN
  1685. WHILE (len > 0) DO
  1686. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1687. INC( dadr, dinc ); DEC( len );
  1688. END;
  1689. END ConvertLoopLR;
  1690. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1691. BEGIN
  1692. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1693. RETURN RESULT
  1694. END "@Convert";
  1695. (** LONGINT -> LONGREAL *)
  1696. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1697. VAR lval: LONGINT; dval: LONGREAL;
  1698. BEGIN
  1699. WHILE (len > 0) DO
  1700. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1701. INC( dadr, dinc ); DEC( len );
  1702. END;
  1703. END ConvertLoopLX;
  1704. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1705. BEGIN
  1706. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1707. RETURN RESULT
  1708. END "@Convert";
  1709. (** REAL -> LONGINT (ENTIER) *)
  1710. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1711. VAR lval: REAL; dval: LONGINT;
  1712. BEGIN
  1713. WHILE (len > 0) DO
  1714. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1715. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1716. END;
  1717. END ConvertLoopRL;
  1718. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1719. BEGIN
  1720. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1721. RETURN RESULT
  1722. END "@Convert";
  1723. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1724. BEGIN
  1725. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1726. RETURN RESULT
  1727. END "ENTIER";
  1728. (** REAL -> LONGREAL *)
  1729. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1730. VAR lval: REAL; dval: LONGREAL;
  1731. BEGIN
  1732. WHILE (len > 0) DO
  1733. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1734. INC( dadr, dinc ); DEC( len );
  1735. END;
  1736. END ConvertLoopRX;
  1737. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1738. BEGIN
  1739. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1740. RETURN RESULT
  1741. END "@Convert";
  1742. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1743. BEGIN
  1744. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1745. RETURN RESULT
  1746. END "LONG";
  1747. (** LONGREAL -> REAL (SHORT) *)
  1748. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1749. VAR lval: LONGREAL; dval: REAL;
  1750. BEGIN
  1751. WHILE (len > 0) DO
  1752. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1753. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1754. END;
  1755. END ConvertLoopXR;
  1756. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1757. BEGIN
  1758. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1759. RETURN RESULT
  1760. END "@Convert";
  1761. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1762. BEGIN
  1763. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1764. RETURN RESULT
  1765. END "SHORT";
  1766. (** LONGREAL -> LONGINT (ENTIER) *)
  1767. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1768. VAR lval: LONGREAL; dval: LONGINT;
  1769. BEGIN
  1770. WHILE (len > 0) DO
  1771. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1772. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1773. END;
  1774. END ConvertLoopXL;
  1775. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1776. BEGIN
  1777. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1778. RETURN RESULT
  1779. END "@Convert";
  1780. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1781. BEGIN
  1782. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1783. RETURN RESULT
  1784. END "ENTIER";
  1785. (*** monadic not A -> ~A ********************************************************************)
  1786. (** BOOLEAN *)
  1787. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1788. VAR lval: BOOLEAN;
  1789. BEGIN
  1790. WHILE (len > 0) DO
  1791. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1792. DEC( len );
  1793. END;
  1794. END NotLoopAB;
  1795. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1796. BEGIN
  1797. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1798. RETURN RESULT
  1799. END "~";
  1800. (*** monadic generic (A) -> -A ********************************************************************)
  1801. (** SHORTINT *)
  1802. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1803. VAR lval: SHORTINT;
  1804. BEGIN
  1805. WHILE (len > 0) DO
  1806. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1807. DEC( len );
  1808. END;
  1809. END GenericLoopS;
  1810. (** INTEGER *)
  1811. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1812. VAR lval: INTEGER;
  1813. BEGIN
  1814. WHILE (len > 0) DO
  1815. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1816. DEC( len );
  1817. END;
  1818. END GenericLoopI;
  1819. (** LONGINT *)
  1820. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1821. VAR lval: LONGINT;
  1822. BEGIN
  1823. WHILE (len > 0) DO
  1824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1825. DEC( len );
  1826. END;
  1827. END GenericLoopL;
  1828. (** HUGEINT *)
  1829. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1830. VAR lval: HUGEINT;
  1831. BEGIN
  1832. WHILE (len > 0) DO
  1833. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1834. DEC( len );
  1835. END;
  1836. END GenericLoopH;
  1837. (** REAL *)
  1838. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1839. VAR lval: REAL;
  1840. BEGIN
  1841. WHILE (len > 0) DO
  1842. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1843. DEC( len );
  1844. END;
  1845. END GenericLoopR;
  1846. (** LONGREAL *)
  1847. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1848. VAR lval: LONGREAL;
  1849. BEGIN
  1850. WHILE (len > 0) DO
  1851. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1852. DEC( len );
  1853. END;
  1854. END GenericLoopX;
  1855. (** COMPLEX *)
  1856. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1857. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1858. BEGIN
  1859. WHILE (len > 0) DO
  1860. lval := ladr;
  1861. dval := dadr;
  1862. dval.val := op(lval.val);
  1863. INC( ladr, linc ); INC( dadr, dinc );
  1864. DEC( len );
  1865. END;
  1866. END GenericLoopZ;
  1867. (** LONGCOMPLEX *)
  1868. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1869. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1870. BEGIN
  1871. WHILE (len > 0) DO
  1872. lval := ladr;
  1873. dval := dadr;
  1874. dval.val := op (lval.val);
  1875. INC( ladr, linc ); INC( dadr, dinc );
  1876. DEC( len );
  1877. END;
  1878. END GenericLoopLZ;
  1879. (*** monadic minus A -> -A ********************************************************************)
  1880. (** SHORTINT *)
  1881. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1882. VAR lval: SHORTINT;
  1883. BEGIN
  1884. WHILE (len > 0) DO
  1885. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1886. DEC( len );
  1887. END;
  1888. END MinusLoopS;
  1889. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1890. BEGIN
  1891. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1892. RETURN RESULT
  1893. END "-";
  1894. (** INTEGER *)
  1895. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1896. VAR lval: INTEGER;
  1897. BEGIN
  1898. WHILE (len > 0) DO
  1899. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1900. DEC( len );
  1901. END;
  1902. END MinusLoopI;
  1903. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1904. BEGIN
  1905. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1906. RETURN RESULT
  1907. END "-";
  1908. (** LONGINT *)
  1909. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1910. VAR lval: LONGINT;
  1911. BEGIN
  1912. WHILE (len > 0) DO
  1913. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1914. DEC( len );
  1915. END;
  1916. END MinusLoopL;
  1917. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1918. BEGIN
  1919. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1920. RETURN RESULT
  1921. END "-";
  1922. (** REAL *)
  1923. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1924. VAR lval: REAL;
  1925. BEGIN
  1926. WHILE (len > 0) DO
  1927. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1928. DEC( len );
  1929. END;
  1930. END MinusLoopR;
  1931. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1932. BEGIN
  1933. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1934. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1935. RETURN RESULT
  1936. END "-";
  1937. (** LONGREAL *)
  1938. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1939. VAR lval: LONGREAL;
  1940. BEGIN
  1941. WHILE (len > 0) DO
  1942. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1943. DEC( len );
  1944. END;
  1945. END MinusLoopX;
  1946. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1947. BEGIN
  1948. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1949. MinusLoopX );
  1950. RETURN RESULT
  1951. END "-";
  1952. (*** add array + array -> array ********************************************************************)
  1953. (** SHORTINT *)
  1954. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1955. VAR lval, rval: SHORTINT;
  1956. BEGIN
  1957. WHILE (len > 0) DO
  1958. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1959. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1960. END;
  1961. END AddASASLoop;
  1962. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1963. BEGIN
  1964. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1965. SIZEOF( SHORTINT ), AddASASLoop );
  1966. RETURN RESULT
  1967. END "+";
  1968. (** INTEGER *)
  1969. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1970. VAR lval, rval: INTEGER;
  1971. BEGIN
  1972. WHILE (len > 0) DO
  1973. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1974. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1975. END;
  1976. END AddAIAILoop;
  1977. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  1978. BEGIN
  1979. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1980. SIZEOF( INTEGER ), AddAIAILoop );
  1981. RETURN RESULT
  1982. END "+";
  1983. (** LONGINT *)
  1984. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1985. VAR lval, rval: LONGINT;
  1986. BEGIN
  1987. WHILE (len > 0) DO
  1988. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1989. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1990. END;
  1991. END AddALALLoop;
  1992. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  1993. BEGIN
  1994. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1995. SIZEOF( LONGINT ), AddALALLoop );
  1996. RETURN RESULT
  1997. END "+";
  1998. (** REAL *)
  1999. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2000. VAR lval, rval: REAL;
  2001. BEGIN
  2002. WHILE (len > 0) DO
  2003. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2004. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2005. END;
  2006. END AddARARLoop;
  2007. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2008. BEGIN
  2009. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2010. loopAddARAR );
  2011. RETURN RESULT
  2012. END "+";
  2013. (** LONGREAL *)
  2014. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2015. VAR lval, rval: LONGREAL;
  2016. BEGIN
  2017. WHILE (len > 0) DO
  2018. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2019. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2020. END;
  2021. END AddAXAXLoop;
  2022. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2023. BEGIN
  2024. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2025. SIZEOF( LONGREAL ), loopAddAXAX );
  2026. RETURN RESULT
  2027. END "+";
  2028. (** COMPLEX *)
  2029. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2030. VAR lval, rval: COMPLEX;
  2031. BEGIN
  2032. WHILE (len > 0) DO
  2033. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2034. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2035. END;
  2036. END AddAZAZLoop;
  2037. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2038. BEGIN
  2039. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2040. SIZEOF( COMPLEX ), loopAddAZAZ );
  2041. RETURN RESULT
  2042. END "+";
  2043. (** LONGCOMPLEX *)
  2044. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2045. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2046. BEGIN
  2047. WHILE (len > 0) DO
  2048. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2049. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2050. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2051. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2052. DEC( len );
  2053. END;
  2054. END AddALZALZLoop;
  2055. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2056. BEGIN
  2057. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2058. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2059. RETURN RESULT
  2060. END "+";
  2061. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2062. (** SHORTINT *)
  2063. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2064. VAR lval, rval: SHORTINT;
  2065. BEGIN
  2066. SYSTEM.GET( radr, rval );
  2067. WHILE (len > 0) DO
  2068. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2069. INC( dadr, dinc ); DEC( len );
  2070. END;
  2071. END AddASSSLoop;
  2072. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2073. BEGIN
  2074. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2075. SIZEOF( SHORTINT ), AddASSSLoop );
  2076. RETURN RESULT
  2077. END "+";
  2078. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2079. BEGIN
  2080. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2081. SIZEOF( SHORTINT ), AddASSSLoop );
  2082. RETURN RESULT
  2083. END "+";
  2084. (** INTEGER *)
  2085. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2086. VAR lval, rval: INTEGER;
  2087. BEGIN
  2088. SYSTEM.GET( radr, rval );
  2089. WHILE (len > 0) DO
  2090. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2091. INC( dadr, dinc ); DEC( len );
  2092. END;
  2093. END AddAISILoop;
  2094. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2095. BEGIN
  2096. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2097. SIZEOF( INTEGER ), AddAISILoop );
  2098. RETURN RESULT
  2099. END "+";
  2100. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2101. BEGIN
  2102. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2103. SIZEOF( INTEGER ), AddAISILoop );
  2104. RETURN RESULT
  2105. END "+";
  2106. (** LONGINT *)
  2107. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2108. VAR lval, rval: LONGINT;
  2109. BEGIN
  2110. SYSTEM.GET( radr, rval );
  2111. WHILE (len > 0) DO
  2112. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2113. INC( dadr, dinc ); DEC( len );
  2114. END;
  2115. END AddALSLLoop;
  2116. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2117. BEGIN
  2118. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2119. SIZEOF( LONGINT ), AddALSLLoop );
  2120. RETURN RESULT
  2121. END "+";
  2122. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2123. BEGIN
  2124. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2125. SIZEOF( LONGINT ), AddALSLLoop );
  2126. RETURN RESULT
  2127. END "+";
  2128. (** REAL *)
  2129. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2130. VAR lval, rval: REAL;
  2131. BEGIN
  2132. SYSTEM.GET( radr, rval );
  2133. WHILE (len > 0) DO
  2134. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2135. INC( dadr, dinc ); DEC( len );
  2136. END;
  2137. END AddARSRLoop;
  2138. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2139. BEGIN
  2140. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2141. AddARSRLoop );
  2142. RETURN RESULT
  2143. END "+";
  2144. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2145. BEGIN
  2146. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2147. AddARSRLoop );
  2148. RETURN RESULT
  2149. END "+";
  2150. (** LONGREAL *)
  2151. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2152. VAR lval, rval: LONGREAL;
  2153. BEGIN
  2154. SYSTEM.GET( radr, rval );
  2155. WHILE (len > 0) DO
  2156. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2157. INC( dadr, dinc ); DEC( len );
  2158. END;
  2159. END AddAXSXLoop;
  2160. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2161. BEGIN
  2162. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2163. SIZEOF( LONGREAL ), AddAXSXLoop );
  2164. RETURN RESULT
  2165. END "+";
  2166. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2167. BEGIN
  2168. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2169. SIZEOF( LONGREAL ), AddAXSXLoop );
  2170. RETURN RESULT
  2171. END "+";
  2172. (** COMPLEX *)
  2173. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2174. VAR lval, rval: COMPLEX;
  2175. BEGIN
  2176. SYSTEM.GET( radr, rval );
  2177. WHILE (len > 0) DO
  2178. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2179. INC( dadr, dinc ); DEC( len );
  2180. END;
  2181. END AddAZSZLoop;
  2182. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2183. BEGIN
  2184. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2185. AddAZSZLoop );
  2186. RETURN RESULT
  2187. END "+";
  2188. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2189. BEGIN
  2190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2191. AddAZSZLoop );
  2192. RETURN RESULT
  2193. END "+";
  2194. (** LONGCOMPLEX *)
  2195. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2196. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2197. BEGIN
  2198. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2199. WHILE (len > 0) DO
  2200. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2201. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2202. INC( ladr, linc );
  2203. INC( dadr, dinc ); DEC( len );
  2204. END;
  2205. END AddALZSLZLoop;
  2206. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2207. BEGIN
  2208. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2209. AddALZSLZLoop );
  2210. RETURN RESULT
  2211. END "+";
  2212. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2213. BEGIN
  2214. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2215. AddALZSLZLoop );
  2216. RETURN RESULT
  2217. END "+";
  2218. (*** subtraction array - array -> array ********************************************************************)
  2219. (** SHORTINT *)
  2220. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2221. VAR lval, rval: SHORTINT;
  2222. BEGIN
  2223. WHILE (len > 0) DO
  2224. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2225. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2226. END;
  2227. END SubASASLoop;
  2228. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2229. BEGIN
  2230. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2231. SIZEOF( SHORTINT ), SubASASLoop );
  2232. RETURN RESULT
  2233. END "-";
  2234. (** INTEGER *)
  2235. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2236. VAR lval, rval: INTEGER;
  2237. BEGIN
  2238. WHILE (len > 0) DO
  2239. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2240. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2241. END;
  2242. END SubAIAILoop;
  2243. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2244. BEGIN
  2245. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2246. SIZEOF( INTEGER ), SubAIAILoop );
  2247. RETURN RESULT
  2248. END "-";
  2249. (** LONGINT *)
  2250. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2251. VAR lval, rval: LONGINT;
  2252. BEGIN
  2253. WHILE (len > 0) DO
  2254. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2255. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2256. END;
  2257. END SubALALLoop;
  2258. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2259. BEGIN
  2260. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2261. SIZEOF( LONGINT ), SubALALLoop );
  2262. RETURN RESULT
  2263. END "-";
  2264. (** REAL *)
  2265. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2266. VAR lval, rval: REAL;
  2267. BEGIN
  2268. WHILE (len > 0) DO
  2269. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2270. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2271. END;
  2272. END SubARARLoop;
  2273. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2274. BEGIN
  2275. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2276. SubARARLoop );
  2277. RETURN RESULT
  2278. END "-";
  2279. (** LONGREAL *)
  2280. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2281. VAR lval, rval: LONGREAL;
  2282. BEGIN
  2283. WHILE (len > 0) DO
  2284. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2285. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2286. END;
  2287. END SubAXAXLoop;
  2288. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2289. BEGIN
  2290. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2291. SIZEOF( LONGREAL ), SubAXAXLoop );
  2292. RETURN RESULT
  2293. END "-";
  2294. (** COMPLEX *)
  2295. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2296. VAR lval, rval: COMPLEX;
  2297. BEGIN
  2298. WHILE (len > 0) DO
  2299. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2300. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2301. END;
  2302. END SubAZAZLoop;
  2303. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2304. BEGIN
  2305. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2306. SIZEOF( COMPLEX ), SubAZAZLoop );
  2307. RETURN RESULT
  2308. END "-";
  2309. (** LONGCOMPLEX *)
  2310. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2311. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2312. BEGIN
  2313. WHILE (len > 0) DO
  2314. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2315. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2316. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2317. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2318. DEC( len );
  2319. END;
  2320. END SubALZALZLoop;
  2321. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2322. BEGIN
  2323. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2324. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2325. RETURN RESULT
  2326. END "-";
  2327. (*** subtraction array-scalar -> array ********************************************************************)
  2328. (** SHORTINT *)
  2329. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2330. BEGIN
  2331. RESULT := left + (-right);
  2332. RETURN RESULT
  2333. END "-";
  2334. (** INTEGER *)
  2335. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2336. BEGIN
  2337. RESULT := left + (-right);
  2338. RETURN RESULT
  2339. END "-";
  2340. (** LONGINT *)
  2341. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2342. BEGIN
  2343. RESULT := left + (-right);
  2344. RETURN RESULT
  2345. END "-";
  2346. (** REAL *)
  2347. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2348. BEGIN
  2349. RESULT := left + (-right);
  2350. RETURN RESULT
  2351. END "-";
  2352. (** LONGREAL *)
  2353. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2354. BEGIN
  2355. RESULT := left + (-right);
  2356. RETURN RESULT
  2357. END "-";
  2358. (** COMPLEX *)
  2359. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2360. BEGIN
  2361. RESULT := left + (-right);
  2362. RETURN RESULT
  2363. END "-";
  2364. (** LONGCOMPLEX *)
  2365. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2366. BEGIN
  2367. RESULT := left + (-right);
  2368. RETURN RESULT
  2369. END "-";
  2370. (*** subtraction scalar-array -> array ********************************************************************)
  2371. (** SHORTINT *)
  2372. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2373. VAR lval, rval, dval: SHORTINT;
  2374. BEGIN
  2375. SYSTEM.GET( radr, rval );
  2376. WHILE (len > 0) DO
  2377. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2378. INC( dadr, dinc ); DEC( len );
  2379. END;
  2380. END SubSSASLoop;
  2381. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2382. BEGIN
  2383. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2384. SIZEOF( SHORTINT ), SubSSASLoop );
  2385. RETURN RESULT
  2386. END "-";
  2387. (** INTEGER *)
  2388. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2389. VAR lval, rval, dval: INTEGER;
  2390. BEGIN
  2391. SYSTEM.GET( radr, rval );
  2392. WHILE (len > 0) DO
  2393. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2394. INC( dadr, dinc ); DEC( len );
  2395. END;
  2396. END SubSIAILoop;
  2397. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2398. BEGIN
  2399. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2400. SIZEOF( INTEGER ), SubSIAILoop );
  2401. RETURN RESULT
  2402. END "-";
  2403. (** LONGINT *)
  2404. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2405. VAR lval, rval, dval: LONGINT;
  2406. BEGIN
  2407. SYSTEM.GET( radr, rval );
  2408. WHILE (len > 0) DO
  2409. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2410. INC( dadr, dinc ); DEC( len );
  2411. END;
  2412. END SubSLALLoop;
  2413. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2414. BEGIN
  2415. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2416. SIZEOF( LONGINT ), SubSLALLoop );
  2417. RETURN RESULT
  2418. END "-";
  2419. (** REAL *)
  2420. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2421. VAR lval, rval, dval: REAL;
  2422. BEGIN
  2423. SYSTEM.GET( radr, rval );
  2424. WHILE (len > 0) DO
  2425. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2426. INC( dadr, dinc ); DEC( len );
  2427. END;
  2428. END SubSRARLoop;
  2429. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2430. BEGIN
  2431. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2432. SubSRARLoop );
  2433. RETURN RESULT
  2434. END "-";
  2435. (** LONGREAL *)
  2436. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2437. VAR lval, rval, dval: LONGREAL;
  2438. BEGIN
  2439. SYSTEM.GET( radr, rval );
  2440. WHILE (len > 0) DO
  2441. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2442. INC( dadr, dinc ); DEC( len );
  2443. END;
  2444. END SubSXAXLoop;
  2445. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2446. BEGIN
  2447. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2448. SIZEOF( LONGREAL ), SubSXAXLoop );
  2449. RETURN RESULT
  2450. END "-";
  2451. (** COMPLEX *)
  2452. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2453. VAR lval, rval, dval: COMPLEX;
  2454. BEGIN
  2455. SYSTEM.GET( radr, rval );
  2456. WHILE (len > 0) DO
  2457. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2458. INC( dadr, dinc ); DEC( len );
  2459. END;
  2460. END SubSZAZLoop;
  2461. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2462. BEGIN
  2463. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2464. SIZEOF( COMPLEX ), SubSZAZLoop );
  2465. RETURN RESULT
  2466. END "-";
  2467. (** LONGCOMPLEX *)
  2468. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2469. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2470. BEGIN
  2471. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2472. WHILE (len > 0) DO
  2473. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2474. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2475. INC( ladr, linc );
  2476. INC( dadr, dinc ); DEC( len );
  2477. END;
  2478. END SubSLZALZLoop;
  2479. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2480. BEGIN
  2481. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2482. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2483. RETURN RESULT
  2484. END "-";
  2485. (*** element-wise multiply array x array -> array ********************************************************************)
  2486. (** SHORTINT *)
  2487. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2488. VAR lval, rval: SHORTINT;
  2489. BEGIN
  2490. WHILE (len > 0) DO
  2491. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2492. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2493. END;
  2494. END EMulASASLoop;
  2495. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2496. BEGIN
  2497. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2498. SIZEOF( SHORTINT ), EMulASASLoop );
  2499. RETURN RESULT
  2500. END ".*";
  2501. (** INTEGER *)
  2502. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2503. VAR lval, rval: INTEGER; dval: INTEGER;
  2504. BEGIN
  2505. WHILE (len > 0) DO
  2506. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2507. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2508. DEC( len );
  2509. END;
  2510. END EMulAIAILoop;
  2511. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2512. BEGIN
  2513. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2514. SIZEOF( INTEGER ), EMulAIAILoop );
  2515. RETURN RESULT
  2516. END ".*";
  2517. (** LONGINT *)
  2518. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2519. VAR lval, rval: LONGINT;
  2520. BEGIN
  2521. WHILE (len > 0) DO
  2522. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2523. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2524. END;
  2525. END EMulALALLoop;
  2526. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2527. BEGIN
  2528. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2529. SIZEOF( LONGINT ), EMulALALLoop );
  2530. RETURN RESULT
  2531. END ".*";
  2532. (** REAL *)
  2533. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2534. VAR lval, rval: REAL;
  2535. BEGIN
  2536. WHILE (len > 0) DO
  2537. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2538. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2539. END;
  2540. END EMulARARLoop;
  2541. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2542. BEGIN
  2543. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2544. EMulARARLoop );
  2545. RETURN RESULT
  2546. END ".*";
  2547. (** LONGREAL *)
  2548. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2549. VAR lval, rval: LONGREAL;
  2550. BEGIN
  2551. WHILE (len > 0) DO
  2552. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2553. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2554. END;
  2555. END EMulAXAXLoop;
  2556. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2557. BEGIN
  2558. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2559. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2560. RETURN RESULT
  2561. END ".*";
  2562. (** COMPLEX *)
  2563. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2564. VAR lval, rval: COMPLEX;
  2565. BEGIN
  2566. WHILE (len > 0) DO
  2567. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2568. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2569. END;
  2570. END EMulAZAZLoop;
  2571. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2572. BEGIN
  2573. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2574. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2575. RETURN RESULT
  2576. END ".*";
  2577. (** LONGCOMPLEX *)
  2578. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2579. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2580. BEGIN
  2581. WHILE (len > 0) DO
  2582. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2583. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2584. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2585. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2586. DEC( len );
  2587. END;
  2588. END EMulALZALZLoop;
  2589. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2590. BEGIN
  2591. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2592. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2593. RETURN RESULT
  2594. END ".*";
  2595. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2596. (** SHORTINT *)
  2597. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2598. VAR lval, rval,dval: SHORTINT;
  2599. BEGIN
  2600. WHILE (len > 0) DO
  2601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2602. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2603. END;
  2604. END EMulIncASASLoop;
  2605. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2606. BEGIN
  2607. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2608. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2609. END ".*+";
  2610. (** INTEGER *)
  2611. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2612. VAR lval, rval,dval: INTEGER;
  2613. BEGIN
  2614. WHILE (len > 0) DO
  2615. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2616. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2617. DEC( len );
  2618. END;
  2619. END EMulIncAIAILoop;
  2620. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2621. BEGIN
  2622. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2623. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2624. END ".*+";
  2625. (** LONGINT *)
  2626. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2627. VAR lval, rval,dval: LONGINT;
  2628. BEGIN
  2629. WHILE (len > 0) DO
  2630. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2631. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2632. END;
  2633. END EMulIncALALLoop;
  2634. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2635. BEGIN
  2636. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2637. SIZEOF( LONGINT ), EMulIncALALLoop );
  2638. END ".*+";
  2639. (** REAL *)
  2640. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2641. VAR lval, rval,dval: REAL;
  2642. BEGIN
  2643. WHILE (len > 0) DO
  2644. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2645. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2646. END;
  2647. END EMulIncARARLoop;
  2648. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2649. BEGIN
  2650. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2651. EMulIncARARLoop );
  2652. END ".*+";
  2653. (** LONGREAL *)
  2654. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2655. VAR lval, rval,dval: LONGREAL;
  2656. BEGIN
  2657. WHILE (len > 0) DO
  2658. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2659. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2660. END;
  2661. END EMulIncAXAXLoop;
  2662. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2663. BEGIN
  2664. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2665. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2666. END ".*+";
  2667. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2668. (** SHORTINT *)
  2669. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2670. VAR lval, rval: SHORTINT;
  2671. BEGIN
  2672. SYSTEM.GET( radr, rval );
  2673. WHILE (len > 0) DO
  2674. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2675. INC( dadr, dinc ); DEC( len );
  2676. END;
  2677. END MulASSSLoop;
  2678. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2679. BEGIN
  2680. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2681. SIZEOF( SHORTINT ), MulASSSLoop );
  2682. RETURN RESULT
  2683. END "*";
  2684. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2685. BEGIN
  2686. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2687. SIZEOF( SHORTINT ), MulASSSLoop );
  2688. RETURN RESULT
  2689. END "*";
  2690. (** INTEGER *)
  2691. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2692. VAR lval, rval: INTEGER;
  2693. BEGIN
  2694. SYSTEM.GET( radr, rval );
  2695. WHILE (len > 0) DO
  2696. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2697. INC( dadr, dinc ); DEC( len );
  2698. END;
  2699. END MulAISILoop;
  2700. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2701. BEGIN
  2702. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2703. SIZEOF( INTEGER ), MulAISILoop );
  2704. RETURN RESULT
  2705. END "*";
  2706. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2707. BEGIN
  2708. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2709. SIZEOF( INTEGER ), MulAISILoop );
  2710. RETURN RESULT
  2711. END "*";
  2712. (** LONGINT *)
  2713. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2714. VAR lval, rval: LONGINT;
  2715. BEGIN
  2716. SYSTEM.GET( radr, rval );
  2717. WHILE (len > 0) DO
  2718. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2719. INC( dadr, dinc ); DEC( len );
  2720. END;
  2721. END MulALSLLoop;
  2722. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2723. BEGIN
  2724. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2725. SIZEOF( LONGINT ), MulALSLLoop );
  2726. RETURN RESULT
  2727. END "*";
  2728. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2729. BEGIN
  2730. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2731. SIZEOF( LONGINT ), MulALSLLoop );
  2732. RETURN RESULT
  2733. END "*";
  2734. (** REAL *)
  2735. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2736. VAR lval, rval: REAL;
  2737. BEGIN
  2738. SYSTEM.GET( radr, rval );
  2739. WHILE (len > 0) DO
  2740. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2741. INC( dadr, dinc ); DEC( len );
  2742. END;
  2743. END MulARSRLoop;
  2744. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2745. BEGIN
  2746. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2747. loopMulARSR );
  2748. RETURN RESULT
  2749. END "*";
  2750. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2751. BEGIN
  2752. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2753. loopMulARSR );
  2754. RETURN RESULT
  2755. END "*";
  2756. (** LONGREAL *)
  2757. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2758. VAR lval, rval: LONGREAL;
  2759. BEGIN
  2760. IF debug THEN
  2761. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2762. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2763. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2764. END;
  2765. SYSTEM.GET( radr, rval );
  2766. WHILE (len > 0) DO
  2767. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2768. INC( dadr, dinc ); DEC( len );
  2769. END;
  2770. END MulAXSXLoop;
  2771. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2772. BEGIN
  2773. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2774. SIZEOF( LONGREAL ), loopMulAXSX );
  2775. RETURN RESULT
  2776. END "*";
  2777. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2778. BEGIN
  2779. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2780. SIZEOF( LONGREAL ), loopMulAXSX );
  2781. RETURN RESULT
  2782. END "*";
  2783. (** COMPLEX *)
  2784. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2785. VAR lval, rval: COMPLEX;
  2786. BEGIN
  2787. SYSTEM.GET( radr, rval );
  2788. WHILE (len > 0) DO
  2789. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2790. INC( dadr, dinc ); DEC( len );
  2791. END;
  2792. END MulAZSZLoop;
  2793. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2794. BEGIN
  2795. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2796. loopMulAZSZ );
  2797. RETURN RESULT
  2798. END "*";
  2799. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2800. BEGIN
  2801. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2802. loopMulAZSZ );
  2803. RETURN RESULT
  2804. END "*";
  2805. (** LONGCOMPLEX *)
  2806. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2807. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2808. BEGIN
  2809. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2810. WHILE (len > 0) DO
  2811. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2812. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2813. INC( ladr, linc );
  2814. INC( dadr, dinc ); DEC( len );
  2815. END;
  2816. END MulALZSLZLoop;
  2817. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2818. BEGIN
  2819. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2820. loopMulALZSLZ );
  2821. RETURN RESULT
  2822. END "*";
  2823. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2824. BEGIN
  2825. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2826. loopMulALZSLZ );
  2827. RETURN RESULT
  2828. END "*";
  2829. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2830. (** SHORTINT *)
  2831. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2832. VAR lval, rval, dval: SHORTINT;
  2833. BEGIN
  2834. SYSTEM.GET( radr, rval );
  2835. WHILE (len > 0) DO
  2836. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2837. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2838. END;
  2839. END IncMulASSSLoop;
  2840. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2841. BEGIN
  2842. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2843. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2844. END "INCMUL";
  2845. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2846. BEGIN
  2847. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2848. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2849. RETURN RESULT
  2850. END "INCMUL";
  2851. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2852. BEGIN
  2853. RESULT := -RESULT;
  2854. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2855. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2856. RESULT := -RESULT;
  2857. RETURN RESULT
  2858. END "DECMUL";
  2859. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2860. BEGIN
  2861. RESULT := -RESULT;
  2862. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2863. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2864. RESULT := -RESULT;
  2865. RETURN RESULT
  2866. END "DECMUL";
  2867. (** INTEGER *)
  2868. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2869. VAR lval, rval, dval: INTEGER;
  2870. BEGIN
  2871. SYSTEM.GET( radr, rval );
  2872. WHILE (len > 0) DO
  2873. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2874. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2875. END;
  2876. END IncMulAISILoop;
  2877. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2878. BEGIN
  2879. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2880. SIZEOF( INTEGER ), IncMulAISILoop );
  2881. RETURN RESULT
  2882. END "INCMUL";
  2883. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2884. BEGIN
  2885. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2886. SIZEOF( INTEGER ), IncMulAISILoop );
  2887. RETURN RESULT
  2888. END "INCMUL";
  2889. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2890. BEGIN
  2891. RESULT := -RESULT;
  2892. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2893. SIZEOF( INTEGER ), IncMulAISILoop );
  2894. RESULT := -RESULT;
  2895. RETURN RESULT
  2896. END "DECMUL";
  2897. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2898. BEGIN
  2899. RESULT := -RESULT;
  2900. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2901. SIZEOF( INTEGER ), IncMulAISILoop );
  2902. RESULT := -RESULT;
  2903. RETURN RESULT
  2904. END "DECMUL";
  2905. (** LONGINT *)
  2906. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2907. VAR lval, rval, dval: LONGINT;
  2908. BEGIN
  2909. SYSTEM.GET( radr, rval );
  2910. WHILE (len > 0) DO
  2911. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2912. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2913. END;
  2914. END IncMulALSLLoop;
  2915. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2916. BEGIN
  2917. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2918. SIZEOF( LONGINT ), IncMulALSLLoop );
  2919. RETURN RESULT
  2920. END "INCMUL";
  2921. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2922. BEGIN
  2923. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2924. SIZEOF( LONGINT ), IncMulALSLLoop );
  2925. RETURN RESULT
  2926. END "INCMUL";
  2927. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2928. BEGIN
  2929. RESULT := -RESULT;
  2930. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2931. SIZEOF( LONGINT ), IncMulALSLLoop );
  2932. RESULT := -RESULT;
  2933. RETURN RESULT
  2934. END "DECMUL";
  2935. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2936. BEGIN
  2937. RESULT := -RESULT;
  2938. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2939. SIZEOF( LONGINT ), IncMulALSLLoop );
  2940. RESULT := -RESULT;
  2941. RETURN RESULT
  2942. END "DECMUL";
  2943. (** REAL *)
  2944. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2945. VAR lval, rval, dval: REAL;
  2946. BEGIN
  2947. SYSTEM.GET( radr, rval );
  2948. WHILE (len > 0) DO
  2949. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2950. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2951. END;
  2952. END IncMulARSRLoop;
  2953. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2954. BEGIN
  2955. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2956. loopIncMulARSR );
  2957. RETURN RESULT
  2958. END "INCMUL";
  2959. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2960. BEGIN
  2961. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2962. loopIncMulARSR );
  2963. RETURN RESULT
  2964. END "INCMUL";
  2965. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2966. BEGIN
  2967. RESULT := -RESULT;
  2968. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2969. loopIncMulARSR );
  2970. RESULT := -RESULT;
  2971. RETURN RESULT
  2972. END "DECMUL";
  2973. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2974. BEGIN
  2975. RESULT := -RESULT;
  2976. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2977. loopIncMulARSR );
  2978. RESULT := -RESULT;
  2979. RETURN RESULT
  2980. END "DECMUL";
  2981. (** LONGREAL *)
  2982. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2983. VAR lval, rval, dval: LONGREAL;
  2984. BEGIN
  2985. IF debug THEN
  2986. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2987. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2988. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2989. END;
  2990. SYSTEM.GET( radr, rval );
  2991. WHILE (len > 0) DO
  2992. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2993. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2994. END;
  2995. END IncMulAXSXLoop;
  2996. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2997. BEGIN
  2998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2999. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3000. RETURN RESULT
  3001. END "INCMUL";
  3002. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3003. BEGIN
  3004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3005. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3006. RETURN RESULT
  3007. END "INCMUL";
  3008. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3009. BEGIN
  3010. RESULT := -RESULT;
  3011. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3012. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3013. RESULT := -RESULT;
  3014. RETURN RESULT
  3015. END "DECMUL";
  3016. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3017. BEGIN
  3018. RESULT := -RESULT;
  3019. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3020. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3021. RESULT := -RESULT;
  3022. RETURN RESULT
  3023. END "DECMUL";
  3024. (*** element-wise division array / array -> array ********************************************************************)
  3025. (** SHORTINT *)
  3026. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3027. VAR lval, rval: SHORTINT; dval: REAL;
  3028. BEGIN
  3029. WHILE (len > 0) DO
  3030. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3031. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3032. DEC( len );
  3033. END;
  3034. END EDivideASASLoop;
  3035. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3036. BEGIN
  3037. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3038. EDivideASASLoop );
  3039. RETURN RESULT
  3040. END "./";
  3041. (** INTEGER *)
  3042. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3043. VAR lval, rval: INTEGER; dval: REAL;
  3044. BEGIN
  3045. WHILE (len > 0) DO
  3046. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3047. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3048. DEC( len );
  3049. END;
  3050. END EDivideAIAILoop;
  3051. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3052. BEGIN
  3053. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3054. EDivideAIAILoop );
  3055. RETURN RESULT
  3056. END "./";
  3057. (** LONGINT *)
  3058. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3059. VAR lval, rval: LONGINT; dval: REAL;
  3060. BEGIN
  3061. WHILE (len > 0) DO
  3062. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3063. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3064. DEC( len );
  3065. END;
  3066. END EDivideALALLoop;
  3067. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3068. BEGIN
  3069. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3070. EDivideALALLoop );
  3071. RETURN RESULT
  3072. END "./";
  3073. (** REAL *)
  3074. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3075. VAR lval, rval: REAL; dval: REAL;
  3076. BEGIN
  3077. WHILE (len > 0) DO
  3078. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3079. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3080. DEC( len );
  3081. END;
  3082. END EDivideARARLoop;
  3083. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3084. BEGIN
  3085. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3086. EDivideARARLoop );
  3087. RETURN RESULT
  3088. END "./";
  3089. (** LONGREAL *)
  3090. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3091. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3092. BEGIN
  3093. WHILE (len > 0) DO
  3094. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3095. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3096. DEC( len );
  3097. END;
  3098. END EDivideAXAXLoop;
  3099. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3100. BEGIN
  3101. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3102. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3103. RETURN RESULT
  3104. END "./";
  3105. (** COMPLEX *)
  3106. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3107. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3108. BEGIN
  3109. WHILE (len > 0) DO
  3110. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3111. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3112. DEC( len );
  3113. END;
  3114. END EDivideAZAZLoop;
  3115. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3116. BEGIN
  3117. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3118. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3119. RETURN RESULT
  3120. END "./";
  3121. (** LONGCOMPLEX *)
  3122. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3123. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3124. BEGIN
  3125. WHILE (len > 0) DO
  3126. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3127. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3128. IF rvalIm # 0.0D0 THEN
  3129. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3130. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3131. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3132. ELSE
  3133. dvalRe := lvalRe/rvalRe;
  3134. dvalIm := lvalIm/rvalRe;
  3135. END;
  3136. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3137. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3138. DEC( len );
  3139. END;
  3140. END EDivideALZALZLoop;
  3141. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3142. BEGIN
  3143. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3144. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3145. RETURN RESULT
  3146. END "./";
  3147. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3148. (** SHORTINT *)
  3149. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3150. VAR lval, rval: SHORTINT; dval: REAL;
  3151. BEGIN
  3152. SYSTEM.GET( radr, rval );
  3153. WHILE (len > 0) DO
  3154. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3155. INC( dadr, dinc ); DEC( len );
  3156. END;
  3157. END DivideASSSLoop;
  3158. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3159. BEGIN
  3160. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3161. DivideASSSLoop );
  3162. RETURN RESULT
  3163. END "/";
  3164. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3165. VAR lval, rval: SHORTINT; dval: REAL;
  3166. BEGIN
  3167. SYSTEM.GET( radr, rval );
  3168. WHILE (len > 0) DO
  3169. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3170. INC( dadr, dinc ); DEC( len );
  3171. END;
  3172. END DivideSSASLoop;
  3173. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3174. BEGIN
  3175. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3176. DivideSSASLoop );
  3177. RETURN RESULT
  3178. END "/";
  3179. (** INTEGER *)
  3180. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3181. VAR lval, rval: INTEGER; dval: REAL;
  3182. BEGIN
  3183. SYSTEM.GET( radr, rval );
  3184. WHILE (len > 0) DO
  3185. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3186. INC( dadr, dinc ); DEC( len );
  3187. END;
  3188. END DivideAISILoop;
  3189. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3190. BEGIN
  3191. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3192. DivideAISILoop );
  3193. RETURN RESULT
  3194. END "/";
  3195. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3196. VAR lval, rval: INTEGER; dval: REAL;
  3197. BEGIN
  3198. SYSTEM.GET( radr, rval );
  3199. WHILE (len > 0) DO
  3200. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3201. INC( dadr, dinc ); DEC( len );
  3202. END;
  3203. END DivideSIAILoop;
  3204. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3205. BEGIN
  3206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3207. DivideSIAILoop );
  3208. RETURN RESULT
  3209. END "/";
  3210. (** LONGINT *)
  3211. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3212. VAR lval, rval: LONGINT; dval: REAL;
  3213. BEGIN
  3214. SYSTEM.GET( radr, rval );
  3215. WHILE (len > 0) DO
  3216. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3217. INC( dadr, dinc ); DEC( len );
  3218. END;
  3219. END DivideALSLLoop;
  3220. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3221. BEGIN
  3222. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3223. DivideALSLLoop );
  3224. RETURN RESULT
  3225. END "/";
  3226. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3227. VAR lval, rval: LONGINT; dval: REAL;
  3228. BEGIN
  3229. SYSTEM.GET( radr, rval );
  3230. WHILE (len > 0) DO
  3231. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3232. INC( dadr, dinc ); DEC( len );
  3233. END;
  3234. END DivideSLALLoop;
  3235. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3236. BEGIN
  3237. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3238. DivideSLALLoop );
  3239. RETURN RESULT
  3240. END "/";
  3241. (** REAL *)
  3242. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3243. VAR lval, rval: REAL; dval: REAL;
  3244. BEGIN
  3245. SYSTEM.GET( radr, rval );
  3246. WHILE (len > 0) DO
  3247. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3248. INC( dadr, dinc ); DEC( len );
  3249. END;
  3250. END DivideARSRLoop;
  3251. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3252. BEGIN
  3253. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3254. DivideARSRLoop );
  3255. RETURN RESULT
  3256. END "/";
  3257. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3258. VAR lval, rval: REAL; dval: REAL;
  3259. BEGIN
  3260. SYSTEM.GET( radr, rval );
  3261. WHILE (len > 0) DO
  3262. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3263. INC( dadr, dinc ); DEC( len );
  3264. END;
  3265. END DivideSRARLoop;
  3266. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3267. BEGIN
  3268. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3269. DivideSRARLoop );
  3270. RETURN RESULT
  3271. END "/";
  3272. (** LONGREAL *)
  3273. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3274. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3275. BEGIN
  3276. SYSTEM.GET( radr, rval );
  3277. WHILE (len > 0) DO
  3278. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3279. INC( dadr, dinc ); DEC( len );
  3280. END;
  3281. END DivideAXSXLoop;
  3282. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3283. BEGIN
  3284. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3285. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3286. RETURN RESULT
  3287. END "/";
  3288. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3289. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3290. BEGIN
  3291. SYSTEM.GET( radr, rval );
  3292. WHILE (len > 0) DO
  3293. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3294. INC( dadr, dinc ); DEC( len );
  3295. END;
  3296. END DivideSXAXLoop;
  3297. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3298. BEGIN
  3299. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3300. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3301. RETURN RESULT
  3302. END "/";
  3303. (** COMPLEX *)
  3304. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3305. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3306. BEGIN
  3307. SYSTEM.GET( radr, rval );
  3308. WHILE (len > 0) DO
  3309. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3310. INC( dadr, dinc ); DEC( len );
  3311. END;
  3312. END DivideAZSZLoop;
  3313. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3314. BEGIN
  3315. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3316. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3317. RETURN RESULT
  3318. END "/";
  3319. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3320. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3321. BEGIN
  3322. SYSTEM.GET( radr, rval );
  3323. WHILE (len > 0) DO
  3324. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3325. INC( dadr, dinc ); DEC( len );
  3326. END;
  3327. END DivideSZAZLoop;
  3328. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3329. BEGIN
  3330. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3331. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3332. RETURN RESULT
  3333. END "/";
  3334. (** LONGCOMPLEX *)
  3335. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3336. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3337. BEGIN
  3338. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3339. IF rvalIm # 0.0D0 THEN
  3340. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3341. WHILE (len > 0) DO
  3342. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3343. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3344. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3345. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3346. INC( ladr, linc );
  3347. INC( dadr, dinc ); DEC( len );
  3348. END;
  3349. ELSE
  3350. WHILE (len > 0) DO
  3351. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3352. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3353. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3354. INC( ladr, linc );
  3355. INC( dadr, dinc ); DEC( len );
  3356. END;
  3357. END;
  3358. END DivideALZSLZLoop;
  3359. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3360. BEGIN
  3361. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3362. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3363. RETURN RESULT
  3364. END "/";
  3365. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3366. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3367. BEGIN
  3368. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3369. WHILE (len > 0) DO
  3370. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3371. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3372. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3373. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3374. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3375. INC( ladr, linc );
  3376. INC( dadr, dinc ); DEC( len );
  3377. END;
  3378. END DivideSLZALZLoop;
  3379. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3380. BEGIN
  3381. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3382. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3383. RETURN RESULT
  3384. END "/";
  3385. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3386. (** SHORTINT *)
  3387. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3388. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3389. BEGIN
  3390. WHILE (len > 0) DO
  3391. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3392. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3393. DEC( len );
  3394. END;
  3395. END EDivASASLoop;
  3396. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3397. BEGIN
  3398. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3399. SIZEOF( SHORTINT ), EDivASASLoop );
  3400. RETURN RESULT
  3401. END "DIV";
  3402. (** INTEGER *)
  3403. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3404. VAR lval, rval: INTEGER; dval: INTEGER;
  3405. BEGIN
  3406. WHILE (len > 0) DO
  3407. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3408. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3409. DEC( len );
  3410. END;
  3411. END EDivAIAILoop;
  3412. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3413. BEGIN
  3414. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3415. SIZEOF( INTEGER ), EDivAIAILoop );
  3416. RETURN RESULT
  3417. END "DIV";
  3418. (** LONGINT *)
  3419. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3420. VAR lval, rval: LONGINT; dval: LONGINT;
  3421. BEGIN
  3422. WHILE (len > 0) DO
  3423. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3424. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3425. DEC( len );
  3426. END;
  3427. END EDivALALLoop;
  3428. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3429. BEGIN
  3430. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3431. SIZEOF( LONGINT ), EDivALALLoop );
  3432. RETURN RESULT
  3433. END "DIV";
  3434. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3435. (** SHORTINT *)
  3436. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3437. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3438. BEGIN
  3439. SYSTEM.GET( radr, rval );
  3440. WHILE (len > 0) DO
  3441. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3442. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3443. END;
  3444. END DivASSSLoop;
  3445. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3446. BEGIN
  3447. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3448. SIZEOF( SHORTINT ), DivASSSLoop );
  3449. RETURN RESULT
  3450. END "DIV";
  3451. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3452. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3453. BEGIN
  3454. SYSTEM.GET( radr, rval );
  3455. WHILE (len > 0) DO
  3456. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3457. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3458. END;
  3459. END DivSSASLoop;
  3460. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3461. BEGIN
  3462. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3463. SIZEOF( SHORTINT ), DivSSASLoop );
  3464. RETURN RESULT
  3465. END "DIV";
  3466. (** INTEGER *)
  3467. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3468. VAR lval, rval: INTEGER; dval: INTEGER;
  3469. BEGIN
  3470. SYSTEM.GET( radr, rval );
  3471. WHILE (len > 0) DO
  3472. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3473. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3474. END;
  3475. END DivAISILoop;
  3476. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3477. BEGIN
  3478. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3479. SIZEOF( INTEGER ), DivAISILoop );
  3480. RETURN RESULT
  3481. END "DIV";
  3482. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3483. VAR lval, rval: INTEGER; dval: INTEGER;
  3484. BEGIN
  3485. SYSTEM.GET( radr, rval );
  3486. WHILE (len > 0) DO
  3487. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3488. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3489. END;
  3490. END DivSIAILoop;
  3491. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3492. BEGIN
  3493. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3494. SIZEOF( INTEGER ), DivSIAILoop );
  3495. RETURN RESULT
  3496. END "DIV";
  3497. (** LONGINT *)
  3498. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3499. VAR lval, rval: LONGINT; dval: LONGINT;
  3500. BEGIN
  3501. SYSTEM.GET( radr, rval );
  3502. WHILE (len > 0) DO
  3503. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3504. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3505. END;
  3506. END DivALSLLoop;
  3507. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3508. BEGIN
  3509. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3510. SIZEOF( LONGINT ), DivALSLLoop );
  3511. RETURN RESULT
  3512. END "DIV";
  3513. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3514. VAR lval, rval: LONGINT; dval: LONGINT;
  3515. BEGIN
  3516. SYSTEM.GET( radr, rval );
  3517. WHILE (len > 0) DO
  3518. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3519. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3520. END;
  3521. END DivSLALLoop;
  3522. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3523. BEGIN
  3524. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3525. SIZEOF( LONGINT ), DivSLALLoop );
  3526. RETURN RESULT
  3527. END "DIV";
  3528. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3529. (** SHORTINT *)
  3530. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3531. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3532. BEGIN
  3533. WHILE (len > 0) DO
  3534. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3535. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3536. DEC( len );
  3537. END;
  3538. END EModASASLoop;
  3539. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3540. BEGIN
  3541. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3542. SIZEOF( SHORTINT ), EModASASLoop );
  3543. RETURN RESULT
  3544. END "MOD";
  3545. (** INTEGER *)
  3546. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3547. VAR lval, rval: INTEGER; dval: INTEGER;
  3548. BEGIN
  3549. WHILE (len > 0) DO
  3550. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3551. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3552. DEC( len );
  3553. END;
  3554. END EModAIAILoop;
  3555. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3556. BEGIN
  3557. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3558. SIZEOF( INTEGER ), EModAIAILoop );
  3559. RETURN RESULT
  3560. END "MOD";
  3561. (** LONGINT *)
  3562. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3563. VAR lval, rval: LONGINT; dval: LONGINT;
  3564. BEGIN
  3565. WHILE (len > 0) DO
  3566. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3567. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3568. DEC( len );
  3569. END;
  3570. END EModALALLoop;
  3571. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3572. BEGIN
  3573. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3574. SIZEOF( LONGINT ), EModALALLoop );
  3575. RETURN RESULT
  3576. END "MOD";
  3577. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3578. (** SHORTINT *)
  3579. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3580. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3581. BEGIN
  3582. SYSTEM.GET( radr, rval );
  3583. WHILE (len > 0) DO
  3584. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3585. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3586. END;
  3587. END ModASSSLoop;
  3588. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3589. BEGIN
  3590. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3591. SIZEOF( SHORTINT ), ModASSSLoop );
  3592. RETURN RESULT
  3593. END "MOD";
  3594. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3595. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3596. BEGIN
  3597. SYSTEM.GET( radr, rval );
  3598. WHILE (len > 0) DO
  3599. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3600. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3601. END;
  3602. END ModSSASLoop;
  3603. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3604. BEGIN
  3605. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3606. SIZEOF( SHORTINT ), ModSSASLoop );
  3607. RETURN RESULT
  3608. END "MOD";
  3609. (** INTEGER *)
  3610. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3611. VAR lval, rval: INTEGER; dval: INTEGER;
  3612. BEGIN
  3613. SYSTEM.GET( radr, rval );
  3614. WHILE (len > 0) DO
  3615. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3616. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3617. END;
  3618. END ModAISILoop;
  3619. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3620. BEGIN
  3621. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3622. SIZEOF( INTEGER ), ModAISILoop );
  3623. RETURN RESULT
  3624. END "MOD";
  3625. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3626. VAR lval, rval: INTEGER; dval: INTEGER;
  3627. BEGIN
  3628. SYSTEM.GET( radr, rval );
  3629. WHILE (len > 0) DO
  3630. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3631. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3632. END;
  3633. END ModSIAILoop;
  3634. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3635. BEGIN
  3636. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3637. SIZEOF( INTEGER ), ModSIAILoop );
  3638. RETURN RESULT
  3639. END "MOD";
  3640. (** LONGINT *)
  3641. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3642. VAR lval, rval: LONGINT; dval: LONGINT;
  3643. BEGIN
  3644. SYSTEM.GET( radr, rval );
  3645. WHILE (len > 0) DO
  3646. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3647. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3648. END;
  3649. END ModALSLLoop;
  3650. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3651. BEGIN
  3652. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3653. SIZEOF( LONGINT ), ModALSLLoop );
  3654. RETURN RESULT
  3655. END "MOD";
  3656. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3657. VAR lval, rval: LONGINT; dval: LONGINT;
  3658. BEGIN
  3659. SYSTEM.GET( radr, rval );
  3660. WHILE (len > 0) DO
  3661. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3662. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3663. END;
  3664. END ModSLALLoop;
  3665. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3666. BEGIN
  3667. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3668. SIZEOF( LONGINT ), ModSLALLoop );
  3669. RETURN RESULT
  3670. END "MOD";
  3671. (*** scalar product <array,array> -> scalar ********************************************************************)
  3672. (** SHORTINT *)
  3673. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3674. VAR lval, rval: SHORTINT; dval: LONGINT;
  3675. BEGIN
  3676. SYSTEM.GET( dadr, dval );
  3677. WHILE (len > 0) DO
  3678. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3679. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3680. END;
  3681. SYSTEM.PUT( dadr, dval );
  3682. END SPASASLoop;
  3683. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3684. VAR dest: LONGINT;
  3685. BEGIN
  3686. dest := 0;
  3687. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3688. RETURN dest;
  3689. END "+*";
  3690. (** INTEGER *)
  3691. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3692. VAR lval, rval: INTEGER; dval: LONGINT;
  3693. BEGIN
  3694. SYSTEM.GET( dadr, dval );
  3695. WHILE (len > 0) DO
  3696. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3697. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3698. END;
  3699. SYSTEM.PUT( dadr, dval );
  3700. END SPAIAILoop;
  3701. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3702. VAR dest: LONGINT;
  3703. BEGIN
  3704. dest := 0;
  3705. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3706. RETURN dest;
  3707. END "+*";
  3708. (** LONGINT *)
  3709. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3710. VAR lval, rval: LONGINT; dval: LONGINT;
  3711. BEGIN
  3712. SYSTEM.GET( dadr, dval );
  3713. WHILE (len > 0) DO
  3714. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3715. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3716. END;
  3717. SYSTEM.PUT( dadr, dval );
  3718. END SPALALLoop;
  3719. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3720. VAR dest: LONGINT;
  3721. BEGIN
  3722. dest := 0;
  3723. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3724. RETURN dest;
  3725. END "+*";
  3726. (** REAL *)
  3727. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3728. VAR lval, rval: REAL; dval: REAL;
  3729. BEGIN
  3730. SYSTEM.GET( dadr, dval );
  3731. WHILE (len > 0) DO
  3732. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3733. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3734. END;
  3735. SYSTEM.PUT( dadr, dval );
  3736. END SPARARLoop;
  3737. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3738. VAR dest: REAL;
  3739. BEGIN
  3740. dest := 0;
  3741. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3742. RETURN dest;
  3743. END "+*";
  3744. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3745. VAR lval, rval, dval: LONGREAL;
  3746. BEGIN
  3747. IF debug THEN
  3748. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3749. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3750. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3751. END;
  3752. SYSTEM.GET( dadr, dval );
  3753. WHILE (len > 0) DO
  3754. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3755. dval := dval + rval * lval; DEC( len );
  3756. END;
  3757. SYSTEM.PUT( dadr, dval );
  3758. END SPAXAXLoop;
  3759. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3760. VAR dest: LONGREAL;
  3761. BEGIN
  3762. dest := 0;
  3763. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3764. RETURN dest;
  3765. END "+*";
  3766. (** COMPLEX *)
  3767. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3768. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3769. BEGIN
  3770. SYSTEM.GET( dadr, dval );
  3771. WHILE (len > 0) DO
  3772. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3773. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3774. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3775. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3776. END;
  3777. SYSTEM.PUT( dadr, dval );
  3778. END SPAZAZLoop;
  3779. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3780. VAR dest: COMPLEX;
  3781. BEGIN
  3782. dest := 0;
  3783. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3784. RETURN dest;
  3785. END "+*";
  3786. (** COMPLEX *)
  3787. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3788. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3789. BEGIN
  3790. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3791. WHILE (len > 0) DO
  3792. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3793. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3794. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3795. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3796. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3797. END;
  3798. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3799. END SPALZALZLoop;
  3800. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3801. VAR dest: LONGCOMPLEX;
  3802. BEGIN
  3803. dest := 0;
  3804. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3805. RETURN dest;
  3806. END "+*";
  3807. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3808. (** BOOLEAN *)
  3809. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3810. VAR lval, rval: BOOLEAN;
  3811. BEGIN
  3812. WHILE (len > 0) DO
  3813. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3814. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3815. END;
  3816. END EEqlABABLoop;
  3817. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3818. BEGIN
  3819. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3820. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3821. RETURN RESULT
  3822. END ".=";
  3823. (** SHORTINT *)
  3824. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3825. VAR lval, rval: SHORTINT;
  3826. BEGIN
  3827. WHILE (len > 0) DO
  3828. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3829. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3830. END;
  3831. END EEqlASASLoop;
  3832. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3833. BEGIN
  3834. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3835. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3836. RETURN RESULT
  3837. END ".=";
  3838. (** INTEGER *)
  3839. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3840. VAR lval, rval: INTEGER;
  3841. BEGIN
  3842. WHILE (len > 0) DO
  3843. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3844. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3845. END;
  3846. END EEqlAIAILoop;
  3847. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3848. BEGIN
  3849. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3850. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3851. RETURN RESULT
  3852. END ".=";
  3853. (** LONGINT *)
  3854. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3855. VAR lval, rval: LONGINT;
  3856. BEGIN
  3857. WHILE (len > 0) DO
  3858. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3859. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3860. END;
  3861. END EEqlALALLoop;
  3862. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3863. BEGIN
  3864. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3865. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3866. RETURN RESULT
  3867. END ".=";
  3868. (** REAL *)
  3869. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3870. VAR lval, rval: REAL;
  3871. BEGIN
  3872. WHILE (len > 0) DO
  3873. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3874. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3875. END;
  3876. END EEqlARARLoop;
  3877. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3878. BEGIN
  3879. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3880. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3881. RETURN RESULT
  3882. END ".=";
  3883. (** LONGREAL *)
  3884. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3885. VAR lval, rval: LONGREAL;
  3886. BEGIN
  3887. WHILE (len > 0) DO
  3888. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3889. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3890. END;
  3891. END EEqlAXAXLoop;
  3892. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3893. BEGIN
  3894. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3895. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3896. RETURN RESULT
  3897. END ".=";
  3898. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3899. (** BOOLEAN *)
  3900. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3901. VAR lval, rval: BOOLEAN;
  3902. BEGIN
  3903. SYSTEM.GET( radr, rval );
  3904. WHILE (len > 0) DO
  3905. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3906. INC( dadr, dinc ); DEC( len );
  3907. END;
  3908. END EEqlABSBLoop;
  3909. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3910. BEGIN
  3911. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3912. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3913. RETURN RESULT
  3914. END ".=";
  3915. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3916. BEGIN
  3917. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3918. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3919. RETURN RESULT
  3920. END ".=";
  3921. (** SHORTINT *)
  3922. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3923. VAR lval, rval: SHORTINT;
  3924. BEGIN
  3925. SYSTEM.GET( radr, rval );
  3926. WHILE (len > 0) DO
  3927. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3928. INC( dadr, dinc ); DEC( len );
  3929. END;
  3930. END EEqlASSSLoop;
  3931. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3932. BEGIN
  3933. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3934. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3935. RETURN RESULT
  3936. END ".=";
  3937. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3938. BEGIN
  3939. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3940. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3941. RETURN RESULT
  3942. END ".=";
  3943. (** INTEGER *)
  3944. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3945. VAR lval, rval: INTEGER;
  3946. BEGIN
  3947. SYSTEM.GET( radr, rval );
  3948. WHILE (len > 0) DO
  3949. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3950. INC( dadr, dinc ); DEC( len );
  3951. END;
  3952. END EEqlAISILoop;
  3953. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3954. BEGIN
  3955. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3956. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3957. RETURN RESULT
  3958. END ".=";
  3959. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3960. BEGIN
  3961. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3962. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3963. RETURN RESULT
  3964. END ".=";
  3965. (** LONGINT *)
  3966. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3967. VAR lval, rval: LONGINT;
  3968. BEGIN
  3969. SYSTEM.GET( radr, rval );
  3970. WHILE (len > 0) DO
  3971. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3972. INC( dadr, dinc ); DEC( len );
  3973. END;
  3974. END EEqlALSLLoop;
  3975. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3976. BEGIN
  3977. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3978. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3979. RETURN RESULT
  3980. END ".=";
  3981. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  3982. BEGIN
  3983. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3984. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3985. RETURN RESULT
  3986. END ".=";
  3987. (** REAL *)
  3988. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3989. VAR lval, rval: REAL;
  3990. BEGIN
  3991. SYSTEM.GET( radr, rval );
  3992. WHILE (len > 0) DO
  3993. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3994. INC( dadr, dinc ); DEC( len );
  3995. END;
  3996. END EEqlARSRLoop;
  3997. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  3998. BEGIN
  3999. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4000. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4001. RETURN RESULT
  4002. END ".=";
  4003. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4004. BEGIN
  4005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4006. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4007. RETURN RESULT
  4008. END ".=";
  4009. (** LONGREAL *)
  4010. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4011. VAR lval, rval: LONGREAL;
  4012. BEGIN
  4013. SYSTEM.GET( radr, rval );
  4014. WHILE (len > 0) DO
  4015. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4016. INC( dadr, dinc ); DEC( len );
  4017. END;
  4018. END EEqlAXSXLoop;
  4019. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4020. BEGIN
  4021. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4022. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4023. RETURN RESULT
  4024. END ".=";
  4025. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4026. BEGIN
  4027. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4028. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4029. RETURN RESULT
  4030. END ".=";
  4031. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4032. (** BOOLEAN *)
  4033. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4034. VAR lval, rval: BOOLEAN;
  4035. BEGIN
  4036. WHILE (len > 0) DO
  4037. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4038. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4039. END;
  4040. END ENeqABABLoop;
  4041. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4042. BEGIN
  4043. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4044. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4045. RETURN RESULT
  4046. END ".#";
  4047. (** SHORTINT *)
  4048. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4049. VAR lval, rval: SHORTINT;
  4050. BEGIN
  4051. WHILE (len > 0) DO
  4052. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4053. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4054. END;
  4055. END ENeqASASLoop;
  4056. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4057. BEGIN
  4058. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4059. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4060. RETURN RESULT
  4061. END ".#";
  4062. (** INTEGER*)
  4063. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4064. VAR lval, rval: INTEGER;
  4065. BEGIN
  4066. WHILE (len > 0) DO
  4067. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4068. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4069. END;
  4070. END ENeqAIAILoop;
  4071. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4072. BEGIN
  4073. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4074. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4075. RETURN RESULT
  4076. END ".#";
  4077. (** LONGINT*)
  4078. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4079. VAR lval, rval: LONGINT;
  4080. BEGIN
  4081. WHILE (len > 0) DO
  4082. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4083. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4084. END;
  4085. END ENeqALALLoop;
  4086. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4087. BEGIN
  4088. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4089. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4090. RETURN RESULT
  4091. END ".#";
  4092. (** REAL *)
  4093. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4094. VAR lval, rval: REAL;
  4095. BEGIN
  4096. WHILE (len > 0) DO
  4097. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4098. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4099. END;
  4100. END ENeqARARLoop;
  4101. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4102. BEGIN
  4103. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4104. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4105. RETURN RESULT
  4106. END ".#";
  4107. (** LONGREAL *)
  4108. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4109. VAR lval, rval: LONGREAL;
  4110. BEGIN
  4111. WHILE (len > 0) DO
  4112. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4113. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4114. END;
  4115. END ENeqAXAXLoop;
  4116. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4117. BEGIN
  4118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4119. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4120. RETURN RESULT
  4121. END ".#";
  4122. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4123. (** BOOLEAN *)
  4124. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4125. VAR lval, rval: BOOLEAN;
  4126. BEGIN
  4127. SYSTEM.GET( radr, rval );
  4128. WHILE (len > 0) DO
  4129. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4130. INC( dadr, dinc ); DEC( len );
  4131. END;
  4132. END ENeqABSBLoop;
  4133. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4134. BEGIN
  4135. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4136. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4137. RETURN RESULT
  4138. END ".#";
  4139. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4140. BEGIN
  4141. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4142. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4143. RETURN RESULT
  4144. END ".#";
  4145. (** SHORTINT *)
  4146. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4147. VAR lval, rval: SHORTINT;
  4148. BEGIN
  4149. SYSTEM.GET( radr, rval );
  4150. WHILE (len > 0) DO
  4151. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4152. INC( dadr, dinc ); DEC( len );
  4153. END;
  4154. END ENeqASSSLoop;
  4155. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4156. BEGIN
  4157. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4158. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4159. RETURN RESULT
  4160. END ".#";
  4161. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4162. BEGIN
  4163. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4164. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4165. RETURN RESULT
  4166. END ".#";
  4167. (** INTEGER *)
  4168. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4169. VAR lval, rval: INTEGER;
  4170. BEGIN
  4171. SYSTEM.GET( radr, rval );
  4172. WHILE (len > 0) DO
  4173. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4174. INC( dadr, dinc ); DEC( len );
  4175. END;
  4176. END ENeqAISILoop;
  4177. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4178. BEGIN
  4179. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4180. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4181. RETURN RESULT
  4182. END ".#";
  4183. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4184. BEGIN
  4185. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4186. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4187. RETURN RESULT
  4188. END ".#";
  4189. (** LONGINT *)
  4190. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4191. VAR lval, rval: LONGINT;
  4192. BEGIN
  4193. SYSTEM.GET( radr, rval );
  4194. WHILE (len > 0) DO
  4195. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4196. INC( dadr, dinc ); DEC( len );
  4197. END;
  4198. END ENeqALSLLoop;
  4199. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4200. BEGIN
  4201. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4202. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4203. RETURN RESULT
  4204. END ".#";
  4205. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4206. BEGIN
  4207. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4208. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4209. RETURN RESULT
  4210. END ".#";
  4211. (** REAL *)
  4212. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4213. VAR lval, rval: REAL;
  4214. BEGIN
  4215. SYSTEM.GET( radr, rval );
  4216. WHILE (len > 0) DO
  4217. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4218. INC( dadr, dinc ); DEC( len );
  4219. END;
  4220. END ENeqARSRLoop;
  4221. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4222. BEGIN
  4223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4224. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4225. RETURN RESULT
  4226. END ".#";
  4227. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4228. BEGIN
  4229. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4230. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4231. RETURN RESULT
  4232. END ".#";
  4233. (** LONGREAL *)
  4234. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4235. VAR lval, rval: LONGREAL;
  4236. BEGIN
  4237. SYSTEM.GET( radr, rval );
  4238. WHILE (len > 0) DO
  4239. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4240. INC( dadr, dinc ); DEC( len );
  4241. END;
  4242. END ENeqAXSXLoop;
  4243. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4244. BEGIN
  4245. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4246. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4247. RETURN RESULT
  4248. END ".#";
  4249. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4250. BEGIN
  4251. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4252. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4253. RETURN RESULT
  4254. END ".#";
  4255. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4256. (** SHORTINT *)
  4257. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4258. VAR lval, rval: SHORTINT;
  4259. BEGIN
  4260. WHILE (len > 0) DO
  4261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4262. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4263. END;
  4264. END EGtrASASLoop;
  4265. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4266. BEGIN
  4267. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4268. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4269. RETURN RESULT
  4270. END ".>";
  4271. (** INTEGER *)
  4272. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4273. VAR lval, rval: INTEGER;
  4274. BEGIN
  4275. WHILE (len > 0) DO
  4276. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4277. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4278. END;
  4279. END EGtrAIAILoop;
  4280. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4281. BEGIN
  4282. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4283. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4284. RETURN RESULT
  4285. END ".>";
  4286. (** LONGINT *)
  4287. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4288. VAR lval, rval: LONGINT;
  4289. BEGIN
  4290. WHILE (len > 0) DO
  4291. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4292. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4293. END;
  4294. END EGtrALALLoop;
  4295. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4296. BEGIN
  4297. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4298. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4299. RETURN RESULT
  4300. END ".>";
  4301. (** REAL *)
  4302. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4303. VAR lval, rval: REAL;
  4304. BEGIN
  4305. WHILE (len > 0) DO
  4306. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4307. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4308. END;
  4309. END EGtrARARLoop;
  4310. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4311. BEGIN
  4312. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4313. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4314. RETURN RESULT
  4315. END ".>";
  4316. (** LONGREAL *)
  4317. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4318. VAR lval, rval: LONGREAL;
  4319. BEGIN
  4320. WHILE (len > 0) DO
  4321. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4322. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4323. END;
  4324. END EGtrAXAXLoop;
  4325. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4326. BEGIN
  4327. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4328. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4329. RETURN RESULT
  4330. END ".>";
  4331. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4332. (** SHORTINT *)
  4333. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4334. VAR lval, rval: SHORTINT;
  4335. BEGIN
  4336. SYSTEM.GET( radr, rval );
  4337. WHILE (len > 0) DO
  4338. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4339. INC( dadr, dinc ); DEC( len );
  4340. END;
  4341. END EGtrASSSLoop;
  4342. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4343. BEGIN
  4344. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4345. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4346. RETURN RESULT
  4347. END ".>";
  4348. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4349. BEGIN
  4350. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4351. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4352. RETURN RESULT
  4353. END ".<";
  4354. (** INTEGER *)
  4355. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4356. VAR lval, rval: INTEGER;
  4357. BEGIN
  4358. SYSTEM.GET( radr, rval );
  4359. WHILE (len > 0) DO
  4360. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4361. INC( dadr, dinc ); DEC( len );
  4362. END;
  4363. END EGtrAISILoop;
  4364. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4365. BEGIN
  4366. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4367. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4368. RETURN RESULT
  4369. END ".>";
  4370. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4371. BEGIN
  4372. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4373. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4374. RETURN RESULT
  4375. END ".<";
  4376. (** LONGINT *)
  4377. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4378. VAR lval, rval: LONGINT;
  4379. BEGIN
  4380. SYSTEM.GET( radr, rval );
  4381. WHILE (len > 0) DO
  4382. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4383. INC( dadr, dinc ); DEC( len );
  4384. END;
  4385. END EGtrALSLLoop;
  4386. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4387. BEGIN
  4388. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4389. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4390. RETURN RESULT
  4391. END ".>";
  4392. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4393. BEGIN
  4394. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4395. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4396. RETURN RESULT
  4397. END ".<";
  4398. (** REAL *)
  4399. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4400. VAR lval, rval: REAL;
  4401. BEGIN
  4402. SYSTEM.GET( radr, rval );
  4403. WHILE (len > 0) DO
  4404. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4405. INC( dadr, dinc ); DEC( len );
  4406. END;
  4407. END EGtrARSRLoop;
  4408. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4409. BEGIN
  4410. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4411. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4412. RETURN RESULT
  4413. END ".>";
  4414. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4415. BEGIN
  4416. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4417. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4418. RETURN RESULT
  4419. END ".<";
  4420. (** LONGREAL *)
  4421. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4422. VAR lval, rval: LONGREAL;
  4423. BEGIN
  4424. SYSTEM.GET( radr, rval );
  4425. WHILE (len > 0) DO
  4426. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4427. INC( dadr, dinc ); DEC( len );
  4428. END;
  4429. END EGtrAXSXLoop;
  4430. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4431. BEGIN
  4432. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4433. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4434. RETURN RESULT
  4435. END ".>";
  4436. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4437. BEGIN
  4438. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4439. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4440. RETURN RESULT
  4441. END ".<";
  4442. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4443. (** SHORTINT *)
  4444. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4445. VAR lval, rval: SHORTINT;
  4446. BEGIN
  4447. WHILE (len > 0) DO
  4448. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4449. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4450. END;
  4451. END EGeqASASLoop;
  4452. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4453. BEGIN
  4454. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4455. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4456. RETURN RESULT
  4457. END ".>=";
  4458. (** INTEGER *)
  4459. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4460. VAR lval, rval: INTEGER;
  4461. BEGIN
  4462. WHILE (len > 0) DO
  4463. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4464. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4465. END;
  4466. END EGeqAIAILoop;
  4467. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4468. BEGIN
  4469. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4470. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4471. RETURN RESULT
  4472. END ".>=";
  4473. (** LONGINT *)
  4474. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4475. VAR lval, rval: LONGINT;
  4476. BEGIN
  4477. WHILE (len > 0) DO
  4478. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4479. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4480. END;
  4481. END EGeqALALLoop;
  4482. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4483. BEGIN
  4484. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4485. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4486. RETURN RESULT
  4487. END ".>=";
  4488. (** REAL *)
  4489. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4490. VAR lval, rval: REAL;
  4491. BEGIN
  4492. WHILE (len > 0) DO
  4493. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4494. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4495. END;
  4496. END EGeqARARLoop;
  4497. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4498. BEGIN
  4499. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4500. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4501. RETURN RESULT
  4502. END ".>=";
  4503. (** LONGREAL *)
  4504. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4505. VAR lval, rval: LONGREAL;
  4506. BEGIN
  4507. WHILE (len > 0) DO
  4508. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4509. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4510. END;
  4511. END EGeqAXAXLoop;
  4512. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4513. BEGIN
  4514. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4515. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4516. RETURN RESULT
  4517. END ".>=";
  4518. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4519. (** SHORTINT *)
  4520. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4521. VAR lval, rval: SHORTINT;
  4522. BEGIN
  4523. SYSTEM.GET( radr, rval );
  4524. WHILE (len > 0) DO
  4525. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4526. INC( dadr, dinc ); DEC( len );
  4527. END;
  4528. END EGeqASSSLoop;
  4529. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4530. BEGIN
  4531. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4532. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4533. RETURN RESULT
  4534. END ".>=";
  4535. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4536. BEGIN
  4537. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4538. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4539. RETURN RESULT
  4540. END ".<=";
  4541. (** INTEGER *)
  4542. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4543. VAR lval, rval: INTEGER;
  4544. BEGIN
  4545. SYSTEM.GET( radr, rval );
  4546. WHILE (len > 0) DO
  4547. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4548. INC( dadr, dinc ); DEC( len );
  4549. END;
  4550. END EGeqAISILoop;
  4551. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4552. BEGIN
  4553. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4554. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4555. RETURN RESULT
  4556. END ".>=";
  4557. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4558. BEGIN
  4559. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4560. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4561. RETURN RESULT
  4562. END ".<=";
  4563. (** LONGINT *)
  4564. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4565. VAR lval, rval: LONGINT;
  4566. BEGIN
  4567. SYSTEM.GET( radr, rval );
  4568. WHILE (len > 0) DO
  4569. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4570. INC( dadr, dinc ); DEC( len );
  4571. END;
  4572. END EGeqALSLLoop;
  4573. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4574. BEGIN
  4575. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4576. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4577. RETURN RESULT
  4578. END ".>=";
  4579. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4580. BEGIN
  4581. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4582. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4583. RETURN RESULT
  4584. END ".<=";
  4585. (** REAL *)
  4586. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4587. VAR lval, rval: REAL;
  4588. BEGIN
  4589. SYSTEM.GET( radr, rval );
  4590. WHILE (len > 0) DO
  4591. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4592. INC( dadr, dinc ); DEC( len );
  4593. END;
  4594. END EGeqARSRLoop;
  4595. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4596. BEGIN
  4597. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4598. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4599. RETURN RESULT
  4600. END ".>=";
  4601. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4602. BEGIN
  4603. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4604. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4605. RETURN RESULT
  4606. END ".<=";
  4607. (** LONGREAL *)
  4608. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4609. VAR lval, rval: LONGREAL;
  4610. BEGIN
  4611. SYSTEM.GET( radr, rval );
  4612. WHILE (len > 0) DO
  4613. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4614. INC( dadr, dinc ); DEC( len );
  4615. END;
  4616. END EGeqAXSXLoop;
  4617. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4618. BEGIN
  4619. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4620. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4621. RETURN RESULT
  4622. END ".>=";
  4623. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4624. BEGIN
  4625. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4626. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4627. RETURN RESULT
  4628. END ".<=";
  4629. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4630. (** SHORTINT *)
  4631. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4632. VAR lval, rval: SHORTINT;
  4633. BEGIN
  4634. WHILE (len > 0) DO
  4635. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4636. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4637. END;
  4638. END ELssASASLoop;
  4639. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4640. BEGIN
  4641. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4642. SIZEOF( BOOLEAN ), ELssASASLoop );
  4643. RETURN RESULT
  4644. END ".<";
  4645. (** INTEGER *)
  4646. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4647. VAR lval, rval: INTEGER;
  4648. BEGIN
  4649. WHILE (len > 0) DO
  4650. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4651. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4652. END;
  4653. END ELssAIAILoop;
  4654. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4655. BEGIN
  4656. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4657. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4658. RETURN RESULT
  4659. END ".<";
  4660. (** LONGINT*)
  4661. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4662. VAR lval, rval: LONGINT;
  4663. BEGIN
  4664. WHILE (len > 0) DO
  4665. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4666. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4667. END;
  4668. END ELssALALLoop;
  4669. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4670. BEGIN
  4671. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4672. SIZEOF( BOOLEAN ), ELssALALLoop );
  4673. RETURN RESULT
  4674. END ".<";
  4675. (** REAL *)
  4676. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4677. VAR lval, rval: REAL;
  4678. BEGIN
  4679. WHILE (len > 0) DO
  4680. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4681. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4682. END;
  4683. END ELssARARLoop;
  4684. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4685. BEGIN
  4686. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4687. SIZEOF( BOOLEAN ), ELssARARLoop );
  4688. RETURN RESULT
  4689. END ".<";
  4690. (** LONGREAL *)
  4691. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4692. VAR lval, rval: LONGREAL;
  4693. BEGIN
  4694. WHILE (len > 0) DO
  4695. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4696. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4697. END;
  4698. END ELssAXAXLoop;
  4699. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4700. BEGIN
  4701. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4702. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4703. RETURN RESULT
  4704. END ".<";
  4705. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4706. (** SHORTINT *)
  4707. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4708. VAR lval, rval: SHORTINT;
  4709. BEGIN
  4710. SYSTEM.GET( radr, rval );
  4711. WHILE (len > 0) DO
  4712. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4713. INC( dadr, dinc ); DEC( len );
  4714. END;
  4715. END ELssASSSLoop;
  4716. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4717. BEGIN
  4718. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4719. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4720. RETURN RESULT
  4721. END ".<";
  4722. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4723. BEGIN
  4724. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4725. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4726. RETURN RESULT
  4727. END ".>";
  4728. (** INTEGER *)
  4729. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4730. VAR lval, rval: INTEGER;
  4731. BEGIN
  4732. SYSTEM.GET( radr, rval );
  4733. WHILE (len > 0) DO
  4734. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4735. INC( dadr, dinc ); DEC( len );
  4736. END;
  4737. END ELssAISILoop;
  4738. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4739. BEGIN
  4740. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4741. SIZEOF( BOOLEAN ), ELssAISILoop );
  4742. RETURN RESULT
  4743. END ".<";
  4744. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4745. BEGIN
  4746. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4747. SIZEOF( BOOLEAN ), ELssAISILoop );
  4748. RETURN RESULT
  4749. END ".>";
  4750. (** LONGINT *)
  4751. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4752. VAR lval, rval: LONGINT;
  4753. BEGIN
  4754. SYSTEM.GET( radr, rval );
  4755. WHILE (len > 0) DO
  4756. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4757. INC( dadr, dinc ); DEC( len );
  4758. END;
  4759. END ELssALSLLoop;
  4760. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4761. BEGIN
  4762. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4763. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4764. RETURN RESULT
  4765. END ".<";
  4766. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4767. BEGIN
  4768. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4769. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4770. RETURN RESULT
  4771. END ".>";
  4772. (** REAL *)
  4773. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4774. VAR lval, rval: REAL;
  4775. BEGIN
  4776. SYSTEM.GET( radr, rval );
  4777. WHILE (len > 0) DO
  4778. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4779. INC( dadr, dinc ); DEC( len );
  4780. END;
  4781. END ELssARSRLoop;
  4782. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4783. BEGIN
  4784. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4785. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4786. RETURN RESULT
  4787. END ".<";
  4788. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4789. BEGIN
  4790. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4791. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4792. RETURN RESULT
  4793. END ".>";
  4794. (** LONGREAL *)
  4795. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4796. VAR lval, rval: LONGREAL;
  4797. BEGIN
  4798. SYSTEM.GET( radr, rval );
  4799. WHILE (len > 0) DO
  4800. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4801. INC( dadr, dinc ); DEC( len );
  4802. END;
  4803. END ELssAXSXLoop;
  4804. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4805. BEGIN
  4806. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4807. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4808. RETURN RESULT
  4809. END ".<";
  4810. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4811. BEGIN
  4812. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4813. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4814. RETURN RESULT
  4815. END ".>";
  4816. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4817. (** SHORTINT *)
  4818. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4819. VAR lval, rval: SHORTINT;
  4820. BEGIN
  4821. WHILE (len > 0) DO
  4822. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4823. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4824. END;
  4825. END ELeqASASLoop;
  4826. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4827. BEGIN
  4828. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4829. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4830. RETURN RESULT
  4831. END ".<=";
  4832. (** INTEGER *)
  4833. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4834. VAR lval, rval: INTEGER;
  4835. BEGIN
  4836. WHILE (len > 0) DO
  4837. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4838. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4839. END;
  4840. END ELeqAIAILoop;
  4841. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4842. BEGIN
  4843. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4844. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4845. RETURN RESULT
  4846. END ".<=";
  4847. (** LONGINT *)
  4848. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4849. VAR lval, rval: LONGINT;
  4850. BEGIN
  4851. WHILE (len > 0) DO
  4852. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4853. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4854. END;
  4855. END ELeqALALLoop;
  4856. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4857. BEGIN
  4858. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4859. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4860. RETURN RESULT
  4861. END ".<=";
  4862. (** REAL *)
  4863. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4864. VAR lval, rval: REAL;
  4865. BEGIN
  4866. WHILE (len > 0) DO
  4867. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4868. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4869. END;
  4870. END ELeqARARLoop;
  4871. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4872. BEGIN
  4873. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4874. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4875. RETURN RESULT
  4876. END ".<=";
  4877. (** LONGREAL*)
  4878. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4879. VAR lval, rval: LONGREAL;
  4880. BEGIN
  4881. WHILE (len > 0) DO
  4882. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4883. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4884. END;
  4885. END ELeqAXAXLoop;
  4886. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4887. BEGIN
  4888. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4889. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4890. RETURN RESULT
  4891. END ".<=";
  4892. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4893. (** SHORTINT *)
  4894. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4895. VAR lval, rval: SHORTINT;
  4896. BEGIN
  4897. SYSTEM.GET( radr, rval );
  4898. WHILE (len > 0) DO
  4899. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4900. INC( dadr, dinc ); DEC( len );
  4901. END;
  4902. END ELeqASSSLoop;
  4903. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4904. BEGIN
  4905. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4906. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4907. RETURN RESULT
  4908. END ".<=";
  4909. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4910. BEGIN
  4911. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4912. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4913. RETURN RESULT
  4914. END ".>=";
  4915. (** INTEGER *)
  4916. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4917. VAR lval, rval: INTEGER;
  4918. BEGIN
  4919. SYSTEM.GET( radr, rval );
  4920. WHILE (len > 0) DO
  4921. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4922. INC( dadr, dinc ); DEC( len );
  4923. END;
  4924. END ELeqAISILoop;
  4925. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4926. BEGIN
  4927. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4928. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4929. RETURN RESULT
  4930. END ".<=";
  4931. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4932. BEGIN
  4933. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4934. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4935. RETURN RESULT
  4936. END ".>=";
  4937. (** LONGINT *)
  4938. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4939. VAR lval, rval: LONGINT;
  4940. BEGIN
  4941. SYSTEM.GET( radr, rval );
  4942. WHILE (len > 0) DO
  4943. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4944. INC( dadr, dinc ); DEC( len );
  4945. END;
  4946. END ELeqALSLLoop;
  4947. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4948. BEGIN
  4949. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4950. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4951. RETURN RESULT
  4952. END ".<=";
  4953. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4954. BEGIN
  4955. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4956. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4957. RETURN RESULT
  4958. END ".>=";
  4959. (** REAL *)
  4960. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4961. VAR lval, rval: REAL;
  4962. BEGIN
  4963. SYSTEM.GET( radr, rval );
  4964. WHILE (len > 0) DO
  4965. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4966. INC( dadr, dinc ); DEC( len );
  4967. END;
  4968. END ELeqARSRLoop;
  4969. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4970. BEGIN
  4971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4972. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4973. RETURN RESULT
  4974. END ".<=";
  4975. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4976. BEGIN
  4977. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4978. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4979. RETURN RESULT
  4980. END ".>=";
  4981. (** LONGREAL *)
  4982. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4983. VAR lval, rval: LONGREAL;
  4984. BEGIN
  4985. SYSTEM.GET( radr, rval );
  4986. WHILE (len > 0) DO
  4987. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4988. INC( dadr, dinc ); DEC( len );
  4989. END;
  4990. END ELeqAXSXLoop;
  4991. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4992. BEGIN
  4993. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4994. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  4995. RETURN RESULT
  4996. END ".<=";
  4997. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4998. BEGIN
  4999. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5000. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5001. RETURN RESULT
  5002. END ".>=";
  5003. (*** elementwise or, elementwise and ********************************************************************)
  5004. (** array x array *)
  5005. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5006. VAR lval, rval: BOOLEAN;
  5007. BEGIN
  5008. WHILE (len > 0) DO
  5009. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5010. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5011. END;
  5012. END ElOrABABLoop;
  5013. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5014. BEGIN
  5015. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5016. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5017. RETURN RESULT
  5018. END "OR";
  5019. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5020. VAR lval, rval: BOOLEAN;
  5021. BEGIN
  5022. WHILE (len > 0) DO
  5023. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5024. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5025. END;
  5026. END ElAndABABLoop;
  5027. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5028. BEGIN
  5029. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5030. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5031. RETURN RESULT
  5032. END "&";
  5033. (** array x boolean *)
  5034. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5035. VAR lval, rval: BOOLEAN;
  5036. BEGIN
  5037. SYSTEM.GET( radr, rval );
  5038. WHILE (len > 0) DO
  5039. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5040. INC( dadr, dinc ); DEC( len );
  5041. END;
  5042. END ElOrABSBLoop;
  5043. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5044. BEGIN
  5045. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5046. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5047. RETURN RESULT
  5048. END "OR";
  5049. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5050. BEGIN
  5051. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5052. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5053. RETURN RESULT
  5054. END "OR";
  5055. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5056. VAR lval, rval: BOOLEAN;
  5057. BEGIN
  5058. SYSTEM.GET( radr, rval );
  5059. WHILE (len > 0) DO
  5060. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5061. INC( dadr, dinc ); DEC( len );
  5062. END;
  5063. END ElAndABSBLoop;
  5064. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5065. BEGIN
  5066. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5067. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5068. RETURN RESULT
  5069. END "&";
  5070. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5071. BEGIN
  5072. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5073. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5074. RETURN RESULT
  5075. END "&";
  5076. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5077. (** SHORTINT *)
  5078. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5079. VAR lval, rval: SHORTINT;
  5080. BEGIN
  5081. WHILE (len > 0) DO
  5082. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5083. IF rval <= lval THEN RETURN FALSE END;
  5084. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5085. END;
  5086. RETURN TRUE;
  5087. END LssASASLoop;
  5088. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5089. BEGIN
  5090. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5091. END "<";
  5092. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5093. VAR lval, rval: SHORTINT;
  5094. BEGIN
  5095. WHILE (len > 0) DO
  5096. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5097. IF rval > lval THEN RETURN FALSE END;
  5098. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5099. END;
  5100. RETURN TRUE;
  5101. END GeqASASLoop;
  5102. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5103. BEGIN
  5104. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5105. END ">=";
  5106. (** INTEGER *)
  5107. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5108. VAR lval, rval: INTEGER;
  5109. BEGIN
  5110. WHILE (len > 0) DO
  5111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5112. IF rval <= lval THEN RETURN FALSE END;
  5113. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5114. END;
  5115. RETURN TRUE;
  5116. END LssAIAILoop;
  5117. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5118. BEGIN
  5119. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5120. END "<";
  5121. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5122. VAR lval, rval: INTEGER;
  5123. BEGIN
  5124. WHILE (len > 0) DO
  5125. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5126. IF rval > lval THEN RETURN FALSE END;
  5127. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5128. END;
  5129. RETURN TRUE;
  5130. END GeqAIAILoop;
  5131. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5132. BEGIN
  5133. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5134. END ">=";
  5135. (** LONGINT *)
  5136. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5137. VAR lval, rval: LONGINT;
  5138. BEGIN
  5139. WHILE (len > 0) DO
  5140. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5141. IF rval <= lval THEN RETURN FALSE END;
  5142. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5143. END;
  5144. RETURN TRUE;
  5145. END LssALALLoop;
  5146. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5147. BEGIN
  5148. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5149. END "<";
  5150. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5151. VAR lval, rval: LONGINT;
  5152. BEGIN
  5153. WHILE (len > 0) DO
  5154. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5155. IF rval > lval THEN RETURN FALSE END;
  5156. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5157. END;
  5158. RETURN TRUE;
  5159. END GeqALALLoop;
  5160. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5161. BEGIN
  5162. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5163. END ">=";
  5164. (** REAL *)
  5165. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5166. VAR lval, rval: REAL;
  5167. BEGIN
  5168. WHILE (len > 0) DO
  5169. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5170. IF rval <= lval THEN RETURN FALSE END;
  5171. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5172. END;
  5173. RETURN TRUE;
  5174. END LssARARLoop;
  5175. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5176. BEGIN
  5177. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5178. END "<";
  5179. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5180. VAR lval, rval: REAL;
  5181. BEGIN
  5182. WHILE (len > 0) DO
  5183. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5184. IF rval > lval THEN RETURN FALSE END;
  5185. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5186. END;
  5187. RETURN TRUE;
  5188. END GeqARARLoop;
  5189. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5190. BEGIN
  5191. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5192. END ">=";
  5193. (** LONGREAL *)
  5194. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5195. VAR lval, rval: LONGREAL;
  5196. BEGIN
  5197. WHILE (len > 0) DO
  5198. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5199. IF rval <= lval THEN RETURN FALSE END;
  5200. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5201. END;
  5202. RETURN TRUE;
  5203. END LssAXAXLoop;
  5204. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5205. BEGIN
  5206. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5207. END "<";
  5208. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5209. VAR lval, rval: LONGREAL;
  5210. BEGIN
  5211. WHILE (len > 0) DO
  5212. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5213. IF rval > lval THEN RETURN FALSE END;
  5214. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5215. END;
  5216. RETURN TRUE;
  5217. END GeqAXAXLoop;
  5218. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5219. BEGIN
  5220. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5221. END ">=";
  5222. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5223. (** SHORTINT *)
  5224. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5225. VAR lval, rval: SHORTINT;
  5226. BEGIN
  5227. WHILE (len > 0) DO
  5228. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5229. IF rval >= lval THEN RETURN FALSE END;
  5230. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5231. END;
  5232. RETURN TRUE;
  5233. END GtrASASLoop;
  5234. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5235. BEGIN
  5236. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5237. END ">";
  5238. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5239. VAR lval, rval: SHORTINT;
  5240. BEGIN
  5241. WHILE (len > 0) DO
  5242. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5243. IF rval < lval THEN RETURN FALSE END;
  5244. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5245. END;
  5246. RETURN TRUE;
  5247. END LeqASASLoop;
  5248. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5249. BEGIN
  5250. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5251. END "<=";
  5252. (** INTEGER *)
  5253. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5254. VAR lval, rval: INTEGER;
  5255. BEGIN
  5256. WHILE (len > 0) DO
  5257. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5258. IF rval >= lval THEN RETURN FALSE END;
  5259. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5260. END;
  5261. RETURN TRUE;
  5262. END GtrAIAILoop;
  5263. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5264. BEGIN
  5265. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5266. END ">";
  5267. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5268. VAR lval, rval: INTEGER;
  5269. BEGIN
  5270. WHILE (len > 0) DO
  5271. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5272. IF rval < lval THEN RETURN FALSE END;
  5273. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5274. END;
  5275. RETURN TRUE;
  5276. END LeqAIAILoop;
  5277. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5278. BEGIN
  5279. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5280. END "<=";
  5281. (** LONGINT *)
  5282. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5283. VAR lval, rval: LONGINT;
  5284. BEGIN
  5285. WHILE (len > 0) DO
  5286. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5287. IF rval >= lval THEN RETURN FALSE END;
  5288. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5289. END;
  5290. RETURN TRUE;
  5291. END GtrALALLoop;
  5292. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5293. BEGIN
  5294. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5295. END ">";
  5296. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5297. VAR lval, rval: LONGINT;
  5298. BEGIN
  5299. WHILE (len > 0) DO
  5300. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5301. IF rval < lval THEN RETURN FALSE END;
  5302. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5303. END;
  5304. RETURN TRUE;
  5305. END LeqALALLoop;
  5306. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5307. BEGIN
  5308. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5309. END "<=";
  5310. (** REAL *)
  5311. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5312. VAR lval, rval: REAL;
  5313. BEGIN
  5314. WHILE (len > 0) DO
  5315. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5316. IF rval >= lval THEN RETURN FALSE END;
  5317. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5318. END;
  5319. RETURN TRUE;
  5320. END GtrARARLoop;
  5321. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5322. BEGIN
  5323. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5324. END ">";
  5325. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5326. VAR lval, rval: REAL;
  5327. BEGIN
  5328. WHILE (len > 0) DO
  5329. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5330. IF rval < lval THEN RETURN FALSE END;
  5331. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5332. END;
  5333. RETURN TRUE;
  5334. END LeqARARLoop;
  5335. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5336. BEGIN
  5337. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5338. END "<=";
  5339. (** LONGREAL *)
  5340. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5341. VAR lval, rval: LONGREAL;
  5342. BEGIN
  5343. WHILE (len > 0) DO
  5344. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5345. IF rval >= lval THEN RETURN FALSE END;
  5346. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5347. END;
  5348. RETURN TRUE;
  5349. END GtrAXAXLoop;
  5350. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5351. BEGIN
  5352. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5353. END ">";
  5354. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5355. VAR lval, rval: LONGREAL;
  5356. BEGIN
  5357. WHILE (len > 0) DO
  5358. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5359. IF rval < lval THEN RETURN FALSE END;
  5360. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5361. END;
  5362. RETURN TRUE;
  5363. END LeqAXAXLoop;
  5364. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5365. BEGIN
  5366. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5367. END "<=";
  5368. (*** equals: array x array -> boolean ********************************************************************)
  5369. (** BOOLEAN *)
  5370. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5371. VAR lval, rval: BOOLEAN;
  5372. BEGIN
  5373. WHILE (len > 0) DO
  5374. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5375. IF rval # lval THEN RETURN FALSE END;
  5376. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5377. END;
  5378. RETURN TRUE;
  5379. END EqlABABLoop;
  5380. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5381. BEGIN
  5382. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5383. END "=";
  5384. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5385. BEGIN
  5386. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5387. END "#";
  5388. (** SHORTINT *)
  5389. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5390. VAR lval, rval: SHORTINT;
  5391. BEGIN
  5392. WHILE (len > 0) DO
  5393. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5394. IF rval # lval THEN RETURN FALSE END;
  5395. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5396. END;
  5397. RETURN TRUE;
  5398. END EqlASASLoop;
  5399. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5400. BEGIN
  5401. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5402. END "=";
  5403. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5404. BEGIN
  5405. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5406. END "#";
  5407. (** INTEGER *)
  5408. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5409. VAR lval, rval: INTEGER;
  5410. BEGIN
  5411. WHILE (len > 0) DO
  5412. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5413. IF rval # lval THEN RETURN FALSE END;
  5414. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5415. END;
  5416. RETURN TRUE;
  5417. END EqlAIAILoop;
  5418. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5419. BEGIN
  5420. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5421. END "=";
  5422. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5423. BEGIN
  5424. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5425. END "#";
  5426. (** LONGINT *)
  5427. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5428. VAR lval, rval: LONGINT;
  5429. BEGIN
  5430. WHILE (len > 0) DO
  5431. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5432. IF rval # lval THEN RETURN FALSE END;
  5433. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5434. END;
  5435. RETURN TRUE;
  5436. END EqlALALLoop;
  5437. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5438. BEGIN
  5439. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5440. END "=";
  5441. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5442. BEGIN
  5443. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5444. END "#";
  5445. (** REAL *)
  5446. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5447. VAR lval, rval: REAL;
  5448. BEGIN
  5449. WHILE (len > 0) DO
  5450. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5451. IF rval # lval THEN RETURN FALSE END;
  5452. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5453. END;
  5454. RETURN TRUE;
  5455. END EqlARARLoop;
  5456. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5457. BEGIN
  5458. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5459. END "=";
  5460. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5461. BEGIN
  5462. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5463. END "#";
  5464. (** LONGREAL *)
  5465. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5466. VAR lval, rval: LONGREAL;
  5467. BEGIN
  5468. WHILE (len > 0) DO
  5469. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5470. IF rval # lval THEN RETURN FALSE END;
  5471. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5472. END;
  5473. RETURN TRUE;
  5474. END EqlAXAXLoop;
  5475. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5476. BEGIN
  5477. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5478. END "=";
  5479. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5480. BEGIN
  5481. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5482. END "#";
  5483. (** COMPLEX *)
  5484. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5485. VAR lval, rval: COMPLEX;
  5486. BEGIN
  5487. WHILE (len > 0) DO
  5488. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5489. IF rval # lval THEN RETURN FALSE END;
  5490. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5491. END;
  5492. RETURN TRUE;
  5493. END EqlAZAZLoop;
  5494. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5495. BEGIN
  5496. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5497. END "=";
  5498. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5499. BEGIN
  5500. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5501. END "#";
  5502. (** LONGCOMPLEX *)
  5503. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5504. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5505. BEGIN
  5506. WHILE (len > 0) DO
  5507. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5508. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5509. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5510. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5511. END;
  5512. RETURN TRUE;
  5513. END EqlALZALZLoop;
  5514. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5515. BEGIN
  5516. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5517. END "=";
  5518. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5519. BEGIN
  5520. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5521. END "#";
  5522. (*** equals: array x scalar -> boolean ********************************************************************)
  5523. (** BOOLEAN *)
  5524. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5525. VAR lval, rval: BOOLEAN;
  5526. BEGIN
  5527. SYSTEM.GET( radr, rval );
  5528. WHILE (len > 0) DO
  5529. SYSTEM.GET( ladr, lval );
  5530. IF lval # rval THEN RETURN FALSE END;
  5531. INC( ladr, linc ); DEC( len );
  5532. END;
  5533. RETURN TRUE;
  5534. END EqlABSBLoop;
  5535. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5536. right: BOOLEAN ): BOOLEAN;
  5537. BEGIN
  5538. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5539. END "=";
  5540. OPERATOR "="*( left: BOOLEAN;
  5541. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5542. BEGIN
  5543. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5544. END "=";
  5545. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5546. right: BOOLEAN ): BOOLEAN;
  5547. BEGIN
  5548. RETURN ~(left = right);
  5549. END "#";
  5550. OPERATOR "#"*( left: BOOLEAN;
  5551. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5552. BEGIN
  5553. RETURN ~( left = right );
  5554. END "#";
  5555. (** SHORTINT *)
  5556. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5557. VAR lval, rval: SHORTINT;
  5558. BEGIN
  5559. SYSTEM.GET( radr, rval );
  5560. WHILE (len > 0) DO
  5561. SYSTEM.GET( ladr, lval );
  5562. IF lval # rval THEN RETURN FALSE END;
  5563. INC( ladr, linc ); DEC( len );
  5564. END;
  5565. RETURN TRUE;
  5566. END EqlASSSLoop;
  5567. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5568. BEGIN
  5569. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5570. END "=";
  5571. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5572. BEGIN
  5573. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5574. END "=";
  5575. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5576. BEGIN
  5577. RETURN ~( left= right );
  5578. END "#";
  5579. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5580. BEGIN
  5581. RETURN ~( left= right );
  5582. END "#";
  5583. (** INTEGER *)
  5584. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5585. VAR lval, rval: INTEGER;
  5586. BEGIN
  5587. SYSTEM.GET( radr, rval );
  5588. WHILE (len > 0) DO
  5589. SYSTEM.GET( ladr, lval );
  5590. IF lval # rval THEN RETURN FALSE END;
  5591. INC( ladr, linc ); DEC( len );
  5592. END;
  5593. RETURN TRUE;
  5594. END EqlAISILoop;
  5595. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5596. BEGIN
  5597. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5598. END "=";
  5599. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5600. BEGIN
  5601. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5602. END "=";
  5603. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5604. BEGIN
  5605. RETURN ~( left = right );
  5606. END "#";
  5607. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5608. BEGIN
  5609. RETURN ~( left = right );
  5610. END "#";
  5611. (** LONGINT *)
  5612. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5613. VAR lval, rval: LONGINT;
  5614. BEGIN
  5615. SYSTEM.GET( radr, rval );
  5616. WHILE (len > 0) DO
  5617. SYSTEM.GET( ladr, lval );
  5618. IF lval # rval THEN RETURN FALSE END;
  5619. INC( ladr, linc ); DEC( len );
  5620. END;
  5621. RETURN TRUE;
  5622. END EqlALSLLoop;
  5623. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5624. right: LONGINT ): BOOLEAN;
  5625. BEGIN
  5626. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5627. END "=";
  5628. OPERATOR "="*( left: LONGINT;
  5629. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5630. BEGIN
  5631. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5632. END "=";
  5633. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5634. right: LONGINT ): BOOLEAN;
  5635. BEGIN
  5636. RETURN ~(left = right);
  5637. END "#";
  5638. OPERATOR "#"*( left: LONGINT;
  5639. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5640. BEGIN
  5641. RETURN ~(left = right);
  5642. END "#";
  5643. (** REAL *)
  5644. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5645. VAR lval, rval: REAL;
  5646. BEGIN
  5647. SYSTEM.GET( radr, rval );
  5648. WHILE (len > 0) DO
  5649. SYSTEM.GET( ladr, lval );
  5650. IF lval # rval THEN RETURN FALSE END;
  5651. INC( ladr, linc ); DEC( len );
  5652. END;
  5653. RETURN TRUE;
  5654. END EqlARSRLoop;
  5655. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5656. right: REAL ): BOOLEAN;
  5657. BEGIN
  5658. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5659. END "=";
  5660. OPERATOR "="*( left: REAL;
  5661. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5662. BEGIN
  5663. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5664. END "=";
  5665. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5666. right: REAL ): BOOLEAN;
  5667. BEGIN
  5668. RETURN ~( left = right );
  5669. END "#";
  5670. OPERATOR "#"*( left: REAL;
  5671. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5672. BEGIN
  5673. RETURN ~( left = right );
  5674. END "#";
  5675. (** LONGREAL *)
  5676. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5677. VAR lval, rval: LONGREAL;
  5678. BEGIN
  5679. SYSTEM.GET( radr, rval );
  5680. WHILE (len > 0) DO
  5681. SYSTEM.GET( ladr, lval );
  5682. IF lval # rval THEN RETURN FALSE END;
  5683. INC( ladr, linc ); DEC( len );
  5684. END;
  5685. RETURN TRUE;
  5686. END EqlAXSXLoop;
  5687. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5688. right: LONGREAL ): BOOLEAN;
  5689. BEGIN
  5690. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5691. END "=";
  5692. OPERATOR "="*( left: LONGREAL;
  5693. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5694. BEGIN
  5695. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5696. END "=";
  5697. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5698. right: LONGREAL ): BOOLEAN;
  5699. BEGIN
  5700. RETURN ~( left = right );
  5701. END "#";
  5702. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5703. BEGIN
  5704. RETURN ~( left= right );
  5705. END "#";
  5706. (*** gtr : array x scalar -> boolean ********************************************************************)
  5707. (** SHORTINT *)
  5708. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5709. VAR lval, rval: SHORTINT;
  5710. BEGIN
  5711. SYSTEM.GET( radr, rval );
  5712. WHILE (len > 0) DO
  5713. SYSTEM.GET( ladr, lval );
  5714. IF lval <= rval THEN RETURN FALSE END;
  5715. INC( ladr, linc ); DEC( len );
  5716. END;
  5717. RETURN TRUE;
  5718. END GtrASSSLoop;
  5719. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5720. BEGIN
  5721. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5722. END ">";
  5723. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5724. BEGIN
  5725. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5726. END "<";
  5727. (** INTEGER *)
  5728. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5729. VAR lval, rval: INTEGER;
  5730. BEGIN
  5731. SYSTEM.GET( radr, rval );
  5732. WHILE (len > 0) DO
  5733. SYSTEM.GET( ladr, lval );
  5734. IF lval <= rval THEN RETURN FALSE END;
  5735. INC( ladr, linc ); DEC( len );
  5736. END;
  5737. RETURN TRUE;
  5738. END GtrAISILoop;
  5739. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5740. BEGIN
  5741. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5742. END ">";
  5743. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5744. BEGIN
  5745. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5746. END "<";
  5747. (** LONGINT *)
  5748. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5749. VAR lval, rval: LONGINT;
  5750. BEGIN
  5751. SYSTEM.GET( radr, rval );
  5752. WHILE (len > 0) DO
  5753. SYSTEM.GET( ladr, lval );
  5754. IF lval <= rval THEN RETURN FALSE END;
  5755. INC( ladr, linc ); DEC( len );
  5756. END;
  5757. RETURN TRUE;
  5758. END GtrALSLLoop;
  5759. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5760. BEGIN
  5761. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5762. END ">";
  5763. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5764. BEGIN
  5765. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5766. END "<";
  5767. (** REAL *)
  5768. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5769. VAR lval, rval: REAL;
  5770. BEGIN
  5771. SYSTEM.GET( radr, rval );
  5772. WHILE (len > 0) DO
  5773. SYSTEM.GET( ladr, lval );
  5774. IF lval <= rval THEN RETURN FALSE END;
  5775. INC( ladr, linc ); DEC( len );
  5776. END;
  5777. RETURN TRUE;
  5778. END GtrARSRLoop;
  5779. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5780. right: REAL ): BOOLEAN;
  5781. BEGIN
  5782. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5783. END ">";
  5784. OPERATOR "<"*( left: REAL;
  5785. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5786. BEGIN
  5787. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5788. END "<";
  5789. (** LONGREAL *)
  5790. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5791. VAR lval, rval: LONGREAL;
  5792. BEGIN
  5793. SYSTEM.GET( radr, rval );
  5794. WHILE (len > 0) DO
  5795. SYSTEM.GET( ladr, lval );
  5796. IF lval <= rval THEN RETURN FALSE END;
  5797. INC( ladr, linc ); DEC( len );
  5798. END;
  5799. RETURN TRUE;
  5800. END GtrAXSXLoop;
  5801. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5802. right: LONGREAL ): BOOLEAN;
  5803. BEGIN
  5804. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5805. END ">";
  5806. OPERATOR "<"*( left: LONGREAL;
  5807. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5808. BEGIN
  5809. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5810. END "<";
  5811. (*** geq : array x scalar -> boolean ********************************************************************)
  5812. (** SHORTINT *)
  5813. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5814. VAR lval, rval: SHORTINT;
  5815. BEGIN
  5816. SYSTEM.GET( radr, rval );
  5817. WHILE (len > 0) DO
  5818. SYSTEM.GET( ladr, lval );
  5819. IF lval < rval THEN RETURN FALSE END;
  5820. INC( ladr, linc ); DEC( len );
  5821. END;
  5822. RETURN TRUE;
  5823. END GeqASSSLoop;
  5824. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5825. right: SHORTINT ): BOOLEAN;
  5826. BEGIN
  5827. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5828. END ">=";
  5829. OPERATOR "<="*( left: SHORTINT;
  5830. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5831. BEGIN
  5832. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5833. END "<=";
  5834. (** INTEGER *)
  5835. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5836. VAR lval, rval: INTEGER;
  5837. BEGIN
  5838. SYSTEM.GET( radr, rval );
  5839. WHILE (len > 0) DO
  5840. SYSTEM.GET( ladr, lval );
  5841. IF lval < rval THEN RETURN FALSE END;
  5842. INC( ladr, linc ); DEC( len );
  5843. END;
  5844. RETURN TRUE;
  5845. END GeqAISILoop;
  5846. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5847. BEGIN
  5848. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5849. END ">=";
  5850. OPERATOR "<="*( left: INTEGER;
  5851. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5852. BEGIN
  5853. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5854. END "<=";
  5855. (** LONGINT *)
  5856. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5857. VAR lval, rval: LONGINT;
  5858. BEGIN
  5859. SYSTEM.GET( radr, rval );
  5860. WHILE (len > 0) DO
  5861. SYSTEM.GET( ladr, lval );
  5862. IF lval < rval THEN RETURN FALSE END;
  5863. INC( ladr, linc ); DEC( len );
  5864. END;
  5865. RETURN TRUE;
  5866. END GeqALSLLoop;
  5867. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5868. right: LONGINT ): BOOLEAN;
  5869. BEGIN
  5870. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5871. END ">=";
  5872. OPERATOR "<="*( left: LONGINT;
  5873. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5874. BEGIN
  5875. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5876. END "<=";
  5877. (** REAL *)
  5878. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5879. VAR lval, rval: REAL;
  5880. BEGIN
  5881. SYSTEM.GET( radr, rval );
  5882. WHILE (len > 0) DO
  5883. SYSTEM.GET( ladr, lval );
  5884. IF lval < rval THEN RETURN FALSE END;
  5885. INC( ladr, linc ); DEC( len );
  5886. END;
  5887. RETURN TRUE;
  5888. END GeqARSRLoop;
  5889. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5890. right: REAL ): BOOLEAN;
  5891. BEGIN
  5892. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5893. END ">=";
  5894. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5895. BEGIN
  5896. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5897. END "<=";
  5898. (** LONGREAL *)
  5899. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5900. VAR lval, rval: LONGREAL;
  5901. BEGIN
  5902. SYSTEM.GET( radr, rval );
  5903. WHILE (len > 0) DO
  5904. SYSTEM.GET( ladr, lval );
  5905. IF lval < rval THEN RETURN FALSE END;
  5906. INC( ladr, linc ); DEC( len );
  5907. END;
  5908. RETURN TRUE;
  5909. END GeqAXSXLoop;
  5910. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5911. BEGIN
  5912. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5913. END ">=";
  5914. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5915. BEGIN
  5916. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5917. END "<=";
  5918. (*** leq : array x scalar -> boolean ********************************************************************)
  5919. (** SHORTINT *)
  5920. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5921. VAR lval, rval: SHORTINT;
  5922. BEGIN
  5923. SYSTEM.GET( radr, rval );
  5924. WHILE (len > 0) DO
  5925. SYSTEM.GET( ladr, lval );
  5926. IF lval > rval THEN RETURN FALSE END;
  5927. INC( ladr, linc ); DEC( len );
  5928. END;
  5929. RETURN TRUE;
  5930. END LeqASSSLoop;
  5931. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5932. BEGIN
  5933. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5934. END "<=";
  5935. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5936. BEGIN
  5937. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5938. END ">=";
  5939. (** INTEGER *)
  5940. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5941. VAR lval, rval: INTEGER;
  5942. BEGIN
  5943. SYSTEM.GET( radr, rval );
  5944. WHILE (len > 0) DO
  5945. SYSTEM.GET( ladr, lval );
  5946. IF lval > rval THEN RETURN FALSE END;
  5947. INC( ladr, linc ); DEC( len );
  5948. END;
  5949. RETURN TRUE;
  5950. END LeqAISILoop;
  5951. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5952. BEGIN
  5953. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5954. END "<=";
  5955. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5956. BEGIN
  5957. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5958. END ">=";
  5959. (** LONGINT *)
  5960. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5961. VAR lval, rval: LONGINT;
  5962. BEGIN
  5963. SYSTEM.GET( radr, rval );
  5964. WHILE (len > 0) DO
  5965. SYSTEM.GET( ladr, lval );
  5966. IF lval > rval THEN RETURN FALSE END;
  5967. INC( ladr, linc ); DEC( len );
  5968. END;
  5969. RETURN TRUE;
  5970. END LeqALSLLoop;
  5971. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5972. BEGIN
  5973. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  5974. END "<=";
  5975. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5976. BEGIN
  5977. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  5978. END ">=";
  5979. (** REAL *)
  5980. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5981. VAR lval, rval: REAL;
  5982. BEGIN
  5983. SYSTEM.GET( radr, rval );
  5984. WHILE (len > 0) DO
  5985. SYSTEM.GET( ladr, lval );
  5986. IF lval > rval THEN RETURN FALSE END;
  5987. INC( ladr, linc ); DEC( len );
  5988. END;
  5989. RETURN TRUE;
  5990. END LeqARSRLoop;
  5991. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  5992. BEGIN
  5993. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  5994. END "<=";
  5995. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5996. BEGIN
  5997. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  5998. END ">=";
  5999. (** LONGREAL *)
  6000. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6001. VAR lval, rval: LONGREAL;
  6002. BEGIN
  6003. SYSTEM.GET( radr, rval );
  6004. WHILE (len > 0) DO
  6005. SYSTEM.GET( ladr, lval );
  6006. IF lval > rval THEN RETURN FALSE END;
  6007. INC( ladr, linc ); DEC( len );
  6008. END;
  6009. RETURN TRUE;
  6010. END LeqAXSXLoop;
  6011. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6012. BEGIN
  6013. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6014. END "<=";
  6015. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6016. BEGIN
  6017. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6018. END ">=";
  6019. (*** lss: array x scalar -> boolean ********************************************************************)
  6020. (** SHORTINT *)
  6021. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6022. VAR lval, rval: SHORTINT;
  6023. BEGIN
  6024. SYSTEM.GET( radr, rval );
  6025. WHILE (len > 0) DO
  6026. SYSTEM.GET( ladr, lval );
  6027. IF lval >= rval THEN RETURN FALSE END;
  6028. INC( ladr, linc ); DEC( len );
  6029. END;
  6030. RETURN TRUE;
  6031. END LssASSSLoop;
  6032. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6033. BEGIN
  6034. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6035. END "<";
  6036. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6037. BEGIN
  6038. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6039. END ">";
  6040. (** INTEGER *)
  6041. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6042. VAR lval, rval: INTEGER;
  6043. BEGIN
  6044. SYSTEM.GET( radr, rval );
  6045. WHILE (len > 0) DO
  6046. SYSTEM.GET( ladr, lval );
  6047. IF lval >= rval THEN RETURN FALSE END;
  6048. INC( ladr, linc ); DEC( len );
  6049. END;
  6050. RETURN TRUE;
  6051. END LssAISILoop;
  6052. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6053. BEGIN
  6054. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6055. END "<";
  6056. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6057. BEGIN
  6058. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6059. END ">";
  6060. (** LONGINT *)
  6061. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6062. VAR lval, rval: LONGINT;
  6063. BEGIN
  6064. SYSTEM.GET( radr, rval );
  6065. WHILE (len > 0) DO
  6066. SYSTEM.GET( ladr, lval );
  6067. IF lval >= rval THEN RETURN FALSE END;
  6068. INC( ladr, linc ); DEC( len );
  6069. END;
  6070. RETURN TRUE;
  6071. END LssALSLLoop;
  6072. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6073. BEGIN
  6074. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6075. END "<";
  6076. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6077. BEGIN
  6078. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6079. END ">";
  6080. (** REAL *)
  6081. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6082. VAR lval, rval: REAL;
  6083. BEGIN
  6084. SYSTEM.GET( radr, rval );
  6085. WHILE (len > 0) DO
  6086. SYSTEM.GET( ladr, lval );
  6087. IF lval >= rval THEN RETURN FALSE END;
  6088. INC( ladr, linc ); DEC( len );
  6089. END;
  6090. RETURN TRUE;
  6091. END LssARSRLoop;
  6092. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6093. right: REAL ): BOOLEAN;
  6094. BEGIN
  6095. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6096. END "<";
  6097. OPERATOR ">"*( left: REAL;
  6098. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6099. BEGIN
  6100. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6101. END ">";
  6102. (** LONGREAL *)
  6103. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6104. VAR lval, rval: LONGREAL;
  6105. BEGIN
  6106. SYSTEM.GET( radr, rval );
  6107. WHILE (len > 0) DO
  6108. SYSTEM.GET( ladr, lval );
  6109. IF lval >= rval THEN RETURN FALSE END;
  6110. INC( ladr, linc ); DEC( len );
  6111. END;
  6112. RETURN TRUE;
  6113. END LssAXSXLoop;
  6114. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6115. right: LONGREAL ): BOOLEAN;
  6116. BEGIN
  6117. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6118. END "<";
  6119. OPERATOR ">"*( left: LONGREAL;
  6120. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6121. BEGIN
  6122. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6123. END ">";
  6124. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6125. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6126. VAR lval, val: LONGREAL;
  6127. BEGIN
  6128. SYSTEM.GET( radr, val );
  6129. WHILE (len > 0) DO
  6130. SYSTEM.GET( ladr, lval );
  6131. INC( ladr, linc ); DEC( len );
  6132. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6133. INC(dadr,dinc);
  6134. END;
  6135. END MaxAXSXLoop;
  6136. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6137. TYPE Type = LONGREAL;
  6138. BEGIN
  6139. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6140. RETURN RESULT
  6141. END "MAX";
  6142. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6143. VAR lval, val: REAL;
  6144. BEGIN
  6145. SYSTEM.GET( radr, val );
  6146. WHILE (len > 0) DO
  6147. SYSTEM.GET( ladr, lval );
  6148. INC( ladr, linc ); DEC( len );
  6149. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6150. INC(dadr,dinc);
  6151. END;
  6152. END MaxARSRLoop;
  6153. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6154. TYPE Type = REAL;
  6155. BEGIN
  6156. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6157. RETURN RESULT
  6158. END "MAX";
  6159. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6160. VAR lval, val: LONGINT;
  6161. BEGIN
  6162. SYSTEM.GET( radr, val );
  6163. WHILE (len > 0) DO
  6164. SYSTEM.GET( ladr, lval );
  6165. INC( ladr, linc ); DEC( len );
  6166. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6167. INC(dadr,dinc);
  6168. END;
  6169. END MaxALSLLoop;
  6170. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6171. TYPE Type = LONGINT;
  6172. BEGIN
  6173. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6174. RETURN RESULT
  6175. END "MAX";
  6176. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6177. VAR lval, val: INTEGER;
  6178. BEGIN
  6179. SYSTEM.GET( radr, val );
  6180. WHILE (len > 0) DO
  6181. SYSTEM.GET( ladr, lval );
  6182. INC( ladr, linc ); DEC( len );
  6183. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6184. INC(dadr,dinc);
  6185. END;
  6186. END MaxAISILoop;
  6187. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6188. TYPE Type = INTEGER;
  6189. BEGIN
  6190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6191. RETURN RESULT
  6192. END "MAX";
  6193. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6194. VAR lval, val: SHORTINT;
  6195. BEGIN
  6196. SYSTEM.GET( radr, val );
  6197. WHILE (len > 0) DO
  6198. SYSTEM.GET( ladr, lval );
  6199. INC( ladr, linc ); DEC( len );
  6200. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6201. INC(dadr,dinc);
  6202. END;
  6203. END MaxASSSLoop;
  6204. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6205. TYPE Type = SHORTINT;
  6206. BEGIN
  6207. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6208. RETURN RESULT
  6209. END "MAX";
  6210. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6211. VAR lval, val: LONGREAL;
  6212. BEGIN
  6213. SYSTEM.GET( radr, val );
  6214. WHILE (len > 0) DO
  6215. SYSTEM.GET( ladr, lval );
  6216. INC( ladr, linc ); DEC( len );
  6217. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6218. INC(dadr,dinc);
  6219. END;
  6220. END MinAXSXLoop;
  6221. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6222. TYPE Type = LONGREAL;
  6223. BEGIN
  6224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6225. RETURN RESULT
  6226. END "MIN";
  6227. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6228. VAR lval, val: REAL;
  6229. BEGIN
  6230. SYSTEM.GET( radr, val );
  6231. WHILE (len > 0) DO
  6232. SYSTEM.GET( ladr, lval );
  6233. INC( ladr, linc ); DEC( len );
  6234. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6235. INC(dadr,dinc);
  6236. END;
  6237. END MinARSRLoop;
  6238. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6239. TYPE Type = REAL;
  6240. BEGIN
  6241. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6242. RETURN RESULT
  6243. END "MIN";
  6244. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6245. VAR lval, val: LONGINT;
  6246. BEGIN
  6247. SYSTEM.GET( radr, val );
  6248. WHILE (len > 0) DO
  6249. SYSTEM.GET( ladr, lval );
  6250. INC( ladr, linc ); DEC( len );
  6251. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6252. INC(dadr,dinc);
  6253. END;
  6254. END MinALSLLoop;
  6255. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6256. TYPE Type = LONGINT;
  6257. BEGIN
  6258. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6259. RETURN RESULT
  6260. END "MIN";
  6261. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6262. VAR lval, val: INTEGER;
  6263. BEGIN
  6264. SYSTEM.GET( radr, val );
  6265. WHILE (len > 0) DO
  6266. SYSTEM.GET( ladr, lval );
  6267. INC( ladr, linc ); DEC( len );
  6268. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6269. INC(dadr,dinc);
  6270. END;
  6271. END MinAISILoop;
  6272. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6273. TYPE Type = INTEGER;
  6274. BEGIN
  6275. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6276. RETURN RESULT
  6277. END "MIN";
  6278. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6279. VAR lval, val: SHORTINT;
  6280. BEGIN
  6281. SYSTEM.GET( radr, val );
  6282. WHILE (len > 0) DO
  6283. SYSTEM.GET( ladr, lval );
  6284. INC( ladr, linc ); DEC( len );
  6285. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6286. INC(dadr,dinc);
  6287. END;
  6288. END MinASSSLoop;
  6289. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6290. TYPE Type = SHORTINT;
  6291. BEGIN
  6292. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6293. RETURN RESULT
  6294. END "MIN";
  6295. (**** binary max/min operators array x array -> array ********************************************************************)
  6296. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6297. VAR lval, rval: LONGREAL;
  6298. BEGIN
  6299. WHILE (len > 0) DO
  6300. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6301. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6302. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6303. INC(dadr,dinc);
  6304. END;
  6305. END MaxAXAXLoop;
  6306. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6307. BEGIN
  6308. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6309. RETURN RESULT
  6310. END "MAX";
  6311. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6312. VAR lval, rval: REAL ;
  6313. BEGIN
  6314. WHILE (len > 0) DO
  6315. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6316. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6317. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6318. INC(dadr,dinc);
  6319. END;
  6320. END MaxARARLoop;
  6321. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6322. BEGIN
  6323. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6324. RETURN RESULT
  6325. END "MAX";
  6326. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6327. VAR lval, rval: LONGINT;
  6328. BEGIN
  6329. WHILE (len > 0) DO
  6330. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6331. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6332. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6333. INC(dadr,dinc);
  6334. END;
  6335. END MaxALALLoop;
  6336. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6337. BEGIN
  6338. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6339. RETURN RESULT
  6340. END "MAX";
  6341. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6342. VAR lval, rval: INTEGER;
  6343. BEGIN
  6344. WHILE (len > 0) DO
  6345. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6346. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6347. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6348. INC(dadr,dinc);
  6349. END;
  6350. END MaxAIAILoop;
  6351. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6352. BEGIN
  6353. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6354. RETURN RESULT
  6355. END "MAX";
  6356. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6357. VAR lval, rval: SHORTINT;
  6358. BEGIN
  6359. WHILE (len > 0) DO
  6360. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6361. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6362. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6363. INC(dadr,dinc);
  6364. END;
  6365. END MaxASASLoop;
  6366. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6367. BEGIN
  6368. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6369. RETURN RESULT
  6370. END "MAX";
  6371. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6372. VAR lval, rval: LONGREAL;
  6373. BEGIN
  6374. WHILE (len > 0) DO
  6375. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6376. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6377. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6378. INC(dadr,dinc);
  6379. END;
  6380. END MinAXAXLoop;
  6381. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6382. BEGIN
  6383. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6384. RETURN RESULT
  6385. END "MIN";
  6386. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6387. VAR lval, rval: REAL ;
  6388. BEGIN
  6389. WHILE (len > 0) DO
  6390. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6391. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6392. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6393. INC(dadr,dinc);
  6394. END;
  6395. END MinARARLoop;
  6396. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6397. BEGIN
  6398. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6399. RETURN RESULT
  6400. END "MIN";
  6401. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6402. VAR lval, rval: LONGINT;
  6403. BEGIN
  6404. WHILE (len > 0) DO
  6405. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6406. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6407. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6408. INC(dadr,dinc);
  6409. END;
  6410. END MinALALLoop;
  6411. *)
  6412. TYPE
  6413. LongintPtr = POINTER {UNSAFE} TO RECORD val: LONGINT END;
  6414. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6415. BEGIN
  6416. WHILE (len > 0) DO
  6417. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6418. ladr := ladr + linc;
  6419. radr := radr + rinc;
  6420. dadr := dadr + dinc;
  6421. DEC(len);
  6422. END;
  6423. END MinALALLoop;
  6424. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6425. BEGIN
  6426. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6427. RETURN RESULT
  6428. END "MIN";
  6429. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6430. VAR lval, rval: INTEGER;
  6431. BEGIN
  6432. WHILE (len > 0) DO
  6433. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6434. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6435. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6436. INC(dadr,dinc);
  6437. END;
  6438. END MinAIAILoop;
  6439. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6440. BEGIN
  6441. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6442. RETURN RESULT
  6443. END "MIN";
  6444. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6445. VAR lval, rval: SHORTINT;
  6446. BEGIN
  6447. WHILE (len > 0) DO
  6448. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6449. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6450. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6451. INC(dadr,dinc);
  6452. END;
  6453. END MinASASLoop;
  6454. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6455. BEGIN
  6456. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6457. RETURN RESULT
  6458. END "MIN";
  6459. (**** unary operators array -> scalar ********************************************************************)
  6460. (*** min: array -> scalar ****************************************)
  6461. (** SHORTINT *)
  6462. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6463. VAR lval, dval: SHORTINT;
  6464. BEGIN
  6465. SYSTEM.GET( dadr, dval );
  6466. WHILE (len > 0) DO
  6467. SYSTEM.GET( ladr, lval );
  6468. IF lval < dval THEN dval := lval END;
  6469. INC( ladr, linc ); DEC( len );
  6470. END;
  6471. SYSTEM.PUT( dadr, dval );
  6472. END MinASLoop;
  6473. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6474. TYPE Type = SHORTINT;
  6475. VAR val: Type;
  6476. BEGIN
  6477. val := MAX( Type );
  6478. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6479. END "MIN";
  6480. (** INTEGER *)
  6481. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6482. VAR lval, dval: INTEGER;
  6483. BEGIN
  6484. SYSTEM.GET( dadr, dval );
  6485. WHILE (len > 0) DO
  6486. SYSTEM.GET( ladr, lval );
  6487. IF lval < dval THEN dval := lval END;
  6488. INC( ladr, linc ); DEC( len );
  6489. END;
  6490. SYSTEM.PUT( dadr, dval );
  6491. END MinAILoop;
  6492. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6493. TYPE Type = INTEGER;
  6494. VAR val: Type;
  6495. BEGIN
  6496. val := MAX( Type );
  6497. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6498. END "MIN";
  6499. (** LONGINT *)
  6500. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6501. VAR lval, dval: LONGINT;
  6502. BEGIN
  6503. SYSTEM.GET( dadr, dval );
  6504. WHILE (len > 0) DO
  6505. SYSTEM.GET( ladr, lval );
  6506. IF lval < dval THEN dval := lval END;
  6507. INC( ladr, linc ); DEC( len );
  6508. END;
  6509. SYSTEM.PUT( dadr, dval );
  6510. END MinALLoop;
  6511. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6512. TYPE Type = LONGINT;
  6513. VAR val: Type;
  6514. BEGIN
  6515. val := MAX( Type );
  6516. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6517. END "MIN";
  6518. (** REAL *)
  6519. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6520. VAR lval, dval: REAL;
  6521. BEGIN
  6522. SYSTEM.GET( dadr, dval );
  6523. WHILE (len > 0) DO
  6524. SYSTEM.GET( ladr, lval );
  6525. IF lval < dval THEN dval := lval END;
  6526. INC( ladr, linc ); DEC( len );
  6527. END;
  6528. SYSTEM.PUT( dadr, dval );
  6529. END MinARLoop;
  6530. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6531. TYPE Type = REAL;
  6532. VAR val: Type;
  6533. BEGIN
  6534. val := MAX( Type );
  6535. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6536. END "MIN";
  6537. (** LONGREAL *)
  6538. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6539. VAR lval, dval: LONGREAL;
  6540. BEGIN
  6541. SYSTEM.GET( dadr, dval );
  6542. WHILE (len > 0) DO
  6543. SYSTEM.GET( ladr, lval );
  6544. IF lval < dval THEN dval := lval END;
  6545. INC( ladr, linc ); DEC( len );
  6546. END;
  6547. SYSTEM.PUT( dadr, dval );
  6548. END MinAXLoop;
  6549. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6550. TYPE Type = LONGREAL;
  6551. VAR val: Type;
  6552. BEGIN
  6553. val := MAX( Type );
  6554. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6555. END "MIN";
  6556. (*** max: array -> scalar ********************************************************************)
  6557. (** SHORTINT *)
  6558. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6559. VAR lval, dval: SHORTINT;
  6560. BEGIN
  6561. SYSTEM.GET( dadr, dval );
  6562. WHILE (len > 0) DO
  6563. SYSTEM.GET( ladr, lval );
  6564. IF lval > dval THEN dval := lval END;
  6565. INC( ladr, linc ); DEC( len );
  6566. END;
  6567. SYSTEM.PUT( dadr, dval );
  6568. END MaxASLoop;
  6569. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6570. TYPE Type = SHORTINT;
  6571. VAR val: Type;
  6572. BEGIN
  6573. val := MIN( Type );
  6574. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6575. END "MAX";
  6576. (** INTEGER *)
  6577. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6578. VAR lval, dval: INTEGER;
  6579. BEGIN
  6580. SYSTEM.GET( dadr, dval );
  6581. WHILE (len > 0) DO
  6582. SYSTEM.GET( ladr, lval );
  6583. IF lval > dval THEN dval := lval END;
  6584. INC( ladr, linc ); DEC( len );
  6585. END;
  6586. SYSTEM.PUT( dadr, dval );
  6587. END MaxAILoop;
  6588. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6589. TYPE Type = INTEGER;
  6590. VAR val: Type;
  6591. BEGIN
  6592. val := MIN( Type );
  6593. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6594. END "MAX";
  6595. (** LONGINT *)
  6596. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6597. VAR lval, dval: LONGINT;
  6598. BEGIN
  6599. SYSTEM.GET( dadr, dval );
  6600. WHILE (len > 0) DO
  6601. SYSTEM.GET( ladr, lval );
  6602. IF lval > dval THEN dval := lval END;
  6603. INC( ladr, linc ); DEC( len );
  6604. END;
  6605. SYSTEM.PUT( dadr, dval );
  6606. END MaxALLoop;
  6607. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6608. TYPE Type = LONGINT;
  6609. VAR val: Type;
  6610. BEGIN
  6611. val := MIN( Type );
  6612. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6613. END "MAX";
  6614. (** REAL *)
  6615. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6616. VAR lval, dval: REAL;
  6617. BEGIN
  6618. SYSTEM.GET( dadr, dval );
  6619. WHILE (len > 0) DO
  6620. SYSTEM.GET( ladr, lval );
  6621. IF lval > dval THEN dval := lval END;
  6622. INC( ladr, linc ); DEC( len );
  6623. END;
  6624. SYSTEM.PUT( dadr, dval );
  6625. END MaxARLoop;
  6626. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6627. TYPE Type = REAL;
  6628. VAR val: Type;
  6629. BEGIN
  6630. val := MIN( Type );
  6631. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6632. END "MAX";
  6633. (** LONGREAL *)
  6634. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6635. VAR lval, dval: LONGREAL;
  6636. BEGIN
  6637. SYSTEM.GET( dadr, dval );
  6638. WHILE (len > 0) DO
  6639. SYSTEM.GET( ladr, lval );
  6640. IF lval > dval THEN dval := lval END;
  6641. INC( ladr, linc ); DEC( len );
  6642. END;
  6643. SYSTEM.PUT( dadr, dval );
  6644. END MaxAXLoop;
  6645. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6646. TYPE Type = LONGREAL;
  6647. VAR val: Type;
  6648. BEGIN
  6649. val := MIN( Type );
  6650. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6651. END "MAX";
  6652. (*** LEN: array -> array **)
  6653. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6654. VAR src,dim,i: LONGINT;
  6655. BEGIN
  6656. src := SYSTEM.VAL(LONGINT,left);
  6657. dim := GetDim( src );
  6658. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6659. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6660. RETURN RESULT
  6661. END "LEN";
  6662. (*** SUM: array -> scalar ********************************************************************)
  6663. (** SHORTINT *)
  6664. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6665. VAR lval, dval: SHORTINT;
  6666. BEGIN
  6667. SYSTEM.GET( dadr, dval );
  6668. WHILE (len > 0) DO
  6669. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6670. END;
  6671. SYSTEM.PUT( dadr, dval );
  6672. END SumASLoop;
  6673. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6674. TYPE Type = SHORTINT;
  6675. VAR val: Type;
  6676. BEGIN
  6677. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6678. RETURN val;
  6679. END "SUM";
  6680. (** INTEGER *)
  6681. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6682. VAR lval, dval: INTEGER;
  6683. BEGIN
  6684. SYSTEM.GET( dadr, dval );
  6685. WHILE (len > 0) DO
  6686. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6687. END;
  6688. SYSTEM.PUT( dadr, dval );
  6689. END SumAILoop;
  6690. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6691. TYPE Type = INTEGER;
  6692. VAR val: Type;
  6693. BEGIN
  6694. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6695. RETURN val;
  6696. END "SUM";
  6697. (** LONGINT *)
  6698. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6699. VAR lval, dval: LONGINT;
  6700. BEGIN
  6701. SYSTEM.GET( dadr, dval );
  6702. WHILE (len > 0) DO
  6703. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6704. END;
  6705. SYSTEM.PUT( dadr, dval );
  6706. END SumALLoop;
  6707. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6708. TYPE Type = LONGINT;
  6709. VAR val: Type;
  6710. BEGIN
  6711. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6712. RETURN val;
  6713. END "SUM";
  6714. (** REAL *)
  6715. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6716. VAR lval, dval: REAL;
  6717. BEGIN
  6718. SYSTEM.GET( dadr, dval );
  6719. WHILE (len > 0) DO
  6720. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6721. END;
  6722. SYSTEM.PUT( dadr, dval );
  6723. END SumARLoop;
  6724. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6725. TYPE Type = REAL;
  6726. VAR val: Type;
  6727. BEGIN
  6728. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6729. RETURN val;
  6730. END "SUM";
  6731. (** LONGREAL *)
  6732. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6733. VAR lval, dval: LONGREAL;
  6734. BEGIN
  6735. SYSTEM.GET( dadr, dval );
  6736. WHILE (len > 0) DO
  6737. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6738. END;
  6739. SYSTEM.PUT( dadr, dval );
  6740. END SumAXLoop;
  6741. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6742. TYPE Type = LONGREAL;
  6743. VAR val: Type;
  6744. BEGIN
  6745. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6746. RETURN val;
  6747. END "SUM";
  6748. (** COMPLEX *)
  6749. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6750. VAR lval, dval: COMPLEX;
  6751. BEGIN
  6752. SYSTEM.GET( dadr, dval );
  6753. WHILE (len > 0) DO
  6754. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6755. END;
  6756. SYSTEM.PUT( dadr, dval );
  6757. END SumAZLoop;
  6758. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6759. TYPE Type = COMPLEX;
  6760. VAR val: Type;
  6761. BEGIN
  6762. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6763. RETURN val;
  6764. END "SUM";
  6765. (** LONGCOMPLEX *)
  6766. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6767. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6768. BEGIN
  6769. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6770. WHILE (len > 0) DO
  6771. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6772. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6773. INC( ladr, linc ); DEC( len );
  6774. END;
  6775. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6776. END SumALZLoop;
  6777. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6778. TYPE Type = LONGCOMPLEX;
  6779. VAR val: Type;
  6780. BEGIN
  6781. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6782. RETURN val;
  6783. END "SUM";
  6784. (*** monadic ABS array -> array ********************************************************************)
  6785. (** SHORTINT *)
  6786. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6787. VAR lval: SHORTINT;
  6788. BEGIN
  6789. WHILE (len > 0) DO
  6790. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6791. INC( dadr, dinc ); DEC( len );
  6792. END;
  6793. END AbsLoopS;
  6794. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6795. BEGIN
  6796. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6797. RETURN RESULT
  6798. END "ABS";
  6799. (** INTEGER *)
  6800. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6801. VAR lval: INTEGER;
  6802. BEGIN
  6803. WHILE (len > 0) DO
  6804. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6805. INC( dadr, dinc ); DEC( len );
  6806. END;
  6807. END AbsLoopI;
  6808. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6809. BEGIN
  6810. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6811. RETURN RESULT
  6812. END "ABS";
  6813. (** LONGINT *)
  6814. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6815. VAR lval: LONGINT;
  6816. BEGIN
  6817. WHILE (len > 0) DO
  6818. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6819. INC( dadr, dinc ); DEC( len );
  6820. END;
  6821. END AbsLoopL;
  6822. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6823. BEGIN
  6824. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6825. RETURN RESULT
  6826. END "ABS";
  6827. (** REAL *)
  6828. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6829. VAR lval: REAL;
  6830. BEGIN
  6831. WHILE (len > 0) DO
  6832. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6833. INC( dadr, dinc ); DEC( len );
  6834. END;
  6835. END AbsLoopR;
  6836. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6837. BEGIN
  6838. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6839. RETURN RESULT
  6840. END "ABS";
  6841. (** LONGREAL *)
  6842. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6843. VAR lval: LONGREAL;
  6844. BEGIN
  6845. WHILE (len > 0) DO
  6846. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6847. INC( dadr, dinc ); DEC( len );
  6848. END;
  6849. END AbsLoopX;
  6850. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6851. BEGIN
  6852. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6853. RETURN RESULT
  6854. END "ABS";
  6855. (** COMPLEX *)
  6856. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6857. VAR lval: COMPLEX;
  6858. BEGIN
  6859. WHILE (len > 0) DO
  6860. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6861. INC( dadr, dinc ); DEC( len );
  6862. END;
  6863. END AbsLoopZ;
  6864. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6865. BEGIN
  6866. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6867. RETURN RESULT
  6868. END "ABS";
  6869. (** LONGCOMPLEX *)
  6870. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6871. VAR lvalRe, lvalIm: LONGREAL;
  6872. BEGIN
  6873. WHILE (len > 0) DO
  6874. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6875. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6876. INC( ladr, linc );
  6877. INC( dadr, dinc ); DEC( len );
  6878. END;
  6879. END AbsLoopLZ;
  6880. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6881. BEGIN
  6882. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6883. RETURN RESULT
  6884. END "ABS";
  6885. (*** assign number to array (initialisation) ********************************************************************)
  6886. (** BOOLEAN *)
  6887. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6888. VAR lval: BOOLEAN;
  6889. BEGIN
  6890. SYSTEM.GET( ladr, lval );
  6891. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6892. END AssignSBABLoop;
  6893. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6894. BEGIN
  6895. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6896. END ":=";
  6897. (** SHORTINT*)
  6898. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6899. VAR lval: SHORTINT;
  6900. BEGIN
  6901. SYSTEM.GET( ladr, lval );
  6902. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6903. END AssignSSASLoop;
  6904. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6905. BEGIN
  6906. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6907. END ":=";
  6908. (**INTEGER *)
  6909. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6910. VAR lval: INTEGER;
  6911. BEGIN
  6912. SYSTEM.GET( ladr, lval );
  6913. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6914. END AssignSIAILoop;
  6915. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6916. BEGIN
  6917. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6918. END ":=";
  6919. (** LONGINT *)
  6920. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6921. VAR lval: LONGINT;
  6922. BEGIN
  6923. SYSTEM.GET( ladr, lval );
  6924. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6925. END AssignSLALLoop;
  6926. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6927. BEGIN
  6928. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6929. END ":=";
  6930. (** REAL *)
  6931. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6932. VAR lval: REAL;
  6933. BEGIN
  6934. SYSTEM.GET( ladr, lval );
  6935. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6936. END AssignSRARLoop;
  6937. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6938. BEGIN
  6939. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6940. END ":=";
  6941. (** LONGREAL *)
  6942. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6943. VAR lval: LONGREAL;
  6944. BEGIN
  6945. SYSTEM.GET( ladr, lval );
  6946. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6947. END AssignSXAXLoop;
  6948. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6949. BEGIN
  6950. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6951. END ":=";
  6952. (** COMPLEX *)
  6953. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6954. VAR lval: COMPLEX;
  6955. BEGIN
  6956. SYSTEM.GET( ladr, lval );
  6957. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6958. END AssignSZAZLoop;
  6959. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6960. BEGIN
  6961. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6962. END ":=";
  6963. (** LONGCOMPLEX *)
  6964. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6965. VAR lvalRe, lvalIm: LONGREAL;
  6966. BEGIN
  6967. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6968. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6969. END AssignSLZALZLoop;
  6970. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6971. BEGIN
  6972. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6973. END ":=";
  6974. (*** matrix multipliation ********************************************************************)
  6975. PROCEDURE AllocateMatrix( dest: ADDRESS;
  6976. rows, cols, elementsize: LONGINT ): ANY;
  6977. VAR p: ANY;
  6978. BEGIN
  6979. (*
  6980. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  6981. *)
  6982. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  6983. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  6984. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  6985. PutPtr( dest, p); RETURN p;
  6986. END AllocateMatrix;
  6987. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: LONGINT ): ANY;
  6988. VAR p: ANY;
  6989. BEGIN
  6990. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  6991. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  6992. PutPtr( dest, p ); RETURN p;
  6993. END AllocateVector;
  6994. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: LONGINT;
  6995. loop: BinaryAASLoop;
  6996. fast: FastMatMul ); (* Size= element-size *)
  6997. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  6998. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  6999. BEGIN
  7000. (*
  7001. <- 1 ->
  7002. xxx xxxx -> xxxx
  7003. ^ xxx xxxx xxxx
  7004. 0 xxx xxxx xxxx
  7005. v xxx xxxx
  7006. xxx xxxx
  7007. Len(..,1): #columns ; Inc(..,1): inc in rows
  7008. Len(..,0): #rows ; Inc(..,0): inc between rows
  7009. *)
  7010. (* apply multiplication D = L * R *)
  7011. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7012. colsL := GetLen( left, 1 ); (* # left columns *)
  7013. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7014. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7015. (* check geometric restriction *)
  7016. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7017. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7018. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7019. IF RangeFlag IN GetFlags( dest ) THEN
  7020. Halt( GeometryMismatch, left, right, dest )
  7021. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7022. END;
  7023. END;
  7024. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7025. IF overlap THEN
  7026. destOld := dest; destNew := 0;
  7027. p := AllocateSame( destNew, destOld, Size );
  7028. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7029. dest := destNew;
  7030. END;
  7031. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7032. HALT( 9999 )
  7033. END;
  7034. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7035. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7036. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7037. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7038. (*
  7039. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7040. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7041. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7042. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7043. *)
  7044. IF rowsL = 0 THEN RETURN
  7045. ELSIF colsL=0 THEN RETURN
  7046. ELSIF colsR=0 THEN RETURN
  7047. ELSIF (fast = NIL ) OR
  7048. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7049. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7050. radri := radr; dadri := dadr; colsRi := colsR;
  7051. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7052. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7053. INC( dadri, incD ); DEC( colsRi );
  7054. END;
  7055. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7056. END;
  7057. END;
  7058. IF overlap THEN CopyContent( destOld, dest, Size );
  7059. END;
  7060. END ApplyMatMulLoop;
  7061. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7062. Size: LONGINT; loop: BinaryAASLoop;
  7063. fast: FastMatMul ); (* Size= element-size *)
  7064. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7065. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7066. BEGIN
  7067. (*
  7068. <- 0 ->
  7069. xxx T(xxx) -> T(xxxxx)
  7070. xxx
  7071. 1 xxx
  7072. xxx
  7073. xxx
  7074. Len(..,0): #columns ; Inc(..,0): inc in rows
  7075. Len(..,1): #rows ; Inc(..,1): inc between rows
  7076. *)
  7077. (* check geometric restriction *)
  7078. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7079. Halt( GeometryMismatch, left, right,0 );
  7080. END;
  7081. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7082. l2 := GetLen( left, 1 ); (* inner loop len *)
  7083. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7084. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7085. IF RangeFlag IN GetFlags( dest ) THEN
  7086. Halt( GeometryMismatch, left, right, dest );
  7087. ELSE p := AllocateVector( dest, l1, Size );
  7088. END;
  7089. END;
  7090. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7091. IF overlap THEN
  7092. destOld := dest; destNew := 0;
  7093. p := AllocateSame( destNew, destOld, Size );
  7094. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7095. dest := destNew;
  7096. END;
  7097. (*
  7098. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7099. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7100. END;
  7101. *)
  7102. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7103. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7104. di0 := GetIncr( dest, 0 );
  7105. IF l1=0 THEN RETURN
  7106. ELSIF l2=0 THEN RETURN
  7107. ELSIF (fast = NIL ) OR
  7108. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7109. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7110. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7111. DEC( l1 );
  7112. END;
  7113. END;
  7114. IF overlap THEN CopyContent( destOld, dest, Size );
  7115. END;
  7116. END ApplyMatVecMulLoop;
  7117. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7118. Size: LONGINT; loop: BinaryAASLoop;
  7119. fast: FastMatMul ); (* Size= element-size *)
  7120. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7121. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7122. BEGIN
  7123. (*
  7124. <- 0 ->
  7125. xxx xxxx -> xxxx
  7126. xxxx
  7127. 1 xxxx
  7128. Len(..,0): #columns ; Inc(..,0): inc in rows
  7129. Len(..,1): #rows ; Inc(..,1): inc between rows
  7130. *)
  7131. (* check geometric restriction *)
  7132. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7133. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7134. l2 := GetLen( right, 0 ); (* inner loop len *)
  7135. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7136. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7137. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7138. ELSE p := AllocateVector( dest, l0, Size );
  7139. END;
  7140. END;
  7141. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7142. IF overlap THEN
  7143. destOld := dest; destNew := 0;
  7144. p := AllocateSame( destNew, destOld, Size );
  7145. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7146. dest := destNew;
  7147. END;
  7148. (*
  7149. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7150. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7151. END;
  7152. *)
  7153. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7154. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7155. di0 := GetIncr( dest, 0 );
  7156. IF l2=0 THEN RETURN
  7157. ELSIF l0=0 THEN RETURN
  7158. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7159. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7160. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7161. DEC( l0 );
  7162. END;
  7163. END;
  7164. IF overlap THEN CopyContent( destOld, dest, Size );
  7165. END;
  7166. END ApplyVecMatMulLoop;
  7167. (** SHORTINT *)
  7168. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7169. VAR lval, rval, dval: SHORTINT;
  7170. BEGIN
  7171. dval := 0;
  7172. WHILE (len > 0) DO
  7173. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7174. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7175. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7176. END;
  7177. SYSTEM.PUT( dadr, dval );
  7178. END MatMulASASLoop;
  7179. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7180. BEGIN
  7181. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7182. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7183. RETURN RESULT
  7184. END "*";
  7185. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7186. BEGIN
  7187. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7188. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7189. RETURN RESULT
  7190. END "*";
  7191. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7192. BEGIN
  7193. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7194. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7195. RETURN RESULT
  7196. END "*";
  7197. (** INTEGER *)
  7198. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7199. VAR lval, rval, dval: INTEGER;
  7200. BEGIN
  7201. dval := 0;
  7202. WHILE (len > 0) DO
  7203. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7204. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7205. END;
  7206. SYSTEM.PUT( dadr, dval );
  7207. END MatMulAIAILoop;
  7208. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7209. BEGIN
  7210. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7211. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7212. RETURN RESULT
  7213. END "*";
  7214. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7215. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7216. BEGIN
  7217. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7218. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7219. RETURN RESULT
  7220. END "*";
  7221. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7222. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7223. BEGIN
  7224. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7225. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7226. RETURN RESULT
  7227. END "*";
  7228. (** LONGINT *)
  7229. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7230. VAR lval, rval, dval: LONGINT;
  7231. BEGIN
  7232. dval := 0;
  7233. WHILE (len > 0) DO
  7234. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7235. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7236. END;
  7237. SYSTEM.PUT( dadr, dval );
  7238. END MatMulALALLoop;
  7239. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7240. BEGIN
  7241. (*
  7242. KernelLog.String("MatMulALAL");
  7243. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7244. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7245. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7246. KernelLog.Ln;
  7247. *)
  7248. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7249. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7250. RETURN RESULT
  7251. END "*";
  7252. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7253. BEGIN
  7254. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7255. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7256. RETURN RESULT
  7257. END "*";
  7258. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7259. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7260. BEGIN
  7261. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7262. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7263. RETURN RESULT
  7264. END "*";
  7265. (** REAL *)
  7266. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7267. VAR lval, rval, dval: REAL;
  7268. BEGIN
  7269. dval := 0;
  7270. WHILE (len > 0) DO
  7271. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7272. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7273. END;
  7274. SYSTEM.PUT( dadr, dval );
  7275. END MatMulARARLoop;
  7276. (*
  7277. Optimized for small matrices (Alexey Morozov)
  7278. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7279. *)
  7280. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7281. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7282. BEGIN
  7283. dadr := GetAdr(ADDRESSOF(RESULT));
  7284. ladr := GetAdr(ADDRESSOF(left));
  7285. radr := GetAdr(ADDRESSOF(right));
  7286. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7287. IF (ladr # dadr) & (radr # dadr) THEN
  7288. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7289. CASE SYSTEM.VAL(LONGINT,flags) OF
  7290. Mat2x2:
  7291. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7292. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7293. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7294. END;
  7295. END;
  7296. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7297. ELSE
  7298. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7299. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7300. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7301. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7302. END;
  7303. |Mat3x3:
  7304. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7305. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7306. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7307. END;
  7308. END;
  7309. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7310. ELSE
  7311. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7312. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7313. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7314. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7315. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7316. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7317. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7318. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7319. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7320. END;
  7321. |Mat4x4:
  7322. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7323. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7324. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7325. END;
  7326. END;
  7327. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7328. ELSE
  7329. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0] + left[0,3]*right[3,0];
  7330. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1] + left[0,3]*right[3,1];
  7331. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2] + left[0,3]*right[3,2];
  7332. RESULT[0,3] := left[0,0]*right[0,3] + left[0,1]*right[1,3] + left[0,2]*right[2,3] + left[0,3]*right[3,3];
  7333. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0] + left[1,3]*right[3,0];
  7334. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1] + left[1,3]*right[3,1];
  7335. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2] + left[1,3]*right[3,2];
  7336. RESULT[1,3] := left[1,0]*right[0,3] + left[1,1]*right[1,3] + left[1,2]*right[2,3] + left[1,3]*right[3,3];
  7337. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0] + left[2,3]*right[3,0];
  7338. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1] + left[2,3]*right[3,1];
  7339. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2] + left[2,3]*right[3,2];
  7340. RESULT[2,3] := left[2,0]*right[0,3] + left[2,1]*right[1,3] + left[2,2]*right[2,3] + left[2,3]*right[3,3];
  7341. RESULT[3,0] := left[3,0]*right[0,0] + left[3,1]*right[1,0] + left[3,2]*right[2,0] + left[3,3]*right[3,0];
  7342. RESULT[3,1] := left[3,0]*right[0,1] + left[3,1]*right[1,1] + left[3,2]*right[2,1] + left[3,3]*right[3,1];
  7343. RESULT[3,2] := left[3,0]*right[0,2] + left[3,1]*right[1,2] + left[3,2]*right[2,2] + left[3,3]*right[3,2];
  7344. RESULT[3,3] := left[3,0]*right[0,3] + left[3,1]*right[1,3] + left[3,2]*right[2,3] + left[3,3]*right[3,3];
  7345. END;
  7346. ELSE
  7347. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7348. loopMatMulARAR, matMulR );
  7349. END;
  7350. ELSE
  7351. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7352. loopMatMulARAR, matMulR );
  7353. END;
  7354. RETURN RESULT
  7355. END "*";
  7356. (*
  7357. Optimized for small arrays (Alexey Morozov)
  7358. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7359. *)
  7360. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7361. VAR
  7362. flags: SET; dadr, ladr, radr: LONGINT;
  7363. v0, v1, v2: REAL;
  7364. BEGIN
  7365. dadr := GetAdr(ADDRESSOF(RESULT));
  7366. ladr := GetAdr(ADDRESSOF(left));
  7367. radr := GetAdr(ADDRESSOF(right));
  7368. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7369. CASE SYSTEM.VAL(LONGINT,flags) OF
  7370. MatVec2x2:
  7371. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7372. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7373. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7374. END;
  7375. END;
  7376. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7377. ELSE
  7378. (* account possible overlapping *)
  7379. v0 := right[0];
  7380. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7381. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7382. END;
  7383. |MatVec3x3:
  7384. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7385. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7386. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7387. END;
  7388. END;
  7389. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7390. ELSE
  7391. (* account possible overlapping *)
  7392. v0 := right[0]; v1 := right[1];
  7393. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7394. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7395. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7396. END;
  7397. |MatVec4x4:
  7398. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7399. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7400. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7401. END;
  7402. END;
  7403. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7404. ELSE
  7405. (* account possible overlapping *)
  7406. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7407. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7408. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7409. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7410. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7411. END;
  7412. ELSE
  7413. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7414. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7415. END;
  7416. RETURN RESULT
  7417. END "*";
  7418. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7419. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7420. BEGIN
  7421. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7422. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7423. RETURN RESULT
  7424. END "*";
  7425. (** LONGREAL *)
  7426. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7427. VAR lval, rval, dval: LONGREAL;
  7428. BEGIN
  7429. dval := 0;
  7430. WHILE (len > 0) DO
  7431. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7432. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7433. END;
  7434. SYSTEM.PUT( dadr, dval );
  7435. END MatMulAXAXLoop;
  7436. (*
  7437. Optimized for small matrices (Alexey Morozov)
  7438. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7439. *)
  7440. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7441. VAR
  7442. flags: SET; dadr, ladr, radr: LONGINT;
  7443. BEGIN
  7444. dadr := GetAdr(ADDRESSOF(RESULT));
  7445. ladr := GetAdr(ADDRESSOF(left));
  7446. radr := GetAdr(ADDRESSOF(right));
  7447. IF (ladr # dadr) & (radr # dadr) THEN
  7448. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7449. CASE SYSTEM.VAL(LONGINT,flags) OF
  7450. Mat2x2:
  7451. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7452. IF dadr = 0 THEN NEW(RESULT,2,2);
  7453. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7454. END;
  7455. END;
  7456. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7457. ELSE
  7458. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7459. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7460. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7461. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7462. END;
  7463. |Mat3x3:
  7464. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7465. IF dadr = 0 THEN NEW(RESULT,3,3);
  7466. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7467. END;
  7468. END;
  7469. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7470. ELSE
  7471. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7472. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7473. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7474. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7475. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7476. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7477. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7478. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7479. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7480. END;
  7481. |Mat4x4:
  7482. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7483. IF dadr = 0 THEN NEW(RESULT,4,4);
  7484. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7485. END;
  7486. END;
  7487. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7488. ELSE
  7489. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0] + left[0,3]*right[3,0];
  7490. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1] + left[0,3]*right[3,1];
  7491. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2] + left[0,3]*right[3,2];
  7492. RESULT[0,3] := left[0,0]*right[0,3] + left[0,1]*right[1,3] + left[0,2]*right[2,3] + left[0,3]*right[3,3];
  7493. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0] + left[1,3]*right[3,0];
  7494. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1] + left[1,3]*right[3,1];
  7495. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2] + left[1,3]*right[3,2];
  7496. RESULT[1,3] := left[1,0]*right[0,3] + left[1,1]*right[1,3] + left[1,2]*right[2,3] + left[1,3]*right[3,3];
  7497. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0] + left[2,3]*right[3,0];
  7498. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1] + left[2,3]*right[3,1];
  7499. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2] + left[2,3]*right[3,2];
  7500. RESULT[2,3] := left[2,0]*right[0,3] + left[2,1]*right[1,3] + left[2,2]*right[2,3] + left[2,3]*right[3,3];
  7501. RESULT[3,0] := left[3,0]*right[0,0] + left[3,1]*right[1,0] + left[3,2]*right[2,0] + left[3,3]*right[3,0];
  7502. RESULT[3,1] := left[3,0]*right[0,1] + left[3,1]*right[1,1] + left[3,2]*right[2,1] + left[3,3]*right[3,1];
  7503. RESULT[3,2] := left[3,0]*right[0,2] + left[3,1]*right[1,2] + left[3,2]*right[2,2] + left[3,3]*right[3,2];
  7504. RESULT[3,3] := left[3,0]*right[0,3] + left[3,1]*right[1,3] + left[3,2]*right[2,3] + left[3,3]*right[3,3];
  7505. END;
  7506. ELSE
  7507. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7508. loopMatMulAXAX, matMulX );
  7509. END;
  7510. ELSE
  7511. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7512. loopMatMulAXAX, matMulX );
  7513. END;
  7514. RETURN RESULT
  7515. END "*";
  7516. (*
  7517. Optimized for small arrays (Alexey Morozov)
  7518. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7519. *)
  7520. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7521. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7522. VAR
  7523. flags: SET; dadr, ladr, radr: LONGINT;
  7524. v0, v1, v2: LONGREAL;
  7525. BEGIN
  7526. dadr := GetAdr(ADDRESSOF(RESULT));
  7527. ladr := GetAdr(ADDRESSOF(left));
  7528. radr := GetAdr(ADDRESSOF(right));
  7529. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7530. CASE SYSTEM.VAL(LONGINT,flags) OF
  7531. MatVec2x2:
  7532. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7533. IF dadr = 0 THEN NEW(RESULT,2);
  7534. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7535. END;
  7536. END;
  7537. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7538. ELSE
  7539. (* account possible overlapping *)
  7540. v0 := right[0];
  7541. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7542. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7543. END;
  7544. |MatVec3x3:
  7545. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7546. IF dadr = 0 THEN NEW(RESULT,3);
  7547. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7548. END;
  7549. END;
  7550. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7551. ELSE
  7552. (* account possible overlapping *)
  7553. v0 := right[0]; v1 := right[1];
  7554. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7555. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7556. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7557. END;
  7558. |MatVec4x4:
  7559. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7560. IF dadr = 0 THEN NEW(RESULT,4);
  7561. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7562. END;
  7563. END;
  7564. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7565. ELSE
  7566. (* account possible overlapping *)
  7567. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7568. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7569. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7570. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7571. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7572. END;
  7573. ELSE
  7574. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7575. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7576. END;
  7577. RETURN RESULT
  7578. END "*";
  7579. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7580. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7581. BEGIN
  7582. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7583. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7584. RETURN RESULT
  7585. END "*";
  7586. (** SHORTINT *)
  7587. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7588. VAR lval, rval, dval: SHORTINT;
  7589. BEGIN
  7590. SYSTEM.GET( dadr, dval );
  7591. WHILE (len > 0) DO
  7592. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7593. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7594. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7595. END;
  7596. SYSTEM.PUT( dadr, dval );
  7597. END MatMulIncASASLoop;
  7598. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7599. BEGIN
  7600. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7601. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7602. RETURN RESULT
  7603. END "INCMUL";
  7604. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7605. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7606. BEGIN
  7607. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7608. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7609. RETURN RESULT
  7610. END "INCMUL";
  7611. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7612. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7613. BEGIN
  7614. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7615. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7616. RETURN RESULT
  7617. END "INCMUL";
  7618. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7619. BEGIN
  7620. RESULT := -RESULT;
  7621. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7622. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7623. RESULT := -RESULT;
  7624. RETURN RESULT
  7625. END "DECMUL";
  7626. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7627. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7628. BEGIN
  7629. RESULT := -RESULT;
  7630. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7631. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7632. RESULT := -RESULT;
  7633. RETURN RESULT
  7634. END "DECMUL";
  7635. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7636. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7637. BEGIN
  7638. RESULT := -RESULT;
  7639. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7640. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7641. RESULT := -RESULT;
  7642. RETURN RESULT
  7643. END "DECMUL";
  7644. (** INTEGER *)
  7645. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7646. VAR lval, rval, dval: INTEGER;
  7647. BEGIN
  7648. SYSTEM.GET( dadr, dval );
  7649. WHILE (len > 0) DO
  7650. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7651. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7652. END;
  7653. SYSTEM.PUT( dadr, dval );
  7654. END MatMulIncAIAILoop;
  7655. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7656. BEGIN
  7657. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7658. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7659. RETURN RESULT
  7660. END "INCMUL";
  7661. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7662. BEGIN
  7663. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7664. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7665. RETURN RESULT
  7666. END "INCMUL";
  7667. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7668. BEGIN
  7669. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7670. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7671. RETURN RESULT
  7672. END "INCMUL";
  7673. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7674. BEGIN
  7675. RESULT := -RESULT;
  7676. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7677. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7678. RESULT := -RESULT;
  7679. RETURN RESULT
  7680. END "DECMUL";
  7681. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7682. BEGIN
  7683. RESULT := -RESULT;
  7684. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7685. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7686. RESULT := -RESULT;
  7687. RETURN RESULT
  7688. END "DECMUL";
  7689. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7690. BEGIN
  7691. RESULT := -RESULT;
  7692. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7693. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7694. RESULT := -RESULT;
  7695. RETURN RESULT
  7696. END "DECMUL";
  7697. (** LONGINT *)
  7698. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7699. VAR lval, rval, dval: LONGINT;
  7700. BEGIN
  7701. SYSTEM.GET( dadr, dval );
  7702. WHILE (len > 0) DO
  7703. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7704. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7705. END;
  7706. SYSTEM.PUT( dadr, dval );
  7707. END MatMulIncALALLoop;
  7708. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7709. BEGIN
  7710. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7711. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7712. RETURN RESULT
  7713. END "INCMUL";
  7714. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7715. BEGIN
  7716. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7717. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7718. RETURN RESULT
  7719. END "INCMUL";
  7720. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7721. BEGIN
  7722. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7723. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7724. RETURN RESULT
  7725. END "INCMUL";
  7726. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7727. BEGIN
  7728. RESULT := -RESULT;
  7729. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7730. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7731. RESULT := -RESULT;
  7732. RETURN RESULT
  7733. END "DECMUL";
  7734. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7735. BEGIN
  7736. RESULT := -RESULT;
  7737. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7738. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7739. RESULT := -RESULT;
  7740. RETURN RESULT
  7741. END "DECMUL";
  7742. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7743. BEGIN
  7744. RESULT := -RESULT;
  7745. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7746. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7747. RESULT := -RESULT;
  7748. RETURN RESULT
  7749. END "DECMUL";
  7750. (** REAL *)
  7751. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7752. VAR lval, rval, dval: REAL;
  7753. BEGIN
  7754. SYSTEM.GET( dadr, dval );
  7755. WHILE (len > 0) DO
  7756. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7757. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7758. END;
  7759. SYSTEM.PUT( dadr, dval );
  7760. END MatMulIncARARLoop;
  7761. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7762. BEGIN
  7763. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7764. loopMatMulIncARAR, matMulIncR );
  7765. RETURN RESULT
  7766. END "INCMUL";
  7767. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7768. BEGIN
  7769. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7770. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7771. RETURN RESULT
  7772. END "INCMUL";
  7773. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7774. BEGIN
  7775. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7776. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7777. RETURN RESULT
  7778. END "INCMUL";
  7779. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7780. BEGIN
  7781. RESULT := -RESULT;
  7782. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7783. loopMatMulIncARAR, matMulIncR );
  7784. RESULT := -RESULT;
  7785. RETURN RESULT
  7786. END "DECMUL";
  7787. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7788. BEGIN
  7789. RESULT := -RESULT;
  7790. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7791. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7792. RESULT := -RESULT;
  7793. RETURN RESULT
  7794. END "DECMUL";
  7795. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7796. BEGIN
  7797. RESULT := -RESULT;
  7798. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7799. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7800. RESULT := -RESULT;
  7801. RETURN RESULT
  7802. END "DECMUL";
  7803. (** LONGREAL *)
  7804. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7805. VAR lval, rval, dval: LONGREAL;
  7806. BEGIN
  7807. SYSTEM.GET( dadr, dval );
  7808. WHILE (len > 0) DO
  7809. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7810. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7811. END;
  7812. SYSTEM.PUT( dadr, dval );
  7813. END MatMulIncAXAXLoop;
  7814. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7815. BEGIN
  7816. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7817. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7818. RETURN RESULT
  7819. END "INCMUL";
  7820. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7821. BEGIN
  7822. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7823. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7824. RETURN RESULT
  7825. END "INCMUL";
  7826. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7827. BEGIN
  7828. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7829. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7830. RETURN RESULT
  7831. END "INCMUL";
  7832. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7833. BEGIN
  7834. RESULT := -RESULT;
  7835. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7836. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7837. RESULT := -RESULT;
  7838. RETURN RESULT
  7839. END "DECMUL";
  7840. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7841. BEGIN
  7842. RESULT := -RESULT;
  7843. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7844. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7845. RESULT := -RESULT;
  7846. RETURN RESULT
  7847. END "DECMUL";
  7848. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7849. BEGIN
  7850. RESULT := -RESULT;
  7851. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7852. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7853. RESULT := -RESULT;
  7854. RETURN RESULT
  7855. END "DECMUL";
  7856. (*** Cross product ********************************************************************)
  7857. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7858. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7859. BEGIN
  7860. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7861. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7862. END;
  7863. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7864. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7865. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7866. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7867. RETURN RESULT
  7868. END "*";
  7869. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7870. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7871. BEGIN
  7872. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7873. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7874. END;
  7875. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7876. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7877. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7878. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7879. RETURN RESULT
  7880. END "*";
  7881. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7882. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7883. BEGIN
  7884. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7885. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7886. END;
  7887. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7888. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7889. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7890. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7891. RETURN RESULT
  7892. END "*";
  7893. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7894. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7895. BEGIN
  7896. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7897. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7898. END;
  7899. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7900. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7901. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7902. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7903. RETURN RESULT
  7904. END "*";
  7905. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7906. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7907. BEGIN
  7908. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7909. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7910. END;
  7911. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7912. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7913. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7914. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7915. RETURN RESULT
  7916. END "*";
  7917. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  7918. VAR tensor: Tensor;
  7919. BEGIN
  7920. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7921. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7922. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7923. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7924. ELSE HALT(200);
  7925. END;
  7926. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  7927. loopMatMulAXAX, matMulX );
  7928. RETURN RESULT
  7929. END "*";
  7930. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  7931. BEGIN
  7932. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7933. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7934. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7935. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7936. ELSE HALT(200);
  7937. END;
  7938. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  7939. loopMatMulARAR, matMulR );
  7940. RETURN RESULT
  7941. END "*";
  7942. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  7943. BEGIN
  7944. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7945. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7946. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7947. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7948. ELSE HALT(200);
  7949. END;
  7950. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  7951. MatMulALALLoop, NIL );
  7952. RETURN RESULT
  7953. END "*";
  7954. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  7955. BEGIN
  7956. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7957. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7958. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7959. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7960. ELSE HALT(200);
  7961. END;
  7962. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  7963. MatMulAIAILoop,NIL );
  7964. RETURN RESULT
  7965. END "*";
  7966. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  7967. BEGIN
  7968. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7969. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7970. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7971. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7972. ELSE HALT(200);
  7973. END;
  7974. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  7975. MatMulASASLoop, NIL );
  7976. RETURN RESULT
  7977. END "*";
  7978. (** Transpose ********************************************************************)
  7979. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  7980. VAR from1, from2, to1, to2: ADDRESS; dim: LONGINT;
  7981. BEGIN
  7982. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7983. dim := GetDim( src1 ) - 1;
  7984. WHILE (dim > 0) DO
  7985. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7986. END;
  7987. dim := GetDim( src2 ) - 1;
  7988. WHILE (dim > 0) DO
  7989. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7990. END;
  7991. IF from1 < from2 THEN RETURN to1 >= from2;
  7992. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7993. ELSE RETURN TRUE;
  7994. END;
  7995. END Overlap;
  7996. (*
  7997. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  7998. VAR from1, from2, to1, to2: ADDRESS;
  7999. BEGIN
  8000. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8001. DEC( dim );
  8002. WHILE (dim > 0) DO
  8003. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8004. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8005. END;
  8006. IF from1 < from2 THEN RETURN to1 >= from2;
  8007. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8008. ELSE RETURN TRUE;
  8009. END;
  8010. END Overlap;
  8011. *)
  8012. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8013. VAR ptr, data: ANY; Size: LONGINT;
  8014. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8015. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  8016. VAR dim,max: LONGINT;
  8017. BEGIN
  8018. dim := GetDim( l );
  8019. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8020. max := dim-1;
  8021. WHILE (dim > 0) DO
  8022. DEC( dim );
  8023. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8024. END;
  8025. RETURN TRUE;
  8026. END TransposedShape;
  8027. PROCEDURE NewData;
  8028. VAR max,dim, len, size: LONGINT;
  8029. BEGIN
  8030. dim := GetDim( src ); size := elementsize;
  8031. PutDim( dest, dim );
  8032. PutSize( dest, elementsize );
  8033. max := dim-1;
  8034. WHILE (dim > 0) DO
  8035. DEC( dim );
  8036. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8037. PutInc( dest, dim, size ); size := size * len;
  8038. END;
  8039. SYSTEM.NEW( data, size );
  8040. PutAdr( dest, Align(data) );
  8041. PutPtr( dest, data );
  8042. END NewData;
  8043. BEGIN
  8044. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8045. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8046. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8047. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8048. PutFlags(dest, {TensorFlag});
  8049. NewData();
  8050. RETURN ptr;
  8051. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8052. (* check if re-allocation of descriptor is allowed *)
  8053. IF ~(TensorFlag IN GetFlags( dest )) &
  8054. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8055. HALT( 100 );
  8056. END;
  8057. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8058. PutFlags(dest, {TensorFlag});
  8059. NewData(); RETURN ptr;
  8060. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8061. (* check if re-allocation of array data is allowed *)
  8062. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8063. HALT( 100 );
  8064. END;
  8065. NewData();
  8066. RETURN data;
  8067. ELSE (* nothing to do *)
  8068. RETURN NIL;
  8069. END;
  8070. END AllocateTransposed;
  8071. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8072. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8073. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8074. BEGIN
  8075. WHILE (len > 0) DO
  8076. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8077. DEC( len );
  8078. END;
  8079. END CopyLoop;
  8080. BEGIN
  8081. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8082. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8083. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8084. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8085. ELSE
  8086. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8087. p := AllocateTransposed(dest,left,Size);
  8088. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8089. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8090. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8091. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8092. WHILE (len0 > 0) DO
  8093. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8094. INC( dadr, dinc0 ); DEC( len0 );
  8095. END;
  8096. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8097. ladr := p;
  8098. ELSE
  8099. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8100. END;
  8101. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8102. dadr := GetAdr( dest );
  8103. IF (Size = 4) & (transpose4 # NIL ) THEN
  8104. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8105. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8106. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8107. ELSE
  8108. WHILE (len0 > 0) DO
  8109. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8110. INC( dadr, dinc1 ); DEC( len0 );
  8111. END;
  8112. END;
  8113. END;
  8114. END Transpose;
  8115. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8116. BEGIN
  8117. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8118. RETURN RESULT
  8119. END "`";
  8120. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8121. BEGIN
  8122. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8123. RETURN RESULT
  8124. END "`";
  8125. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8126. BEGIN
  8127. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8128. RETURN RESULT
  8129. END "`";
  8130. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8131. BEGIN
  8132. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8133. RETURN RESULT
  8134. END "`";
  8135. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8136. BEGIN
  8137. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8138. RETURN RESULT
  8139. END "`";
  8140. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: LONGINT ): BOOLEAN;
  8141. VAR i: LONGINT;
  8142. BEGIN
  8143. FOR i := 0 TO rdim - 1 DO
  8144. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8145. END;
  8146. FOR i := 0 TO ldim - 1 DO
  8147. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8148. END;
  8149. RETURN TRUE;
  8150. END CheckTensorGeometry;
  8151. (*
  8152. PROCEDURE Zero(p: ANY; size: LONGINT);
  8153. VAR adr: LONGINT;
  8154. BEGIN
  8155. adr := SYSTEM.VAL(LONGINT,p);
  8156. WHILE(size>0) DO
  8157. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8158. END;
  8159. END Zero;
  8160. *)
  8161. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8162. VAR i, Size: LONGINT; ptr, data: ANY; new: ADDRESS;
  8163. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8164. squeezingReshape: BOOLEAN;
  8165. PROCEDURE CheckAlloc;
  8166. BEGIN
  8167. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8168. END CheckAlloc;
  8169. PROCEDURE NewDescriptor;
  8170. BEGIN
  8171. CheckAlloc;
  8172. ptr := GetArrayDesc( newDim ); new := ptr;
  8173. END NewDescriptor;
  8174. (* Added by Alexey
  8175. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8176. *)
  8177. PROCEDURE SqueezingReshape(): BOOLEAN;
  8178. VAR
  8179. i, j, n: LONGINT;
  8180. BEGIN
  8181. IF oldDim > newDim THEN
  8182. i := 0; j := 0;
  8183. WHILE (i < oldDim) & (j < newDim) DO
  8184. n := GetLen(src,i);
  8185. IF n = shape[j] THEN INC(j); END;
  8186. INC(i);
  8187. END;
  8188. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8189. ELSE
  8190. squeezingReshape := FALSE;
  8191. END;
  8192. squeezingReshape := (i = oldDim) & (j = newDim);
  8193. RETURN squeezingReshape;
  8194. END SqueezingReshape;
  8195. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8196. PROCEDURE TargetContinuous(): BOOLEAN;
  8197. VAR
  8198. i, n: LONGINT;
  8199. continue: BOOLEAN;
  8200. BEGIN
  8201. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8202. continue := TRUE;
  8203. WHILE (i > 0) & continue DO
  8204. n := n * GetLen(dest,i);
  8205. DEC(i);
  8206. continue := GetIncr(dest,i) = n;
  8207. END;
  8208. (*TRACE(i,continue,Size,GetSize(dest));*)
  8209. (*tod obviously size is not what I expect it to be*)
  8210. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8211. RETURN TRUE;
  8212. ELSE
  8213. RETURN FALSE;
  8214. END;
  8215. END TargetContinuous;
  8216. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8217. PROCEDURE PreservesContiguity(): BOOLEAN;
  8218. VAR
  8219. i, n: LONGINT;
  8220. continue: BOOLEAN;
  8221. BEGIN
  8222. i := oldDim-1; n := GetIncr(src,i);
  8223. continue := TRUE;
  8224. WHILE (i > 0) & continue DO
  8225. n := n * GetLen(src,i);
  8226. DEC(i);
  8227. continue := GetIncr(src,i) = n;
  8228. END;
  8229. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8230. RETURN TRUE;
  8231. ELSE Err("Not yet implemented!");
  8232. END;
  8233. END PreservesContiguity;
  8234. (* Added by Alexey *)
  8235. PROCEDURE NewDescriptorForSameData;
  8236. VAR len, size, i, j: LONGINT;
  8237. BEGIN
  8238. CheckAlloc();
  8239. ptr := GetArrayDesc( newDim ); new := ptr;
  8240. IF ~squeezingReshape THEN
  8241. size := Size;
  8242. FOR i := newDim - 1 TO 0 BY -1 DO
  8243. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8244. size := size * len;
  8245. END;
  8246. ELSE (* squeezing reshape *)
  8247. j := 0; len := shape[j];
  8248. FOR i := 0 TO oldDim-1 DO
  8249. IF GetLen(src,i) = len THEN
  8250. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8251. INC(j);
  8252. IF j < newDim THEN len := shape[j]; END;
  8253. END;
  8254. END;
  8255. END;
  8256. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8257. PutFlags(new,GetFlags(new)+{RangeFlag});
  8258. END;
  8259. PutAdr( new, GetAdr(src) );
  8260. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8261. PutSize( new, Size );
  8262. END NewDescriptorForSameData;
  8263. PROCEDURE NewData;
  8264. VAR len, size, i: LONGINT;
  8265. BEGIN
  8266. size := Size;
  8267. FOR i := newDim - 1 TO 0 BY -1 DO
  8268. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8269. size := size * len;
  8270. END;
  8271. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8272. PutAdr( new, Align(data) );
  8273. PutPtr( new, data ); PutDim( new, newDim );
  8274. PutSize( new, Size );
  8275. END NewData;
  8276. PROCEDURE CopyData;
  8277. VAR d, s, dadr: LONGINT;
  8278. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8279. VAR inc, len, i: LONGINT;
  8280. BEGIN
  8281. IF dim = d THEN
  8282. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8283. FOR i := 0 TO len - 1 DO
  8284. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8285. END;
  8286. ELSE
  8287. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8288. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8289. END;
  8290. END Loop;
  8291. BEGIN
  8292. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8293. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8294. s := s * GetLen( src, d ); DEC( d );
  8295. END;
  8296. IF d = -1 THEN (* special case: both continuous *)
  8297. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8298. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8299. END;
  8300. END CopyData;
  8301. PROCEDURE CopyDataBack;
  8302. VAR d, s: LONGINT; sadr: LONGINT;
  8303. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8304. VAR inc, len, i: LONGINT;
  8305. BEGIN
  8306. IF dim = d THEN
  8307. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8308. FOR i := 0 TO len - 1 DO
  8309. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8310. END;
  8311. ELSE
  8312. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8313. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8314. END;
  8315. END Loop;
  8316. BEGIN
  8317. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8318. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8319. s := s * GetLen( dest, d ); DEC( d );
  8320. END;
  8321. IF d = -1 THEN (* special case: both continuous *)
  8322. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8323. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8324. END;
  8325. END CopyDataBack;
  8326. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8327. BEGIN
  8328. ASSERT( GetDim( src ) = GetDim( dest ) );
  8329. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8330. END CopyDescriptor;
  8331. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8332. VAR i: LONGINT;
  8333. BEGIN
  8334. ASSERT(GetDim(dest) = newDim);
  8335. FOR i := 0 TO newDim - 1 DO
  8336. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8337. END;
  8338. RETURN FALSE;
  8339. END ShapeDiffers;
  8340. BEGIN
  8341. (*
  8342. cases
  8343. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8344. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8345. 3.) descriptor may not be reshaped: dest = RANGE
  8346. *)
  8347. (* first check invariants *)
  8348. oldDim := GetDim( src );
  8349. IF oldDim = 0 THEN oldSize := 0
  8350. ELSE
  8351. oldSize := 1;
  8352. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8353. END;
  8354. newDim := LEN( shape, 0 );
  8355. IF newDim = 0 THEN newSize := 0
  8356. ELSE
  8357. newSize := 1;
  8358. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8359. END;
  8360. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8361. Size := GetSize( src );
  8362. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8363. IF dest = src THEN (* added by Alexey *)
  8364. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8365. NewDescriptorForSameData;
  8366. dest := new;
  8367. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8368. (* create a copy of the original descriptor *)
  8369. CheckAlloc();
  8370. ptr := GetArrayDesc(newDim); dest := ptr; CopyDescriptor(src,dest);
  8371. ELSE
  8372. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8373. END;
  8374. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8375. NewDescriptor; NewData; CopyData; dest := new;
  8376. ELSIF (dest = temporary) THEN
  8377. NewDescriptorForSameData;
  8378. dest := new;
  8379. ELSIF TargetContinuous() THEN
  8380. NewDescriptor; new:=dest; CopyData;
  8381. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8382. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8383. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8384. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8385. END;
  8386. NewDescriptor; NewData; CopyData; dest := new;
  8387. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8388. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8389. (*
  8390. NewDescriptor; *)
  8391. new := dest;
  8392. NewData; CopyData;
  8393. (*CopyDescriptor( new, dest );*)
  8394. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8395. NewDescriptor; NewData; CopyData; CopyDataBack;
  8396. ELSE (* same shape, just copy *)
  8397. CopyContent( src, dest, Size ); RETURN;
  8398. END;
  8399. END DoReshape;
  8400. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8401. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8402. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8403. PROCEDURE NewData;
  8404. VAR len, size, i: SIZE;
  8405. BEGIN
  8406. size := elementSize;
  8407. FOR i := dim - 1 TO 0 BY -1 DO
  8408. len := a[i];
  8409. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8410. END;
  8411. IF tag = 0 THEN
  8412. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8413. dest.adr := Align(data);
  8414. ELSE
  8415. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8416. dest.adr := data + ArrDataArrayOffset;
  8417. END;
  8418. dest.ptr := data;
  8419. PutSize( dest, elementSize );
  8420. END NewData;
  8421. PROCEDURE ClearData;
  8422. (*! todo *)
  8423. END ClearData;
  8424. BEGIN
  8425. dim := LEN( a,0 );
  8426. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8427. IF dest # 0 THEN
  8428. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8429. END;
  8430. descr := GetArrayDesc( LEN( a,0 ) );
  8431. dest := descr;
  8432. NewData;
  8433. Heaps.SetPC(data);
  8434. ELSE
  8435. i := 0;
  8436. WHILE (i < dim) & same DO
  8437. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8438. INC( i );
  8439. END;
  8440. IF ~same THEN
  8441. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8442. NewData;
  8443. Heaps.SetPC(data);
  8444. ELSE ClearData
  8445. END;
  8446. END;
  8447. END AllocateTensorA;
  8448. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8449. BEGIN
  8450. AllocateTensorA(a,elementSize,tag,dest);
  8451. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8452. END AllocateArrayA;
  8453. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: SIZE; tag: ADDRESS );
  8454. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: SIZE; dest: ADDRESS;
  8455. PROCEDURE NewData;
  8456. VAR len, size: SIZE; i: LONGINT;
  8457. BEGIN
  8458. size := Size;
  8459. FOR i := dim - 1 TO 0 BY -1 DO
  8460. len := a[i];
  8461. (*
  8462. KernelLog.Int(len,10); KernelLog.Ln;
  8463. *)
  8464. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8465. END;
  8466. IF tag = 0 THEN
  8467. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8468. PutAdr( dest, Align(data) );
  8469. ELSE
  8470. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8471. PutAdr( dest, data+ ArrDataArrayOffset );
  8472. END;
  8473. PutPtr( dest, data ); PutSize( dest, Size );
  8474. END NewData;
  8475. PROCEDURE ClearData;
  8476. (*! todo *)
  8477. END ClearData;
  8478. BEGIN
  8479. dim := LEN( a,0 );
  8480. dest := SYSTEM.VAL(ADDRESS,destA);
  8481. (*! check range flag! *)
  8482. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8483. IF dest # 0 THEN
  8484. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8485. END;
  8486. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8487. NewData;
  8488. ELSE
  8489. i := 0;
  8490. WHILE (i < dim) & same DO
  8491. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8492. INC( i );
  8493. END;
  8494. IF ~same THEN
  8495. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8496. NewData
  8497. ELSE ClearData
  8498. END;
  8499. END;
  8500. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8501. END AllocateTensorX;
  8502. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8503. VAR dim, i: LONGINT;
  8504. BEGIN
  8505. dim := GetDim( src );
  8506. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8507. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8508. END LenA;
  8509. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8510. VAR dim, len: SIZE; i: LONGINT;
  8511. BEGIN
  8512. dim := GetDim( src ); len := LEN( dest, 0 );
  8513. IF len # dim THEN NEW( dest, dim ); END;
  8514. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8515. END IncrA;
  8516. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8517. VAR dim: SIZE;
  8518. BEGIN
  8519. dim := GetDim(src);
  8520. IF (d<0) OR (d>=dim) THEN HALT(100)
  8521. ELSE
  8522. RETURN GetLen(src,d);
  8523. END;
  8524. END Len;
  8525. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8526. VAR dim: SIZE;
  8527. BEGIN
  8528. dim := GetDim(src);
  8529. IF (d<0) OR (d>=dim) THEN HALT(100)
  8530. ELSE
  8531. RETURN GetIncr(src,d);
  8532. END;
  8533. END Incr;
  8534. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8535. Size: SIZE ): ANY;
  8536. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8537. PROCEDURE NewData;
  8538. VAR len, size, i: SIZE;
  8539. BEGIN
  8540. size := 1;
  8541. FOR i := 0 TO ldim - 1 DO
  8542. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8543. END;
  8544. FOR i := 0 TO rdim - 1 DO
  8545. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8546. END;
  8547. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8548. (*
  8549. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8550. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8551. *)
  8552. size := Size;
  8553. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8554. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8555. END;
  8556. PutAdr( dest, Align(data) );
  8557. PutPtr( dest, data );
  8558. END NewData;
  8559. BEGIN
  8560. ldim := GetDim( left ); rdim := GetDim( right );
  8561. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8562. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8563. NewData(); RETURN ptr;
  8564. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8565. IF ~(TensorFlag IN GetFlags( dest )) &
  8566. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8567. HALT( 100 );
  8568. END;
  8569. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8570. NewData(); RETURN ptr;
  8571. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8572. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8573. HALT( 100 );
  8574. END;
  8575. NewData(); RETURN data;
  8576. END;
  8577. RETURN NIL;
  8578. END AllocateTensor;
  8579. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  8580. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8581. VAR rdim, len, linc, ri: SIZE );
  8582. (* geometric precondition: lengths must coincide *)
  8583. VAR ldim: LONGINT;
  8584. BEGIN
  8585. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8586. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8587. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8588. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8589. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8590. END;
  8591. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8592. DEC( ldim );
  8593. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8594. (GetIncr( right, rdim ) = len * ri) DO
  8595. len := len * GetLen( left, ldim );
  8596. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8597. DEC( ldim );
  8598. END;
  8599. INC( ldim ); INC( rdim );
  8600. IF debug THEN
  8601. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8602. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8603. END;
  8604. END FindPatternTensor;
  8605. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  8606. Loop: BinaryASALoop );
  8607. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8608. origdest: LONGINT; left, right, dest: ADDRESS;
  8609. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: LONGINT );
  8610. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8611. BEGIN
  8612. IF (ldim < lDim) THEN
  8613. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8614. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8615. WHILE (len > 0) DO
  8616. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8617. INC( dadr, dinc ); DEC( len );
  8618. END;
  8619. ELSIF (rdim # loopd) THEN
  8620. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8621. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8622. WHILE (len > 0) DO
  8623. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8624. INC( dadr, dinc ); DEC( len );
  8625. END;
  8626. ELSE
  8627. (*
  8628. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8629. KernelLog.Int(GetAdr(dest),10);
  8630. KernelLog.Int(GetAdr(dest)+clen,10);
  8631. KernelLog.Ln;
  8632. *)
  8633. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8634. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8635. END;
  8636. END Traverse;
  8637. BEGIN
  8638. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8639. (* check array lengths *)
  8640. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8641. p := AllocateTensor( dest, left, right, elementSize );
  8642. (*
  8643. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8644. p := AllocateTensor( left, right, dest, elementSize )
  8645. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8646. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8647. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8648. END;
  8649. (*! to be done: treat overlapping memory *)
  8650. END;
  8651. *)
  8652. (* debugging *)
  8653. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8654. (* check pattern: longest piece that can be done with a loop *)
  8655. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8656. (* run through dimensions *)
  8657. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8658. SYSTEM.PUT( d, dest );
  8659. END ApplyTensorAAAOp;
  8660. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8661. BEGIN
  8662. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8663. SIZEOF( SHORTINT ), MulASSSLoop );
  8664. RETURN RESULT
  8665. END "**";
  8666. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8667. BEGIN
  8668. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8669. SIZEOF( INTEGER ), MulAISILoop );
  8670. RETURN RESULT
  8671. END "**";
  8672. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8673. BEGIN
  8674. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8675. SIZEOF( LONGINT ), MulALSLLoop );
  8676. RETURN RESULT
  8677. END "**";
  8678. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8679. BEGIN
  8680. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8681. loopMulARSR );
  8682. RETURN RESULT
  8683. END "**";
  8684. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8685. BEGIN
  8686. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8687. SIZEOF( LONGREAL ), loopMulAXSX );
  8688. RETURN RESULT
  8689. END "**";
  8690. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8691. BEGIN
  8692. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8693. loopMulAZSZ );
  8694. RETURN RESULT
  8695. END "**";
  8696. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8697. BEGIN
  8698. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8699. loopMulALZSLZ );
  8700. RETURN RESULT
  8701. END "**";
  8702. PROCEDURE InitOptimization;
  8703. VAR p: PROCEDURE;
  8704. BEGIN
  8705. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8706. IF p # NIL THEN
  8707. p;
  8708. ELSE
  8709. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8710. END;
  8711. END InitOptimization;
  8712. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8713. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: ADDRESS;
  8714. BEGIN
  8715. IF src = 0 THEN
  8716. HALT(100);
  8717. ELSE
  8718. srcDim := GetDim(src);
  8719. destDim := srcDim - prefixIndices - suffixIndices;
  8720. (*
  8721. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8722. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8723. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8724. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8725. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8726. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8727. *)
  8728. destPtr := GetArrayDesc(destDim);
  8729. dest := SYSTEM.VAL(LONGINT,destPtr);
  8730. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8731. PutAdr(dest,GetAdr(src));
  8732. PutPtr(dest,GetPtr(src));
  8733. PutFlags(dest,GetFlags(src));
  8734. PutSize(dest,GetSize(src));
  8735. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8736. srcDim := i + prefixIndices + prefixRanges;
  8737. destDim := i + prefixRanges;
  8738. len := GetLen(src,srcDim);
  8739. incr := GetIncr(src,srcDim);
  8740. PutLen(dest,destDim,len);
  8741. PutInc(dest,destDim,incr);
  8742. END;
  8743. (*
  8744. Report("copy descriptor src",src);
  8745. Report("copy descriptor dest",dest);
  8746. *)
  8747. END;
  8748. END CopyDescriptor;
  8749. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8750. VAR dest: ARRAY [?] OF basetype
  8751. CONST src: ARRAY [?] OF basetype
  8752. CONST shape: ARRAY [*] OF LONGINT
  8753. *)
  8754. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8755. BEGIN
  8756. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  8757. RETURN RESULT
  8758. END Reshape;
  8759. (* OLIVIER *)
  8760. (** creates a degenerated range from an integer.
  8761. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8762. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8763. **)
  8764. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8765. BEGIN RETURN (integer .. integer BY 1)
  8766. END RangeFromInteger;
  8767. (* OLIVIER *)
  8768. (** create an array with the same data but with more dimensions
  8769. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8770. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8771. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8772. e.g.:
  8773. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8774. performs the following type transformation:
  8775. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8776. **)
  8777. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8778. VAR
  8779. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8780. sourceADDRESS, targetADDRESS: LONGINT;
  8781. targetArrayDescriptor: ANY;
  8782. BEGIN
  8783. sourceADDRESS := SYSTEM.VAL(LONGINT, sourceArray);
  8784. targetDimensionality := LEN(keptDimensions, 0);
  8785. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8786. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8787. targetADDRESS := SYSTEM.VAL(LONGINT, RESULT);
  8788. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8789. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8790. PutFlags(targetADDRESS, {TensorFlag});
  8791. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8792. (* set increments and lengths *)
  8793. sourceIndex := 0;
  8794. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8795. IF keptDimensions[targetIndex] THEN
  8796. (* reuse length and increment from source array *)
  8797. ASSERT(sourceIndex < DIM(sourceArray));
  8798. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8799. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8800. INC(sourceIndex)
  8801. ELSE
  8802. (* set length = 1 and increment = 0 *)
  8803. PutLen(targetADDRESS, targetIndex, 1);
  8804. PutInc(targetADDRESS, targetIndex, 0);
  8805. END
  8806. END;
  8807. (* Report("expand dimensions: ", targetADDRESS); *)
  8808. RETURN RESULT
  8809. END ExpandDimensions;
  8810. (* index ranges *)
  8811. (* the length of a range, i.e. the number of indices that it stands for *)
  8812. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8813. VAR
  8814. temp, result: LONGINT;
  8815. BEGIN
  8816. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8817. (* invalid range *)
  8818. result := 0
  8819. ELSIF LAST(range) = MAX(LONGINT) THEN
  8820. (* open-ended range *)
  8821. result := MAX(LONGINT)
  8822. ELSE
  8823. temp := 1 + LAST(range) - FIRST(range);
  8824. result := temp DIV STEP(range);
  8825. IF (temp MOD STEP(range)) # 0 THEN
  8826. INC(result)
  8827. END
  8828. END;
  8829. RETURN result
  8830. END "LEN";
  8831. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8832. BEGIN
  8833. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8834. RETURN RESULT;
  8835. END "ALL";
  8836. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8837. BEGIN
  8838. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8839. RETURN RESULT;
  8840. END "ALL";
  8841. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8842. BEGIN
  8843. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8844. RETURN RESULT;
  8845. END "ALL";
  8846. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8847. BEGIN
  8848. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8849. RETURN RESULT;
  8850. END "ALL";
  8851. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8852. BEGIN
  8853. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8854. RETURN RESULT;
  8855. END "ALL";
  8856. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8857. BEGIN
  8858. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8859. RETURN RESULT;
  8860. END "ALL";
  8861. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8862. BEGIN
  8863. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8864. RETURN RESULT;
  8865. END "ALL";
  8866. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8867. BEGIN
  8868. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8869. RETURN RESULT;
  8870. END "ALL";
  8871. BEGIN
  8872. alloc := 0; NEW(temporary);
  8873. PutFlags(temporary,{TensorFlag});
  8874. PutDim(temporary, 0);
  8875. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8876. END FoxArrayBase.
  8877. Compiler.Compile FoxArrayBase.Mod ~
  8878. SystemTools.ListModules