FoxArrayBase.Mod 335 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080
  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: ADDRESS );
  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 ): Tensor;
  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 := 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 # NIL 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 = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1316. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  1317. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest :=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. adr := p;
  1347. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1348. PutAdr( src, 0 );
  1349. PutPtr( src, NIL );
  1350. PutFlags( src, {} );
  1351. RETURN p;
  1352. END TempDescCopy;
  1353. (* used when arrays are passed by value *)
  1354. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: LONGINT );
  1355. VAR p: ANY;
  1356. BEGIN
  1357. ASSERT( src = dest );
  1358. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1359. CopyArray( dest, p, elementsize );
  1360. END CopyArraySelf;
  1361. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1362. VAR p: ANY; srcdim, destdim: LONGINT;
  1363. BEGIN
  1364. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1365. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1366. srcdim := GetDim(src);
  1367. destdim := GetDim(dest);
  1368. (*
  1369. Debugging.Stack("copy array");
  1370. *)
  1371. Report( "copy array source", src ); Report( "copy array des", dest );
  1372. HALT(100);
  1373. ELSIF src = dest THEN (* self copy *)
  1374. CopyArraySelf( dest, src, elementsize );
  1375. ELSE
  1376. p := AllocateSame( dest, src, elementsize );
  1377. CopyContent( dest, src, elementsize )
  1378. END;
  1379. END CopyArray;
  1380. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1381. BEGIN
  1382. dest := 0; CopyTensor( dest, src, elementsize );
  1383. END CopyTensorSelf;
  1384. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1385. elementsize: SIZE );
  1386. VAR p: ANY;
  1387. BEGIN
  1388. (* Report("dest",dest); Report("src",src); *)
  1389. IF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1390. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1391. CopyContent( dest, src, elementsize );
  1392. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1393. ELSE CopyContent( dest, src, elementsize )
  1394. END;
  1395. END CopyTensor;
  1396. (* copy descriptor of src to that of dest. If not existent then create.*)
  1397. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS);
  1398. VAR ptr: ANY; flags: SET;
  1399. PROCEDURE UseTypeDescriptor;
  1400. VAR tag: LONGINT; ptr: ANY;
  1401. BEGIN
  1402. SYSTEM.GET( src + Heaps.TypeDescOffset, tag ); Heaps.NewRec( ptr, tag, FALSE );
  1403. dest := SYSTEM.VAL( LONGINT, ptr );
  1404. END UseTypeDescriptor;
  1405. PROCEDURE CopyDescriptor;
  1406. BEGIN
  1407. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(ADDRESS) * GetDim( src ) *2 );
  1408. END CopyDescriptor;
  1409. BEGIN
  1410. (*
  1411. KernelLog.String("ShallowCopy called with ");
  1412. KernelLog.Int(src,10); KernelLog.Int(dest,10);
  1413. KernelLog.Ln;
  1414. Report( "scopy source", src ); Report( "scopy dest", dest );
  1415. *)
  1416. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1417. IF TensorFlag IN GetFlags( src ) THEN UseTypeDescriptor();
  1418. ELSE
  1419. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr ); (* ??? *)
  1420. END;
  1421. CopyDescriptor();
  1422. PutFlags(dest, {TensorFlag});
  1423. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1424. flags := GetFlags(dest);
  1425. (* check if re-allocation of descriptor is allowed *)
  1426. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1427. Halt(DimensionMismatch,src,0,dest);
  1428. END;
  1429. (* create a new descriptor!!! (added by Alexey) *)
  1430. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1431. CopyDescriptor();
  1432. PutFlags(dest, flags);
  1433. ELSE
  1434. flags := GetFlags(dest);
  1435. (* check if re-allocation of array data is allowed *)
  1436. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1437. Halt(AllocationForbidden,src,0,dest);
  1438. END;
  1439. CopyDescriptor();
  1440. PutFlags(dest, flags);
  1441. END;
  1442. END ShallowCopy;
  1443. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1444. BEGIN
  1445. IF debug THEN
  1446. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1447. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1448. END;
  1449. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1450. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(ADDRESS) * GetDim( src ) *2 ); (* lens and increments *)
  1451. END DescriptorCopy;
  1452. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1453. VAR s,d: ADDRESS;
  1454. BEGIN
  1455. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1456. ShallowCopy(d,s);
  1457. SYSTEM.PUT(ADDRESSOF(dest),d);
  1458. END ZeroCopy;
  1459. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1460. BEGIN
  1461. ZeroCopy(src, RESULT);
  1462. RETURN RESULT
  1463. END "ALIAS";
  1464. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1465. VAR dim: LONGINT;
  1466. BEGIN
  1467. dim := GetDim( l );
  1468. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1469. WHILE (dim > 0) DO
  1470. DEC( dim );
  1471. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1472. END;
  1473. RETURN TRUE;
  1474. END SameShape;
  1475. (*
  1476. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1477. (*
  1478. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1479. check if deep copy can be avoided and if so then do a shallow copy
  1480. *)
  1481. BEGIN
  1482. ASSERT( dest # 0 ); (* impossible *)
  1483. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1484. HALT( 100 );
  1485. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1486. (* must copy (and allocate) *)
  1487. CopyArray( dest, src, elementsize );
  1488. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1489. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1490. ELSE CopyContent( dest, src, elementsize )
  1491. END;
  1492. ELSE DescriptorCopy( src, dest )
  1493. END;
  1494. END ZeroCopyArray;
  1495. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1496. (*
  1497. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1498. check if deep copy can be avoided and if so then do a shallow copy
  1499. *)
  1500. BEGIN
  1501. IF debug THEN
  1502. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1503. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1504. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1505. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1506. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1507. END;
  1508. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1509. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1510. ELSE
  1511. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1512. END;
  1513. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1514. (* must copy (and allocate) *)
  1515. CopyTensor( dest, src, elementsize );
  1516. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1517. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1518. ELSE
  1519. HALT( 100 ); (* copy forbidden *)
  1520. END;
  1521. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1522. DescriptorCopy( src, dest );
  1523. ELSE
  1524. HALT( 100 ); (* different shapes: not allowed *)
  1525. END;
  1526. END ZeroCopyTensor;
  1527. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1528. VAR i: LONGINT;
  1529. BEGIN
  1530. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1531. CopyContent( dest, left, elementSize )
  1532. ELSE
  1533. IF debug THEN
  1534. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1535. KernelLog.Ln;
  1536. END;
  1537. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1538. FOR i := 0 TO dim - 1 DO
  1539. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1540. END;
  1541. END;
  1542. END ZeroCopy;
  1543. *)
  1544. (*** conversions ****)
  1545. (** SHORTINT -> INTEGER *)
  1546. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1547. BEGIN
  1548. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1549. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1550. DEC( len );
  1551. END;
  1552. END ConvertASAILoop;
  1553. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1554. BEGIN
  1555. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1556. RETURN RESULT
  1557. END "@Convert";
  1558. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1559. BEGIN
  1560. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1561. RETURN RESULT
  1562. END "LONG";
  1563. (** SHORTINT -> LONGINT *)
  1564. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1565. BEGIN
  1566. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1567. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1568. DEC( len );
  1569. END;
  1570. END ConvertLoopSL;
  1571. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1572. BEGIN
  1573. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1574. RETURN RESULT
  1575. END "@Convert";
  1576. (** SHORTINT -> REAL *)
  1577. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1578. VAR lval: SHORTINT; dval: REAL;
  1579. BEGIN
  1580. WHILE (len > 0) DO
  1581. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1582. INC( dadr, dinc ); DEC( len );
  1583. END;
  1584. END ConvertLoopSR;
  1585. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1586. BEGIN
  1587. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1588. RETURN RESULT
  1589. END "@Convert";
  1590. (** SHORTINT -> LONGREAL *)
  1591. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1592. VAR lval: SHORTINT; dval: LONGREAL;
  1593. BEGIN
  1594. WHILE (len > 0) DO
  1595. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1596. INC( dadr, dinc ); DEC( len );
  1597. END;
  1598. END ConvertLoopSX;
  1599. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1600. BEGIN
  1601. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1602. RETURN RESULT
  1603. END "@Convert";
  1604. (** INTEGER -> SHORTINT (SHORT) *)
  1605. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1606. VAR lval: INTEGER; dval: SHORTINT;
  1607. BEGIN
  1608. WHILE (len > 0) DO
  1609. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1610. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1611. END;
  1612. END ConvertLoopIS;
  1613. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1614. BEGIN
  1615. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1616. RETURN RESULT
  1617. END "@Convert";
  1618. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1619. BEGIN
  1620. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1621. RETURN RESULT
  1622. END "SHORT";
  1623. (** INTEGER -> LONGINT *)
  1624. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1625. BEGIN
  1626. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1627. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1628. DEC( len );
  1629. END;
  1630. END ConvertLoopIL;
  1631. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1632. BEGIN
  1633. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1634. RETURN RESULT
  1635. END "@Convert";
  1636. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1637. BEGIN
  1638. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1639. RETURN RESULT
  1640. END "LONG";
  1641. (** INTEGER -> REAL *)
  1642. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1643. VAR lval: INTEGER; dval: REAL;
  1644. BEGIN
  1645. WHILE (len > 0) DO
  1646. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1647. INC( dadr, dinc ); DEC( len );
  1648. END;
  1649. END ConvertLoopIR;
  1650. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1651. BEGIN
  1652. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1653. RETURN RESULT
  1654. END "@Convert";
  1655. (** INTEGER -> LONGREAL *)
  1656. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1657. VAR lval: INTEGER; dval: LONGREAL;
  1658. BEGIN
  1659. WHILE (len > 0) DO
  1660. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1661. INC( dadr, dinc ); DEC( len );
  1662. END;
  1663. END ConvertLoopIX;
  1664. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1665. BEGIN
  1666. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1667. RETURN RESULT
  1668. END "@Convert";
  1669. (** LONGINT -> INTEGER (SHORT) *)
  1670. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1671. VAR lval: LONGINT; dval: INTEGER;
  1672. BEGIN
  1673. WHILE (len > 0) DO
  1674. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1675. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1676. END;
  1677. END ConvertLoopLI;
  1678. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1679. BEGIN
  1680. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1681. RETURN RESULT
  1682. END "@Convert";
  1683. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1684. BEGIN
  1685. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1686. RETURN RESULT
  1687. END "SHORT";
  1688. (** LONGINT -> REAL *)
  1689. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1690. VAR lval: LONGINT; dval: REAL;
  1691. BEGIN
  1692. WHILE (len > 0) DO
  1693. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1694. INC( dadr, dinc ); DEC( len );
  1695. END;
  1696. END ConvertLoopLR;
  1697. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1698. BEGIN
  1699. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1700. RETURN RESULT
  1701. END "@Convert";
  1702. (** LONGINT -> LONGREAL *)
  1703. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1704. VAR lval: LONGINT; dval: LONGREAL;
  1705. BEGIN
  1706. WHILE (len > 0) DO
  1707. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1708. INC( dadr, dinc ); DEC( len );
  1709. END;
  1710. END ConvertLoopLX;
  1711. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1712. BEGIN
  1713. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1714. RETURN RESULT
  1715. END "@Convert";
  1716. (** REAL -> LONGINT (ENTIER) *)
  1717. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1718. VAR lval: REAL; dval: LONGINT;
  1719. BEGIN
  1720. WHILE (len > 0) DO
  1721. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1722. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1723. END;
  1724. END ConvertLoopRL;
  1725. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1726. BEGIN
  1727. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1728. RETURN RESULT
  1729. END "@Convert";
  1730. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1731. BEGIN
  1732. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1733. RETURN RESULT
  1734. END "ENTIER";
  1735. (** REAL -> LONGREAL *)
  1736. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1737. VAR lval: REAL; dval: LONGREAL;
  1738. BEGIN
  1739. WHILE (len > 0) DO
  1740. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1741. INC( dadr, dinc ); DEC( len );
  1742. END;
  1743. END ConvertLoopRX;
  1744. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1745. BEGIN
  1746. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1747. RETURN RESULT
  1748. END "@Convert";
  1749. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1750. BEGIN
  1751. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1752. RETURN RESULT
  1753. END "LONG";
  1754. (** LONGREAL -> REAL (SHORT) *)
  1755. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1756. VAR lval: LONGREAL; dval: REAL;
  1757. BEGIN
  1758. WHILE (len > 0) DO
  1759. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1760. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1761. END;
  1762. END ConvertLoopXR;
  1763. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1764. BEGIN
  1765. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1766. RETURN RESULT
  1767. END "@Convert";
  1768. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1769. BEGIN
  1770. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1771. RETURN RESULT
  1772. END "SHORT";
  1773. (** LONGREAL -> LONGINT (ENTIER) *)
  1774. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1775. VAR lval: LONGREAL; dval: LONGINT;
  1776. BEGIN
  1777. WHILE (len > 0) DO
  1778. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1779. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1780. END;
  1781. END ConvertLoopXL;
  1782. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1783. BEGIN
  1784. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1785. RETURN RESULT
  1786. END "@Convert";
  1787. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1788. BEGIN
  1789. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1790. RETURN RESULT
  1791. END "ENTIER";
  1792. (*** monadic not A -> ~A ********************************************************************)
  1793. (** BOOLEAN *)
  1794. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1795. VAR lval: BOOLEAN;
  1796. BEGIN
  1797. WHILE (len > 0) DO
  1798. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1799. DEC( len );
  1800. END;
  1801. END NotLoopAB;
  1802. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1803. BEGIN
  1804. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1805. RETURN RESULT
  1806. END "~";
  1807. (*** monadic generic (A) -> -A ********************************************************************)
  1808. (** SHORTINT *)
  1809. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1810. VAR lval: SHORTINT;
  1811. BEGIN
  1812. WHILE (len > 0) DO
  1813. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1814. DEC( len );
  1815. END;
  1816. END GenericLoopS;
  1817. (** INTEGER *)
  1818. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1819. VAR lval: INTEGER;
  1820. BEGIN
  1821. WHILE (len > 0) DO
  1822. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1823. DEC( len );
  1824. END;
  1825. END GenericLoopI;
  1826. (** LONGINT *)
  1827. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1828. VAR lval: LONGINT;
  1829. BEGIN
  1830. WHILE (len > 0) DO
  1831. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1832. DEC( len );
  1833. END;
  1834. END GenericLoopL;
  1835. (** HUGEINT *)
  1836. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1837. VAR lval: HUGEINT;
  1838. BEGIN
  1839. WHILE (len > 0) DO
  1840. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1841. DEC( len );
  1842. END;
  1843. END GenericLoopH;
  1844. (** REAL *)
  1845. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1846. VAR lval: REAL;
  1847. BEGIN
  1848. WHILE (len > 0) DO
  1849. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1850. DEC( len );
  1851. END;
  1852. END GenericLoopR;
  1853. (** LONGREAL *)
  1854. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1855. VAR lval: LONGREAL;
  1856. BEGIN
  1857. WHILE (len > 0) DO
  1858. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1859. DEC( len );
  1860. END;
  1861. END GenericLoopX;
  1862. (** COMPLEX *)
  1863. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1864. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1865. BEGIN
  1866. WHILE (len > 0) DO
  1867. lval := ladr;
  1868. dval := dadr;
  1869. dval.val := op(lval.val);
  1870. INC( ladr, linc ); INC( dadr, dinc );
  1871. DEC( len );
  1872. END;
  1873. END GenericLoopZ;
  1874. (** LONGCOMPLEX *)
  1875. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1876. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1877. BEGIN
  1878. WHILE (len > 0) DO
  1879. lval := ladr;
  1880. dval := dadr;
  1881. dval.val := op (lval.val);
  1882. INC( ladr, linc ); INC( dadr, dinc );
  1883. DEC( len );
  1884. END;
  1885. END GenericLoopLZ;
  1886. (*** monadic minus A -> -A ********************************************************************)
  1887. (** SHORTINT *)
  1888. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1889. VAR lval: SHORTINT;
  1890. BEGIN
  1891. WHILE (len > 0) DO
  1892. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1893. DEC( len );
  1894. END;
  1895. END MinusLoopS;
  1896. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1897. BEGIN
  1898. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1899. RETURN RESULT
  1900. END "-";
  1901. (** INTEGER *)
  1902. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1903. VAR lval: INTEGER;
  1904. BEGIN
  1905. WHILE (len > 0) DO
  1906. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1907. DEC( len );
  1908. END;
  1909. END MinusLoopI;
  1910. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1911. BEGIN
  1912. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1913. RETURN RESULT
  1914. END "-";
  1915. (** LONGINT *)
  1916. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1917. VAR lval: LONGINT;
  1918. BEGIN
  1919. WHILE (len > 0) DO
  1920. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1921. DEC( len );
  1922. END;
  1923. END MinusLoopL;
  1924. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1925. BEGIN
  1926. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1927. RETURN RESULT
  1928. END "-";
  1929. (** REAL *)
  1930. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1931. VAR lval: REAL;
  1932. BEGIN
  1933. WHILE (len > 0) DO
  1934. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1935. DEC( len );
  1936. END;
  1937. END MinusLoopR;
  1938. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1939. BEGIN
  1940. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1941. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1942. RETURN RESULT
  1943. END "-";
  1944. (** LONGREAL *)
  1945. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1946. VAR lval: LONGREAL;
  1947. BEGIN
  1948. WHILE (len > 0) DO
  1949. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1950. DEC( len );
  1951. END;
  1952. END MinusLoopX;
  1953. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1954. BEGIN
  1955. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1956. MinusLoopX );
  1957. RETURN RESULT
  1958. END "-";
  1959. (*** add array + array -> array ********************************************************************)
  1960. (** SHORTINT *)
  1961. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1962. VAR lval, rval: SHORTINT;
  1963. BEGIN
  1964. WHILE (len > 0) DO
  1965. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1966. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1967. END;
  1968. END AddASASLoop;
  1969. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1970. BEGIN
  1971. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1972. SIZEOF( SHORTINT ), AddASASLoop );
  1973. RETURN RESULT
  1974. END "+";
  1975. (** INTEGER *)
  1976. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1977. VAR lval, rval: INTEGER;
  1978. BEGIN
  1979. WHILE (len > 0) DO
  1980. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1981. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1982. END;
  1983. END AddAIAILoop;
  1984. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  1985. BEGIN
  1986. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1987. SIZEOF( INTEGER ), AddAIAILoop );
  1988. RETURN RESULT
  1989. END "+";
  1990. (** LONGINT *)
  1991. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1992. VAR lval, rval: LONGINT;
  1993. BEGIN
  1994. WHILE (len > 0) DO
  1995. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1996. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1997. END;
  1998. END AddALALLoop;
  1999. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2000. BEGIN
  2001. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2002. SIZEOF( LONGINT ), AddALALLoop );
  2003. RETURN RESULT
  2004. END "+";
  2005. (** REAL *)
  2006. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2007. VAR lval, rval: REAL;
  2008. BEGIN
  2009. WHILE (len > 0) DO
  2010. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2011. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2012. END;
  2013. END AddARARLoop;
  2014. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2015. BEGIN
  2016. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2017. loopAddARAR );
  2018. RETURN RESULT
  2019. END "+";
  2020. (** LONGREAL *)
  2021. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2022. VAR lval, rval: LONGREAL;
  2023. BEGIN
  2024. WHILE (len > 0) DO
  2025. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2026. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2027. END;
  2028. END AddAXAXLoop;
  2029. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2030. BEGIN
  2031. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2032. SIZEOF( LONGREAL ), loopAddAXAX );
  2033. RETURN RESULT
  2034. END "+";
  2035. (** COMPLEX *)
  2036. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2037. VAR lval, rval: COMPLEX;
  2038. BEGIN
  2039. WHILE (len > 0) DO
  2040. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2041. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2042. END;
  2043. END AddAZAZLoop;
  2044. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2045. BEGIN
  2046. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2047. SIZEOF( COMPLEX ), loopAddAZAZ );
  2048. RETURN RESULT
  2049. END "+";
  2050. (** LONGCOMPLEX *)
  2051. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2052. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2053. BEGIN
  2054. WHILE (len > 0) DO
  2055. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2056. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2057. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2058. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2059. DEC( len );
  2060. END;
  2061. END AddALZALZLoop;
  2062. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2063. BEGIN
  2064. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2065. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2066. RETURN RESULT
  2067. END "+";
  2068. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2069. (** SHORTINT *)
  2070. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2071. VAR lval, rval: SHORTINT;
  2072. BEGIN
  2073. SYSTEM.GET( radr, rval );
  2074. WHILE (len > 0) DO
  2075. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2076. INC( dadr, dinc ); DEC( len );
  2077. END;
  2078. END AddASSSLoop;
  2079. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2080. BEGIN
  2081. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2082. SIZEOF( SHORTINT ), AddASSSLoop );
  2083. RETURN RESULT
  2084. END "+";
  2085. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2086. BEGIN
  2087. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2088. SIZEOF( SHORTINT ), AddASSSLoop );
  2089. RETURN RESULT
  2090. END "+";
  2091. (** INTEGER *)
  2092. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2093. VAR lval, rval: INTEGER;
  2094. BEGIN
  2095. SYSTEM.GET( radr, rval );
  2096. WHILE (len > 0) DO
  2097. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2098. INC( dadr, dinc ); DEC( len );
  2099. END;
  2100. END AddAISILoop;
  2101. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2102. BEGIN
  2103. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2104. SIZEOF( INTEGER ), AddAISILoop );
  2105. RETURN RESULT
  2106. END "+";
  2107. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2108. BEGIN
  2109. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2110. SIZEOF( INTEGER ), AddAISILoop );
  2111. RETURN RESULT
  2112. END "+";
  2113. (** LONGINT *)
  2114. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2115. VAR lval, rval: LONGINT;
  2116. BEGIN
  2117. SYSTEM.GET( radr, rval );
  2118. WHILE (len > 0) DO
  2119. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2120. INC( dadr, dinc ); DEC( len );
  2121. END;
  2122. END AddALSLLoop;
  2123. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2124. BEGIN
  2125. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2126. SIZEOF( LONGINT ), AddALSLLoop );
  2127. RETURN RESULT
  2128. END "+";
  2129. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2130. BEGIN
  2131. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2132. SIZEOF( LONGINT ), AddALSLLoop );
  2133. RETURN RESULT
  2134. END "+";
  2135. (** REAL *)
  2136. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2137. VAR lval, rval: REAL;
  2138. BEGIN
  2139. SYSTEM.GET( radr, rval );
  2140. WHILE (len > 0) DO
  2141. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2142. INC( dadr, dinc ); DEC( len );
  2143. END;
  2144. END AddARSRLoop;
  2145. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2146. BEGIN
  2147. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2148. AddARSRLoop );
  2149. RETURN RESULT
  2150. END "+";
  2151. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2152. BEGIN
  2153. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2154. AddARSRLoop );
  2155. RETURN RESULT
  2156. END "+";
  2157. (** LONGREAL *)
  2158. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2159. VAR lval, rval: LONGREAL;
  2160. BEGIN
  2161. SYSTEM.GET( radr, rval );
  2162. WHILE (len > 0) DO
  2163. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2164. INC( dadr, dinc ); DEC( len );
  2165. END;
  2166. END AddAXSXLoop;
  2167. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2168. BEGIN
  2169. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2170. SIZEOF( LONGREAL ), AddAXSXLoop );
  2171. RETURN RESULT
  2172. END "+";
  2173. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2174. BEGIN
  2175. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2176. SIZEOF( LONGREAL ), AddAXSXLoop );
  2177. RETURN RESULT
  2178. END "+";
  2179. (** COMPLEX *)
  2180. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2181. VAR lval, rval: COMPLEX;
  2182. BEGIN
  2183. SYSTEM.GET( radr, rval );
  2184. WHILE (len > 0) DO
  2185. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2186. INC( dadr, dinc ); DEC( len );
  2187. END;
  2188. END AddAZSZLoop;
  2189. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2190. BEGIN
  2191. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2192. AddAZSZLoop );
  2193. RETURN RESULT
  2194. END "+";
  2195. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2196. BEGIN
  2197. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2198. AddAZSZLoop );
  2199. RETURN RESULT
  2200. END "+";
  2201. (** LONGCOMPLEX *)
  2202. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2203. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2204. BEGIN
  2205. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2206. WHILE (len > 0) DO
  2207. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2208. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2209. INC( ladr, linc );
  2210. INC( dadr, dinc ); DEC( len );
  2211. END;
  2212. END AddALZSLZLoop;
  2213. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2214. BEGIN
  2215. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2216. AddALZSLZLoop );
  2217. RETURN RESULT
  2218. END "+";
  2219. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2220. BEGIN
  2221. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2222. AddALZSLZLoop );
  2223. RETURN RESULT
  2224. END "+";
  2225. (*** subtraction array - array -> array ********************************************************************)
  2226. (** SHORTINT *)
  2227. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2228. VAR lval, rval: SHORTINT;
  2229. BEGIN
  2230. WHILE (len > 0) DO
  2231. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2232. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2233. END;
  2234. END SubASASLoop;
  2235. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2236. BEGIN
  2237. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2238. SIZEOF( SHORTINT ), SubASASLoop );
  2239. RETURN RESULT
  2240. END "-";
  2241. (** INTEGER *)
  2242. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2243. VAR lval, rval: INTEGER;
  2244. BEGIN
  2245. WHILE (len > 0) DO
  2246. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2247. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2248. END;
  2249. END SubAIAILoop;
  2250. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2251. BEGIN
  2252. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2253. SIZEOF( INTEGER ), SubAIAILoop );
  2254. RETURN RESULT
  2255. END "-";
  2256. (** LONGINT *)
  2257. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2258. VAR lval, rval: LONGINT;
  2259. BEGIN
  2260. WHILE (len > 0) DO
  2261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2262. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2263. END;
  2264. END SubALALLoop;
  2265. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2266. BEGIN
  2267. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2268. SIZEOF( LONGINT ), SubALALLoop );
  2269. RETURN RESULT
  2270. END "-";
  2271. (** REAL *)
  2272. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2273. VAR lval, rval: REAL;
  2274. BEGIN
  2275. WHILE (len > 0) DO
  2276. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2277. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2278. END;
  2279. END SubARARLoop;
  2280. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2281. BEGIN
  2282. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2283. SubARARLoop );
  2284. RETURN RESULT
  2285. END "-";
  2286. (** LONGREAL *)
  2287. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2288. VAR lval, rval: LONGREAL;
  2289. BEGIN
  2290. WHILE (len > 0) DO
  2291. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2292. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2293. END;
  2294. END SubAXAXLoop;
  2295. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2296. BEGIN
  2297. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2298. SIZEOF( LONGREAL ), SubAXAXLoop );
  2299. RETURN RESULT
  2300. END "-";
  2301. (** COMPLEX *)
  2302. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2303. VAR lval, rval: COMPLEX;
  2304. BEGIN
  2305. WHILE (len > 0) DO
  2306. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2307. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2308. END;
  2309. END SubAZAZLoop;
  2310. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2311. BEGIN
  2312. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2313. SIZEOF( COMPLEX ), SubAZAZLoop );
  2314. RETURN RESULT
  2315. END "-";
  2316. (** LONGCOMPLEX *)
  2317. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2318. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2319. BEGIN
  2320. WHILE (len > 0) DO
  2321. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2322. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2323. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2324. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2325. DEC( len );
  2326. END;
  2327. END SubALZALZLoop;
  2328. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2329. BEGIN
  2330. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2331. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2332. RETURN RESULT
  2333. END "-";
  2334. (*** subtraction array-scalar -> array ********************************************************************)
  2335. (** SHORTINT *)
  2336. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2337. BEGIN
  2338. RESULT := left + (-right);
  2339. RETURN RESULT
  2340. END "-";
  2341. (** INTEGER *)
  2342. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2343. BEGIN
  2344. RESULT := left + (-right);
  2345. RETURN RESULT
  2346. END "-";
  2347. (** LONGINT *)
  2348. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2349. BEGIN
  2350. RESULT := left + (-right);
  2351. RETURN RESULT
  2352. END "-";
  2353. (** REAL *)
  2354. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2355. BEGIN
  2356. RESULT := left + (-right);
  2357. RETURN RESULT
  2358. END "-";
  2359. (** LONGREAL *)
  2360. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2361. BEGIN
  2362. RESULT := left + (-right);
  2363. RETURN RESULT
  2364. END "-";
  2365. (** COMPLEX *)
  2366. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2367. BEGIN
  2368. RESULT := left + (-right);
  2369. RETURN RESULT
  2370. END "-";
  2371. (** LONGCOMPLEX *)
  2372. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2373. BEGIN
  2374. RESULT := left + (-right);
  2375. RETURN RESULT
  2376. END "-";
  2377. (*** subtraction scalar-array -> array ********************************************************************)
  2378. (** SHORTINT *)
  2379. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2380. VAR lval, rval, dval: SHORTINT;
  2381. BEGIN
  2382. SYSTEM.GET( radr, rval );
  2383. WHILE (len > 0) DO
  2384. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2385. INC( dadr, dinc ); DEC( len );
  2386. END;
  2387. END SubSSASLoop;
  2388. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2389. BEGIN
  2390. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2391. SIZEOF( SHORTINT ), SubSSASLoop );
  2392. RETURN RESULT
  2393. END "-";
  2394. (** INTEGER *)
  2395. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2396. VAR lval, rval, dval: INTEGER;
  2397. BEGIN
  2398. SYSTEM.GET( radr, rval );
  2399. WHILE (len > 0) DO
  2400. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2401. INC( dadr, dinc ); DEC( len );
  2402. END;
  2403. END SubSIAILoop;
  2404. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2405. BEGIN
  2406. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2407. SIZEOF( INTEGER ), SubSIAILoop );
  2408. RETURN RESULT
  2409. END "-";
  2410. (** LONGINT *)
  2411. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2412. VAR lval, rval, dval: LONGINT;
  2413. BEGIN
  2414. SYSTEM.GET( radr, rval );
  2415. WHILE (len > 0) DO
  2416. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2417. INC( dadr, dinc ); DEC( len );
  2418. END;
  2419. END SubSLALLoop;
  2420. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2421. BEGIN
  2422. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2423. SIZEOF( LONGINT ), SubSLALLoop );
  2424. RETURN RESULT
  2425. END "-";
  2426. (** REAL *)
  2427. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2428. VAR lval, rval, dval: REAL;
  2429. BEGIN
  2430. SYSTEM.GET( radr, rval );
  2431. WHILE (len > 0) DO
  2432. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2433. INC( dadr, dinc ); DEC( len );
  2434. END;
  2435. END SubSRARLoop;
  2436. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2437. BEGIN
  2438. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2439. SubSRARLoop );
  2440. RETURN RESULT
  2441. END "-";
  2442. (** LONGREAL *)
  2443. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2444. VAR lval, rval, dval: LONGREAL;
  2445. BEGIN
  2446. SYSTEM.GET( radr, rval );
  2447. WHILE (len > 0) DO
  2448. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2449. INC( dadr, dinc ); DEC( len );
  2450. END;
  2451. END SubSXAXLoop;
  2452. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2453. BEGIN
  2454. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2455. SIZEOF( LONGREAL ), SubSXAXLoop );
  2456. RETURN RESULT
  2457. END "-";
  2458. (** COMPLEX *)
  2459. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2460. VAR lval, rval, dval: COMPLEX;
  2461. BEGIN
  2462. SYSTEM.GET( radr, rval );
  2463. WHILE (len > 0) DO
  2464. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2465. INC( dadr, dinc ); DEC( len );
  2466. END;
  2467. END SubSZAZLoop;
  2468. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2469. BEGIN
  2470. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2471. SIZEOF( COMPLEX ), SubSZAZLoop );
  2472. RETURN RESULT
  2473. END "-";
  2474. (** LONGCOMPLEX *)
  2475. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2476. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2477. BEGIN
  2478. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2479. WHILE (len > 0) DO
  2480. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2481. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2482. INC( ladr, linc );
  2483. INC( dadr, dinc ); DEC( len );
  2484. END;
  2485. END SubSLZALZLoop;
  2486. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2487. BEGIN
  2488. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2489. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2490. RETURN RESULT
  2491. END "-";
  2492. (*** element-wise multiply array x array -> array ********************************************************************)
  2493. (** SHORTINT *)
  2494. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2495. VAR lval, rval: SHORTINT;
  2496. BEGIN
  2497. WHILE (len > 0) DO
  2498. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2499. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2500. END;
  2501. END EMulASASLoop;
  2502. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2503. BEGIN
  2504. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2505. SIZEOF( SHORTINT ), EMulASASLoop );
  2506. RETURN RESULT
  2507. END ".*";
  2508. (** INTEGER *)
  2509. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2510. VAR lval, rval: INTEGER; dval: INTEGER;
  2511. BEGIN
  2512. WHILE (len > 0) DO
  2513. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2514. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2515. DEC( len );
  2516. END;
  2517. END EMulAIAILoop;
  2518. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2519. BEGIN
  2520. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2521. SIZEOF( INTEGER ), EMulAIAILoop );
  2522. RETURN RESULT
  2523. END ".*";
  2524. (** LONGINT *)
  2525. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2526. VAR lval, rval: LONGINT;
  2527. BEGIN
  2528. WHILE (len > 0) DO
  2529. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2530. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2531. END;
  2532. END EMulALALLoop;
  2533. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2534. BEGIN
  2535. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2536. SIZEOF( LONGINT ), EMulALALLoop );
  2537. RETURN RESULT
  2538. END ".*";
  2539. (** REAL *)
  2540. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2541. VAR lval, rval: REAL;
  2542. BEGIN
  2543. WHILE (len > 0) DO
  2544. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2545. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2546. END;
  2547. END EMulARARLoop;
  2548. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2549. BEGIN
  2550. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2551. EMulARARLoop );
  2552. RETURN RESULT
  2553. END ".*";
  2554. (** LONGREAL *)
  2555. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2556. VAR lval, rval: LONGREAL;
  2557. BEGIN
  2558. WHILE (len > 0) DO
  2559. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2560. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2561. END;
  2562. END EMulAXAXLoop;
  2563. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2564. BEGIN
  2565. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2566. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2567. RETURN RESULT
  2568. END ".*";
  2569. (** COMPLEX *)
  2570. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2571. VAR lval, rval: COMPLEX;
  2572. BEGIN
  2573. WHILE (len > 0) DO
  2574. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2575. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2576. END;
  2577. END EMulAZAZLoop;
  2578. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2579. BEGIN
  2580. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2581. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2582. RETURN RESULT
  2583. END ".*";
  2584. (** LONGCOMPLEX *)
  2585. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2586. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2587. BEGIN
  2588. WHILE (len > 0) DO
  2589. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2590. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2591. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2592. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2593. DEC( len );
  2594. END;
  2595. END EMulALZALZLoop;
  2596. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2597. BEGIN
  2598. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2599. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2600. RETURN RESULT
  2601. END ".*";
  2602. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2603. (** SHORTINT *)
  2604. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2605. VAR lval, rval,dval: SHORTINT;
  2606. BEGIN
  2607. WHILE (len > 0) DO
  2608. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2609. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2610. END;
  2611. END EMulIncASASLoop;
  2612. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2613. BEGIN
  2614. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2615. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2616. END ".*+";
  2617. (** INTEGER *)
  2618. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2619. VAR lval, rval,dval: INTEGER;
  2620. BEGIN
  2621. WHILE (len > 0) DO
  2622. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2623. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2624. DEC( len );
  2625. END;
  2626. END EMulIncAIAILoop;
  2627. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2628. BEGIN
  2629. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2630. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2631. END ".*+";
  2632. (** LONGINT *)
  2633. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2634. VAR lval, rval,dval: LONGINT;
  2635. BEGIN
  2636. WHILE (len > 0) DO
  2637. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2638. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2639. END;
  2640. END EMulIncALALLoop;
  2641. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2642. BEGIN
  2643. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2644. SIZEOF( LONGINT ), EMulIncALALLoop );
  2645. END ".*+";
  2646. (** REAL *)
  2647. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2648. VAR lval, rval,dval: REAL;
  2649. BEGIN
  2650. WHILE (len > 0) DO
  2651. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2652. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2653. END;
  2654. END EMulIncARARLoop;
  2655. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2656. BEGIN
  2657. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2658. EMulIncARARLoop );
  2659. END ".*+";
  2660. (** LONGREAL *)
  2661. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2662. VAR lval, rval,dval: LONGREAL;
  2663. BEGIN
  2664. WHILE (len > 0) DO
  2665. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2666. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2667. END;
  2668. END EMulIncAXAXLoop;
  2669. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2670. BEGIN
  2671. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2672. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2673. END ".*+";
  2674. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2675. (** SHORTINT *)
  2676. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2677. VAR lval, rval: SHORTINT;
  2678. BEGIN
  2679. SYSTEM.GET( radr, rval );
  2680. WHILE (len > 0) DO
  2681. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2682. INC( dadr, dinc ); DEC( len );
  2683. END;
  2684. END MulASSSLoop;
  2685. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2686. BEGIN
  2687. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2688. SIZEOF( SHORTINT ), MulASSSLoop );
  2689. RETURN RESULT
  2690. END "*";
  2691. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2692. BEGIN
  2693. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2694. SIZEOF( SHORTINT ), MulASSSLoop );
  2695. RETURN RESULT
  2696. END "*";
  2697. (** INTEGER *)
  2698. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2699. VAR lval, rval: INTEGER;
  2700. BEGIN
  2701. SYSTEM.GET( radr, rval );
  2702. WHILE (len > 0) DO
  2703. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2704. INC( dadr, dinc ); DEC( len );
  2705. END;
  2706. END MulAISILoop;
  2707. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2708. BEGIN
  2709. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2710. SIZEOF( INTEGER ), MulAISILoop );
  2711. RETURN RESULT
  2712. END "*";
  2713. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2714. BEGIN
  2715. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2716. SIZEOF( INTEGER ), MulAISILoop );
  2717. RETURN RESULT
  2718. END "*";
  2719. (** LONGINT *)
  2720. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2721. VAR lval, rval: LONGINT;
  2722. BEGIN
  2723. SYSTEM.GET( radr, rval );
  2724. WHILE (len > 0) DO
  2725. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2726. INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END MulALSLLoop;
  2729. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2730. BEGIN
  2731. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2732. SIZEOF( LONGINT ), MulALSLLoop );
  2733. RETURN RESULT
  2734. END "*";
  2735. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2736. BEGIN
  2737. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2738. SIZEOF( LONGINT ), MulALSLLoop );
  2739. RETURN RESULT
  2740. END "*";
  2741. (** REAL *)
  2742. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2743. VAR lval, rval: REAL;
  2744. BEGIN
  2745. SYSTEM.GET( radr, rval );
  2746. WHILE (len > 0) DO
  2747. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2748. INC( dadr, dinc ); DEC( len );
  2749. END;
  2750. END MulARSRLoop;
  2751. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2752. BEGIN
  2753. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2754. loopMulARSR );
  2755. RETURN RESULT
  2756. END "*";
  2757. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2758. BEGIN
  2759. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2760. loopMulARSR );
  2761. RETURN RESULT
  2762. END "*";
  2763. (** LONGREAL *)
  2764. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2765. VAR lval, rval: LONGREAL;
  2766. BEGIN
  2767. IF debug THEN
  2768. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2769. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2770. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2771. END;
  2772. SYSTEM.GET( radr, rval );
  2773. WHILE (len > 0) DO
  2774. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2775. INC( dadr, dinc ); DEC( len );
  2776. END;
  2777. END MulAXSXLoop;
  2778. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2779. BEGIN
  2780. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2781. SIZEOF( LONGREAL ), loopMulAXSX );
  2782. RETURN RESULT
  2783. END "*";
  2784. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2785. BEGIN
  2786. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2787. SIZEOF( LONGREAL ), loopMulAXSX );
  2788. RETURN RESULT
  2789. END "*";
  2790. (** COMPLEX *)
  2791. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2792. VAR lval, rval: COMPLEX;
  2793. BEGIN
  2794. SYSTEM.GET( radr, rval );
  2795. WHILE (len > 0) DO
  2796. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2797. INC( dadr, dinc ); DEC( len );
  2798. END;
  2799. END MulAZSZLoop;
  2800. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2801. BEGIN
  2802. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2803. loopMulAZSZ );
  2804. RETURN RESULT
  2805. END "*";
  2806. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2807. BEGIN
  2808. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2809. loopMulAZSZ );
  2810. RETURN RESULT
  2811. END "*";
  2812. (** LONGCOMPLEX *)
  2813. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2814. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2815. BEGIN
  2816. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2817. WHILE (len > 0) DO
  2818. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2819. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2820. INC( ladr, linc );
  2821. INC( dadr, dinc ); DEC( len );
  2822. END;
  2823. END MulALZSLZLoop;
  2824. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2825. BEGIN
  2826. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2827. loopMulALZSLZ );
  2828. RETURN RESULT
  2829. END "*";
  2830. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2831. BEGIN
  2832. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2833. loopMulALZSLZ );
  2834. RETURN RESULT
  2835. END "*";
  2836. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2837. (** SHORTINT *)
  2838. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2839. VAR lval, rval, dval: SHORTINT;
  2840. BEGIN
  2841. SYSTEM.GET( radr, rval );
  2842. WHILE (len > 0) DO
  2843. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2844. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2845. END;
  2846. END IncMulASSSLoop;
  2847. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2848. BEGIN
  2849. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2850. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2851. END "IncMul";
  2852. OPERATOR "IncMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2853. BEGIN
  2854. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2855. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2856. RETURN RESULT
  2857. END "IncMul";
  2858. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2859. BEGIN
  2860. RESULT := -RESULT;
  2861. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2862. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2863. RESULT := -RESULT;
  2864. RETURN RESULT
  2865. END "DecMul";
  2866. OPERATOR "DecMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2867. BEGIN
  2868. RESULT := -RESULT;
  2869. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2870. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2871. RESULT := -RESULT;
  2872. RETURN RESULT
  2873. END "DecMul";
  2874. (** INTEGER *)
  2875. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2876. VAR lval, rval, dval: INTEGER;
  2877. BEGIN
  2878. SYSTEM.GET( radr, rval );
  2879. WHILE (len > 0) DO
  2880. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2881. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2882. END;
  2883. END IncMulAISILoop;
  2884. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2885. BEGIN
  2886. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2887. SIZEOF( INTEGER ), IncMulAISILoop );
  2888. RETURN RESULT
  2889. END "IncMul";
  2890. OPERATOR "IncMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2891. BEGIN
  2892. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2893. SIZEOF( INTEGER ), IncMulAISILoop );
  2894. RETURN RESULT
  2895. END "IncMul";
  2896. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2897. BEGIN
  2898. RESULT := -RESULT;
  2899. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2900. SIZEOF( INTEGER ), IncMulAISILoop );
  2901. RESULT := -RESULT;
  2902. RETURN RESULT
  2903. END "DecMul";
  2904. OPERATOR "DecMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2905. BEGIN
  2906. RESULT := -RESULT;
  2907. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2908. SIZEOF( INTEGER ), IncMulAISILoop );
  2909. RESULT := -RESULT;
  2910. RETURN RESULT
  2911. END "DecMul";
  2912. (** LONGINT *)
  2913. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2914. VAR lval, rval, dval: LONGINT;
  2915. BEGIN
  2916. SYSTEM.GET( radr, rval );
  2917. WHILE (len > 0) DO
  2918. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2919. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2920. END;
  2921. END IncMulALSLLoop;
  2922. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2923. BEGIN
  2924. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2925. SIZEOF( LONGINT ), IncMulALSLLoop );
  2926. RETURN RESULT
  2927. END "IncMul";
  2928. OPERATOR "IncMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2929. BEGIN
  2930. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2931. SIZEOF( LONGINT ), IncMulALSLLoop );
  2932. RETURN RESULT
  2933. END "IncMul";
  2934. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2935. BEGIN
  2936. RESULT := -RESULT;
  2937. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2938. SIZEOF( LONGINT ), IncMulALSLLoop );
  2939. RESULT := -RESULT;
  2940. RETURN RESULT
  2941. END "DecMul";
  2942. OPERATOR "DecMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2943. BEGIN
  2944. RESULT := -RESULT;
  2945. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2946. SIZEOF( LONGINT ), IncMulALSLLoop );
  2947. RESULT := -RESULT;
  2948. RETURN RESULT
  2949. END "DecMul";
  2950. (** REAL *)
  2951. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2952. VAR lval, rval, dval: REAL;
  2953. BEGIN
  2954. SYSTEM.GET( radr, rval );
  2955. WHILE (len > 0) DO
  2956. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2957. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2958. END;
  2959. END IncMulARSRLoop;
  2960. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2961. BEGIN
  2962. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2963. loopIncMulARSR );
  2964. RETURN RESULT
  2965. END "IncMul";
  2966. OPERATOR "IncMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2967. BEGIN
  2968. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2969. loopIncMulARSR );
  2970. RETURN RESULT
  2971. END "IncMul";
  2972. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2973. BEGIN
  2974. RESULT := -RESULT;
  2975. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2976. loopIncMulARSR );
  2977. RESULT := -RESULT;
  2978. RETURN RESULT
  2979. END "DecMul";
  2980. OPERATOR "DecMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2981. BEGIN
  2982. RESULT := -RESULT;
  2983. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2984. loopIncMulARSR );
  2985. RESULT := -RESULT;
  2986. RETURN RESULT
  2987. END "DecMul";
  2988. (** LONGREAL *)
  2989. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2990. VAR lval, rval, dval: LONGREAL;
  2991. BEGIN
  2992. IF debug THEN
  2993. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2994. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2995. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2996. END;
  2997. SYSTEM.GET( radr, rval );
  2998. WHILE (len > 0) DO
  2999. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3000. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3001. END;
  3002. END IncMulAXSXLoop;
  3003. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3004. BEGIN
  3005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3006. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3007. RETURN RESULT
  3008. END "IncMul";
  3009. OPERATOR "IncMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3010. BEGIN
  3011. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3012. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3013. RETURN RESULT
  3014. END "IncMul";
  3015. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3016. BEGIN
  3017. RESULT := -RESULT;
  3018. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3019. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3020. RESULT := -RESULT;
  3021. RETURN RESULT
  3022. END "DecMul";
  3023. OPERATOR "DecMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3024. BEGIN
  3025. RESULT := -RESULT;
  3026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3027. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3028. RESULT := -RESULT;
  3029. RETURN RESULT
  3030. END "DecMul";
  3031. (*** element-wise division array / array -> array ********************************************************************)
  3032. (** SHORTINT *)
  3033. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3034. VAR lval, rval: SHORTINT; dval: REAL;
  3035. BEGIN
  3036. WHILE (len > 0) DO
  3037. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3038. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3039. DEC( len );
  3040. END;
  3041. END EDivideASASLoop;
  3042. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3043. BEGIN
  3044. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3045. EDivideASASLoop );
  3046. RETURN RESULT
  3047. END "./";
  3048. (** INTEGER *)
  3049. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3050. VAR lval, rval: INTEGER; dval: REAL;
  3051. BEGIN
  3052. WHILE (len > 0) DO
  3053. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3054. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3055. DEC( len );
  3056. END;
  3057. END EDivideAIAILoop;
  3058. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3059. BEGIN
  3060. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3061. EDivideAIAILoop );
  3062. RETURN RESULT
  3063. END "./";
  3064. (** LONGINT *)
  3065. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3066. VAR lval, rval: LONGINT; dval: REAL;
  3067. BEGIN
  3068. WHILE (len > 0) DO
  3069. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3070. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3071. DEC( len );
  3072. END;
  3073. END EDivideALALLoop;
  3074. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3075. BEGIN
  3076. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3077. EDivideALALLoop );
  3078. RETURN RESULT
  3079. END "./";
  3080. (** REAL *)
  3081. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3082. VAR lval, rval: REAL; dval: REAL;
  3083. BEGIN
  3084. WHILE (len > 0) DO
  3085. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3086. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3087. DEC( len );
  3088. END;
  3089. END EDivideARARLoop;
  3090. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3091. BEGIN
  3092. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3093. EDivideARARLoop );
  3094. RETURN RESULT
  3095. END "./";
  3096. (** LONGREAL *)
  3097. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3098. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3099. BEGIN
  3100. WHILE (len > 0) DO
  3101. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3102. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3103. DEC( len );
  3104. END;
  3105. END EDivideAXAXLoop;
  3106. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3107. BEGIN
  3108. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3109. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3110. RETURN RESULT
  3111. END "./";
  3112. (** COMPLEX *)
  3113. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3114. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3115. BEGIN
  3116. WHILE (len > 0) DO
  3117. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3118. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3119. DEC( len );
  3120. END;
  3121. END EDivideAZAZLoop;
  3122. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3123. BEGIN
  3124. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3125. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3126. RETURN RESULT
  3127. END "./";
  3128. (** LONGCOMPLEX *)
  3129. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3130. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3131. BEGIN
  3132. WHILE (len > 0) DO
  3133. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3134. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3135. IF rvalIm # 0.0D0 THEN
  3136. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3137. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3138. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3139. ELSE
  3140. dvalRe := lvalRe/rvalRe;
  3141. dvalIm := lvalIm/rvalRe;
  3142. END;
  3143. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3144. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3145. DEC( len );
  3146. END;
  3147. END EDivideALZALZLoop;
  3148. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3149. BEGIN
  3150. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3151. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3152. RETURN RESULT
  3153. END "./";
  3154. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3155. (** SHORTINT *)
  3156. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3157. VAR lval, rval: SHORTINT; dval: REAL;
  3158. BEGIN
  3159. SYSTEM.GET( radr, rval );
  3160. WHILE (len > 0) DO
  3161. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3162. INC( dadr, dinc ); DEC( len );
  3163. END;
  3164. END DivideASSSLoop;
  3165. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3166. BEGIN
  3167. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3168. DivideASSSLoop );
  3169. RETURN RESULT
  3170. END "/";
  3171. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3172. VAR lval, rval: SHORTINT; dval: REAL;
  3173. BEGIN
  3174. SYSTEM.GET( radr, rval );
  3175. WHILE (len > 0) DO
  3176. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3177. INC( dadr, dinc ); DEC( len );
  3178. END;
  3179. END DivideSSASLoop;
  3180. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3181. BEGIN
  3182. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3183. DivideSSASLoop );
  3184. RETURN RESULT
  3185. END "/";
  3186. (** INTEGER *)
  3187. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3188. VAR lval, rval: INTEGER; dval: REAL;
  3189. BEGIN
  3190. SYSTEM.GET( radr, rval );
  3191. WHILE (len > 0) DO
  3192. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3193. INC( dadr, dinc ); DEC( len );
  3194. END;
  3195. END DivideAISILoop;
  3196. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3197. BEGIN
  3198. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3199. DivideAISILoop );
  3200. RETURN RESULT
  3201. END "/";
  3202. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3203. VAR lval, rval: INTEGER; dval: REAL;
  3204. BEGIN
  3205. SYSTEM.GET( radr, rval );
  3206. WHILE (len > 0) DO
  3207. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3208. INC( dadr, dinc ); DEC( len );
  3209. END;
  3210. END DivideSIAILoop;
  3211. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3212. BEGIN
  3213. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3214. DivideSIAILoop );
  3215. RETURN RESULT
  3216. END "/";
  3217. (** LONGINT *)
  3218. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3219. VAR lval, rval: LONGINT; dval: REAL;
  3220. BEGIN
  3221. SYSTEM.GET( radr, rval );
  3222. WHILE (len > 0) DO
  3223. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3224. INC( dadr, dinc ); DEC( len );
  3225. END;
  3226. END DivideALSLLoop;
  3227. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3228. BEGIN
  3229. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3230. DivideALSLLoop );
  3231. RETURN RESULT
  3232. END "/";
  3233. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3234. VAR lval, rval: LONGINT; dval: REAL;
  3235. BEGIN
  3236. SYSTEM.GET( radr, rval );
  3237. WHILE (len > 0) DO
  3238. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3239. INC( dadr, dinc ); DEC( len );
  3240. END;
  3241. END DivideSLALLoop;
  3242. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3243. BEGIN
  3244. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3245. DivideSLALLoop );
  3246. RETURN RESULT
  3247. END "/";
  3248. (** REAL *)
  3249. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3250. VAR lval, rval: REAL; dval: REAL;
  3251. BEGIN
  3252. SYSTEM.GET( radr, rval );
  3253. WHILE (len > 0) DO
  3254. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3255. INC( dadr, dinc ); DEC( len );
  3256. END;
  3257. END DivideARSRLoop;
  3258. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3259. BEGIN
  3260. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3261. DivideARSRLoop );
  3262. RETURN RESULT
  3263. END "/";
  3264. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3265. VAR lval, rval: REAL; dval: REAL;
  3266. BEGIN
  3267. SYSTEM.GET( radr, rval );
  3268. WHILE (len > 0) DO
  3269. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3270. INC( dadr, dinc ); DEC( len );
  3271. END;
  3272. END DivideSRARLoop;
  3273. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3274. BEGIN
  3275. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3276. DivideSRARLoop );
  3277. RETURN RESULT
  3278. END "/";
  3279. (** LONGREAL *)
  3280. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3281. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3282. BEGIN
  3283. SYSTEM.GET( radr, rval );
  3284. WHILE (len > 0) DO
  3285. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3286. INC( dadr, dinc ); DEC( len );
  3287. END;
  3288. END DivideAXSXLoop;
  3289. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3290. BEGIN
  3291. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3292. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3293. RETURN RESULT
  3294. END "/";
  3295. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3296. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3297. BEGIN
  3298. SYSTEM.GET( radr, rval );
  3299. WHILE (len > 0) DO
  3300. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3301. INC( dadr, dinc ); DEC( len );
  3302. END;
  3303. END DivideSXAXLoop;
  3304. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3305. BEGIN
  3306. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3307. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3308. RETURN RESULT
  3309. END "/";
  3310. (** COMPLEX *)
  3311. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3312. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3313. BEGIN
  3314. SYSTEM.GET( radr, rval );
  3315. WHILE (len > 0) DO
  3316. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3317. INC( dadr, dinc ); DEC( len );
  3318. END;
  3319. END DivideAZSZLoop;
  3320. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3321. BEGIN
  3322. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3323. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3324. RETURN RESULT
  3325. END "/";
  3326. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3327. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3328. BEGIN
  3329. SYSTEM.GET( radr, rval );
  3330. WHILE (len > 0) DO
  3331. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3332. INC( dadr, dinc ); DEC( len );
  3333. END;
  3334. END DivideSZAZLoop;
  3335. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3336. BEGIN
  3337. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3338. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3339. RETURN RESULT
  3340. END "/";
  3341. (** LONGCOMPLEX *)
  3342. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3343. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3344. BEGIN
  3345. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3346. IF rvalIm # 0.0D0 THEN
  3347. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3348. WHILE (len > 0) DO
  3349. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3350. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3351. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3352. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3353. INC( ladr, linc );
  3354. INC( dadr, dinc ); DEC( len );
  3355. END;
  3356. ELSE
  3357. WHILE (len > 0) DO
  3358. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3359. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3360. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3361. INC( ladr, linc );
  3362. INC( dadr, dinc ); DEC( len );
  3363. END;
  3364. END;
  3365. END DivideALZSLZLoop;
  3366. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3367. BEGIN
  3368. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3369. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3370. RETURN RESULT
  3371. END "/";
  3372. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3373. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3374. BEGIN
  3375. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3376. WHILE (len > 0) DO
  3377. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3378. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3379. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3380. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3381. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3382. INC( ladr, linc );
  3383. INC( dadr, dinc ); DEC( len );
  3384. END;
  3385. END DivideSLZALZLoop;
  3386. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3387. BEGIN
  3388. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3389. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3390. RETURN RESULT
  3391. END "/";
  3392. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3393. (** SHORTINT *)
  3394. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3395. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3396. BEGIN
  3397. WHILE (len > 0) DO
  3398. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3399. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3400. DEC( len );
  3401. END;
  3402. END EDivASASLoop;
  3403. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3404. BEGIN
  3405. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3406. SIZEOF( SHORTINT ), EDivASASLoop );
  3407. RETURN RESULT
  3408. END "DIV";
  3409. (** INTEGER *)
  3410. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3411. VAR lval, rval: INTEGER; dval: INTEGER;
  3412. BEGIN
  3413. WHILE (len > 0) DO
  3414. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3415. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3416. DEC( len );
  3417. END;
  3418. END EDivAIAILoop;
  3419. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3420. BEGIN
  3421. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3422. SIZEOF( INTEGER ), EDivAIAILoop );
  3423. RETURN RESULT
  3424. END "DIV";
  3425. (** LONGINT *)
  3426. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3427. VAR lval, rval: LONGINT; dval: LONGINT;
  3428. BEGIN
  3429. WHILE (len > 0) DO
  3430. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3431. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3432. DEC( len );
  3433. END;
  3434. END EDivALALLoop;
  3435. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3436. BEGIN
  3437. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3438. SIZEOF( LONGINT ), EDivALALLoop );
  3439. RETURN RESULT
  3440. END "DIV";
  3441. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3442. (** SHORTINT *)
  3443. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3444. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3445. BEGIN
  3446. SYSTEM.GET( radr, rval );
  3447. WHILE (len > 0) DO
  3448. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3449. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3450. END;
  3451. END DivASSSLoop;
  3452. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3453. BEGIN
  3454. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3455. SIZEOF( SHORTINT ), DivASSSLoop );
  3456. RETURN RESULT
  3457. END "DIV";
  3458. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3459. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3460. BEGIN
  3461. SYSTEM.GET( radr, rval );
  3462. WHILE (len > 0) DO
  3463. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3464. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3465. END;
  3466. END DivSSASLoop;
  3467. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3468. BEGIN
  3469. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3470. SIZEOF( SHORTINT ), DivSSASLoop );
  3471. RETURN RESULT
  3472. END "DIV";
  3473. (** INTEGER *)
  3474. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3475. VAR lval, rval: INTEGER; dval: INTEGER;
  3476. BEGIN
  3477. SYSTEM.GET( radr, rval );
  3478. WHILE (len > 0) DO
  3479. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3480. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3481. END;
  3482. END DivAISILoop;
  3483. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3484. BEGIN
  3485. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3486. SIZEOF( INTEGER ), DivAISILoop );
  3487. RETURN RESULT
  3488. END "DIV";
  3489. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3490. VAR lval, rval: INTEGER; dval: INTEGER;
  3491. BEGIN
  3492. SYSTEM.GET( radr, rval );
  3493. WHILE (len > 0) DO
  3494. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3495. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3496. END;
  3497. END DivSIAILoop;
  3498. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3499. BEGIN
  3500. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3501. SIZEOF( INTEGER ), DivSIAILoop );
  3502. RETURN RESULT
  3503. END "DIV";
  3504. (** LONGINT *)
  3505. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3506. VAR lval, rval: LONGINT; dval: LONGINT;
  3507. BEGIN
  3508. SYSTEM.GET( radr, rval );
  3509. WHILE (len > 0) DO
  3510. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3511. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3512. END;
  3513. END DivALSLLoop;
  3514. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3515. BEGIN
  3516. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3517. SIZEOF( LONGINT ), DivALSLLoop );
  3518. RETURN RESULT
  3519. END "DIV";
  3520. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3521. VAR lval, rval: LONGINT; dval: LONGINT;
  3522. BEGIN
  3523. SYSTEM.GET( radr, rval );
  3524. WHILE (len > 0) DO
  3525. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3526. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3527. END;
  3528. END DivSLALLoop;
  3529. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3530. BEGIN
  3531. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3532. SIZEOF( LONGINT ), DivSLALLoop );
  3533. RETURN RESULT
  3534. END "DIV";
  3535. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3536. (** SHORTINT *)
  3537. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3538. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3539. BEGIN
  3540. WHILE (len > 0) DO
  3541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3542. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3543. DEC( len );
  3544. END;
  3545. END EModASASLoop;
  3546. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3547. BEGIN
  3548. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3549. SIZEOF( SHORTINT ), EModASASLoop );
  3550. RETURN RESULT
  3551. END "MOD";
  3552. (** INTEGER *)
  3553. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3554. VAR lval, rval: INTEGER; dval: INTEGER;
  3555. BEGIN
  3556. WHILE (len > 0) DO
  3557. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3558. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3559. DEC( len );
  3560. END;
  3561. END EModAIAILoop;
  3562. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3563. BEGIN
  3564. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3565. SIZEOF( INTEGER ), EModAIAILoop );
  3566. RETURN RESULT
  3567. END "MOD";
  3568. (** LONGINT *)
  3569. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3570. VAR lval, rval: LONGINT; dval: LONGINT;
  3571. BEGIN
  3572. WHILE (len > 0) DO
  3573. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3574. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3575. DEC( len );
  3576. END;
  3577. END EModALALLoop;
  3578. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3579. BEGIN
  3580. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3581. SIZEOF( LONGINT ), EModALALLoop );
  3582. RETURN RESULT
  3583. END "MOD";
  3584. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3585. (** SHORTINT *)
  3586. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3587. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3588. BEGIN
  3589. SYSTEM.GET( radr, rval );
  3590. WHILE (len > 0) DO
  3591. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3592. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3593. END;
  3594. END ModASSSLoop;
  3595. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3596. BEGIN
  3597. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3598. SIZEOF( SHORTINT ), ModASSSLoop );
  3599. RETURN RESULT
  3600. END "MOD";
  3601. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3602. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3603. BEGIN
  3604. SYSTEM.GET( radr, rval );
  3605. WHILE (len > 0) DO
  3606. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3607. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3608. END;
  3609. END ModSSASLoop;
  3610. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3611. BEGIN
  3612. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3613. SIZEOF( SHORTINT ), ModSSASLoop );
  3614. RETURN RESULT
  3615. END "MOD";
  3616. (** INTEGER *)
  3617. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3618. VAR lval, rval: INTEGER; dval: INTEGER;
  3619. BEGIN
  3620. SYSTEM.GET( radr, rval );
  3621. WHILE (len > 0) DO
  3622. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3623. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3624. END;
  3625. END ModAISILoop;
  3626. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3627. BEGIN
  3628. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3629. SIZEOF( INTEGER ), ModAISILoop );
  3630. RETURN RESULT
  3631. END "MOD";
  3632. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3633. VAR lval, rval: INTEGER; dval: INTEGER;
  3634. BEGIN
  3635. SYSTEM.GET( radr, rval );
  3636. WHILE (len > 0) DO
  3637. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3638. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3639. END;
  3640. END ModSIAILoop;
  3641. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3642. BEGIN
  3643. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3644. SIZEOF( INTEGER ), ModSIAILoop );
  3645. RETURN RESULT
  3646. END "MOD";
  3647. (** LONGINT *)
  3648. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3649. VAR lval, rval: LONGINT; dval: LONGINT;
  3650. BEGIN
  3651. SYSTEM.GET( radr, rval );
  3652. WHILE (len > 0) DO
  3653. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3654. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3655. END;
  3656. END ModALSLLoop;
  3657. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3658. BEGIN
  3659. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3660. SIZEOF( LONGINT ), ModALSLLoop );
  3661. RETURN RESULT
  3662. END "MOD";
  3663. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3664. VAR lval, rval: LONGINT; dval: LONGINT;
  3665. BEGIN
  3666. SYSTEM.GET( radr, rval );
  3667. WHILE (len > 0) DO
  3668. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3669. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3670. END;
  3671. END ModSLALLoop;
  3672. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3673. BEGIN
  3674. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3675. SIZEOF( LONGINT ), ModSLALLoop );
  3676. RETURN RESULT
  3677. END "MOD";
  3678. (*** scalar product <array,array> -> scalar ********************************************************************)
  3679. (** SHORTINT *)
  3680. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3681. VAR lval, rval: SHORTINT; dval: LONGINT;
  3682. BEGIN
  3683. SYSTEM.GET( dadr, dval );
  3684. WHILE (len > 0) DO
  3685. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3686. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3687. END;
  3688. SYSTEM.PUT( dadr, dval );
  3689. END SPASASLoop;
  3690. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3691. VAR dest: LONGINT;
  3692. BEGIN
  3693. dest := 0;
  3694. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3695. RETURN dest;
  3696. END "+*";
  3697. (** INTEGER *)
  3698. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3699. VAR lval, rval: INTEGER; dval: LONGINT;
  3700. BEGIN
  3701. SYSTEM.GET( dadr, dval );
  3702. WHILE (len > 0) DO
  3703. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3704. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3705. END;
  3706. SYSTEM.PUT( dadr, dval );
  3707. END SPAIAILoop;
  3708. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3709. VAR dest: LONGINT;
  3710. BEGIN
  3711. dest := 0;
  3712. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3713. RETURN dest;
  3714. END "+*";
  3715. (** LONGINT *)
  3716. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3717. VAR lval, rval: LONGINT; dval: LONGINT;
  3718. BEGIN
  3719. SYSTEM.GET( dadr, dval );
  3720. WHILE (len > 0) DO
  3721. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3722. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3723. END;
  3724. SYSTEM.PUT( dadr, dval );
  3725. END SPALALLoop;
  3726. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3727. VAR dest: LONGINT;
  3728. BEGIN
  3729. dest := 0;
  3730. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3731. RETURN dest;
  3732. END "+*";
  3733. (** REAL *)
  3734. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3735. VAR lval, rval: REAL; dval: REAL;
  3736. BEGIN
  3737. SYSTEM.GET( dadr, dval );
  3738. WHILE (len > 0) DO
  3739. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3740. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3741. END;
  3742. SYSTEM.PUT( dadr, dval );
  3743. END SPARARLoop;
  3744. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3745. VAR dest: REAL;
  3746. BEGIN
  3747. dest := 0;
  3748. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3749. RETURN dest;
  3750. END "+*";
  3751. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3752. VAR lval, rval, dval: LONGREAL;
  3753. BEGIN
  3754. IF debug THEN
  3755. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3756. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3757. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3758. END;
  3759. SYSTEM.GET( dadr, dval );
  3760. WHILE (len > 0) DO
  3761. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3762. dval := dval + rval * lval; DEC( len );
  3763. END;
  3764. SYSTEM.PUT( dadr, dval );
  3765. END SPAXAXLoop;
  3766. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3767. VAR dest: LONGREAL;
  3768. BEGIN
  3769. dest := 0;
  3770. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3771. RETURN dest;
  3772. END "+*";
  3773. (** COMPLEX *)
  3774. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3775. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3776. BEGIN
  3777. SYSTEM.GET( dadr, dval );
  3778. WHILE (len > 0) DO
  3779. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3780. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3781. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3782. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3783. END;
  3784. SYSTEM.PUT( dadr, dval );
  3785. END SPAZAZLoop;
  3786. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3787. VAR dest: COMPLEX;
  3788. BEGIN
  3789. dest := 0;
  3790. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3791. RETURN dest;
  3792. END "+*";
  3793. (** COMPLEX *)
  3794. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3795. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3796. BEGIN
  3797. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3798. WHILE (len > 0) DO
  3799. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3800. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3801. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3802. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3803. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3804. END;
  3805. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3806. END SPALZALZLoop;
  3807. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3808. VAR dest: LONGCOMPLEX;
  3809. BEGIN
  3810. dest := 0;
  3811. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3812. RETURN dest;
  3813. END "+*";
  3814. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3815. (** BOOLEAN *)
  3816. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3817. VAR lval, rval: BOOLEAN;
  3818. BEGIN
  3819. WHILE (len > 0) DO
  3820. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3821. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3822. END;
  3823. END EEqlABABLoop;
  3824. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3825. BEGIN
  3826. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3827. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3828. RETURN RESULT
  3829. END ".=";
  3830. (** SHORTINT *)
  3831. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3832. VAR lval, rval: SHORTINT;
  3833. BEGIN
  3834. WHILE (len > 0) DO
  3835. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3836. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3837. END;
  3838. END EEqlASASLoop;
  3839. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3840. BEGIN
  3841. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3842. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3843. RETURN RESULT
  3844. END ".=";
  3845. (** INTEGER *)
  3846. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3847. VAR lval, rval: INTEGER;
  3848. BEGIN
  3849. WHILE (len > 0) DO
  3850. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3851. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3852. END;
  3853. END EEqlAIAILoop;
  3854. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3855. BEGIN
  3856. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3857. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3858. RETURN RESULT
  3859. END ".=";
  3860. (** LONGINT *)
  3861. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3862. VAR lval, rval: LONGINT;
  3863. BEGIN
  3864. WHILE (len > 0) DO
  3865. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3866. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3867. END;
  3868. END EEqlALALLoop;
  3869. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3870. BEGIN
  3871. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3872. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3873. RETURN RESULT
  3874. END ".=";
  3875. (** REAL *)
  3876. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3877. VAR lval, rval: REAL;
  3878. BEGIN
  3879. WHILE (len > 0) DO
  3880. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3881. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3882. END;
  3883. END EEqlARARLoop;
  3884. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3885. BEGIN
  3886. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3887. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3888. RETURN RESULT
  3889. END ".=";
  3890. (** LONGREAL *)
  3891. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3892. VAR lval, rval: LONGREAL;
  3893. BEGIN
  3894. WHILE (len > 0) DO
  3895. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3896. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3897. END;
  3898. END EEqlAXAXLoop;
  3899. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3900. BEGIN
  3901. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3902. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3903. RETURN RESULT
  3904. END ".=";
  3905. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3906. (** BOOLEAN *)
  3907. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3908. VAR lval, rval: BOOLEAN;
  3909. BEGIN
  3910. SYSTEM.GET( radr, rval );
  3911. WHILE (len > 0) DO
  3912. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3913. INC( dadr, dinc ); DEC( len );
  3914. END;
  3915. END EEqlABSBLoop;
  3916. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3917. BEGIN
  3918. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3919. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3920. RETURN RESULT
  3921. END ".=";
  3922. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3923. BEGIN
  3924. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3925. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3926. RETURN RESULT
  3927. END ".=";
  3928. (** SHORTINT *)
  3929. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3930. VAR lval, rval: SHORTINT;
  3931. BEGIN
  3932. SYSTEM.GET( radr, rval );
  3933. WHILE (len > 0) DO
  3934. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3935. INC( dadr, dinc ); DEC( len );
  3936. END;
  3937. END EEqlASSSLoop;
  3938. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3939. BEGIN
  3940. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3941. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3942. RETURN RESULT
  3943. END ".=";
  3944. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3945. BEGIN
  3946. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3947. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3948. RETURN RESULT
  3949. END ".=";
  3950. (** INTEGER *)
  3951. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3952. VAR lval, rval: INTEGER;
  3953. BEGIN
  3954. SYSTEM.GET( radr, rval );
  3955. WHILE (len > 0) DO
  3956. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3957. INC( dadr, dinc ); DEC( len );
  3958. END;
  3959. END EEqlAISILoop;
  3960. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3961. BEGIN
  3962. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3963. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3964. RETURN RESULT
  3965. END ".=";
  3966. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3967. BEGIN
  3968. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3969. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3970. RETURN RESULT
  3971. END ".=";
  3972. (** LONGINT *)
  3973. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3974. VAR lval, rval: LONGINT;
  3975. BEGIN
  3976. SYSTEM.GET( radr, rval );
  3977. WHILE (len > 0) DO
  3978. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3979. INC( dadr, dinc ); DEC( len );
  3980. END;
  3981. END EEqlALSLLoop;
  3982. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3983. BEGIN
  3984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3985. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3986. RETURN RESULT
  3987. END ".=";
  3988. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  3989. BEGIN
  3990. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3991. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3992. RETURN RESULT
  3993. END ".=";
  3994. (** REAL *)
  3995. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3996. VAR lval, rval: REAL;
  3997. BEGIN
  3998. SYSTEM.GET( radr, rval );
  3999. WHILE (len > 0) DO
  4000. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4001. INC( dadr, dinc ); DEC( len );
  4002. END;
  4003. END EEqlARSRLoop;
  4004. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4005. BEGIN
  4006. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4007. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4008. RETURN RESULT
  4009. END ".=";
  4010. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4011. BEGIN
  4012. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4013. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4014. RETURN RESULT
  4015. END ".=";
  4016. (** LONGREAL *)
  4017. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4018. VAR lval, rval: LONGREAL;
  4019. BEGIN
  4020. SYSTEM.GET( radr, rval );
  4021. WHILE (len > 0) DO
  4022. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4023. INC( dadr, dinc ); DEC( len );
  4024. END;
  4025. END EEqlAXSXLoop;
  4026. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4027. BEGIN
  4028. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4029. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4030. RETURN RESULT
  4031. END ".=";
  4032. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4033. BEGIN
  4034. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4035. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4036. RETURN RESULT
  4037. END ".=";
  4038. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4039. (** BOOLEAN *)
  4040. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4041. VAR lval, rval: BOOLEAN;
  4042. BEGIN
  4043. WHILE (len > 0) DO
  4044. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4045. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4046. END;
  4047. END ENeqABABLoop;
  4048. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4049. BEGIN
  4050. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4051. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4052. RETURN RESULT
  4053. END ".#";
  4054. (** SHORTINT *)
  4055. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4056. VAR lval, rval: SHORTINT;
  4057. BEGIN
  4058. WHILE (len > 0) DO
  4059. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4060. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4061. END;
  4062. END ENeqASASLoop;
  4063. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4064. BEGIN
  4065. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4066. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4067. RETURN RESULT
  4068. END ".#";
  4069. (** INTEGER*)
  4070. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4071. VAR lval, rval: INTEGER;
  4072. BEGIN
  4073. WHILE (len > 0) DO
  4074. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4075. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4076. END;
  4077. END ENeqAIAILoop;
  4078. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4079. BEGIN
  4080. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4081. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4082. RETURN RESULT
  4083. END ".#";
  4084. (** LONGINT*)
  4085. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4086. VAR lval, rval: LONGINT;
  4087. BEGIN
  4088. WHILE (len > 0) DO
  4089. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4090. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4091. END;
  4092. END ENeqALALLoop;
  4093. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4094. BEGIN
  4095. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4096. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4097. RETURN RESULT
  4098. END ".#";
  4099. (** REAL *)
  4100. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4101. VAR lval, rval: REAL;
  4102. BEGIN
  4103. WHILE (len > 0) DO
  4104. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4105. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4106. END;
  4107. END ENeqARARLoop;
  4108. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4109. BEGIN
  4110. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4111. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4112. RETURN RESULT
  4113. END ".#";
  4114. (** LONGREAL *)
  4115. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4116. VAR lval, rval: LONGREAL;
  4117. BEGIN
  4118. WHILE (len > 0) DO
  4119. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4120. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4121. END;
  4122. END ENeqAXAXLoop;
  4123. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4124. BEGIN
  4125. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4126. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4127. RETURN RESULT
  4128. END ".#";
  4129. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4130. (** BOOLEAN *)
  4131. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4132. VAR lval, rval: BOOLEAN;
  4133. BEGIN
  4134. SYSTEM.GET( radr, rval );
  4135. WHILE (len > 0) DO
  4136. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4137. INC( dadr, dinc ); DEC( len );
  4138. END;
  4139. END ENeqABSBLoop;
  4140. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4141. BEGIN
  4142. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4143. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4144. RETURN RESULT
  4145. END ".#";
  4146. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4147. BEGIN
  4148. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4149. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4150. RETURN RESULT
  4151. END ".#";
  4152. (** SHORTINT *)
  4153. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4154. VAR lval, rval: SHORTINT;
  4155. BEGIN
  4156. SYSTEM.GET( radr, rval );
  4157. WHILE (len > 0) DO
  4158. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4159. INC( dadr, dinc ); DEC( len );
  4160. END;
  4161. END ENeqASSSLoop;
  4162. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4163. BEGIN
  4164. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4165. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4166. RETURN RESULT
  4167. END ".#";
  4168. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4169. BEGIN
  4170. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4171. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4172. RETURN RESULT
  4173. END ".#";
  4174. (** INTEGER *)
  4175. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4176. VAR lval, rval: INTEGER;
  4177. BEGIN
  4178. SYSTEM.GET( radr, rval );
  4179. WHILE (len > 0) DO
  4180. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4181. INC( dadr, dinc ); DEC( len );
  4182. END;
  4183. END ENeqAISILoop;
  4184. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4185. BEGIN
  4186. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4187. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4188. RETURN RESULT
  4189. END ".#";
  4190. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4191. BEGIN
  4192. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4193. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4194. RETURN RESULT
  4195. END ".#";
  4196. (** LONGINT *)
  4197. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4198. VAR lval, rval: LONGINT;
  4199. BEGIN
  4200. SYSTEM.GET( radr, rval );
  4201. WHILE (len > 0) DO
  4202. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4203. INC( dadr, dinc ); DEC( len );
  4204. END;
  4205. END ENeqALSLLoop;
  4206. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4207. BEGIN
  4208. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4209. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4210. RETURN RESULT
  4211. END ".#";
  4212. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4213. BEGIN
  4214. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4215. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4216. RETURN RESULT
  4217. END ".#";
  4218. (** REAL *)
  4219. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4220. VAR lval, rval: REAL;
  4221. BEGIN
  4222. SYSTEM.GET( radr, rval );
  4223. WHILE (len > 0) DO
  4224. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4225. INC( dadr, dinc ); DEC( len );
  4226. END;
  4227. END ENeqARSRLoop;
  4228. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4229. BEGIN
  4230. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4231. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4232. RETURN RESULT
  4233. END ".#";
  4234. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4235. BEGIN
  4236. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4237. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4238. RETURN RESULT
  4239. END ".#";
  4240. (** LONGREAL *)
  4241. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4242. VAR lval, rval: LONGREAL;
  4243. BEGIN
  4244. SYSTEM.GET( radr, rval );
  4245. WHILE (len > 0) DO
  4246. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4247. INC( dadr, dinc ); DEC( len );
  4248. END;
  4249. END ENeqAXSXLoop;
  4250. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4251. BEGIN
  4252. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4253. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4254. RETURN RESULT
  4255. END ".#";
  4256. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4257. BEGIN
  4258. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4259. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4260. RETURN RESULT
  4261. END ".#";
  4262. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4263. (** SHORTINT *)
  4264. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4265. VAR lval, rval: SHORTINT;
  4266. BEGIN
  4267. WHILE (len > 0) DO
  4268. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4269. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4270. END;
  4271. END EGtrASASLoop;
  4272. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4273. BEGIN
  4274. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4275. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4276. RETURN RESULT
  4277. END ".>";
  4278. (** INTEGER *)
  4279. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4280. VAR lval, rval: INTEGER;
  4281. BEGIN
  4282. WHILE (len > 0) DO
  4283. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4284. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4285. END;
  4286. END EGtrAIAILoop;
  4287. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4288. BEGIN
  4289. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4290. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4291. RETURN RESULT
  4292. END ".>";
  4293. (** LONGINT *)
  4294. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4295. VAR lval, rval: LONGINT;
  4296. BEGIN
  4297. WHILE (len > 0) DO
  4298. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4299. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4300. END;
  4301. END EGtrALALLoop;
  4302. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4303. BEGIN
  4304. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4305. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4306. RETURN RESULT
  4307. END ".>";
  4308. (** REAL *)
  4309. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4310. VAR lval, rval: REAL;
  4311. BEGIN
  4312. WHILE (len > 0) DO
  4313. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4314. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4315. END;
  4316. END EGtrARARLoop;
  4317. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4318. BEGIN
  4319. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4320. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4321. RETURN RESULT
  4322. END ".>";
  4323. (** LONGREAL *)
  4324. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4325. VAR lval, rval: LONGREAL;
  4326. BEGIN
  4327. WHILE (len > 0) DO
  4328. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4329. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4330. END;
  4331. END EGtrAXAXLoop;
  4332. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4333. BEGIN
  4334. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4335. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4336. RETURN RESULT
  4337. END ".>";
  4338. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4339. (** SHORTINT *)
  4340. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4341. VAR lval, rval: SHORTINT;
  4342. BEGIN
  4343. SYSTEM.GET( radr, rval );
  4344. WHILE (len > 0) DO
  4345. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4346. INC( dadr, dinc ); DEC( len );
  4347. END;
  4348. END EGtrASSSLoop;
  4349. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4350. BEGIN
  4351. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4352. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4353. RETURN RESULT
  4354. END ".>";
  4355. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4356. BEGIN
  4357. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4358. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4359. RETURN RESULT
  4360. END ".<";
  4361. (** INTEGER *)
  4362. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4363. VAR lval, rval: INTEGER;
  4364. BEGIN
  4365. SYSTEM.GET( radr, rval );
  4366. WHILE (len > 0) DO
  4367. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4368. INC( dadr, dinc ); DEC( len );
  4369. END;
  4370. END EGtrAISILoop;
  4371. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4372. BEGIN
  4373. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4374. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4375. RETURN RESULT
  4376. END ".>";
  4377. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4378. BEGIN
  4379. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4380. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4381. RETURN RESULT
  4382. END ".<";
  4383. (** LONGINT *)
  4384. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4385. VAR lval, rval: LONGINT;
  4386. BEGIN
  4387. SYSTEM.GET( radr, rval );
  4388. WHILE (len > 0) DO
  4389. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4390. INC( dadr, dinc ); DEC( len );
  4391. END;
  4392. END EGtrALSLLoop;
  4393. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4394. BEGIN
  4395. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4396. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4397. RETURN RESULT
  4398. END ".>";
  4399. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4400. BEGIN
  4401. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4402. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4403. RETURN RESULT
  4404. END ".<";
  4405. (** REAL *)
  4406. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4407. VAR lval, rval: REAL;
  4408. BEGIN
  4409. SYSTEM.GET( radr, rval );
  4410. WHILE (len > 0) DO
  4411. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4412. INC( dadr, dinc ); DEC( len );
  4413. END;
  4414. END EGtrARSRLoop;
  4415. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4416. BEGIN
  4417. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4418. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4419. RETURN RESULT
  4420. END ".>";
  4421. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4422. BEGIN
  4423. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4424. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4425. RETURN RESULT
  4426. END ".<";
  4427. (** LONGREAL *)
  4428. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4429. VAR lval, rval: LONGREAL;
  4430. BEGIN
  4431. SYSTEM.GET( radr, rval );
  4432. WHILE (len > 0) DO
  4433. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4434. INC( dadr, dinc ); DEC( len );
  4435. END;
  4436. END EGtrAXSXLoop;
  4437. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4438. BEGIN
  4439. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4440. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4441. RETURN RESULT
  4442. END ".>";
  4443. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4444. BEGIN
  4445. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4446. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4447. RETURN RESULT
  4448. END ".<";
  4449. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4450. (** SHORTINT *)
  4451. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4452. VAR lval, rval: SHORTINT;
  4453. BEGIN
  4454. WHILE (len > 0) DO
  4455. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4456. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4457. END;
  4458. END EGeqASASLoop;
  4459. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4460. BEGIN
  4461. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4462. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4463. RETURN RESULT
  4464. END ".>=";
  4465. (** INTEGER *)
  4466. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4467. VAR lval, rval: INTEGER;
  4468. BEGIN
  4469. WHILE (len > 0) DO
  4470. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4471. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4472. END;
  4473. END EGeqAIAILoop;
  4474. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4475. BEGIN
  4476. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4477. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4478. RETURN RESULT
  4479. END ".>=";
  4480. (** LONGINT *)
  4481. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4482. VAR lval, rval: LONGINT;
  4483. BEGIN
  4484. WHILE (len > 0) DO
  4485. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4486. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4487. END;
  4488. END EGeqALALLoop;
  4489. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4490. BEGIN
  4491. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4492. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4493. RETURN RESULT
  4494. END ".>=";
  4495. (** REAL *)
  4496. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4497. VAR lval, rval: REAL;
  4498. BEGIN
  4499. WHILE (len > 0) DO
  4500. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4501. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4502. END;
  4503. END EGeqARARLoop;
  4504. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4505. BEGIN
  4506. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4507. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4508. RETURN RESULT
  4509. END ".>=";
  4510. (** LONGREAL *)
  4511. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4512. VAR lval, rval: LONGREAL;
  4513. BEGIN
  4514. WHILE (len > 0) DO
  4515. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4516. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4517. END;
  4518. END EGeqAXAXLoop;
  4519. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4520. BEGIN
  4521. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4522. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4523. RETURN RESULT
  4524. END ".>=";
  4525. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4526. (** SHORTINT *)
  4527. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4528. VAR lval, rval: SHORTINT;
  4529. BEGIN
  4530. SYSTEM.GET( radr, rval );
  4531. WHILE (len > 0) DO
  4532. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4533. INC( dadr, dinc ); DEC( len );
  4534. END;
  4535. END EGeqASSSLoop;
  4536. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4537. BEGIN
  4538. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4539. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4540. RETURN RESULT
  4541. END ".>=";
  4542. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4543. BEGIN
  4544. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4545. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4546. RETURN RESULT
  4547. END ".<=";
  4548. (** INTEGER *)
  4549. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4550. VAR lval, rval: INTEGER;
  4551. BEGIN
  4552. SYSTEM.GET( radr, rval );
  4553. WHILE (len > 0) DO
  4554. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4555. INC( dadr, dinc ); DEC( len );
  4556. END;
  4557. END EGeqAISILoop;
  4558. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4559. BEGIN
  4560. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4561. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4562. RETURN RESULT
  4563. END ".>=";
  4564. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4565. BEGIN
  4566. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4567. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4568. RETURN RESULT
  4569. END ".<=";
  4570. (** LONGINT *)
  4571. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4572. VAR lval, rval: LONGINT;
  4573. BEGIN
  4574. SYSTEM.GET( radr, rval );
  4575. WHILE (len > 0) DO
  4576. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4577. INC( dadr, dinc ); DEC( len );
  4578. END;
  4579. END EGeqALSLLoop;
  4580. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4581. BEGIN
  4582. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4583. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4584. RETURN RESULT
  4585. END ".>=";
  4586. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4587. BEGIN
  4588. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4589. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4590. RETURN RESULT
  4591. END ".<=";
  4592. (** REAL *)
  4593. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4594. VAR lval, rval: REAL;
  4595. BEGIN
  4596. SYSTEM.GET( radr, rval );
  4597. WHILE (len > 0) DO
  4598. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4599. INC( dadr, dinc ); DEC( len );
  4600. END;
  4601. END EGeqARSRLoop;
  4602. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4603. BEGIN
  4604. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4605. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4606. RETURN RESULT
  4607. END ".>=";
  4608. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4609. BEGIN
  4610. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4611. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4612. RETURN RESULT
  4613. END ".<=";
  4614. (** LONGREAL *)
  4615. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4616. VAR lval, rval: LONGREAL;
  4617. BEGIN
  4618. SYSTEM.GET( radr, rval );
  4619. WHILE (len > 0) DO
  4620. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4621. INC( dadr, dinc ); DEC( len );
  4622. END;
  4623. END EGeqAXSXLoop;
  4624. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4625. BEGIN
  4626. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4627. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4628. RETURN RESULT
  4629. END ".>=";
  4630. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4631. BEGIN
  4632. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4633. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4634. RETURN RESULT
  4635. END ".<=";
  4636. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4637. (** SHORTINT *)
  4638. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4639. VAR lval, rval: SHORTINT;
  4640. BEGIN
  4641. WHILE (len > 0) DO
  4642. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4643. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4644. END;
  4645. END ELssASASLoop;
  4646. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4647. BEGIN
  4648. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4649. SIZEOF( BOOLEAN ), ELssASASLoop );
  4650. RETURN RESULT
  4651. END ".<";
  4652. (** INTEGER *)
  4653. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4654. VAR lval, rval: INTEGER;
  4655. BEGIN
  4656. WHILE (len > 0) DO
  4657. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4658. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4659. END;
  4660. END ELssAIAILoop;
  4661. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4662. BEGIN
  4663. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4664. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4665. RETURN RESULT
  4666. END ".<";
  4667. (** LONGINT*)
  4668. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4669. VAR lval, rval: LONGINT;
  4670. BEGIN
  4671. WHILE (len > 0) DO
  4672. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4673. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4674. END;
  4675. END ELssALALLoop;
  4676. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4677. BEGIN
  4678. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4679. SIZEOF( BOOLEAN ), ELssALALLoop );
  4680. RETURN RESULT
  4681. END ".<";
  4682. (** REAL *)
  4683. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4684. VAR lval, rval: REAL;
  4685. BEGIN
  4686. WHILE (len > 0) DO
  4687. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4688. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4689. END;
  4690. END ELssARARLoop;
  4691. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4692. BEGIN
  4693. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4694. SIZEOF( BOOLEAN ), ELssARARLoop );
  4695. RETURN RESULT
  4696. END ".<";
  4697. (** LONGREAL *)
  4698. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4699. VAR lval, rval: LONGREAL;
  4700. BEGIN
  4701. WHILE (len > 0) DO
  4702. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4703. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4704. END;
  4705. END ELssAXAXLoop;
  4706. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4707. BEGIN
  4708. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4709. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4710. RETURN RESULT
  4711. END ".<";
  4712. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4713. (** SHORTINT *)
  4714. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4715. VAR lval, rval: SHORTINT;
  4716. BEGIN
  4717. SYSTEM.GET( radr, rval );
  4718. WHILE (len > 0) DO
  4719. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4720. INC( dadr, dinc ); DEC( len );
  4721. END;
  4722. END ELssASSSLoop;
  4723. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4724. BEGIN
  4725. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4726. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4727. RETURN RESULT
  4728. END ".<";
  4729. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4730. BEGIN
  4731. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4732. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4733. RETURN RESULT
  4734. END ".>";
  4735. (** INTEGER *)
  4736. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4737. VAR lval, rval: INTEGER;
  4738. BEGIN
  4739. SYSTEM.GET( radr, rval );
  4740. WHILE (len > 0) DO
  4741. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4742. INC( dadr, dinc ); DEC( len );
  4743. END;
  4744. END ELssAISILoop;
  4745. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4746. BEGIN
  4747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4748. SIZEOF( BOOLEAN ), ELssAISILoop );
  4749. RETURN RESULT
  4750. END ".<";
  4751. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4752. BEGIN
  4753. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4754. SIZEOF( BOOLEAN ), ELssAISILoop );
  4755. RETURN RESULT
  4756. END ".>";
  4757. (** LONGINT *)
  4758. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4759. VAR lval, rval: LONGINT;
  4760. BEGIN
  4761. SYSTEM.GET( radr, rval );
  4762. WHILE (len > 0) DO
  4763. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4764. INC( dadr, dinc ); DEC( len );
  4765. END;
  4766. END ELssALSLLoop;
  4767. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4768. BEGIN
  4769. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4770. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4771. RETURN RESULT
  4772. END ".<";
  4773. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4774. BEGIN
  4775. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4776. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4777. RETURN RESULT
  4778. END ".>";
  4779. (** REAL *)
  4780. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4781. VAR lval, rval: REAL;
  4782. BEGIN
  4783. SYSTEM.GET( radr, rval );
  4784. WHILE (len > 0) DO
  4785. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4786. INC( dadr, dinc ); DEC( len );
  4787. END;
  4788. END ELssARSRLoop;
  4789. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4790. BEGIN
  4791. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4792. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4793. RETURN RESULT
  4794. END ".<";
  4795. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4796. BEGIN
  4797. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4798. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4799. RETURN RESULT
  4800. END ".>";
  4801. (** LONGREAL *)
  4802. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4803. VAR lval, rval: LONGREAL;
  4804. BEGIN
  4805. SYSTEM.GET( radr, rval );
  4806. WHILE (len > 0) DO
  4807. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4808. INC( dadr, dinc ); DEC( len );
  4809. END;
  4810. END ELssAXSXLoop;
  4811. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4812. BEGIN
  4813. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4814. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4815. RETURN RESULT
  4816. END ".<";
  4817. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4818. BEGIN
  4819. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4820. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4821. RETURN RESULT
  4822. END ".>";
  4823. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4824. (** SHORTINT *)
  4825. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4826. VAR lval, rval: SHORTINT;
  4827. BEGIN
  4828. WHILE (len > 0) DO
  4829. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4830. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4831. END;
  4832. END ELeqASASLoop;
  4833. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4834. BEGIN
  4835. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4836. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4837. RETURN RESULT
  4838. END ".<=";
  4839. (** INTEGER *)
  4840. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4841. VAR lval, rval: INTEGER;
  4842. BEGIN
  4843. WHILE (len > 0) DO
  4844. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4845. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4846. END;
  4847. END ELeqAIAILoop;
  4848. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4849. BEGIN
  4850. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4851. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4852. RETURN RESULT
  4853. END ".<=";
  4854. (** LONGINT *)
  4855. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4856. VAR lval, rval: LONGINT;
  4857. BEGIN
  4858. WHILE (len > 0) DO
  4859. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4860. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4861. END;
  4862. END ELeqALALLoop;
  4863. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4864. BEGIN
  4865. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4866. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4867. RETURN RESULT
  4868. END ".<=";
  4869. (** REAL *)
  4870. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4871. VAR lval, rval: REAL;
  4872. BEGIN
  4873. WHILE (len > 0) DO
  4874. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4875. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4876. END;
  4877. END ELeqARARLoop;
  4878. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4879. BEGIN
  4880. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4881. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4882. RETURN RESULT
  4883. END ".<=";
  4884. (** LONGREAL*)
  4885. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4886. VAR lval, rval: LONGREAL;
  4887. BEGIN
  4888. WHILE (len > 0) DO
  4889. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4890. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4891. END;
  4892. END ELeqAXAXLoop;
  4893. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4894. BEGIN
  4895. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4896. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4897. RETURN RESULT
  4898. END ".<=";
  4899. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4900. (** SHORTINT *)
  4901. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4902. VAR lval, rval: SHORTINT;
  4903. BEGIN
  4904. SYSTEM.GET( radr, rval );
  4905. WHILE (len > 0) DO
  4906. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4907. INC( dadr, dinc ); DEC( len );
  4908. END;
  4909. END ELeqASSSLoop;
  4910. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4911. BEGIN
  4912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4913. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4914. RETURN RESULT
  4915. END ".<=";
  4916. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4917. BEGIN
  4918. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4919. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4920. RETURN RESULT
  4921. END ".>=";
  4922. (** INTEGER *)
  4923. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4924. VAR lval, rval: INTEGER;
  4925. BEGIN
  4926. SYSTEM.GET( radr, rval );
  4927. WHILE (len > 0) DO
  4928. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4929. INC( dadr, dinc ); DEC( len );
  4930. END;
  4931. END ELeqAISILoop;
  4932. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4933. BEGIN
  4934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4935. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4936. RETURN RESULT
  4937. END ".<=";
  4938. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4939. BEGIN
  4940. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4941. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4942. RETURN RESULT
  4943. END ".>=";
  4944. (** LONGINT *)
  4945. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4946. VAR lval, rval: LONGINT;
  4947. BEGIN
  4948. SYSTEM.GET( radr, rval );
  4949. WHILE (len > 0) DO
  4950. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4951. INC( dadr, dinc ); DEC( len );
  4952. END;
  4953. END ELeqALSLLoop;
  4954. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4955. BEGIN
  4956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4957. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4958. RETURN RESULT
  4959. END ".<=";
  4960. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4961. BEGIN
  4962. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4963. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4964. RETURN RESULT
  4965. END ".>=";
  4966. (** REAL *)
  4967. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4968. VAR lval, rval: REAL;
  4969. BEGIN
  4970. SYSTEM.GET( radr, rval );
  4971. WHILE (len > 0) DO
  4972. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4973. INC( dadr, dinc ); DEC( len );
  4974. END;
  4975. END ELeqARSRLoop;
  4976. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4977. BEGIN
  4978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4979. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4980. RETURN RESULT
  4981. END ".<=";
  4982. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4983. BEGIN
  4984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4985. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4986. RETURN RESULT
  4987. END ".>=";
  4988. (** LONGREAL *)
  4989. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4990. VAR lval, rval: LONGREAL;
  4991. BEGIN
  4992. SYSTEM.GET( radr, rval );
  4993. WHILE (len > 0) DO
  4994. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4995. INC( dadr, dinc ); DEC( len );
  4996. END;
  4997. END ELeqAXSXLoop;
  4998. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4999. BEGIN
  5000. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5001. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5002. RETURN RESULT
  5003. END ".<=";
  5004. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5005. BEGIN
  5006. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5007. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5008. RETURN RESULT
  5009. END ".>=";
  5010. (*** elementwise or, elementwise and ********************************************************************)
  5011. (** array x array *)
  5012. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5013. VAR lval, rval: BOOLEAN;
  5014. BEGIN
  5015. WHILE (len > 0) DO
  5016. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5017. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5018. END;
  5019. END ElOrABABLoop;
  5020. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5021. BEGIN
  5022. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5023. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5024. RETURN RESULT
  5025. END "OR";
  5026. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5027. VAR lval, rval: BOOLEAN;
  5028. BEGIN
  5029. WHILE (len > 0) DO
  5030. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5031. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5032. END;
  5033. END ElAndABABLoop;
  5034. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5035. BEGIN
  5036. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5037. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5038. RETURN RESULT
  5039. END "&";
  5040. (** array x boolean *)
  5041. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5042. VAR lval, rval: BOOLEAN;
  5043. BEGIN
  5044. SYSTEM.GET( radr, rval );
  5045. WHILE (len > 0) DO
  5046. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5047. INC( dadr, dinc ); DEC( len );
  5048. END;
  5049. END ElOrABSBLoop;
  5050. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5051. BEGIN
  5052. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5053. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5054. RETURN RESULT
  5055. END "OR";
  5056. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5057. BEGIN
  5058. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5059. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5060. RETURN RESULT
  5061. END "OR";
  5062. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5063. VAR lval, rval: BOOLEAN;
  5064. BEGIN
  5065. SYSTEM.GET( radr, rval );
  5066. WHILE (len > 0) DO
  5067. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5068. INC( dadr, dinc ); DEC( len );
  5069. END;
  5070. END ElAndABSBLoop;
  5071. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5072. BEGIN
  5073. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5074. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5075. RETURN RESULT
  5076. END "&";
  5077. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5078. BEGIN
  5079. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5080. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5081. RETURN RESULT
  5082. END "&";
  5083. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5084. (** SHORTINT *)
  5085. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5086. VAR lval, rval: SHORTINT;
  5087. BEGIN
  5088. WHILE (len > 0) DO
  5089. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5090. IF rval <= lval THEN RETURN FALSE END;
  5091. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5092. END;
  5093. RETURN TRUE;
  5094. END LssASASLoop;
  5095. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5096. BEGIN
  5097. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5098. END "<";
  5099. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5100. VAR lval, rval: SHORTINT;
  5101. BEGIN
  5102. WHILE (len > 0) DO
  5103. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5104. IF rval > lval THEN RETURN FALSE END;
  5105. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5106. END;
  5107. RETURN TRUE;
  5108. END GeqASASLoop;
  5109. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5110. BEGIN
  5111. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5112. END ">=";
  5113. (** INTEGER *)
  5114. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5115. VAR lval, rval: INTEGER;
  5116. BEGIN
  5117. WHILE (len > 0) DO
  5118. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5119. IF rval <= lval THEN RETURN FALSE END;
  5120. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5121. END;
  5122. RETURN TRUE;
  5123. END LssAIAILoop;
  5124. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5125. BEGIN
  5126. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5127. END "<";
  5128. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5129. VAR lval, rval: INTEGER;
  5130. BEGIN
  5131. WHILE (len > 0) DO
  5132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5133. IF rval > lval THEN RETURN FALSE END;
  5134. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5135. END;
  5136. RETURN TRUE;
  5137. END GeqAIAILoop;
  5138. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5139. BEGIN
  5140. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5141. END ">=";
  5142. (** LONGINT *)
  5143. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5144. VAR lval, rval: LONGINT;
  5145. BEGIN
  5146. WHILE (len > 0) DO
  5147. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5148. IF rval <= lval THEN RETURN FALSE END;
  5149. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5150. END;
  5151. RETURN TRUE;
  5152. END LssALALLoop;
  5153. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5154. BEGIN
  5155. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5156. END "<";
  5157. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5158. VAR lval, rval: LONGINT;
  5159. BEGIN
  5160. WHILE (len > 0) DO
  5161. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5162. IF rval > lval THEN RETURN FALSE END;
  5163. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5164. END;
  5165. RETURN TRUE;
  5166. END GeqALALLoop;
  5167. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5168. BEGIN
  5169. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5170. END ">=";
  5171. (** REAL *)
  5172. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5173. VAR lval, rval: REAL;
  5174. BEGIN
  5175. WHILE (len > 0) DO
  5176. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5177. IF rval <= lval THEN RETURN FALSE END;
  5178. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5179. END;
  5180. RETURN TRUE;
  5181. END LssARARLoop;
  5182. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5183. BEGIN
  5184. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5185. END "<";
  5186. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5187. VAR lval, rval: REAL;
  5188. BEGIN
  5189. WHILE (len > 0) DO
  5190. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5191. IF rval > lval THEN RETURN FALSE END;
  5192. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5193. END;
  5194. RETURN TRUE;
  5195. END GeqARARLoop;
  5196. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5197. BEGIN
  5198. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5199. END ">=";
  5200. (** LONGREAL *)
  5201. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5202. VAR lval, rval: LONGREAL;
  5203. BEGIN
  5204. WHILE (len > 0) DO
  5205. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5206. IF rval <= lval THEN RETURN FALSE END;
  5207. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5208. END;
  5209. RETURN TRUE;
  5210. END LssAXAXLoop;
  5211. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5212. BEGIN
  5213. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5214. END "<";
  5215. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5216. VAR lval, rval: LONGREAL;
  5217. BEGIN
  5218. WHILE (len > 0) DO
  5219. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5220. IF rval > lval THEN RETURN FALSE END;
  5221. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5222. END;
  5223. RETURN TRUE;
  5224. END GeqAXAXLoop;
  5225. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5226. BEGIN
  5227. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5228. END ">=";
  5229. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5230. (** SHORTINT *)
  5231. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5232. VAR lval, rval: SHORTINT;
  5233. BEGIN
  5234. WHILE (len > 0) DO
  5235. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5236. IF rval >= lval THEN RETURN FALSE END;
  5237. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5238. END;
  5239. RETURN TRUE;
  5240. END GtrASASLoop;
  5241. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5242. BEGIN
  5243. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5244. END ">";
  5245. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5246. VAR lval, rval: SHORTINT;
  5247. BEGIN
  5248. WHILE (len > 0) DO
  5249. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5250. IF rval < lval THEN RETURN FALSE END;
  5251. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5252. END;
  5253. RETURN TRUE;
  5254. END LeqASASLoop;
  5255. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5256. BEGIN
  5257. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5258. END "<=";
  5259. (** INTEGER *)
  5260. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5261. VAR lval, rval: INTEGER;
  5262. BEGIN
  5263. WHILE (len > 0) DO
  5264. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5265. IF rval >= lval THEN RETURN FALSE END;
  5266. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5267. END;
  5268. RETURN TRUE;
  5269. END GtrAIAILoop;
  5270. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5271. BEGIN
  5272. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5273. END ">";
  5274. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5275. VAR lval, rval: INTEGER;
  5276. BEGIN
  5277. WHILE (len > 0) DO
  5278. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5279. IF rval < lval THEN RETURN FALSE END;
  5280. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5281. END;
  5282. RETURN TRUE;
  5283. END LeqAIAILoop;
  5284. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5285. BEGIN
  5286. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5287. END "<=";
  5288. (** LONGINT *)
  5289. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5290. VAR lval, rval: LONGINT;
  5291. BEGIN
  5292. WHILE (len > 0) DO
  5293. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5294. IF rval >= lval THEN RETURN FALSE END;
  5295. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5296. END;
  5297. RETURN TRUE;
  5298. END GtrALALLoop;
  5299. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5300. BEGIN
  5301. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5302. END ">";
  5303. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5304. VAR lval, rval: LONGINT;
  5305. BEGIN
  5306. WHILE (len > 0) DO
  5307. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5308. IF rval < lval THEN RETURN FALSE END;
  5309. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5310. END;
  5311. RETURN TRUE;
  5312. END LeqALALLoop;
  5313. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5314. BEGIN
  5315. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5316. END "<=";
  5317. (** REAL *)
  5318. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5319. VAR lval, rval: REAL;
  5320. BEGIN
  5321. WHILE (len > 0) DO
  5322. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5323. IF rval >= lval THEN RETURN FALSE END;
  5324. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5325. END;
  5326. RETURN TRUE;
  5327. END GtrARARLoop;
  5328. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5329. BEGIN
  5330. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5331. END ">";
  5332. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5333. VAR lval, rval: REAL;
  5334. BEGIN
  5335. WHILE (len > 0) DO
  5336. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5337. IF rval < lval THEN RETURN FALSE END;
  5338. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5339. END;
  5340. RETURN TRUE;
  5341. END LeqARARLoop;
  5342. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5343. BEGIN
  5344. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5345. END "<=";
  5346. (** LONGREAL *)
  5347. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5348. VAR lval, rval: LONGREAL;
  5349. BEGIN
  5350. WHILE (len > 0) DO
  5351. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5352. IF rval >= lval THEN RETURN FALSE END;
  5353. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5354. END;
  5355. RETURN TRUE;
  5356. END GtrAXAXLoop;
  5357. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5358. BEGIN
  5359. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5360. END ">";
  5361. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5362. VAR lval, rval: LONGREAL;
  5363. BEGIN
  5364. WHILE (len > 0) DO
  5365. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5366. IF rval < lval THEN RETURN FALSE END;
  5367. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5368. END;
  5369. RETURN TRUE;
  5370. END LeqAXAXLoop;
  5371. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5372. BEGIN
  5373. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5374. END "<=";
  5375. (*** equals: array x array -> boolean ********************************************************************)
  5376. (** BOOLEAN *)
  5377. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5378. VAR lval, rval: BOOLEAN;
  5379. BEGIN
  5380. WHILE (len > 0) DO
  5381. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5382. IF rval # lval THEN RETURN FALSE END;
  5383. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5384. END;
  5385. RETURN TRUE;
  5386. END EqlABABLoop;
  5387. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5388. BEGIN
  5389. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5390. END "=";
  5391. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5392. BEGIN
  5393. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5394. END "#";
  5395. (** SHORTINT *)
  5396. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5397. VAR lval, rval: SHORTINT;
  5398. BEGIN
  5399. WHILE (len > 0) DO
  5400. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5401. IF rval # lval THEN RETURN FALSE END;
  5402. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5403. END;
  5404. RETURN TRUE;
  5405. END EqlASASLoop;
  5406. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5407. BEGIN
  5408. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5409. END "=";
  5410. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5411. BEGIN
  5412. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5413. END "#";
  5414. (** INTEGER *)
  5415. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5416. VAR lval, rval: INTEGER;
  5417. BEGIN
  5418. WHILE (len > 0) DO
  5419. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5420. IF rval # lval THEN RETURN FALSE END;
  5421. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5422. END;
  5423. RETURN TRUE;
  5424. END EqlAIAILoop;
  5425. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5426. BEGIN
  5427. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5428. END "=";
  5429. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5430. BEGIN
  5431. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5432. END "#";
  5433. (** LONGINT *)
  5434. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5435. VAR lval, rval: LONGINT;
  5436. BEGIN
  5437. WHILE (len > 0) DO
  5438. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5439. IF rval # lval THEN RETURN FALSE END;
  5440. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5441. END;
  5442. RETURN TRUE;
  5443. END EqlALALLoop;
  5444. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5445. BEGIN
  5446. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5447. END "=";
  5448. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5449. BEGIN
  5450. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5451. END "#";
  5452. (** REAL *)
  5453. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5454. VAR lval, rval: REAL;
  5455. BEGIN
  5456. WHILE (len > 0) DO
  5457. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5458. IF rval # lval THEN RETURN FALSE END;
  5459. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5460. END;
  5461. RETURN TRUE;
  5462. END EqlARARLoop;
  5463. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5464. BEGIN
  5465. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5466. END "=";
  5467. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5468. BEGIN
  5469. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5470. END "#";
  5471. (** LONGREAL *)
  5472. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5473. VAR lval, rval: LONGREAL;
  5474. BEGIN
  5475. WHILE (len > 0) DO
  5476. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5477. IF rval # lval THEN RETURN FALSE END;
  5478. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5479. END;
  5480. RETURN TRUE;
  5481. END EqlAXAXLoop;
  5482. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5483. BEGIN
  5484. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5485. END "=";
  5486. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5487. BEGIN
  5488. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5489. END "#";
  5490. (** COMPLEX *)
  5491. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5492. VAR lval, rval: COMPLEX;
  5493. BEGIN
  5494. WHILE (len > 0) DO
  5495. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5496. IF rval # lval THEN RETURN FALSE END;
  5497. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5498. END;
  5499. RETURN TRUE;
  5500. END EqlAZAZLoop;
  5501. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5502. BEGIN
  5503. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5504. END "=";
  5505. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5506. BEGIN
  5507. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5508. END "#";
  5509. (** LONGCOMPLEX *)
  5510. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5511. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5512. BEGIN
  5513. WHILE (len > 0) DO
  5514. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5515. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5516. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5517. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5518. END;
  5519. RETURN TRUE;
  5520. END EqlALZALZLoop;
  5521. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5522. BEGIN
  5523. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5524. END "=";
  5525. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5526. BEGIN
  5527. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5528. END "#";
  5529. (*** equals: array x scalar -> boolean ********************************************************************)
  5530. (** BOOLEAN *)
  5531. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5532. VAR lval, rval: BOOLEAN;
  5533. BEGIN
  5534. SYSTEM.GET( radr, rval );
  5535. WHILE (len > 0) DO
  5536. SYSTEM.GET( ladr, lval );
  5537. IF lval # rval THEN RETURN FALSE END;
  5538. INC( ladr, linc ); DEC( len );
  5539. END;
  5540. RETURN TRUE;
  5541. END EqlABSBLoop;
  5542. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5543. right: BOOLEAN ): BOOLEAN;
  5544. BEGIN
  5545. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5546. END "=";
  5547. OPERATOR "="*( left: BOOLEAN;
  5548. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5549. BEGIN
  5550. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5551. END "=";
  5552. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5553. right: BOOLEAN ): BOOLEAN;
  5554. BEGIN
  5555. RETURN ~(left = right);
  5556. END "#";
  5557. OPERATOR "#"*( left: BOOLEAN;
  5558. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5559. BEGIN
  5560. RETURN ~( left = right );
  5561. END "#";
  5562. (** SHORTINT *)
  5563. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5564. VAR lval, rval: SHORTINT;
  5565. BEGIN
  5566. SYSTEM.GET( radr, rval );
  5567. WHILE (len > 0) DO
  5568. SYSTEM.GET( ladr, lval );
  5569. IF lval # rval THEN RETURN FALSE END;
  5570. INC( ladr, linc ); DEC( len );
  5571. END;
  5572. RETURN TRUE;
  5573. END EqlASSSLoop;
  5574. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5575. BEGIN
  5576. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5577. END "=";
  5578. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5579. BEGIN
  5580. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5581. END "=";
  5582. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5583. BEGIN
  5584. RETURN ~( left= right );
  5585. END "#";
  5586. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5587. BEGIN
  5588. RETURN ~( left= right );
  5589. END "#";
  5590. (** INTEGER *)
  5591. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5592. VAR lval, rval: INTEGER;
  5593. BEGIN
  5594. SYSTEM.GET( radr, rval );
  5595. WHILE (len > 0) DO
  5596. SYSTEM.GET( ladr, lval );
  5597. IF lval # rval THEN RETURN FALSE END;
  5598. INC( ladr, linc ); DEC( len );
  5599. END;
  5600. RETURN TRUE;
  5601. END EqlAISILoop;
  5602. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5603. BEGIN
  5604. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5605. END "=";
  5606. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5607. BEGIN
  5608. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5609. END "=";
  5610. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5611. BEGIN
  5612. RETURN ~( left = right );
  5613. END "#";
  5614. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5615. BEGIN
  5616. RETURN ~( left = right );
  5617. END "#";
  5618. (** LONGINT *)
  5619. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5620. VAR lval, rval: LONGINT;
  5621. BEGIN
  5622. SYSTEM.GET( radr, rval );
  5623. WHILE (len > 0) DO
  5624. SYSTEM.GET( ladr, lval );
  5625. IF lval # rval THEN RETURN FALSE END;
  5626. INC( ladr, linc ); DEC( len );
  5627. END;
  5628. RETURN TRUE;
  5629. END EqlALSLLoop;
  5630. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5631. right: LONGINT ): BOOLEAN;
  5632. BEGIN
  5633. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5634. END "=";
  5635. OPERATOR "="*( left: LONGINT;
  5636. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5637. BEGIN
  5638. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5639. END "=";
  5640. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5641. right: LONGINT ): BOOLEAN;
  5642. BEGIN
  5643. RETURN ~(left = right);
  5644. END "#";
  5645. OPERATOR "#"*( left: LONGINT;
  5646. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5647. BEGIN
  5648. RETURN ~(left = right);
  5649. END "#";
  5650. (** REAL *)
  5651. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5652. VAR lval, rval: REAL;
  5653. BEGIN
  5654. SYSTEM.GET( radr, rval );
  5655. WHILE (len > 0) DO
  5656. SYSTEM.GET( ladr, lval );
  5657. IF lval # rval THEN RETURN FALSE END;
  5658. INC( ladr, linc ); DEC( len );
  5659. END;
  5660. RETURN TRUE;
  5661. END EqlARSRLoop;
  5662. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5663. right: REAL ): BOOLEAN;
  5664. BEGIN
  5665. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5666. END "=";
  5667. OPERATOR "="*( left: REAL;
  5668. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5669. BEGIN
  5670. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5671. END "=";
  5672. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5673. right: REAL ): BOOLEAN;
  5674. BEGIN
  5675. RETURN ~( left = right );
  5676. END "#";
  5677. OPERATOR "#"*( left: REAL;
  5678. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5679. BEGIN
  5680. RETURN ~( left = right );
  5681. END "#";
  5682. (** LONGREAL *)
  5683. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5684. VAR lval, rval: LONGREAL;
  5685. BEGIN
  5686. SYSTEM.GET( radr, rval );
  5687. WHILE (len > 0) DO
  5688. SYSTEM.GET( ladr, lval );
  5689. IF lval # rval THEN RETURN FALSE END;
  5690. INC( ladr, linc ); DEC( len );
  5691. END;
  5692. RETURN TRUE;
  5693. END EqlAXSXLoop;
  5694. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5695. right: LONGREAL ): BOOLEAN;
  5696. BEGIN
  5697. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5698. END "=";
  5699. OPERATOR "="*( left: LONGREAL;
  5700. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5701. BEGIN
  5702. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5703. END "=";
  5704. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5705. right: LONGREAL ): BOOLEAN;
  5706. BEGIN
  5707. RETURN ~( left = right );
  5708. END "#";
  5709. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5710. BEGIN
  5711. RETURN ~( left= right );
  5712. END "#";
  5713. (*** gtr : array x scalar -> boolean ********************************************************************)
  5714. (** SHORTINT *)
  5715. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5716. VAR lval, rval: SHORTINT;
  5717. BEGIN
  5718. SYSTEM.GET( radr, rval );
  5719. WHILE (len > 0) DO
  5720. SYSTEM.GET( ladr, lval );
  5721. IF lval <= rval THEN RETURN FALSE END;
  5722. INC( ladr, linc ); DEC( len );
  5723. END;
  5724. RETURN TRUE;
  5725. END GtrASSSLoop;
  5726. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5727. BEGIN
  5728. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5729. END ">";
  5730. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5731. BEGIN
  5732. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5733. END "<";
  5734. (** INTEGER *)
  5735. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5736. VAR lval, rval: INTEGER;
  5737. BEGIN
  5738. SYSTEM.GET( radr, rval );
  5739. WHILE (len > 0) DO
  5740. SYSTEM.GET( ladr, lval );
  5741. IF lval <= rval THEN RETURN FALSE END;
  5742. INC( ladr, linc ); DEC( len );
  5743. END;
  5744. RETURN TRUE;
  5745. END GtrAISILoop;
  5746. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5747. BEGIN
  5748. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5749. END ">";
  5750. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5751. BEGIN
  5752. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5753. END "<";
  5754. (** LONGINT *)
  5755. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5756. VAR lval, rval: LONGINT;
  5757. BEGIN
  5758. SYSTEM.GET( radr, rval );
  5759. WHILE (len > 0) DO
  5760. SYSTEM.GET( ladr, lval );
  5761. IF lval <= rval THEN RETURN FALSE END;
  5762. INC( ladr, linc ); DEC( len );
  5763. END;
  5764. RETURN TRUE;
  5765. END GtrALSLLoop;
  5766. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5767. BEGIN
  5768. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5769. END ">";
  5770. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5771. BEGIN
  5772. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5773. END "<";
  5774. (** REAL *)
  5775. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5776. VAR lval, rval: REAL;
  5777. BEGIN
  5778. SYSTEM.GET( radr, rval );
  5779. WHILE (len > 0) DO
  5780. SYSTEM.GET( ladr, lval );
  5781. IF lval <= rval THEN RETURN FALSE END;
  5782. INC( ladr, linc ); DEC( len );
  5783. END;
  5784. RETURN TRUE;
  5785. END GtrARSRLoop;
  5786. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5787. right: REAL ): BOOLEAN;
  5788. BEGIN
  5789. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5790. END ">";
  5791. OPERATOR "<"*( left: REAL;
  5792. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5795. END "<";
  5796. (** LONGREAL *)
  5797. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5798. VAR lval, rval: LONGREAL;
  5799. BEGIN
  5800. SYSTEM.GET( radr, rval );
  5801. WHILE (len > 0) DO
  5802. SYSTEM.GET( ladr, lval );
  5803. IF lval <= rval THEN RETURN FALSE END;
  5804. INC( ladr, linc ); DEC( len );
  5805. END;
  5806. RETURN TRUE;
  5807. END GtrAXSXLoop;
  5808. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5809. right: LONGREAL ): BOOLEAN;
  5810. BEGIN
  5811. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5812. END ">";
  5813. OPERATOR "<"*( left: LONGREAL;
  5814. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5815. BEGIN
  5816. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5817. END "<";
  5818. (*** geq : array x scalar -> boolean ********************************************************************)
  5819. (** SHORTINT *)
  5820. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5821. VAR lval, rval: SHORTINT;
  5822. BEGIN
  5823. SYSTEM.GET( radr, rval );
  5824. WHILE (len > 0) DO
  5825. SYSTEM.GET( ladr, lval );
  5826. IF lval < rval THEN RETURN FALSE END;
  5827. INC( ladr, linc ); DEC( len );
  5828. END;
  5829. RETURN TRUE;
  5830. END GeqASSSLoop;
  5831. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5832. right: SHORTINT ): BOOLEAN;
  5833. BEGIN
  5834. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5835. END ">=";
  5836. OPERATOR "<="*( left: SHORTINT;
  5837. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5838. BEGIN
  5839. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5840. END "<=";
  5841. (** INTEGER *)
  5842. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5843. VAR lval, rval: INTEGER;
  5844. BEGIN
  5845. SYSTEM.GET( radr, rval );
  5846. WHILE (len > 0) DO
  5847. SYSTEM.GET( ladr, lval );
  5848. IF lval < rval THEN RETURN FALSE END;
  5849. INC( ladr, linc ); DEC( len );
  5850. END;
  5851. RETURN TRUE;
  5852. END GeqAISILoop;
  5853. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5854. BEGIN
  5855. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5856. END ">=";
  5857. OPERATOR "<="*( left: INTEGER;
  5858. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5859. BEGIN
  5860. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5861. END "<=";
  5862. (** LONGINT *)
  5863. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5864. VAR lval, rval: LONGINT;
  5865. BEGIN
  5866. SYSTEM.GET( radr, rval );
  5867. WHILE (len > 0) DO
  5868. SYSTEM.GET( ladr, lval );
  5869. IF lval < rval THEN RETURN FALSE END;
  5870. INC( ladr, linc ); DEC( len );
  5871. END;
  5872. RETURN TRUE;
  5873. END GeqALSLLoop;
  5874. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5875. right: LONGINT ): BOOLEAN;
  5876. BEGIN
  5877. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5878. END ">=";
  5879. OPERATOR "<="*( left: LONGINT;
  5880. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5881. BEGIN
  5882. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5883. END "<=";
  5884. (** REAL *)
  5885. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5886. VAR lval, rval: REAL;
  5887. BEGIN
  5888. SYSTEM.GET( radr, rval );
  5889. WHILE (len > 0) DO
  5890. SYSTEM.GET( ladr, lval );
  5891. IF lval < rval THEN RETURN FALSE END;
  5892. INC( ladr, linc ); DEC( len );
  5893. END;
  5894. RETURN TRUE;
  5895. END GeqARSRLoop;
  5896. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5897. right: REAL ): BOOLEAN;
  5898. BEGIN
  5899. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5900. END ">=";
  5901. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5902. BEGIN
  5903. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5904. END "<=";
  5905. (** LONGREAL *)
  5906. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5907. VAR lval, rval: LONGREAL;
  5908. BEGIN
  5909. SYSTEM.GET( radr, rval );
  5910. WHILE (len > 0) DO
  5911. SYSTEM.GET( ladr, lval );
  5912. IF lval < rval THEN RETURN FALSE END;
  5913. INC( ladr, linc ); DEC( len );
  5914. END;
  5915. RETURN TRUE;
  5916. END GeqAXSXLoop;
  5917. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5918. BEGIN
  5919. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5920. END ">=";
  5921. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5922. BEGIN
  5923. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5924. END "<=";
  5925. (*** leq : array x scalar -> boolean ********************************************************************)
  5926. (** SHORTINT *)
  5927. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5928. VAR lval, rval: SHORTINT;
  5929. BEGIN
  5930. SYSTEM.GET( radr, rval );
  5931. WHILE (len > 0) DO
  5932. SYSTEM.GET( ladr, lval );
  5933. IF lval > rval THEN RETURN FALSE END;
  5934. INC( ladr, linc ); DEC( len );
  5935. END;
  5936. RETURN TRUE;
  5937. END LeqASSSLoop;
  5938. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5939. BEGIN
  5940. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5941. END "<=";
  5942. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5943. BEGIN
  5944. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5945. END ">=";
  5946. (** INTEGER *)
  5947. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5948. VAR lval, rval: INTEGER;
  5949. BEGIN
  5950. SYSTEM.GET( radr, rval );
  5951. WHILE (len > 0) DO
  5952. SYSTEM.GET( ladr, lval );
  5953. IF lval > rval THEN RETURN FALSE END;
  5954. INC( ladr, linc ); DEC( len );
  5955. END;
  5956. RETURN TRUE;
  5957. END LeqAISILoop;
  5958. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5959. BEGIN
  5960. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5961. END "<=";
  5962. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5963. BEGIN
  5964. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5965. END ">=";
  5966. (** LONGINT *)
  5967. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5968. VAR lval, rval: LONGINT;
  5969. BEGIN
  5970. SYSTEM.GET( radr, rval );
  5971. WHILE (len > 0) DO
  5972. SYSTEM.GET( ladr, lval );
  5973. IF lval > rval THEN RETURN FALSE END;
  5974. INC( ladr, linc ); DEC( len );
  5975. END;
  5976. RETURN TRUE;
  5977. END LeqALSLLoop;
  5978. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5979. BEGIN
  5980. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  5981. END "<=";
  5982. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5983. BEGIN
  5984. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  5985. END ">=";
  5986. (** REAL *)
  5987. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5988. VAR lval, rval: REAL;
  5989. BEGIN
  5990. SYSTEM.GET( radr, rval );
  5991. WHILE (len > 0) DO
  5992. SYSTEM.GET( ladr, lval );
  5993. IF lval > rval THEN RETURN FALSE END;
  5994. INC( ladr, linc ); DEC( len );
  5995. END;
  5996. RETURN TRUE;
  5997. END LeqARSRLoop;
  5998. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  5999. BEGIN
  6000. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6001. END "<=";
  6002. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6003. BEGIN
  6004. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6005. END ">=";
  6006. (** LONGREAL *)
  6007. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6008. VAR lval, rval: LONGREAL;
  6009. BEGIN
  6010. SYSTEM.GET( radr, rval );
  6011. WHILE (len > 0) DO
  6012. SYSTEM.GET( ladr, lval );
  6013. IF lval > rval THEN RETURN FALSE END;
  6014. INC( ladr, linc ); DEC( len );
  6015. END;
  6016. RETURN TRUE;
  6017. END LeqAXSXLoop;
  6018. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6019. BEGIN
  6020. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6021. END "<=";
  6022. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6023. BEGIN
  6024. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6025. END ">=";
  6026. (*** lss: array x scalar -> boolean ********************************************************************)
  6027. (** SHORTINT *)
  6028. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6029. VAR lval, rval: SHORTINT;
  6030. BEGIN
  6031. SYSTEM.GET( radr, rval );
  6032. WHILE (len > 0) DO
  6033. SYSTEM.GET( ladr, lval );
  6034. IF lval >= rval THEN RETURN FALSE END;
  6035. INC( ladr, linc ); DEC( len );
  6036. END;
  6037. RETURN TRUE;
  6038. END LssASSSLoop;
  6039. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6040. BEGIN
  6041. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6042. END "<";
  6043. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6044. BEGIN
  6045. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6046. END ">";
  6047. (** INTEGER *)
  6048. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6049. VAR lval, rval: INTEGER;
  6050. BEGIN
  6051. SYSTEM.GET( radr, rval );
  6052. WHILE (len > 0) DO
  6053. SYSTEM.GET( ladr, lval );
  6054. IF lval >= rval THEN RETURN FALSE END;
  6055. INC( ladr, linc ); DEC( len );
  6056. END;
  6057. RETURN TRUE;
  6058. END LssAISILoop;
  6059. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6060. BEGIN
  6061. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6062. END "<";
  6063. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6064. BEGIN
  6065. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6066. END ">";
  6067. (** LONGINT *)
  6068. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6069. VAR lval, rval: LONGINT;
  6070. BEGIN
  6071. SYSTEM.GET( radr, rval );
  6072. WHILE (len > 0) DO
  6073. SYSTEM.GET( ladr, lval );
  6074. IF lval >= rval THEN RETURN FALSE END;
  6075. INC( ladr, linc ); DEC( len );
  6076. END;
  6077. RETURN TRUE;
  6078. END LssALSLLoop;
  6079. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6080. BEGIN
  6081. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6082. END "<";
  6083. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6084. BEGIN
  6085. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6086. END ">";
  6087. (** REAL *)
  6088. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6089. VAR lval, rval: REAL;
  6090. BEGIN
  6091. SYSTEM.GET( radr, rval );
  6092. WHILE (len > 0) DO
  6093. SYSTEM.GET( ladr, lval );
  6094. IF lval >= rval THEN RETURN FALSE END;
  6095. INC( ladr, linc ); DEC( len );
  6096. END;
  6097. RETURN TRUE;
  6098. END LssARSRLoop;
  6099. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6100. right: REAL ): BOOLEAN;
  6101. BEGIN
  6102. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6103. END "<";
  6104. OPERATOR ">"*( left: REAL;
  6105. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6106. BEGIN
  6107. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6108. END ">";
  6109. (** LONGREAL *)
  6110. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6111. VAR lval, rval: LONGREAL;
  6112. BEGIN
  6113. SYSTEM.GET( radr, rval );
  6114. WHILE (len > 0) DO
  6115. SYSTEM.GET( ladr, lval );
  6116. IF lval >= rval THEN RETURN FALSE END;
  6117. INC( ladr, linc ); DEC( len );
  6118. END;
  6119. RETURN TRUE;
  6120. END LssAXSXLoop;
  6121. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6122. right: LONGREAL ): BOOLEAN;
  6123. BEGIN
  6124. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6125. END "<";
  6126. OPERATOR ">"*( left: LONGREAL;
  6127. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6128. BEGIN
  6129. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6130. END ">";
  6131. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6132. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6133. VAR lval, val: LONGREAL;
  6134. BEGIN
  6135. SYSTEM.GET( radr, val );
  6136. WHILE (len > 0) DO
  6137. SYSTEM.GET( ladr, lval );
  6138. INC( ladr, linc ); DEC( len );
  6139. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6140. INC(dadr,dinc);
  6141. END;
  6142. END MaxAXSXLoop;
  6143. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6144. TYPE Type = LONGREAL;
  6145. BEGIN
  6146. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6147. RETURN RESULT
  6148. END "MAX";
  6149. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6150. VAR lval, val: REAL;
  6151. BEGIN
  6152. SYSTEM.GET( radr, val );
  6153. WHILE (len > 0) DO
  6154. SYSTEM.GET( ladr, lval );
  6155. INC( ladr, linc ); DEC( len );
  6156. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6157. INC(dadr,dinc);
  6158. END;
  6159. END MaxARSRLoop;
  6160. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6161. TYPE Type = REAL;
  6162. BEGIN
  6163. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6164. RETURN RESULT
  6165. END "MAX";
  6166. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6167. VAR lval, val: LONGINT;
  6168. BEGIN
  6169. SYSTEM.GET( radr, val );
  6170. WHILE (len > 0) DO
  6171. SYSTEM.GET( ladr, lval );
  6172. INC( ladr, linc ); DEC( len );
  6173. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6174. INC(dadr,dinc);
  6175. END;
  6176. END MaxALSLLoop;
  6177. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6178. TYPE Type = LONGINT;
  6179. BEGIN
  6180. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6181. RETURN RESULT
  6182. END "MAX";
  6183. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6184. VAR lval, val: INTEGER;
  6185. BEGIN
  6186. SYSTEM.GET( radr, val );
  6187. WHILE (len > 0) DO
  6188. SYSTEM.GET( ladr, lval );
  6189. INC( ladr, linc ); DEC( len );
  6190. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6191. INC(dadr,dinc);
  6192. END;
  6193. END MaxAISILoop;
  6194. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6195. TYPE Type = INTEGER;
  6196. BEGIN
  6197. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6198. RETURN RESULT
  6199. END "MAX";
  6200. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6201. VAR lval, val: SHORTINT;
  6202. BEGIN
  6203. SYSTEM.GET( radr, val );
  6204. WHILE (len > 0) DO
  6205. SYSTEM.GET( ladr, lval );
  6206. INC( ladr, linc ); DEC( len );
  6207. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6208. INC(dadr,dinc);
  6209. END;
  6210. END MaxASSSLoop;
  6211. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6212. TYPE Type = SHORTINT;
  6213. BEGIN
  6214. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6215. RETURN RESULT
  6216. END "MAX";
  6217. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6218. VAR lval, val: LONGREAL;
  6219. BEGIN
  6220. SYSTEM.GET( radr, val );
  6221. WHILE (len > 0) DO
  6222. SYSTEM.GET( ladr, lval );
  6223. INC( ladr, linc ); DEC( len );
  6224. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6225. INC(dadr,dinc);
  6226. END;
  6227. END MinAXSXLoop;
  6228. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6229. TYPE Type = LONGREAL;
  6230. BEGIN
  6231. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6232. RETURN RESULT
  6233. END "MIN";
  6234. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6235. VAR lval, val: REAL;
  6236. BEGIN
  6237. SYSTEM.GET( radr, val );
  6238. WHILE (len > 0) DO
  6239. SYSTEM.GET( ladr, lval );
  6240. INC( ladr, linc ); DEC( len );
  6241. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6242. INC(dadr,dinc);
  6243. END;
  6244. END MinARSRLoop;
  6245. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6246. TYPE Type = REAL;
  6247. BEGIN
  6248. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6249. RETURN RESULT
  6250. END "MIN";
  6251. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6252. VAR lval, val: LONGINT;
  6253. BEGIN
  6254. SYSTEM.GET( radr, val );
  6255. WHILE (len > 0) DO
  6256. SYSTEM.GET( ladr, lval );
  6257. INC( ladr, linc ); DEC( len );
  6258. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6259. INC(dadr,dinc);
  6260. END;
  6261. END MinALSLLoop;
  6262. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6263. TYPE Type = LONGINT;
  6264. BEGIN
  6265. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6266. RETURN RESULT
  6267. END "MIN";
  6268. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6269. VAR lval, val: INTEGER;
  6270. BEGIN
  6271. SYSTEM.GET( radr, val );
  6272. WHILE (len > 0) DO
  6273. SYSTEM.GET( ladr, lval );
  6274. INC( ladr, linc ); DEC( len );
  6275. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6276. INC(dadr,dinc);
  6277. END;
  6278. END MinAISILoop;
  6279. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6280. TYPE Type = INTEGER;
  6281. BEGIN
  6282. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6283. RETURN RESULT
  6284. END "MIN";
  6285. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6286. VAR lval, val: SHORTINT;
  6287. BEGIN
  6288. SYSTEM.GET( radr, val );
  6289. WHILE (len > 0) DO
  6290. SYSTEM.GET( ladr, lval );
  6291. INC( ladr, linc ); DEC( len );
  6292. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6293. INC(dadr,dinc);
  6294. END;
  6295. END MinASSSLoop;
  6296. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6297. TYPE Type = SHORTINT;
  6298. BEGIN
  6299. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6300. RETURN RESULT
  6301. END "MIN";
  6302. (**** binary max/min operators array x array -> array ********************************************************************)
  6303. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6304. VAR lval, rval: LONGREAL;
  6305. BEGIN
  6306. WHILE (len > 0) DO
  6307. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6308. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6309. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6310. INC(dadr,dinc);
  6311. END;
  6312. END MaxAXAXLoop;
  6313. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6314. BEGIN
  6315. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6316. RETURN RESULT
  6317. END "MAX";
  6318. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6319. VAR lval, rval: REAL ;
  6320. BEGIN
  6321. WHILE (len > 0) DO
  6322. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6323. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6324. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6325. INC(dadr,dinc);
  6326. END;
  6327. END MaxARARLoop;
  6328. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6329. BEGIN
  6330. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6331. RETURN RESULT
  6332. END "MAX";
  6333. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6334. VAR lval, rval: LONGINT;
  6335. BEGIN
  6336. WHILE (len > 0) DO
  6337. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6338. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6339. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6340. INC(dadr,dinc);
  6341. END;
  6342. END MaxALALLoop;
  6343. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6344. BEGIN
  6345. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6346. RETURN RESULT
  6347. END "MAX";
  6348. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6349. VAR lval, rval: INTEGER;
  6350. BEGIN
  6351. WHILE (len > 0) DO
  6352. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6353. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6354. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6355. INC(dadr,dinc);
  6356. END;
  6357. END MaxAIAILoop;
  6358. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6359. BEGIN
  6360. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6361. RETURN RESULT
  6362. END "MAX";
  6363. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6364. VAR lval, rval: SHORTINT;
  6365. BEGIN
  6366. WHILE (len > 0) DO
  6367. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6368. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6369. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6370. INC(dadr,dinc);
  6371. END;
  6372. END MaxASASLoop;
  6373. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6374. BEGIN
  6375. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6376. RETURN RESULT
  6377. END "MAX";
  6378. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6379. VAR lval, rval: LONGREAL;
  6380. BEGIN
  6381. WHILE (len > 0) DO
  6382. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6383. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6384. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6385. INC(dadr,dinc);
  6386. END;
  6387. END MinAXAXLoop;
  6388. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6389. BEGIN
  6390. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6391. RETURN RESULT
  6392. END "MIN";
  6393. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6394. VAR lval, rval: REAL ;
  6395. BEGIN
  6396. WHILE (len > 0) DO
  6397. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6398. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6399. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6400. INC(dadr,dinc);
  6401. END;
  6402. END MinARARLoop;
  6403. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6404. BEGIN
  6405. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6406. RETURN RESULT
  6407. END "MIN";
  6408. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6409. VAR lval, rval: LONGINT;
  6410. BEGIN
  6411. WHILE (len > 0) DO
  6412. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6413. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6414. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6415. INC(dadr,dinc);
  6416. END;
  6417. END MinALALLoop;
  6418. *)
  6419. TYPE
  6420. LongintPtr = POINTER {UNSAFE} TO RECORD val: LONGINT END;
  6421. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6422. BEGIN
  6423. WHILE (len > 0) DO
  6424. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6425. ladr := ladr + linc;
  6426. radr := radr + rinc;
  6427. dadr := dadr + dinc;
  6428. DEC(len);
  6429. END;
  6430. END MinALALLoop;
  6431. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6432. BEGIN
  6433. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6434. RETURN RESULT
  6435. END "MIN";
  6436. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6437. VAR lval, rval: INTEGER;
  6438. BEGIN
  6439. WHILE (len > 0) DO
  6440. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6441. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6442. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6443. INC(dadr,dinc);
  6444. END;
  6445. END MinAIAILoop;
  6446. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6447. BEGIN
  6448. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6449. RETURN RESULT
  6450. END "MIN";
  6451. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6452. VAR lval, rval: SHORTINT;
  6453. BEGIN
  6454. WHILE (len > 0) DO
  6455. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6456. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6457. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6458. INC(dadr,dinc);
  6459. END;
  6460. END MinASASLoop;
  6461. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6462. BEGIN
  6463. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6464. RETURN RESULT
  6465. END "MIN";
  6466. (**** unary operators array -> scalar ********************************************************************)
  6467. (*** min: array -> scalar ****************************************)
  6468. (** SHORTINT *)
  6469. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6470. VAR lval, dval: SHORTINT;
  6471. BEGIN
  6472. SYSTEM.GET( dadr, dval );
  6473. WHILE (len > 0) DO
  6474. SYSTEM.GET( ladr, lval );
  6475. IF lval < dval THEN dval := lval END;
  6476. INC( ladr, linc ); DEC( len );
  6477. END;
  6478. SYSTEM.PUT( dadr, dval );
  6479. END MinASLoop;
  6480. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6481. TYPE Type = SHORTINT;
  6482. VAR val: Type;
  6483. BEGIN
  6484. val := MAX( Type );
  6485. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6486. END "MIN";
  6487. (** INTEGER *)
  6488. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6489. VAR lval, dval: INTEGER;
  6490. BEGIN
  6491. SYSTEM.GET( dadr, dval );
  6492. WHILE (len > 0) DO
  6493. SYSTEM.GET( ladr, lval );
  6494. IF lval < dval THEN dval := lval END;
  6495. INC( ladr, linc ); DEC( len );
  6496. END;
  6497. SYSTEM.PUT( dadr, dval );
  6498. END MinAILoop;
  6499. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6500. TYPE Type = INTEGER;
  6501. VAR val: Type;
  6502. BEGIN
  6503. val := MAX( Type );
  6504. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6505. END "MIN";
  6506. (** LONGINT *)
  6507. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6508. VAR lval, dval: LONGINT;
  6509. BEGIN
  6510. SYSTEM.GET( dadr, dval );
  6511. WHILE (len > 0) DO
  6512. SYSTEM.GET( ladr, lval );
  6513. IF lval < dval THEN dval := lval END;
  6514. INC( ladr, linc ); DEC( len );
  6515. END;
  6516. SYSTEM.PUT( dadr, dval );
  6517. END MinALLoop;
  6518. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6519. TYPE Type = LONGINT;
  6520. VAR val: Type;
  6521. BEGIN
  6522. val := MAX( Type );
  6523. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6524. END "MIN";
  6525. (** REAL *)
  6526. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6527. VAR lval, dval: REAL;
  6528. BEGIN
  6529. SYSTEM.GET( dadr, dval );
  6530. WHILE (len > 0) DO
  6531. SYSTEM.GET( ladr, lval );
  6532. IF lval < dval THEN dval := lval END;
  6533. INC( ladr, linc ); DEC( len );
  6534. END;
  6535. SYSTEM.PUT( dadr, dval );
  6536. END MinARLoop;
  6537. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6538. TYPE Type = REAL;
  6539. VAR val: Type;
  6540. BEGIN
  6541. val := MAX( Type );
  6542. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6543. END "MIN";
  6544. (** LONGREAL *)
  6545. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6546. VAR lval, dval: LONGREAL;
  6547. BEGIN
  6548. SYSTEM.GET( dadr, dval );
  6549. WHILE (len > 0) DO
  6550. SYSTEM.GET( ladr, lval );
  6551. IF lval < dval THEN dval := lval END;
  6552. INC( ladr, linc ); DEC( len );
  6553. END;
  6554. SYSTEM.PUT( dadr, dval );
  6555. END MinAXLoop;
  6556. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6557. TYPE Type = LONGREAL;
  6558. VAR val: Type;
  6559. BEGIN
  6560. val := MAX( Type );
  6561. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6562. END "MIN";
  6563. (*** max: array -> scalar ********************************************************************)
  6564. (** SHORTINT *)
  6565. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6566. VAR lval, dval: SHORTINT;
  6567. BEGIN
  6568. SYSTEM.GET( dadr, dval );
  6569. WHILE (len > 0) DO
  6570. SYSTEM.GET( ladr, lval );
  6571. IF lval > dval THEN dval := lval END;
  6572. INC( ladr, linc ); DEC( len );
  6573. END;
  6574. SYSTEM.PUT( dadr, dval );
  6575. END MaxASLoop;
  6576. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6577. TYPE Type = SHORTINT;
  6578. VAR val: Type;
  6579. BEGIN
  6580. val := MIN( Type );
  6581. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6582. END "MAX";
  6583. (** INTEGER *)
  6584. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6585. VAR lval, dval: INTEGER;
  6586. BEGIN
  6587. SYSTEM.GET( dadr, dval );
  6588. WHILE (len > 0) DO
  6589. SYSTEM.GET( ladr, lval );
  6590. IF lval > dval THEN dval := lval END;
  6591. INC( ladr, linc ); DEC( len );
  6592. END;
  6593. SYSTEM.PUT( dadr, dval );
  6594. END MaxAILoop;
  6595. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6596. TYPE Type = INTEGER;
  6597. VAR val: Type;
  6598. BEGIN
  6599. val := MIN( Type );
  6600. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6601. END "MAX";
  6602. (** LONGINT *)
  6603. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6604. VAR lval, dval: LONGINT;
  6605. BEGIN
  6606. SYSTEM.GET( dadr, dval );
  6607. WHILE (len > 0) DO
  6608. SYSTEM.GET( ladr, lval );
  6609. IF lval > dval THEN dval := lval END;
  6610. INC( ladr, linc ); DEC( len );
  6611. END;
  6612. SYSTEM.PUT( dadr, dval );
  6613. END MaxALLoop;
  6614. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6615. TYPE Type = LONGINT;
  6616. VAR val: Type;
  6617. BEGIN
  6618. val := MIN( Type );
  6619. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6620. END "MAX";
  6621. (** REAL *)
  6622. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6623. VAR lval, dval: REAL;
  6624. BEGIN
  6625. SYSTEM.GET( dadr, dval );
  6626. WHILE (len > 0) DO
  6627. SYSTEM.GET( ladr, lval );
  6628. IF lval > dval THEN dval := lval END;
  6629. INC( ladr, linc ); DEC( len );
  6630. END;
  6631. SYSTEM.PUT( dadr, dval );
  6632. END MaxARLoop;
  6633. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6634. TYPE Type = REAL;
  6635. VAR val: Type;
  6636. BEGIN
  6637. val := MIN( Type );
  6638. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6639. END "MAX";
  6640. (** LONGREAL *)
  6641. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6642. VAR lval, dval: LONGREAL;
  6643. BEGIN
  6644. SYSTEM.GET( dadr, dval );
  6645. WHILE (len > 0) DO
  6646. SYSTEM.GET( ladr, lval );
  6647. IF lval > dval THEN dval := lval END;
  6648. INC( ladr, linc ); DEC( len );
  6649. END;
  6650. SYSTEM.PUT( dadr, dval );
  6651. END MaxAXLoop;
  6652. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6653. TYPE Type = LONGREAL;
  6654. VAR val: Type;
  6655. BEGIN
  6656. val := MIN( Type );
  6657. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6658. END "MAX";
  6659. (*** LEN: array -> array **)
  6660. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6661. VAR src,dim,i: LONGINT;
  6662. BEGIN
  6663. src := SYSTEM.VAL(LONGINT,left);
  6664. dim := GetDim( src );
  6665. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6666. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6667. RETURN RESULT
  6668. END "LEN";
  6669. (*** SUM: array -> scalar ********************************************************************)
  6670. (** SHORTINT *)
  6671. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6672. VAR lval, dval: SHORTINT;
  6673. BEGIN
  6674. SYSTEM.GET( dadr, dval );
  6675. WHILE (len > 0) DO
  6676. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6677. END;
  6678. SYSTEM.PUT( dadr, dval );
  6679. END SumASLoop;
  6680. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6681. TYPE Type = SHORTINT;
  6682. VAR val: Type;
  6683. BEGIN
  6684. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6685. RETURN val;
  6686. END "SUM";
  6687. (** INTEGER *)
  6688. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6689. VAR lval, dval: INTEGER;
  6690. BEGIN
  6691. SYSTEM.GET( dadr, dval );
  6692. WHILE (len > 0) DO
  6693. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6694. END;
  6695. SYSTEM.PUT( dadr, dval );
  6696. END SumAILoop;
  6697. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6698. TYPE Type = INTEGER;
  6699. VAR val: Type;
  6700. BEGIN
  6701. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6702. RETURN val;
  6703. END "SUM";
  6704. (** LONGINT *)
  6705. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6706. VAR lval, dval: LONGINT;
  6707. BEGIN
  6708. SYSTEM.GET( dadr, dval );
  6709. WHILE (len > 0) DO
  6710. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6711. END;
  6712. SYSTEM.PUT( dadr, dval );
  6713. END SumALLoop;
  6714. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6715. TYPE Type = LONGINT;
  6716. VAR val: Type;
  6717. BEGIN
  6718. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6719. RETURN val;
  6720. END "SUM";
  6721. (** REAL *)
  6722. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6723. VAR lval, dval: REAL;
  6724. BEGIN
  6725. SYSTEM.GET( dadr, dval );
  6726. WHILE (len > 0) DO
  6727. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6728. END;
  6729. SYSTEM.PUT( dadr, dval );
  6730. END SumARLoop;
  6731. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6732. TYPE Type = REAL;
  6733. VAR val: Type;
  6734. BEGIN
  6735. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6736. RETURN val;
  6737. END "SUM";
  6738. (** LONGREAL *)
  6739. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6740. VAR lval, dval: LONGREAL;
  6741. BEGIN
  6742. SYSTEM.GET( dadr, dval );
  6743. WHILE (len > 0) DO
  6744. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6745. END;
  6746. SYSTEM.PUT( dadr, dval );
  6747. END SumAXLoop;
  6748. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6749. TYPE Type = LONGREAL;
  6750. VAR val: Type;
  6751. BEGIN
  6752. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6753. RETURN val;
  6754. END "SUM";
  6755. (** COMPLEX *)
  6756. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6757. VAR lval, dval: COMPLEX;
  6758. BEGIN
  6759. SYSTEM.GET( dadr, dval );
  6760. WHILE (len > 0) DO
  6761. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6762. END;
  6763. SYSTEM.PUT( dadr, dval );
  6764. END SumAZLoop;
  6765. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6766. TYPE Type = COMPLEX;
  6767. VAR val: Type;
  6768. BEGIN
  6769. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6770. RETURN val;
  6771. END "SUM";
  6772. (** LONGCOMPLEX *)
  6773. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6774. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6775. BEGIN
  6776. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6777. WHILE (len > 0) DO
  6778. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6779. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6780. INC( ladr, linc ); DEC( len );
  6781. END;
  6782. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6783. END SumALZLoop;
  6784. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6785. TYPE Type = LONGCOMPLEX;
  6786. VAR val: Type;
  6787. BEGIN
  6788. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6789. RETURN val;
  6790. END "SUM";
  6791. (*** monadic ABS array -> array ********************************************************************)
  6792. (** SHORTINT *)
  6793. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6794. VAR lval: SHORTINT;
  6795. BEGIN
  6796. WHILE (len > 0) DO
  6797. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6798. INC( dadr, dinc ); DEC( len );
  6799. END;
  6800. END AbsLoopS;
  6801. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6802. BEGIN
  6803. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6804. RETURN RESULT
  6805. END "ABS";
  6806. (** INTEGER *)
  6807. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6808. VAR lval: INTEGER;
  6809. BEGIN
  6810. WHILE (len > 0) DO
  6811. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6812. INC( dadr, dinc ); DEC( len );
  6813. END;
  6814. END AbsLoopI;
  6815. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6816. BEGIN
  6817. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6818. RETURN RESULT
  6819. END "ABS";
  6820. (** LONGINT *)
  6821. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6822. VAR lval: LONGINT;
  6823. BEGIN
  6824. WHILE (len > 0) DO
  6825. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6826. INC( dadr, dinc ); DEC( len );
  6827. END;
  6828. END AbsLoopL;
  6829. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6830. BEGIN
  6831. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6832. RETURN RESULT
  6833. END "ABS";
  6834. (** REAL *)
  6835. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6836. VAR lval: REAL;
  6837. BEGIN
  6838. WHILE (len > 0) DO
  6839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6840. INC( dadr, dinc ); DEC( len );
  6841. END;
  6842. END AbsLoopR;
  6843. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6844. BEGIN
  6845. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6846. RETURN RESULT
  6847. END "ABS";
  6848. (** LONGREAL *)
  6849. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6850. VAR lval: LONGREAL;
  6851. BEGIN
  6852. WHILE (len > 0) DO
  6853. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6854. INC( dadr, dinc ); DEC( len );
  6855. END;
  6856. END AbsLoopX;
  6857. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6858. BEGIN
  6859. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6860. RETURN RESULT
  6861. END "ABS";
  6862. (** COMPLEX *)
  6863. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6864. VAR lval: COMPLEX;
  6865. BEGIN
  6866. WHILE (len > 0) DO
  6867. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6868. INC( dadr, dinc ); DEC( len );
  6869. END;
  6870. END AbsLoopZ;
  6871. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6872. BEGIN
  6873. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6874. RETURN RESULT
  6875. END "ABS";
  6876. (** LONGCOMPLEX *)
  6877. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6878. VAR lvalRe, lvalIm: LONGREAL;
  6879. BEGIN
  6880. WHILE (len > 0) DO
  6881. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6882. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6883. INC( ladr, linc );
  6884. INC( dadr, dinc ); DEC( len );
  6885. END;
  6886. END AbsLoopLZ;
  6887. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6888. BEGIN
  6889. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6890. RETURN RESULT
  6891. END "ABS";
  6892. (*** assign number to array (initialisation) ********************************************************************)
  6893. (** BOOLEAN *)
  6894. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6895. VAR lval: BOOLEAN;
  6896. BEGIN
  6897. SYSTEM.GET( ladr, lval );
  6898. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6899. END AssignSBABLoop;
  6900. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6901. BEGIN
  6902. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6903. END ":=";
  6904. (** SHORTINT*)
  6905. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6906. VAR lval: SHORTINT;
  6907. BEGIN
  6908. SYSTEM.GET( ladr, lval );
  6909. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6910. END AssignSSASLoop;
  6911. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6912. BEGIN
  6913. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6914. END ":=";
  6915. (**INTEGER *)
  6916. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6917. VAR lval: INTEGER;
  6918. BEGIN
  6919. SYSTEM.GET( ladr, lval );
  6920. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6921. END AssignSIAILoop;
  6922. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6923. BEGIN
  6924. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6925. END ":=";
  6926. (** LONGINT *)
  6927. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6928. VAR lval: LONGINT;
  6929. BEGIN
  6930. SYSTEM.GET( ladr, lval );
  6931. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6932. END AssignSLALLoop;
  6933. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6934. BEGIN
  6935. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6936. END ":=";
  6937. (** REAL *)
  6938. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6939. VAR lval: REAL;
  6940. BEGIN
  6941. SYSTEM.GET( ladr, lval );
  6942. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6943. END AssignSRARLoop;
  6944. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6945. BEGIN
  6946. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6947. END ":=";
  6948. (** LONGREAL *)
  6949. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6950. VAR lval: LONGREAL;
  6951. BEGIN
  6952. SYSTEM.GET( ladr, lval );
  6953. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6954. END AssignSXAXLoop;
  6955. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6956. BEGIN
  6957. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6958. END ":=";
  6959. (** COMPLEX *)
  6960. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6961. VAR lval: COMPLEX;
  6962. BEGIN
  6963. SYSTEM.GET( ladr, lval );
  6964. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6965. END AssignSZAZLoop;
  6966. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6967. BEGIN
  6968. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6969. END ":=";
  6970. (** LONGCOMPLEX *)
  6971. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6972. VAR lvalRe, lvalIm: LONGREAL;
  6973. BEGIN
  6974. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6975. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6976. END AssignSLZALZLoop;
  6977. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6978. BEGIN
  6979. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6980. END ":=";
  6981. (*** matrix multipliation ********************************************************************)
  6982. PROCEDURE AllocateMatrix( dest: ADDRESS;
  6983. rows, cols, elementsize: LONGINT ): ANY;
  6984. VAR p: ANY;
  6985. BEGIN
  6986. (*
  6987. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  6988. *)
  6989. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  6990. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  6991. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6992. PutPtr( dest, p); RETURN p;
  6993. END AllocateMatrix;
  6994. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: LONGINT ): ANY;
  6995. VAR p: ANY;
  6996. BEGIN
  6997. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  6998. PutInc( dest, 0, elementsize ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6999. PutPtr( dest, p ); RETURN p;
  7000. END AllocateVector;
  7001. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: LONGINT;
  7002. loop: BinaryAASLoop;
  7003. fast: FastMatMul ); (* Size= element-size *)
  7004. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  7005. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7006. BEGIN
  7007. (*
  7008. <- 1 ->
  7009. xxx xxxx -> xxxx
  7010. ^ xxx xxxx xxxx
  7011. 0 xxx xxxx xxxx
  7012. v xxx xxxx
  7013. xxx xxxx
  7014. Len(..,1): #columns ; Inc(..,1): inc in rows
  7015. Len(..,0): #rows ; Inc(..,0): inc between rows
  7016. *)
  7017. (* apply multiplication D = L * R *)
  7018. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7019. colsL := GetLen( left, 1 ); (* # left columns *)
  7020. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7021. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7022. (* check geometric restriction *)
  7023. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7024. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7025. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7026. IF RangeFlag IN GetFlags( dest ) THEN
  7027. Halt( GeometryMismatch, left, right, dest )
  7028. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7029. END;
  7030. END;
  7031. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7032. IF overlap THEN
  7033. destOld := dest; destNew := 0;
  7034. p := AllocateSame( destNew, destOld, Size );
  7035. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7036. dest := destNew;
  7037. END;
  7038. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7039. HALT( 9999 )
  7040. END;
  7041. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7042. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7043. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7044. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7045. (*
  7046. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7047. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7048. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7049. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7050. *)
  7051. IF rowsL = 0 THEN RETURN
  7052. ELSIF colsL=0 THEN RETURN
  7053. ELSIF colsR=0 THEN RETURN
  7054. ELSIF (fast = NIL ) OR
  7055. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7056. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7057. radri := radr; dadri := dadr; colsRi := colsR;
  7058. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7059. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7060. INC( dadri, incD ); DEC( colsRi );
  7061. END;
  7062. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7063. END;
  7064. END;
  7065. IF overlap THEN CopyContent( destOld, dest, Size );
  7066. END;
  7067. END ApplyMatMulLoop;
  7068. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7069. Size: LONGINT; loop: BinaryAASLoop;
  7070. fast: FastMatMul ); (* Size= element-size *)
  7071. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7072. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7073. BEGIN
  7074. (*
  7075. <- 0 ->
  7076. xxx T(xxx) -> T(xxxxx)
  7077. xxx
  7078. 1 xxx
  7079. xxx
  7080. xxx
  7081. Len(..,0): #columns ; Inc(..,0): inc in rows
  7082. Len(..,1): #rows ; Inc(..,1): inc between rows
  7083. *)
  7084. (* check geometric restriction *)
  7085. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7086. Halt( GeometryMismatch, left, right,0 );
  7087. END;
  7088. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7089. l2 := GetLen( left, 1 ); (* inner loop len *)
  7090. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7091. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7092. IF RangeFlag IN GetFlags( dest ) THEN
  7093. Halt( GeometryMismatch, left, right, dest );
  7094. ELSE p := AllocateVector( dest, l1, Size );
  7095. END;
  7096. END;
  7097. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7098. IF overlap THEN
  7099. destOld := dest; destNew := 0;
  7100. p := AllocateSame( destNew, destOld, Size );
  7101. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7102. dest := destNew;
  7103. END;
  7104. (*
  7105. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7106. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7107. END;
  7108. *)
  7109. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7110. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7111. di0 := GetIncr( dest, 0 );
  7112. IF l1=0 THEN RETURN
  7113. ELSIF l2=0 THEN RETURN
  7114. ELSIF (fast = NIL ) OR
  7115. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7116. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7117. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7118. DEC( l1 );
  7119. END;
  7120. END;
  7121. IF overlap THEN CopyContent( destOld, dest, Size );
  7122. END;
  7123. END ApplyMatVecMulLoop;
  7124. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7125. Size: LONGINT; loop: BinaryAASLoop;
  7126. fast: FastMatMul ); (* Size= element-size *)
  7127. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7128. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7129. BEGIN
  7130. (*
  7131. <- 0 ->
  7132. xxx xxxx -> xxxx
  7133. xxxx
  7134. 1 xxxx
  7135. Len(..,0): #columns ; Inc(..,0): inc in rows
  7136. Len(..,1): #rows ; Inc(..,1): inc between rows
  7137. *)
  7138. (* check geometric restriction *)
  7139. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7140. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7141. l2 := GetLen( right, 0 ); (* inner loop len *)
  7142. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7143. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7144. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7145. ELSE p := AllocateVector( dest, l0, Size );
  7146. END;
  7147. END;
  7148. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7149. IF overlap THEN
  7150. destOld := dest; destNew := 0;
  7151. p := AllocateSame( destNew, destOld, Size );
  7152. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7153. dest := destNew;
  7154. END;
  7155. (*
  7156. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7157. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7158. END;
  7159. *)
  7160. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7161. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7162. di0 := GetIncr( dest, 0 );
  7163. IF l2=0 THEN RETURN
  7164. ELSIF l0=0 THEN RETURN
  7165. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7166. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7167. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7168. DEC( l0 );
  7169. END;
  7170. END;
  7171. IF overlap THEN CopyContent( destOld, dest, Size );
  7172. END;
  7173. END ApplyVecMatMulLoop;
  7174. (** SHORTINT *)
  7175. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7176. VAR lval, rval, dval: SHORTINT;
  7177. BEGIN
  7178. dval := 0;
  7179. WHILE (len > 0) DO
  7180. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7181. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7182. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7183. END;
  7184. SYSTEM.PUT( dadr, dval );
  7185. END MatMulASASLoop;
  7186. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7187. BEGIN
  7188. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7189. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7190. RETURN RESULT
  7191. END "*";
  7192. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7193. BEGIN
  7194. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7195. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7196. RETURN RESULT
  7197. END "*";
  7198. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7199. BEGIN
  7200. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7201. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7202. RETURN RESULT
  7203. END "*";
  7204. (** INTEGER *)
  7205. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7206. VAR lval, rval, dval: INTEGER;
  7207. BEGIN
  7208. dval := 0;
  7209. WHILE (len > 0) DO
  7210. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7211. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7212. END;
  7213. SYSTEM.PUT( dadr, dval );
  7214. END MatMulAIAILoop;
  7215. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7216. BEGIN
  7217. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7218. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7219. RETURN RESULT
  7220. END "*";
  7221. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7222. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7223. BEGIN
  7224. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7225. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7226. RETURN RESULT
  7227. END "*";
  7228. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7229. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7230. BEGIN
  7231. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7232. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7233. RETURN RESULT
  7234. END "*";
  7235. (** LONGINT *)
  7236. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7237. VAR lval, rval, dval: LONGINT;
  7238. BEGIN
  7239. dval := 0;
  7240. WHILE (len > 0) DO
  7241. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7242. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7243. END;
  7244. SYSTEM.PUT( dadr, dval );
  7245. END MatMulALALLoop;
  7246. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7247. BEGIN
  7248. (*
  7249. KernelLog.String("MatMulALAL");
  7250. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7251. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7252. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7253. KernelLog.Ln;
  7254. *)
  7255. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7256. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7257. RETURN RESULT
  7258. END "*";
  7259. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7260. BEGIN
  7261. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7262. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7263. RETURN RESULT
  7264. END "*";
  7265. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7266. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7267. BEGIN
  7268. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7269. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7270. RETURN RESULT
  7271. END "*";
  7272. (** REAL *)
  7273. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7274. VAR lval, rval, dval: REAL;
  7275. BEGIN
  7276. dval := 0;
  7277. WHILE (len > 0) DO
  7278. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7279. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7280. END;
  7281. SYSTEM.PUT( dadr, dval );
  7282. END MatMulARARLoop;
  7283. (*
  7284. Optimized for small matrices (Alexey Morozov)
  7285. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7286. *)
  7287. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7288. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7289. BEGIN
  7290. dadr := GetAdr(ADDRESSOF(RESULT));
  7291. ladr := GetAdr(ADDRESSOF(left));
  7292. radr := GetAdr(ADDRESSOF(right));
  7293. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7294. IF (ladr # dadr) & (radr # dadr) THEN
  7295. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7296. CASE SYSTEM.VAL(LONGINT,flags) OF
  7297. Mat2x2:
  7298. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7299. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7300. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7301. END;
  7302. END;
  7303. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7304. ELSE
  7305. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7306. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7307. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7308. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7309. END;
  7310. |Mat3x3:
  7311. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7312. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7313. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7314. END;
  7315. END;
  7316. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7317. ELSE
  7318. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7319. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7320. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7321. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7322. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7323. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7324. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7325. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7326. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7327. END;
  7328. |Mat4x4:
  7329. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7330. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7331. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7332. END;
  7333. END;
  7334. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7335. ELSE
  7336. 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];
  7337. 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];
  7338. 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];
  7339. 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];
  7340. 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];
  7341. 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];
  7342. 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];
  7343. 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];
  7344. 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];
  7345. 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];
  7346. 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];
  7347. 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];
  7348. 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];
  7349. 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];
  7350. 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];
  7351. 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];
  7352. END;
  7353. ELSE
  7354. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7355. loopMatMulARAR, matMulR );
  7356. END;
  7357. ELSE
  7358. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7359. loopMatMulARAR, matMulR );
  7360. END;
  7361. RETURN RESULT
  7362. END "*";
  7363. (*
  7364. Optimized for small arrays (Alexey Morozov)
  7365. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7366. *)
  7367. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7368. VAR
  7369. flags: SET; dadr, ladr, radr: LONGINT;
  7370. v0, v1, v2: REAL;
  7371. BEGIN
  7372. dadr := GetAdr(ADDRESSOF(RESULT));
  7373. ladr := GetAdr(ADDRESSOF(left));
  7374. radr := GetAdr(ADDRESSOF(right));
  7375. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7376. CASE SYSTEM.VAL(LONGINT,flags) OF
  7377. MatVec2x2:
  7378. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7379. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7380. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7381. END;
  7382. END;
  7383. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7384. ELSE
  7385. (* account possible overlapping *)
  7386. v0 := right[0];
  7387. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7388. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7389. END;
  7390. |MatVec3x3:
  7391. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7392. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7393. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7394. END;
  7395. END;
  7396. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7397. ELSE
  7398. (* account possible overlapping *)
  7399. v0 := right[0]; v1 := right[1];
  7400. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7401. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7402. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7403. END;
  7404. |MatVec4x4:
  7405. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7406. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7407. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7408. END;
  7409. END;
  7410. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7411. ELSE
  7412. (* account possible overlapping *)
  7413. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7414. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7415. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7416. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7417. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7418. END;
  7419. ELSE
  7420. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7421. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7422. END;
  7423. RETURN RESULT
  7424. END "*";
  7425. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7426. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7427. BEGIN
  7428. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7429. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7430. RETURN RESULT
  7431. END "*";
  7432. (** LONGREAL *)
  7433. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7434. VAR lval, rval, dval: LONGREAL;
  7435. BEGIN
  7436. dval := 0;
  7437. WHILE (len > 0) DO
  7438. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7439. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7440. END;
  7441. SYSTEM.PUT( dadr, dval );
  7442. END MatMulAXAXLoop;
  7443. (*
  7444. Optimized for small matrices (Alexey Morozov)
  7445. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7446. *)
  7447. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7448. VAR
  7449. flags: SET; dadr, ladr, radr: LONGINT;
  7450. BEGIN
  7451. dadr := GetAdr(ADDRESSOF(RESULT));
  7452. ladr := GetAdr(ADDRESSOF(left));
  7453. radr := GetAdr(ADDRESSOF(right));
  7454. IF (ladr # dadr) & (radr # dadr) THEN
  7455. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7456. CASE SYSTEM.VAL(LONGINT,flags) OF
  7457. Mat2x2:
  7458. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7459. IF dadr = 0 THEN NEW(RESULT,2,2);
  7460. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7461. END;
  7462. END;
  7463. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7464. ELSE
  7465. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7466. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7467. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7468. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7469. END;
  7470. |Mat3x3:
  7471. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7472. IF dadr = 0 THEN NEW(RESULT,3,3);
  7473. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7474. END;
  7475. END;
  7476. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7477. ELSE
  7478. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7479. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7480. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7481. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7482. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7483. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7484. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7485. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7486. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7487. END;
  7488. |Mat4x4:
  7489. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7490. IF dadr = 0 THEN NEW(RESULT,4,4);
  7491. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7492. END;
  7493. END;
  7494. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7495. ELSE
  7496. 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];
  7497. 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];
  7498. 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];
  7499. 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];
  7500. 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];
  7501. 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];
  7502. 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];
  7503. 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];
  7504. 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];
  7505. 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];
  7506. 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];
  7507. 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];
  7508. 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];
  7509. 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];
  7510. 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];
  7511. 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];
  7512. END;
  7513. ELSE
  7514. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7515. loopMatMulAXAX, matMulX );
  7516. END;
  7517. ELSE
  7518. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7519. loopMatMulAXAX, matMulX );
  7520. END;
  7521. RETURN RESULT
  7522. END "*";
  7523. (*
  7524. Optimized for small arrays (Alexey Morozov)
  7525. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7526. *)
  7527. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7528. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7529. VAR
  7530. flags: SET; dadr, ladr, radr: LONGINT;
  7531. v0, v1, v2: LONGREAL;
  7532. BEGIN
  7533. dadr := GetAdr(ADDRESSOF(RESULT));
  7534. ladr := GetAdr(ADDRESSOF(left));
  7535. radr := GetAdr(ADDRESSOF(right));
  7536. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7537. CASE SYSTEM.VAL(LONGINT,flags) OF
  7538. MatVec2x2:
  7539. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7540. IF dadr = 0 THEN NEW(RESULT,2);
  7541. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7542. END;
  7543. END;
  7544. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7545. ELSE
  7546. (* account possible overlapping *)
  7547. v0 := right[0];
  7548. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7549. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7550. END;
  7551. |MatVec3x3:
  7552. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7553. IF dadr = 0 THEN NEW(RESULT,3);
  7554. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7555. END;
  7556. END;
  7557. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7558. ELSE
  7559. (* account possible overlapping *)
  7560. v0 := right[0]; v1 := right[1];
  7561. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7562. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7563. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7564. END;
  7565. |MatVec4x4:
  7566. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7567. IF dadr = 0 THEN NEW(RESULT,4);
  7568. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7569. END;
  7570. END;
  7571. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7572. ELSE
  7573. (* account possible overlapping *)
  7574. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7575. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7576. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7577. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7578. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7579. END;
  7580. ELSE
  7581. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7582. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7583. END;
  7584. RETURN RESULT
  7585. END "*";
  7586. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7587. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7588. BEGIN
  7589. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7590. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7591. RETURN RESULT
  7592. END "*";
  7593. (** SHORTINT *)
  7594. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7595. VAR lval, rval, dval: SHORTINT;
  7596. BEGIN
  7597. SYSTEM.GET( dadr, dval );
  7598. WHILE (len > 0) DO
  7599. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7600. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7601. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7602. END;
  7603. SYSTEM.PUT( dadr, dval );
  7604. END MatMulIncASASLoop;
  7605. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7606. BEGIN
  7607. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7608. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7609. RETURN RESULT
  7610. END "@MulInc";
  7611. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7612. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7613. BEGIN
  7614. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7615. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7616. RETURN RESULT
  7617. END "@MulInc";
  7618. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7619. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7620. BEGIN
  7621. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7622. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7623. RETURN RESULT
  7624. END "@MulInc";
  7625. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7626. BEGIN
  7627. RESULT := -RESULT;
  7628. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7629. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7630. RESULT := -RESULT;
  7631. RETURN RESULT
  7632. END "@MulDec";
  7633. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7634. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7635. BEGIN
  7636. RESULT := -RESULT;
  7637. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7638. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7639. RESULT := -RESULT;
  7640. RETURN RESULT
  7641. END "@MulDec";
  7642. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7643. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7644. BEGIN
  7645. RESULT := -RESULT;
  7646. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7647. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7648. RESULT := -RESULT;
  7649. RETURN RESULT
  7650. END "@MulDec";
  7651. (** INTEGER *)
  7652. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7653. VAR lval, rval, dval: INTEGER;
  7654. BEGIN
  7655. SYSTEM.GET( dadr, dval );
  7656. WHILE (len > 0) DO
  7657. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7658. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7659. END;
  7660. SYSTEM.PUT( dadr, dval );
  7661. END MatMulIncAIAILoop;
  7662. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7663. BEGIN
  7664. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7665. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7666. RETURN RESULT
  7667. END "@MulInc";
  7668. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7669. BEGIN
  7670. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7671. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7672. RETURN RESULT
  7673. END "@MulInc";
  7674. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7675. BEGIN
  7676. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7677. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7678. RETURN RESULT
  7679. END "@MulInc";
  7680. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7681. BEGIN
  7682. RESULT := -RESULT;
  7683. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7684. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7685. RESULT := -RESULT;
  7686. RETURN RESULT
  7687. END "@MulDec";
  7688. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7689. BEGIN
  7690. RESULT := -RESULT;
  7691. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7692. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7693. RESULT := -RESULT;
  7694. RETURN RESULT
  7695. END "@MulDec";
  7696. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7697. BEGIN
  7698. RESULT := -RESULT;
  7699. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7700. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7701. RESULT := -RESULT;
  7702. RETURN RESULT
  7703. END "@MulDec";
  7704. (** LONGINT *)
  7705. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7706. VAR lval, rval, dval: LONGINT;
  7707. BEGIN
  7708. SYSTEM.GET( dadr, dval );
  7709. WHILE (len > 0) DO
  7710. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7711. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7712. END;
  7713. SYSTEM.PUT( dadr, dval );
  7714. END MatMulIncALALLoop;
  7715. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7716. BEGIN
  7717. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7718. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7719. RETURN RESULT
  7720. END "@MulInc";
  7721. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7722. BEGIN
  7723. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7724. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7725. RETURN RESULT
  7726. END "@MulInc";
  7727. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7728. BEGIN
  7729. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7730. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7731. RETURN RESULT
  7732. END "@MulInc";
  7733. OPERATOR "@MulDec"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7734. BEGIN
  7735. RESULT := -RESULT;
  7736. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7737. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7738. RESULT := -RESULT;
  7739. RETURN RESULT
  7740. END "@MulDec";
  7741. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7742. BEGIN
  7743. RESULT := -RESULT;
  7744. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7745. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7746. RESULT := -RESULT;
  7747. RETURN RESULT
  7748. END "@MulDec";
  7749. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7750. BEGIN
  7751. RESULT := -RESULT;
  7752. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7753. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7754. RESULT := -RESULT;
  7755. RETURN RESULT
  7756. END "@MulDec";
  7757. (** REAL *)
  7758. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7759. VAR lval, rval, dval: REAL;
  7760. BEGIN
  7761. SYSTEM.GET( dadr, dval );
  7762. WHILE (len > 0) DO
  7763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7764. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7765. END;
  7766. SYSTEM.PUT( dadr, dval );
  7767. END MatMulIncARARLoop;
  7768. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7769. BEGIN
  7770. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7771. loopMatMulIncARAR, matMulIncR );
  7772. RETURN RESULT
  7773. END "@MulInc";
  7774. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7775. BEGIN
  7776. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7777. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7778. RETURN RESULT
  7779. END "@MulInc";
  7780. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7781. BEGIN
  7782. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7783. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7784. RETURN RESULT
  7785. END "@MulInc";
  7786. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7787. BEGIN
  7788. RESULT := -RESULT;
  7789. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7790. loopMatMulIncARAR, matMulIncR );
  7791. RESULT := -RESULT;
  7792. RETURN RESULT
  7793. END "@MulDec";
  7794. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7795. BEGIN
  7796. RESULT := -RESULT;
  7797. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7798. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7799. RESULT := -RESULT;
  7800. RETURN RESULT
  7801. END "@MulDec";
  7802. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7803. BEGIN
  7804. RESULT := -RESULT;
  7805. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7806. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7807. RESULT := -RESULT;
  7808. RETURN RESULT
  7809. END "@MulDec";
  7810. (** LONGREAL *)
  7811. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7812. VAR lval, rval, dval: LONGREAL;
  7813. BEGIN
  7814. SYSTEM.GET( dadr, dval );
  7815. WHILE (len > 0) DO
  7816. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7817. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7818. END;
  7819. SYSTEM.PUT( dadr, dval );
  7820. END MatMulIncAXAXLoop;
  7821. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7822. BEGIN
  7823. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7824. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7825. RETURN RESULT
  7826. END "@MulInc";
  7827. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7828. BEGIN
  7829. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7830. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7831. RETURN RESULT
  7832. END "@MulInc";
  7833. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7834. BEGIN
  7835. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7836. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7837. RETURN RESULT
  7838. END "@MulInc";
  7839. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7840. BEGIN
  7841. RESULT := -RESULT;
  7842. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7843. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7844. RESULT := -RESULT;
  7845. RETURN RESULT
  7846. END "@MulDec";
  7847. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7848. BEGIN
  7849. RESULT := -RESULT;
  7850. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7851. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7852. RESULT := -RESULT;
  7853. RETURN RESULT
  7854. END "@MulDec";
  7855. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7856. BEGIN
  7857. RESULT := -RESULT;
  7858. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7859. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7860. RESULT := -RESULT;
  7861. RETURN RESULT
  7862. END "@MulDec";
  7863. (*** Cross product ********************************************************************)
  7864. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7865. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7866. BEGIN
  7867. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7868. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7869. END;
  7870. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7871. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7872. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7873. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7874. RETURN RESULT
  7875. END "*";
  7876. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7877. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7878. BEGIN
  7879. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7880. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7881. END;
  7882. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7883. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7884. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7885. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7886. RETURN RESULT
  7887. END "*";
  7888. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7889. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7890. BEGIN
  7891. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7892. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7893. END;
  7894. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7895. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7896. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7897. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7898. RETURN RESULT
  7899. END "*";
  7900. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7901. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7902. BEGIN
  7903. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7904. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7905. END;
  7906. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7907. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7908. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7909. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7910. RETURN RESULT
  7911. END "*";
  7912. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7913. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7914. BEGIN
  7915. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7916. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7917. END;
  7918. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7919. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7920. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7921. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7922. RETURN RESULT
  7923. END "*";
  7924. (** Transpose ********************************************************************)
  7925. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  7926. VAR from1, from2, to1, to2: ADDRESS; dim: LONGINT;
  7927. BEGIN
  7928. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7929. dim := GetDim( src1 ) - 1;
  7930. WHILE (dim > 0) DO
  7931. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7932. END;
  7933. dim := GetDim( src2 ) - 1;
  7934. WHILE (dim > 0) DO
  7935. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7936. END;
  7937. IF from1 < from2 THEN RETURN to1 >= from2;
  7938. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7939. ELSE RETURN TRUE;
  7940. END;
  7941. END Overlap;
  7942. (*
  7943. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  7944. VAR from1, from2, to1, to2: ADDRESS;
  7945. BEGIN
  7946. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7947. DEC( dim );
  7948. WHILE (dim > 0) DO
  7949. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  7950. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7951. END;
  7952. IF from1 < from2 THEN RETURN to1 >= from2;
  7953. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7954. ELSE RETURN TRUE;
  7955. END;
  7956. END Overlap;
  7957. *)
  7958. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS;
  7959. elementsize: SIZE ): ANY;
  7960. VAR ptr, data: ANY; Size: LONGINT;
  7961. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  7962. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  7963. VAR dim,max: LONGINT;
  7964. BEGIN
  7965. dim := GetDim( l );
  7966. IF dim # GetDim( r ) THEN RETURN FALSE END;
  7967. max := dim-1;
  7968. WHILE (dim > 0) DO
  7969. DEC( dim );
  7970. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  7971. END;
  7972. RETURN TRUE;
  7973. END TransposedShape;
  7974. PROCEDURE UseDescriptor;
  7975. VAR tag: LONGINT;
  7976. BEGIN
  7977. SYSTEM.GET( src - 4, tag );
  7978. Heaps.NewRec( ptr, tag, FALSE );
  7979. dest := SYSTEM.VAL( LONGINT, ptr );
  7980. END UseDescriptor;
  7981. PROCEDURE NewData;
  7982. VAR max,dim, len, size: LONGINT;
  7983. BEGIN
  7984. dim := GetDim( src ); size := elementsize;
  7985. PutDim( dest, dim );
  7986. PutSize( dest, elementsize );
  7987. max := dim-1;
  7988. WHILE (dim > 0) DO
  7989. DEC( dim );
  7990. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  7991. PutInc( dest, dim, size ); size := size * len;
  7992. END;
  7993. SYSTEM.NEW( data, size );
  7994. PutAdr( dest, data );
  7995. PutPtr( dest, data );
  7996. END NewData;
  7997. BEGIN
  7998. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  7999. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8000. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8001. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  8002. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  8003. END;
  8004. PutFlags(dest, {TensorFlag});
  8005. NewData(); RETURN ptr;
  8006. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8007. (* check if re-allocation of descriptor is allowed *)
  8008. IF ~(TensorFlag IN GetFlags( dest )) &
  8009. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8010. HALT( 100 );
  8011. END;
  8012. UseDescriptor();
  8013. PutFlags(dest, {TensorFlag});
  8014. NewData(); RETURN ptr;
  8015. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8016. (* check if re-allocation of array data is allowed *)
  8017. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8018. HALT( 100 );
  8019. END;
  8020. NewData();
  8021. RETURN data;
  8022. ELSE (* nothing to do *)
  8023. RETURN NIL;
  8024. END;
  8025. END AllocateTransposed;
  8026. PROCEDURE Transpose*( dest, left: ADDRESS; Size: LONGINT );
  8027. VAR len0, len1, linc0, linc1, dinc0, dinc1, ladr, dadr: LONGINT; p: ANY;
  8028. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8029. BEGIN
  8030. WHILE (len > 0) DO
  8031. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8032. DEC( len );
  8033. END;
  8034. END CopyLoop;
  8035. BEGIN
  8036. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8037. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8038. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8039. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8040. ELSE
  8041. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8042. p := AllocateTransposed(dest,left,Size);
  8043. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8044. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8045. dadr := SYSTEM.VAL( LONGINT, p ); linc0 := GetIncr( left, 0 );
  8046. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8047. WHILE (len0 > 0) DO
  8048. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8049. INC( dadr, dinc0 ); DEC( len0 );
  8050. END;
  8051. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8052. ladr := SYSTEM.VAL( LONGINT, p );
  8053. ELSE
  8054. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8055. END;
  8056. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8057. dadr := GetAdr( dest );
  8058. IF (Size = 4) & (transpose4 # NIL ) THEN
  8059. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8060. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8061. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8062. ELSE
  8063. WHILE (len0 > 0) DO
  8064. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8065. INC( dadr, dinc1 ); DEC( len0 );
  8066. END;
  8067. END;
  8068. END;
  8069. END Transpose;
  8070. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8071. BEGIN
  8072. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8073. RETURN RESULT
  8074. END "`";
  8075. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8076. BEGIN
  8077. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8078. RETURN RESULT
  8079. END "`";
  8080. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8081. BEGIN
  8082. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8083. RETURN RESULT
  8084. END "`";
  8085. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8086. BEGIN
  8087. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8088. RETURN RESULT
  8089. END "`";
  8090. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8091. BEGIN
  8092. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8093. RETURN RESULT
  8094. END "`";
  8095. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: LONGINT ): BOOLEAN;
  8096. VAR i: LONGINT;
  8097. BEGIN
  8098. FOR i := 0 TO rdim - 1 DO
  8099. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8100. END;
  8101. FOR i := 0 TO ldim - 1 DO
  8102. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8103. END;
  8104. RETURN TRUE;
  8105. END CheckTensorGeometry;
  8106. (*
  8107. PROCEDURE Zero(p: ANY; size: LONGINT);
  8108. VAR adr: LONGINT;
  8109. BEGIN
  8110. adr := SYSTEM.VAL(LONGINT,p);
  8111. WHILE(size>0) DO
  8112. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8113. END;
  8114. END Zero;
  8115. *)
  8116. PROCEDURE DoReshape*( VAR dest: LONGINT; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8117. VAR i, Size: LONGINT; ptr, data: ANY; new: LONGINT;
  8118. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8119. squeezingReshape: BOOLEAN;
  8120. PROCEDURE NewDescriptor;
  8121. BEGIN
  8122. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8123. END NewDescriptor;
  8124. (* Added by Alexey
  8125. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8126. *)
  8127. PROCEDURE SqueezingReshape(): BOOLEAN;
  8128. VAR
  8129. i, j, n: LONGINT;
  8130. BEGIN
  8131. IF oldDim > newDim THEN
  8132. i := 0; j := 0;
  8133. WHILE (i < oldDim) & (j < newDim) DO
  8134. n := GetLen(src,i);
  8135. IF n = shape[j] THEN INC(j); END;
  8136. INC(i);
  8137. END;
  8138. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8139. ELSE
  8140. squeezingReshape := FALSE;
  8141. END;
  8142. squeezingReshape := (i = oldDim) & (j = newDim);
  8143. RETURN squeezingReshape;
  8144. END SqueezingReshape;
  8145. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8146. PROCEDURE TargetContinuous(): BOOLEAN;
  8147. VAR
  8148. i, n: LONGINT;
  8149. continue: BOOLEAN;
  8150. BEGIN
  8151. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8152. continue := TRUE;
  8153. WHILE (i > 0) & continue DO
  8154. n := n * GetLen(dest,i);
  8155. DEC(i);
  8156. continue := GetIncr(dest,i) = n;
  8157. END;
  8158. (*TRACE(i,continue,Size,GetSize(dest));*)
  8159. (*tod obviously size is not what I expect it to be*)
  8160. IF (i = 0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8161. RETURN TRUE;
  8162. ELSE
  8163. RETURN FALSE;
  8164. END;
  8165. END TargetContinuous;
  8166. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8167. PROCEDURE PreservesContiguity(): BOOLEAN;
  8168. VAR
  8169. i, n: LONGINT;
  8170. continue: BOOLEAN;
  8171. BEGIN
  8172. i := oldDim-1; n := GetIncr(src,i);
  8173. continue := TRUE;
  8174. WHILE (i > 0) & continue DO
  8175. n := n * GetLen(src,i);
  8176. DEC(i);
  8177. continue := GetIncr(src,i) = n;
  8178. END;
  8179. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8180. RETURN TRUE;
  8181. ELSE Err("Not yet implemented!");
  8182. END;
  8183. END PreservesContiguity;
  8184. (* Added by Alexey *)
  8185. PROCEDURE NewDescriptorForSameData;
  8186. VAR len, size, i, j: LONGINT;
  8187. BEGIN
  8188. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8189. IF ~squeezingReshape THEN
  8190. size := Size;
  8191. FOR i := newDim - 1 TO 0 BY -1 DO
  8192. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8193. size := size * len;
  8194. END;
  8195. ELSE (* squeezing reshape *)
  8196. j := 0; len := shape[j];
  8197. FOR i := 0 TO oldDim-1 DO
  8198. IF GetLen(src,i) = len THEN
  8199. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8200. INC(j);
  8201. IF j < newDim THEN len := shape[j]; END;
  8202. END;
  8203. END;
  8204. END;
  8205. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8206. PutFlags(new,GetFlags(new)+{RangeFlag});
  8207. END;
  8208. PutAdr( new, GetAdr(src) );
  8209. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8210. PutSize( new, Size );
  8211. END NewDescriptorForSameData;
  8212. PROCEDURE NewData;
  8213. VAR len, size, i: LONGINT;
  8214. BEGIN
  8215. size := Size;
  8216. FOR i := newDim - 1 TO 0 BY -1 DO
  8217. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8218. size := size * len;
  8219. END;
  8220. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8221. PutAdr( new, data );
  8222. PutPtr( new, data ); PutDim( new, newDim );
  8223. PutSize( new, Size );
  8224. END NewData;
  8225. PROCEDURE CopyData;
  8226. VAR d, s, dadr: LONGINT;
  8227. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8228. VAR inc, len, i: LONGINT;
  8229. BEGIN
  8230. IF dim = d THEN
  8231. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8232. FOR i := 0 TO len - 1 DO
  8233. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8234. END;
  8235. ELSE
  8236. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8237. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8238. END;
  8239. END Loop;
  8240. BEGIN
  8241. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8242. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8243. s := s * GetLen( src, d ); DEC( d );
  8244. END;
  8245. IF d = -1 THEN (* special case: both continuous *)
  8246. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8247. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8248. END;
  8249. END CopyData;
  8250. PROCEDURE CopyDataBack;
  8251. VAR d, s: LONGINT; sadr: LONGINT;
  8252. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8253. VAR inc, len, i: LONGINT;
  8254. BEGIN
  8255. IF dim = d THEN
  8256. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8257. FOR i := 0 TO len - 1 DO
  8258. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8259. END;
  8260. ELSE
  8261. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8262. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8263. END;
  8264. END Loop;
  8265. BEGIN
  8266. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8267. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8268. s := s * GetLen( dest, d ); DEC( d );
  8269. END;
  8270. IF d = -1 THEN (* special case: both continuous *)
  8271. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8272. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8273. END;
  8274. END CopyDataBack;
  8275. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8276. BEGIN
  8277. ASSERT( GetDim( src ) = GetDim( dest ) );
  8278. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8279. END CopyDescriptor;
  8280. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8281. VAR i: LONGINT;
  8282. BEGIN
  8283. ASSERT(GetDim(dest) = newDim);
  8284. FOR i := 0 TO newDim - 1 DO
  8285. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8286. END;
  8287. RETURN FALSE;
  8288. END ShapeDiffers;
  8289. BEGIN
  8290. (*
  8291. cases
  8292. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8293. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8294. 3.) descriptor may not be reshaped: dest = RANGE
  8295. *)
  8296. (* first check invariants *)
  8297. oldDim := GetDim( src );
  8298. IF oldDim = 0 THEN oldSize := 0
  8299. ELSE
  8300. oldSize := 1;
  8301. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8302. END;
  8303. newDim := LEN( shape, 0 );
  8304. IF newDim = 0 THEN newSize := 0
  8305. ELSE
  8306. newSize := 1;
  8307. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8308. END;
  8309. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8310. Size := GetSize( src );
  8311. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8312. IF dest = src THEN (* added by Alexey *)
  8313. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8314. NewDescriptorForSameData;
  8315. dest := new;
  8316. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8317. (* create a copy of the original descriptor *)
  8318. ptr := GetArrayDesc(newDim); dest := SYSTEM.VAL(LONGINT,ptr); CopyDescriptor(src,dest);
  8319. ELSE
  8320. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8321. END;
  8322. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8323. NewDescriptor; NewData; CopyData; dest := new;
  8324. ELSIF TargetContinuous() THEN
  8325. NewDescriptor; new:=dest; CopyData;
  8326. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8327. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8328. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8329. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8330. END;
  8331. NewDescriptor; NewData; CopyData; dest := new;
  8332. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8333. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8334. NewDescriptor; NewData; CopyData; CopyDescriptor( new, dest );
  8335. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8336. NewDescriptor; NewData; CopyData; CopyDataBack;
  8337. ELSE (* same shape, just copy *)
  8338. CopyContent( src, dest, Size ); RETURN;
  8339. END;
  8340. END DoReshape;
  8341. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8342. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8343. PROCEDURE NewData;
  8344. VAR len, size, i: SIZE;
  8345. BEGIN
  8346. size := elementSize;
  8347. FOR i := dim - 1 TO 0 BY -1 DO
  8348. len := a[i];
  8349. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8350. END;
  8351. IF tag = 0 THEN
  8352. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8353. PutAdr( dest, data );
  8354. ELSE
  8355. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8356. PutAdr(dest, data + ArrDataArrayOffset);
  8357. END;
  8358. PutPtr( dest, data ); PutSize( dest, elementSize );
  8359. END NewData;
  8360. PROCEDURE ClearData;
  8361. (*! todo *)
  8362. END ClearData;
  8363. BEGIN
  8364. dim := LEN( a,0 );
  8365. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8366. IF dest # 0 THEN
  8367. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8368. END;
  8369. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8370. NewData;
  8371. ELSE
  8372. i := 0;
  8373. WHILE (i < dim) & same DO
  8374. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8375. INC( i );
  8376. END;
  8377. IF ~same THEN
  8378. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8379. NewData
  8380. ELSE ClearData
  8381. END;
  8382. END;
  8383. END AllocateTensorA;
  8384. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8385. BEGIN
  8386. AllocateTensorA(a,elementSize,tag,dest);
  8387. END AllocateArrayA;
  8388. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: SIZE; tag: ADDRESS );
  8389. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: SIZE; dest: ADDRESS;
  8390. PROCEDURE NewData;
  8391. VAR len, size: SIZE; i: LONGINT;
  8392. BEGIN
  8393. size := Size;
  8394. FOR i := dim - 1 TO 0 BY -1 DO
  8395. len := a[i];
  8396. (*
  8397. KernelLog.Int(len,10); KernelLog.Ln;
  8398. *)
  8399. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8400. END;
  8401. IF tag = 0 THEN
  8402. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8403. PutAdr( dest, data );
  8404. ELSE
  8405. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8406. PutAdr( dest, data+ ArrDataArrayOffset );
  8407. END;
  8408. PutPtr( dest, data ); PutSize( dest, Size );
  8409. END NewData;
  8410. PROCEDURE ClearData;
  8411. (*! todo *)
  8412. END ClearData;
  8413. BEGIN
  8414. dim := LEN( a,0 );
  8415. dest := SYSTEM.VAL(ADDRESS,destA);
  8416. (*! check range flag! *)
  8417. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8418. IF dest # 0 THEN
  8419. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8420. END;
  8421. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8422. NewData;
  8423. ELSE
  8424. i := 0;
  8425. WHILE (i < dim) & same DO
  8426. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8427. INC( i );
  8428. END;
  8429. IF ~same THEN
  8430. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8431. NewData
  8432. ELSE ClearData
  8433. END;
  8434. END;
  8435. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8436. END AllocateTensorX;
  8437. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8438. VAR dim, i: LONGINT;
  8439. BEGIN
  8440. dim := GetDim( src );
  8441. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8442. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8443. END LenA;
  8444. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8445. VAR dim, len: SIZE; i: LONGINT;
  8446. BEGIN
  8447. dim := GetDim( src ); len := LEN( dest, 0 );
  8448. IF len # dim THEN NEW( dest, dim ); END;
  8449. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8450. END IncrA;
  8451. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8452. VAR dim: SIZE;
  8453. BEGIN
  8454. dim := GetDim(src);
  8455. IF (d<0) OR (d>=dim) THEN HALT(100)
  8456. ELSE
  8457. RETURN GetLen(src,d);
  8458. END;
  8459. END Len;
  8460. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8461. VAR dim: SIZE;
  8462. BEGIN
  8463. dim := GetDim(src);
  8464. IF (d<0) OR (d>=dim) THEN HALT(100)
  8465. ELSE
  8466. RETURN GetIncr(src,d);
  8467. END;
  8468. END Incr;
  8469. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8470. Size: SIZE ): ANY;
  8471. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8472. PROCEDURE NewData;
  8473. VAR len, size, i: SIZE;
  8474. BEGIN
  8475. size := 1;
  8476. FOR i := 0 TO ldim - 1 DO
  8477. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8478. END;
  8479. FOR i := 0 TO rdim - 1 DO
  8480. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8481. END;
  8482. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8483. (*
  8484. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8485. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8486. *)
  8487. size := Size;
  8488. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8489. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8490. END;
  8491. PutAdr( dest, data );
  8492. PutPtr( dest, data );
  8493. END NewData;
  8494. BEGIN
  8495. ldim := GetDim( left ); rdim := GetDim( right );
  8496. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8497. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8498. NewData(); RETURN ptr;
  8499. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8500. IF ~(TensorFlag IN GetFlags( dest )) &
  8501. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8502. HALT( 100 );
  8503. END;
  8504. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8505. NewData(); RETURN ptr;
  8506. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8507. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8508. HALT( 100 );
  8509. END;
  8510. NewData(); RETURN data;
  8511. END;
  8512. RETURN NIL;
  8513. END AllocateTensor;
  8514. (* 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 *)
  8515. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8516. VAR rdim, len, linc, ri: SIZE );
  8517. (* geometric precondition: lengths must coincide *)
  8518. VAR ldim: LONGINT;
  8519. BEGIN
  8520. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8521. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8522. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8523. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8524. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8525. END;
  8526. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8527. DEC( ldim );
  8528. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8529. (GetIncr( right, rdim ) = len * ri) DO
  8530. len := len * GetLen( left, ldim );
  8531. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8532. DEC( ldim );
  8533. END;
  8534. INC( ldim ); INC( rdim );
  8535. IF debug THEN
  8536. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8537. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8538. END;
  8539. END FindPatternTensor;
  8540. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  8541. Loop: BinaryASALoop );
  8542. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8543. origdest: LONGINT; left, right, dest: ADDRESS;
  8544. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: LONGINT );
  8545. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8546. BEGIN
  8547. IF (ldim < lDim) THEN
  8548. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8549. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8550. WHILE (len > 0) DO
  8551. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8552. INC( dadr, dinc ); DEC( len );
  8553. END;
  8554. ELSIF (rdim # loopd) THEN
  8555. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8556. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8557. WHILE (len > 0) DO
  8558. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8559. INC( dadr, dinc ); DEC( len );
  8560. END;
  8561. ELSE
  8562. (*
  8563. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8564. KernelLog.Int(GetAdr(dest),10);
  8565. KernelLog.Int(GetAdr(dest)+clen,10);
  8566. KernelLog.Ln;
  8567. *)
  8568. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8569. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8570. END;
  8571. END Traverse;
  8572. BEGIN
  8573. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8574. (* check array lengths *)
  8575. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8576. p := AllocateTensor( dest, left, right, elementSize );
  8577. (*
  8578. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8579. p := AllocateTensor( left, right, dest, elementSize )
  8580. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8581. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8582. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8583. END;
  8584. (*! to be done: treat overlapping memory *)
  8585. END;
  8586. *)
  8587. (* debugging *)
  8588. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8589. (* check pattern: longest piece that can be done with a loop *)
  8590. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8591. (* run through dimensions *)
  8592. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8593. SYSTEM.PUT( d, dest );
  8594. END ApplyTensorAAAOp;
  8595. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8596. BEGIN
  8597. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8598. SIZEOF( SHORTINT ), MulASSSLoop );
  8599. RETURN RESULT
  8600. END "**";
  8601. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8602. BEGIN
  8603. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8604. SIZEOF( INTEGER ), MulAISILoop );
  8605. RETURN RESULT
  8606. END "**";
  8607. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8608. BEGIN
  8609. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8610. SIZEOF( LONGINT ), MulALSLLoop );
  8611. RETURN RESULT
  8612. END "**";
  8613. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8614. BEGIN
  8615. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8616. loopMulARSR );
  8617. RETURN RESULT
  8618. END "**";
  8619. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8620. BEGIN
  8621. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8622. SIZEOF( LONGREAL ), loopMulAXSX );
  8623. RETURN RESULT
  8624. END "**";
  8625. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8626. BEGIN
  8627. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8628. loopMulAZSZ );
  8629. RETURN RESULT
  8630. END "**";
  8631. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8632. BEGIN
  8633. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8634. loopMulALZSLZ );
  8635. RETURN RESULT
  8636. END "**";
  8637. PROCEDURE InitOptimization;
  8638. VAR p: PROCEDURE;
  8639. BEGIN
  8640. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8641. IF p # NIL THEN
  8642. p;
  8643. ELSE
  8644. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8645. END;
  8646. END InitOptimization;
  8647. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8648. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: ADDRESS;
  8649. BEGIN
  8650. IF src = 0 THEN
  8651. HALT(100);
  8652. ELSE
  8653. srcDim := GetDim(src);
  8654. destDim := srcDim - prefixIndices - suffixIndices;
  8655. (*
  8656. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8657. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8658. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8659. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8660. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8661. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8662. *)
  8663. destPtr := GetArrayDesc(destDim);
  8664. dest := SYSTEM.VAL(LONGINT,destPtr);
  8665. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8666. PutAdr(dest,GetAdr(src));
  8667. PutPtr(dest,GetPtr(src));
  8668. PutFlags(dest,GetFlags(src));
  8669. PutSize(dest,GetSize(src));
  8670. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8671. srcDim := i + prefixIndices + prefixRanges;
  8672. destDim := i + prefixRanges;
  8673. len := GetLen(src,srcDim);
  8674. incr := GetIncr(src,srcDim);
  8675. PutLen(dest,destDim,len);
  8676. PutInc(dest,destDim,incr);
  8677. END;
  8678. (*
  8679. Report("copy descriptor src",src);
  8680. Report("copy descriptor dest",dest);
  8681. *)
  8682. END;
  8683. END CopyDescriptor;
  8684. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8685. VAR dest: ARRAY [?] OF basetype
  8686. CONST src: ARRAY [?] OF basetype
  8687. CONST shape: ARRAY [*] OF LONGINT
  8688. *)
  8689. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8690. BEGIN
  8691. DoReshape(SYSTEM.VAL(LONGINT,RESULT), SYSTEM.VAL(LONGINT,left), right);
  8692. RETURN RESULT
  8693. END Reshape;
  8694. (* OLIVIER *)
  8695. (** creates a degenerated range from an integer.
  8696. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8697. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8698. **)
  8699. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8700. BEGIN RETURN (integer .. integer BY 1)
  8701. END RangeFromInteger;
  8702. (* OLIVIER *)
  8703. (** create an array with the same data but with more dimensions
  8704. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8705. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8706. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8707. e.g.:
  8708. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8709. performs the following type transformation:
  8710. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8711. **)
  8712. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8713. VAR
  8714. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8715. sourceADDRESS, targetADDRESS: LONGINT;
  8716. targetArrayDescriptor: ANY;
  8717. BEGIN
  8718. sourceADDRESS := SYSTEM.VAL(LONGINT, sourceArray);
  8719. targetDimensionality := LEN(keptDimensions, 0);
  8720. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8721. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8722. targetADDRESS := SYSTEM.VAL(LONGINT, RESULT);
  8723. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8724. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8725. PutFlags(targetADDRESS, {TensorFlag});
  8726. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8727. (* set increments and lengths *)
  8728. sourceIndex := 0;
  8729. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8730. IF keptDimensions[targetIndex] THEN
  8731. (* reuse length and increment from source array *)
  8732. ASSERT(sourceIndex < DIM(sourceArray));
  8733. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8734. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8735. INC(sourceIndex)
  8736. ELSE
  8737. (* set length = 1 and increment = 0 *)
  8738. PutLen(targetADDRESS, targetIndex, 1);
  8739. PutInc(targetADDRESS, targetIndex, 0);
  8740. END
  8741. END;
  8742. (* Report("expand dimensions: ", targetADDRESS); *)
  8743. RETURN RESULT
  8744. END ExpandDimensions;
  8745. (* index ranges *)
  8746. (* the length of a range, i.e. the number of indices that it stands for *)
  8747. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8748. VAR
  8749. temp, result: LONGINT;
  8750. BEGIN
  8751. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8752. (* invalid range *)
  8753. result := 0
  8754. ELSIF LAST(range) = MAX(LONGINT) THEN
  8755. (* open-ended range *)
  8756. result := MAX(LONGINT)
  8757. ELSE
  8758. temp := 1 + LAST(range) - FIRST(range);
  8759. result := temp DIV STEP(range);
  8760. IF (temp MOD STEP(range)) # 0 THEN
  8761. INC(result)
  8762. END
  8763. END;
  8764. RETURN result
  8765. END "LEN";
  8766. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8767. BEGIN
  8768. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8769. RETURN RESULT;
  8770. END "ALL";
  8771. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8772. BEGIN
  8773. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8774. RETURN RESULT;
  8775. END "ALL";
  8776. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8777. BEGIN
  8778. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8779. RETURN RESULT;
  8780. END "ALL";
  8781. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8782. BEGIN
  8783. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8784. RETURN RESULT;
  8785. END "ALL";
  8786. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8787. BEGIN
  8788. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8789. RETURN RESULT;
  8790. END "ALL";
  8791. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8792. BEGIN
  8793. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8794. RETURN RESULT;
  8795. END "ALL";
  8796. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8797. BEGIN
  8798. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8799. RETURN RESULT;
  8800. END "ALL";
  8801. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8802. BEGIN
  8803. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8804. RETURN RESULT;
  8805. END "ALL";
  8806. BEGIN
  8807. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8808. END FoxArrayBase.
  8809. Compiler.Compile FoxArrayBase.Mod ~
  8810. SystemTools.ListModules