FoxArrayBase.Mod 338 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173
  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. alloc*: LONGINT; (* statistics *)
  112. allocTemp*: LONGINT; (* statistics *)
  113. (* procedures that might be replaced by ASM methods *)
  114. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  115. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  116. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  117. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  118. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  119. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  120. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  121. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  122. transpose4*: TransposeP; transpose8*: TransposeP;
  123. (* optimizations for small arrays (Alexey Morozov) *)
  124. matMulR2x2*: SmallMatMul;
  125. matMulR3x3*: SmallMatMul;
  126. matMulR4x4*: SmallMatMul;
  127. matVecMulR2x2*: SmallMatMul;
  128. matVecMulR3x3*: SmallMatMul;
  129. matVecMulR4x4*: SmallMatMul;
  130. matMulLR2x2*: SmallMatMul;
  131. matMulLR3x3*: SmallMatMul;
  132. matMulLR4x4*: SmallMatMul;
  133. matVecMulLR2x2*: SmallMatMul;
  134. matVecMulLR3x3*: SmallMatMul;
  135. matVecMulLR4x4*: SmallMatMul;
  136. (*
  137. TensorTypePool: ARRAY 32 OF TensorType;
  138. *)
  139. PROCEDURE SetDefaults*; (* set standard procedures *)
  140. BEGIN
  141. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  142. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  143. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  144. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  145. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  146. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  147. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  148. loopIncMulAXSX := IncMulAXSXLoop;
  149. loopMatMulIncARAR := MatMulIncARARLoop;
  150. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  151. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  152. loopMulAZSZ := MulAZSZLoop;
  153. loopMulALZSLZ := MulALZSLZLoop;
  154. END SetDefaults;
  155. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  156. BEGIN
  157. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  158. END Err;
  159. (* get increment of dimension dim *)
  160. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  161. BEGIN{UNCHECKED}
  162. RETURN base.lens[dim].inc
  163. END GetIncr;
  164. (* set increment of dimension dim *)
  165. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  166. BEGIN{UNCHECKED}
  167. base.lens[dim].inc := val
  168. END PutInc;
  169. (* get length of dimension dim *)
  170. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): LONGINT;
  171. BEGIN{UNCHECKED}
  172. RETURN base.lens[dim].len
  173. END GetLen;
  174. (* set length of dimension dim *)
  175. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  176. BEGIN{UNCHECKED}
  177. base.lens[dim].len := val
  178. END PutLen;
  179. (* get data address *)
  180. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  181. BEGIN
  182. RETURN base.adr;
  183. END GetAdr;
  184. (* set data address *)
  185. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  186. BEGIN
  187. base.adr := value
  188. END PutAdr;
  189. (* get data base pointer (GC protection) *)
  190. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  191. BEGIN
  192. RETURN base.ptr;
  193. END GetPtr;
  194. (* set data base pointer (GC protection) *)
  195. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  196. BEGIN
  197. base.ptr := value
  198. END PutPtr;
  199. PROCEDURE GetSize( base: UnsafeArray ): LONGINT;
  200. BEGIN
  201. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  202. END GetSize;
  203. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  204. BEGIN
  205. base.elementSize := val
  206. END PutSize;
  207. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  208. VAR dim: LONGINT;
  209. BEGIN
  210. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  211. END GetDim;
  212. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  213. BEGIN
  214. RETURN base.flags
  215. END GetFlags;
  216. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  217. BEGIN
  218. base.dim := dim
  219. END PutDim;
  220. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  221. BEGIN
  222. base.flags := flags
  223. END PutFlags;
  224. (* report geometry of array passed via address s *)
  225. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: LONGINT );
  226. VAR i: LONGINT; dim: LONGINT;
  227. PROCEDURE Set( s: SET );
  228. VAR i: LONGINT; first: BOOLEAN;
  229. BEGIN
  230. KernelLog.String( "{" ); first := TRUE;
  231. FOR i := 31 TO 0 BY -1 DO
  232. IF i IN s THEN
  233. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  234. KernelLog.Int( i, 1 );
  235. END;
  236. END;
  237. KernelLog.String( "}" );
  238. END Set;
  239. BEGIN
  240. KernelLog.String( name );
  241. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  242. ELSE
  243. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  244. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  245. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  246. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  247. KernelLog.Ln; dim := GetDim( s );
  248. IF dim > 32 THEN dim := 0 END;
  249. FOR i := 0 TO dim - 1 DO
  250. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  251. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  252. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  253. END;
  254. (*
  255. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  256. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  257. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  258. *)
  259. END;
  260. END Report;
  261. PROCEDURE GetArrayDesc( dim: LONGINT ): ANY;
  262. VAR (* t: TensorType; *) ptr: Tensor;
  263. p0: T0;
  264. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  265. BEGIN
  266. (*
  267. IF dim < LEN( TensorTypePool ) THEN t := TensorTypePool[dim]
  268. ELSE NewTensorType( dim, t );
  269. END;
  270. Heaps.NewRec( ptr, t.tag );
  271. *)
  272. CASE dim OF
  273. |0: NEW(p0); ptr := p0;
  274. |1:NEW(p1); ptr := p1;
  275. |2:NEW(p2); ptr := p2;
  276. |3:NEW(p3); ptr := p3;
  277. |4:NEW(p4); ptr := p4;
  278. |5:NEW(p5); ptr := p5;
  279. |6:NEW(p6); ptr := p6;
  280. |7:NEW(p7); ptr := p7;
  281. |8:NEW(p8); ptr := p8;
  282. ELSE
  283. HALT(200)
  284. END;
  285. ptr.dim := dim;
  286. ptr.flags := {TensorFlag};
  287. RETURN ptr;
  288. END GetArrayDesc;
  289. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  290. VAR reason: ARRAY 64 OF CHAR;
  291. BEGIN
  292. IF left # 0 THEN Report( "Source operand ", left ) END;
  293. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  294. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  295. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  296. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  297. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  298. ELSE reason := "unknown";
  299. END;
  300. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  301. HALT( 400 );
  302. END Halt;
  303. (** patterns ********************************************************************)
  304. (* 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 *)
  305. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: LONGINT );
  306. BEGIN
  307. d := dim - 1; len := GetLen( left, d );
  308. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  309. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  310. linc := GetIncr( left, d ); DEC( d );
  311. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  312. len := len * GetLen( left, d ); DEC( d );
  313. END; (* find dimension where pattern does not work any more *)
  314. INC( d );
  315. IF debug THEN
  316. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  317. KernelLog.Ln;
  318. END;
  319. END FindPattern1;
  320. (* 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 *)
  321. PROCEDURE FindPattern2( left, right: ADDRESS; dim: LONGINT;
  322. VAR d, len, linc, ri: LONGINT );
  323. (* geometric precondition: lengths must coincide *)
  324. BEGIN
  325. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  326. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  327. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  328. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  329. len := len * GetLen( left, d ); DEC( d );
  330. END;
  331. INC( d );
  332. IF debug THEN
  333. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  334. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  335. END;
  336. END FindPattern2;
  337. (* 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 *)
  338. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: LONGINT;
  339. VAR d, len, linc, ri, di: LONGINT );
  340. (* geometric precondition: lengths must coincide *)
  341. BEGIN
  342. d := dim - 1; len := GetLen( left, d );
  343. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  344. END;
  345. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  346. DEC( d );
  347. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  348. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  349. len := len * GetLen( left, d ); DEC( d );
  350. END;
  351. INC( d );
  352. IF debug THEN
  353. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  354. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  355. END;
  356. END FindPattern3;
  357. PROCEDURE Reverse( src: ADDRESS; dim: LONGINT );
  358. VAR d, sl, sr: LONGINT;
  359. BEGIN
  360. d := 0; sl := GetAdr( src );
  361. WHILE (d < dim) DO
  362. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  363. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  364. END;
  365. PutAdr( src, sl + sr );
  366. END Reverse;
  367. (* check if forward copy may be performed *)
  368. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  369. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  370. (* precondition: len(src,i)=len(dest,i) *)
  371. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  372. Sufficient (but not necessary) conditions:
  373. 1.) no overlap: src right < dest left or src left > dest right or
  374. 2.) same geometry and src left >= dest left
  375. same geometry if ginc(s)=ginc(d) with
  376. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  377. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  378. *)
  379. BEGIN
  380. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  381. dim := GetDim( src );
  382. WHILE (d < dim) DO
  383. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  384. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  385. END;
  386. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  387. ELSIF ((sr - sl) = (dr - dl)) THEN
  388. IF (sl = dl) THEN (* same memory region, both directions possible *)
  389. ELSIF (sl > dl) THEN
  390. EXCL( modes, down ) (* only copy up possible *)
  391. ELSE (*sl < dl*)
  392. EXCL( modes, up ) (* only copy down possible *)
  393. END;
  394. ELSE
  395. modes := modes - {down, up}; (* neither nor *)
  396. END;
  397. END CopyUpCompatible;
  398. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  399. Size: LONGINT ): ANY;
  400. (* allocate a temporary block containing both descriptor and data *)
  401. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  402. BEGIN
  403. HALT(100);
  404. (*
  405. IF statistics THEN INC( allocTemp ) END;
  406. d := 0; len := Size; dim := GetDim( src );
  407. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  408. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  409. dest := SYSTEM.VAL( LONGINT, p );
  410. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  411. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  412. FOR i := 0 TO dim - 1 DO
  413. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  414. len := len * GetLen( src, i );
  415. END;
  416. (* Report("allocdest",dest,dim); *)
  417. RETURN p;
  418. *)
  419. END AllocateTemp;
  420. (*** procedures to traverse arrays and apply operators *)
  421. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  422. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  423. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  424. origdest: LONGINT; modes: SET;
  425. dest, left: ADDRESS; dim: SIZE;
  426. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  427. VAR len: LONGINT; linc, dinc: LONGINT;
  428. BEGIN
  429. IF dim = loopd THEN
  430. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  431. IF conservative THEN INC( glen, looplen ) END;
  432. ELSE
  433. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  434. dinc := GetIncr( dest, dim ); INC( dim );
  435. WHILE (len > 0) DO
  436. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  437. END;
  438. END;
  439. END Traverse;
  440. BEGIN
  441. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  442. origdest := 0; modes := {up, down};
  443. (* allocate destination, if necessary *)
  444. p := AllocateSame( dest, left, elementSize );
  445. IF p = NIL THEN
  446. CopyUpCompatible( dest, left, modes );
  447. IF up IN modes THEN (* nothing to be done *)
  448. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  449. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  450. END;
  451. END;
  452. (* allocate destination, if necessary *)
  453. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  454. ELSIF CheckGeometry( left, dest, dim )
  455. END; *)
  456. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  457. (* check pattern: longest piece that can be done with a loop *)
  458. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  459. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  460. IF up IN modes THEN (* nothing to be done *)
  461. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  462. ELSE CopyContent( origdest, dest, elementSize );
  463. END;
  464. SYSTEM.PUT( d, dest );
  465. END ApplyGenericUnaryAAOpS;
  466. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  467. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  468. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  469. origdest: LONGINT; modes: SET;
  470. dest, left: ADDRESS; dim: SIZE;
  471. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  472. VAR len: LONGINT; linc, dinc: LONGINT;
  473. BEGIN
  474. IF dim = loopd THEN
  475. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  476. IF conservative THEN INC( glen, looplen ) END;
  477. ELSE
  478. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  479. dinc := GetIncr( dest, dim ); INC( dim );
  480. WHILE (len > 0) DO
  481. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  482. END;
  483. END;
  484. END Traverse;
  485. BEGIN
  486. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  487. origdest := 0; modes := {up, down};
  488. (* allocate destination, if necessary *)
  489. p := AllocateSame( dest, left, elementSize );
  490. IF p = NIL THEN
  491. CopyUpCompatible( dest, left, modes );
  492. IF up IN modes THEN (* nothing to be done *)
  493. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  494. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  495. END;
  496. END;
  497. (* allocate destination, if necessary *)
  498. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  499. ELSIF CheckGeometry( left, dest, dim )
  500. END; *)
  501. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  502. (* check pattern: longest piece that can be done with a loop *)
  503. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  504. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  505. IF up IN modes THEN (* nothing to be done *)
  506. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  507. ELSE CopyContent( origdest, dest, elementSize );
  508. END;
  509. SYSTEM.PUT( d, dest );
  510. END ApplyGenericUnaryAAOpI;
  511. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  512. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  513. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  514. origdest: LONGINT; modes: SET;
  515. dest, left: ADDRESS; dim: SIZE;
  516. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  517. VAR len: LONGINT; linc, dinc: LONGINT;
  518. BEGIN
  519. IF dim = loopd THEN
  520. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  521. IF conservative THEN INC( glen, looplen ) END;
  522. ELSE
  523. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  524. dinc := GetIncr( dest, dim ); INC( dim );
  525. WHILE (len > 0) DO
  526. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  527. END;
  528. END;
  529. END Traverse;
  530. BEGIN
  531. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  532. origdest := 0; modes := {up, down};
  533. (* allocate destination, if necessary *)
  534. p := AllocateSame( dest, left, elementSize );
  535. IF p = NIL THEN
  536. CopyUpCompatible( dest, left, modes );
  537. IF up IN modes THEN (* nothing to be done *)
  538. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  539. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  540. END;
  541. END;
  542. (* allocate destination, if necessary *)
  543. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  544. ELSIF CheckGeometry( left, dest, dim )
  545. END; *)
  546. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  547. (* check pattern: longest piece that can be done with a loop *)
  548. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  549. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  550. IF up IN modes THEN (* nothing to be done *)
  551. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  552. ELSE CopyContent( origdest, dest, elementSize );
  553. END;
  554. SYSTEM.PUT( d, dest );
  555. END ApplyGenericUnaryAAOpL;
  556. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  557. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  558. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  559. origdest: LONGINT; modes: SET;
  560. VAR dest, left: ADDRESS; dim: SIZE;
  561. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  562. VAR len: LONGINT; linc, dinc: LONGINT;
  563. BEGIN
  564. IF dim = loopd THEN
  565. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  566. IF conservative THEN INC( glen, looplen ) END;
  567. ELSE
  568. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  569. dinc := GetIncr( dest, dim ); INC( dim );
  570. WHILE (len > 0) DO
  571. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  572. DEC( len );
  573. END;
  574. END;
  575. END Traverse;
  576. BEGIN
  577. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  578. origdest := 0; modes := {up, down};
  579. (* allocate destination, if necessary *)
  580. p := AllocateSame( dest, left, elementSize );
  581. IF p = NIL THEN
  582. CopyUpCompatible( dest, left, modes );
  583. IF up IN modes THEN (* nothing to be done *)
  584. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  585. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  586. END;
  587. END;
  588. (*
  589. (* allocate destination, if necessary *)
  590. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  591. ELSIF CheckGeometry( left, dest, dim )
  592. END;
  593. *)
  594. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  595. (* check pattern: longest piece that can be done with a loop *)
  596. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  597. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  598. IF up IN modes THEN (* nothing to be done *)
  599. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  600. ELSE CopyContent( origdest, dest, elementSize );
  601. END;
  602. SYSTEM.PUT( d, dest );
  603. END ApplyGenericUnaryAAOpH;
  604. (** apply unary operator to array: array REAL -> array REAL *)
  605. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  606. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  607. origdest: LONGINT; modes: SET;
  608. dest, left: ADDRESS; dim: SIZE;
  609. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  610. VAR len: LONGINT; linc, dinc: LONGINT;
  611. BEGIN
  612. IF dim = loopd THEN
  613. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  614. IF conservative THEN INC( glen, looplen ) END;
  615. ELSE
  616. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  617. dinc := GetIncr( dest, dim ); INC( dim );
  618. WHILE (len > 0) DO
  619. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  620. END;
  621. END;
  622. END Traverse;
  623. BEGIN
  624. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  625. origdest := 0; modes := {up, down};
  626. (* allocate destination, if necessary *)
  627. p := AllocateSame( dest, left, elementSize );
  628. IF p = NIL THEN
  629. CopyUpCompatible( dest, left, modes );
  630. IF up IN modes THEN (* nothing to be done *)
  631. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  632. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  633. END;
  634. END;
  635. (* allocate destination, if necessary *)
  636. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  637. ELSIF CheckGeometry( left, dest, dim )
  638. END; *)
  639. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  640. (* check pattern: longest piece that can be done with a loop *)
  641. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  642. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  643. IF up IN modes THEN (* nothing to be done *)
  644. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  645. ELSE CopyContent( origdest, dest, elementSize );
  646. END;
  647. SYSTEM.PUT( d, dest );
  648. END ApplyGenericUnaryAAOpR;
  649. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  650. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  651. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  652. origdest: LONGINT; modes: SET;
  653. dest, left: ADDRESS; dim: SIZE;
  654. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  655. VAR len: LONGINT; linc, dinc: LONGINT;
  656. BEGIN
  657. IF dim = loopd THEN
  658. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  659. IF conservative THEN INC( glen, looplen ) END;
  660. ELSE
  661. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  662. dinc := GetIncr( dest, dim ); INC( dim );
  663. WHILE (len > 0) DO
  664. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  665. DEC( len );
  666. END;
  667. END;
  668. END Traverse;
  669. BEGIN
  670. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  671. origdest := 0; modes := {up, down};
  672. (* allocate destination, if necessary *)
  673. p := AllocateSame( dest, left, elementSize );
  674. IF p = NIL THEN
  675. CopyUpCompatible( dest, left, modes );
  676. IF up IN modes THEN (* nothing to be done *)
  677. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  678. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  679. END;
  680. END;
  681. (*
  682. (* allocate destination, if necessary *)
  683. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  684. ELSIF CheckGeometry( left, dest, dim )
  685. END;
  686. *)
  687. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  688. (* check pattern: longest piece that can be done with a loop *)
  689. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  690. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  691. IF up IN modes THEN (* nothing to be done *)
  692. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  693. ELSE CopyContent( origdest, dest, elementSize );
  694. END;
  695. SYSTEM.PUT( d, dest );
  696. END ApplyGenericUnaryAAOpX;
  697. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  698. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  699. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  700. origdest: LONGINT; modes: SET;
  701. dest, left: ADDRESS; dim: SIZE;
  702. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  703. VAR len: LONGINT; linc, dinc: LONGINT;
  704. BEGIN
  705. IF dim = loopd THEN
  706. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  707. IF conservative THEN INC( glen, looplen ) END;
  708. ELSE
  709. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  710. dinc := GetIncr( dest, dim ); INC( dim );
  711. WHILE (len > 0) DO
  712. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  713. DEC( len );
  714. END;
  715. END;
  716. END Traverse;
  717. BEGIN
  718. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  719. origdest := 0; modes := {up, down};
  720. (* allocate destination, if necessary *)
  721. p := AllocateSame( dest, left, elementSize );
  722. IF p = NIL THEN
  723. CopyUpCompatible( dest, left, modes );
  724. IF up IN modes THEN (* nothing to be done *)
  725. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  726. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  727. END;
  728. END;
  729. (*
  730. (* allocate destination, if necessary *)
  731. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  732. ELSIF CheckGeometry( left, dest, dim )
  733. END;
  734. *)
  735. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  736. (* check pattern: longest piece that can be done with a loop *)
  737. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  738. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  739. IF up IN modes THEN (* nothing to be done *)
  740. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  741. ELSE CopyContent( origdest, dest, elementSize );
  742. END;
  743. SYSTEM.PUT( d, dest );
  744. END ApplyGenericUnaryAAOpZ;
  745. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  746. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  747. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  748. origdest: LONGINT; modes: SET;
  749. dest, left: ADDRESS; dim: SIZE;
  750. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  751. VAR len: LONGINT; linc, dinc: LONGINT;
  752. BEGIN
  753. IF dim = loopd THEN
  754. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  755. IF conservative THEN INC( glen, looplen ) END;
  756. ELSE
  757. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  758. dinc := GetIncr( dest, dim ); INC( dim );
  759. WHILE (len > 0) DO
  760. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  761. DEC( len );
  762. END;
  763. END;
  764. END Traverse;
  765. BEGIN
  766. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  767. origdest := 0; modes := {up, down};
  768. (* allocate destination, if necessary *)
  769. p := AllocateSame( dest, left, elementSize );
  770. IF p = NIL THEN
  771. CopyUpCompatible( dest, left, modes );
  772. IF up IN modes THEN (* nothing to be done *)
  773. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  774. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  775. END;
  776. END;
  777. (*
  778. (* allocate destination, if necessary *)
  779. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  780. ELSIF CheckGeometry( left, dest, dim )
  781. END;
  782. *)
  783. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  784. (* check pattern: longest piece that can be done with a loop *)
  785. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  786. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  787. IF up IN modes THEN (* nothing to be done *)
  788. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  789. ELSE CopyContent( origdest, dest, elementSize );
  790. END;
  791. SYSTEM.PUT( d, dest );
  792. END ApplyGenericUnaryAAOpLZ;
  793. (** apply unary operator to array: array -> array *)
  794. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: LONGINT;
  795. Loop: UnaryAALoop );
  796. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  797. origdest: LONGINT; modes: SET;
  798. dest, left: ADDRESS; dim: SIZE;
  799. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  800. VAR len: LONGINT; linc, dinc: LONGINT;
  801. BEGIN
  802. IF dim = loopd THEN
  803. Loop( ladr, dadr, loopli, loopdi, looplen );
  804. IF conservative THEN INC( glen, looplen ) END;
  805. ELSE
  806. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  807. dinc := GetIncr( dest, dim ); INC( dim );
  808. WHILE (len > 0) DO
  809. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  810. DEC( len );
  811. END;
  812. END;
  813. END Traverse;
  814. BEGIN
  815. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  816. origdest := 0; modes := {up, down};
  817. (* allocate destination, if necessary *)
  818. p := AllocateSame( dest, left, elementSize );
  819. IF p = NIL THEN
  820. CopyUpCompatible( dest, left, modes );
  821. IF up IN modes THEN (* nothing to be done *)
  822. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  823. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  824. END;
  825. END;
  826. (*
  827. (* allocate destination, if necessary *)
  828. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  829. ELSIF CheckGeometry( left, dest, dim )
  830. END;
  831. *)
  832. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  833. (* check pattern: longest piece that can be done with a loop *)
  834. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  835. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  836. IF up IN modes THEN (* nothing to be done *)
  837. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  838. ELSE CopyContent( origdest, dest, elementSize );
  839. END;
  840. SYSTEM.PUT( d, dest );
  841. END ApplyUnaryAAOp;
  842. (** apply unary operator to array: array -> scalar *)
  843. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  844. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  845. VAR left, dim: LONGINT;
  846. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS );
  847. VAR len: LONGINT; linc: LONGINT;
  848. BEGIN
  849. IF dim = loopd THEN
  850. Loop( ladr, dest, loopli, looplen );
  851. IF conservative THEN INC( glen, looplen ) END;
  852. ELSE
  853. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  854. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  855. END;
  856. END Traverse;
  857. BEGIN
  858. SYSTEM.GET( l, left ); dim := GetDim( left );
  859. IF debug THEN Report( "AS: left", left ); END;
  860. (* check pattern: longest piece that can be done with a loop *)
  861. IF conservative THEN glen := 0 END;
  862. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  863. IF conservative THEN
  864. looplen := 1;
  865. WHILE (dim > 0) DO
  866. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  867. END;
  868. ASSERT( looplen = glen );
  869. END;
  870. END ApplyUnaryASOp;
  871. (** apply unary operator to array: scalar -> array *)
  872. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  873. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  874. VAR dest, dim: LONGINT;
  875. PROCEDURE Traverse( dim: LONGINT; dadr: ADDRESS );
  876. VAR len: LONGINT; dinc: LONGINT;
  877. BEGIN
  878. IF dim = loopd THEN
  879. Loop( right, dadr, loopdi, looplen );
  880. IF conservative THEN INC( glen, looplen ) END;
  881. ELSE
  882. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  883. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  884. END;
  885. END Traverse;
  886. BEGIN
  887. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  888. IF debug THEN Report( "AS: dest", dest ); END;
  889. (* check pattern: longest piece that can be done with a loop *)
  890. IF conservative THEN glen := 0 END;
  891. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  892. IF conservative THEN
  893. looplen := 1;
  894. WHILE (dim > 0) DO
  895. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  896. END;
  897. ASSERT( looplen = glen );
  898. END;
  899. END ApplyUnarySAOp;
  900. (** apply binary operator : array x array -> array *)
  901. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  902. Loop: BinaryAAALoop );
  903. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  904. origdest: LONGINT; modes: SET; left, right, dest: ADDRESS; dim: LONGINT;
  905. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: ADDRESS );
  906. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  907. BEGIN
  908. IF dim = loopd THEN
  909. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  910. IF conservative THEN INC( glen, looplen ) END;
  911. ELSE
  912. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  913. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  914. WHILE (len > 0) DO
  915. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  916. INC( dadr, dinc ); DEC( len );
  917. END;
  918. END;
  919. END Traverse;
  920. BEGIN
  921. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  922. (* allocate destination, if necessary *)
  923. IF ~SameShape( left, right ) THEN
  924. Halt( GeometryMismatch, left, right, 0 )
  925. END;
  926. origdest := 0; modes := {up, down};
  927. p := AllocateSame( dest, left, elementSize );
  928. IF p = NIL THEN
  929. CopyUpCompatible( dest, left, modes );
  930. CopyUpCompatible( dest, right, modes );
  931. IF up IN modes THEN (* nothing to be done *)
  932. ELSIF down IN modes THEN
  933. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  934. ELSE
  935. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  936. END;
  937. END;
  938. (* debugging *)
  939. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  940. (* check pattern: longest piece that can be done with a loop *)
  941. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  942. (* run through dimensions *)
  943. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  944. IF up IN modes THEN (* nothing to be done *)
  945. ELSIF down IN modes THEN
  946. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  947. ELSE CopyContent( origdest, dest, elementSize );
  948. END;
  949. SYSTEM.PUT( d, dest );
  950. END ApplyBinaryAAAOp;
  951. (** apply binary operator: array x scalar -> array *)
  952. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  953. elementSize: LONGINT;
  954. Loop: BinaryASALoop );
  955. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  956. origdest: LONGINT; modes: SET; dest, left: ADDRESS; dim: SIZE;
  957. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  958. VAR len: LONGINT; linc, dinc: LONGINT;
  959. BEGIN
  960. IF dim = loopd THEN
  961. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  962. IF conservative THEN INC( glen, looplen ) END;
  963. ELSE
  964. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  965. dinc := GetIncr( dest, dim ); INC( dim );
  966. WHILE (len > 0) DO
  967. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  968. DEC( len );
  969. END;
  970. END;
  971. END Traverse;
  972. BEGIN
  973. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  974. (* allocate destination, if necessary *)
  975. origdest := 0; modes := {up, down};
  976. p := AllocateSame( dest, left, elementSize );
  977. IF p = NIL THEN
  978. CopyUpCompatible( dest, left, modes );
  979. IF up IN modes THEN (* nothing to be done *)
  980. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  981. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  982. END;
  983. END;
  984. (* debugging *)
  985. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  986. (* check pattern: longest piece that can be done with a loop *)
  987. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  988. (* run through dimensions *)
  989. IF conservative THEN glen := 0 END;
  990. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  991. IF conservative THEN
  992. looplen := 1;
  993. WHILE (dim > 0) DO
  994. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  995. END;
  996. ASSERT( looplen = glen );
  997. END;
  998. IF up IN modes THEN (* nothing to be done *)
  999. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1000. ELSE CopyContent( origdest, dest, elementSize );
  1001. END;
  1002. SYSTEM.PUT( d, dest );
  1003. END ApplyBinaryASAOp;
  1004. (** apply binary operator: array x array -> scalar *)
  1005. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1006. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1007. left, right, dim: LONGINT;
  1008. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS );
  1009. VAR len: LONGINT; linc, rinc: LONGINT;
  1010. BEGIN
  1011. IF dim = loopd THEN
  1012. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1013. IF conservative THEN INC( glen, looplen ) END;
  1014. ELSE
  1015. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1016. rinc := GetIncr( right, dim ); INC( dim );
  1017. WHILE (len > 0) DO
  1018. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1019. DEC( len );
  1020. END;
  1021. END;
  1022. END Traverse;
  1023. BEGIN
  1024. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1025. (* check array lengths *)
  1026. IF ~SameShape( left, right ) THEN
  1027. Halt( GeometryMismatch, left, right, 0 )
  1028. END;
  1029. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1030. (* check pattern: longest piece that can be done with a loop *)
  1031. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1032. (* run through dimensions *)
  1033. IF conservative THEN glen := 0 END;
  1034. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1035. IF conservative THEN
  1036. looplen := 1;
  1037. WHILE (dim > 0) DO
  1038. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1039. END;
  1040. ASSERT( looplen = glen );
  1041. END;
  1042. END ApplyBinaryAASOp;
  1043. (** special binary operator: array x array -> boolean *)
  1044. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1045. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1046. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1047. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS ): BOOLEAN;
  1048. VAR len: LONGINT; linc, rinc: LONGINT;
  1049. BEGIN
  1050. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1051. ELSE
  1052. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1053. rinc := GetIncr( right, dim ); INC( dim );
  1054. WHILE (len > 0) DO
  1055. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1056. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1057. END;
  1058. RETURN TRUE;
  1059. END;
  1060. END Traverse;
  1061. BEGIN
  1062. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1063. (* check array lengths *)
  1064. IF ~SameShape( left, right ) THEN
  1065. RETURN geometryMismatchDefault
  1066. END;
  1067. (* is destination already allocated? (might be a temporary result) *)
  1068. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1069. (* check pattern: longest piece that can be done with a loop *)
  1070. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1071. (* run through dimensions *)
  1072. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1073. END ApplyBinaryAABOp;
  1074. (** special binary operator: array x scalar -> boolean *)
  1075. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1076. Loop: BinaryASBLoop ): BOOLEAN;
  1077. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1078. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS ): BOOLEAN;
  1079. VAR len: LONGINT; linc: LONGINT;
  1080. BEGIN
  1081. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1082. ELSE
  1083. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1084. WHILE (len > 0) DO
  1085. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1086. INC( ladr, linc ); DEC( len );
  1087. END;
  1088. RETURN TRUE;
  1089. END;
  1090. END Traverse;
  1091. BEGIN
  1092. SYSTEM.GET( l, left ); dim := GetDim( left );
  1093. IF debug THEN Report( "AAB:left", left ); END;
  1094. (* check pattern: longest piece that can be done with a loop *)
  1095. FindPattern1( left, dim, loopd, looplen, loopli );
  1096. (* run through dimensions *)
  1097. RETURN Traverse( 0, GetAdr( left ) );
  1098. END ApplyBinaryASBOp;
  1099. (**** operators *)
  1100. (*** copy *)
  1101. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1102. CODE {SYSTEM.i386}
  1103. MOV ECX, [EBP+ladr] ; ECX := ladr
  1104. MOV EDX, [EBP+dadr] ; EDX := dadr
  1105. MOV EBX, [EBP+len] ; EBX := len
  1106. start:
  1107. CMP EBX, 0 ;
  1108. JLE end ; WHILE EBX > 0 DO
  1109. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1110. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1111. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1112. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1113. DEC EBX ; DEC(EBX)
  1114. JMP start
  1115. end:
  1116. END Copy4;
  1117. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1118. CODE {SYSTEM.i386}
  1119. MOV ECX, [EBP+ladr] ; ECX := ladr
  1120. MOV EDX, [EBP+dadr] ; EDX := dadr
  1121. MOV EBX, [EBP+len] ; EBX := len
  1122. start:
  1123. CMP EBX, 0 ;
  1124. JLE end ; WHILE EBX > 0 DO
  1125. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1126. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1127. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1128. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1129. DEC EBX ; DEC(EBX)
  1130. JMP start
  1131. end:
  1132. END Copy2;
  1133. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1134. CODE {SYSTEM.i386}
  1135. MOV ECX, [EBP+ladr] ; ECX := ladr
  1136. MOV EDX, [EBP+dadr] ; EDX := dadr
  1137. MOV EBX, [EBP+len] ; EBX := len
  1138. start:
  1139. CMP EBX, 0 ;
  1140. JLE end ; WHILE EBX > 0 DO
  1141. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1142. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1143. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1144. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1145. DEC EBX ; DEC(EBX)
  1146. JMP start
  1147. end:
  1148. END Copy1;
  1149. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1150. CODE {SYSTEM.i386}
  1151. MOV ECX, [EBP+ladr] ; ECX := ladr
  1152. MOV EDX, [EBP+dadr] ; EDX := dadr
  1153. MOV EBX, [EBP+len] ; EBX := len
  1154. start:
  1155. CMP EBX, 0 ;
  1156. JLE end ; WHILE EBX > 0 DO
  1157. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1158. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1159. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1160. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1161. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1162. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1163. DEC EBX ; DEC(EBX)
  1164. JMP start
  1165. end:
  1166. END Copy8;
  1167. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1168. (** Correct move if overlap, might be important for some array operations,
  1169. do not use SYSTEM.MOVE. *)
  1170. CODE {SYSTEM.i386}
  1171. MOV ECX, [ESP] ; len
  1172. MOV EDI, [ESP+4] ; destadr
  1173. MOV ESI, [ESP+8] ; srcadr
  1174. CMP ESI, EDI
  1175. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1176. MOV EAX, ESI
  1177. ADD EAX, ECX
  1178. CMP EAX, EDI
  1179. JBE moveup ; no overlap, no problem, move up
  1180. MOV ESI, EAX
  1181. ADD EDI, ECX
  1182. DEC ESI
  1183. DEC EDI
  1184. STD ; move down since overlap occured
  1185. REP
  1186. MOVSB
  1187. JMP done
  1188. moveup:
  1189. CLD
  1190. MOV BL, CL
  1191. SHR ECX, 2
  1192. AND BL, 00000003H ; rest to move after 4 byte move
  1193. REP
  1194. MOVSD ; move 4 bytes each step
  1195. MOV CL, BL
  1196. REP
  1197. MOVSB ; move rest in one byte steps
  1198. done:
  1199. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1200. END MoveB;
  1201. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1202. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1203. origdest: ADDRESS; modes: SET; dim: LONGINT;
  1204. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1205. BEGIN
  1206. IF (dinc = elementSize) & (linc = elementSize) THEN
  1207. MoveB( ladr, dadr, len * elementSize );
  1208. (*
  1209. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1210. *)
  1211. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1212. len := len * elementSize;
  1213. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1214. ELSIF elementSize = 1 THEN
  1215. Copy1( ladr, dadr, linc, dinc, len );
  1216. (*
  1217. WHILE (len > 0) DO
  1218. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1219. END;
  1220. *)
  1221. ELSIF elementSize = 2 THEN
  1222. Copy2( ladr, dadr, linc, dinc, len );
  1223. (*
  1224. WHILE (len > 0) DO
  1225. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1226. END;
  1227. *)
  1228. ELSIF elementSize = 4 THEN
  1229. Copy4( ladr, dadr, linc, dinc, len );
  1230. (*
  1231. WHILE (len > 0) DO
  1232. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1233. END;
  1234. *)
  1235. ELSIF elementSize = 8 THEN
  1236. Copy8( ladr, dadr, linc, dinc, len );
  1237. (*
  1238. WHILE (len > 0) DO
  1239. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1240. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1241. INC( dadr, dinc );
  1242. END;
  1243. *)
  1244. ELSE (* SYSTEM.MOVE is expensive ! *)
  1245. WHILE (len > 0) DO
  1246. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1247. INC( dadr, dinc );
  1248. END;
  1249. END;
  1250. END Loop;
  1251. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  1252. VAR len: LONGINT; linc, dinc: LONGINT;
  1253. BEGIN
  1254. IF dim = loopd THEN
  1255. Loop( ladr, dadr, loopli, loopdi, looplen );
  1256. IF conservative THEN INC( glen, looplen ) END;
  1257. ELSE
  1258. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1259. dinc := GetIncr( dest, dim ); INC( dim );
  1260. WHILE (len > 0) DO
  1261. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1262. DEC( len );
  1263. END;
  1264. END;
  1265. END Traverse;
  1266. BEGIN
  1267. dim := GetDim( src );
  1268. origdest := 0; modes := {up, down}; (* copy modes *)
  1269. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1270. CopyUpCompatible( dest, src, modes );
  1271. IF up IN modes THEN (* nothing to be done *)
  1272. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1273. Reverse( src, dim ); Reverse( dest, dim )
  1274. ELSE (* can only copy via double buffer *)
  1275. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1276. END;
  1277. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1278. END;
  1279. (* check pattern: longest piece that can be done with a loop *)
  1280. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1281. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1282. IF up IN modes THEN (* nothing to be done *)
  1283. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1284. ELSE CopyContent( origdest, dest, elementSize );
  1285. END;
  1286. END CopyContent;
  1287. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS;
  1288. elementsize: LONGINT ): ANY;
  1289. VAR ptr, data: ANY; Size: LONGINT;
  1290. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1291. PROCEDURE UseDescriptor;
  1292. VAR tag: LONGINT;
  1293. BEGIN
  1294. SYSTEM.GET( src - 4, tag );
  1295. Heaps.NewRec( ptr, tag, FALSE );
  1296. dest := SYSTEM.VAL( LONGINT, ptr );
  1297. END UseDescriptor;
  1298. PROCEDURE NewData;
  1299. VAR dim, len, size: LONGINT;
  1300. BEGIN
  1301. dim := GetDim( src ); size := elementsize;
  1302. PutDim( dest, dim );
  1303. PutSize( dest, elementsize );
  1304. WHILE (dim > 0) DO
  1305. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1306. PutInc( dest, dim, size ); size := size * len;
  1307. END;
  1308. SYSTEM.NEW( data, size );
  1309. PutAdr( dest, data);
  1310. PutPtr( dest, data );
  1311. END NewData;
  1312. BEGIN
  1313. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  1314. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1315. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1316. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  1317. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1318. END;
  1319. PutFlags(dest, {TensorFlag});
  1320. NewData(); RETURN ptr;
  1321. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1322. (* check if re-allocation of descriptor is allowed *)
  1323. IF ~(TensorFlag IN GetFlags( dest )) &
  1324. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1325. HALT( 100 );
  1326. END;
  1327. UseDescriptor();
  1328. PutFlags(dest, {TensorFlag});
  1329. NewData(); RETURN ptr;
  1330. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1331. (* check if re-allocation of array data is allowed *)
  1332. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1333. HALT( 100 );
  1334. END;
  1335. NewData();
  1336. RETURN data;
  1337. ELSE (* nothing to do *)
  1338. RETURN NIL;
  1339. END;
  1340. END AllocateSame;
  1341. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1342. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1343. BEGIN
  1344. dim := GetDim(src);
  1345. p := GetArrayDesc(dim);
  1346. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1347. PutAdr( adr, 0 );
  1348. PutPtr( adr, NIL );
  1349. PutFlags( adr, {} );
  1350. RETURN p;
  1351. END TempDescCopy;
  1352. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: LONGINT );
  1353. VAR p: ANY;
  1354. BEGIN
  1355. ASSERT( src = dest ); p := TempDescCopy( src );
  1356. CopyArray( dest, p, elementsize );
  1357. END CopyArraySelf;
  1358. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1359. VAR p: ANY; srcdim, destdim: LONGINT;
  1360. BEGIN
  1361. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1362. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1363. srcdim := GetDim(src);
  1364. destdim := GetDim(dest);
  1365. (*
  1366. Debugging.Stack("copy array");
  1367. *)
  1368. Report( "copy array source", src ); Report( "copy array des", dest );
  1369. HALT(100);
  1370. ELSIF src = dest THEN (* self copy *)
  1371. CopyArraySelf( dest, src, elementsize );
  1372. ELSE
  1373. p := AllocateSame( dest, src, elementsize );
  1374. CopyContent( dest, src, elementsize )
  1375. END;
  1376. END CopyArray;
  1377. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1378. BEGIN
  1379. dest := 0; CopyTensor( dest, src, elementsize );
  1380. END CopyTensorSelf;
  1381. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1382. elementsize: SIZE );
  1383. VAR p: ANY;
  1384. BEGIN
  1385. (* Report("dest",dest); Report("src",src); *)
  1386. IF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1387. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1388. CopyContent( dest, src, elementsize );
  1389. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1390. ELSE CopyContent( dest, src, elementsize )
  1391. END;
  1392. END CopyTensor;
  1393. (* copy descriptor of src to that of dest. If not existent then create.*)
  1394. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS);
  1395. VAR ptr: ANY; flags: SET;
  1396. PROCEDURE UseTypeDescriptor;
  1397. VAR tag: LONGINT; ptr: ANY;
  1398. BEGIN
  1399. SYSTEM.GET( src + Heaps.TypeDescOffset, tag ); Heaps.NewRec( ptr, tag, FALSE );
  1400. dest := SYSTEM.VAL( LONGINT, ptr );
  1401. END UseTypeDescriptor;
  1402. PROCEDURE CopyDescriptor;
  1403. BEGIN
  1404. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(ADDRESS) * GetDim( src ) *2 );
  1405. END CopyDescriptor;
  1406. BEGIN
  1407. (*
  1408. KernelLog.String("ShallowCopy called with ");
  1409. KernelLog.Int(src,10); KernelLog.Int(dest,10);
  1410. KernelLog.Ln;
  1411. Report( "scopy source", src ); Report( "scopy dest", dest );
  1412. *)
  1413. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1414. IF TensorFlag IN GetFlags( src ) THEN UseTypeDescriptor();
  1415. ELSE
  1416. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr ); (* ??? *)
  1417. END;
  1418. CopyDescriptor();
  1419. PutFlags(dest, {TensorFlag});
  1420. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1421. flags := GetFlags(dest);
  1422. (* check if re-allocation of descriptor is allowed *)
  1423. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1424. Halt(DimensionMismatch,src,0,dest);
  1425. END;
  1426. (* create a new descriptor!!! (added by Alexey) *)
  1427. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1428. CopyDescriptor();
  1429. PutFlags(dest, flags);
  1430. ELSE
  1431. flags := GetFlags(dest);
  1432. (* check if re-allocation of array data is allowed *)
  1433. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1434. Halt(AllocationForbidden,src,0,dest);
  1435. END;
  1436. CopyDescriptor();
  1437. PutFlags(dest, flags);
  1438. END;
  1439. END ShallowCopy;
  1440. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1441. BEGIN
  1442. IF debug THEN
  1443. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1444. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1445. END;
  1446. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1447. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(ADDRESS) * GetDim( src ) *2 ); (* lens and increments *)
  1448. END DescriptorCopy;
  1449. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1450. VAR s,d: ADDRESS;
  1451. BEGIN
  1452. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1453. ShallowCopy(d,s);
  1454. SYSTEM.PUT(ADDRESSOF(dest),d);
  1455. END ZeroCopy;
  1456. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1457. BEGIN
  1458. ZeroCopy(src, RESULT);
  1459. RETURN RESULT
  1460. END "ALIAS";
  1461. PROCEDURE SameShape( l, r: LONGINT ): BOOLEAN;
  1462. VAR dim: LONGINT;
  1463. BEGIN
  1464. dim := GetDim( l );
  1465. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1466. WHILE (dim > 0) DO
  1467. DEC( dim );
  1468. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1469. END;
  1470. RETURN TRUE;
  1471. END SameShape;
  1472. (*
  1473. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1474. (*
  1475. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1476. check if deep copy can be avoided and if so then do a shallow copy
  1477. *)
  1478. BEGIN
  1479. ASSERT( dest # 0 ); (* impossible *)
  1480. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1481. HALT( 100 );
  1482. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1483. (* must copy (and allocate) *)
  1484. CopyArray( dest, src, elementsize );
  1485. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1486. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1487. ELSE CopyContent( dest, src, elementsize )
  1488. END;
  1489. ELSE DescriptorCopy( src, dest )
  1490. END;
  1491. END ZeroCopyArray;
  1492. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1493. (*
  1494. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1495. check if deep copy can be avoided and if so then do a shallow copy
  1496. *)
  1497. BEGIN
  1498. IF debug THEN
  1499. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1500. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1501. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1502. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1503. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1504. END;
  1505. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1506. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1507. ELSE
  1508. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1509. END;
  1510. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1511. (* must copy (and allocate) *)
  1512. CopyTensor( dest, src, elementsize );
  1513. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1514. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1515. ELSE
  1516. HALT( 100 ); (* copy forbidden *)
  1517. END;
  1518. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1519. DescriptorCopy( src, dest );
  1520. ELSE
  1521. HALT( 100 ); (* different shapes: not allowed *)
  1522. END;
  1523. END ZeroCopyTensor;
  1524. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1525. VAR i: LONGINT;
  1526. BEGIN
  1527. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1528. CopyContent( dest, left, elementSize )
  1529. ELSE
  1530. IF debug THEN
  1531. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1532. KernelLog.Ln;
  1533. END;
  1534. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1535. FOR i := 0 TO dim - 1 DO
  1536. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1537. END;
  1538. END;
  1539. END ZeroCopy;
  1540. *)
  1541. (*** conversions ****)
  1542. (** SHORTINT -> INTEGER *)
  1543. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1544. BEGIN
  1545. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1546. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1547. DEC( len );
  1548. END;
  1549. END ConvertASAILoop;
  1550. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1551. BEGIN
  1552. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1553. RETURN RESULT
  1554. END "@Convert";
  1555. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1556. BEGIN
  1557. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1558. RETURN RESULT
  1559. END "LONG";
  1560. (** SHORTINT -> LONGINT *)
  1561. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1562. BEGIN
  1563. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1564. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1565. DEC( len );
  1566. END;
  1567. END ConvertLoopSL;
  1568. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1569. BEGIN
  1570. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1571. RETURN RESULT
  1572. END "@Convert";
  1573. (** SHORTINT -> REAL *)
  1574. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1575. VAR lval: SHORTINT; dval: REAL;
  1576. BEGIN
  1577. WHILE (len > 0) DO
  1578. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1579. INC( dadr, dinc ); DEC( len );
  1580. END;
  1581. END ConvertLoopSR;
  1582. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1583. BEGIN
  1584. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1585. RETURN RESULT
  1586. END "@Convert";
  1587. (** SHORTINT -> LONGREAL *)
  1588. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1589. VAR lval: SHORTINT; dval: LONGREAL;
  1590. BEGIN
  1591. WHILE (len > 0) DO
  1592. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1593. INC( dadr, dinc ); DEC( len );
  1594. END;
  1595. END ConvertLoopSX;
  1596. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1597. BEGIN
  1598. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1599. RETURN RESULT
  1600. END "@Convert";
  1601. (** INTEGER -> SHORTINT (SHORT) *)
  1602. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1603. VAR lval: INTEGER; dval: SHORTINT;
  1604. BEGIN
  1605. WHILE (len > 0) DO
  1606. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1607. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1608. END;
  1609. END ConvertLoopIS;
  1610. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1611. BEGIN
  1612. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1613. RETURN RESULT
  1614. END "@Convert";
  1615. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1616. BEGIN
  1617. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1618. RETURN RESULT
  1619. END "SHORT";
  1620. (** INTEGER -> LONGINT *)
  1621. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1622. BEGIN
  1623. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1624. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1625. DEC( len );
  1626. END;
  1627. END ConvertLoopIL;
  1628. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1629. BEGIN
  1630. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1631. RETURN RESULT
  1632. END "@Convert";
  1633. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1634. BEGIN
  1635. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1636. RETURN RESULT
  1637. END "LONG";
  1638. (** INTEGER -> REAL *)
  1639. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1640. VAR lval: INTEGER; dval: REAL;
  1641. BEGIN
  1642. WHILE (len > 0) DO
  1643. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1644. INC( dadr, dinc ); DEC( len );
  1645. END;
  1646. END ConvertLoopIR;
  1647. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1648. BEGIN
  1649. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1650. RETURN RESULT
  1651. END "@Convert";
  1652. (** INTEGER -> LONGREAL *)
  1653. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1654. VAR lval: INTEGER; dval: LONGREAL;
  1655. BEGIN
  1656. WHILE (len > 0) DO
  1657. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1658. INC( dadr, dinc ); DEC( len );
  1659. END;
  1660. END ConvertLoopIX;
  1661. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1662. BEGIN
  1663. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1664. RETURN RESULT
  1665. END "@Convert";
  1666. (** LONGINT -> INTEGER (SHORT) *)
  1667. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1668. VAR lval: LONGINT; dval: INTEGER;
  1669. BEGIN
  1670. WHILE (len > 0) DO
  1671. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1672. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1673. END;
  1674. END ConvertLoopLI;
  1675. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1676. BEGIN
  1677. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1678. RETURN RESULT
  1679. END "@Convert";
  1680. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1681. BEGIN
  1682. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1683. RETURN RESULT
  1684. END "SHORT";
  1685. (** LONGINT -> REAL *)
  1686. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1687. VAR lval: LONGINT; dval: REAL;
  1688. BEGIN
  1689. WHILE (len > 0) DO
  1690. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1691. INC( dadr, dinc ); DEC( len );
  1692. END;
  1693. END ConvertLoopLR;
  1694. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1695. BEGIN
  1696. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1697. RETURN RESULT
  1698. END "@Convert";
  1699. (** LONGINT -> LONGREAL *)
  1700. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1701. VAR lval: LONGINT; dval: LONGREAL;
  1702. BEGIN
  1703. WHILE (len > 0) DO
  1704. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1705. INC( dadr, dinc ); DEC( len );
  1706. END;
  1707. END ConvertLoopLX;
  1708. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1709. BEGIN
  1710. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1711. RETURN RESULT
  1712. END "@Convert";
  1713. (** REAL -> LONGINT (ENTIER) *)
  1714. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1715. VAR lval: REAL; dval: LONGINT;
  1716. BEGIN
  1717. WHILE (len > 0) DO
  1718. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1719. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1720. END;
  1721. END ConvertLoopRL;
  1722. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1723. BEGIN
  1724. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1725. RETURN RESULT
  1726. END "@Convert";
  1727. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1728. BEGIN
  1729. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1730. RETURN RESULT
  1731. END "ENTIER";
  1732. (** REAL -> LONGREAL *)
  1733. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1734. VAR lval: REAL; dval: LONGREAL;
  1735. BEGIN
  1736. WHILE (len > 0) DO
  1737. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1738. INC( dadr, dinc ); DEC( len );
  1739. END;
  1740. END ConvertLoopRX;
  1741. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1742. BEGIN
  1743. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1744. RETURN RESULT
  1745. END "@Convert";
  1746. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1747. BEGIN
  1748. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1749. RETURN RESULT
  1750. END "LONG";
  1751. (** LONGREAL -> REAL (SHORT) *)
  1752. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1753. VAR lval: LONGREAL; dval: REAL;
  1754. BEGIN
  1755. WHILE (len > 0) DO
  1756. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1757. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1758. END;
  1759. END ConvertLoopXR;
  1760. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1761. BEGIN
  1762. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1763. RETURN RESULT
  1764. END "@Convert";
  1765. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1766. BEGIN
  1767. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1768. RETURN RESULT
  1769. END "SHORT";
  1770. (** LONGREAL -> LONGINT (ENTIER) *)
  1771. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1772. VAR lval: LONGREAL; dval: LONGINT;
  1773. BEGIN
  1774. WHILE (len > 0) DO
  1775. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1776. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1777. END;
  1778. END ConvertLoopXL;
  1779. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1780. BEGIN
  1781. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1782. RETURN RESULT
  1783. END "@Convert";
  1784. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1785. BEGIN
  1786. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1787. RETURN RESULT
  1788. END "ENTIER";
  1789. (*** monadic not A -> ~A ********************************************************************)
  1790. (** BOOLEAN *)
  1791. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1792. VAR lval: BOOLEAN;
  1793. BEGIN
  1794. WHILE (len > 0) DO
  1795. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1796. DEC( len );
  1797. END;
  1798. END NotLoopAB;
  1799. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1800. BEGIN
  1801. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1802. RETURN RESULT
  1803. END "~";
  1804. (*** monadic generic (A) -> -A ********************************************************************)
  1805. (** SHORTINT *)
  1806. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1807. VAR lval: SHORTINT;
  1808. BEGIN
  1809. WHILE (len > 0) DO
  1810. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1811. DEC( len );
  1812. END;
  1813. END GenericLoopS;
  1814. (** INTEGER *)
  1815. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1816. VAR lval: INTEGER;
  1817. BEGIN
  1818. WHILE (len > 0) DO
  1819. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1820. DEC( len );
  1821. END;
  1822. END GenericLoopI;
  1823. (** LONGINT *)
  1824. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1825. VAR lval: LONGINT;
  1826. BEGIN
  1827. WHILE (len > 0) DO
  1828. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1829. DEC( len );
  1830. END;
  1831. END GenericLoopL;
  1832. (** HUGEINT *)
  1833. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1834. VAR lval: HUGEINT;
  1835. BEGIN
  1836. WHILE (len > 0) DO
  1837. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1838. DEC( len );
  1839. END;
  1840. END GenericLoopH;
  1841. (** REAL *)
  1842. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1843. VAR lval: REAL;
  1844. BEGIN
  1845. WHILE (len > 0) DO
  1846. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1847. DEC( len );
  1848. END;
  1849. END GenericLoopR;
  1850. (** LONGREAL *)
  1851. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1852. VAR lval: LONGREAL;
  1853. BEGIN
  1854. WHILE (len > 0) DO
  1855. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1856. DEC( len );
  1857. END;
  1858. END GenericLoopX;
  1859. (** COMPLEX *)
  1860. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1861. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1862. BEGIN
  1863. WHILE (len > 0) DO
  1864. lval := ladr;
  1865. dval := dadr;
  1866. dval.val := op(lval.val);
  1867. INC( ladr, linc ); INC( dadr, dinc );
  1868. DEC( len );
  1869. END;
  1870. END GenericLoopZ;
  1871. (** LONGCOMPLEX *)
  1872. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1873. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1874. BEGIN
  1875. WHILE (len > 0) DO
  1876. lval := ladr;
  1877. dval := dadr;
  1878. dval.val := op (lval.val);
  1879. INC( ladr, linc ); INC( dadr, dinc );
  1880. DEC( len );
  1881. END;
  1882. END GenericLoopLZ;
  1883. (*** monadic minus A -> -A ********************************************************************)
  1884. (** SHORTINT *)
  1885. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1886. VAR lval: SHORTINT;
  1887. BEGIN
  1888. WHILE (len > 0) DO
  1889. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1890. DEC( len );
  1891. END;
  1892. END MinusLoopS;
  1893. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1894. BEGIN
  1895. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1896. RETURN RESULT
  1897. END "-";
  1898. (** INTEGER *)
  1899. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1900. VAR lval: INTEGER;
  1901. BEGIN
  1902. WHILE (len > 0) DO
  1903. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1904. DEC( len );
  1905. END;
  1906. END MinusLoopI;
  1907. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1908. BEGIN
  1909. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1910. RETURN RESULT
  1911. END "-";
  1912. (** LONGINT *)
  1913. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1914. VAR lval: LONGINT;
  1915. BEGIN
  1916. WHILE (len > 0) DO
  1917. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1918. DEC( len );
  1919. END;
  1920. END MinusLoopL;
  1921. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1922. BEGIN
  1923. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1924. RETURN RESULT
  1925. END "-";
  1926. (** REAL *)
  1927. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1928. VAR lval: REAL;
  1929. BEGIN
  1930. WHILE (len > 0) DO
  1931. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1932. DEC( len );
  1933. END;
  1934. END MinusLoopR;
  1935. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1936. BEGIN
  1937. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1938. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1939. RETURN RESULT
  1940. END "-";
  1941. (** LONGREAL *)
  1942. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1943. VAR lval: LONGREAL;
  1944. BEGIN
  1945. WHILE (len > 0) DO
  1946. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1947. DEC( len );
  1948. END;
  1949. END MinusLoopX;
  1950. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1951. BEGIN
  1952. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1953. MinusLoopX );
  1954. RETURN RESULT
  1955. END "-";
  1956. (*** add array + array -> array ********************************************************************)
  1957. (** SHORTINT *)
  1958. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1959. VAR lval, rval: SHORTINT;
  1960. BEGIN
  1961. WHILE (len > 0) DO
  1962. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1963. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1964. END;
  1965. END AddASASLoop;
  1966. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1967. BEGIN
  1968. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1969. SIZEOF( SHORTINT ), AddASASLoop );
  1970. RETURN RESULT
  1971. END "+";
  1972. (** INTEGER *)
  1973. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1974. VAR lval, rval: INTEGER;
  1975. BEGIN
  1976. WHILE (len > 0) DO
  1977. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1978. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1979. END;
  1980. END AddAIAILoop;
  1981. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  1982. BEGIN
  1983. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1984. SIZEOF( INTEGER ), AddAIAILoop );
  1985. RETURN RESULT
  1986. END "+";
  1987. (** LONGINT *)
  1988. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1989. VAR lval, rval: LONGINT;
  1990. BEGIN
  1991. WHILE (len > 0) DO
  1992. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1993. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1994. END;
  1995. END AddALALLoop;
  1996. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  1997. BEGIN
  1998. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1999. SIZEOF( LONGINT ), AddALALLoop );
  2000. RETURN RESULT
  2001. END "+";
  2002. (** REAL *)
  2003. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2004. VAR lval, rval: REAL;
  2005. BEGIN
  2006. WHILE (len > 0) DO
  2007. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2008. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2009. END;
  2010. END AddARARLoop;
  2011. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2012. BEGIN
  2013. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2014. loopAddARAR );
  2015. RETURN RESULT
  2016. END "+";
  2017. (** LONGREAL *)
  2018. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2019. VAR lval, rval: LONGREAL;
  2020. BEGIN
  2021. WHILE (len > 0) DO
  2022. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2023. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2024. END;
  2025. END AddAXAXLoop;
  2026. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2027. BEGIN
  2028. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2029. SIZEOF( LONGREAL ), loopAddAXAX );
  2030. RETURN RESULT
  2031. END "+";
  2032. (** COMPLEX *)
  2033. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2034. VAR lval, rval: COMPLEX;
  2035. BEGIN
  2036. WHILE (len > 0) DO
  2037. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2038. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2039. END;
  2040. END AddAZAZLoop;
  2041. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2042. BEGIN
  2043. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2044. SIZEOF( COMPLEX ), loopAddAZAZ );
  2045. RETURN RESULT
  2046. END "+";
  2047. (** LONGCOMPLEX *)
  2048. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2049. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2050. BEGIN
  2051. WHILE (len > 0) DO
  2052. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2053. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2054. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2055. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2056. DEC( len );
  2057. END;
  2058. END AddALZALZLoop;
  2059. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2060. BEGIN
  2061. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2062. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2063. RETURN RESULT
  2064. END "+";
  2065. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2066. (** SHORTINT *)
  2067. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2068. VAR lval, rval: SHORTINT;
  2069. BEGIN
  2070. SYSTEM.GET( radr, rval );
  2071. WHILE (len > 0) DO
  2072. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2073. INC( dadr, dinc ); DEC( len );
  2074. END;
  2075. END AddASSSLoop;
  2076. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2077. BEGIN
  2078. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2079. SIZEOF( SHORTINT ), AddASSSLoop );
  2080. RETURN RESULT
  2081. END "+";
  2082. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2083. BEGIN
  2084. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2085. SIZEOF( SHORTINT ), AddASSSLoop );
  2086. RETURN RESULT
  2087. END "+";
  2088. (** INTEGER *)
  2089. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2090. VAR lval, rval: INTEGER;
  2091. BEGIN
  2092. SYSTEM.GET( radr, rval );
  2093. WHILE (len > 0) DO
  2094. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2095. INC( dadr, dinc ); DEC( len );
  2096. END;
  2097. END AddAISILoop;
  2098. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2099. BEGIN
  2100. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2101. SIZEOF( INTEGER ), AddAISILoop );
  2102. RETURN RESULT
  2103. END "+";
  2104. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2105. BEGIN
  2106. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2107. SIZEOF( INTEGER ), AddAISILoop );
  2108. RETURN RESULT
  2109. END "+";
  2110. (** LONGINT *)
  2111. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2112. VAR lval, rval: LONGINT;
  2113. BEGIN
  2114. SYSTEM.GET( radr, rval );
  2115. WHILE (len > 0) DO
  2116. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2117. INC( dadr, dinc ); DEC( len );
  2118. END;
  2119. END AddALSLLoop;
  2120. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2121. BEGIN
  2122. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2123. SIZEOF( LONGINT ), AddALSLLoop );
  2124. RETURN RESULT
  2125. END "+";
  2126. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2127. BEGIN
  2128. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2129. SIZEOF( LONGINT ), AddALSLLoop );
  2130. RETURN RESULT
  2131. END "+";
  2132. (** REAL *)
  2133. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2134. VAR lval, rval: REAL;
  2135. BEGIN
  2136. SYSTEM.GET( radr, rval );
  2137. WHILE (len > 0) DO
  2138. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2139. INC( dadr, dinc ); DEC( len );
  2140. END;
  2141. END AddARSRLoop;
  2142. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2143. BEGIN
  2144. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2145. AddARSRLoop );
  2146. RETURN RESULT
  2147. END "+";
  2148. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2149. BEGIN
  2150. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2151. AddARSRLoop );
  2152. RETURN RESULT
  2153. END "+";
  2154. (** LONGREAL *)
  2155. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2156. VAR lval, rval: LONGREAL;
  2157. BEGIN
  2158. SYSTEM.GET( radr, rval );
  2159. WHILE (len > 0) DO
  2160. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2161. INC( dadr, dinc ); DEC( len );
  2162. END;
  2163. END AddAXSXLoop;
  2164. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2165. BEGIN
  2166. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2167. SIZEOF( LONGREAL ), AddAXSXLoop );
  2168. RETURN RESULT
  2169. END "+";
  2170. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2171. BEGIN
  2172. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2173. SIZEOF( LONGREAL ), AddAXSXLoop );
  2174. RETURN RESULT
  2175. END "+";
  2176. (** COMPLEX *)
  2177. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2178. VAR lval, rval: COMPLEX;
  2179. BEGIN
  2180. SYSTEM.GET( radr, rval );
  2181. WHILE (len > 0) DO
  2182. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2183. INC( dadr, dinc ); DEC( len );
  2184. END;
  2185. END AddAZSZLoop;
  2186. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2187. BEGIN
  2188. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2189. AddAZSZLoop );
  2190. RETURN RESULT
  2191. END "+";
  2192. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2193. BEGIN
  2194. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2195. AddAZSZLoop );
  2196. RETURN RESULT
  2197. END "+";
  2198. (** LONGCOMPLEX *)
  2199. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2200. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2201. BEGIN
  2202. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2203. WHILE (len > 0) DO
  2204. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2205. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2206. INC( ladr, linc );
  2207. INC( dadr, dinc ); DEC( len );
  2208. END;
  2209. END AddALZSLZLoop;
  2210. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2211. BEGIN
  2212. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2213. AddALZSLZLoop );
  2214. RETURN RESULT
  2215. END "+";
  2216. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2217. BEGIN
  2218. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2219. AddALZSLZLoop );
  2220. RETURN RESULT
  2221. END "+";
  2222. (*** subtraction array - array -> array ********************************************************************)
  2223. (** SHORTINT *)
  2224. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2225. VAR lval, rval: SHORTINT;
  2226. BEGIN
  2227. WHILE (len > 0) DO
  2228. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2229. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2230. END;
  2231. END SubASASLoop;
  2232. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2233. BEGIN
  2234. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2235. SIZEOF( SHORTINT ), SubASASLoop );
  2236. RETURN RESULT
  2237. END "-";
  2238. (** INTEGER *)
  2239. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2240. VAR lval, rval: INTEGER;
  2241. BEGIN
  2242. WHILE (len > 0) DO
  2243. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2244. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2245. END;
  2246. END SubAIAILoop;
  2247. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2248. BEGIN
  2249. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2250. SIZEOF( INTEGER ), SubAIAILoop );
  2251. RETURN RESULT
  2252. END "-";
  2253. (** LONGINT *)
  2254. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2255. VAR lval, rval: LONGINT;
  2256. BEGIN
  2257. WHILE (len > 0) DO
  2258. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2259. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2260. END;
  2261. END SubALALLoop;
  2262. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2263. BEGIN
  2264. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2265. SIZEOF( LONGINT ), SubALALLoop );
  2266. RETURN RESULT
  2267. END "-";
  2268. (** REAL *)
  2269. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2270. VAR lval, rval: REAL;
  2271. BEGIN
  2272. WHILE (len > 0) DO
  2273. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2274. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2275. END;
  2276. END SubARARLoop;
  2277. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2278. BEGIN
  2279. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2280. SubARARLoop );
  2281. RETURN RESULT
  2282. END "-";
  2283. (** LONGREAL *)
  2284. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2285. VAR lval, rval: LONGREAL;
  2286. BEGIN
  2287. WHILE (len > 0) DO
  2288. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2289. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2290. END;
  2291. END SubAXAXLoop;
  2292. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2293. BEGIN
  2294. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2295. SIZEOF( LONGREAL ), SubAXAXLoop );
  2296. RETURN RESULT
  2297. END "-";
  2298. (** COMPLEX *)
  2299. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2300. VAR lval, rval: COMPLEX;
  2301. BEGIN
  2302. WHILE (len > 0) DO
  2303. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2304. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2305. END;
  2306. END SubAZAZLoop;
  2307. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2308. BEGIN
  2309. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2310. SIZEOF( COMPLEX ), SubAZAZLoop );
  2311. RETURN RESULT
  2312. END "-";
  2313. (** LONGCOMPLEX *)
  2314. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2315. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2316. BEGIN
  2317. WHILE (len > 0) DO
  2318. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2319. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2320. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2321. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2322. DEC( len );
  2323. END;
  2324. END SubALZALZLoop;
  2325. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2326. BEGIN
  2327. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2328. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2329. RETURN RESULT
  2330. END "-";
  2331. (*** subtraction array-scalar -> array ********************************************************************)
  2332. (** SHORTINT *)
  2333. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2334. BEGIN
  2335. RESULT := left + (-right);
  2336. RETURN RESULT
  2337. END "-";
  2338. (** INTEGER *)
  2339. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2340. BEGIN
  2341. RESULT := left + (-right);
  2342. RETURN RESULT
  2343. END "-";
  2344. (** LONGINT *)
  2345. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2346. BEGIN
  2347. RESULT := left + (-right);
  2348. RETURN RESULT
  2349. END "-";
  2350. (** REAL *)
  2351. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2352. BEGIN
  2353. RESULT := left + (-right);
  2354. RETURN RESULT
  2355. END "-";
  2356. (** LONGREAL *)
  2357. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2358. BEGIN
  2359. RESULT := left + (-right);
  2360. RETURN RESULT
  2361. END "-";
  2362. (** COMPLEX *)
  2363. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2364. BEGIN
  2365. RESULT := left + (-right);
  2366. RETURN RESULT
  2367. END "-";
  2368. (** LONGCOMPLEX *)
  2369. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2370. BEGIN
  2371. RESULT := left + (-right);
  2372. RETURN RESULT
  2373. END "-";
  2374. (*** subtraction scalar-array -> array ********************************************************************)
  2375. (** SHORTINT *)
  2376. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2377. VAR lval, rval, dval: SHORTINT;
  2378. BEGIN
  2379. SYSTEM.GET( radr, rval );
  2380. WHILE (len > 0) DO
  2381. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2382. INC( dadr, dinc ); DEC( len );
  2383. END;
  2384. END SubSSASLoop;
  2385. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2386. BEGIN
  2387. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2388. SIZEOF( SHORTINT ), SubSSASLoop );
  2389. RETURN RESULT
  2390. END "-";
  2391. (** INTEGER *)
  2392. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2393. VAR lval, rval, dval: INTEGER;
  2394. BEGIN
  2395. SYSTEM.GET( radr, rval );
  2396. WHILE (len > 0) DO
  2397. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2398. INC( dadr, dinc ); DEC( len );
  2399. END;
  2400. END SubSIAILoop;
  2401. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2402. BEGIN
  2403. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2404. SIZEOF( INTEGER ), SubSIAILoop );
  2405. RETURN RESULT
  2406. END "-";
  2407. (** LONGINT *)
  2408. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2409. VAR lval, rval, dval: LONGINT;
  2410. BEGIN
  2411. SYSTEM.GET( radr, rval );
  2412. WHILE (len > 0) DO
  2413. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2414. INC( dadr, dinc ); DEC( len );
  2415. END;
  2416. END SubSLALLoop;
  2417. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2418. BEGIN
  2419. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2420. SIZEOF( LONGINT ), SubSLALLoop );
  2421. RETURN RESULT
  2422. END "-";
  2423. (** REAL *)
  2424. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2425. VAR lval, rval, dval: REAL;
  2426. BEGIN
  2427. SYSTEM.GET( radr, rval );
  2428. WHILE (len > 0) DO
  2429. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2430. INC( dadr, dinc ); DEC( len );
  2431. END;
  2432. END SubSRARLoop;
  2433. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2434. BEGIN
  2435. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2436. SubSRARLoop );
  2437. RETURN RESULT
  2438. END "-";
  2439. (** LONGREAL *)
  2440. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2441. VAR lval, rval, dval: LONGREAL;
  2442. BEGIN
  2443. SYSTEM.GET( radr, rval );
  2444. WHILE (len > 0) DO
  2445. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2446. INC( dadr, dinc ); DEC( len );
  2447. END;
  2448. END SubSXAXLoop;
  2449. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2450. BEGIN
  2451. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2452. SIZEOF( LONGREAL ), SubSXAXLoop );
  2453. RETURN RESULT
  2454. END "-";
  2455. (** COMPLEX *)
  2456. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2457. VAR lval, rval, dval: COMPLEX;
  2458. BEGIN
  2459. SYSTEM.GET( radr, rval );
  2460. WHILE (len > 0) DO
  2461. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2462. INC( dadr, dinc ); DEC( len );
  2463. END;
  2464. END SubSZAZLoop;
  2465. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2466. BEGIN
  2467. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2468. SIZEOF( COMPLEX ), SubSZAZLoop );
  2469. RETURN RESULT
  2470. END "-";
  2471. (** LONGCOMPLEX *)
  2472. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2473. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2474. BEGIN
  2475. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2476. WHILE (len > 0) DO
  2477. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2478. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2479. INC( ladr, linc );
  2480. INC( dadr, dinc ); DEC( len );
  2481. END;
  2482. END SubSLZALZLoop;
  2483. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2484. BEGIN
  2485. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2486. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2487. RETURN RESULT
  2488. END "-";
  2489. (*** element-wise multiply array x array -> array ********************************************************************)
  2490. (** SHORTINT *)
  2491. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2492. VAR lval, rval: SHORTINT;
  2493. BEGIN
  2494. WHILE (len > 0) DO
  2495. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2496. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2497. END;
  2498. END EMulASASLoop;
  2499. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2500. BEGIN
  2501. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2502. SIZEOF( SHORTINT ), EMulASASLoop );
  2503. RETURN RESULT
  2504. END ".*";
  2505. (** INTEGER *)
  2506. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2507. VAR lval, rval: INTEGER; dval: INTEGER;
  2508. BEGIN
  2509. WHILE (len > 0) DO
  2510. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2511. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2512. DEC( len );
  2513. END;
  2514. END EMulAIAILoop;
  2515. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2516. BEGIN
  2517. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2518. SIZEOF( INTEGER ), EMulAIAILoop );
  2519. RETURN RESULT
  2520. END ".*";
  2521. (** LONGINT *)
  2522. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2523. VAR lval, rval: LONGINT;
  2524. BEGIN
  2525. WHILE (len > 0) DO
  2526. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2527. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2528. END;
  2529. END EMulALALLoop;
  2530. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2531. BEGIN
  2532. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2533. SIZEOF( LONGINT ), EMulALALLoop );
  2534. RETURN RESULT
  2535. END ".*";
  2536. (** REAL *)
  2537. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2538. VAR lval, rval: REAL;
  2539. BEGIN
  2540. WHILE (len > 0) DO
  2541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2542. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2543. END;
  2544. END EMulARARLoop;
  2545. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2546. BEGIN
  2547. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2548. EMulARARLoop );
  2549. RETURN RESULT
  2550. END ".*";
  2551. (** LONGREAL *)
  2552. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2553. VAR lval, rval: LONGREAL;
  2554. BEGIN
  2555. WHILE (len > 0) DO
  2556. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2557. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2558. END;
  2559. END EMulAXAXLoop;
  2560. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2561. BEGIN
  2562. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2563. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2564. RETURN RESULT
  2565. END ".*";
  2566. (** COMPLEX *)
  2567. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2568. VAR lval, rval: COMPLEX;
  2569. BEGIN
  2570. WHILE (len > 0) DO
  2571. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2572. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2573. END;
  2574. END EMulAZAZLoop;
  2575. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2576. BEGIN
  2577. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2578. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2579. RETURN RESULT
  2580. END ".*";
  2581. (** LONGCOMPLEX *)
  2582. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2583. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2584. BEGIN
  2585. WHILE (len > 0) DO
  2586. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2587. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2588. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2589. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2590. DEC( len );
  2591. END;
  2592. END EMulALZALZLoop;
  2593. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2594. BEGIN
  2595. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2596. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2597. RETURN RESULT
  2598. END ".*";
  2599. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2600. (** SHORTINT *)
  2601. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2602. VAR lval, rval,dval: SHORTINT;
  2603. BEGIN
  2604. WHILE (len > 0) DO
  2605. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2606. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2607. END;
  2608. END EMulIncASASLoop;
  2609. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2610. BEGIN
  2611. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2612. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2613. END ".*+";
  2614. (** INTEGER *)
  2615. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2616. VAR lval, rval,dval: INTEGER;
  2617. BEGIN
  2618. WHILE (len > 0) DO
  2619. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2620. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2621. DEC( len );
  2622. END;
  2623. END EMulIncAIAILoop;
  2624. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2625. BEGIN
  2626. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2627. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2628. END ".*+";
  2629. (** LONGINT *)
  2630. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2631. VAR lval, rval,dval: LONGINT;
  2632. BEGIN
  2633. WHILE (len > 0) DO
  2634. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2635. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2636. END;
  2637. END EMulIncALALLoop;
  2638. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2639. BEGIN
  2640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2641. SIZEOF( LONGINT ), EMulIncALALLoop );
  2642. END ".*+";
  2643. (** REAL *)
  2644. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2645. VAR lval, rval,dval: REAL;
  2646. BEGIN
  2647. WHILE (len > 0) DO
  2648. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2649. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2650. END;
  2651. END EMulIncARARLoop;
  2652. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2653. BEGIN
  2654. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2655. EMulIncARARLoop );
  2656. END ".*+";
  2657. (** LONGREAL *)
  2658. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2659. VAR lval, rval,dval: LONGREAL;
  2660. BEGIN
  2661. WHILE (len > 0) DO
  2662. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2663. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2664. END;
  2665. END EMulIncAXAXLoop;
  2666. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2667. BEGIN
  2668. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2669. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2670. END ".*+";
  2671. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2672. (** SHORTINT *)
  2673. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2674. VAR lval, rval: SHORTINT;
  2675. BEGIN
  2676. SYSTEM.GET( radr, rval );
  2677. WHILE (len > 0) DO
  2678. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2679. INC( dadr, dinc ); DEC( len );
  2680. END;
  2681. END MulASSSLoop;
  2682. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2683. BEGIN
  2684. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2685. SIZEOF( SHORTINT ), MulASSSLoop );
  2686. RETURN RESULT
  2687. END "*";
  2688. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2689. BEGIN
  2690. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2691. SIZEOF( SHORTINT ), MulASSSLoop );
  2692. RETURN RESULT
  2693. END "*";
  2694. (** INTEGER *)
  2695. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2696. VAR lval, rval: INTEGER;
  2697. BEGIN
  2698. SYSTEM.GET( radr, rval );
  2699. WHILE (len > 0) DO
  2700. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2701. INC( dadr, dinc ); DEC( len );
  2702. END;
  2703. END MulAISILoop;
  2704. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2705. BEGIN
  2706. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2707. SIZEOF( INTEGER ), MulAISILoop );
  2708. RETURN RESULT
  2709. END "*";
  2710. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2711. BEGIN
  2712. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2713. SIZEOF( INTEGER ), MulAISILoop );
  2714. RETURN RESULT
  2715. END "*";
  2716. (** LONGINT *)
  2717. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2718. VAR lval, rval: LONGINT;
  2719. BEGIN
  2720. SYSTEM.GET( radr, rval );
  2721. WHILE (len > 0) DO
  2722. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2723. INC( dadr, dinc ); DEC( len );
  2724. END;
  2725. END MulALSLLoop;
  2726. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2727. BEGIN
  2728. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2729. SIZEOF( LONGINT ), MulALSLLoop );
  2730. RETURN RESULT
  2731. END "*";
  2732. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2733. BEGIN
  2734. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2735. SIZEOF( LONGINT ), MulALSLLoop );
  2736. RETURN RESULT
  2737. END "*";
  2738. (** REAL *)
  2739. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2740. VAR lval, rval: REAL;
  2741. BEGIN
  2742. SYSTEM.GET( radr, rval );
  2743. WHILE (len > 0) DO
  2744. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2745. INC( dadr, dinc ); DEC( len );
  2746. END;
  2747. END MulARSRLoop;
  2748. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2749. BEGIN
  2750. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2751. loopMulARSR );
  2752. RETURN RESULT
  2753. END "*";
  2754. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2755. BEGIN
  2756. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2757. loopMulARSR );
  2758. RETURN RESULT
  2759. END "*";
  2760. (** LONGREAL *)
  2761. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2762. VAR lval, rval: LONGREAL;
  2763. BEGIN
  2764. IF debug THEN
  2765. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2766. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2767. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2768. END;
  2769. SYSTEM.GET( radr, rval );
  2770. WHILE (len > 0) DO
  2771. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2772. INC( dadr, dinc ); DEC( len );
  2773. END;
  2774. END MulAXSXLoop;
  2775. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2776. BEGIN
  2777. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2778. SIZEOF( LONGREAL ), loopMulAXSX );
  2779. RETURN RESULT
  2780. END "*";
  2781. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2782. BEGIN
  2783. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2784. SIZEOF( LONGREAL ), loopMulAXSX );
  2785. RETURN RESULT
  2786. END "*";
  2787. (** COMPLEX *)
  2788. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2789. VAR lval, rval: COMPLEX;
  2790. BEGIN
  2791. SYSTEM.GET( radr, rval );
  2792. WHILE (len > 0) DO
  2793. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2794. INC( dadr, dinc ); DEC( len );
  2795. END;
  2796. END MulAZSZLoop;
  2797. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2798. BEGIN
  2799. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2800. loopMulAZSZ );
  2801. RETURN RESULT
  2802. END "*";
  2803. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2804. BEGIN
  2805. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2806. loopMulAZSZ );
  2807. RETURN RESULT
  2808. END "*";
  2809. (** LONGCOMPLEX *)
  2810. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2811. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2812. BEGIN
  2813. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2814. WHILE (len > 0) DO
  2815. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2816. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2817. INC( ladr, linc );
  2818. INC( dadr, dinc ); DEC( len );
  2819. END;
  2820. END MulALZSLZLoop;
  2821. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2822. BEGIN
  2823. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2824. loopMulALZSLZ );
  2825. RETURN RESULT
  2826. END "*";
  2827. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2828. BEGIN
  2829. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2830. loopMulALZSLZ );
  2831. RETURN RESULT
  2832. END "*";
  2833. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2834. (** SHORTINT *)
  2835. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2836. VAR lval, rval, dval: SHORTINT;
  2837. BEGIN
  2838. SYSTEM.GET( radr, rval );
  2839. WHILE (len > 0) DO
  2840. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2841. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2842. END;
  2843. END IncMulASSSLoop;
  2844. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2845. BEGIN
  2846. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2847. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2848. END "IncMul";
  2849. OPERATOR "IncMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2850. BEGIN
  2851. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2852. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2853. RETURN RESULT
  2854. END "IncMul";
  2855. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2856. BEGIN
  2857. RESULT := -RESULT;
  2858. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2859. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2860. RESULT := -RESULT;
  2861. RETURN RESULT
  2862. END "DecMul";
  2863. OPERATOR "DecMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2864. BEGIN
  2865. RESULT := -RESULT;
  2866. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2867. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2868. RESULT := -RESULT;
  2869. RETURN RESULT
  2870. END "DecMul";
  2871. (** INTEGER *)
  2872. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2873. VAR lval, rval, dval: INTEGER;
  2874. BEGIN
  2875. SYSTEM.GET( radr, rval );
  2876. WHILE (len > 0) DO
  2877. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2878. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2879. END;
  2880. END IncMulAISILoop;
  2881. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2882. BEGIN
  2883. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2884. SIZEOF( INTEGER ), IncMulAISILoop );
  2885. RETURN RESULT
  2886. END "IncMul";
  2887. OPERATOR "IncMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2888. BEGIN
  2889. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2890. SIZEOF( INTEGER ), IncMulAISILoop );
  2891. RETURN RESULT
  2892. END "IncMul";
  2893. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2894. BEGIN
  2895. RESULT := -RESULT;
  2896. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2897. SIZEOF( INTEGER ), IncMulAISILoop );
  2898. RESULT := -RESULT;
  2899. RETURN RESULT
  2900. END "DecMul";
  2901. OPERATOR "DecMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2902. BEGIN
  2903. RESULT := -RESULT;
  2904. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2905. SIZEOF( INTEGER ), IncMulAISILoop );
  2906. RESULT := -RESULT;
  2907. RETURN RESULT
  2908. END "DecMul";
  2909. (** LONGINT *)
  2910. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2911. VAR lval, rval, dval: LONGINT;
  2912. BEGIN
  2913. SYSTEM.GET( radr, rval );
  2914. WHILE (len > 0) DO
  2915. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2916. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2917. END;
  2918. END IncMulALSLLoop;
  2919. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2920. BEGIN
  2921. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2922. SIZEOF( LONGINT ), IncMulALSLLoop );
  2923. RETURN RESULT
  2924. END "IncMul";
  2925. OPERATOR "IncMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2926. BEGIN
  2927. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2928. SIZEOF( LONGINT ), IncMulALSLLoop );
  2929. RETURN RESULT
  2930. END "IncMul";
  2931. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2932. BEGIN
  2933. RESULT := -RESULT;
  2934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2935. SIZEOF( LONGINT ), IncMulALSLLoop );
  2936. RESULT := -RESULT;
  2937. RETURN RESULT
  2938. END "DecMul";
  2939. OPERATOR "DecMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2940. BEGIN
  2941. RESULT := -RESULT;
  2942. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2943. SIZEOF( LONGINT ), IncMulALSLLoop );
  2944. RESULT := -RESULT;
  2945. RETURN RESULT
  2946. END "DecMul";
  2947. (** REAL *)
  2948. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2949. VAR lval, rval, dval: REAL;
  2950. BEGIN
  2951. SYSTEM.GET( radr, rval );
  2952. WHILE (len > 0) DO
  2953. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2954. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2955. END;
  2956. END IncMulARSRLoop;
  2957. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2958. BEGIN
  2959. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2960. loopIncMulARSR );
  2961. RETURN RESULT
  2962. END "IncMul";
  2963. OPERATOR "IncMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2964. BEGIN
  2965. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2966. loopIncMulARSR );
  2967. RETURN RESULT
  2968. END "IncMul";
  2969. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2970. BEGIN
  2971. RESULT := -RESULT;
  2972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2973. loopIncMulARSR );
  2974. RESULT := -RESULT;
  2975. RETURN RESULT
  2976. END "DecMul";
  2977. OPERATOR "DecMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2978. BEGIN
  2979. RESULT := -RESULT;
  2980. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2981. loopIncMulARSR );
  2982. RESULT := -RESULT;
  2983. RETURN RESULT
  2984. END "DecMul";
  2985. (** LONGREAL *)
  2986. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2987. VAR lval, rval, dval: LONGREAL;
  2988. BEGIN
  2989. IF debug THEN
  2990. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2991. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2992. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2993. END;
  2994. SYSTEM.GET( radr, rval );
  2995. WHILE (len > 0) DO
  2996. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2997. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2998. END;
  2999. END IncMulAXSXLoop;
  3000. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3001. BEGIN
  3002. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3003. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3004. RETURN RESULT
  3005. END "IncMul";
  3006. OPERATOR "IncMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3007. BEGIN
  3008. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3009. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3010. RETURN RESULT
  3011. END "IncMul";
  3012. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3013. BEGIN
  3014. RESULT := -RESULT;
  3015. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3016. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3017. RESULT := -RESULT;
  3018. RETURN RESULT
  3019. END "DecMul";
  3020. OPERATOR "DecMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3021. BEGIN
  3022. RESULT := -RESULT;
  3023. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3024. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3025. RESULT := -RESULT;
  3026. RETURN RESULT
  3027. END "DecMul";
  3028. (*** element-wise division array / array -> array ********************************************************************)
  3029. (** SHORTINT *)
  3030. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3031. VAR lval, rval: SHORTINT; dval: REAL;
  3032. BEGIN
  3033. WHILE (len > 0) DO
  3034. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3035. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3036. DEC( len );
  3037. END;
  3038. END EDivideASASLoop;
  3039. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3040. BEGIN
  3041. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3042. EDivideASASLoop );
  3043. RETURN RESULT
  3044. END "./";
  3045. (** INTEGER *)
  3046. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3047. VAR lval, rval: INTEGER; dval: REAL;
  3048. BEGIN
  3049. WHILE (len > 0) DO
  3050. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3051. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3052. DEC( len );
  3053. END;
  3054. END EDivideAIAILoop;
  3055. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3056. BEGIN
  3057. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3058. EDivideAIAILoop );
  3059. RETURN RESULT
  3060. END "./";
  3061. (** LONGINT *)
  3062. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3063. VAR lval, rval: LONGINT; dval: REAL;
  3064. BEGIN
  3065. WHILE (len > 0) DO
  3066. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3067. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3068. DEC( len );
  3069. END;
  3070. END EDivideALALLoop;
  3071. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3072. BEGIN
  3073. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3074. EDivideALALLoop );
  3075. RETURN RESULT
  3076. END "./";
  3077. (** REAL *)
  3078. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3079. VAR lval, rval: REAL; dval: REAL;
  3080. BEGIN
  3081. WHILE (len > 0) DO
  3082. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3083. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3084. DEC( len );
  3085. END;
  3086. END EDivideARARLoop;
  3087. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3088. BEGIN
  3089. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3090. EDivideARARLoop );
  3091. RETURN RESULT
  3092. END "./";
  3093. (** LONGREAL *)
  3094. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3095. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3096. BEGIN
  3097. WHILE (len > 0) DO
  3098. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3099. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3100. DEC( len );
  3101. END;
  3102. END EDivideAXAXLoop;
  3103. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3104. BEGIN
  3105. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3106. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3107. RETURN RESULT
  3108. END "./";
  3109. (** COMPLEX *)
  3110. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3111. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3112. BEGIN
  3113. WHILE (len > 0) DO
  3114. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3115. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3116. DEC( len );
  3117. END;
  3118. END EDivideAZAZLoop;
  3119. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3120. BEGIN
  3121. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3122. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3123. RETURN RESULT
  3124. END "./";
  3125. (** LONGCOMPLEX *)
  3126. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3127. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3128. BEGIN
  3129. WHILE (len > 0) DO
  3130. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3131. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3132. IF rvalIm # 0.0D0 THEN
  3133. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3134. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3135. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3136. ELSE
  3137. dvalRe := lvalRe/rvalRe;
  3138. dvalIm := lvalIm/rvalRe;
  3139. END;
  3140. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3141. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3142. DEC( len );
  3143. END;
  3144. END EDivideALZALZLoop;
  3145. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3146. BEGIN
  3147. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3148. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3149. RETURN RESULT
  3150. END "./";
  3151. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3152. (** SHORTINT *)
  3153. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3154. VAR lval, rval: SHORTINT; dval: REAL;
  3155. BEGIN
  3156. SYSTEM.GET( radr, rval );
  3157. WHILE (len > 0) DO
  3158. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3159. INC( dadr, dinc ); DEC( len );
  3160. END;
  3161. END DivideASSSLoop;
  3162. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3163. BEGIN
  3164. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3165. DivideASSSLoop );
  3166. RETURN RESULT
  3167. END "/";
  3168. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3169. VAR lval, rval: SHORTINT; dval: REAL;
  3170. BEGIN
  3171. SYSTEM.GET( radr, rval );
  3172. WHILE (len > 0) DO
  3173. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3174. INC( dadr, dinc ); DEC( len );
  3175. END;
  3176. END DivideSSASLoop;
  3177. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3178. BEGIN
  3179. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3180. DivideSSASLoop );
  3181. RETURN RESULT
  3182. END "/";
  3183. (** INTEGER *)
  3184. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3185. VAR lval, rval: INTEGER; dval: REAL;
  3186. BEGIN
  3187. SYSTEM.GET( radr, rval );
  3188. WHILE (len > 0) DO
  3189. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3190. INC( dadr, dinc ); DEC( len );
  3191. END;
  3192. END DivideAISILoop;
  3193. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3194. BEGIN
  3195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3196. DivideAISILoop );
  3197. RETURN RESULT
  3198. END "/";
  3199. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3200. VAR lval, rval: INTEGER; dval: REAL;
  3201. BEGIN
  3202. SYSTEM.GET( radr, rval );
  3203. WHILE (len > 0) DO
  3204. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3205. INC( dadr, dinc ); DEC( len );
  3206. END;
  3207. END DivideSIAILoop;
  3208. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3209. BEGIN
  3210. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3211. DivideSIAILoop );
  3212. RETURN RESULT
  3213. END "/";
  3214. (** LONGINT *)
  3215. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3216. VAR lval, rval: LONGINT; dval: REAL;
  3217. BEGIN
  3218. SYSTEM.GET( radr, rval );
  3219. WHILE (len > 0) DO
  3220. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3221. INC( dadr, dinc ); DEC( len );
  3222. END;
  3223. END DivideALSLLoop;
  3224. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3225. BEGIN
  3226. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3227. DivideALSLLoop );
  3228. RETURN RESULT
  3229. END "/";
  3230. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3231. VAR lval, rval: LONGINT; dval: REAL;
  3232. BEGIN
  3233. SYSTEM.GET( radr, rval );
  3234. WHILE (len > 0) DO
  3235. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3236. INC( dadr, dinc ); DEC( len );
  3237. END;
  3238. END DivideSLALLoop;
  3239. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3240. BEGIN
  3241. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3242. DivideSLALLoop );
  3243. RETURN RESULT
  3244. END "/";
  3245. (** REAL *)
  3246. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3247. VAR lval, rval: REAL; dval: REAL;
  3248. BEGIN
  3249. SYSTEM.GET( radr, rval );
  3250. WHILE (len > 0) DO
  3251. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3252. INC( dadr, dinc ); DEC( len );
  3253. END;
  3254. END DivideARSRLoop;
  3255. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3256. BEGIN
  3257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3258. DivideARSRLoop );
  3259. RETURN RESULT
  3260. END "/";
  3261. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3262. VAR lval, rval: REAL; dval: REAL;
  3263. BEGIN
  3264. SYSTEM.GET( radr, rval );
  3265. WHILE (len > 0) DO
  3266. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3267. INC( dadr, dinc ); DEC( len );
  3268. END;
  3269. END DivideSRARLoop;
  3270. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3271. BEGIN
  3272. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3273. DivideSRARLoop );
  3274. RETURN RESULT
  3275. END "/";
  3276. (** LONGREAL *)
  3277. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3278. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3279. BEGIN
  3280. SYSTEM.GET( radr, rval );
  3281. WHILE (len > 0) DO
  3282. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3283. INC( dadr, dinc ); DEC( len );
  3284. END;
  3285. END DivideAXSXLoop;
  3286. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3287. BEGIN
  3288. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3289. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3290. RETURN RESULT
  3291. END "/";
  3292. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3293. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3294. BEGIN
  3295. SYSTEM.GET( radr, rval );
  3296. WHILE (len > 0) DO
  3297. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3298. INC( dadr, dinc ); DEC( len );
  3299. END;
  3300. END DivideSXAXLoop;
  3301. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3302. BEGIN
  3303. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3304. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3305. RETURN RESULT
  3306. END "/";
  3307. (** COMPLEX *)
  3308. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3309. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3310. BEGIN
  3311. SYSTEM.GET( radr, rval );
  3312. WHILE (len > 0) DO
  3313. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3314. INC( dadr, dinc ); DEC( len );
  3315. END;
  3316. END DivideAZSZLoop;
  3317. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3318. BEGIN
  3319. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3320. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3321. RETURN RESULT
  3322. END "/";
  3323. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3324. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3325. BEGIN
  3326. SYSTEM.GET( radr, rval );
  3327. WHILE (len > 0) DO
  3328. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3329. INC( dadr, dinc ); DEC( len );
  3330. END;
  3331. END DivideSZAZLoop;
  3332. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3333. BEGIN
  3334. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3335. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3336. RETURN RESULT
  3337. END "/";
  3338. (** LONGCOMPLEX *)
  3339. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3340. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3341. BEGIN
  3342. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3343. IF rvalIm # 0.0D0 THEN
  3344. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3345. WHILE (len > 0) DO
  3346. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3347. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3348. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3349. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3350. INC( ladr, linc );
  3351. INC( dadr, dinc ); DEC( len );
  3352. END;
  3353. ELSE
  3354. WHILE (len > 0) DO
  3355. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3356. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3357. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3358. INC( ladr, linc );
  3359. INC( dadr, dinc ); DEC( len );
  3360. END;
  3361. END;
  3362. END DivideALZSLZLoop;
  3363. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3364. BEGIN
  3365. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3366. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3367. RETURN RESULT
  3368. END "/";
  3369. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3370. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3371. BEGIN
  3372. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3373. WHILE (len > 0) DO
  3374. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3375. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3376. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3377. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3378. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3379. INC( ladr, linc );
  3380. INC( dadr, dinc ); DEC( len );
  3381. END;
  3382. END DivideSLZALZLoop;
  3383. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3384. BEGIN
  3385. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3386. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3387. RETURN RESULT
  3388. END "/";
  3389. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3390. (** SHORTINT *)
  3391. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3392. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3393. BEGIN
  3394. WHILE (len > 0) DO
  3395. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3396. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3397. DEC( len );
  3398. END;
  3399. END EDivASASLoop;
  3400. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3401. BEGIN
  3402. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3403. SIZEOF( SHORTINT ), EDivASASLoop );
  3404. RETURN RESULT
  3405. END "DIV";
  3406. (** INTEGER *)
  3407. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3408. VAR lval, rval: INTEGER; dval: INTEGER;
  3409. BEGIN
  3410. WHILE (len > 0) DO
  3411. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3412. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3413. DEC( len );
  3414. END;
  3415. END EDivAIAILoop;
  3416. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3417. BEGIN
  3418. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3419. SIZEOF( INTEGER ), EDivAIAILoop );
  3420. RETURN RESULT
  3421. END "DIV";
  3422. (** LONGINT *)
  3423. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3424. VAR lval, rval: LONGINT; dval: LONGINT;
  3425. BEGIN
  3426. WHILE (len > 0) DO
  3427. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3428. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3429. DEC( len );
  3430. END;
  3431. END EDivALALLoop;
  3432. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3433. BEGIN
  3434. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3435. SIZEOF( LONGINT ), EDivALALLoop );
  3436. RETURN RESULT
  3437. END "DIV";
  3438. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3439. (** SHORTINT *)
  3440. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3441. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3442. BEGIN
  3443. SYSTEM.GET( radr, rval );
  3444. WHILE (len > 0) DO
  3445. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3446. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3447. END;
  3448. END DivASSSLoop;
  3449. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3450. BEGIN
  3451. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3452. SIZEOF( SHORTINT ), DivASSSLoop );
  3453. RETURN RESULT
  3454. END "DIV";
  3455. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3456. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3457. BEGIN
  3458. SYSTEM.GET( radr, rval );
  3459. WHILE (len > 0) DO
  3460. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3461. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3462. END;
  3463. END DivSSASLoop;
  3464. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3465. BEGIN
  3466. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3467. SIZEOF( SHORTINT ), DivSSASLoop );
  3468. RETURN RESULT
  3469. END "DIV";
  3470. (** INTEGER *)
  3471. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3472. VAR lval, rval: INTEGER; dval: INTEGER;
  3473. BEGIN
  3474. SYSTEM.GET( radr, rval );
  3475. WHILE (len > 0) DO
  3476. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3477. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3478. END;
  3479. END DivAISILoop;
  3480. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3481. BEGIN
  3482. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3483. SIZEOF( INTEGER ), DivAISILoop );
  3484. RETURN RESULT
  3485. END "DIV";
  3486. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3487. VAR lval, rval: INTEGER; dval: INTEGER;
  3488. BEGIN
  3489. SYSTEM.GET( radr, rval );
  3490. WHILE (len > 0) DO
  3491. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3492. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3493. END;
  3494. END DivSIAILoop;
  3495. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3496. BEGIN
  3497. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3498. SIZEOF( INTEGER ), DivSIAILoop );
  3499. RETURN RESULT
  3500. END "DIV";
  3501. (** LONGINT *)
  3502. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3503. VAR lval, rval: LONGINT; dval: LONGINT;
  3504. BEGIN
  3505. SYSTEM.GET( radr, rval );
  3506. WHILE (len > 0) DO
  3507. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3508. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3509. END;
  3510. END DivALSLLoop;
  3511. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3512. BEGIN
  3513. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3514. SIZEOF( LONGINT ), DivALSLLoop );
  3515. RETURN RESULT
  3516. END "DIV";
  3517. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3518. VAR lval, rval: LONGINT; dval: LONGINT;
  3519. BEGIN
  3520. SYSTEM.GET( radr, rval );
  3521. WHILE (len > 0) DO
  3522. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3523. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3524. END;
  3525. END DivSLALLoop;
  3526. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3527. BEGIN
  3528. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3529. SIZEOF( LONGINT ), DivSLALLoop );
  3530. RETURN RESULT
  3531. END "DIV";
  3532. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3533. (** SHORTINT *)
  3534. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3535. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3536. BEGIN
  3537. WHILE (len > 0) DO
  3538. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3539. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3540. DEC( len );
  3541. END;
  3542. END EModASASLoop;
  3543. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3544. BEGIN
  3545. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3546. SIZEOF( SHORTINT ), EModASASLoop );
  3547. RETURN RESULT
  3548. END "MOD";
  3549. (** INTEGER *)
  3550. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3551. VAR lval, rval: INTEGER; dval: INTEGER;
  3552. BEGIN
  3553. WHILE (len > 0) DO
  3554. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3555. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3556. DEC( len );
  3557. END;
  3558. END EModAIAILoop;
  3559. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3560. BEGIN
  3561. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3562. SIZEOF( INTEGER ), EModAIAILoop );
  3563. RETURN RESULT
  3564. END "MOD";
  3565. (** LONGINT *)
  3566. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3567. VAR lval, rval: LONGINT; dval: LONGINT;
  3568. BEGIN
  3569. WHILE (len > 0) DO
  3570. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3571. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3572. DEC( len );
  3573. END;
  3574. END EModALALLoop;
  3575. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3576. BEGIN
  3577. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3578. SIZEOF( LONGINT ), EModALALLoop );
  3579. RETURN RESULT
  3580. END "MOD";
  3581. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3582. (** SHORTINT *)
  3583. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3584. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3585. BEGIN
  3586. SYSTEM.GET( radr, rval );
  3587. WHILE (len > 0) DO
  3588. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3589. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3590. END;
  3591. END ModASSSLoop;
  3592. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3593. BEGIN
  3594. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3595. SIZEOF( SHORTINT ), ModASSSLoop );
  3596. RETURN RESULT
  3597. END "MOD";
  3598. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3599. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3600. BEGIN
  3601. SYSTEM.GET( radr, rval );
  3602. WHILE (len > 0) DO
  3603. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3604. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3605. END;
  3606. END ModSSASLoop;
  3607. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3608. BEGIN
  3609. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3610. SIZEOF( SHORTINT ), ModSSASLoop );
  3611. RETURN RESULT
  3612. END "MOD";
  3613. (** INTEGER *)
  3614. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3615. VAR lval, rval: INTEGER; dval: INTEGER;
  3616. BEGIN
  3617. SYSTEM.GET( radr, rval );
  3618. WHILE (len > 0) DO
  3619. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3620. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3621. END;
  3622. END ModAISILoop;
  3623. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3624. BEGIN
  3625. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3626. SIZEOF( INTEGER ), ModAISILoop );
  3627. RETURN RESULT
  3628. END "MOD";
  3629. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3630. VAR lval, rval: INTEGER; dval: INTEGER;
  3631. BEGIN
  3632. SYSTEM.GET( radr, rval );
  3633. WHILE (len > 0) DO
  3634. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3635. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3636. END;
  3637. END ModSIAILoop;
  3638. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3639. BEGIN
  3640. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3641. SIZEOF( INTEGER ), ModSIAILoop );
  3642. RETURN RESULT
  3643. END "MOD";
  3644. (** LONGINT *)
  3645. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3646. VAR lval, rval: LONGINT; dval: LONGINT;
  3647. BEGIN
  3648. SYSTEM.GET( radr, rval );
  3649. WHILE (len > 0) DO
  3650. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3651. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3652. END;
  3653. END ModALSLLoop;
  3654. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3655. BEGIN
  3656. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3657. SIZEOF( LONGINT ), ModALSLLoop );
  3658. RETURN RESULT
  3659. END "MOD";
  3660. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3661. VAR lval, rval: LONGINT; dval: LONGINT;
  3662. BEGIN
  3663. SYSTEM.GET( radr, rval );
  3664. WHILE (len > 0) DO
  3665. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3666. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3667. END;
  3668. END ModSLALLoop;
  3669. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3670. BEGIN
  3671. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3672. SIZEOF( LONGINT ), ModSLALLoop );
  3673. RETURN RESULT
  3674. END "MOD";
  3675. (*** scalar product <array,array> -> scalar ********************************************************************)
  3676. (** SHORTINT *)
  3677. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3678. VAR lval, rval: SHORTINT; dval: LONGINT;
  3679. BEGIN
  3680. SYSTEM.GET( dadr, dval );
  3681. WHILE (len > 0) DO
  3682. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3683. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3684. END;
  3685. SYSTEM.PUT( dadr, dval );
  3686. END SPASASLoop;
  3687. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3688. VAR dest: LONGINT;
  3689. BEGIN
  3690. dest := 0;
  3691. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3692. RETURN dest;
  3693. END "+*";
  3694. (** INTEGER *)
  3695. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3696. VAR lval, rval: INTEGER; dval: LONGINT;
  3697. BEGIN
  3698. SYSTEM.GET( dadr, dval );
  3699. WHILE (len > 0) DO
  3700. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3701. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3702. END;
  3703. SYSTEM.PUT( dadr, dval );
  3704. END SPAIAILoop;
  3705. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3706. VAR dest: LONGINT;
  3707. BEGIN
  3708. dest := 0;
  3709. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3710. RETURN dest;
  3711. END "+*";
  3712. (** LONGINT *)
  3713. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3714. VAR lval, rval: LONGINT; dval: LONGINT;
  3715. BEGIN
  3716. SYSTEM.GET( dadr, dval );
  3717. WHILE (len > 0) DO
  3718. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3719. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3720. END;
  3721. SYSTEM.PUT( dadr, dval );
  3722. END SPALALLoop;
  3723. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3724. VAR dest: LONGINT;
  3725. BEGIN
  3726. dest := 0;
  3727. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3728. RETURN dest;
  3729. END "+*";
  3730. (** REAL *)
  3731. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3732. VAR lval, rval: REAL; dval: REAL;
  3733. BEGIN
  3734. SYSTEM.GET( dadr, dval );
  3735. WHILE (len > 0) DO
  3736. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3737. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3738. END;
  3739. SYSTEM.PUT( dadr, dval );
  3740. END SPARARLoop;
  3741. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3742. VAR dest: REAL;
  3743. BEGIN
  3744. dest := 0;
  3745. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3746. RETURN dest;
  3747. END "+*";
  3748. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3749. VAR lval, rval, dval: LONGREAL;
  3750. BEGIN
  3751. IF debug THEN
  3752. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3753. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3754. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3755. END;
  3756. SYSTEM.GET( dadr, dval );
  3757. WHILE (len > 0) DO
  3758. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3759. dval := dval + rval * lval; DEC( len );
  3760. END;
  3761. SYSTEM.PUT( dadr, dval );
  3762. END SPAXAXLoop;
  3763. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3764. VAR dest: LONGREAL;
  3765. BEGIN
  3766. dest := 0;
  3767. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3768. RETURN dest;
  3769. END "+*";
  3770. (** COMPLEX *)
  3771. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3772. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3773. BEGIN
  3774. SYSTEM.GET( dadr, dval );
  3775. WHILE (len > 0) DO
  3776. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3777. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3778. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3779. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3780. END;
  3781. SYSTEM.PUT( dadr, dval );
  3782. END SPAZAZLoop;
  3783. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3784. VAR dest: COMPLEX;
  3785. BEGIN
  3786. dest := 0;
  3787. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3788. RETURN dest;
  3789. END "+*";
  3790. (** COMPLEX *)
  3791. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3792. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3793. BEGIN
  3794. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3795. WHILE (len > 0) DO
  3796. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3797. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3798. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3799. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3800. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3801. END;
  3802. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3803. END SPALZALZLoop;
  3804. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3805. VAR dest: LONGCOMPLEX;
  3806. BEGIN
  3807. dest := 0;
  3808. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3809. RETURN dest;
  3810. END "+*";
  3811. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3812. (** BOOLEAN *)
  3813. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3814. VAR lval, rval: BOOLEAN;
  3815. BEGIN
  3816. WHILE (len > 0) DO
  3817. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3818. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3819. END;
  3820. END EEqlABABLoop;
  3821. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3822. BEGIN
  3823. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3824. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3825. RETURN RESULT
  3826. END ".=";
  3827. (** SHORTINT *)
  3828. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3829. VAR lval, rval: SHORTINT;
  3830. BEGIN
  3831. WHILE (len > 0) DO
  3832. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3833. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3834. END;
  3835. END EEqlASASLoop;
  3836. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3837. BEGIN
  3838. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3839. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3840. RETURN RESULT
  3841. END ".=";
  3842. (** INTEGER *)
  3843. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3844. VAR lval, rval: INTEGER;
  3845. BEGIN
  3846. WHILE (len > 0) DO
  3847. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3848. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3849. END;
  3850. END EEqlAIAILoop;
  3851. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3852. BEGIN
  3853. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3854. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3855. RETURN RESULT
  3856. END ".=";
  3857. (** LONGINT *)
  3858. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3859. VAR lval, rval: LONGINT;
  3860. BEGIN
  3861. WHILE (len > 0) DO
  3862. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3863. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3864. END;
  3865. END EEqlALALLoop;
  3866. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3867. BEGIN
  3868. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3869. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3870. RETURN RESULT
  3871. END ".=";
  3872. (** REAL *)
  3873. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3874. VAR lval, rval: REAL;
  3875. BEGIN
  3876. WHILE (len > 0) DO
  3877. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3878. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3879. END;
  3880. END EEqlARARLoop;
  3881. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3882. BEGIN
  3883. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3884. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3885. RETURN RESULT
  3886. END ".=";
  3887. (** LONGREAL *)
  3888. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3889. VAR lval, rval: LONGREAL;
  3890. BEGIN
  3891. WHILE (len > 0) DO
  3892. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3893. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3894. END;
  3895. END EEqlAXAXLoop;
  3896. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3897. BEGIN
  3898. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3899. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3900. RETURN RESULT
  3901. END ".=";
  3902. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3903. (** BOOLEAN *)
  3904. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3905. VAR lval, rval: BOOLEAN;
  3906. BEGIN
  3907. SYSTEM.GET( radr, rval );
  3908. WHILE (len > 0) DO
  3909. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3910. INC( dadr, dinc ); DEC( len );
  3911. END;
  3912. END EEqlABSBLoop;
  3913. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3914. BEGIN
  3915. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3916. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3917. RETURN RESULT
  3918. END ".=";
  3919. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3920. BEGIN
  3921. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3922. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3923. RETURN RESULT
  3924. END ".=";
  3925. (** SHORTINT *)
  3926. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3927. VAR lval, rval: SHORTINT;
  3928. BEGIN
  3929. SYSTEM.GET( radr, rval );
  3930. WHILE (len > 0) DO
  3931. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3932. INC( dadr, dinc ); DEC( len );
  3933. END;
  3934. END EEqlASSSLoop;
  3935. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3936. BEGIN
  3937. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3938. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3939. RETURN RESULT
  3940. END ".=";
  3941. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3942. BEGIN
  3943. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3944. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3945. RETURN RESULT
  3946. END ".=";
  3947. (** INTEGER *)
  3948. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3949. VAR lval, rval: INTEGER;
  3950. BEGIN
  3951. SYSTEM.GET( radr, rval );
  3952. WHILE (len > 0) DO
  3953. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3954. INC( dadr, dinc ); DEC( len );
  3955. END;
  3956. END EEqlAISILoop;
  3957. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3958. BEGIN
  3959. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3960. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3961. RETURN RESULT
  3962. END ".=";
  3963. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3964. BEGIN
  3965. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3966. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3967. RETURN RESULT
  3968. END ".=";
  3969. (** LONGINT *)
  3970. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3971. VAR lval, rval: LONGINT;
  3972. BEGIN
  3973. SYSTEM.GET( radr, rval );
  3974. WHILE (len > 0) DO
  3975. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3976. INC( dadr, dinc ); DEC( len );
  3977. END;
  3978. END EEqlALSLLoop;
  3979. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3980. BEGIN
  3981. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3982. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3983. RETURN RESULT
  3984. END ".=";
  3985. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  3986. BEGIN
  3987. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3988. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3989. RETURN RESULT
  3990. END ".=";
  3991. (** REAL *)
  3992. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3993. VAR lval, rval: REAL;
  3994. BEGIN
  3995. SYSTEM.GET( radr, rval );
  3996. WHILE (len > 0) DO
  3997. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3998. INC( dadr, dinc ); DEC( len );
  3999. END;
  4000. END EEqlARSRLoop;
  4001. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4002. BEGIN
  4003. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4004. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4005. RETURN RESULT
  4006. END ".=";
  4007. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4008. BEGIN
  4009. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4010. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4011. RETURN RESULT
  4012. END ".=";
  4013. (** LONGREAL *)
  4014. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4015. VAR lval, rval: LONGREAL;
  4016. BEGIN
  4017. SYSTEM.GET( radr, rval );
  4018. WHILE (len > 0) DO
  4019. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4020. INC( dadr, dinc ); DEC( len );
  4021. END;
  4022. END EEqlAXSXLoop;
  4023. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4024. BEGIN
  4025. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4026. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4027. RETURN RESULT
  4028. END ".=";
  4029. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4030. BEGIN
  4031. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4032. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4033. RETURN RESULT
  4034. END ".=";
  4035. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4036. (** BOOLEAN *)
  4037. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4038. VAR lval, rval: BOOLEAN;
  4039. BEGIN
  4040. WHILE (len > 0) DO
  4041. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4042. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4043. END;
  4044. END ENeqABABLoop;
  4045. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4046. BEGIN
  4047. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4048. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4049. RETURN RESULT
  4050. END ".#";
  4051. (** SHORTINT *)
  4052. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4053. VAR lval, rval: SHORTINT;
  4054. BEGIN
  4055. WHILE (len > 0) DO
  4056. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4057. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4058. END;
  4059. END ENeqASASLoop;
  4060. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4061. BEGIN
  4062. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4063. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4064. RETURN RESULT
  4065. END ".#";
  4066. (** INTEGER*)
  4067. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4068. VAR lval, rval: INTEGER;
  4069. BEGIN
  4070. WHILE (len > 0) DO
  4071. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4072. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4073. END;
  4074. END ENeqAIAILoop;
  4075. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4076. BEGIN
  4077. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4078. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4079. RETURN RESULT
  4080. END ".#";
  4081. (** LONGINT*)
  4082. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4083. VAR lval, rval: LONGINT;
  4084. BEGIN
  4085. WHILE (len > 0) DO
  4086. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4087. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4088. END;
  4089. END ENeqALALLoop;
  4090. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4091. BEGIN
  4092. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4093. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4094. RETURN RESULT
  4095. END ".#";
  4096. (** REAL *)
  4097. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4098. VAR lval, rval: REAL;
  4099. BEGIN
  4100. WHILE (len > 0) DO
  4101. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4102. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4103. END;
  4104. END ENeqARARLoop;
  4105. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4106. BEGIN
  4107. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4108. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4109. RETURN RESULT
  4110. END ".#";
  4111. (** LONGREAL *)
  4112. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4113. VAR lval, rval: LONGREAL;
  4114. BEGIN
  4115. WHILE (len > 0) DO
  4116. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4117. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4118. END;
  4119. END ENeqAXAXLoop;
  4120. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4121. BEGIN
  4122. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4123. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4124. RETURN RESULT
  4125. END ".#";
  4126. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4127. (** BOOLEAN *)
  4128. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4129. VAR lval, rval: BOOLEAN;
  4130. BEGIN
  4131. SYSTEM.GET( radr, rval );
  4132. WHILE (len > 0) DO
  4133. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4134. INC( dadr, dinc ); DEC( len );
  4135. END;
  4136. END ENeqABSBLoop;
  4137. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4138. BEGIN
  4139. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4140. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4141. RETURN RESULT
  4142. END ".#";
  4143. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4144. BEGIN
  4145. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4146. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4147. RETURN RESULT
  4148. END ".#";
  4149. (** SHORTINT *)
  4150. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4151. VAR lval, rval: SHORTINT;
  4152. BEGIN
  4153. SYSTEM.GET( radr, rval );
  4154. WHILE (len > 0) DO
  4155. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4156. INC( dadr, dinc ); DEC( len );
  4157. END;
  4158. END ENeqASSSLoop;
  4159. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4160. BEGIN
  4161. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4162. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4163. RETURN RESULT
  4164. END ".#";
  4165. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4166. BEGIN
  4167. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4168. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4169. RETURN RESULT
  4170. END ".#";
  4171. (** INTEGER *)
  4172. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4173. VAR lval, rval: INTEGER;
  4174. BEGIN
  4175. SYSTEM.GET( radr, rval );
  4176. WHILE (len > 0) DO
  4177. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4178. INC( dadr, dinc ); DEC( len );
  4179. END;
  4180. END ENeqAISILoop;
  4181. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4182. BEGIN
  4183. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4184. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4185. RETURN RESULT
  4186. END ".#";
  4187. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4188. BEGIN
  4189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4190. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4191. RETURN RESULT
  4192. END ".#";
  4193. (** LONGINT *)
  4194. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4195. VAR lval, rval: LONGINT;
  4196. BEGIN
  4197. SYSTEM.GET( radr, rval );
  4198. WHILE (len > 0) DO
  4199. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4200. INC( dadr, dinc ); DEC( len );
  4201. END;
  4202. END ENeqALSLLoop;
  4203. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4204. BEGIN
  4205. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4206. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4207. RETURN RESULT
  4208. END ".#";
  4209. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4210. BEGIN
  4211. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4212. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4213. RETURN RESULT
  4214. END ".#";
  4215. (** REAL *)
  4216. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4217. VAR lval, rval: REAL;
  4218. BEGIN
  4219. SYSTEM.GET( radr, rval );
  4220. WHILE (len > 0) DO
  4221. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4222. INC( dadr, dinc ); DEC( len );
  4223. END;
  4224. END ENeqARSRLoop;
  4225. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4226. BEGIN
  4227. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4228. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4229. RETURN RESULT
  4230. END ".#";
  4231. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4232. BEGIN
  4233. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4234. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4235. RETURN RESULT
  4236. END ".#";
  4237. (** LONGREAL *)
  4238. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4239. VAR lval, rval: LONGREAL;
  4240. BEGIN
  4241. SYSTEM.GET( radr, rval );
  4242. WHILE (len > 0) DO
  4243. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4244. INC( dadr, dinc ); DEC( len );
  4245. END;
  4246. END ENeqAXSXLoop;
  4247. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4248. BEGIN
  4249. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4250. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4251. RETURN RESULT
  4252. END ".#";
  4253. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4254. BEGIN
  4255. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4256. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4257. RETURN RESULT
  4258. END ".#";
  4259. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4260. (** SHORTINT *)
  4261. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4262. VAR lval, rval: SHORTINT;
  4263. BEGIN
  4264. WHILE (len > 0) DO
  4265. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4266. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4267. END;
  4268. END EGtrASASLoop;
  4269. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4270. BEGIN
  4271. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4272. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4273. RETURN RESULT
  4274. END ".>";
  4275. (** INTEGER *)
  4276. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4277. VAR lval, rval: INTEGER;
  4278. BEGIN
  4279. WHILE (len > 0) DO
  4280. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4281. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4282. END;
  4283. END EGtrAIAILoop;
  4284. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4285. BEGIN
  4286. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4287. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4288. RETURN RESULT
  4289. END ".>";
  4290. (** LONGINT *)
  4291. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4292. VAR lval, rval: LONGINT;
  4293. BEGIN
  4294. WHILE (len > 0) DO
  4295. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4296. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4297. END;
  4298. END EGtrALALLoop;
  4299. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4300. BEGIN
  4301. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4302. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4303. RETURN RESULT
  4304. END ".>";
  4305. (** REAL *)
  4306. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4307. VAR lval, rval: REAL;
  4308. BEGIN
  4309. WHILE (len > 0) DO
  4310. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4311. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4312. END;
  4313. END EGtrARARLoop;
  4314. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4315. BEGIN
  4316. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4317. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4318. RETURN RESULT
  4319. END ".>";
  4320. (** LONGREAL *)
  4321. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4322. VAR lval, rval: LONGREAL;
  4323. BEGIN
  4324. WHILE (len > 0) DO
  4325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4326. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4327. END;
  4328. END EGtrAXAXLoop;
  4329. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4330. BEGIN
  4331. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4332. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4333. RETURN RESULT
  4334. END ".>";
  4335. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4336. (** SHORTINT *)
  4337. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4338. VAR lval, rval: SHORTINT;
  4339. BEGIN
  4340. SYSTEM.GET( radr, rval );
  4341. WHILE (len > 0) DO
  4342. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4343. INC( dadr, dinc ); DEC( len );
  4344. END;
  4345. END EGtrASSSLoop;
  4346. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4347. BEGIN
  4348. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4349. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4350. RETURN RESULT
  4351. END ".>";
  4352. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4353. BEGIN
  4354. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4355. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4356. RETURN RESULT
  4357. END ".<";
  4358. (** INTEGER *)
  4359. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4360. VAR lval, rval: INTEGER;
  4361. BEGIN
  4362. SYSTEM.GET( radr, rval );
  4363. WHILE (len > 0) DO
  4364. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4365. INC( dadr, dinc ); DEC( len );
  4366. END;
  4367. END EGtrAISILoop;
  4368. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4369. BEGIN
  4370. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4371. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4372. RETURN RESULT
  4373. END ".>";
  4374. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4375. BEGIN
  4376. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4377. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4378. RETURN RESULT
  4379. END ".<";
  4380. (** LONGINT *)
  4381. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4382. VAR lval, rval: LONGINT;
  4383. BEGIN
  4384. SYSTEM.GET( radr, rval );
  4385. WHILE (len > 0) DO
  4386. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4387. INC( dadr, dinc ); DEC( len );
  4388. END;
  4389. END EGtrALSLLoop;
  4390. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4391. BEGIN
  4392. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4393. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4394. RETURN RESULT
  4395. END ".>";
  4396. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4397. BEGIN
  4398. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4399. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4400. RETURN RESULT
  4401. END ".<";
  4402. (** REAL *)
  4403. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4404. VAR lval, rval: REAL;
  4405. BEGIN
  4406. SYSTEM.GET( radr, rval );
  4407. WHILE (len > 0) DO
  4408. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4409. INC( dadr, dinc ); DEC( len );
  4410. END;
  4411. END EGtrARSRLoop;
  4412. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4413. BEGIN
  4414. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4415. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4416. RETURN RESULT
  4417. END ".>";
  4418. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4419. BEGIN
  4420. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4421. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4422. RETURN RESULT
  4423. END ".<";
  4424. (** LONGREAL *)
  4425. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4426. VAR lval, rval: LONGREAL;
  4427. BEGIN
  4428. SYSTEM.GET( radr, rval );
  4429. WHILE (len > 0) DO
  4430. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4431. INC( dadr, dinc ); DEC( len );
  4432. END;
  4433. END EGtrAXSXLoop;
  4434. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4435. BEGIN
  4436. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4437. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4438. RETURN RESULT
  4439. END ".>";
  4440. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4441. BEGIN
  4442. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4443. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4444. RETURN RESULT
  4445. END ".<";
  4446. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4447. (** SHORTINT *)
  4448. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4449. VAR lval, rval: SHORTINT;
  4450. BEGIN
  4451. WHILE (len > 0) DO
  4452. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4453. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4454. END;
  4455. END EGeqASASLoop;
  4456. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4457. BEGIN
  4458. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4459. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4460. RETURN RESULT
  4461. END ".>=";
  4462. (** INTEGER *)
  4463. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4464. VAR lval, rval: INTEGER;
  4465. BEGIN
  4466. WHILE (len > 0) DO
  4467. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4468. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4469. END;
  4470. END EGeqAIAILoop;
  4471. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4472. BEGIN
  4473. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4474. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4475. RETURN RESULT
  4476. END ".>=";
  4477. (** LONGINT *)
  4478. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4479. VAR lval, rval: LONGINT;
  4480. BEGIN
  4481. WHILE (len > 0) DO
  4482. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4483. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4484. END;
  4485. END EGeqALALLoop;
  4486. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4487. BEGIN
  4488. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4489. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4490. RETURN RESULT
  4491. END ".>=";
  4492. (** REAL *)
  4493. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4494. VAR lval, rval: REAL;
  4495. BEGIN
  4496. WHILE (len > 0) DO
  4497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4498. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4499. END;
  4500. END EGeqARARLoop;
  4501. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4502. BEGIN
  4503. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4504. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4505. RETURN RESULT
  4506. END ".>=";
  4507. (** LONGREAL *)
  4508. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4509. VAR lval, rval: LONGREAL;
  4510. BEGIN
  4511. WHILE (len > 0) DO
  4512. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4513. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4514. END;
  4515. END EGeqAXAXLoop;
  4516. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4517. BEGIN
  4518. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4519. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4520. RETURN RESULT
  4521. END ".>=";
  4522. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4523. (** SHORTINT *)
  4524. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4525. VAR lval, rval: SHORTINT;
  4526. BEGIN
  4527. SYSTEM.GET( radr, rval );
  4528. WHILE (len > 0) DO
  4529. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4530. INC( dadr, dinc ); DEC( len );
  4531. END;
  4532. END EGeqASSSLoop;
  4533. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4534. BEGIN
  4535. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4536. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4537. RETURN RESULT
  4538. END ".>=";
  4539. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4540. BEGIN
  4541. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4542. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4543. RETURN RESULT
  4544. END ".<=";
  4545. (** INTEGER *)
  4546. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4547. VAR lval, rval: INTEGER;
  4548. BEGIN
  4549. SYSTEM.GET( radr, rval );
  4550. WHILE (len > 0) DO
  4551. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4552. INC( dadr, dinc ); DEC( len );
  4553. END;
  4554. END EGeqAISILoop;
  4555. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4556. BEGIN
  4557. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4558. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4559. RETURN RESULT
  4560. END ".>=";
  4561. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4562. BEGIN
  4563. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4564. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4565. RETURN RESULT
  4566. END ".<=";
  4567. (** LONGINT *)
  4568. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4569. VAR lval, rval: LONGINT;
  4570. BEGIN
  4571. SYSTEM.GET( radr, rval );
  4572. WHILE (len > 0) DO
  4573. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4574. INC( dadr, dinc ); DEC( len );
  4575. END;
  4576. END EGeqALSLLoop;
  4577. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4578. BEGIN
  4579. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4580. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4581. RETURN RESULT
  4582. END ".>=";
  4583. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4584. BEGIN
  4585. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4586. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4587. RETURN RESULT
  4588. END ".<=";
  4589. (** REAL *)
  4590. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4591. VAR lval, rval: REAL;
  4592. BEGIN
  4593. SYSTEM.GET( radr, rval );
  4594. WHILE (len > 0) DO
  4595. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4596. INC( dadr, dinc ); DEC( len );
  4597. END;
  4598. END EGeqARSRLoop;
  4599. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4600. BEGIN
  4601. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4602. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4603. RETURN RESULT
  4604. END ".>=";
  4605. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4606. BEGIN
  4607. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4608. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4609. RETURN RESULT
  4610. END ".<=";
  4611. (** LONGREAL *)
  4612. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4613. VAR lval, rval: LONGREAL;
  4614. BEGIN
  4615. SYSTEM.GET( radr, rval );
  4616. WHILE (len > 0) DO
  4617. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4618. INC( dadr, dinc ); DEC( len );
  4619. END;
  4620. END EGeqAXSXLoop;
  4621. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4622. BEGIN
  4623. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4624. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4625. RETURN RESULT
  4626. END ".>=";
  4627. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4628. BEGIN
  4629. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4630. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4631. RETURN RESULT
  4632. END ".<=";
  4633. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4634. (** SHORTINT *)
  4635. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4636. VAR lval, rval: SHORTINT;
  4637. BEGIN
  4638. WHILE (len > 0) DO
  4639. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4640. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4641. END;
  4642. END ELssASASLoop;
  4643. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4644. BEGIN
  4645. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4646. SIZEOF( BOOLEAN ), ELssASASLoop );
  4647. RETURN RESULT
  4648. END ".<";
  4649. (** INTEGER *)
  4650. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4651. VAR lval, rval: INTEGER;
  4652. BEGIN
  4653. WHILE (len > 0) DO
  4654. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4655. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4656. END;
  4657. END ELssAIAILoop;
  4658. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4659. BEGIN
  4660. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4661. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4662. RETURN RESULT
  4663. END ".<";
  4664. (** LONGINT*)
  4665. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4666. VAR lval, rval: LONGINT;
  4667. BEGIN
  4668. WHILE (len > 0) DO
  4669. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4670. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4671. END;
  4672. END ELssALALLoop;
  4673. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4674. BEGIN
  4675. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4676. SIZEOF( BOOLEAN ), ELssALALLoop );
  4677. RETURN RESULT
  4678. END ".<";
  4679. (** REAL *)
  4680. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4681. VAR lval, rval: REAL;
  4682. BEGIN
  4683. WHILE (len > 0) DO
  4684. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4685. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4686. END;
  4687. END ELssARARLoop;
  4688. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4689. BEGIN
  4690. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4691. SIZEOF( BOOLEAN ), ELssARARLoop );
  4692. RETURN RESULT
  4693. END ".<";
  4694. (** LONGREAL *)
  4695. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4696. VAR lval, rval: LONGREAL;
  4697. BEGIN
  4698. WHILE (len > 0) DO
  4699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4700. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4701. END;
  4702. END ELssAXAXLoop;
  4703. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4704. BEGIN
  4705. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4706. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4707. RETURN RESULT
  4708. END ".<";
  4709. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4710. (** SHORTINT *)
  4711. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4712. VAR lval, rval: SHORTINT;
  4713. BEGIN
  4714. SYSTEM.GET( radr, rval );
  4715. WHILE (len > 0) DO
  4716. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4717. INC( dadr, dinc ); DEC( len );
  4718. END;
  4719. END ELssASSSLoop;
  4720. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4721. BEGIN
  4722. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4723. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4724. RETURN RESULT
  4725. END ".<";
  4726. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4727. BEGIN
  4728. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4729. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4730. RETURN RESULT
  4731. END ".>";
  4732. (** INTEGER *)
  4733. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4734. VAR lval, rval: INTEGER;
  4735. BEGIN
  4736. SYSTEM.GET( radr, rval );
  4737. WHILE (len > 0) DO
  4738. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4739. INC( dadr, dinc ); DEC( len );
  4740. END;
  4741. END ELssAISILoop;
  4742. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4743. BEGIN
  4744. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4745. SIZEOF( BOOLEAN ), ELssAISILoop );
  4746. RETURN RESULT
  4747. END ".<";
  4748. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4749. BEGIN
  4750. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4751. SIZEOF( BOOLEAN ), ELssAISILoop );
  4752. RETURN RESULT
  4753. END ".>";
  4754. (** LONGINT *)
  4755. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4756. VAR lval, rval: LONGINT;
  4757. BEGIN
  4758. SYSTEM.GET( radr, rval );
  4759. WHILE (len > 0) DO
  4760. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4761. INC( dadr, dinc ); DEC( len );
  4762. END;
  4763. END ELssALSLLoop;
  4764. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4765. BEGIN
  4766. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4767. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4768. RETURN RESULT
  4769. END ".<";
  4770. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4771. BEGIN
  4772. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4773. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4774. RETURN RESULT
  4775. END ".>";
  4776. (** REAL *)
  4777. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4778. VAR lval, rval: REAL;
  4779. BEGIN
  4780. SYSTEM.GET( radr, rval );
  4781. WHILE (len > 0) DO
  4782. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4783. INC( dadr, dinc ); DEC( len );
  4784. END;
  4785. END ELssARSRLoop;
  4786. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4787. BEGIN
  4788. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4789. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4790. RETURN RESULT
  4791. END ".<";
  4792. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4793. BEGIN
  4794. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4795. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4796. RETURN RESULT
  4797. END ".>";
  4798. (** LONGREAL *)
  4799. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4800. VAR lval, rval: LONGREAL;
  4801. BEGIN
  4802. SYSTEM.GET( radr, rval );
  4803. WHILE (len > 0) DO
  4804. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4805. INC( dadr, dinc ); DEC( len );
  4806. END;
  4807. END ELssAXSXLoop;
  4808. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4809. BEGIN
  4810. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4811. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4812. RETURN RESULT
  4813. END ".<";
  4814. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4815. BEGIN
  4816. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4817. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4818. RETURN RESULT
  4819. END ".>";
  4820. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4821. (** SHORTINT *)
  4822. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4823. VAR lval, rval: SHORTINT;
  4824. BEGIN
  4825. WHILE (len > 0) DO
  4826. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4827. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4828. END;
  4829. END ELeqASASLoop;
  4830. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4831. BEGIN
  4832. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4833. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4834. RETURN RESULT
  4835. END ".<=";
  4836. (** INTEGER *)
  4837. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4838. VAR lval, rval: INTEGER;
  4839. BEGIN
  4840. WHILE (len > 0) DO
  4841. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4842. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4843. END;
  4844. END ELeqAIAILoop;
  4845. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4846. BEGIN
  4847. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4848. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4849. RETURN RESULT
  4850. END ".<=";
  4851. (** LONGINT *)
  4852. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4853. VAR lval, rval: LONGINT;
  4854. BEGIN
  4855. WHILE (len > 0) DO
  4856. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4857. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4858. END;
  4859. END ELeqALALLoop;
  4860. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4861. BEGIN
  4862. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4863. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4864. RETURN RESULT
  4865. END ".<=";
  4866. (** REAL *)
  4867. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4868. VAR lval, rval: REAL;
  4869. BEGIN
  4870. WHILE (len > 0) DO
  4871. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4872. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4873. END;
  4874. END ELeqARARLoop;
  4875. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4876. BEGIN
  4877. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4878. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4879. RETURN RESULT
  4880. END ".<=";
  4881. (** LONGREAL*)
  4882. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4883. VAR lval, rval: LONGREAL;
  4884. BEGIN
  4885. WHILE (len > 0) DO
  4886. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4887. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4888. END;
  4889. END ELeqAXAXLoop;
  4890. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4891. BEGIN
  4892. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4893. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4894. RETURN RESULT
  4895. END ".<=";
  4896. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4897. (** SHORTINT *)
  4898. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4899. VAR lval, rval: SHORTINT;
  4900. BEGIN
  4901. SYSTEM.GET( radr, rval );
  4902. WHILE (len > 0) DO
  4903. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4904. INC( dadr, dinc ); DEC( len );
  4905. END;
  4906. END ELeqASSSLoop;
  4907. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4908. BEGIN
  4909. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4910. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4911. RETURN RESULT
  4912. END ".<=";
  4913. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4914. BEGIN
  4915. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4916. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4917. RETURN RESULT
  4918. END ".>=";
  4919. (** INTEGER *)
  4920. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4921. VAR lval, rval: INTEGER;
  4922. BEGIN
  4923. SYSTEM.GET( radr, rval );
  4924. WHILE (len > 0) DO
  4925. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4926. INC( dadr, dinc ); DEC( len );
  4927. END;
  4928. END ELeqAISILoop;
  4929. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4930. BEGIN
  4931. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4932. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4933. RETURN RESULT
  4934. END ".<=";
  4935. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4936. BEGIN
  4937. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4938. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4939. RETURN RESULT
  4940. END ".>=";
  4941. (** LONGINT *)
  4942. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4943. VAR lval, rval: LONGINT;
  4944. BEGIN
  4945. SYSTEM.GET( radr, rval );
  4946. WHILE (len > 0) DO
  4947. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4948. INC( dadr, dinc ); DEC( len );
  4949. END;
  4950. END ELeqALSLLoop;
  4951. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4952. BEGIN
  4953. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4954. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4955. RETURN RESULT
  4956. END ".<=";
  4957. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4958. BEGIN
  4959. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4960. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4961. RETURN RESULT
  4962. END ".>=";
  4963. (** REAL *)
  4964. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4965. VAR lval, rval: REAL;
  4966. BEGIN
  4967. SYSTEM.GET( radr, rval );
  4968. WHILE (len > 0) DO
  4969. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4970. INC( dadr, dinc ); DEC( len );
  4971. END;
  4972. END ELeqARSRLoop;
  4973. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4974. BEGIN
  4975. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4976. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4977. RETURN RESULT
  4978. END ".<=";
  4979. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4980. BEGIN
  4981. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4982. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4983. RETURN RESULT
  4984. END ".>=";
  4985. (** LONGREAL *)
  4986. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4987. VAR lval, rval: LONGREAL;
  4988. BEGIN
  4989. SYSTEM.GET( radr, rval );
  4990. WHILE (len > 0) DO
  4991. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4992. INC( dadr, dinc ); DEC( len );
  4993. END;
  4994. END ELeqAXSXLoop;
  4995. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4996. BEGIN
  4997. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4998. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  4999. RETURN RESULT
  5000. END ".<=";
  5001. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5002. BEGIN
  5003. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5004. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5005. RETURN RESULT
  5006. END ".>=";
  5007. (*** elementwise or, elementwise and ********************************************************************)
  5008. (** array x array *)
  5009. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5010. VAR lval, rval: BOOLEAN;
  5011. BEGIN
  5012. WHILE (len > 0) DO
  5013. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5014. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5015. END;
  5016. END ElOrABABLoop;
  5017. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5018. BEGIN
  5019. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5020. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5021. RETURN RESULT
  5022. END "OR";
  5023. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5024. VAR lval, rval: BOOLEAN;
  5025. BEGIN
  5026. WHILE (len > 0) DO
  5027. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5028. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5029. END;
  5030. END ElAndABABLoop;
  5031. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5032. BEGIN
  5033. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5034. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5035. RETURN RESULT
  5036. END "&";
  5037. (** array x boolean *)
  5038. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5039. VAR lval, rval: BOOLEAN;
  5040. BEGIN
  5041. SYSTEM.GET( radr, rval );
  5042. WHILE (len > 0) DO
  5043. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5044. INC( dadr, dinc ); DEC( len );
  5045. END;
  5046. END ElOrABSBLoop;
  5047. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5048. BEGIN
  5049. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5050. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5051. RETURN RESULT
  5052. END "OR";
  5053. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5054. BEGIN
  5055. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5056. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5057. RETURN RESULT
  5058. END "OR";
  5059. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5060. VAR lval, rval: BOOLEAN;
  5061. BEGIN
  5062. SYSTEM.GET( radr, rval );
  5063. WHILE (len > 0) DO
  5064. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5065. INC( dadr, dinc ); DEC( len );
  5066. END;
  5067. END ElAndABSBLoop;
  5068. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5069. BEGIN
  5070. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5071. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5072. RETURN RESULT
  5073. END "&";
  5074. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5075. BEGIN
  5076. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5077. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5078. RETURN RESULT
  5079. END "&";
  5080. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5081. (** SHORTINT *)
  5082. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5083. VAR lval, rval: SHORTINT;
  5084. BEGIN
  5085. WHILE (len > 0) DO
  5086. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5087. IF rval <= lval THEN RETURN FALSE END;
  5088. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5089. END;
  5090. RETURN TRUE;
  5091. END LssASASLoop;
  5092. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5093. BEGIN
  5094. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5095. END "<";
  5096. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5097. VAR lval, rval: SHORTINT;
  5098. BEGIN
  5099. WHILE (len > 0) DO
  5100. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5101. IF rval > lval THEN RETURN FALSE END;
  5102. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5103. END;
  5104. RETURN TRUE;
  5105. END GeqASASLoop;
  5106. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5107. BEGIN
  5108. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5109. END ">=";
  5110. (** INTEGER *)
  5111. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5112. VAR lval, rval: INTEGER;
  5113. BEGIN
  5114. WHILE (len > 0) DO
  5115. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5116. IF rval <= lval THEN RETURN FALSE END;
  5117. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5118. END;
  5119. RETURN TRUE;
  5120. END LssAIAILoop;
  5121. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5122. BEGIN
  5123. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5124. END "<";
  5125. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5126. VAR lval, rval: INTEGER;
  5127. BEGIN
  5128. WHILE (len > 0) DO
  5129. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5130. IF rval > lval THEN RETURN FALSE END;
  5131. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5132. END;
  5133. RETURN TRUE;
  5134. END GeqAIAILoop;
  5135. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5136. BEGIN
  5137. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5138. END ">=";
  5139. (** LONGINT *)
  5140. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5141. VAR lval, rval: LONGINT;
  5142. BEGIN
  5143. WHILE (len > 0) DO
  5144. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5145. IF rval <= lval THEN RETURN FALSE END;
  5146. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5147. END;
  5148. RETURN TRUE;
  5149. END LssALALLoop;
  5150. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5151. BEGIN
  5152. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5153. END "<";
  5154. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5155. VAR lval, rval: LONGINT;
  5156. BEGIN
  5157. WHILE (len > 0) DO
  5158. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5159. IF rval > lval THEN RETURN FALSE END;
  5160. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5161. END;
  5162. RETURN TRUE;
  5163. END GeqALALLoop;
  5164. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5165. BEGIN
  5166. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5167. END ">=";
  5168. (** REAL *)
  5169. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5170. VAR lval, rval: REAL;
  5171. BEGIN
  5172. WHILE (len > 0) DO
  5173. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5174. IF rval <= lval THEN RETURN FALSE END;
  5175. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5176. END;
  5177. RETURN TRUE;
  5178. END LssARARLoop;
  5179. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5180. BEGIN
  5181. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5182. END "<";
  5183. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5184. VAR lval, rval: REAL;
  5185. BEGIN
  5186. WHILE (len > 0) DO
  5187. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5188. IF rval > lval THEN RETURN FALSE END;
  5189. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5190. END;
  5191. RETURN TRUE;
  5192. END GeqARARLoop;
  5193. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5194. BEGIN
  5195. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5196. END ">=";
  5197. (** LONGREAL *)
  5198. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5199. VAR lval, rval: LONGREAL;
  5200. BEGIN
  5201. WHILE (len > 0) DO
  5202. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5203. IF rval <= lval THEN RETURN FALSE END;
  5204. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5205. END;
  5206. RETURN TRUE;
  5207. END LssAXAXLoop;
  5208. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5209. BEGIN
  5210. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5211. END "<";
  5212. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5213. VAR lval, rval: LONGREAL;
  5214. BEGIN
  5215. WHILE (len > 0) DO
  5216. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5217. IF rval > lval THEN RETURN FALSE END;
  5218. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5219. END;
  5220. RETURN TRUE;
  5221. END GeqAXAXLoop;
  5222. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5223. BEGIN
  5224. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5225. END ">=";
  5226. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5227. (** SHORTINT *)
  5228. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5229. VAR lval, rval: SHORTINT;
  5230. BEGIN
  5231. WHILE (len > 0) DO
  5232. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5233. IF rval >= lval THEN RETURN FALSE END;
  5234. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5235. END;
  5236. RETURN TRUE;
  5237. END GtrASASLoop;
  5238. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5239. BEGIN
  5240. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5241. END ">";
  5242. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5243. VAR lval, rval: SHORTINT;
  5244. BEGIN
  5245. WHILE (len > 0) DO
  5246. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5247. IF rval < lval THEN RETURN FALSE END;
  5248. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5249. END;
  5250. RETURN TRUE;
  5251. END LeqASASLoop;
  5252. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5253. BEGIN
  5254. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5255. END "<=";
  5256. (** INTEGER *)
  5257. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5258. VAR lval, rval: INTEGER;
  5259. BEGIN
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5262. IF rval >= lval THEN RETURN FALSE END;
  5263. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5264. END;
  5265. RETURN TRUE;
  5266. END GtrAIAILoop;
  5267. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5268. BEGIN
  5269. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5270. END ">";
  5271. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5272. VAR lval, rval: INTEGER;
  5273. BEGIN
  5274. WHILE (len > 0) DO
  5275. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5276. IF rval < lval THEN RETURN FALSE END;
  5277. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5278. END;
  5279. RETURN TRUE;
  5280. END LeqAIAILoop;
  5281. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5282. BEGIN
  5283. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5284. END "<=";
  5285. (** LONGINT *)
  5286. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5287. VAR lval, rval: LONGINT;
  5288. BEGIN
  5289. WHILE (len > 0) DO
  5290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5291. IF rval >= lval THEN RETURN FALSE END;
  5292. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5293. END;
  5294. RETURN TRUE;
  5295. END GtrALALLoop;
  5296. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5297. BEGIN
  5298. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5299. END ">";
  5300. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5301. VAR lval, rval: LONGINT;
  5302. BEGIN
  5303. WHILE (len > 0) DO
  5304. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5305. IF rval < lval THEN RETURN FALSE END;
  5306. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5307. END;
  5308. RETURN TRUE;
  5309. END LeqALALLoop;
  5310. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5311. BEGIN
  5312. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5313. END "<=";
  5314. (** REAL *)
  5315. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5316. VAR lval, rval: REAL;
  5317. BEGIN
  5318. WHILE (len > 0) DO
  5319. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5320. IF rval >= lval THEN RETURN FALSE END;
  5321. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5322. END;
  5323. RETURN TRUE;
  5324. END GtrARARLoop;
  5325. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5326. BEGIN
  5327. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5328. END ">";
  5329. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5330. VAR lval, rval: REAL;
  5331. BEGIN
  5332. WHILE (len > 0) DO
  5333. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5334. IF rval < lval THEN RETURN FALSE END;
  5335. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5336. END;
  5337. RETURN TRUE;
  5338. END LeqARARLoop;
  5339. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5340. BEGIN
  5341. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5342. END "<=";
  5343. (** LONGREAL *)
  5344. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5345. VAR lval, rval: LONGREAL;
  5346. BEGIN
  5347. WHILE (len > 0) DO
  5348. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5349. IF rval >= lval THEN RETURN FALSE END;
  5350. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5351. END;
  5352. RETURN TRUE;
  5353. END GtrAXAXLoop;
  5354. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5355. BEGIN
  5356. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5357. END ">";
  5358. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5359. VAR lval, rval: LONGREAL;
  5360. BEGIN
  5361. WHILE (len > 0) DO
  5362. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5363. IF rval < lval THEN RETURN FALSE END;
  5364. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5365. END;
  5366. RETURN TRUE;
  5367. END LeqAXAXLoop;
  5368. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5369. BEGIN
  5370. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5371. END "<=";
  5372. (*** equals: array x array -> boolean ********************************************************************)
  5373. (** BOOLEAN *)
  5374. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5375. VAR lval, rval: BOOLEAN;
  5376. BEGIN
  5377. WHILE (len > 0) DO
  5378. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5379. IF rval # lval THEN RETURN FALSE END;
  5380. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5381. END;
  5382. RETURN TRUE;
  5383. END EqlABABLoop;
  5384. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5385. BEGIN
  5386. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5387. END "=";
  5388. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5389. BEGIN
  5390. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5391. END "#";
  5392. (** SHORTINT *)
  5393. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5394. VAR lval, rval: SHORTINT;
  5395. BEGIN
  5396. WHILE (len > 0) DO
  5397. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5398. IF rval # lval THEN RETURN FALSE END;
  5399. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5400. END;
  5401. RETURN TRUE;
  5402. END EqlASASLoop;
  5403. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5404. BEGIN
  5405. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5406. END "=";
  5407. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5408. BEGIN
  5409. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5410. END "#";
  5411. (** INTEGER *)
  5412. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5413. VAR lval, rval: INTEGER;
  5414. BEGIN
  5415. WHILE (len > 0) DO
  5416. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5417. IF rval # lval THEN RETURN FALSE END;
  5418. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5419. END;
  5420. RETURN TRUE;
  5421. END EqlAIAILoop;
  5422. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5423. BEGIN
  5424. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5425. END "=";
  5426. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5427. BEGIN
  5428. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5429. END "#";
  5430. (** LONGINT *)
  5431. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5432. VAR lval, rval: LONGINT;
  5433. BEGIN
  5434. WHILE (len > 0) DO
  5435. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5436. IF rval # lval THEN RETURN FALSE END;
  5437. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5438. END;
  5439. RETURN TRUE;
  5440. END EqlALALLoop;
  5441. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5442. BEGIN
  5443. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5444. END "=";
  5445. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5446. BEGIN
  5447. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5448. END "#";
  5449. (** REAL *)
  5450. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5451. VAR lval, rval: REAL;
  5452. BEGIN
  5453. WHILE (len > 0) DO
  5454. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5455. IF rval # lval THEN RETURN FALSE END;
  5456. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5457. END;
  5458. RETURN TRUE;
  5459. END EqlARARLoop;
  5460. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5461. BEGIN
  5462. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5463. END "=";
  5464. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5465. BEGIN
  5466. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5467. END "#";
  5468. (** LONGREAL *)
  5469. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5470. VAR lval, rval: LONGREAL;
  5471. BEGIN
  5472. WHILE (len > 0) DO
  5473. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5474. IF rval # lval THEN RETURN FALSE END;
  5475. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5476. END;
  5477. RETURN TRUE;
  5478. END EqlAXAXLoop;
  5479. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5480. BEGIN
  5481. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5482. END "=";
  5483. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5484. BEGIN
  5485. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5486. END "#";
  5487. (** COMPLEX *)
  5488. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5489. VAR lval, rval: COMPLEX;
  5490. BEGIN
  5491. WHILE (len > 0) DO
  5492. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5493. IF rval # lval THEN RETURN FALSE END;
  5494. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5495. END;
  5496. RETURN TRUE;
  5497. END EqlAZAZLoop;
  5498. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5499. BEGIN
  5500. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5501. END "=";
  5502. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5503. BEGIN
  5504. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5505. END "#";
  5506. (** LONGCOMPLEX *)
  5507. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5508. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5509. BEGIN
  5510. WHILE (len > 0) DO
  5511. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5512. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5513. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5514. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5515. END;
  5516. RETURN TRUE;
  5517. END EqlALZALZLoop;
  5518. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5519. BEGIN
  5520. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5521. END "=";
  5522. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5523. BEGIN
  5524. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5525. END "#";
  5526. (*** equals: array x scalar -> boolean ********************************************************************)
  5527. (** BOOLEAN *)
  5528. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5529. VAR lval, rval: BOOLEAN;
  5530. BEGIN
  5531. SYSTEM.GET( radr, rval );
  5532. WHILE (len > 0) DO
  5533. SYSTEM.GET( ladr, lval );
  5534. IF lval # rval THEN RETURN FALSE END;
  5535. INC( ladr, linc ); DEC( len );
  5536. END;
  5537. RETURN TRUE;
  5538. END EqlABSBLoop;
  5539. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5540. right: BOOLEAN ): BOOLEAN;
  5541. BEGIN
  5542. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5543. END "=";
  5544. OPERATOR "="*( left: BOOLEAN;
  5545. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5546. BEGIN
  5547. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5548. END "=";
  5549. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5550. right: BOOLEAN ): BOOLEAN;
  5551. BEGIN
  5552. RETURN ~(left = right);
  5553. END "#";
  5554. OPERATOR "#"*( left: BOOLEAN;
  5555. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5556. BEGIN
  5557. RETURN ~( left = right );
  5558. END "#";
  5559. (** SHORTINT *)
  5560. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5561. VAR lval, rval: SHORTINT;
  5562. BEGIN
  5563. SYSTEM.GET( radr, rval );
  5564. WHILE (len > 0) DO
  5565. SYSTEM.GET( ladr, lval );
  5566. IF lval # rval THEN RETURN FALSE END;
  5567. INC( ladr, linc ); DEC( len );
  5568. END;
  5569. RETURN TRUE;
  5570. END EqlASSSLoop;
  5571. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5572. BEGIN
  5573. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5574. END "=";
  5575. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5576. BEGIN
  5577. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5578. END "=";
  5579. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5580. BEGIN
  5581. RETURN ~( left= right );
  5582. END "#";
  5583. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5584. BEGIN
  5585. RETURN ~( left= right );
  5586. END "#";
  5587. (** INTEGER *)
  5588. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5589. VAR lval, rval: INTEGER;
  5590. BEGIN
  5591. SYSTEM.GET( radr, rval );
  5592. WHILE (len > 0) DO
  5593. SYSTEM.GET( ladr, lval );
  5594. IF lval # rval THEN RETURN FALSE END;
  5595. INC( ladr, linc ); DEC( len );
  5596. END;
  5597. RETURN TRUE;
  5598. END EqlAISILoop;
  5599. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5600. BEGIN
  5601. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5602. END "=";
  5603. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5604. BEGIN
  5605. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5606. END "=";
  5607. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5608. BEGIN
  5609. RETURN ~( left = right );
  5610. END "#";
  5611. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5612. BEGIN
  5613. RETURN ~( left = right );
  5614. END "#";
  5615. (** LONGINT *)
  5616. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5617. VAR lval, rval: LONGINT;
  5618. BEGIN
  5619. SYSTEM.GET( radr, rval );
  5620. WHILE (len > 0) DO
  5621. SYSTEM.GET( ladr, lval );
  5622. IF lval # rval THEN RETURN FALSE END;
  5623. INC( ladr, linc ); DEC( len );
  5624. END;
  5625. RETURN TRUE;
  5626. END EqlALSLLoop;
  5627. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5628. right: LONGINT ): BOOLEAN;
  5629. BEGIN
  5630. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5631. END "=";
  5632. OPERATOR "="*( left: LONGINT;
  5633. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5634. BEGIN
  5635. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5636. END "=";
  5637. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5638. right: LONGINT ): BOOLEAN;
  5639. BEGIN
  5640. RETURN ~(left = right);
  5641. END "#";
  5642. OPERATOR "#"*( left: LONGINT;
  5643. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5644. BEGIN
  5645. RETURN ~(left = right);
  5646. END "#";
  5647. (** REAL *)
  5648. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5649. VAR lval, rval: REAL;
  5650. BEGIN
  5651. SYSTEM.GET( radr, rval );
  5652. WHILE (len > 0) DO
  5653. SYSTEM.GET( ladr, lval );
  5654. IF lval # rval THEN RETURN FALSE END;
  5655. INC( ladr, linc ); DEC( len );
  5656. END;
  5657. RETURN TRUE;
  5658. END EqlARSRLoop;
  5659. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5660. right: REAL ): BOOLEAN;
  5661. BEGIN
  5662. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5663. END "=";
  5664. OPERATOR "="*( left: REAL;
  5665. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5666. BEGIN
  5667. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5668. END "=";
  5669. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5670. right: REAL ): BOOLEAN;
  5671. BEGIN
  5672. RETURN ~( left = right );
  5673. END "#";
  5674. OPERATOR "#"*( left: REAL;
  5675. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5676. BEGIN
  5677. RETURN ~( left = right );
  5678. END "#";
  5679. (** LONGREAL *)
  5680. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5681. VAR lval, rval: LONGREAL;
  5682. BEGIN
  5683. SYSTEM.GET( radr, rval );
  5684. WHILE (len > 0) DO
  5685. SYSTEM.GET( ladr, lval );
  5686. IF lval # rval THEN RETURN FALSE END;
  5687. INC( ladr, linc ); DEC( len );
  5688. END;
  5689. RETURN TRUE;
  5690. END EqlAXSXLoop;
  5691. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5692. right: LONGREAL ): BOOLEAN;
  5693. BEGIN
  5694. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5695. END "=";
  5696. OPERATOR "="*( left: LONGREAL;
  5697. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5698. BEGIN
  5699. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5700. END "=";
  5701. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5702. right: LONGREAL ): BOOLEAN;
  5703. BEGIN
  5704. RETURN ~( left = right );
  5705. END "#";
  5706. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5707. BEGIN
  5708. RETURN ~( left= right );
  5709. END "#";
  5710. (*** gtr : array x scalar -> boolean ********************************************************************)
  5711. (** SHORTINT *)
  5712. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5713. VAR lval, rval: SHORTINT;
  5714. BEGIN
  5715. SYSTEM.GET( radr, rval );
  5716. WHILE (len > 0) DO
  5717. SYSTEM.GET( ladr, lval );
  5718. IF lval <= rval THEN RETURN FALSE END;
  5719. INC( ladr, linc ); DEC( len );
  5720. END;
  5721. RETURN TRUE;
  5722. END GtrASSSLoop;
  5723. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5724. BEGIN
  5725. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5726. END ">";
  5727. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5728. BEGIN
  5729. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5730. END "<";
  5731. (** INTEGER *)
  5732. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5733. VAR lval, rval: INTEGER;
  5734. BEGIN
  5735. SYSTEM.GET( radr, rval );
  5736. WHILE (len > 0) DO
  5737. SYSTEM.GET( ladr, lval );
  5738. IF lval <= rval THEN RETURN FALSE END;
  5739. INC( ladr, linc ); DEC( len );
  5740. END;
  5741. RETURN TRUE;
  5742. END GtrAISILoop;
  5743. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5744. BEGIN
  5745. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5746. END ">";
  5747. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5748. BEGIN
  5749. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5750. END "<";
  5751. (** LONGINT *)
  5752. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5753. VAR lval, rval: LONGINT;
  5754. BEGIN
  5755. SYSTEM.GET( radr, rval );
  5756. WHILE (len > 0) DO
  5757. SYSTEM.GET( ladr, lval );
  5758. IF lval <= rval THEN RETURN FALSE END;
  5759. INC( ladr, linc ); DEC( len );
  5760. END;
  5761. RETURN TRUE;
  5762. END GtrALSLLoop;
  5763. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5764. BEGIN
  5765. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5766. END ">";
  5767. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5768. BEGIN
  5769. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5770. END "<";
  5771. (** REAL *)
  5772. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5773. VAR lval, rval: REAL;
  5774. BEGIN
  5775. SYSTEM.GET( radr, rval );
  5776. WHILE (len > 0) DO
  5777. SYSTEM.GET( ladr, lval );
  5778. IF lval <= rval THEN RETURN FALSE END;
  5779. INC( ladr, linc ); DEC( len );
  5780. END;
  5781. RETURN TRUE;
  5782. END GtrARSRLoop;
  5783. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5784. right: REAL ): BOOLEAN;
  5785. BEGIN
  5786. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5787. END ">";
  5788. OPERATOR "<"*( left: REAL;
  5789. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5790. BEGIN
  5791. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5792. END "<";
  5793. (** LONGREAL *)
  5794. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5795. VAR lval, rval: LONGREAL;
  5796. BEGIN
  5797. SYSTEM.GET( radr, rval );
  5798. WHILE (len > 0) DO
  5799. SYSTEM.GET( ladr, lval );
  5800. IF lval <= rval THEN RETURN FALSE END;
  5801. INC( ladr, linc ); DEC( len );
  5802. END;
  5803. RETURN TRUE;
  5804. END GtrAXSXLoop;
  5805. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5806. right: LONGREAL ): BOOLEAN;
  5807. BEGIN
  5808. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5809. END ">";
  5810. OPERATOR "<"*( left: LONGREAL;
  5811. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5812. BEGIN
  5813. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5814. END "<";
  5815. (*** geq : array x scalar -> boolean ********************************************************************)
  5816. (** SHORTINT *)
  5817. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5818. VAR lval, rval: SHORTINT;
  5819. BEGIN
  5820. SYSTEM.GET( radr, rval );
  5821. WHILE (len > 0) DO
  5822. SYSTEM.GET( ladr, lval );
  5823. IF lval < rval THEN RETURN FALSE END;
  5824. INC( ladr, linc ); DEC( len );
  5825. END;
  5826. RETURN TRUE;
  5827. END GeqASSSLoop;
  5828. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5829. right: SHORTINT ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5832. END ">=";
  5833. OPERATOR "<="*( left: SHORTINT;
  5834. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5835. BEGIN
  5836. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5837. END "<=";
  5838. (** INTEGER *)
  5839. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5840. VAR lval, rval: INTEGER;
  5841. BEGIN
  5842. SYSTEM.GET( radr, rval );
  5843. WHILE (len > 0) DO
  5844. SYSTEM.GET( ladr, lval );
  5845. IF lval < rval THEN RETURN FALSE END;
  5846. INC( ladr, linc ); DEC( len );
  5847. END;
  5848. RETURN TRUE;
  5849. END GeqAISILoop;
  5850. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5851. BEGIN
  5852. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5853. END ">=";
  5854. OPERATOR "<="*( left: INTEGER;
  5855. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5856. BEGIN
  5857. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5858. END "<=";
  5859. (** LONGINT *)
  5860. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5861. VAR lval, rval: LONGINT;
  5862. BEGIN
  5863. SYSTEM.GET( radr, rval );
  5864. WHILE (len > 0) DO
  5865. SYSTEM.GET( ladr, lval );
  5866. IF lval < rval THEN RETURN FALSE END;
  5867. INC( ladr, linc ); DEC( len );
  5868. END;
  5869. RETURN TRUE;
  5870. END GeqALSLLoop;
  5871. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5872. right: LONGINT ): BOOLEAN;
  5873. BEGIN
  5874. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5875. END ">=";
  5876. OPERATOR "<="*( left: LONGINT;
  5877. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5878. BEGIN
  5879. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5880. END "<=";
  5881. (** REAL *)
  5882. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5883. VAR lval, rval: REAL;
  5884. BEGIN
  5885. SYSTEM.GET( radr, rval );
  5886. WHILE (len > 0) DO
  5887. SYSTEM.GET( ladr, lval );
  5888. IF lval < rval THEN RETURN FALSE END;
  5889. INC( ladr, linc ); DEC( len );
  5890. END;
  5891. RETURN TRUE;
  5892. END GeqARSRLoop;
  5893. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5894. right: REAL ): BOOLEAN;
  5895. BEGIN
  5896. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5897. END ">=";
  5898. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5899. BEGIN
  5900. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5901. END "<=";
  5902. (** LONGREAL *)
  5903. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5904. VAR lval, rval: LONGREAL;
  5905. BEGIN
  5906. SYSTEM.GET( radr, rval );
  5907. WHILE (len > 0) DO
  5908. SYSTEM.GET( ladr, lval );
  5909. IF lval < rval THEN RETURN FALSE END;
  5910. INC( ladr, linc ); DEC( len );
  5911. END;
  5912. RETURN TRUE;
  5913. END GeqAXSXLoop;
  5914. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5915. BEGIN
  5916. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5917. END ">=";
  5918. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5921. END "<=";
  5922. (*** leq : array x scalar -> boolean ********************************************************************)
  5923. (** SHORTINT *)
  5924. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5925. VAR lval, rval: SHORTINT;
  5926. BEGIN
  5927. SYSTEM.GET( radr, rval );
  5928. WHILE (len > 0) DO
  5929. SYSTEM.GET( ladr, lval );
  5930. IF lval > rval THEN RETURN FALSE END;
  5931. INC( ladr, linc ); DEC( len );
  5932. END;
  5933. RETURN TRUE;
  5934. END LeqASSSLoop;
  5935. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5936. BEGIN
  5937. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5938. END "<=";
  5939. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5940. BEGIN
  5941. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5942. END ">=";
  5943. (** INTEGER *)
  5944. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5945. VAR lval, rval: INTEGER;
  5946. BEGIN
  5947. SYSTEM.GET( radr, rval );
  5948. WHILE (len > 0) DO
  5949. SYSTEM.GET( ladr, lval );
  5950. IF lval > rval THEN RETURN FALSE END;
  5951. INC( ladr, linc ); DEC( len );
  5952. END;
  5953. RETURN TRUE;
  5954. END LeqAISILoop;
  5955. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5956. BEGIN
  5957. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5958. END "<=";
  5959. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5960. BEGIN
  5961. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5962. END ">=";
  5963. (** LONGINT *)
  5964. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5965. VAR lval, rval: LONGINT;
  5966. BEGIN
  5967. SYSTEM.GET( radr, rval );
  5968. WHILE (len > 0) DO
  5969. SYSTEM.GET( ladr, lval );
  5970. IF lval > rval THEN RETURN FALSE END;
  5971. INC( ladr, linc ); DEC( len );
  5972. END;
  5973. RETURN TRUE;
  5974. END LeqALSLLoop;
  5975. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5976. BEGIN
  5977. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  5978. END "<=";
  5979. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5980. BEGIN
  5981. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  5982. END ">=";
  5983. (** REAL *)
  5984. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5985. VAR lval, rval: REAL;
  5986. BEGIN
  5987. SYSTEM.GET( radr, rval );
  5988. WHILE (len > 0) DO
  5989. SYSTEM.GET( ladr, lval );
  5990. IF lval > rval THEN RETURN FALSE END;
  5991. INC( ladr, linc ); DEC( len );
  5992. END;
  5993. RETURN TRUE;
  5994. END LeqARSRLoop;
  5995. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  5996. BEGIN
  5997. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  5998. END "<=";
  5999. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6000. BEGIN
  6001. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6002. END ">=";
  6003. (** LONGREAL *)
  6004. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6005. VAR lval, rval: LONGREAL;
  6006. BEGIN
  6007. SYSTEM.GET( radr, rval );
  6008. WHILE (len > 0) DO
  6009. SYSTEM.GET( ladr, lval );
  6010. IF lval > rval THEN RETURN FALSE END;
  6011. INC( ladr, linc ); DEC( len );
  6012. END;
  6013. RETURN TRUE;
  6014. END LeqAXSXLoop;
  6015. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6016. BEGIN
  6017. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6018. END "<=";
  6019. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6020. BEGIN
  6021. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6022. END ">=";
  6023. (*** lss: array x scalar -> boolean ********************************************************************)
  6024. (** SHORTINT *)
  6025. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6026. VAR lval, rval: SHORTINT;
  6027. BEGIN
  6028. SYSTEM.GET( radr, rval );
  6029. WHILE (len > 0) DO
  6030. SYSTEM.GET( ladr, lval );
  6031. IF lval >= rval THEN RETURN FALSE END;
  6032. INC( ladr, linc ); DEC( len );
  6033. END;
  6034. RETURN TRUE;
  6035. END LssASSSLoop;
  6036. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6037. BEGIN
  6038. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6039. END "<";
  6040. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6041. BEGIN
  6042. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6043. END ">";
  6044. (** INTEGER *)
  6045. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6046. VAR lval, rval: INTEGER;
  6047. BEGIN
  6048. SYSTEM.GET( radr, rval );
  6049. WHILE (len > 0) DO
  6050. SYSTEM.GET( ladr, lval );
  6051. IF lval >= rval THEN RETURN FALSE END;
  6052. INC( ladr, linc ); DEC( len );
  6053. END;
  6054. RETURN TRUE;
  6055. END LssAISILoop;
  6056. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6057. BEGIN
  6058. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6059. END "<";
  6060. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6061. BEGIN
  6062. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6063. END ">";
  6064. (** LONGINT *)
  6065. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6066. VAR lval, rval: LONGINT;
  6067. BEGIN
  6068. SYSTEM.GET( radr, rval );
  6069. WHILE (len > 0) DO
  6070. SYSTEM.GET( ladr, lval );
  6071. IF lval >= rval THEN RETURN FALSE END;
  6072. INC( ladr, linc ); DEC( len );
  6073. END;
  6074. RETURN TRUE;
  6075. END LssALSLLoop;
  6076. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6077. BEGIN
  6078. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6079. END "<";
  6080. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6081. BEGIN
  6082. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6083. END ">";
  6084. (** REAL *)
  6085. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6086. VAR lval, rval: REAL;
  6087. BEGIN
  6088. SYSTEM.GET( radr, rval );
  6089. WHILE (len > 0) DO
  6090. SYSTEM.GET( ladr, lval );
  6091. IF lval >= rval THEN RETURN FALSE END;
  6092. INC( ladr, linc ); DEC( len );
  6093. END;
  6094. RETURN TRUE;
  6095. END LssARSRLoop;
  6096. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6097. right: REAL ): BOOLEAN;
  6098. BEGIN
  6099. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6100. END "<";
  6101. OPERATOR ">"*( left: REAL;
  6102. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6103. BEGIN
  6104. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6105. END ">";
  6106. (** LONGREAL *)
  6107. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6108. VAR lval, rval: LONGREAL;
  6109. BEGIN
  6110. SYSTEM.GET( radr, rval );
  6111. WHILE (len > 0) DO
  6112. SYSTEM.GET( ladr, lval );
  6113. IF lval >= rval THEN RETURN FALSE END;
  6114. INC( ladr, linc ); DEC( len );
  6115. END;
  6116. RETURN TRUE;
  6117. END LssAXSXLoop;
  6118. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6119. right: LONGREAL ): BOOLEAN;
  6120. BEGIN
  6121. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6122. END "<";
  6123. OPERATOR ">"*( left: LONGREAL;
  6124. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6125. BEGIN
  6126. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6127. END ">";
  6128. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6129. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6130. VAR lval, val: LONGREAL;
  6131. BEGIN
  6132. SYSTEM.GET( radr, val );
  6133. WHILE (len > 0) DO
  6134. SYSTEM.GET( ladr, lval );
  6135. INC( ladr, linc ); DEC( len );
  6136. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6137. INC(dadr,dinc);
  6138. END;
  6139. END MaxAXSXLoop;
  6140. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6141. TYPE Type = LONGREAL;
  6142. BEGIN
  6143. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6144. RETURN RESULT
  6145. END "MAX";
  6146. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6147. VAR lval, val: REAL;
  6148. BEGIN
  6149. SYSTEM.GET( radr, val );
  6150. WHILE (len > 0) DO
  6151. SYSTEM.GET( ladr, lval );
  6152. INC( ladr, linc ); DEC( len );
  6153. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6154. INC(dadr,dinc);
  6155. END;
  6156. END MaxARSRLoop;
  6157. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6158. TYPE Type = REAL;
  6159. BEGIN
  6160. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6161. RETURN RESULT
  6162. END "MAX";
  6163. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6164. VAR lval, val: LONGINT;
  6165. BEGIN
  6166. SYSTEM.GET( radr, val );
  6167. WHILE (len > 0) DO
  6168. SYSTEM.GET( ladr, lval );
  6169. INC( ladr, linc ); DEC( len );
  6170. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6171. INC(dadr,dinc);
  6172. END;
  6173. END MaxALSLLoop;
  6174. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6175. TYPE Type = LONGINT;
  6176. BEGIN
  6177. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6178. RETURN RESULT
  6179. END "MAX";
  6180. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6181. VAR lval, val: INTEGER;
  6182. BEGIN
  6183. SYSTEM.GET( radr, val );
  6184. WHILE (len > 0) DO
  6185. SYSTEM.GET( ladr, lval );
  6186. INC( ladr, linc ); DEC( len );
  6187. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6188. INC(dadr,dinc);
  6189. END;
  6190. END MaxAISILoop;
  6191. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6192. TYPE Type = INTEGER;
  6193. BEGIN
  6194. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6195. RETURN RESULT
  6196. END "MAX";
  6197. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6198. VAR lval, val: SHORTINT;
  6199. BEGIN
  6200. SYSTEM.GET( radr, val );
  6201. WHILE (len > 0) DO
  6202. SYSTEM.GET( ladr, lval );
  6203. INC( ladr, linc ); DEC( len );
  6204. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6205. INC(dadr,dinc);
  6206. END;
  6207. END MaxASSSLoop;
  6208. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6209. TYPE Type = SHORTINT;
  6210. BEGIN
  6211. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6212. RETURN RESULT
  6213. END "MAX";
  6214. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6215. VAR lval, val: LONGREAL;
  6216. BEGIN
  6217. SYSTEM.GET( radr, val );
  6218. WHILE (len > 0) DO
  6219. SYSTEM.GET( ladr, lval );
  6220. INC( ladr, linc ); DEC( len );
  6221. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6222. INC(dadr,dinc);
  6223. END;
  6224. END MinAXSXLoop;
  6225. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6226. TYPE Type = LONGREAL;
  6227. BEGIN
  6228. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6229. RETURN RESULT
  6230. END "MIN";
  6231. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6232. VAR lval, val: REAL;
  6233. BEGIN
  6234. SYSTEM.GET( radr, val );
  6235. WHILE (len > 0) DO
  6236. SYSTEM.GET( ladr, lval );
  6237. INC( ladr, linc ); DEC( len );
  6238. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6239. INC(dadr,dinc);
  6240. END;
  6241. END MinARSRLoop;
  6242. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6243. TYPE Type = REAL;
  6244. BEGIN
  6245. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6246. RETURN RESULT
  6247. END "MIN";
  6248. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6249. VAR lval, val: LONGINT;
  6250. BEGIN
  6251. SYSTEM.GET( radr, val );
  6252. WHILE (len > 0) DO
  6253. SYSTEM.GET( ladr, lval );
  6254. INC( ladr, linc ); DEC( len );
  6255. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6256. INC(dadr,dinc);
  6257. END;
  6258. END MinALSLLoop;
  6259. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6260. TYPE Type = LONGINT;
  6261. BEGIN
  6262. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6263. RETURN RESULT
  6264. END "MIN";
  6265. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6266. VAR lval, val: INTEGER;
  6267. BEGIN
  6268. SYSTEM.GET( radr, val );
  6269. WHILE (len > 0) DO
  6270. SYSTEM.GET( ladr, lval );
  6271. INC( ladr, linc ); DEC( len );
  6272. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6273. INC(dadr,dinc);
  6274. END;
  6275. END MinAISILoop;
  6276. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6277. TYPE Type = INTEGER;
  6278. BEGIN
  6279. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6280. RETURN RESULT
  6281. END "MIN";
  6282. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6283. VAR lval, val: SHORTINT;
  6284. BEGIN
  6285. SYSTEM.GET( radr, val );
  6286. WHILE (len > 0) DO
  6287. SYSTEM.GET( ladr, lval );
  6288. INC( ladr, linc ); DEC( len );
  6289. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6290. INC(dadr,dinc);
  6291. END;
  6292. END MinASSSLoop;
  6293. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6294. TYPE Type = SHORTINT;
  6295. BEGIN
  6296. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6297. RETURN RESULT
  6298. END "MIN";
  6299. (**** binary max/min operators array x array -> array ********************************************************************)
  6300. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6301. VAR lval, rval: LONGREAL;
  6302. BEGIN
  6303. WHILE (len > 0) DO
  6304. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6305. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6306. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6307. INC(dadr,dinc);
  6308. END;
  6309. END MaxAXAXLoop;
  6310. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6311. BEGIN
  6312. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6313. RETURN RESULT
  6314. END "MAX";
  6315. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6316. VAR lval, rval: REAL ;
  6317. BEGIN
  6318. WHILE (len > 0) DO
  6319. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6320. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6321. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6322. INC(dadr,dinc);
  6323. END;
  6324. END MaxARARLoop;
  6325. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6326. BEGIN
  6327. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6328. RETURN RESULT
  6329. END "MAX";
  6330. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6331. VAR lval, rval: LONGINT;
  6332. BEGIN
  6333. WHILE (len > 0) DO
  6334. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6335. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6336. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6337. INC(dadr,dinc);
  6338. END;
  6339. END MaxALALLoop;
  6340. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6341. BEGIN
  6342. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6343. RETURN RESULT
  6344. END "MAX";
  6345. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6346. VAR lval, rval: INTEGER;
  6347. BEGIN
  6348. WHILE (len > 0) DO
  6349. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6350. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6351. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6352. INC(dadr,dinc);
  6353. END;
  6354. END MaxAIAILoop;
  6355. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6356. BEGIN
  6357. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6358. RETURN RESULT
  6359. END "MAX";
  6360. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6361. VAR lval, rval: SHORTINT;
  6362. BEGIN
  6363. WHILE (len > 0) DO
  6364. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6365. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6366. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6367. INC(dadr,dinc);
  6368. END;
  6369. END MaxASASLoop;
  6370. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6371. BEGIN
  6372. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6373. RETURN RESULT
  6374. END "MAX";
  6375. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6376. VAR lval, rval: LONGREAL;
  6377. BEGIN
  6378. WHILE (len > 0) DO
  6379. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6380. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6381. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6382. INC(dadr,dinc);
  6383. END;
  6384. END MinAXAXLoop;
  6385. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6386. BEGIN
  6387. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6388. RETURN RESULT
  6389. END "MIN";
  6390. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6391. VAR lval, rval: REAL ;
  6392. BEGIN
  6393. WHILE (len > 0) DO
  6394. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6395. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6396. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6397. INC(dadr,dinc);
  6398. END;
  6399. END MinARARLoop;
  6400. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6401. BEGIN
  6402. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6403. RETURN RESULT
  6404. END "MIN";
  6405. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6406. VAR lval, rval: LONGINT;
  6407. BEGIN
  6408. WHILE (len > 0) DO
  6409. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6410. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6411. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6412. INC(dadr,dinc);
  6413. END;
  6414. END MinALALLoop;
  6415. *)
  6416. TYPE
  6417. LongintPtr = POINTER {UNSAFE} TO RECORD val: LONGINT END;
  6418. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6419. BEGIN
  6420. WHILE (len > 0) DO
  6421. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6422. ladr := ladr + linc;
  6423. radr := radr + rinc;
  6424. dadr := dadr + dinc;
  6425. DEC(len);
  6426. END;
  6427. END MinALALLoop;
  6428. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6429. BEGIN
  6430. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6431. RETURN RESULT
  6432. END "MIN";
  6433. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6434. VAR lval, rval: INTEGER;
  6435. BEGIN
  6436. WHILE (len > 0) DO
  6437. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6438. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6439. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6440. INC(dadr,dinc);
  6441. END;
  6442. END MinAIAILoop;
  6443. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6444. BEGIN
  6445. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6446. RETURN RESULT
  6447. END "MIN";
  6448. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6449. VAR lval, rval: SHORTINT;
  6450. BEGIN
  6451. WHILE (len > 0) DO
  6452. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6453. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6454. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6455. INC(dadr,dinc);
  6456. END;
  6457. END MinASASLoop;
  6458. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6459. BEGIN
  6460. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6461. RETURN RESULT
  6462. END "MIN";
  6463. (**** unary operators array -> scalar ********************************************************************)
  6464. (*** min: array -> scalar ****************************************)
  6465. (** SHORTINT *)
  6466. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6467. VAR lval, dval: SHORTINT;
  6468. BEGIN
  6469. SYSTEM.GET( dadr, dval );
  6470. WHILE (len > 0) DO
  6471. SYSTEM.GET( ladr, lval );
  6472. IF lval < dval THEN dval := lval END;
  6473. INC( ladr, linc ); DEC( len );
  6474. END;
  6475. SYSTEM.PUT( dadr, dval );
  6476. END MinASLoop;
  6477. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6478. TYPE Type = SHORTINT;
  6479. VAR val: Type;
  6480. BEGIN
  6481. val := MAX( Type );
  6482. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6483. END "MIN";
  6484. (** INTEGER *)
  6485. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6486. VAR lval, dval: INTEGER;
  6487. BEGIN
  6488. SYSTEM.GET( dadr, dval );
  6489. WHILE (len > 0) DO
  6490. SYSTEM.GET( ladr, lval );
  6491. IF lval < dval THEN dval := lval END;
  6492. INC( ladr, linc ); DEC( len );
  6493. END;
  6494. SYSTEM.PUT( dadr, dval );
  6495. END MinAILoop;
  6496. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6497. TYPE Type = INTEGER;
  6498. VAR val: Type;
  6499. BEGIN
  6500. val := MAX( Type );
  6501. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6502. END "MIN";
  6503. (** LONGINT *)
  6504. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6505. VAR lval, dval: LONGINT;
  6506. BEGIN
  6507. SYSTEM.GET( dadr, dval );
  6508. WHILE (len > 0) DO
  6509. SYSTEM.GET( ladr, lval );
  6510. IF lval < dval THEN dval := lval END;
  6511. INC( ladr, linc ); DEC( len );
  6512. END;
  6513. SYSTEM.PUT( dadr, dval );
  6514. END MinALLoop;
  6515. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6516. TYPE Type = LONGINT;
  6517. VAR val: Type;
  6518. BEGIN
  6519. val := MAX( Type );
  6520. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6521. END "MIN";
  6522. (** REAL *)
  6523. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6524. VAR lval, dval: REAL;
  6525. BEGIN
  6526. SYSTEM.GET( dadr, dval );
  6527. WHILE (len > 0) DO
  6528. SYSTEM.GET( ladr, lval );
  6529. IF lval < dval THEN dval := lval END;
  6530. INC( ladr, linc ); DEC( len );
  6531. END;
  6532. SYSTEM.PUT( dadr, dval );
  6533. END MinARLoop;
  6534. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6535. TYPE Type = REAL;
  6536. VAR val: Type;
  6537. BEGIN
  6538. val := MAX( Type );
  6539. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6540. END "MIN";
  6541. (** LONGREAL *)
  6542. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6543. VAR lval, dval: LONGREAL;
  6544. BEGIN
  6545. SYSTEM.GET( dadr, dval );
  6546. WHILE (len > 0) DO
  6547. SYSTEM.GET( ladr, lval );
  6548. IF lval < dval THEN dval := lval END;
  6549. INC( ladr, linc ); DEC( len );
  6550. END;
  6551. SYSTEM.PUT( dadr, dval );
  6552. END MinAXLoop;
  6553. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6554. TYPE Type = LONGREAL;
  6555. VAR val: Type;
  6556. BEGIN
  6557. val := MAX( Type );
  6558. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6559. END "MIN";
  6560. (*** max: array -> scalar ********************************************************************)
  6561. (** SHORTINT *)
  6562. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6563. VAR lval, dval: SHORTINT;
  6564. BEGIN
  6565. SYSTEM.GET( dadr, dval );
  6566. WHILE (len > 0) DO
  6567. SYSTEM.GET( ladr, lval );
  6568. IF lval > dval THEN dval := lval END;
  6569. INC( ladr, linc ); DEC( len );
  6570. END;
  6571. SYSTEM.PUT( dadr, dval );
  6572. END MaxASLoop;
  6573. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6574. TYPE Type = SHORTINT;
  6575. VAR val: Type;
  6576. BEGIN
  6577. val := MIN( Type );
  6578. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6579. END "MAX";
  6580. (** INTEGER *)
  6581. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6582. VAR lval, dval: INTEGER;
  6583. BEGIN
  6584. SYSTEM.GET( dadr, dval );
  6585. WHILE (len > 0) DO
  6586. SYSTEM.GET( ladr, lval );
  6587. IF lval > dval THEN dval := lval END;
  6588. INC( ladr, linc ); DEC( len );
  6589. END;
  6590. SYSTEM.PUT( dadr, dval );
  6591. END MaxAILoop;
  6592. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6593. TYPE Type = INTEGER;
  6594. VAR val: Type;
  6595. BEGIN
  6596. val := MIN( Type );
  6597. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6598. END "MAX";
  6599. (** LONGINT *)
  6600. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6601. VAR lval, dval: LONGINT;
  6602. BEGIN
  6603. SYSTEM.GET( dadr, dval );
  6604. WHILE (len > 0) DO
  6605. SYSTEM.GET( ladr, lval );
  6606. IF lval > dval THEN dval := lval END;
  6607. INC( ladr, linc ); DEC( len );
  6608. END;
  6609. SYSTEM.PUT( dadr, dval );
  6610. END MaxALLoop;
  6611. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6612. TYPE Type = LONGINT;
  6613. VAR val: Type;
  6614. BEGIN
  6615. val := MIN( Type );
  6616. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6617. END "MAX";
  6618. (** REAL *)
  6619. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6620. VAR lval, dval: REAL;
  6621. BEGIN
  6622. SYSTEM.GET( dadr, dval );
  6623. WHILE (len > 0) DO
  6624. SYSTEM.GET( ladr, lval );
  6625. IF lval > dval THEN dval := lval END;
  6626. INC( ladr, linc ); DEC( len );
  6627. END;
  6628. SYSTEM.PUT( dadr, dval );
  6629. END MaxARLoop;
  6630. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6631. TYPE Type = REAL;
  6632. VAR val: Type;
  6633. BEGIN
  6634. val := MIN( Type );
  6635. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6636. END "MAX";
  6637. (** LONGREAL *)
  6638. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6639. VAR lval, dval: LONGREAL;
  6640. BEGIN
  6641. SYSTEM.GET( dadr, dval );
  6642. WHILE (len > 0) DO
  6643. SYSTEM.GET( ladr, lval );
  6644. IF lval > dval THEN dval := lval END;
  6645. INC( ladr, linc ); DEC( len );
  6646. END;
  6647. SYSTEM.PUT( dadr, dval );
  6648. END MaxAXLoop;
  6649. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6650. TYPE Type = LONGREAL;
  6651. VAR val: Type;
  6652. BEGIN
  6653. val := MIN( Type );
  6654. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6655. END "MAX";
  6656. (*** LEN: array -> array **)
  6657. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6658. VAR src,dim,i: LONGINT;
  6659. BEGIN
  6660. src := SYSTEM.VAL(LONGINT,left);
  6661. dim := GetDim( src );
  6662. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6663. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6664. RETURN RESULT
  6665. END "LEN";
  6666. (*** SUM: array -> scalar ********************************************************************)
  6667. (** SHORTINT *)
  6668. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6669. VAR lval, dval: SHORTINT;
  6670. BEGIN
  6671. SYSTEM.GET( dadr, dval );
  6672. WHILE (len > 0) DO
  6673. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6674. END;
  6675. SYSTEM.PUT( dadr, dval );
  6676. END SumASLoop;
  6677. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6678. TYPE Type = SHORTINT;
  6679. VAR val: Type;
  6680. BEGIN
  6681. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6682. RETURN val;
  6683. END "SUM";
  6684. (** INTEGER *)
  6685. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6686. VAR lval, dval: INTEGER;
  6687. BEGIN
  6688. SYSTEM.GET( dadr, dval );
  6689. WHILE (len > 0) DO
  6690. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6691. END;
  6692. SYSTEM.PUT( dadr, dval );
  6693. END SumAILoop;
  6694. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6695. TYPE Type = INTEGER;
  6696. VAR val: Type;
  6697. BEGIN
  6698. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6699. RETURN val;
  6700. END "SUM";
  6701. (** LONGINT *)
  6702. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6703. VAR lval, dval: LONGINT;
  6704. BEGIN
  6705. SYSTEM.GET( dadr, dval );
  6706. WHILE (len > 0) DO
  6707. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6708. END;
  6709. SYSTEM.PUT( dadr, dval );
  6710. END SumALLoop;
  6711. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6712. TYPE Type = LONGINT;
  6713. VAR val: Type;
  6714. BEGIN
  6715. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6716. RETURN val;
  6717. END "SUM";
  6718. (** REAL *)
  6719. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6720. VAR lval, dval: REAL;
  6721. BEGIN
  6722. SYSTEM.GET( dadr, dval );
  6723. WHILE (len > 0) DO
  6724. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6725. END;
  6726. SYSTEM.PUT( dadr, dval );
  6727. END SumARLoop;
  6728. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6729. TYPE Type = REAL;
  6730. VAR val: Type;
  6731. BEGIN
  6732. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6733. RETURN val;
  6734. END "SUM";
  6735. (** LONGREAL *)
  6736. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6737. VAR lval, dval: LONGREAL;
  6738. BEGIN
  6739. SYSTEM.GET( dadr, dval );
  6740. WHILE (len > 0) DO
  6741. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6742. END;
  6743. SYSTEM.PUT( dadr, dval );
  6744. END SumAXLoop;
  6745. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6746. TYPE Type = LONGREAL;
  6747. VAR val: Type;
  6748. BEGIN
  6749. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6750. RETURN val;
  6751. END "SUM";
  6752. (** COMPLEX *)
  6753. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6754. VAR lval, dval: COMPLEX;
  6755. BEGIN
  6756. SYSTEM.GET( dadr, dval );
  6757. WHILE (len > 0) DO
  6758. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6759. END;
  6760. SYSTEM.PUT( dadr, dval );
  6761. END SumAZLoop;
  6762. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6763. TYPE Type = COMPLEX;
  6764. VAR val: Type;
  6765. BEGIN
  6766. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6767. RETURN val;
  6768. END "SUM";
  6769. (** LONGCOMPLEX *)
  6770. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6771. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6772. BEGIN
  6773. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6774. WHILE (len > 0) DO
  6775. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6776. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6777. INC( ladr, linc ); DEC( len );
  6778. END;
  6779. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6780. END SumALZLoop;
  6781. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6782. TYPE Type = LONGCOMPLEX;
  6783. VAR val: Type;
  6784. BEGIN
  6785. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6786. RETURN val;
  6787. END "SUM";
  6788. (*** monadic ABS array -> array ********************************************************************)
  6789. (** SHORTINT *)
  6790. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6791. VAR lval: SHORTINT;
  6792. BEGIN
  6793. WHILE (len > 0) DO
  6794. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6795. INC( dadr, dinc ); DEC( len );
  6796. END;
  6797. END AbsLoopS;
  6798. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6799. BEGIN
  6800. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6801. RETURN RESULT
  6802. END "ABS";
  6803. (** INTEGER *)
  6804. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6805. VAR lval: INTEGER;
  6806. BEGIN
  6807. WHILE (len > 0) DO
  6808. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6809. INC( dadr, dinc ); DEC( len );
  6810. END;
  6811. END AbsLoopI;
  6812. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6813. BEGIN
  6814. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6815. RETURN RESULT
  6816. END "ABS";
  6817. (** LONGINT *)
  6818. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6819. VAR lval: LONGINT;
  6820. BEGIN
  6821. WHILE (len > 0) DO
  6822. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6823. INC( dadr, dinc ); DEC( len );
  6824. END;
  6825. END AbsLoopL;
  6826. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6827. BEGIN
  6828. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6829. RETURN RESULT
  6830. END "ABS";
  6831. (** REAL *)
  6832. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6833. VAR lval: REAL;
  6834. BEGIN
  6835. WHILE (len > 0) DO
  6836. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6837. INC( dadr, dinc ); DEC( len );
  6838. END;
  6839. END AbsLoopR;
  6840. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6841. BEGIN
  6842. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6843. RETURN RESULT
  6844. END "ABS";
  6845. (** LONGREAL *)
  6846. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6847. VAR lval: LONGREAL;
  6848. BEGIN
  6849. WHILE (len > 0) DO
  6850. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6851. INC( dadr, dinc ); DEC( len );
  6852. END;
  6853. END AbsLoopX;
  6854. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6855. BEGIN
  6856. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6857. RETURN RESULT
  6858. END "ABS";
  6859. (** COMPLEX *)
  6860. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6861. VAR lval: COMPLEX;
  6862. BEGIN
  6863. WHILE (len > 0) DO
  6864. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6865. INC( dadr, dinc ); DEC( len );
  6866. END;
  6867. END AbsLoopZ;
  6868. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6869. BEGIN
  6870. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6871. RETURN RESULT
  6872. END "ABS";
  6873. (** LONGCOMPLEX *)
  6874. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6875. VAR lvalRe, lvalIm: LONGREAL;
  6876. BEGIN
  6877. WHILE (len > 0) DO
  6878. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6879. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6880. INC( ladr, linc );
  6881. INC( dadr, dinc ); DEC( len );
  6882. END;
  6883. END AbsLoopLZ;
  6884. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6885. BEGIN
  6886. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6887. RETURN RESULT
  6888. END "ABS";
  6889. (*** assign number to array (initialisation) ********************************************************************)
  6890. (** BOOLEAN *)
  6891. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6892. VAR lval: BOOLEAN;
  6893. BEGIN
  6894. SYSTEM.GET( ladr, lval );
  6895. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6896. END AssignSBABLoop;
  6897. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6898. BEGIN
  6899. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6900. END ":=";
  6901. (** SHORTINT*)
  6902. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6903. VAR lval: SHORTINT;
  6904. BEGIN
  6905. SYSTEM.GET( ladr, lval );
  6906. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6907. END AssignSSASLoop;
  6908. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6909. BEGIN
  6910. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6911. END ":=";
  6912. (**INTEGER *)
  6913. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6914. VAR lval: INTEGER;
  6915. BEGIN
  6916. SYSTEM.GET( ladr, lval );
  6917. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6918. END AssignSIAILoop;
  6919. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6920. BEGIN
  6921. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6922. END ":=";
  6923. (** LONGINT *)
  6924. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6925. VAR lval: LONGINT;
  6926. BEGIN
  6927. SYSTEM.GET( ladr, lval );
  6928. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6929. END AssignSLALLoop;
  6930. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6931. BEGIN
  6932. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6933. END ":=";
  6934. (** REAL *)
  6935. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6936. VAR lval: REAL;
  6937. BEGIN
  6938. SYSTEM.GET( ladr, lval );
  6939. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6940. END AssignSRARLoop;
  6941. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6942. BEGIN
  6943. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6944. END ":=";
  6945. (** LONGREAL *)
  6946. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6947. VAR lval: LONGREAL;
  6948. BEGIN
  6949. SYSTEM.GET( ladr, lval );
  6950. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6951. END AssignSXAXLoop;
  6952. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6953. BEGIN
  6954. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6955. END ":=";
  6956. (** COMPLEX *)
  6957. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6958. VAR lval: COMPLEX;
  6959. BEGIN
  6960. SYSTEM.GET( ladr, lval );
  6961. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6962. END AssignSZAZLoop;
  6963. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6964. BEGIN
  6965. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6966. END ":=";
  6967. (** LONGCOMPLEX *)
  6968. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6969. VAR lvalRe, lvalIm: LONGREAL;
  6970. BEGIN
  6971. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6972. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6973. END AssignSLZALZLoop;
  6974. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6975. BEGIN
  6976. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6977. END ":=";
  6978. (*** matrix multipliation ********************************************************************)
  6979. PROCEDURE AllocateMatrix( dest: ADDRESS;
  6980. rows, cols, elementsize: LONGINT ): ANY;
  6981. VAR p: ANY;
  6982. BEGIN
  6983. (*
  6984. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  6985. *)
  6986. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  6987. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  6988. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6989. PutPtr( dest, p); RETURN p;
  6990. END AllocateMatrix;
  6991. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: LONGINT ): ANY;
  6992. VAR p: ANY;
  6993. BEGIN
  6994. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  6995. PutInc( dest, 0, elementsize ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6996. PutPtr( dest, p ); RETURN p;
  6997. END AllocateVector;
  6998. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: LONGINT;
  6999. loop: BinaryAASLoop;
  7000. fast: FastMatMul ); (* Size= element-size *)
  7001. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  7002. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7003. BEGIN
  7004. (*
  7005. <- 1 ->
  7006. xxx xxxx -> xxxx
  7007. ^ xxx xxxx xxxx
  7008. 0 xxx xxxx xxxx
  7009. v xxx xxxx
  7010. xxx xxxx
  7011. Len(..,1): #columns ; Inc(..,1): inc in rows
  7012. Len(..,0): #rows ; Inc(..,0): inc between rows
  7013. *)
  7014. (* apply multiplication D = L * R *)
  7015. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7016. colsL := GetLen( left, 1 ); (* # left columns *)
  7017. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7018. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7019. (* check geometric restriction *)
  7020. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7021. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7022. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7023. IF RangeFlag IN GetFlags( dest ) THEN
  7024. Halt( GeometryMismatch, left, right, dest )
  7025. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7026. END;
  7027. END;
  7028. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7029. IF overlap THEN
  7030. destOld := dest; destNew := 0;
  7031. p := AllocateSame( destNew, destOld, Size );
  7032. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7033. dest := destNew;
  7034. END;
  7035. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7036. HALT( 9999 )
  7037. END;
  7038. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7039. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7040. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7041. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7042. (*
  7043. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7044. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7045. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7046. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7047. *)
  7048. IF rowsL = 0 THEN RETURN
  7049. ELSIF colsL=0 THEN RETURN
  7050. ELSIF colsR=0 THEN RETURN
  7051. ELSIF (fast = NIL ) OR
  7052. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7053. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7054. radri := radr; dadri := dadr; colsRi := colsR;
  7055. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7056. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7057. INC( dadri, incD ); DEC( colsRi );
  7058. END;
  7059. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7060. END;
  7061. END;
  7062. IF overlap THEN CopyContent( destOld, dest, Size );
  7063. END;
  7064. END ApplyMatMulLoop;
  7065. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7066. Size: LONGINT; loop: BinaryAASLoop;
  7067. fast: FastMatMul ); (* Size= element-size *)
  7068. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7069. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7070. BEGIN
  7071. (*
  7072. <- 0 ->
  7073. xxx T(xxx) -> T(xxxxx)
  7074. xxx
  7075. 1 xxx
  7076. xxx
  7077. xxx
  7078. Len(..,0): #columns ; Inc(..,0): inc in rows
  7079. Len(..,1): #rows ; Inc(..,1): inc between rows
  7080. *)
  7081. (* check geometric restriction *)
  7082. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7083. Halt( GeometryMismatch, left, right,0 );
  7084. END;
  7085. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7086. l2 := GetLen( left, 1 ); (* inner loop len *)
  7087. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7088. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7089. IF RangeFlag IN GetFlags( dest ) THEN
  7090. Halt( GeometryMismatch, left, right, dest );
  7091. ELSE p := AllocateVector( dest, l1, Size );
  7092. END;
  7093. END;
  7094. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7095. IF overlap THEN
  7096. destOld := dest; destNew := 0;
  7097. p := AllocateSame( destNew, destOld, Size );
  7098. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7099. dest := destNew;
  7100. END;
  7101. (*
  7102. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7103. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7104. END;
  7105. *)
  7106. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7107. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7108. di0 := GetIncr( dest, 0 );
  7109. IF l1=0 THEN RETURN
  7110. ELSIF l2=0 THEN RETURN
  7111. ELSIF (fast = NIL ) OR
  7112. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7113. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7114. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7115. DEC( l1 );
  7116. END;
  7117. END;
  7118. IF overlap THEN CopyContent( destOld, dest, Size );
  7119. END;
  7120. END ApplyMatVecMulLoop;
  7121. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7122. Size: LONGINT; loop: BinaryAASLoop;
  7123. fast: FastMatMul ); (* Size= element-size *)
  7124. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7125. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7126. BEGIN
  7127. (*
  7128. <- 0 ->
  7129. xxx xxxx -> xxxx
  7130. xxxx
  7131. 1 xxxx
  7132. Len(..,0): #columns ; Inc(..,0): inc in rows
  7133. Len(..,1): #rows ; Inc(..,1): inc between rows
  7134. *)
  7135. (* check geometric restriction *)
  7136. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7137. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7138. l2 := GetLen( right, 0 ); (* inner loop len *)
  7139. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7140. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7141. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7142. ELSE p := AllocateVector( dest, l0, Size );
  7143. END;
  7144. END;
  7145. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7146. IF overlap THEN
  7147. destOld := dest; destNew := 0;
  7148. p := AllocateSame( destNew, destOld, Size );
  7149. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7150. dest := destNew;
  7151. END;
  7152. (*
  7153. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7154. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7155. END;
  7156. *)
  7157. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7158. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7159. di0 := GetIncr( dest, 0 );
  7160. IF l2=0 THEN RETURN
  7161. ELSIF l0=0 THEN RETURN
  7162. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7163. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7164. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7165. DEC( l0 );
  7166. END;
  7167. END;
  7168. IF overlap THEN CopyContent( destOld, dest, Size );
  7169. END;
  7170. END ApplyVecMatMulLoop;
  7171. (** SHORTINT *)
  7172. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7173. VAR lval, rval, dval: SHORTINT;
  7174. BEGIN
  7175. dval := 0;
  7176. WHILE (len > 0) DO
  7177. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7178. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7179. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7180. END;
  7181. SYSTEM.PUT( dadr, dval );
  7182. END MatMulASASLoop;
  7183. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7184. BEGIN
  7185. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7186. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7187. RETURN RESULT
  7188. END "*";
  7189. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7190. BEGIN
  7191. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7192. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7193. RETURN RESULT
  7194. END "*";
  7195. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7196. BEGIN
  7197. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7198. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7199. RETURN RESULT
  7200. END "*";
  7201. (** INTEGER *)
  7202. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7203. VAR lval, rval, dval: INTEGER;
  7204. BEGIN
  7205. dval := 0;
  7206. WHILE (len > 0) DO
  7207. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7208. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7209. END;
  7210. SYSTEM.PUT( dadr, dval );
  7211. END MatMulAIAILoop;
  7212. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7213. BEGIN
  7214. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7215. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7216. RETURN RESULT
  7217. END "*";
  7218. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7219. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7220. BEGIN
  7221. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7222. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7223. RETURN RESULT
  7224. END "*";
  7225. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7226. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7227. BEGIN
  7228. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7229. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7230. RETURN RESULT
  7231. END "*";
  7232. (** LONGINT *)
  7233. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7234. VAR lval, rval, dval: LONGINT;
  7235. BEGIN
  7236. dval := 0;
  7237. WHILE (len > 0) DO
  7238. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7239. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7240. END;
  7241. SYSTEM.PUT( dadr, dval );
  7242. END MatMulALALLoop;
  7243. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7244. BEGIN
  7245. (*
  7246. KernelLog.String("MatMulALAL");
  7247. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7248. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7249. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7250. KernelLog.Ln;
  7251. *)
  7252. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7253. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7254. RETURN RESULT
  7255. END "*";
  7256. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7257. BEGIN
  7258. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7259. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7260. RETURN RESULT
  7261. END "*";
  7262. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7263. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7264. BEGIN
  7265. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7266. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7267. RETURN RESULT
  7268. END "*";
  7269. (** REAL *)
  7270. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7271. VAR lval, rval, dval: REAL;
  7272. BEGIN
  7273. dval := 0;
  7274. WHILE (len > 0) DO
  7275. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7276. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7277. END;
  7278. SYSTEM.PUT( dadr, dval );
  7279. END MatMulARARLoop;
  7280. (*
  7281. Optimized for small matrices (Alexey Morozov)
  7282. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7283. *)
  7284. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7285. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7286. BEGIN
  7287. dadr := GetAdr(ADDRESSOF(RESULT));
  7288. ladr := GetAdr(ADDRESSOF(left));
  7289. radr := GetAdr(ADDRESSOF(right));
  7290. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7291. IF (ladr # dadr) & (radr # dadr) THEN
  7292. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7293. CASE SYSTEM.VAL(LONGINT,flags) OF
  7294. Mat2x2:
  7295. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7296. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7297. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7298. END;
  7299. END;
  7300. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7301. ELSE
  7302. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7303. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7304. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7305. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7306. END;
  7307. |Mat3x3:
  7308. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7309. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7310. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7311. END;
  7312. END;
  7313. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7314. ELSE
  7315. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7316. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7317. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7318. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7319. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7320. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7321. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7322. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7323. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7324. END;
  7325. |Mat4x4:
  7326. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7327. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7328. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7329. END;
  7330. END;
  7331. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7332. ELSE
  7333. 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];
  7334. 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];
  7335. 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];
  7336. 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];
  7337. 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];
  7338. 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];
  7339. 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];
  7340. 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];
  7341. 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];
  7342. 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];
  7343. 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];
  7344. 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];
  7345. 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];
  7346. 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];
  7347. 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];
  7348. 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];
  7349. END;
  7350. ELSE
  7351. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7352. loopMatMulARAR, matMulR );
  7353. END;
  7354. ELSE
  7355. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7356. loopMatMulARAR, matMulR );
  7357. END;
  7358. RETURN RESULT
  7359. END "*";
  7360. (*
  7361. Optimized for small arrays (Alexey Morozov)
  7362. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7363. *)
  7364. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7365. VAR
  7366. flags: SET; dadr, ladr, radr: LONGINT;
  7367. v0, v1, v2: REAL;
  7368. BEGIN
  7369. dadr := GetAdr(ADDRESSOF(RESULT));
  7370. ladr := GetAdr(ADDRESSOF(left));
  7371. radr := GetAdr(ADDRESSOF(right));
  7372. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7373. CASE SYSTEM.VAL(LONGINT,flags) OF
  7374. MatVec2x2:
  7375. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7376. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7377. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7378. END;
  7379. END;
  7380. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7381. ELSE
  7382. (* account possible overlapping *)
  7383. v0 := right[0];
  7384. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7385. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7386. END;
  7387. |MatVec3x3:
  7388. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7389. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7390. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7391. END;
  7392. END;
  7393. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7394. ELSE
  7395. (* account possible overlapping *)
  7396. v0 := right[0]; v1 := right[1];
  7397. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7398. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7399. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7400. END;
  7401. |MatVec4x4:
  7402. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7403. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7404. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7405. END;
  7406. END;
  7407. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7408. ELSE
  7409. (* account possible overlapping *)
  7410. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7411. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7412. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7413. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7414. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7415. END;
  7416. ELSE
  7417. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7418. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7419. END;
  7420. RETURN RESULT
  7421. END "*";
  7422. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7423. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7424. BEGIN
  7425. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7426. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7427. RETURN RESULT
  7428. END "*";
  7429. (** LONGREAL *)
  7430. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7431. VAR lval, rval, dval: LONGREAL;
  7432. BEGIN
  7433. dval := 0;
  7434. WHILE (len > 0) DO
  7435. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7436. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7437. END;
  7438. SYSTEM.PUT( dadr, dval );
  7439. END MatMulAXAXLoop;
  7440. (*
  7441. Optimized for small matrices (Alexey Morozov)
  7442. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7443. *)
  7444. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7445. VAR
  7446. flags: SET; dadr, ladr, radr: LONGINT;
  7447. BEGIN
  7448. dadr := GetAdr(ADDRESSOF(RESULT));
  7449. ladr := GetAdr(ADDRESSOF(left));
  7450. radr := GetAdr(ADDRESSOF(right));
  7451. IF (ladr # dadr) & (radr # dadr) THEN
  7452. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7453. CASE SYSTEM.VAL(LONGINT,flags) OF
  7454. Mat2x2:
  7455. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7456. IF dadr = 0 THEN NEW(RESULT,2,2);
  7457. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7458. END;
  7459. END;
  7460. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7461. ELSE
  7462. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7463. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7464. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7465. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7466. END;
  7467. |Mat3x3:
  7468. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7469. IF dadr = 0 THEN NEW(RESULT,3,3);
  7470. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7471. END;
  7472. END;
  7473. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7474. ELSE
  7475. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7476. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7477. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7478. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7479. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7480. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7481. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7482. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7483. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7484. END;
  7485. |Mat4x4:
  7486. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7487. IF dadr = 0 THEN NEW(RESULT,4,4);
  7488. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7489. END;
  7490. END;
  7491. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7492. ELSE
  7493. 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];
  7494. 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];
  7495. 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];
  7496. 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];
  7497. 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];
  7498. 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];
  7499. 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];
  7500. 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];
  7501. 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];
  7502. 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];
  7503. 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];
  7504. 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];
  7505. 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];
  7506. 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];
  7507. 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];
  7508. 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];
  7509. END;
  7510. ELSE
  7511. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7512. loopMatMulAXAX, matMulX );
  7513. END;
  7514. ELSE
  7515. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7516. loopMatMulAXAX, matMulX );
  7517. END;
  7518. RETURN RESULT
  7519. END "*";
  7520. (*
  7521. Optimized for small arrays (Alexey Morozov)
  7522. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7523. *)
  7524. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7525. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7526. VAR
  7527. flags: SET; dadr, ladr, radr: LONGINT;
  7528. v0, v1, v2: LONGREAL;
  7529. BEGIN
  7530. dadr := GetAdr(ADDRESSOF(RESULT));
  7531. ladr := GetAdr(ADDRESSOF(left));
  7532. radr := GetAdr(ADDRESSOF(right));
  7533. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7534. CASE SYSTEM.VAL(LONGINT,flags) OF
  7535. MatVec2x2:
  7536. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7537. IF dadr = 0 THEN NEW(RESULT,2);
  7538. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7539. END;
  7540. END;
  7541. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7542. ELSE
  7543. (* account possible overlapping *)
  7544. v0 := right[0];
  7545. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7546. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7547. END;
  7548. |MatVec3x3:
  7549. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7550. IF dadr = 0 THEN NEW(RESULT,3);
  7551. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7552. END;
  7553. END;
  7554. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7555. ELSE
  7556. (* account possible overlapping *)
  7557. v0 := right[0]; v1 := right[1];
  7558. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7559. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7560. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7561. END;
  7562. |MatVec4x4:
  7563. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7564. IF dadr = 0 THEN NEW(RESULT,4);
  7565. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7566. END;
  7567. END;
  7568. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7569. ELSE
  7570. (* account possible overlapping *)
  7571. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7572. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7573. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7574. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7575. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7576. END;
  7577. ELSE
  7578. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7579. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7580. END;
  7581. RETURN RESULT
  7582. END "*";
  7583. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7584. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7585. BEGIN
  7586. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7587. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7588. RETURN RESULT
  7589. END "*";
  7590. (** SHORTINT *)
  7591. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7592. VAR lval, rval, dval: SHORTINT;
  7593. BEGIN
  7594. SYSTEM.GET( dadr, dval );
  7595. WHILE (len > 0) DO
  7596. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7597. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7598. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7599. END;
  7600. SYSTEM.PUT( dadr, dval );
  7601. END MatMulIncASASLoop;
  7602. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7603. BEGIN
  7604. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7605. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7606. RETURN RESULT
  7607. END "@MulInc";
  7608. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7609. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7610. BEGIN
  7611. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7612. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7613. RETURN RESULT
  7614. END "@MulInc";
  7615. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7616. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7617. BEGIN
  7618. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7619. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7620. RETURN RESULT
  7621. END "@MulInc";
  7622. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7623. BEGIN
  7624. RESULT := -RESULT;
  7625. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7626. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7627. RESULT := -RESULT;
  7628. RETURN RESULT
  7629. END "@MulDec";
  7630. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7631. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7632. BEGIN
  7633. RESULT := -RESULT;
  7634. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7635. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7636. RESULT := -RESULT;
  7637. RETURN RESULT
  7638. END "@MulDec";
  7639. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7640. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7641. BEGIN
  7642. RESULT := -RESULT;
  7643. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7644. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7645. RESULT := -RESULT;
  7646. RETURN RESULT
  7647. END "@MulDec";
  7648. (** INTEGER *)
  7649. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7650. VAR lval, rval, dval: INTEGER;
  7651. BEGIN
  7652. SYSTEM.GET( dadr, dval );
  7653. WHILE (len > 0) DO
  7654. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7655. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7656. END;
  7657. SYSTEM.PUT( dadr, dval );
  7658. END MatMulIncAIAILoop;
  7659. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7660. BEGIN
  7661. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7662. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7663. RETURN RESULT
  7664. END "@MulInc";
  7665. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7666. BEGIN
  7667. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7668. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7669. RETURN RESULT
  7670. END "@MulInc";
  7671. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7672. BEGIN
  7673. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7674. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7675. RETURN RESULT
  7676. END "@MulInc";
  7677. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7678. BEGIN
  7679. RESULT := -RESULT;
  7680. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7681. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7682. RESULT := -RESULT;
  7683. RETURN RESULT
  7684. END "@MulDec";
  7685. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7686. BEGIN
  7687. RESULT := -RESULT;
  7688. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7689. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7690. RESULT := -RESULT;
  7691. RETURN RESULT
  7692. END "@MulDec";
  7693. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7694. BEGIN
  7695. RESULT := -RESULT;
  7696. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7697. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7698. RESULT := -RESULT;
  7699. RETURN RESULT
  7700. END "@MulDec";
  7701. (** LONGINT *)
  7702. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7703. VAR lval, rval, dval: LONGINT;
  7704. BEGIN
  7705. SYSTEM.GET( dadr, dval );
  7706. WHILE (len > 0) DO
  7707. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7708. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7709. END;
  7710. SYSTEM.PUT( dadr, dval );
  7711. END MatMulIncALALLoop;
  7712. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7713. BEGIN
  7714. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7715. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7716. RETURN RESULT
  7717. END "@MulInc";
  7718. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7719. BEGIN
  7720. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7721. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7722. RETURN RESULT
  7723. END "@MulInc";
  7724. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7725. BEGIN
  7726. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7727. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7728. RETURN RESULT
  7729. END "@MulInc";
  7730. OPERATOR "@MulDec"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7731. BEGIN
  7732. RESULT := -RESULT;
  7733. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7734. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7735. RESULT := -RESULT;
  7736. RETURN RESULT
  7737. END "@MulDec";
  7738. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7739. BEGIN
  7740. RESULT := -RESULT;
  7741. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7742. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7743. RESULT := -RESULT;
  7744. RETURN RESULT
  7745. END "@MulDec";
  7746. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7747. BEGIN
  7748. RESULT := -RESULT;
  7749. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7750. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7751. RESULT := -RESULT;
  7752. RETURN RESULT
  7753. END "@MulDec";
  7754. (** REAL *)
  7755. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7756. VAR lval, rval, dval: REAL;
  7757. BEGIN
  7758. SYSTEM.GET( dadr, dval );
  7759. WHILE (len > 0) DO
  7760. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7761. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7762. END;
  7763. SYSTEM.PUT( dadr, dval );
  7764. END MatMulIncARARLoop;
  7765. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7766. BEGIN
  7767. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7768. loopMatMulIncARAR, matMulIncR );
  7769. RETURN RESULT
  7770. END "@MulInc";
  7771. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7772. BEGIN
  7773. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7774. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7775. RETURN RESULT
  7776. END "@MulInc";
  7777. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7778. BEGIN
  7779. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7780. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7781. RETURN RESULT
  7782. END "@MulInc";
  7783. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7784. BEGIN
  7785. RESULT := -RESULT;
  7786. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7787. loopMatMulIncARAR, matMulIncR );
  7788. RESULT := -RESULT;
  7789. RETURN RESULT
  7790. END "@MulDec";
  7791. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7792. BEGIN
  7793. RESULT := -RESULT;
  7794. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7795. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7796. RESULT := -RESULT;
  7797. RETURN RESULT
  7798. END "@MulDec";
  7799. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7800. BEGIN
  7801. RESULT := -RESULT;
  7802. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7803. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7804. RESULT := -RESULT;
  7805. RETURN RESULT
  7806. END "@MulDec";
  7807. (** LONGREAL *)
  7808. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7809. VAR lval, rval, dval: LONGREAL;
  7810. BEGIN
  7811. SYSTEM.GET( dadr, dval );
  7812. WHILE (len > 0) DO
  7813. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7814. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7815. END;
  7816. SYSTEM.PUT( dadr, dval );
  7817. END MatMulIncAXAXLoop;
  7818. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7819. BEGIN
  7820. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7821. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7822. RETURN RESULT
  7823. END "@MulInc";
  7824. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7825. BEGIN
  7826. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7827. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7828. RETURN RESULT
  7829. END "@MulInc";
  7830. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7831. BEGIN
  7832. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7833. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7834. RETURN RESULT
  7835. END "@MulInc";
  7836. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7837. BEGIN
  7838. RESULT := -RESULT;
  7839. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7840. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7841. RESULT := -RESULT;
  7842. RETURN RESULT
  7843. END "@MulDec";
  7844. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7845. BEGIN
  7846. RESULT := -RESULT;
  7847. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7848. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7849. RESULT := -RESULT;
  7850. RETURN RESULT
  7851. END "@MulDec";
  7852. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7853. BEGIN
  7854. RESULT := -RESULT;
  7855. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7856. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7857. RESULT := -RESULT;
  7858. RETURN RESULT
  7859. END "@MulDec";
  7860. (*** Cross product ********************************************************************)
  7861. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7862. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7863. BEGIN
  7864. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7865. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7866. END;
  7867. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7868. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7869. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7870. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7871. RETURN RESULT
  7872. END "*";
  7873. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7874. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7875. BEGIN
  7876. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7877. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7878. END;
  7879. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7880. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7881. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7882. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7883. RETURN RESULT
  7884. END "*";
  7885. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7886. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7887. BEGIN
  7888. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7889. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7890. END;
  7891. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7892. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7893. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7894. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7895. RETURN RESULT
  7896. END "*";
  7897. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7898. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7899. BEGIN
  7900. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7901. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7902. END;
  7903. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7904. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7905. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7906. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7907. RETURN RESULT
  7908. END "*";
  7909. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7910. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7911. BEGIN
  7912. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7913. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7914. END;
  7915. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7916. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7917. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7918. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7919. RETURN RESULT
  7920. END "*";
  7921. (** Transpose ********************************************************************)
  7922. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  7923. VAR from1, from2, to1, to2: ADDRESS; dim: LONGINT;
  7924. BEGIN
  7925. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7926. dim := GetDim( src1 ) - 1;
  7927. WHILE (dim > 0) DO
  7928. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7929. END;
  7930. dim := GetDim( src2 ) - 1;
  7931. WHILE (dim > 0) DO
  7932. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7933. END;
  7934. IF from1 < from2 THEN RETURN to1 >= from2;
  7935. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7936. ELSE RETURN TRUE;
  7937. END;
  7938. END Overlap;
  7939. (*
  7940. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  7941. VAR from1, from2, to1, to2: ADDRESS;
  7942. BEGIN
  7943. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7944. DEC( dim );
  7945. WHILE (dim > 0) DO
  7946. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  7947. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7948. END;
  7949. IF from1 < from2 THEN RETURN to1 >= from2;
  7950. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7951. ELSE RETURN TRUE;
  7952. END;
  7953. END Overlap;
  7954. *)
  7955. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS;
  7956. elementsize: SIZE ): ANY;
  7957. VAR ptr, data: ANY; Size: LONGINT;
  7958. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  7959. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  7960. VAR dim,max: LONGINT;
  7961. BEGIN
  7962. dim := GetDim( l );
  7963. IF dim # GetDim( r ) THEN RETURN FALSE END;
  7964. max := dim-1;
  7965. WHILE (dim > 0) DO
  7966. DEC( dim );
  7967. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  7968. END;
  7969. RETURN TRUE;
  7970. END TransposedShape;
  7971. PROCEDURE UseDescriptor;
  7972. VAR tag: LONGINT;
  7973. BEGIN
  7974. SYSTEM.GET( src - 4, tag );
  7975. Heaps.NewRec( ptr, tag, FALSE );
  7976. dest := SYSTEM.VAL( LONGINT, ptr );
  7977. END UseDescriptor;
  7978. PROCEDURE NewData;
  7979. VAR max,dim, len, size: LONGINT;
  7980. BEGIN
  7981. dim := GetDim( src ); size := elementsize;
  7982. PutDim( dest, dim );
  7983. PutSize( dest, elementsize );
  7984. max := dim-1;
  7985. WHILE (dim > 0) DO
  7986. DEC( dim );
  7987. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  7988. PutInc( dest, dim, size ); size := size * len;
  7989. END;
  7990. SYSTEM.NEW( data, size );
  7991. PutAdr( dest, data );
  7992. PutPtr( dest, data );
  7993. END NewData;
  7994. BEGIN
  7995. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  7996. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  7997. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  7998. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  7999. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  8000. END;
  8001. PutFlags(dest, {TensorFlag});
  8002. NewData(); RETURN ptr;
  8003. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8004. (* check if re-allocation of descriptor is allowed *)
  8005. IF ~(TensorFlag IN GetFlags( dest )) &
  8006. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8007. HALT( 100 );
  8008. END;
  8009. UseDescriptor();
  8010. PutFlags(dest, {TensorFlag});
  8011. NewData(); RETURN ptr;
  8012. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8013. (* check if re-allocation of array data is allowed *)
  8014. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8015. HALT( 100 );
  8016. END;
  8017. NewData();
  8018. RETURN data;
  8019. ELSE (* nothing to do *)
  8020. RETURN NIL;
  8021. END;
  8022. END AllocateTransposed;
  8023. PROCEDURE Transpose*( dest, left: ADDRESS; Size: LONGINT );
  8024. VAR len0, len1, linc0, linc1, dinc0, dinc1, ladr, dadr: LONGINT; p: ANY;
  8025. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8026. BEGIN
  8027. WHILE (len > 0) DO
  8028. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8029. DEC( len );
  8030. END;
  8031. END CopyLoop;
  8032. BEGIN
  8033. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8034. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8035. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8036. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8037. ELSE
  8038. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8039. p := AllocateTransposed(dest,left,Size);
  8040. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8041. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8042. dadr := SYSTEM.VAL( LONGINT, p ); linc0 := GetIncr( left, 0 );
  8043. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8044. WHILE (len0 > 0) DO
  8045. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8046. INC( dadr, dinc0 ); DEC( len0 );
  8047. END;
  8048. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8049. ladr := SYSTEM.VAL( LONGINT, p );
  8050. ELSE
  8051. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8052. END;
  8053. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8054. dadr := GetAdr( dest );
  8055. IF (Size = 4) & (transpose4 # NIL ) THEN
  8056. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8057. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8058. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8059. ELSE
  8060. WHILE (len0 > 0) DO
  8061. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8062. INC( dadr, dinc1 ); DEC( len0 );
  8063. END;
  8064. END;
  8065. END;
  8066. END Transpose;
  8067. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8068. BEGIN
  8069. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8070. RETURN RESULT
  8071. END "`";
  8072. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8073. BEGIN
  8074. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8075. RETURN RESULT
  8076. END "`";
  8077. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8078. BEGIN
  8079. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8080. RETURN RESULT
  8081. END "`";
  8082. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8083. BEGIN
  8084. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8085. RETURN RESULT
  8086. END "`";
  8087. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8088. BEGIN
  8089. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8090. RETURN RESULT
  8091. END "`";
  8092. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: LONGINT ): BOOLEAN;
  8093. VAR i: LONGINT;
  8094. BEGIN
  8095. FOR i := 0 TO rdim - 1 DO
  8096. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8097. END;
  8098. FOR i := 0 TO ldim - 1 DO
  8099. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8100. END;
  8101. RETURN TRUE;
  8102. END CheckTensorGeometry;
  8103. (*
  8104. PROCEDURE Zero(p: ANY; size: LONGINT);
  8105. VAR adr: LONGINT;
  8106. BEGIN
  8107. adr := SYSTEM.VAL(LONGINT,p);
  8108. WHILE(size>0) DO
  8109. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8110. END;
  8111. END Zero;
  8112. *)
  8113. PROCEDURE DoReshape*( VAR dest: LONGINT; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8114. VAR i, Size: LONGINT; ptr, data: ANY; new: LONGINT;
  8115. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8116. squeezingReshape: BOOLEAN;
  8117. PROCEDURE NewDescriptor;
  8118. BEGIN
  8119. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8120. END NewDescriptor;
  8121. (* Added by Alexey
  8122. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8123. *)
  8124. PROCEDURE SqueezingReshape(): BOOLEAN;
  8125. VAR
  8126. i, j, n: LONGINT;
  8127. BEGIN
  8128. IF oldDim > newDim THEN
  8129. i := 0; j := 0;
  8130. WHILE (i < oldDim) & (j < newDim) DO
  8131. n := GetLen(src,i);
  8132. IF n = shape[j] THEN INC(j); END;
  8133. INC(i);
  8134. END;
  8135. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8136. ELSE
  8137. squeezingReshape := FALSE;
  8138. END;
  8139. squeezingReshape := (i = oldDim) & (j = newDim);
  8140. RETURN squeezingReshape;
  8141. END SqueezingReshape;
  8142. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8143. PROCEDURE TargetContinuous(): BOOLEAN;
  8144. VAR
  8145. i, n: LONGINT;
  8146. continue: BOOLEAN;
  8147. BEGIN
  8148. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8149. continue := TRUE;
  8150. WHILE (i > 0) & continue DO
  8151. n := n * GetLen(dest,i);
  8152. DEC(i);
  8153. continue := GetIncr(dest,i) = n;
  8154. END;
  8155. (*TRACE(i,continue,Size,GetSize(dest));*)
  8156. (*tod obviously size is not what I expect it to be*)
  8157. IF (i = 0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8158. RETURN TRUE;
  8159. ELSE
  8160. RETURN FALSE;
  8161. END;
  8162. END TargetContinuous;
  8163. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8164. PROCEDURE PreservesContiguity(): BOOLEAN;
  8165. VAR
  8166. i, n: LONGINT;
  8167. continue: BOOLEAN;
  8168. BEGIN
  8169. i := oldDim-1; n := GetIncr(src,i);
  8170. continue := TRUE;
  8171. WHILE (i > 0) & continue DO
  8172. n := n * GetLen(src,i);
  8173. DEC(i);
  8174. continue := GetIncr(src,i) = n;
  8175. END;
  8176. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8177. RETURN TRUE;
  8178. ELSE Err("Not yet implemented!");
  8179. END;
  8180. END PreservesContiguity;
  8181. (* Added by Alexey *)
  8182. PROCEDURE NewDescriptorForSameData;
  8183. VAR len, size, i, j: LONGINT;
  8184. BEGIN
  8185. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8186. IF ~squeezingReshape THEN
  8187. size := Size;
  8188. FOR i := newDim - 1 TO 0 BY -1 DO
  8189. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8190. size := size * len;
  8191. END;
  8192. ELSE (* squeezing reshape *)
  8193. j := 0; len := shape[j];
  8194. FOR i := 0 TO oldDim-1 DO
  8195. IF GetLen(src,i) = len THEN
  8196. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8197. INC(j);
  8198. IF j < newDim THEN len := shape[j]; END;
  8199. END;
  8200. END;
  8201. END;
  8202. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8203. PutFlags(new,GetFlags(new)+{RangeFlag});
  8204. END;
  8205. PutAdr( new, GetAdr(src) );
  8206. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8207. PutSize( new, Size );
  8208. END NewDescriptorForSameData;
  8209. PROCEDURE NewData;
  8210. VAR len, size, i: LONGINT;
  8211. BEGIN
  8212. size := Size;
  8213. FOR i := newDim - 1 TO 0 BY -1 DO
  8214. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8215. size := size * len;
  8216. END;
  8217. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8218. PutAdr( new, data );
  8219. PutPtr( new, data ); PutDim( new, newDim );
  8220. PutSize( new, Size );
  8221. END NewData;
  8222. PROCEDURE CopyData;
  8223. VAR d, s, dadr: LONGINT;
  8224. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8225. VAR inc, len, i: LONGINT;
  8226. BEGIN
  8227. IF dim = d THEN
  8228. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8229. FOR i := 0 TO len - 1 DO
  8230. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8231. END;
  8232. ELSE
  8233. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8234. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8235. END;
  8236. END Loop;
  8237. BEGIN
  8238. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8239. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8240. s := s * GetLen( src, d ); DEC( d );
  8241. END;
  8242. IF d = -1 THEN (* special case: both continuous *)
  8243. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8244. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8245. END;
  8246. END CopyData;
  8247. PROCEDURE CopyDataBack;
  8248. VAR d, s: LONGINT; sadr: LONGINT;
  8249. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8250. VAR inc, len, i: LONGINT;
  8251. BEGIN
  8252. IF dim = d THEN
  8253. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8254. FOR i := 0 TO len - 1 DO
  8255. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8256. END;
  8257. ELSE
  8258. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8259. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8260. END;
  8261. END Loop;
  8262. BEGIN
  8263. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8264. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8265. s := s * GetLen( dest, d ); DEC( d );
  8266. END;
  8267. IF d = -1 THEN (* special case: both continuous *)
  8268. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8269. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8270. END;
  8271. END CopyDataBack;
  8272. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8273. BEGIN
  8274. ASSERT( GetDim( src ) = GetDim( dest ) );
  8275. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8276. END CopyDescriptor;
  8277. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8278. VAR i: LONGINT;
  8279. BEGIN
  8280. ASSERT(GetDim(dest) = newDim);
  8281. FOR i := 0 TO newDim - 1 DO
  8282. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8283. END;
  8284. RETURN FALSE;
  8285. END ShapeDiffers;
  8286. BEGIN
  8287. (*
  8288. cases
  8289. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8290. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8291. 3.) descriptor may not be reshaped: dest = RANGE
  8292. *)
  8293. (* first check invariants *)
  8294. oldDim := GetDim( src );
  8295. IF oldDim = 0 THEN oldSize := 0
  8296. ELSE
  8297. oldSize := 1;
  8298. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8299. END;
  8300. newDim := LEN( shape, 0 );
  8301. IF newDim = 0 THEN newSize := 0
  8302. ELSE
  8303. newSize := 1;
  8304. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8305. END;
  8306. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8307. Size := GetSize( src );
  8308. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8309. IF dest = src THEN (* added by Alexey *)
  8310. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8311. NewDescriptorForSameData;
  8312. dest := new;
  8313. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8314. (* create a copy of the original descriptor *)
  8315. ptr := GetArrayDesc(newDim); dest := SYSTEM.VAL(LONGINT,ptr); CopyDescriptor(src,dest);
  8316. ELSE
  8317. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8318. END;
  8319. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8320. NewDescriptor; NewData; CopyData; dest := new;
  8321. ELSIF TargetContinuous() THEN
  8322. NewDescriptor; new:=dest; CopyData;
  8323. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8324. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8325. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8326. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8327. END;
  8328. NewDescriptor; NewData; CopyData; dest := new;
  8329. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8330. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8331. NewDescriptor; NewData; CopyData; CopyDescriptor( new, dest );
  8332. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8333. NewDescriptor; NewData; CopyData; CopyDataBack;
  8334. ELSE (* same shape, just copy *)
  8335. CopyContent( src, dest, Size ); RETURN;
  8336. END;
  8337. END DoReshape;
  8338. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8339. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8340. PROCEDURE NewData;
  8341. VAR len, size, i: LONGINT;
  8342. BEGIN
  8343. size := elementSize;
  8344. FOR i := dim - 1 TO 0 BY -1 DO
  8345. len := a[i];
  8346. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8347. END;
  8348. IF tag = 0 THEN
  8349. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8350. PutAdr( dest, data );
  8351. ELSE
  8352. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8353. dest.adr := data;
  8354. INC(dest.adr, ArrDataArrayOffset);
  8355. END;
  8356. PutPtr( dest, data ); PutSize( dest, elementSize );
  8357. END NewData;
  8358. PROCEDURE ClearData;
  8359. (*! todo *)
  8360. END ClearData;
  8361. BEGIN
  8362. dim := LEN( a,0 );
  8363. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8364. IF dest # 0 THEN
  8365. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8366. END;
  8367. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8368. NewData;
  8369. ELSE
  8370. i := 0;
  8371. WHILE (i < dim) & same DO
  8372. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8373. INC( i );
  8374. END;
  8375. IF ~same THEN
  8376. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8377. NewData
  8378. ELSE ClearData
  8379. END;
  8380. END;
  8381. END AllocateTensorA;
  8382. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8383. BEGIN
  8384. AllocateTensorA(a,elementSize,tag,dest);
  8385. END AllocateArrayA;
  8386. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: LONGINT; tag: LONGINT );
  8387. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT; dest: ADDRESS;
  8388. PROCEDURE NewData;
  8389. VAR len, size, i: LONGINT;
  8390. BEGIN
  8391. size := Size;
  8392. FOR i := dim - 1 TO 0 BY -1 DO
  8393. len := a[i];
  8394. (*
  8395. KernelLog.Int(len,10); KernelLog.Ln;
  8396. *)
  8397. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8398. END;
  8399. IF tag = 0 THEN
  8400. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8401. PutAdr( dest, data );
  8402. ELSE
  8403. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8404. PutAdr( dest, data+ ArrDataArrayOffset );
  8405. END;
  8406. PutPtr( dest, data ); PutSize( dest, Size );
  8407. END NewData;
  8408. PROCEDURE ClearData;
  8409. (*! todo *)
  8410. END ClearData;
  8411. BEGIN
  8412. dim := LEN( a,0 );
  8413. dest := SYSTEM.VAL(ADDRESS,destA);
  8414. (*! check range flag! *)
  8415. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8416. IF dest # 0 THEN
  8417. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8418. END;
  8419. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8420. NewData;
  8421. ELSE
  8422. i := 0;
  8423. WHILE (i < dim) & same DO
  8424. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8425. INC( i );
  8426. END;
  8427. IF ~same THEN
  8428. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8429. NewData
  8430. ELSE ClearData
  8431. END;
  8432. END;
  8433. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8434. END AllocateTensorX;
  8435. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF LONGINT; src: ADDRESS );
  8436. VAR dim, i: LONGINT;
  8437. BEGIN
  8438. dim := GetDim( src );
  8439. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8440. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8441. END LenA;
  8442. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF LONGINT; src: ADDRESS );
  8443. VAR dim, i, len: LONGINT;
  8444. BEGIN
  8445. dim := GetDim( src ); len := LEN( dest, 0 );
  8446. IF len # dim THEN NEW( dest, dim ); END;
  8447. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8448. END IncrA;
  8449. PROCEDURE Len*(src: ADDRESS; d: LONGINT): LONGINT;
  8450. VAR dim: LONGINT;
  8451. BEGIN
  8452. dim := GetDim(src);
  8453. IF (d<0) OR (d>=dim) THEN HALT(100)
  8454. ELSE
  8455. RETURN GetLen(src,d);
  8456. END;
  8457. END Len;
  8458. PROCEDURE Incr*(src: ADDRESS; d: LONGINT): LONGINT;
  8459. VAR dim: LONGINT;
  8460. BEGIN
  8461. dim := GetDim(src);
  8462. IF (d<0) OR (d>=dim) THEN HALT(100)
  8463. ELSE
  8464. RETURN GetIncr(src,d);
  8465. END;
  8466. END Incr;
  8467. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8468. Size: LONGINT ): ANY;
  8469. VAR ldim, rdim: LONGINT; ptr, data: ANY;
  8470. PROCEDURE NewData;
  8471. VAR len, size, i: LONGINT;
  8472. BEGIN
  8473. size := 1;
  8474. FOR i := 0 TO ldim - 1 DO
  8475. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8476. END;
  8477. FOR i := 0 TO rdim - 1 DO
  8478. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8479. END;
  8480. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8481. (*
  8482. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8483. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8484. *)
  8485. size := Size;
  8486. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8487. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8488. END;
  8489. PutAdr( dest, data );
  8490. PutPtr( dest, data );
  8491. END NewData;
  8492. BEGIN
  8493. ldim := GetDim( left ); rdim := GetDim( right );
  8494. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8495. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8496. NewData(); RETURN ptr;
  8497. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8498. IF ~(TensorFlag IN GetFlags( dest )) &
  8499. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8500. HALT( 100 );
  8501. END;
  8502. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8503. NewData(); RETURN ptr;
  8504. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8505. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8506. HALT( 100 );
  8507. END;
  8508. NewData(); RETURN data;
  8509. END;
  8510. RETURN NIL;
  8511. END AllocateTensor;
  8512. (* 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 *)
  8513. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8514. VAR rdim, len, linc, ri: LONGINT );
  8515. (* geometric precondition: lengths must coincide *)
  8516. VAR ldim: LONGINT;
  8517. BEGIN
  8518. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8519. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8520. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8521. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8522. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8523. END;
  8524. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8525. DEC( ldim );
  8526. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8527. (GetIncr( right, rdim ) = len * ri) DO
  8528. len := len * GetLen( left, ldim );
  8529. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8530. DEC( ldim );
  8531. END;
  8532. INC( ldim ); INC( rdim );
  8533. IF debug THEN
  8534. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8535. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8536. END;
  8537. END FindPatternTensor;
  8538. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  8539. Loop: BinaryASALoop );
  8540. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8541. origdest: LONGINT; left, right, dest: ADDRESS;
  8542. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: LONGINT );
  8543. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8544. BEGIN
  8545. IF (ldim < lDim) THEN
  8546. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8547. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8548. WHILE (len > 0) DO
  8549. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8550. INC( dadr, dinc ); DEC( len );
  8551. END;
  8552. ELSIF (rdim # loopd) THEN
  8553. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8554. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8555. WHILE (len > 0) DO
  8556. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8557. INC( dadr, dinc ); DEC( len );
  8558. END;
  8559. ELSE
  8560. (*
  8561. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8562. KernelLog.Int(GetAdr(dest),10);
  8563. KernelLog.Int(GetAdr(dest)+clen,10);
  8564. KernelLog.Ln;
  8565. *)
  8566. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8567. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8568. END;
  8569. END Traverse;
  8570. BEGIN
  8571. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8572. (* check array lengths *)
  8573. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8574. p := AllocateTensor( dest, left, right, elementSize );
  8575. (*
  8576. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8577. p := AllocateTensor( left, right, dest, elementSize )
  8578. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8579. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8580. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8581. END;
  8582. (*! to be done: treat overlapping memory *)
  8583. END;
  8584. *)
  8585. (* debugging *)
  8586. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8587. (* check pattern: longest piece that can be done with a loop *)
  8588. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8589. (* run through dimensions *)
  8590. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8591. SYSTEM.PUT( d, dest );
  8592. END ApplyTensorAAAOp;
  8593. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8594. BEGIN
  8595. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8596. SIZEOF( SHORTINT ), MulASSSLoop );
  8597. RETURN RESULT
  8598. END "**";
  8599. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8600. BEGIN
  8601. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8602. SIZEOF( INTEGER ), MulAISILoop );
  8603. RETURN RESULT
  8604. END "**";
  8605. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8606. BEGIN
  8607. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8608. SIZEOF( LONGINT ), MulALSLLoop );
  8609. RETURN RESULT
  8610. END "**";
  8611. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8612. BEGIN
  8613. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8614. loopMulARSR );
  8615. RETURN RESULT
  8616. END "**";
  8617. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8618. BEGIN
  8619. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8620. SIZEOF( LONGREAL ), loopMulAXSX );
  8621. RETURN RESULT
  8622. END "**";
  8623. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8624. BEGIN
  8625. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8626. loopMulAZSZ );
  8627. RETURN RESULT
  8628. END "**";
  8629. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8630. BEGIN
  8631. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8632. loopMulALZSLZ );
  8633. RETURN RESULT
  8634. END "**";
  8635. PROCEDURE InitOptimization;
  8636. VAR p: PROCEDURE;
  8637. BEGIN
  8638. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8639. IF p # NIL THEN
  8640. p;
  8641. ELSE
  8642. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8643. END;
  8644. END InitOptimization;
  8645. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8646. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: ADDRESS;
  8647. BEGIN
  8648. IF src = 0 THEN
  8649. HALT(100);
  8650. ELSE
  8651. srcDim := GetDim(src);
  8652. destDim := srcDim - prefixIndices - suffixIndices;
  8653. (*
  8654. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8655. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8656. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8657. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8658. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8659. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8660. *)
  8661. destPtr := GetArrayDesc(destDim);
  8662. dest := SYSTEM.VAL(LONGINT,destPtr);
  8663. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8664. PutAdr(dest,GetAdr(src));
  8665. PutPtr(dest,GetPtr(src));
  8666. PutFlags(dest,GetFlags(src));
  8667. PutSize(dest,GetSize(src));
  8668. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8669. srcDim := i + prefixIndices + prefixRanges;
  8670. destDim := i + prefixRanges;
  8671. len := GetLen(src,srcDim);
  8672. incr := GetIncr(src,srcDim);
  8673. PutLen(dest,destDim,len);
  8674. PutInc(dest,destDim,incr);
  8675. END;
  8676. (*
  8677. Report("copy descriptor src",src);
  8678. Report("copy descriptor dest",dest);
  8679. *)
  8680. END;
  8681. END CopyDescriptor;
  8682. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8683. VAR dest: ARRAY [?] OF basetype
  8684. CONST src: ARRAY [?] OF basetype
  8685. CONST shape: ARRAY [*] OF LONGINT
  8686. *)
  8687. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8688. BEGIN
  8689. DoReshape(SYSTEM.VAL(LONGINT,RESULT), SYSTEM.VAL(LONGINT,left), right);
  8690. RETURN RESULT
  8691. END Reshape;
  8692. (* OLIVIER *)
  8693. (** creates a degenerated range from an integer.
  8694. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8695. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8696. **)
  8697. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8698. BEGIN RETURN (integer .. integer BY 1)
  8699. END RangeFromInteger;
  8700. (* OLIVIER *)
  8701. (** create an array with the same data but with more dimensions
  8702. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8703. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8704. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8705. e.g.:
  8706. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8707. performs the following type transformation:
  8708. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8709. **)
  8710. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8711. VAR
  8712. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8713. sourceADDRESS, targetADDRESS: LONGINT;
  8714. targetArrayDescriptor: ANY;
  8715. BEGIN
  8716. sourceADDRESS := SYSTEM.VAL(LONGINT, sourceArray);
  8717. targetDimensionality := LEN(keptDimensions, 0);
  8718. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8719. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8720. targetADDRESS := SYSTEM.VAL(LONGINT, RESULT);
  8721. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8722. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8723. PutFlags(targetADDRESS, {TensorFlag});
  8724. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8725. (* set increments and lengths *)
  8726. sourceIndex := 0;
  8727. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8728. IF keptDimensions[targetIndex] THEN
  8729. (* reuse length and increment from source array *)
  8730. ASSERT(sourceIndex < DIM(sourceArray));
  8731. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8732. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8733. INC(sourceIndex)
  8734. ELSE
  8735. (* set length = 1 and increment = 0 *)
  8736. PutLen(targetADDRESS, targetIndex, 1);
  8737. PutInc(targetADDRESS, targetIndex, 0);
  8738. END
  8739. END;
  8740. (* Report("expand dimensions: ", targetADDRESS); *)
  8741. RETURN RESULT
  8742. END ExpandDimensions;
  8743. (* index ranges *)
  8744. (* the length of a range, i.e. the number of indices that it stands for *)
  8745. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8746. VAR
  8747. temp, result: LONGINT;
  8748. BEGIN
  8749. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8750. (* invalid range *)
  8751. result := 0
  8752. ELSIF LAST(range) = MAX(LONGINT) THEN
  8753. (* open-ended range *)
  8754. result := MAX(LONGINT)
  8755. ELSE
  8756. temp := 1 + LAST(range) - FIRST(range);
  8757. result := temp DIV STEP(range);
  8758. IF (temp MOD STEP(range)) # 0 THEN
  8759. INC(result)
  8760. END
  8761. END;
  8762. RETURN result
  8763. END "LEN";
  8764. (* complex numbers *)
  8765. OPERATOR "+"*(CONST left, right: COMPLEX): COMPLEX;
  8766. VAR result: COMPLEX;
  8767. BEGIN
  8768. RE(result) := RE(left) + RE(right);
  8769. IM(result) := IM(left) + IM(right);
  8770. RETURN result
  8771. END "+";
  8772. OPERATOR "+"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8773. VAR result: LONGCOMPLEX;
  8774. BEGIN
  8775. RE(result) := RE(left) + RE(right);
  8776. IM(result) := IM(left) + IM(right);
  8777. RETURN result
  8778. END "+";
  8779. OPERATOR "-"*(CONST left, right: COMPLEX): COMPLEX;
  8780. VAR result: COMPLEX;
  8781. BEGIN
  8782. RE(result) := RE(left) - RE(right);
  8783. IM(result) := IM(left) - IM(right);
  8784. RETURN result
  8785. END "-";
  8786. OPERATOR "-"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8787. VAR result: LONGCOMPLEX;
  8788. BEGIN
  8789. RE(result) := RE(left) - RE(right);
  8790. IM(result) := IM(left) - IM(right);
  8791. RETURN result
  8792. END "-";
  8793. OPERATOR "*"*(CONST left, right: COMPLEX): COMPLEX;
  8794. VAR result: COMPLEX;
  8795. BEGIN
  8796. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8797. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8798. RETURN result
  8799. END "*";
  8800. OPERATOR "*"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8801. VAR result: LONGCOMPLEX;
  8802. BEGIN
  8803. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8804. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8805. RETURN result
  8806. END "*";
  8807. OPERATOR "/"*(CONST left, right: COMPLEX): COMPLEX;
  8808. VAR result: COMPLEX; iDivisor: REAL;
  8809. BEGIN
  8810. iDivisor := 1.0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8811. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8812. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8813. RETURN result
  8814. END "/";
  8815. OPERATOR "/"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8816. VAR result: LONGCOMPLEX; iDivisor: LONGREAL;
  8817. BEGIN
  8818. iDivisor := 1.0D0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8819. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8820. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8821. RETURN result
  8822. END "/";
  8823. OPERATOR "ABS"*(CONST arg: COMPLEX): REAL;
  8824. BEGIN RETURN Math.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8825. END "ABS";
  8826. OPERATOR "ABS"*(CONST arg: LONGCOMPLEX): LONGREAL;
  8827. BEGIN RETURN MathL.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8828. END "ABS";
  8829. OPERATOR "~"*(CONST left: COMPLEX): COMPLEX;
  8830. BEGIN
  8831. RETURN RE(left) - IM(left) * IMAG
  8832. END "~";
  8833. OPERATOR "~"*(CONST left: LONGCOMPLEX): LONGCOMPLEX;
  8834. BEGIN
  8835. RETURN RE(left) - IM(left) * IMAG
  8836. END "~";
  8837. OPERATOR "<="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8838. OPERATOR ">="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8839. OPERATOR "<"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8840. OPERATOR ">"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8841. OPERATOR "<="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8842. OPERATOR ">="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8843. OPERATOR "<"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8844. OPERATOR ">"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8845. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8846. BEGIN
  8847. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8848. RETURN RESULT;
  8849. END "ALL";
  8850. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8851. BEGIN
  8852. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8853. RETURN RESULT;
  8854. END "ALL";
  8855. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8856. BEGIN
  8857. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8858. RETURN RESULT;
  8859. END "ALL";
  8860. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8861. BEGIN
  8862. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8863. RETURN RESULT;
  8864. END "ALL";
  8865. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8866. BEGIN
  8867. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8868. RETURN RESULT;
  8869. END "ALL";
  8870. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8871. BEGIN
  8872. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8873. RETURN RESULT;
  8874. END "ALL";
  8875. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8876. BEGIN
  8877. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8878. RETURN RESULT;
  8879. END "ALL";
  8880. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8881. BEGIN
  8882. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8883. RETURN RESULT;
  8884. END "ALL";
  8885. BEGIN
  8886. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8887. END FoxArrayBase.
  8888. Compiler.Compile FoxArrayBase.Mod ~
  8889. SystemTools.ListModules