FoxArrayBase.Mod 344 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710
  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, 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. LenType = SIZE; (* should be SIZE but for legacy reasons we have to use this *)
  23. CONST
  24. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  25. statistics= FALSE;
  26. conservative=TRUE;
  27. ArrDataArrayOffset=4*SIZEOF (ADDRESS); (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(ADDRESS);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. ArrayAlignment=16;
  40. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  41. down = 0; up = 1; (* memory copy modes *)
  42. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  43. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  44. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  45. Size2Flag = 4; (* size = 2 *)
  46. Size3Flag = 5; (* size = 3 *)
  47. Size4Flag = 6; (* size = 4 *)
  48. Size5Flag = 7; (* size = 5 *)
  49. Size6Flag = 8; (* size = 6 *)
  50. Size7Flag = 9; (* size = 7 *)
  51. Size8Flag = 10; (* size = 8 *)
  52. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  53. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  54. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  55. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  56. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  57. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  58. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  59. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  60. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  61. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  62. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  63. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  64. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  65. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  66. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  67. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  68. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  69. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  70. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  71. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  72. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  73. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  74. TYPE
  75. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  76. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  77. LenInc* = RECORD
  78. len*: SIZE;
  79. inc*: SIZE
  80. END;
  81. ArrayDescriptor*= RECORD
  82. ptr*: ANY;
  83. adr*: ADDRESS;
  84. flags*: SET;
  85. dim*: SIZE;
  86. elementSize*: SIZE;
  87. END;
  88. Tensor = POINTER TO ArrayDescriptor;
  89. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  90. lens*: ARRAY 8 OF LenInc;
  91. END;
  92. UnsafeArrayT*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  93. lens*: ARRAY 8 OF LenInc;
  94. END;
  95. A0 = RECORD(ArrayDescriptor) END;
  96. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  97. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  98. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  99. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  100. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  101. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  102. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  103. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  104. T0 = POINTER TO A0;
  105. T1 = POINTER TO A1;
  106. T2 = POINTER TO A2;
  107. T3 = POINTER TO A3;
  108. T4 = POINTER TO A4;
  109. T5 = POINTER TO A5;
  110. T6 = POINTER TO A6;
  111. T7 = POINTER TO A7;
  112. T8 = POINTER TO A8;
  113. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  114. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  115. VAR
  116. temporary*: T0;
  117. alloc*: LONGINT; (* statistics *)
  118. allocTemp*: LONGINT; (* statistics *)
  119. (* procedures that might be replaced by ASM methods *)
  120. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  121. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  122. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  123. loopSubAXAX*, loopSubARAR*, loopSubAZAZ*, loopSubALZALZ*: BinaryAAALoop;
  124. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  125. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  126. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  127. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  128. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  129. transpose4*: TransposeP; transpose8*: TransposeP;
  130. (* optimizations for small arrays (Alexey Morozov) *)
  131. matMulR2x2*: SmallMatMul;
  132. matMulR3x3*: SmallMatMul;
  133. matMulR4x4*: SmallMatMul;
  134. matVecMulR2x2*: SmallMatMul;
  135. matVecMulR3x3*: SmallMatMul;
  136. matVecMulR4x4*: SmallMatMul;
  137. matMulLR2x2*: SmallMatMul;
  138. matMulLR3x3*: SmallMatMul;
  139. matMulLR4x4*: SmallMatMul;
  140. matVecMulLR2x2*: SmallMatMul;
  141. matVecMulLR3x3*: SmallMatMul;
  142. matVecMulLR4x4*: SmallMatMul;
  143. (*
  144. TensorTypePool: ARRAY 32 OF TensorType;
  145. *)
  146. PROCEDURE SetDefaults*; (* set standard procedures *)
  147. BEGIN
  148. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  149. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop; loopSubAXAX := SubAXAXLoop;
  150. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  151. loopAddARAR := AddARARLoop; loopSubARAR := SubARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  152. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop; loopSubAZAZ := SubAZAZLoop; loopSubALZALZ := SubALZALZLoop;
  153. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  154. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  155. loopIncMulAXSX := IncMulAXSXLoop;
  156. loopMatMulIncARAR := MatMulIncARARLoop;
  157. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  158. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  159. loopMulAZSZ := MulAZSZLoop;
  160. loopMulALZSLZ := MulALZSLZLoop;
  161. END SetDefaults;
  162. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  163. BEGIN
  164. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  165. END Err;
  166. (* get increment of dimension dim *)
  167. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  168. BEGIN{UNCHECKED}
  169. RETURN base.lens[dim].inc
  170. END GetIncr;
  171. (* set increment of dimension dim *)
  172. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  173. BEGIN{UNCHECKED}
  174. base.lens[dim].inc := val
  175. END PutInc;
  176. (* get length of dimension dim *)
  177. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  178. BEGIN{UNCHECKED}
  179. RETURN base.lens[dim].len
  180. END GetLen;
  181. (* set length of dimension dim *)
  182. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  183. BEGIN{UNCHECKED}
  184. base.lens[dim].len := val
  185. END PutLen;
  186. (* get data address *)
  187. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  188. BEGIN
  189. RETURN base.adr;
  190. END GetAdr;
  191. (* set data address *)
  192. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  193. BEGIN
  194. base.adr := value
  195. END PutAdr;
  196. PROCEDURE Align(value: ADDRESS): ADDRESS;
  197. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  198. END Align;
  199. (* get data base pointer (GC protection) *)
  200. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  201. BEGIN
  202. RETURN base.ptr;
  203. END GetPtr;
  204. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  205. BEGIN
  206. dest := src;
  207. END SafePut;
  208. (* set data base pointer (GC protection) *)
  209. PROCEDURE PutPtr(CONST base: UnsafeArrayT; value: ANY);
  210. BEGIN
  211. SafePut(base.ptr,value);
  212. END PutPtr;
  213. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  214. BEGIN
  215. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  216. END GetSize;
  217. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  218. BEGIN
  219. base.elementSize := val
  220. END PutSize;
  221. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  222. BEGIN
  223. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  224. END GetDim;
  225. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  226. BEGIN
  227. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  228. END GetFlags;
  229. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  230. BEGIN
  231. base.dim := dim
  232. END PutDim;
  233. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  234. BEGIN
  235. base.flags := flags
  236. END PutFlags;
  237. (* report geometry of array passed via address s *)
  238. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  239. VAR i: SIZE; dim: SIZE;
  240. PROCEDURE Set( s: SET );
  241. VAR i: SIZE; first: BOOLEAN;
  242. BEGIN
  243. KernelLog.String( "{" ); first := TRUE;
  244. FOR i := 31 TO 0 BY -1 DO
  245. IF i IN s THEN
  246. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  247. KernelLog.Int( i, 1 );
  248. END;
  249. END;
  250. KernelLog.String( "}" );
  251. END Set;
  252. BEGIN
  253. KernelLog.String( name );
  254. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  255. ELSE
  256. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  257. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  258. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  259. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  260. KernelLog.Ln; dim := GetDim( s );
  261. IF dim > 32 THEN dim := 0 END;
  262. FOR i := 0 TO dim - 1 DO
  263. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  264. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  265. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  266. END;
  267. (*
  268. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  269. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  270. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  271. *)
  272. END;
  273. END Report;
  274. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  275. VAR (* t: TensorType; *) ptr: Tensor;
  276. p0: T0;
  277. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  278. BEGIN
  279. CASE dim OF
  280. |0: NEW(p0); ptr := p0;
  281. |1:NEW(p1); ptr := p1;
  282. |2:NEW(p2); ptr := p2;
  283. |3:NEW(p3); ptr := p3;
  284. |4:NEW(p4); ptr := p4;
  285. |5:NEW(p5); ptr := p5;
  286. |6:NEW(p6); ptr := p6;
  287. |7:NEW(p7); ptr := p7;
  288. |8:NEW(p8); ptr := p8;
  289. ELSE
  290. HALT(200)
  291. END;
  292. ptr.dim := dim;
  293. ptr.flags := {TensorFlag};
  294. RETURN ptr;
  295. END GetArrayDesc;
  296. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  297. BEGIN
  298. IF d = NIL THEN
  299. d := GetArrayDesc(dim);
  300. ELSIF d.dim # dim THEN
  301. IF ~(TensorFlag IN d.flags) &
  302. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  303. HALT( 100 );
  304. END;
  305. d := GetArrayDesc(dim)
  306. (* ELSE keep as is *)
  307. END;
  308. END EnsureArrayDesc;
  309. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  310. VAR reason: ARRAY 64 OF CHAR;
  311. BEGIN
  312. IF left # 0 THEN Report( "Source operand ", left ) END;
  313. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  314. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  315. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  316. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  317. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  318. ELSE reason := "unknown";
  319. END;
  320. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  321. HALT( 400 );
  322. END Halt;
  323. (** patterns ********************************************************************)
  324. (* 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 *)
  325. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  326. BEGIN
  327. d := dim - 1; len := GetLen( left, d );
  328. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  329. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  330. linc := GetIncr( left, d ); DEC( d );
  331. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  332. len := len * GetLen( left, d ); DEC( d );
  333. END; (* find dimension where pattern does not work any more *)
  334. INC( d );
  335. IF debug THEN
  336. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  337. KernelLog.Ln;
  338. END;
  339. END FindPattern1;
  340. (* 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 *)
  341. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  342. VAR d, len, linc, ri: SIZE );
  343. (* geometric precondition: lengths must coincide *)
  344. BEGIN
  345. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  346. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  347. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  348. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  349. len := len * GetLen( left, d ); DEC( d );
  350. END;
  351. INC( d );
  352. IF debug THEN
  353. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  354. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  355. END;
  356. END FindPattern2;
  357. (* 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 *)
  358. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  359. VAR d, len, linc, ri, di: SIZE );
  360. (* geometric precondition: lengths must coincide *)
  361. BEGIN
  362. d := dim - 1; len := GetLen( left, d );
  363. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  364. END;
  365. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  366. DEC( d );
  367. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  368. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  369. len := len * GetLen( left, d ); DEC( d );
  370. END;
  371. INC( d );
  372. IF debug THEN
  373. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  374. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  375. END;
  376. END FindPattern3;
  377. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  378. VAR d, sl, sr: SIZE;
  379. BEGIN
  380. d := 0; sl := GetAdr( src );
  381. WHILE (d < dim) DO
  382. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  383. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  384. END;
  385. PutAdr( src, sl + sr );
  386. END Reverse;
  387. (* check if forward copy may be performed *)
  388. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  389. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  390. (* precondition: len(src,i)=len(dest,i) *)
  391. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  392. Sufficient (but not necessary) conditions:
  393. 1.) no overlap: src right < dest left or src left > dest right or
  394. 2.) same geometry and src left >= dest left
  395. same geometry if ginc(s)=ginc(d) with
  396. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  397. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  398. *)
  399. BEGIN
  400. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  401. dim := GetDim( src );
  402. WHILE (d < dim) DO
  403. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  404. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  405. END;
  406. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  407. ELSIF ((sr - sl) = (dr - dl)) THEN
  408. IF (sl = dl) THEN (* same memory region, both directions possible *)
  409. ELSIF (sl > dl) THEN
  410. EXCL( modes, down ) (* only copy up possible *)
  411. ELSE (*sl < dl*)
  412. EXCL( modes, up ) (* only copy down possible *)
  413. END;
  414. ELSE
  415. modes := modes - {down, up}; (* neither nor *)
  416. END;
  417. END CopyUpCompatible;
  418. PROCEDURE AllocateTemp(dest: ADDRESS; src: ADDRESS;
  419. Size: SIZE ): ANY;
  420. (* allocate a temporary block containing both descriptor and data *)
  421. BEGIN
  422. HALT(100);
  423. (*
  424. IF statistics THEN INC( allocTemp ) END;
  425. d := 0; len := Size; dim := GetDim( src );
  426. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  427. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  428. dest := SYSTEM.VAL( SIZE, p );
  429. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  430. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  431. FOR i := 0 TO dim - 1 DO
  432. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  433. len := len * GetLen( src, i );
  434. END;
  435. (* Report("allocdest",dest,dim); *)
  436. RETURN p;
  437. *)
  438. END AllocateTemp;
  439. (*** procedures to traverse arrays and apply operators *)
  440. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  441. PROCEDURE ApplyGenericUnaryAAOpS(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  442. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  443. origdest: ADDRESS; modes: SET;
  444. dim: SIZE;
  445. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  446. VAR len: SIZE; linc, dinc: SIZE;
  447. BEGIN
  448. IF dim = loopd THEN
  449. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  450. IF conservative THEN INC( glen, looplen ) END;
  451. ELSE
  452. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  453. dinc := GetIncr( dest, dim ); INC( dim );
  454. WHILE (len > 0) DO
  455. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  456. END;
  457. END;
  458. END Traverse;
  459. BEGIN
  460. dim := GetDim( left );
  461. origdest := 0; modes := {up, down};
  462. (* allocate destination, if necessary *)
  463. IF ~AllocateSameT( dest, left, elementSize ) THEN
  464. CopyUpCompatible( dest, left, modes );
  465. IF up IN modes THEN (* nothing to be done *)
  466. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  467. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  468. END;
  469. END;
  470. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  471. (* check pattern: longest piece that can be done with a loop *)
  472. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  473. Traverse( 0, left.adr, dest.adr);
  474. IF up IN modes THEN (* nothing to be done *)
  475. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  476. ELSE CopyContent( origdest, dest, elementSize );
  477. END;
  478. END ApplyGenericUnaryAAOpS;
  479. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  480. PROCEDURE ApplyGenericUnaryAAOpI(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  481. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  482. origdest: ADDRESS; modes: SET;
  483. dim: SIZE;
  484. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  485. VAR len: SIZE; linc, dinc: SIZE;
  486. BEGIN
  487. IF dim = loopd THEN
  488. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  489. IF conservative THEN INC( glen, looplen ) END;
  490. ELSE
  491. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  492. dinc := GetIncr( dest, dim ); INC( dim );
  493. WHILE (len > 0) DO
  494. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  495. END;
  496. END;
  497. END Traverse;
  498. BEGIN
  499. dim := GetDim( left );
  500. origdest := 0; modes := {up, down};
  501. (* allocate destination, if necessary *)
  502. IF ~AllocateSameT( dest, left, elementSize ) THEN
  503. CopyUpCompatible( dest, left, modes );
  504. IF up IN modes THEN (* nothing to be done *)
  505. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  506. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  507. END;
  508. END;
  509. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  510. (* check pattern: longest piece that can be done with a loop *)
  511. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  512. Traverse( 0, left.adr, dest.adr);
  513. IF up IN modes THEN (* nothing to be done *)
  514. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  515. ELSE CopyContent( origdest, dest, elementSize );
  516. END;
  517. END ApplyGenericUnaryAAOpI;
  518. (** apply unary operator to array: array SIZE -> array SIZE *)
  519. PROCEDURE ApplyGenericUnaryAAOpL(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  520. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  521. origdest: ADDRESS; modes: SET;
  522. dim: SIZE;
  523. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  524. VAR len: SIZE; linc, dinc: SIZE;
  525. BEGIN
  526. IF dim = loopd THEN
  527. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  528. IF conservative THEN INC( glen, looplen ) END;
  529. ELSE
  530. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  531. dinc := GetIncr( dest, dim ); INC( dim );
  532. WHILE (len > 0) DO
  533. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  534. END;
  535. END;
  536. END Traverse;
  537. BEGIN
  538. dim := GetDim( left );
  539. origdest := 0; modes := {up, down};
  540. (* allocate destination, if necessary *)
  541. IF ~AllocateSameT( dest, left, elementSize ) THEN
  542. CopyUpCompatible( dest, left, modes );
  543. IF up IN modes THEN (* nothing to be done *)
  544. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  545. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  546. END;
  547. END;
  548. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  549. (* check pattern: longest piece that can be done with a loop *)
  550. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  551. Traverse( 0, left.adr, dest.adr);
  552. IF up IN modes THEN (* nothing to be done *)
  553. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  554. ELSE CopyContent( origdest, dest, elementSize );
  555. END;
  556. END ApplyGenericUnaryAAOpL;
  557. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  558. PROCEDURE ApplyGenericUnaryAAOpH(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  559. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  560. origdest: ADDRESS; modes: SET;
  561. dim: SIZE;
  562. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  563. VAR len: SIZE; linc, dinc: SIZE;
  564. BEGIN
  565. IF dim = loopd THEN
  566. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  567. IF conservative THEN INC( glen, looplen ) END;
  568. ELSE
  569. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  570. dinc := GetIncr( dest, dim ); INC( dim );
  571. WHILE (len > 0) DO
  572. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  573. END;
  574. END;
  575. END Traverse;
  576. BEGIN
  577. dim := GetDim( left );
  578. origdest := 0; modes := {up, down};
  579. (* allocate destination, if necessary *)
  580. IF ~AllocateSameT( dest, left, elementSize ) THEN
  581. CopyUpCompatible( dest, left, modes );
  582. IF up IN modes THEN (* nothing to be done *)
  583. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  584. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  585. END;
  586. END;
  587. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  588. (* check pattern: longest piece that can be done with a loop *)
  589. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  590. Traverse( 0, left.adr, dest.adr);
  591. IF up IN modes THEN (* nothing to be done *)
  592. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  593. ELSE CopyContent( origdest, dest, elementSize );
  594. END;
  595. END ApplyGenericUnaryAAOpH;
  596. (** apply unary operator to array: array REAL -> array REAL *)
  597. PROCEDURE ApplyGenericUnaryAAOpR(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  598. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  599. origdest: ADDRESS; modes: SET;
  600. dim: SIZE;
  601. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  602. VAR len: SIZE; linc, dinc: SIZE;
  603. BEGIN
  604. IF dim = loopd THEN
  605. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  606. IF conservative THEN INC( glen, looplen ) END;
  607. ELSE
  608. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  609. dinc := GetIncr( dest, dim ); INC( dim );
  610. WHILE (len > 0) DO
  611. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  612. END;
  613. END;
  614. END Traverse;
  615. BEGIN
  616. dim := GetDim( left );
  617. origdest := 0; modes := {up, down};
  618. (* allocate destination, if necessary *)
  619. IF ~AllocateSameT( dest, left, elementSize ) THEN
  620. CopyUpCompatible( dest, left, modes );
  621. IF up IN modes THEN (* nothing to be done *)
  622. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  623. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  624. END;
  625. END;
  626. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  627. (* check pattern: longest piece that can be done with a loop *)
  628. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  629. Traverse( 0, left.adr, dest.adr);
  630. IF up IN modes THEN (* nothing to be done *)
  631. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  632. ELSE CopyContent( origdest, dest, elementSize );
  633. END;
  634. END ApplyGenericUnaryAAOpR;
  635. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  636. PROCEDURE ApplyGenericUnaryAAOpX(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  637. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  638. origdest: ADDRESS; modes: SET;
  639. dim: SIZE;
  640. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  641. VAR len: SIZE; linc, dinc: SIZE;
  642. BEGIN
  643. IF dim = loopd THEN
  644. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  645. IF conservative THEN INC( glen, looplen ) END;
  646. ELSE
  647. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  648. dinc := GetIncr( dest, dim ); INC( dim );
  649. WHILE (len > 0) DO
  650. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  651. END;
  652. END;
  653. END Traverse;
  654. BEGIN
  655. dim := GetDim( left );
  656. origdest := 0; modes := {up, down};
  657. (* allocate destination, if necessary *)
  658. IF ~AllocateSameT( dest, left, elementSize ) THEN
  659. CopyUpCompatible( dest, left, modes );
  660. IF up IN modes THEN (* nothing to be done *)
  661. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  662. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  663. END;
  664. END;
  665. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  666. (* check pattern: longest piece that can be done with a loop *)
  667. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  668. Traverse( 0, left.adr, dest.adr);
  669. IF up IN modes THEN (* nothing to be done *)
  670. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  671. ELSE CopyContent( origdest, dest, elementSize );
  672. END;
  673. END ApplyGenericUnaryAAOpX;
  674. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  675. PROCEDURE ApplyGenericUnaryAAOpZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  676. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  677. origdest: ADDRESS; modes: SET;
  678. dim: SIZE;
  679. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  680. VAR len: SIZE; linc, dinc: SIZE;
  681. BEGIN
  682. IF dim = loopd THEN
  683. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  684. IF conservative THEN INC( glen, looplen ) END;
  685. ELSE
  686. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  687. dinc := GetIncr( dest, dim ); INC( dim );
  688. WHILE (len > 0) DO
  689. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  690. END;
  691. END;
  692. END Traverse;
  693. BEGIN
  694. dim := GetDim( left );
  695. origdest := 0; modes := {up, down};
  696. (* allocate destination, if necessary *)
  697. IF ~AllocateSameT( dest, left, elementSize ) THEN
  698. CopyUpCompatible( dest, left, modes );
  699. IF up IN modes THEN (* nothing to be done *)
  700. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  701. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  702. END;
  703. END;
  704. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  705. (* check pattern: longest piece that can be done with a loop *)
  706. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  707. Traverse( 0, left.adr, dest.adr);
  708. IF up IN modes THEN (* nothing to be done *)
  709. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  710. ELSE CopyContent( origdest, dest, elementSize );
  711. END;
  712. END ApplyGenericUnaryAAOpZ;
  713. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  714. PROCEDURE ApplyGenericUnaryAAOpLZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  715. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  716. origdest: ADDRESS; modes: SET;
  717. dim: SIZE;
  718. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  719. VAR len: SIZE; linc, dinc: SIZE;
  720. BEGIN
  721. IF dim = loopd THEN
  722. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  723. IF conservative THEN INC( glen, looplen ) END;
  724. ELSE
  725. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  726. dinc := GetIncr( dest, dim ); INC( dim );
  727. WHILE (len > 0) DO
  728. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  729. END;
  730. END;
  731. END Traverse;
  732. BEGIN
  733. dim := GetDim( left );
  734. origdest := 0; modes := {up, down};
  735. (* allocate destination, if necessary *)
  736. IF ~AllocateSameT( dest, left, elementSize ) THEN
  737. CopyUpCompatible( dest, left, modes );
  738. IF up IN modes THEN (* nothing to be done *)
  739. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  740. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  741. END;
  742. END;
  743. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  744. (* check pattern: longest piece that can be done with a loop *)
  745. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  746. Traverse( 0, left.adr, dest.adr);
  747. IF up IN modes THEN (* nothing to be done *)
  748. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  749. ELSE CopyContent( origdest, dest, elementSize );
  750. END;
  751. END ApplyGenericUnaryAAOpLZ;
  752. (** apply unary operator to array: array -> array *)
  753. PROCEDURE ApplyUnaryAAOp*(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE;
  754. Loop: UnaryAALoop );
  755. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  756. origdest: SIZE; modes: SET;
  757. dim: SIZE;
  758. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  759. VAR len: SIZE; linc, dinc: SIZE;
  760. BEGIN
  761. IF dim = loopd THEN
  762. Loop( ladr, dadr, loopli, loopdi, looplen );
  763. IF conservative THEN INC( glen, looplen ) END;
  764. ELSE
  765. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  766. dinc := GetIncr( dest, dim ); INC( dim );
  767. WHILE (len > 0) DO
  768. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  769. DEC( len );
  770. END;
  771. END;
  772. END Traverse;
  773. BEGIN
  774. dim := GetDim( left );
  775. origdest := 0; modes := {up, down};
  776. (* allocate destination, if necessary *)
  777. IF ~AllocateSameT( dest, left, elementSize ) THEN
  778. CopyUpCompatible( dest, left, modes );
  779. IF up IN modes THEN (* nothing to be done *)
  780. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  781. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  782. END;
  783. END;
  784. (*
  785. (* allocate destination, if necessary *)
  786. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  787. ELSIF CheckGeometry( left, dest, dim )
  788. END;
  789. *)
  790. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  791. (* check pattern: longest piece that can be done with a loop *)
  792. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  793. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  794. IF up IN modes THEN (* nothing to be done *)
  795. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  796. ELSE CopyContent( origdest, dest, elementSize );
  797. END;
  798. END ApplyUnaryAAOp;
  799. (** apply unary operator to array: array -> scalar *)
  800. PROCEDURE ApplyUnaryASOp*( dest: ADDRESS; CONST left: UnsafeArrayT; Loop: UnaryASLoop );
  801. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  802. VAR dim: SIZE;
  803. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  804. VAR len: SIZE; linc: SIZE;
  805. BEGIN
  806. IF dim = loopd THEN
  807. Loop( ladr, dest, loopli, looplen );
  808. IF conservative THEN INC( glen, looplen ) END;
  809. ELSE
  810. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  811. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  812. END;
  813. END Traverse;
  814. BEGIN
  815. dim := GetDim( left );
  816. IF debug THEN Report( "AS: left", left ); END;
  817. (* check pattern: longest piece that can be done with a loop *)
  818. IF conservative THEN glen := 0 END;
  819. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  820. IF conservative THEN
  821. looplen := 1;
  822. WHILE (dim > 0) DO
  823. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  824. END;
  825. ASSERT( looplen = glen );
  826. END;
  827. END ApplyUnaryASOp;
  828. (** apply unary operator to array: scalar -> array *)
  829. PROCEDURE ApplyUnarySAOp*( VAR dest: UnsafeArrayT; right: ADDRESS; Loop: UnarySALoop );
  830. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  831. VAR dim: SIZE;
  832. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  833. VAR len: SIZE; dinc: SIZE;
  834. BEGIN
  835. IF dim = loopd THEN
  836. Loop( right, dadr, loopdi, looplen );
  837. IF conservative THEN INC( glen, looplen ) END;
  838. ELSE
  839. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  840. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  841. END;
  842. END Traverse;
  843. BEGIN
  844. dim := GetDim( dest );
  845. IF debug THEN Report( "AS: dest", dest ); END;
  846. (* check pattern: longest piece that can be done with a loop *)
  847. IF conservative THEN glen := 0 END;
  848. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  849. IF conservative THEN
  850. looplen := 1;
  851. WHILE (dim > 0) DO
  852. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  853. END;
  854. ASSERT( looplen = glen );
  855. END;
  856. END ApplyUnarySAOp;
  857. (** apply binary operator : array x array -> array *)
  858. PROCEDURE ApplyBinaryAAAOp*( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  859. Loop: BinaryAAALoop );
  860. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  861. origdest: SIZE; modes: SET; dim: SIZE;
  862. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  863. VAR len: SIZE; linc, rinc, dinc: SIZE;
  864. BEGIN
  865. IF dim = loopd THEN
  866. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  867. IF conservative THEN INC( glen, looplen ) END;
  868. ELSE
  869. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  870. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  871. WHILE (len > 0) DO
  872. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  873. INC( dadr, dinc ); DEC( len );
  874. END;
  875. END;
  876. END Traverse;
  877. BEGIN
  878. dim := GetDim( left );
  879. (* allocate destination, if necessary *)
  880. IF ~SameShape( left, right ) THEN
  881. Halt( GeometryMismatch, left, right, 0 )
  882. END;
  883. origdest := 0; modes := {up, down};
  884. IF ~AllocateSameT( dest, left, elementSize ) THEN
  885. CopyUpCompatible( dest, left, modes );
  886. CopyUpCompatible( dest, right, modes );
  887. IF up IN modes THEN (* nothing to be done *)
  888. ELSIF down IN modes THEN
  889. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  890. ELSE
  891. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  892. END;
  893. END;
  894. (* debugging *)
  895. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  896. (* check pattern: longest piece that can be done with a loop *)
  897. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  898. (* run through dimensions *)
  899. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  900. IF up IN modes THEN (* nothing to be done *)
  901. ELSIF down IN modes THEN
  902. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  903. ELSE CopyContent( origdest, dest, elementSize );
  904. END;
  905. END ApplyBinaryAAAOp;
  906. (** apply binary operator: array x scalar -> array *)
  907. PROCEDURE ApplyBinaryASAOp*( VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; right: ADDRESS;
  908. elementSize: SIZE;
  909. Loop: BinaryASALoop );
  910. VAR loopd, looplen, loopli, loopdi: SIZE; glen: SIZE;
  911. origdest: SIZE; modes: SET; dim: SIZE;
  912. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  913. VAR len: SIZE; linc, dinc: SIZE;
  914. BEGIN
  915. IF dim = loopd THEN
  916. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  917. IF conservative THEN INC( glen, looplen ) END;
  918. ELSE
  919. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  920. dinc := GetIncr( dest, dim ); INC( dim );
  921. WHILE (len > 0) DO
  922. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  923. DEC( len );
  924. END;
  925. END;
  926. END Traverse;
  927. BEGIN
  928. dim := GetDim( left );
  929. (* allocate destination, if necessary *)
  930. origdest := 0; modes := {up, down};
  931. IF ~AllocateSameT( dest, left, elementSize ) THEN
  932. CopyUpCompatible( dest, left, modes );
  933. IF up IN modes THEN (* nothing to be done *)
  934. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  935. ELSE origdest := dest; HALT(100); (*p := AllocateTemp( dest, origdest, elementSize );*)
  936. END;
  937. END;
  938. (* debugging *)
  939. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  940. (* check pattern: longest piece that can be done with a loop *)
  941. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  942. (* run through dimensions *)
  943. IF conservative THEN glen := 0 END;
  944. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  945. IF conservative THEN
  946. looplen := 1;
  947. WHILE (dim > 0) DO
  948. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  949. END;
  950. ASSERT( looplen = glen );
  951. END;
  952. IF up IN modes THEN (* nothing to be done *)
  953. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  954. ELSE CopyContent( origdest, dest, elementSize );
  955. END;
  956. END ApplyBinaryASAOp;
  957. (** apply binary operator: array x array -> scalar *)
  958. PROCEDURE ApplyBinaryAASOp*( dest: ADDRESS; CONST left, right: UnsafeArrayT; Loop: BinaryAASLoop );
  959. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  960. dim: SIZE;
  961. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  962. VAR len: SIZE; linc, rinc: SIZE;
  963. BEGIN
  964. IF dim = loopd THEN
  965. Loop( ladr, radr, dest, loopli, loopri, looplen );
  966. IF conservative THEN INC( glen, looplen ) END;
  967. ELSE
  968. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  969. rinc := GetIncr( right, dim ); INC( dim );
  970. WHILE (len > 0) DO
  971. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  972. DEC( len );
  973. END;
  974. END;
  975. END Traverse;
  976. BEGIN
  977. dim := GetDim( left );
  978. (* check array lengths *)
  979. IF ~SameShape( left, right ) THEN
  980. Halt( GeometryMismatch, left, right, 0 )
  981. END;
  982. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  983. (* check pattern: longest piece that can be done with a loop *)
  984. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  985. (* run through dimensions *)
  986. IF conservative THEN glen := 0 END;
  987. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  988. IF conservative THEN
  989. looplen := 1;
  990. WHILE (dim > 0) DO
  991. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  992. END;
  993. ASSERT( looplen = glen );
  994. END;
  995. END ApplyBinaryAASOp;
  996. (** special binary operator: array x array -> boolean *)
  997. PROCEDURE ApplyBinaryAABOp*( CONST left, right: UnsafeArrayT;
  998. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  999. VAR loopd, looplen, loopli, loopri: SIZE; dim: SIZE;
  1000. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1001. VAR len: SIZE; linc, rinc: SIZE;
  1002. BEGIN
  1003. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1004. ELSE
  1005. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1006. rinc := GetIncr( right, dim ); INC( dim );
  1007. WHILE (len > 0) DO
  1008. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1009. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1010. END;
  1011. RETURN TRUE;
  1012. END;
  1013. END Traverse;
  1014. BEGIN
  1015. dim := GetDim( left );
  1016. (* check array lengths *)
  1017. IF ~SameShape( left, right ) THEN
  1018. RETURN geometryMismatchDefault
  1019. END;
  1020. (* is destination already allocated? (might be a temporary result) *)
  1021. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1022. (* check pattern: longest piece that can be done with a loop *)
  1023. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1024. (* run through dimensions *)
  1025. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1026. END ApplyBinaryAABOp;
  1027. (** special binary operator: array x scalar -> boolean *)
  1028. PROCEDURE ApplyBinaryASBOp( CONST left: UnsafeArrayT; right: ADDRESS;
  1029. Loop: BinaryASBLoop ): BOOLEAN;
  1030. VAR loopd, looplen, loopli: SIZE; dim: SIZE;
  1031. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1032. VAR len: SIZE; linc: SIZE;
  1033. BEGIN
  1034. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1035. ELSE
  1036. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1037. WHILE (len > 0) DO
  1038. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1039. INC( ladr, linc ); DEC( len );
  1040. END;
  1041. RETURN TRUE;
  1042. END;
  1043. END Traverse;
  1044. BEGIN
  1045. dim := GetDim( left );
  1046. IF debug THEN Report( "AAB:left", left ); END;
  1047. (* check pattern: longest piece that can be done with a loop *)
  1048. FindPattern1( left, dim, loopd, looplen, loopli );
  1049. (* run through dimensions *)
  1050. RETURN Traverse( 0, GetAdr( left ) );
  1051. END ApplyBinaryASBOp;
  1052. (**** operators *)
  1053. (*** copy *)
  1054. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1055. BEGIN
  1056. WHILE len > 0 DO
  1057. SYSTEM.PUT32(dadr, SYSTEM.GET32(ladr));
  1058. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1059. END;
  1060. (*CODE {SYSTEM.i386}
  1061. MOV ECX, [EBP+ladr] ; ECX := ladr
  1062. MOV EDX, [EBP+dadr] ; EDX := dadr
  1063. MOV EBX, [EBP+len] ; EBX := len
  1064. start:
  1065. CMP EBX, 0 ;
  1066. JLE end ; WHILE EBX > 0 DO
  1067. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1068. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1069. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1070. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1071. DEC EBX ; DEC(EBX)
  1072. JMP start
  1073. end:*)
  1074. END Copy4;
  1075. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1076. BEGIN
  1077. WHILE len > 0 DO
  1078. SYSTEM.PUT16(dadr, SYSTEM.GET16(ladr));
  1079. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1080. END;
  1081. (*CODE {SYSTEM.i386}
  1082. MOV ECX, [EBP+ladr] ; ECX := ladr
  1083. MOV EDX, [EBP+dadr] ; EDX := dadr
  1084. MOV EBX, [EBP+len] ; EBX := len
  1085. start:
  1086. CMP EBX, 0 ;
  1087. JLE end ; WHILE EBX > 0 DO
  1088. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1089. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1090. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1091. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1092. DEC EBX ; DEC(EBX)
  1093. JMP start
  1094. end:*)
  1095. END Copy2;
  1096. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1097. BEGIN
  1098. WHILE len > 0 DO
  1099. SYSTEM.PUT8(dadr, SYSTEM.GET8(ladr));
  1100. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1101. END;
  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 AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1110. MOV [EDX], AL ; 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 Copy1;
  1117. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1118. BEGIN
  1119. WHILE len > 0 DO
  1120. SYSTEM.PUT64(dadr, SYSTEM.GET64(ladr));
  1121. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1122. END;
  1123. (*CODE {SYSTEM.i386}
  1124. MOV ECX, [EBP+ladr] ; ECX := ladr
  1125. MOV EDX, [EBP+dadr] ; EDX := dadr
  1126. MOV EBX, [EBP+len] ; EBX := len
  1127. start:
  1128. CMP EBX, 0 ;
  1129. JLE end ; WHILE EBX > 0 DO
  1130. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1131. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1132. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1133. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1134. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1135. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1136. DEC EBX ; DEC(EBX)
  1137. JMP start
  1138. end:*)
  1139. END Copy8;
  1140. PROCEDURE (*-*)MoveB*( srcadr, destadr, len: SIZE );
  1141. BEGIN
  1142. IF (len > 0) THEN
  1143. SYSTEM.MOVE(srcadr, destadr, len);
  1144. ELSE
  1145. len := -len;
  1146. WHILE len > 0 DO
  1147. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1148. DEC(srcadr); DEC(destadr); DEC(len);
  1149. END;
  1150. END;
  1151. END MoveB;
  1152. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1153. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1154. origdest: ADDRESS; modes: SET; dim: SIZE;
  1155. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1156. BEGIN
  1157. IF (dinc = elementSize) & (linc = elementSize) THEN
  1158. MoveB( ladr, dadr, len * elementSize );
  1159. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1160. MoveB( ladr, dadr, - len * elementSize );
  1161. ELSIF elementSize = 1 THEN
  1162. Copy1( ladr, dadr, linc, dinc, len );
  1163. ELSIF elementSize = 2 THEN
  1164. Copy2( ladr, dadr, linc, dinc, len );
  1165. ELSIF elementSize = 4 THEN
  1166. Copy4( ladr, dadr, linc, dinc, len );
  1167. ELSIF elementSize = 8 THEN
  1168. Copy8( ladr, dadr, linc, dinc, len );
  1169. ELSE (* SYSTEM.MOVE is expensive ! *)
  1170. WHILE (len > 0) DO
  1171. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1172. INC( dadr, dinc );
  1173. END;
  1174. END;
  1175. END Loop;
  1176. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1177. VAR len: SIZE; linc, dinc: SIZE;
  1178. BEGIN
  1179. IF dim = loopd THEN
  1180. Loop( ladr, dadr, loopli, loopdi, looplen );
  1181. IF conservative THEN INC( glen, looplen ) END;
  1182. ELSE
  1183. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1184. dinc := GetIncr( dest, dim ); INC( dim );
  1185. WHILE (len > 0) DO
  1186. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1187. DEC( len );
  1188. END;
  1189. END;
  1190. END Traverse;
  1191. BEGIN
  1192. dim := GetDim( src );
  1193. origdest := 0; modes := {up, down}; (* copy modes *)
  1194. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1195. CopyUpCompatible( dest, src, modes );
  1196. IF up IN modes THEN (* nothing to be done *)
  1197. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1198. Reverse( src, dim ); Reverse( dest, dim )
  1199. ELSE (* can only copy via double buffer *)
  1200. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1201. END;
  1202. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1203. END;
  1204. (* check pattern: longest piece that can be done with a loop *)
  1205. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1206. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1207. IF up IN modes THEN (* nothing to be done *)
  1208. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1209. ELSE CopyContent( origdest, dest, elementSize );
  1210. END;
  1211. END CopyContent;
  1212. PROCEDURE AllocateSameT( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  1213. VAR data: ANY; Size: SIZE;
  1214. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1215. PROCEDURE NewData;
  1216. VAR dim, len, size: SIZE;
  1217. BEGIN
  1218. dim := GetDim( src ); size := elementsize;
  1219. PutDim( dest, dim );
  1220. PutSize( dest, elementsize );
  1221. WHILE (dim > 0) DO
  1222. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1223. PutInc( dest, dim, size ); size := size * len;
  1224. END;
  1225. SYSTEM.NEW( data, size + ArrayAlignment);
  1226. PutAdr( dest, Align(data));
  1227. PutPtr( dest, data );
  1228. END NewData;
  1229. BEGIN
  1230. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1231. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1232. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1233. dest := GetArrayDesc( GetDim( src ) );
  1234. PutFlags(dest, {TensorFlag});
  1235. NewData();
  1236. RETURN TRUE;
  1237. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1238. (* check if re-allocation of descriptor is allowed *)
  1239. IF ~(TensorFlag IN GetFlags( dest )) &
  1240. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1241. HALT( 100 );
  1242. END;
  1243. dest := GetArrayDesc( GetDim( src ) );
  1244. PutFlags(dest, {TensorFlag});
  1245. NewData();
  1246. RETURN TRUE;
  1247. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1248. (* check if re-allocation of array data is allowed *)
  1249. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1250. HALT( 100 );
  1251. END;
  1252. NewData();
  1253. RETURN TRUE;
  1254. ELSE (* nothing to do *)
  1255. RETURN FALSE;
  1256. END;
  1257. END AllocateSameT;
  1258. PROCEDURE Assign*(VAR dest: ADDRESS; src: ADDRESS);
  1259. VAR oldDest: ADDRESS;
  1260. BEGIN
  1261. IF (dest # NIL) THEN
  1262. IF (TensorFlag IN GetFlags( dest )) THEN (* old heap pointer overwritten *)
  1263. oldDest := dest;
  1264. Heaps.Assign(dest, src);
  1265. ELSE
  1266. (*
  1267. Heaps.ResetMathArray(dest);
  1268. *)
  1269. dest := src;
  1270. END;
  1271. ELSE
  1272. (* Heaps.Refer(src);*)
  1273. dest := src;
  1274. END;
  1275. END Assign;
  1276. PROCEDURE TempDescCopy( CONST src: UnsafeArrayT ): UnsafeArrayT;
  1277. VAR dest: UnsafeArrayT; adr: ADDRESS;dim: SIZE;
  1278. BEGIN
  1279. dim := GetDim(src);
  1280. dest := GetArrayDesc(dim);
  1281. SYSTEM.MOVE( src, dest, dim * SIZEOF(LenInc) + MathLenOffset );
  1282. dest.adr := NIL;
  1283. SYSTEM.PUT(ADDRESS OF dest.ptr, NIL); (* no refcounting here ! *)
  1284. PutFlags( dest, {} );
  1285. RETURN dest;
  1286. END TempDescCopy;
  1287. (* used when arrays are passed by value *)
  1288. PROCEDURE CopyArraySelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1289. VAR p: UnsafeArrayT;
  1290. BEGIN
  1291. ASSERT( src = dest );
  1292. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1293. CopyArray( dest, p, elementsize );
  1294. END CopyArraySelf;
  1295. PROCEDURE CopyArray*( dest: UnsafeArray (* untraced! *); CONST src: UnsafeArrayT; elementsize: SIZE );
  1296. VAR srcdim, destdim: SIZE;
  1297. BEGIN
  1298. ASSERT(dest # NIL); (* only possible by compiler error *)
  1299. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1300. srcdim := GetDim(src);
  1301. destdim := GetDim(dest);
  1302. (*
  1303. Debugging.Stack("copy array");
  1304. *)
  1305. Report( "copy array source", src ); Report( "copy array des", dest );
  1306. HALT(100);
  1307. ELSIF src = dest THEN (* self copy *)
  1308. CopyArraySelf( dest, src, elementsize );
  1309. ELSE
  1310. IF AllocateSameT( dest, src, elementsize ) THEN END;
  1311. CopyContent( dest, src, elementsize )
  1312. END;
  1313. END CopyArray;
  1314. PROCEDURE CopyTensorSelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1315. BEGIN
  1316. dest := NIL;
  1317. CopyTensor( dest, src, elementsize );
  1318. END CopyTensorSelf;
  1319. PROCEDURE CopyTensor*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT;
  1320. elementsize: SIZE );
  1321. BEGIN
  1322. (* Report("dest",dest); Report("src",src); *)
  1323. IF (src = NIL) THEN dest := NIL
  1324. ELSIF (dest = NIL) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1325. IF AllocateSameT( dest, src, elementsize ) THEN END; (* includes check if allocation is allowed *)
  1326. CopyContent( dest, src, elementsize );
  1327. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1328. ELSE CopyContent( dest, src, elementsize )
  1329. END;
  1330. END CopyTensor;
  1331. (* copy descriptor of src to that of dest. If not existent then create.*)
  1332. PROCEDURE ShallowCopy*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT);
  1333. VAR ptr: ANY; flags: SET;
  1334. PROCEDURE CopyDescriptor;
  1335. BEGIN
  1336. SafePut(dest.ptr, src.ptr);(* With refcount. GC! Must do before MOVE (NIL <- src.ptr), then copy redundant *)
  1337. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1338. END CopyDescriptor;
  1339. BEGIN
  1340. (*
  1341. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1342. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1343. *)
  1344. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1345. dest := GetArrayDesc( GetDim( src ) );
  1346. CopyDescriptor();
  1347. PutFlags(dest, {TensorFlag});
  1348. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1349. flags := GetFlags(dest);
  1350. (* check if re-allocation of descriptor is allowed *)
  1351. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1352. Halt(DimensionMismatch,src,0,dest);
  1353. END;
  1354. (* create a new descriptor!!! (added by Alexey) *)
  1355. dest := GetArrayDesc( GetDim( src ) );
  1356. CopyDescriptor();
  1357. PutFlags(dest, flags);
  1358. ELSE
  1359. flags := GetFlags(dest);
  1360. (* check if re-allocation of array data is allowed *)
  1361. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1362. Halt(AllocationForbidden,src,0,dest);
  1363. END;
  1364. CopyDescriptor();
  1365. PutFlags(dest, flags);
  1366. END;
  1367. END ShallowCopy;
  1368. (*
  1369. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1370. BEGIN
  1371. IF debug THEN
  1372. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1373. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1374. END;
  1375. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1376. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1377. END DescriptorCopy;
  1378. *)
  1379. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY {UNSAFE} [?]);
  1380. BEGIN
  1381. ShallowCopy(dest,src);
  1382. END ZeroCopy;
  1383. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1384. BEGIN
  1385. ZeroCopy(src, RESULT);
  1386. RETURN RESULT
  1387. END "ALIAS";
  1388. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1389. VAR dim: SIZE;
  1390. BEGIN
  1391. dim := GetDim( l );
  1392. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1393. WHILE (dim > 0) DO
  1394. DEC( dim );
  1395. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1396. END;
  1397. RETURN TRUE;
  1398. END SameShape;
  1399. (*
  1400. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1401. (*
  1402. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1403. check if deep copy can be avoided and if so then do a shallow copy
  1404. *)
  1405. BEGIN
  1406. ASSERT( dest # 0 ); (* impossible *)
  1407. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1408. HALT( 100 );
  1409. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1410. (* must copy (and allocate) *)
  1411. CopyArray( dest, src, elementsize );
  1412. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1413. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1414. ELSE CopyContent( dest, src, elementsize )
  1415. END;
  1416. ELSE DescriptorCopy( src, dest )
  1417. END;
  1418. END ZeroCopyArray;
  1419. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1420. (*
  1421. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1422. check if deep copy can be avoided and if so then do a shallow copy
  1423. *)
  1424. BEGIN
  1425. IF debug THEN
  1426. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1427. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1428. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1429. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1430. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1431. END;
  1432. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1433. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1434. ELSE
  1435. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1436. END;
  1437. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1438. (* must copy (and allocate) *)
  1439. CopyTensor( dest, src, elementsize );
  1440. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1441. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1442. ELSE
  1443. HALT( 100 ); (* copy forbidden *)
  1444. END;
  1445. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1446. DescriptorCopy( src, dest );
  1447. ELSE
  1448. HALT( 100 ); (* different shapes: not allowed *)
  1449. END;
  1450. END ZeroCopyTensor;
  1451. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1452. VAR i: LONGINT;
  1453. BEGIN
  1454. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1455. CopyContent( dest, left, elementSize )
  1456. ELSE
  1457. IF debug THEN
  1458. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1459. KernelLog.Ln;
  1460. END;
  1461. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1462. FOR i := 0 TO dim - 1 DO
  1463. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1464. END;
  1465. END;
  1466. END ZeroCopy;
  1467. *)
  1468. (*** conversions ****)
  1469. (** SHORTINT -> INTEGER *)
  1470. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1471. BEGIN
  1472. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1473. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1474. DEC( len );
  1475. END;
  1476. END ConvertASAILoop;
  1477. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1478. BEGIN
  1479. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1480. RETURN RESULT
  1481. END "@Convert";
  1482. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1483. BEGIN
  1484. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1485. RETURN RESULT
  1486. END "LONG";
  1487. (** SHORTINT -> LONGINT *)
  1488. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1489. BEGIN
  1490. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1491. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1492. DEC( len );
  1493. END;
  1494. END ConvertLoopSL;
  1495. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF LONGINT;
  1496. BEGIN
  1497. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopSL );
  1498. RETURN RESULT
  1499. END "@Convert";
  1500. (** SHORTINT -> REAL *)
  1501. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1502. VAR lval: SHORTINT; dval: REAL;
  1503. BEGIN
  1504. WHILE (len > 0) DO
  1505. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1506. INC( dadr, dinc ); DEC( len );
  1507. END;
  1508. END ConvertLoopSR;
  1509. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF REAL;
  1510. BEGIN
  1511. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopSR );
  1512. RETURN RESULT
  1513. END "@Convert";
  1514. (** SHORTINT -> LONGREAL *)
  1515. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1516. VAR lval: SHORTINT; dval: LONGREAL;
  1517. BEGIN
  1518. WHILE (len > 0) DO
  1519. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1520. INC( dadr, dinc ); DEC( len );
  1521. END;
  1522. END ConvertLoopSX;
  1523. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1524. BEGIN
  1525. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopSX );
  1526. RETURN RESULT
  1527. END "@Convert";
  1528. (** INTEGER -> SHORTINT (SHORT) *)
  1529. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1530. VAR lval: INTEGER; dval: SHORTINT;
  1531. BEGIN
  1532. WHILE (len > 0) DO
  1533. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1534. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1535. END;
  1536. END ConvertLoopIS;
  1537. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1538. BEGIN
  1539. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1540. RETURN RESULT
  1541. END "@Convert";
  1542. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1543. BEGIN
  1544. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1545. RETURN RESULT
  1546. END "SHORT";
  1547. (** INTEGER -> LONGINT *)
  1548. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1549. BEGIN
  1550. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1551. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1552. DEC( len );
  1553. END;
  1554. END ConvertLoopIL;
  1555. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1556. BEGIN
  1557. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1558. RETURN RESULT
  1559. END "@Convert";
  1560. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1561. BEGIN
  1562. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1563. RETURN RESULT
  1564. END "LONG";
  1565. (** INTEGER -> REAL *)
  1566. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1567. VAR lval: INTEGER; dval: REAL;
  1568. BEGIN
  1569. WHILE (len > 0) DO
  1570. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1571. INC( dadr, dinc ); DEC( len );
  1572. END;
  1573. END ConvertLoopIR;
  1574. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1575. BEGIN
  1576. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopIR );
  1577. RETURN RESULT
  1578. END "@Convert";
  1579. (** INTEGER -> LONGREAL *)
  1580. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1581. VAR lval: INTEGER; dval: LONGREAL;
  1582. BEGIN
  1583. WHILE (len > 0) DO
  1584. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1585. INC( dadr, dinc ); DEC( len );
  1586. END;
  1587. END ConvertLoopIX;
  1588. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1589. BEGIN
  1590. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopIX );
  1591. RETURN RESULT
  1592. END "@Convert";
  1593. (** LONGINT -> INTEGER (SHORT) *)
  1594. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1595. VAR lval: LONGINT; dval: INTEGER;
  1596. BEGIN
  1597. WHILE (len > 0) DO
  1598. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1599. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1600. END;
  1601. END ConvertLoopLI;
  1602. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1603. BEGIN
  1604. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1605. RETURN RESULT
  1606. END "@Convert";
  1607. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1608. BEGIN
  1609. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1610. RETURN RESULT
  1611. END "SHORT";
  1612. (** LONGINT -> REAL *)
  1613. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1614. VAR lval: LONGINT; dval: REAL;
  1615. BEGIN
  1616. WHILE (len > 0) DO
  1617. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1618. INC( dadr, dinc ); DEC( len );
  1619. END;
  1620. END ConvertLoopLR;
  1621. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1622. BEGIN
  1623. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopLR );
  1624. RETURN RESULT
  1625. END "@Convert";
  1626. (** LONGINT -> LONGREAL *)
  1627. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1628. VAR lval: LONGINT; dval: LONGREAL;
  1629. BEGIN
  1630. WHILE (len > 0) DO
  1631. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1632. INC( dadr, dinc ); DEC( len );
  1633. END;
  1634. END ConvertLoopLX;
  1635. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1636. BEGIN
  1637. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopLX );
  1638. RETURN RESULT
  1639. END "@Convert";
  1640. (** REAL -> LONGINT (ENTIER) *)
  1641. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1642. VAR lval: REAL; dval: LONGINT;
  1643. BEGIN
  1644. WHILE (len > 0) DO
  1645. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1646. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1647. END;
  1648. END ConvertLoopRL;
  1649. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1650. BEGIN
  1651. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1652. RETURN RESULT
  1653. END "@Convert";
  1654. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1655. BEGIN
  1656. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1657. RETURN RESULT
  1658. END "ENTIER";
  1659. (** REAL -> LONGREAL *)
  1660. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1661. VAR lval: REAL; dval: LONGREAL;
  1662. BEGIN
  1663. WHILE (len > 0) DO
  1664. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1665. INC( dadr, dinc ); DEC( len );
  1666. END;
  1667. END ConvertLoopRX;
  1668. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1669. BEGIN
  1670. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1671. RETURN RESULT
  1672. END "@Convert";
  1673. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1674. BEGIN
  1675. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1676. RETURN RESULT
  1677. END "LONG";
  1678. (** LONGREAL -> REAL (SHORT) *)
  1679. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1680. VAR lval: LONGREAL; dval: REAL;
  1681. BEGIN
  1682. WHILE (len > 0) DO
  1683. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1684. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1685. END;
  1686. END ConvertLoopXR;
  1687. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1688. BEGIN
  1689. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1690. RETURN RESULT
  1691. END "@Convert";
  1692. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1693. BEGIN
  1694. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1695. RETURN RESULT
  1696. END "SHORT";
  1697. (** LONGREAL -> LONGINT (ENTIER) *)
  1698. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1699. VAR lval: LONGREAL; dval: LONGINT;
  1700. BEGIN
  1701. WHILE (len > 0) DO
  1702. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1703. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1704. END;
  1705. END ConvertLoopXL;
  1706. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1707. BEGIN
  1708. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1709. RETURN RESULT
  1710. END "@Convert";
  1711. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1712. BEGIN
  1713. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1714. RETURN RESULT
  1715. END "ENTIER";
  1716. (** SIZES **)
  1717. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1718. VAR lval: LONGINT; dval: SIZE;
  1719. BEGIN
  1720. WHILE (len > 0) DO
  1721. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1722. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1723. END;
  1724. END ConvertLoopLY;
  1725. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1726. BEGIN
  1727. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), ConvertLoopLY );
  1728. RETURN RESULT
  1729. END "@Convert";
  1730. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1731. VAR lval: SIZE; dval: LONGREAL;
  1732. BEGIN
  1733. WHILE (len > 0) DO
  1734. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1735. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1736. END;
  1737. END ConvertLoopYZ;
  1738. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1739. BEGIN
  1740. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopYZ );
  1741. RETURN RESULT
  1742. END "@Convert";
  1743. PROCEDURE ConvertLoopYR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1744. VAR lval: SIZE; dval: REAL;
  1745. BEGIN
  1746. WHILE (len > 0) DO
  1747. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1748. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1749. END;
  1750. END ConvertLoopYR;
  1751. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1752. BEGIN
  1753. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopYR );
  1754. RETURN RESULT
  1755. END "@Convert";
  1756. (*** monadic not A -> ~A ********************************************************************)
  1757. (** BOOLEAN *)
  1758. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1759. VAR lval: BOOLEAN;
  1760. BEGIN
  1761. WHILE (len > 0) DO
  1762. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1763. DEC( len );
  1764. END;
  1765. END NotLoopAB;
  1766. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  1767. BEGIN
  1768. ApplyUnaryAAOp(RESULT, src,SIZEOF( BOOLEAN ), NotLoopAB );
  1769. RETURN RESULT
  1770. END "~";
  1771. (*** monadic generic (A) -> -A ********************************************************************)
  1772. (** SHORTINT *)
  1773. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1774. VAR lval: SHORTINT;
  1775. BEGIN
  1776. WHILE (len > 0) DO
  1777. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1778. DEC( len );
  1779. END;
  1780. END GenericLoopS;
  1781. (** INTEGER *)
  1782. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1783. VAR lval: INTEGER;
  1784. BEGIN
  1785. WHILE (len > 0) DO
  1786. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1787. DEC( len );
  1788. END;
  1789. END GenericLoopI;
  1790. (** LONGINT *)
  1791. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1792. VAR lval: LONGINT;
  1793. BEGIN
  1794. WHILE (len > 0) DO
  1795. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1796. DEC( len );
  1797. END;
  1798. END GenericLoopL;
  1799. (** HUGEINT *)
  1800. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1801. VAR lval: HUGEINT;
  1802. BEGIN
  1803. WHILE (len > 0) DO
  1804. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1805. DEC( len );
  1806. END;
  1807. END GenericLoopH;
  1808. (** REAL *)
  1809. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1810. VAR lval: REAL;
  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 GenericLoopR;
  1817. (** LONGREAL *)
  1818. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1819. VAR lval: LONGREAL;
  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 GenericLoopX;
  1826. (** COMPLEX *)
  1827. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1828. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1829. BEGIN
  1830. WHILE (len > 0) DO
  1831. lval := ladr;
  1832. dval := dadr;
  1833. dval.val := op(lval.val);
  1834. INC( ladr, linc ); INC( dadr, dinc );
  1835. DEC( len );
  1836. END;
  1837. END GenericLoopZ;
  1838. (** LONGCOMPLEX *)
  1839. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1840. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1841. BEGIN
  1842. WHILE (len > 0) DO
  1843. lval := ladr;
  1844. dval := dadr;
  1845. dval.val := op (lval.val);
  1846. INC( ladr, linc ); INC( dadr, dinc );
  1847. DEC( len );
  1848. END;
  1849. END GenericLoopLZ;
  1850. (*** monadic minus A -> -A ********************************************************************)
  1851. (** SHORTINT *)
  1852. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1853. VAR lval: SHORTINT;
  1854. BEGIN
  1855. WHILE (len > 0) DO
  1856. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1857. DEC( len );
  1858. END;
  1859. END MinusLoopS;
  1860. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1861. BEGIN
  1862. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), MinusLoopS );
  1863. RETURN RESULT
  1864. END "-";
  1865. (** INTEGER *)
  1866. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1867. VAR lval: INTEGER;
  1868. BEGIN
  1869. WHILE (len > 0) DO
  1870. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1871. DEC( len );
  1872. END;
  1873. END MinusLoopI;
  1874. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1875. BEGIN
  1876. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), MinusLoopI );
  1877. RETURN RESULT
  1878. END "-";
  1879. (** LONGINT *)
  1880. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1881. VAR lval: LONGINT;
  1882. BEGIN
  1883. WHILE (len > 0) DO
  1884. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1885. DEC( len );
  1886. END;
  1887. END MinusLoopL;
  1888. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1889. BEGIN
  1890. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), MinusLoopL );
  1891. RETURN RESULT
  1892. END "-";
  1893. (** SIZE *)
  1894. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1895. VAR lval: SIZE;
  1896. BEGIN
  1897. WHILE (len > 0) DO
  1898. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1899. DEC( len );
  1900. END;
  1901. END MinusLoopY;
  1902. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1903. BEGIN
  1904. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), MinusLoopY );
  1905. RETURN RESULT
  1906. END "-";
  1907. (** REAL *)
  1908. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1909. VAR lval: REAL;
  1910. BEGIN
  1911. WHILE (len > 0) DO
  1912. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1913. DEC( len );
  1914. END;
  1915. END MinusLoopR;
  1916. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  1917. BEGIN
  1918. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1919. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), MinusLoopR );
  1920. RETURN RESULT
  1921. END "-";
  1922. (** LONGREAL *)
  1923. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1924. VAR lval: LONGREAL;
  1925. BEGIN
  1926. WHILE (len > 0) DO
  1927. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1928. DEC( len );
  1929. END;
  1930. END MinusLoopX;
  1931. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1932. BEGIN
  1933. ApplyUnaryAAOp(RESULT, src, SIZEOF( LONGREAL ),
  1934. MinusLoopX );
  1935. RETURN RESULT
  1936. END "-";
  1937. (*** add array + array -> array ********************************************************************)
  1938. (** SHORTINT *)
  1939. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1940. VAR lval, rval: SHORTINT;
  1941. BEGIN
  1942. WHILE (len > 0) DO
  1943. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1944. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1945. END;
  1946. END AddASASLoop;
  1947. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  1948. BEGIN
  1949. ApplyBinaryAAAOp( RESULT, left, right,
  1950. SIZEOF( SHORTINT ), AddASASLoop );
  1951. RETURN RESULT
  1952. END "+";
  1953. (** INTEGER *)
  1954. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1955. VAR lval, rval: INTEGER;
  1956. BEGIN
  1957. WHILE (len > 0) DO
  1958. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1959. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1960. END;
  1961. END AddAIAILoop;
  1962. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  1963. BEGIN
  1964. ApplyBinaryAAAOp( RESULT, left, right,
  1965. SIZEOF( INTEGER ), AddAIAILoop );
  1966. RETURN RESULT
  1967. END "+";
  1968. (** LONGINT *)
  1969. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1970. VAR lval, rval: LONGINT;
  1971. BEGIN
  1972. WHILE (len > 0) DO
  1973. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1974. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1975. END;
  1976. END AddALALLoop;
  1977. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  1978. BEGIN
  1979. ApplyBinaryAAAOp( RESULT, left, right,
  1980. SIZEOF( LONGINT ), AddALALLoop );
  1981. RETURN RESULT
  1982. END "+";
  1983. (** REAL *)
  1984. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1985. VAR lval, rval: REAL;
  1986. BEGIN
  1987. WHILE (len > 0) DO
  1988. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1989. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1990. END;
  1991. END AddARARLoop;
  1992. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  1993. BEGIN
  1994. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  1995. loopAddARAR );
  1996. RETURN RESULT
  1997. END "+";
  1998. (** LONGREAL *)
  1999. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2000. VAR lval, rval: LONGREAL;
  2001. BEGIN
  2002. WHILE (len > 0) DO
  2003. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2004. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2005. END;
  2006. END AddAXAXLoop;
  2007. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2008. BEGIN
  2009. ApplyBinaryAAAOp( RESULT, left, right,
  2010. SIZEOF( LONGREAL ), loopAddAXAX );
  2011. RETURN RESULT
  2012. END "+";
  2013. (** COMPLEX *)
  2014. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2015. VAR lval, rval: COMPLEX;
  2016. BEGIN
  2017. WHILE (len > 0) DO
  2018. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2019. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2020. END;
  2021. END AddAZAZLoop;
  2022. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2023. BEGIN
  2024. ApplyBinaryAAAOp( RESULT, left, right,
  2025. SIZEOF( COMPLEX ), loopAddAZAZ );
  2026. RETURN RESULT
  2027. END "+";
  2028. (** HUGEINT *)
  2029. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2030. VAR lval, rval: HUGEINT;
  2031. BEGIN
  2032. WHILE (len > 0) DO
  2033. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2034. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2035. END;
  2036. END AddAHAHLoop;
  2037. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT;
  2038. BEGIN
  2039. ApplyBinaryAAAOp( RESULT, left, right,
  2040. SIZEOF( HUGEINT ), AddAHAHLoop);
  2041. RETURN RESULT
  2042. END "+";
  2043. (** SIZE *)
  2044. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2045. VAR lval, rval: SIZE;
  2046. BEGIN
  2047. WHILE (len > 0) DO
  2048. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2049. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2050. END;
  2051. END AddAYAYLoop;
  2052. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2053. BEGIN
  2054. ApplyBinaryAAAOp( RESULT, left, right,
  2055. SIZEOF( SIZE ), AddAYAYLoop);
  2056. RETURN RESULT
  2057. END "+";
  2058. (** LONGCOMPLEX *)
  2059. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2060. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2061. BEGIN
  2062. WHILE (len > 0) DO
  2063. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2064. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2065. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2066. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2067. DEC( len );
  2068. END;
  2069. END AddALZALZLoop;
  2070. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2071. BEGIN
  2072. ApplyBinaryAAAOp( RESULT, left, right,
  2073. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2074. RETURN RESULT
  2075. END "+";
  2076. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2077. (** SHORTINT *)
  2078. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2079. VAR lval, rval: SHORTINT;
  2080. BEGIN
  2081. SYSTEM.GET( radr, rval );
  2082. WHILE (len > 0) DO
  2083. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2084. INC( dadr, dinc ); DEC( len );
  2085. END;
  2086. END AddASSSLoop;
  2087. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2088. BEGIN
  2089. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2090. SIZEOF( SHORTINT ), AddASSSLoop );
  2091. RETURN RESULT
  2092. END "+";
  2093. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2094. BEGIN
  2095. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2096. SIZEOF( SHORTINT ), AddASSSLoop );
  2097. RETURN RESULT
  2098. END "+";
  2099. (** INTEGER *)
  2100. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2101. VAR lval, rval: INTEGER;
  2102. BEGIN
  2103. SYSTEM.GET( radr, rval );
  2104. WHILE (len > 0) DO
  2105. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2106. INC( dadr, dinc ); DEC( len );
  2107. END;
  2108. END AddAISILoop;
  2109. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2110. BEGIN
  2111. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2112. SIZEOF( INTEGER ), AddAISILoop );
  2113. RETURN RESULT
  2114. END "+";
  2115. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2116. BEGIN
  2117. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2118. SIZEOF( INTEGER ), AddAISILoop );
  2119. RETURN RESULT
  2120. END "+";
  2121. (** LONGINT *)
  2122. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2123. VAR lval, rval: LONGINT;
  2124. BEGIN
  2125. SYSTEM.GET( radr, rval );
  2126. WHILE (len > 0) DO
  2127. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2128. INC( dadr, dinc ); DEC( len );
  2129. END;
  2130. END AddALSLLoop;
  2131. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2132. BEGIN
  2133. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2134. SIZEOF( LONGINT ), AddALSLLoop );
  2135. RETURN RESULT
  2136. END "+";
  2137. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2138. BEGIN
  2139. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2140. SIZEOF( LONGINT ), AddALSLLoop );
  2141. RETURN RESULT
  2142. END "+";
  2143. (** REAL *)
  2144. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2145. VAR lval, rval: REAL;
  2146. BEGIN
  2147. SYSTEM.GET( radr, rval );
  2148. WHILE (len > 0) DO
  2149. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2150. INC( dadr, dinc ); DEC( len );
  2151. END;
  2152. END AddARSRLoop;
  2153. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2154. BEGIN
  2155. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2156. AddARSRLoop );
  2157. RETURN RESULT
  2158. END "+";
  2159. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2160. BEGIN
  2161. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2162. AddARSRLoop );
  2163. RETURN RESULT
  2164. END "+";
  2165. (** LONGREAL *)
  2166. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2167. VAR lval, rval: LONGREAL;
  2168. BEGIN
  2169. SYSTEM.GET( radr, rval );
  2170. WHILE (len > 0) DO
  2171. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2172. INC( dadr, dinc ); DEC( len );
  2173. END;
  2174. END AddAXSXLoop;
  2175. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2176. BEGIN
  2177. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2178. SIZEOF( LONGREAL ), AddAXSXLoop );
  2179. RETURN RESULT
  2180. END "+";
  2181. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2182. BEGIN
  2183. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2184. SIZEOF( LONGREAL ), AddAXSXLoop );
  2185. RETURN RESULT
  2186. END "+";
  2187. (** COMPLEX *)
  2188. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2189. VAR lval, rval: COMPLEX;
  2190. BEGIN
  2191. SYSTEM.GET( radr, rval );
  2192. WHILE (len > 0) DO
  2193. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2194. INC( dadr, dinc ); DEC( len );
  2195. END;
  2196. END AddAZSZLoop;
  2197. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2198. BEGIN
  2199. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2200. AddAZSZLoop );
  2201. RETURN RESULT
  2202. END "+";
  2203. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2204. BEGIN
  2205. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2206. AddAZSZLoop );
  2207. RETURN RESULT
  2208. END "+";
  2209. (** HUGEINT *)
  2210. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2211. VAR lval, rval: HUGEINT;
  2212. BEGIN
  2213. SYSTEM.GET( radr, rval );
  2214. WHILE (len > 0) DO
  2215. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2216. INC( dadr, dinc ); DEC( len );
  2217. END;
  2218. END AddAHSHLoop;
  2219. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2220. BEGIN
  2221. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2222. AddAHSHLoop );
  2223. RETURN RESULT
  2224. END "+";
  2225. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2226. BEGIN
  2227. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2228. AddAHSHLoop );
  2229. RETURN RESULT
  2230. END "+";
  2231. (** SIZE *)
  2232. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2233. VAR lval, rval: SIZE;
  2234. BEGIN
  2235. SYSTEM.GET( radr, rval );
  2236. WHILE (len > 0) DO
  2237. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2238. INC( dadr, dinc ); DEC( len );
  2239. END;
  2240. END AddAYSYLoop;
  2241. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2242. BEGIN
  2243. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( SIZE ),
  2244. AddAYSYLoop );
  2245. RETURN RESULT
  2246. END "+";
  2247. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2248. BEGIN
  2249. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( SIZE ),
  2250. AddAYSYLoop );
  2251. RETURN RESULT
  2252. END "+";
  2253. (** LONGCOMPLEX *)
  2254. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2255. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2256. BEGIN
  2257. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2258. WHILE (len > 0) DO
  2259. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2260. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2261. INC( ladr, linc );
  2262. INC( dadr, dinc ); DEC( len );
  2263. END;
  2264. END AddALZSLZLoop;
  2265. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2266. BEGIN
  2267. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2268. AddALZSLZLoop );
  2269. RETURN RESULT
  2270. END "+";
  2271. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2272. BEGIN
  2273. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2274. AddALZSLZLoop );
  2275. RETURN RESULT
  2276. END "+";
  2277. (*** subtraction array - array -> array ********************************************************************)
  2278. (** SHORTINT *)
  2279. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2280. VAR lval, rval: SHORTINT;
  2281. BEGIN
  2282. WHILE (len > 0) DO
  2283. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2284. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2285. END;
  2286. END SubASASLoop;
  2287. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2288. BEGIN
  2289. ApplyBinaryAAAOp( RESULT, left, right,
  2290. SIZEOF( SHORTINT ), SubASASLoop );
  2291. RETURN RESULT
  2292. END "-";
  2293. (** INTEGER *)
  2294. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2295. VAR lval, rval: INTEGER;
  2296. BEGIN
  2297. WHILE (len > 0) DO
  2298. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2299. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2300. END;
  2301. END SubAIAILoop;
  2302. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2303. BEGIN
  2304. ApplyBinaryAAAOp( RESULT, left, right,
  2305. SIZEOF( INTEGER ), SubAIAILoop );
  2306. RETURN RESULT
  2307. END "-";
  2308. (** LONGINT *)
  2309. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2310. VAR lval, rval: LONGINT;
  2311. BEGIN
  2312. WHILE (len > 0) DO
  2313. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2314. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2315. END;
  2316. END SubALALLoop;
  2317. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2318. BEGIN
  2319. ApplyBinaryAAAOp( RESULT, left, right,
  2320. SIZEOF( LONGINT ), SubALALLoop );
  2321. RETURN RESULT
  2322. END "-";
  2323. (** SIZE *)
  2324. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2325. VAR lval, rval: SIZE;
  2326. BEGIN
  2327. WHILE (len > 0) DO
  2328. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2329. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2330. END;
  2331. END SubAYAYLoop;
  2332. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2333. BEGIN
  2334. ApplyBinaryAAAOp( RESULT, left, right,
  2335. SIZEOF( SIZE ), SubAYAYLoop );
  2336. RETURN RESULT
  2337. END "-";
  2338. (** REAL *)
  2339. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2340. VAR lval, rval: REAL;
  2341. BEGIN
  2342. WHILE (len > 0) DO
  2343. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2344. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2345. END;
  2346. END SubARARLoop;
  2347. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2348. BEGIN
  2349. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2350. loopSubARAR );
  2351. RETURN RESULT
  2352. END "-";
  2353. (** LONGREAL *)
  2354. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2355. VAR lval, rval: LONGREAL;
  2356. BEGIN
  2357. WHILE (len > 0) DO
  2358. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2359. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2360. END;
  2361. END SubAXAXLoop;
  2362. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2363. BEGIN
  2364. ApplyBinaryAAAOp( RESULT, left, right,
  2365. SIZEOF( LONGREAL ), loopSubAXAX );
  2366. RETURN RESULT
  2367. END "-";
  2368. (** COMPLEX *)
  2369. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2370. VAR lval, rval: COMPLEX;
  2371. BEGIN
  2372. WHILE (len > 0) DO
  2373. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2374. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2375. END;
  2376. END SubAZAZLoop;
  2377. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2378. BEGIN
  2379. ApplyBinaryAAAOp( RESULT, left, right,
  2380. SIZEOF( COMPLEX ), loopSubAZAZ );
  2381. RETURN RESULT
  2382. END "-";
  2383. (** LONGCOMPLEX *)
  2384. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2385. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2386. BEGIN
  2387. WHILE (len > 0) DO
  2388. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2389. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2390. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2391. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2392. DEC( len );
  2393. END;
  2394. END SubALZALZLoop;
  2395. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2396. BEGIN
  2397. ApplyBinaryAAAOp( RESULT, left, right,
  2398. SIZEOF( LONGCOMPLEX ), loopSubALZALZ );
  2399. RETURN RESULT
  2400. END "-";
  2401. (*** subtraction array-scalar -> array ********************************************************************)
  2402. (** SHORTINT *)
  2403. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2404. BEGIN
  2405. RESULT := left + (-right);
  2406. RETURN RESULT
  2407. END "-";
  2408. (** INTEGER *)
  2409. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2410. BEGIN
  2411. RESULT := left + (-right);
  2412. RETURN RESULT
  2413. END "-";
  2414. (** LONGINT *)
  2415. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2416. BEGIN
  2417. RESULT := left + (-right);
  2418. RETURN RESULT
  2419. END "-";
  2420. (** LONGINT *)
  2421. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2422. BEGIN
  2423. RESULT := left + (-right);
  2424. RETURN RESULT
  2425. END "-";
  2426. (** REAL *)
  2427. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2428. BEGIN
  2429. RESULT := left + (-right);
  2430. RETURN RESULT
  2431. END "-";
  2432. (** LONGREAL *)
  2433. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2434. BEGIN
  2435. RESULT := left + (-right);
  2436. RETURN RESULT
  2437. END "-";
  2438. (** COMPLEX *)
  2439. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2440. BEGIN
  2441. RESULT := left + (-right);
  2442. RETURN RESULT
  2443. END "-";
  2444. (** LONGCOMPLEX *)
  2445. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2446. BEGIN
  2447. RESULT := left + (-right);
  2448. RETURN RESULT
  2449. END "-";
  2450. (*** subtraction scalar-array -> array ********************************************************************)
  2451. (** SHORTINT *)
  2452. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2453. VAR lval, rval, dval: SHORTINT;
  2454. BEGIN
  2455. SYSTEM.GET( radr, rval );
  2456. WHILE (len > 0) DO
  2457. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2458. INC( dadr, dinc ); DEC( len );
  2459. END;
  2460. END SubSSASLoop;
  2461. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2462. BEGIN
  2463. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2464. SIZEOF( SHORTINT ), SubSSASLoop );
  2465. RETURN RESULT
  2466. END "-";
  2467. (** INTEGER *)
  2468. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2469. VAR lval, rval, dval: INTEGER;
  2470. BEGIN
  2471. SYSTEM.GET( radr, rval );
  2472. WHILE (len > 0) DO
  2473. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2474. INC( dadr, dinc ); DEC( len );
  2475. END;
  2476. END SubSIAILoop;
  2477. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2478. BEGIN
  2479. ApplyBinaryASAOp( RESULT, right, ADDRESSOF( left ),
  2480. SIZEOF( INTEGER ), SubSIAILoop );
  2481. RETURN RESULT
  2482. END "-";
  2483. (** LONGINT *)
  2484. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2485. VAR lval, rval, dval: LONGINT;
  2486. BEGIN
  2487. SYSTEM.GET( radr, rval );
  2488. WHILE (len > 0) DO
  2489. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2490. INC( dadr, dinc ); DEC( len );
  2491. END;
  2492. END SubSLALLoop;
  2493. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2494. BEGIN
  2495. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2496. SIZEOF( LONGINT ), SubSLALLoop );
  2497. RETURN RESULT
  2498. END "-";
  2499. (** SIZE *)
  2500. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2501. VAR lval, rval, dval: SIZE;
  2502. BEGIN
  2503. SYSTEM.GET( radr, rval );
  2504. WHILE (len > 0) DO
  2505. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2506. INC( dadr, dinc ); DEC( len );
  2507. END;
  2508. END SubSYAYLoop;
  2509. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2510. BEGIN
  2511. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2512. SIZEOF( SIZE ), SubSYAYLoop );
  2513. RETURN RESULT
  2514. END "-";
  2515. (** REAL *)
  2516. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2517. VAR lval, rval, dval: REAL;
  2518. BEGIN
  2519. SYSTEM.GET( radr, rval );
  2520. WHILE (len > 0) DO
  2521. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2522. INC( dadr, dinc ); DEC( len );
  2523. END;
  2524. END SubSRARLoop;
  2525. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2526. BEGIN
  2527. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2528. SubSRARLoop );
  2529. RETURN RESULT
  2530. END "-";
  2531. (** LONGREAL *)
  2532. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2533. VAR lval, rval, dval: LONGREAL;
  2534. BEGIN
  2535. SYSTEM.GET( radr, rval );
  2536. WHILE (len > 0) DO
  2537. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2538. INC( dadr, dinc ); DEC( len );
  2539. END;
  2540. END SubSXAXLoop;
  2541. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2542. BEGIN
  2543. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2544. SIZEOF( LONGREAL ), SubSXAXLoop );
  2545. RETURN RESULT
  2546. END "-";
  2547. (** COMPLEX *)
  2548. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2549. VAR lval, rval, dval: COMPLEX;
  2550. BEGIN
  2551. SYSTEM.GET( radr, rval );
  2552. WHILE (len > 0) DO
  2553. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2554. INC( dadr, dinc ); DEC( len );
  2555. END;
  2556. END SubSZAZLoop;
  2557. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2558. BEGIN
  2559. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2560. SIZEOF( COMPLEX ), SubSZAZLoop );
  2561. RETURN RESULT
  2562. END "-";
  2563. (** LONGCOMPLEX *)
  2564. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2565. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2566. BEGIN
  2567. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2568. WHILE (len > 0) DO
  2569. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2570. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2571. INC( ladr, linc );
  2572. INC( dadr, dinc ); DEC( len );
  2573. END;
  2574. END SubSLZALZLoop;
  2575. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2576. BEGIN
  2577. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2578. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2579. RETURN RESULT
  2580. END "-";
  2581. (*** element-wise multiply array x array -> array ********************************************************************)
  2582. (** SHORTINT *)
  2583. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2584. VAR lval, rval: SHORTINT;
  2585. BEGIN
  2586. WHILE (len > 0) DO
  2587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2588. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2589. END;
  2590. END EMulASASLoop;
  2591. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2592. BEGIN
  2593. ApplyBinaryAAAOp( RESULT, left, right,
  2594. SIZEOF( SHORTINT ), EMulASASLoop );
  2595. RETURN RESULT
  2596. END ".*";
  2597. (** INTEGER *)
  2598. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2599. VAR lval, rval: INTEGER; dval: INTEGER;
  2600. BEGIN
  2601. WHILE (len > 0) DO
  2602. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2603. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2604. DEC( len );
  2605. END;
  2606. END EMulAIAILoop;
  2607. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2608. BEGIN
  2609. ApplyBinaryAAAOp( RESULT, left, right,
  2610. SIZEOF( INTEGER ), EMulAIAILoop );
  2611. RETURN RESULT
  2612. END ".*";
  2613. (** LONGINT *)
  2614. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2615. VAR lval, rval: LONGINT;
  2616. BEGIN
  2617. WHILE (len > 0) DO
  2618. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2619. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2620. END;
  2621. END EMulALALLoop;
  2622. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2623. BEGIN
  2624. ApplyBinaryAAAOp( RESULT, left, right,
  2625. SIZEOF( LONGINT ), EMulALALLoop );
  2626. RETURN RESULT
  2627. END ".*";
  2628. (** REAL *)
  2629. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2630. VAR lval, rval: REAL;
  2631. BEGIN
  2632. WHILE (len > 0) DO
  2633. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2634. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2635. END;
  2636. END EMulARARLoop;
  2637. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2638. BEGIN
  2639. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2640. EMulARARLoop );
  2641. RETURN RESULT
  2642. END ".*";
  2643. (** LONGREAL *)
  2644. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2645. VAR lval, rval: LONGREAL;
  2646. BEGIN
  2647. WHILE (len > 0) DO
  2648. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2649. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2650. END;
  2651. END EMulAXAXLoop;
  2652. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2653. BEGIN
  2654. ApplyBinaryAAAOp( RESULT, left, right,
  2655. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2656. RETURN RESULT
  2657. END ".*";
  2658. (** COMPLEX *)
  2659. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2660. VAR lval, rval: COMPLEX;
  2661. BEGIN
  2662. WHILE (len > 0) DO
  2663. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2664. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2665. END;
  2666. END EMulAZAZLoop;
  2667. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2668. BEGIN
  2669. ApplyBinaryAAAOp( RESULT, left, right,
  2670. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2671. RETURN RESULT
  2672. END ".*";
  2673. (** LONGCOMPLEX *)
  2674. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2675. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2676. BEGIN
  2677. WHILE (len > 0) DO
  2678. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2679. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2680. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2681. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2682. DEC( len );
  2683. END;
  2684. END EMulALZALZLoop;
  2685. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2686. BEGIN
  2687. ApplyBinaryAAAOp( RESULT, left, right,
  2688. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2689. RETURN RESULT
  2690. END ".*";
  2691. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2692. (** SHORTINT *)
  2693. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2694. VAR lval, rval,dval: SHORTINT;
  2695. BEGIN
  2696. WHILE (len > 0) DO
  2697. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2698. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2699. END;
  2700. END EMulIncASASLoop;
  2701. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2702. BEGIN
  2703. ApplyBinaryAAAOp( RESULT, left, right,
  2704. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2705. END ".*+";
  2706. (** INTEGER *)
  2707. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2708. VAR lval, rval,dval: INTEGER;
  2709. BEGIN
  2710. WHILE (len > 0) DO
  2711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2712. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2713. DEC( len );
  2714. END;
  2715. END EMulIncAIAILoop;
  2716. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2717. BEGIN
  2718. ApplyBinaryAAAOp( RESULT, left, right,
  2719. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2720. END ".*+";
  2721. (** LONGINT *)
  2722. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2723. VAR lval, rval,dval: LONGINT;
  2724. BEGIN
  2725. WHILE (len > 0) DO
  2726. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2727. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2728. END;
  2729. END EMulIncALALLoop;
  2730. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2731. BEGIN
  2732. ApplyBinaryAAAOp( RESULT, left, right,
  2733. SIZEOF( LONGINT ), EMulIncALALLoop );
  2734. END ".*+";
  2735. (** REAL *)
  2736. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2737. VAR lval, rval,dval: REAL;
  2738. BEGIN
  2739. WHILE (len > 0) DO
  2740. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2741. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2742. END;
  2743. END EMulIncARARLoop;
  2744. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2745. BEGIN
  2746. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2747. EMulIncARARLoop );
  2748. END ".*+";
  2749. (** LONGREAL *)
  2750. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2751. VAR lval, rval,dval: LONGREAL;
  2752. BEGIN
  2753. WHILE (len > 0) DO
  2754. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2755. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2756. END;
  2757. END EMulIncAXAXLoop;
  2758. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2759. BEGIN
  2760. ApplyBinaryAAAOp( RESULT, left, right,
  2761. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2762. END ".*+";
  2763. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2764. (** SHORTINT *)
  2765. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2766. VAR lval, rval: SHORTINT;
  2767. BEGIN
  2768. SYSTEM.GET( radr, rval );
  2769. WHILE (len > 0) DO
  2770. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2771. INC( dadr, dinc ); DEC( len );
  2772. END;
  2773. END MulASSSLoop;
  2774. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2775. BEGIN
  2776. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2777. SIZEOF( SHORTINT ), MulASSSLoop );
  2778. RETURN RESULT
  2779. END "*";
  2780. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2781. BEGIN
  2782. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2783. SIZEOF( SHORTINT ), MulASSSLoop );
  2784. RETURN RESULT
  2785. END "*";
  2786. (** INTEGER *)
  2787. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2788. VAR lval, rval: INTEGER;
  2789. BEGIN
  2790. SYSTEM.GET( radr, rval );
  2791. WHILE (len > 0) DO
  2792. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2793. INC( dadr, dinc ); DEC( len );
  2794. END;
  2795. END MulAISILoop;
  2796. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2797. BEGIN
  2798. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2799. SIZEOF( INTEGER ), MulAISILoop );
  2800. RETURN RESULT
  2801. END "*";
  2802. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2803. BEGIN
  2804. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2805. SIZEOF( INTEGER ), MulAISILoop );
  2806. RETURN RESULT
  2807. END "*";
  2808. (** LONGINT *)
  2809. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2810. VAR lval, rval: LONGINT;
  2811. BEGIN
  2812. SYSTEM.GET( radr, rval );
  2813. WHILE (len > 0) DO
  2814. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2815. INC( dadr, dinc ); DEC( len );
  2816. END;
  2817. END MulALSLLoop;
  2818. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2819. BEGIN
  2820. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2821. SIZEOF( LONGINT ), MulALSLLoop );
  2822. RETURN RESULT
  2823. END "*";
  2824. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2825. BEGIN
  2826. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2827. SIZEOF( LONGINT ), MulALSLLoop );
  2828. RETURN RESULT
  2829. END "*";
  2830. (** SIZE *)
  2831. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2832. VAR lval, rval: SIZE;
  2833. BEGIN
  2834. SYSTEM.GET( radr, rval );
  2835. WHILE (len > 0) DO
  2836. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2837. INC( dadr, dinc ); DEC( len );
  2838. END;
  2839. END MulAYSYLoop;
  2840. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2841. BEGIN
  2842. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2843. SIZEOF( SIZE ), MulAYSYLoop );
  2844. RETURN RESULT
  2845. END "*";
  2846. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2847. BEGIN
  2848. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2849. SIZEOF( SIZE ), MulAYSYLoop );
  2850. RETURN RESULT
  2851. END "*";
  2852. (** REAL *)
  2853. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2854. VAR lval, rval: REAL;
  2855. BEGIN
  2856. SYSTEM.GET( radr, rval );
  2857. WHILE (len > 0) DO
  2858. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2859. INC( dadr, dinc ); DEC( len );
  2860. END;
  2861. END MulARSRLoop;
  2862. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2863. BEGIN
  2864. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2865. loopMulARSR );
  2866. RETURN RESULT
  2867. END "*";
  2868. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2869. BEGIN
  2870. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2871. loopMulARSR );
  2872. RETURN RESULT
  2873. END "*";
  2874. (** LONGREAL *)
  2875. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2876. VAR lval, rval: LONGREAL;
  2877. BEGIN
  2878. IF debug THEN
  2879. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2880. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2881. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2882. END;
  2883. SYSTEM.GET( radr, rval );
  2884. WHILE (len > 0) DO
  2885. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2886. INC( dadr, dinc ); DEC( len );
  2887. END;
  2888. END MulAXSXLoop;
  2889. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2890. BEGIN
  2891. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2892. SIZEOF( LONGREAL ), loopMulAXSX );
  2893. RETURN RESULT
  2894. END "*";
  2895. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2896. BEGIN
  2897. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2898. SIZEOF( LONGREAL ), loopMulAXSX );
  2899. RETURN RESULT
  2900. END "*";
  2901. (** COMPLEX *)
  2902. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2903. VAR lval, rval: COMPLEX;
  2904. BEGIN
  2905. SYSTEM.GET( radr, rval );
  2906. WHILE (len > 0) DO
  2907. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2908. INC( dadr, dinc ); DEC( len );
  2909. END;
  2910. END MulAZSZLoop;
  2911. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2912. BEGIN
  2913. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2914. loopMulAZSZ );
  2915. RETURN RESULT
  2916. END "*";
  2917. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2918. BEGIN
  2919. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2920. loopMulAZSZ );
  2921. RETURN RESULT
  2922. END "*";
  2923. (** LONGCOMPLEX *)
  2924. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2925. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2926. BEGIN
  2927. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2928. WHILE (len > 0) DO
  2929. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2930. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2931. INC( ladr, linc );
  2932. INC( dadr, dinc ); DEC( len );
  2933. END;
  2934. END MulALZSLZLoop;
  2935. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2936. BEGIN
  2937. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2938. loopMulALZSLZ );
  2939. RETURN RESULT
  2940. END "*";
  2941. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2942. BEGIN
  2943. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2944. loopMulALZSLZ );
  2945. RETURN RESULT
  2946. END "*";
  2947. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2948. (** SHORTINT *)
  2949. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2950. VAR lval, rval, dval: SHORTINT;
  2951. BEGIN
  2952. SYSTEM.GET( radr, rval );
  2953. WHILE (len > 0) DO
  2954. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2955. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2956. END;
  2957. END IncMulASSSLoop;
  2958. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2959. BEGIN
  2960. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2961. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2962. END "INCMUL";
  2963. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2964. BEGIN
  2965. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2966. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2967. RETURN RESULT
  2968. END "INCMUL";
  2969. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2970. BEGIN
  2971. RESULT := -RESULT;
  2972. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2973. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2974. RESULT := -RESULT;
  2975. RETURN RESULT
  2976. END "DECMUL";
  2977. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2978. BEGIN
  2979. RESULT := -RESULT;
  2980. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2981. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2982. RESULT := -RESULT;
  2983. RETURN RESULT
  2984. END "DECMUL";
  2985. (** INTEGER *)
  2986. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2987. VAR lval, rval, dval: INTEGER;
  2988. BEGIN
  2989. SYSTEM.GET( radr, rval );
  2990. WHILE (len > 0) DO
  2991. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2992. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2993. END;
  2994. END IncMulAISILoop;
  2995. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2996. BEGIN
  2997. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2998. SIZEOF( INTEGER ), IncMulAISILoop );
  2999. RETURN RESULT
  3000. END "INCMUL";
  3001. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3002. BEGIN
  3003. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3004. SIZEOF( INTEGER ), IncMulAISILoop );
  3005. RETURN RESULT
  3006. END "INCMUL";
  3007. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3008. BEGIN
  3009. RESULT := -RESULT;
  3010. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3011. SIZEOF( INTEGER ), IncMulAISILoop );
  3012. RESULT := -RESULT;
  3013. RETURN RESULT
  3014. END "DECMUL";
  3015. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3016. BEGIN
  3017. RESULT := -RESULT;
  3018. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3019. SIZEOF( INTEGER ), IncMulAISILoop );
  3020. RESULT := -RESULT;
  3021. RETURN RESULT
  3022. END "DECMUL";
  3023. (** LONGINT *)
  3024. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3025. VAR lval, rval, dval: LONGINT;
  3026. BEGIN
  3027. SYSTEM.GET( radr, rval );
  3028. WHILE (len > 0) DO
  3029. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3030. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3031. END;
  3032. END IncMulALSLLoop;
  3033. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3034. BEGIN
  3035. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3036. SIZEOF( LONGINT ), IncMulALSLLoop );
  3037. RETURN RESULT
  3038. END "INCMUL";
  3039. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3040. BEGIN
  3041. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3042. SIZEOF( LONGINT ), IncMulALSLLoop );
  3043. RETURN RESULT
  3044. END "INCMUL";
  3045. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3046. BEGIN
  3047. RESULT := -RESULT;
  3048. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3049. SIZEOF( LONGINT ), IncMulALSLLoop );
  3050. RESULT := -RESULT;
  3051. RETURN RESULT
  3052. END "DECMUL";
  3053. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3054. BEGIN
  3055. RESULT := -RESULT;
  3056. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3057. SIZEOF( LONGINT ), IncMulALSLLoop );
  3058. RESULT := -RESULT;
  3059. RETURN RESULT
  3060. END "DECMUL";
  3061. (** REAL *)
  3062. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3063. VAR lval, rval, dval: REAL;
  3064. BEGIN
  3065. SYSTEM.GET( radr, rval );
  3066. WHILE (len > 0) DO
  3067. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3068. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3069. END;
  3070. END IncMulARSRLoop;
  3071. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3072. BEGIN
  3073. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3074. loopIncMulARSR );
  3075. RETURN RESULT
  3076. END "INCMUL";
  3077. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3078. BEGIN
  3079. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3080. loopIncMulARSR );
  3081. RETURN RESULT
  3082. END "INCMUL";
  3083. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3084. BEGIN
  3085. RESULT := -RESULT;
  3086. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3087. loopIncMulARSR );
  3088. RESULT := -RESULT;
  3089. RETURN RESULT
  3090. END "DECMUL";
  3091. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3092. BEGIN
  3093. RESULT := -RESULT;
  3094. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3095. loopIncMulARSR );
  3096. RESULT := -RESULT;
  3097. RETURN RESULT
  3098. END "DECMUL";
  3099. (** LONGREAL *)
  3100. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3101. VAR lval, rval, dval: LONGREAL;
  3102. BEGIN
  3103. IF debug THEN
  3104. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3105. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3106. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3107. END;
  3108. SYSTEM.GET( radr, rval );
  3109. WHILE (len > 0) DO
  3110. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3111. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3112. END;
  3113. END IncMulAXSXLoop;
  3114. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3115. BEGIN
  3116. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3117. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3118. RETURN RESULT
  3119. END "INCMUL";
  3120. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3121. BEGIN
  3122. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3123. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3124. RETURN RESULT
  3125. END "INCMUL";
  3126. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3127. BEGIN
  3128. RESULT := -RESULT;
  3129. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3130. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3131. RESULT := -RESULT;
  3132. RETURN RESULT
  3133. END "DECMUL";
  3134. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3135. BEGIN
  3136. RESULT := -RESULT;
  3137. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3138. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3139. RESULT := -RESULT;
  3140. RETURN RESULT
  3141. END "DECMUL";
  3142. (*** element-wise division array / array -> array ********************************************************************)
  3143. (** SHORTINT *)
  3144. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3145. VAR lval, rval: SHORTINT; dval: REAL;
  3146. BEGIN
  3147. WHILE (len > 0) DO
  3148. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3149. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3150. DEC( len );
  3151. END;
  3152. END EDivideASASLoop;
  3153. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF REAL;
  3154. BEGIN
  3155. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3156. EDivideASASLoop );
  3157. RETURN RESULT
  3158. END "./";
  3159. (** INTEGER *)
  3160. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3161. VAR lval, rval: INTEGER; dval: REAL;
  3162. BEGIN
  3163. WHILE (len > 0) DO
  3164. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3165. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3166. DEC( len );
  3167. END;
  3168. END EDivideAIAILoop;
  3169. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF REAL;
  3170. BEGIN
  3171. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3172. EDivideAIAILoop );
  3173. RETURN RESULT
  3174. END "./";
  3175. (** LONGINT *)
  3176. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3177. VAR lval, rval: LONGINT; dval: REAL;
  3178. BEGIN
  3179. WHILE (len > 0) DO
  3180. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3181. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3182. DEC( len );
  3183. END;
  3184. END EDivideALALLoop;
  3185. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF REAL;
  3186. BEGIN
  3187. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3188. EDivideALALLoop );
  3189. RETURN RESULT
  3190. END "./";
  3191. (** REAL *)
  3192. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3193. VAR lval, rval: REAL; dval: REAL;
  3194. BEGIN
  3195. WHILE (len > 0) DO
  3196. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3197. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3198. DEC( len );
  3199. END;
  3200. END EDivideARARLoop;
  3201. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  3202. BEGIN
  3203. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3204. EDivideARARLoop );
  3205. RETURN RESULT
  3206. END "./";
  3207. (** LONGREAL *)
  3208. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3209. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3210. BEGIN
  3211. WHILE (len > 0) DO
  3212. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3213. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3214. DEC( len );
  3215. END;
  3216. END EDivideAXAXLoop;
  3217. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  3218. BEGIN
  3219. ApplyBinaryAAAOp( RESULT, left, right,
  3220. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3221. RETURN RESULT
  3222. END "./";
  3223. (** COMPLEX *)
  3224. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3225. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3226. BEGIN
  3227. WHILE (len > 0) DO
  3228. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3229. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3230. DEC( len );
  3231. END;
  3232. END EDivideAZAZLoop;
  3233. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  3234. BEGIN
  3235. ApplyBinaryAAAOp( RESULT, left, right,
  3236. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3237. RETURN RESULT
  3238. END "./";
  3239. (** LONGCOMPLEX *)
  3240. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3241. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3242. BEGIN
  3243. WHILE (len > 0) DO
  3244. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3245. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3246. IF rvalIm # 0.0D0 THEN
  3247. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3248. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3249. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3250. ELSE
  3251. dvalRe := lvalRe/rvalRe;
  3252. dvalIm := lvalIm/rvalRe;
  3253. END;
  3254. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3255. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3256. DEC( len );
  3257. END;
  3258. END EDivideALZALZLoop;
  3259. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  3260. BEGIN
  3261. ApplyBinaryAAAOp( RESULT, left, right,
  3262. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3263. RETURN RESULT
  3264. END "./";
  3265. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3266. (** SHORTINT *)
  3267. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3268. VAR lval, rval: SHORTINT; dval: REAL;
  3269. BEGIN
  3270. SYSTEM.GET( radr, rval );
  3271. WHILE (len > 0) DO
  3272. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3273. INC( dadr, dinc ); DEC( len );
  3274. END;
  3275. END DivideASSSLoop;
  3276. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3277. BEGIN
  3278. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3279. DivideASSSLoop );
  3280. RETURN RESULT
  3281. END "/";
  3282. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3283. VAR lval, rval: SHORTINT; dval: REAL;
  3284. BEGIN
  3285. SYSTEM.GET( radr, rval );
  3286. WHILE (len > 0) DO
  3287. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3288. INC( dadr, dinc ); DEC( len );
  3289. END;
  3290. END DivideSSASLoop;
  3291. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3292. BEGIN
  3293. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3294. DivideSSASLoop );
  3295. RETURN RESULT
  3296. END "/";
  3297. (** INTEGER *)
  3298. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3299. VAR lval, rval: INTEGER; dval: REAL;
  3300. BEGIN
  3301. SYSTEM.GET( radr, rval );
  3302. WHILE (len > 0) DO
  3303. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3304. INC( dadr, dinc ); DEC( len );
  3305. END;
  3306. END DivideAISILoop;
  3307. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3308. BEGIN
  3309. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3310. DivideAISILoop );
  3311. RETURN RESULT
  3312. END "/";
  3313. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3314. VAR lval, rval: INTEGER; dval: REAL;
  3315. BEGIN
  3316. SYSTEM.GET( radr, rval );
  3317. WHILE (len > 0) DO
  3318. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3319. INC( dadr, dinc ); DEC( len );
  3320. END;
  3321. END DivideSIAILoop;
  3322. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF REAL;
  3323. BEGIN
  3324. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3325. DivideSIAILoop );
  3326. RETURN RESULT
  3327. END "/";
  3328. (** LONGINT *)
  3329. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3330. VAR lval, rval: LONGINT; dval: REAL;
  3331. BEGIN
  3332. SYSTEM.GET( radr, rval );
  3333. WHILE (len > 0) DO
  3334. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3335. INC( dadr, dinc ); DEC( len );
  3336. END;
  3337. END DivideALSLLoop;
  3338. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3339. BEGIN
  3340. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3341. DivideALSLLoop );
  3342. RETURN RESULT
  3343. END "/";
  3344. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3345. VAR lval, rval: LONGINT; dval: REAL;
  3346. BEGIN
  3347. SYSTEM.GET( radr, rval );
  3348. WHILE (len > 0) DO
  3349. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3350. INC( dadr, dinc ); DEC( len );
  3351. END;
  3352. END DivideSLALLoop;
  3353. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3354. BEGIN
  3355. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3356. DivideSLALLoop );
  3357. RETURN RESULT
  3358. END "/";
  3359. (** REAL *)
  3360. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3361. VAR lval, rval: REAL; dval: REAL;
  3362. BEGIN
  3363. SYSTEM.GET( radr, rval );
  3364. WHILE (len > 0) DO
  3365. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3366. INC( dadr, dinc ); DEC( len );
  3367. END;
  3368. END DivideARSRLoop;
  3369. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3370. BEGIN
  3371. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3372. DivideARSRLoop );
  3373. RETURN RESULT
  3374. END "/";
  3375. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3376. VAR lval, rval: REAL; dval: REAL;
  3377. BEGIN
  3378. SYSTEM.GET( radr, rval );
  3379. WHILE (len > 0) DO
  3380. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3381. INC( dadr, dinc ); DEC( len );
  3382. END;
  3383. END DivideSRARLoop;
  3384. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3385. BEGIN
  3386. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3387. DivideSRARLoop );
  3388. RETURN RESULT
  3389. END "/";
  3390. (** LONGREAL *)
  3391. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3392. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3393. BEGIN
  3394. SYSTEM.GET( radr, rval );
  3395. WHILE (len > 0) DO
  3396. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3397. INC( dadr, dinc ); DEC( len );
  3398. END;
  3399. END DivideAXSXLoop;
  3400. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3401. BEGIN
  3402. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3403. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3404. RETURN RESULT
  3405. END "/";
  3406. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3407. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3408. BEGIN
  3409. SYSTEM.GET( radr, rval );
  3410. WHILE (len > 0) DO
  3411. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3412. INC( dadr, dinc ); DEC( len );
  3413. END;
  3414. END DivideSXAXLoop;
  3415. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3416. BEGIN
  3417. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3418. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3419. RETURN RESULT
  3420. END "/";
  3421. (** COMPLEX *)
  3422. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3423. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3424. BEGIN
  3425. SYSTEM.GET( radr, rval );
  3426. WHILE (len > 0) DO
  3427. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3428. INC( dadr, dinc ); DEC( len );
  3429. END;
  3430. END DivideAZSZLoop;
  3431. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3432. BEGIN
  3433. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3434. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3435. RETURN RESULT
  3436. END "/";
  3437. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3438. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3439. BEGIN
  3440. SYSTEM.GET( radr, rval );
  3441. WHILE (len > 0) DO
  3442. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3443. INC( dadr, dinc ); DEC( len );
  3444. END;
  3445. END DivideSZAZLoop;
  3446. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3447. BEGIN
  3448. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3449. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3450. RETURN RESULT
  3451. END "/";
  3452. (** LONGCOMPLEX *)
  3453. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3454. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3455. BEGIN
  3456. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3457. IF rvalIm # 0.0D0 THEN
  3458. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3459. WHILE (len > 0) DO
  3460. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3461. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3462. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3463. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3464. INC( ladr, linc );
  3465. INC( dadr, dinc ); DEC( len );
  3466. END;
  3467. ELSE
  3468. WHILE (len > 0) DO
  3469. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3470. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3471. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3472. INC( ladr, linc );
  3473. INC( dadr, dinc ); DEC( len );
  3474. END;
  3475. END;
  3476. END DivideALZSLZLoop;
  3477. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3478. BEGIN
  3479. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3480. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3481. RETURN RESULT
  3482. END "/";
  3483. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3484. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3485. BEGIN
  3486. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3487. WHILE (len > 0) DO
  3488. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3489. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3490. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3491. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3492. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3493. INC( ladr, linc );
  3494. INC( dadr, dinc ); DEC( len );
  3495. END;
  3496. END DivideSLZALZLoop;
  3497. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3498. BEGIN
  3499. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3500. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3501. RETURN RESULT
  3502. END "/";
  3503. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3504. (** SHORTINT *)
  3505. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3506. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3507. BEGIN
  3508. WHILE (len > 0) DO
  3509. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3510. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3511. DEC( len );
  3512. END;
  3513. END EDivASASLoop;
  3514. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3515. BEGIN
  3516. ApplyBinaryAAAOp( RESULT, left, right,
  3517. SIZEOF( SHORTINT ), EDivASASLoop );
  3518. RETURN RESULT
  3519. END "DIV";
  3520. (** INTEGER *)
  3521. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3522. VAR lval, rval: INTEGER; dval: INTEGER;
  3523. BEGIN
  3524. WHILE (len > 0) DO
  3525. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3526. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3527. DEC( len );
  3528. END;
  3529. END EDivAIAILoop;
  3530. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3531. BEGIN
  3532. ApplyBinaryAAAOp( RESULT, left, right,
  3533. SIZEOF( INTEGER ), EDivAIAILoop );
  3534. RETURN RESULT
  3535. END "DIV";
  3536. (** LONGINT *)
  3537. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3538. VAR lval, rval: LONGINT; dval: LONGINT;
  3539. BEGIN
  3540. WHILE (len > 0) DO
  3541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3542. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3543. DEC( len );
  3544. END;
  3545. END EDivALALLoop;
  3546. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3547. BEGIN
  3548. ApplyBinaryAAAOp( RESULT, left, right,
  3549. SIZEOF( LONGINT ), EDivALALLoop );
  3550. RETURN RESULT
  3551. END "DIV";
  3552. (** SIZE *)
  3553. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3554. VAR lval, rval: SIZE; dval: SIZE;
  3555. BEGIN
  3556. WHILE (len > 0) DO
  3557. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3558. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3559. DEC( len );
  3560. END;
  3561. END EDivAYAYLoop;
  3562. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3563. BEGIN
  3564. ApplyBinaryAAAOp( RESULT, left, right,
  3565. SIZEOF( SIZE ), EDivAYAYLoop );
  3566. RETURN RESULT
  3567. END "DIV";
  3568. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3569. (** SHORTINT *)
  3570. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3571. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3572. BEGIN
  3573. SYSTEM.GET( radr, rval );
  3574. WHILE (len > 0) DO
  3575. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3576. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3577. END;
  3578. END DivASSSLoop;
  3579. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3580. BEGIN
  3581. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3582. SIZEOF( SHORTINT ), DivASSSLoop );
  3583. RETURN RESULT
  3584. END "DIV";
  3585. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3586. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3587. BEGIN
  3588. SYSTEM.GET( radr, rval );
  3589. WHILE (len > 0) DO
  3590. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3591. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3592. END;
  3593. END DivSSASLoop;
  3594. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3595. BEGIN
  3596. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3597. SIZEOF( SHORTINT ), DivSSASLoop );
  3598. RETURN RESULT
  3599. END "DIV";
  3600. (** INTEGER *)
  3601. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3602. VAR lval, rval: INTEGER; dval: INTEGER;
  3603. BEGIN
  3604. SYSTEM.GET( radr, rval );
  3605. WHILE (len > 0) DO
  3606. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3607. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3608. END;
  3609. END DivAISILoop;
  3610. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3611. BEGIN
  3612. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3613. SIZEOF( INTEGER ), DivAISILoop );
  3614. RETURN RESULT
  3615. END "DIV";
  3616. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3617. VAR lval, rval: INTEGER; dval: INTEGER;
  3618. BEGIN
  3619. SYSTEM.GET( radr, rval );
  3620. WHILE (len > 0) DO
  3621. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3622. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3623. END;
  3624. END DivSIAILoop;
  3625. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3626. BEGIN
  3627. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3628. SIZEOF( INTEGER ), DivSIAILoop );
  3629. RETURN RESULT
  3630. END "DIV";
  3631. (** LONGINT *)
  3632. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3633. VAR lval, rval: LONGINT; dval: LONGINT;
  3634. BEGIN
  3635. SYSTEM.GET( radr, rval );
  3636. WHILE (len > 0) DO
  3637. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3638. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3639. END;
  3640. END DivALSLLoop;
  3641. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3642. BEGIN
  3643. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3644. SIZEOF( LONGINT ), DivALSLLoop );
  3645. RETURN RESULT
  3646. END "DIV";
  3647. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3648. VAR lval, rval: LONGINT; dval: LONGINT;
  3649. BEGIN
  3650. SYSTEM.GET( radr, rval );
  3651. WHILE (len > 0) DO
  3652. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3653. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3654. END;
  3655. END DivSLALLoop;
  3656. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3657. BEGIN
  3658. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3659. SIZEOF( LONGINT ), DivSLALLoop );
  3660. RETURN RESULT
  3661. END "DIV";
  3662. (** SIZE *)
  3663. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3664. VAR lval, rval: SIZE; dval: SIZE;
  3665. BEGIN
  3666. SYSTEM.GET( radr, rval );
  3667. WHILE (len > 0) DO
  3668. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3669. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3670. END;
  3671. END DivAYSYLoop;
  3672. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3673. BEGIN
  3674. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3675. SIZEOF( SIZE ), DivAYSYLoop );
  3676. RETURN RESULT
  3677. END "DIV";
  3678. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3679. VAR lval, rval: SIZE; dval: SIZE;
  3680. BEGIN
  3681. SYSTEM.GET( radr, rval );
  3682. WHILE (len > 0) DO
  3683. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3684. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3685. END;
  3686. END DivSYAYLoop;
  3687. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3688. BEGIN
  3689. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3690. SIZEOF( SIZE ), DivSYAYLoop );
  3691. RETURN RESULT
  3692. END "DIV";
  3693. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3694. (** SHORTINT *)
  3695. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3696. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3697. BEGIN
  3698. WHILE (len > 0) DO
  3699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3700. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3701. DEC( len );
  3702. END;
  3703. END EModASASLoop;
  3704. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3705. BEGIN
  3706. ApplyBinaryAAAOp( RESULT, left, right,
  3707. SIZEOF( SHORTINT ), EModASASLoop );
  3708. RETURN RESULT
  3709. END "MOD";
  3710. (** INTEGER *)
  3711. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3712. VAR lval, rval: INTEGER; dval: INTEGER;
  3713. BEGIN
  3714. WHILE (len > 0) DO
  3715. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3716. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3717. DEC( len );
  3718. END;
  3719. END EModAIAILoop;
  3720. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3721. BEGIN
  3722. ApplyBinaryAAAOp( RESULT, left, right,
  3723. SIZEOF( INTEGER ), EModAIAILoop );
  3724. RETURN RESULT
  3725. END "MOD";
  3726. (** LONGINT *)
  3727. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3728. VAR lval, rval: LONGINT; dval: LONGINT;
  3729. BEGIN
  3730. WHILE (len > 0) DO
  3731. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3732. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3733. DEC( len );
  3734. END;
  3735. END EModALALLoop;
  3736. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3737. BEGIN
  3738. ApplyBinaryAAAOp( RESULT, left, right,
  3739. SIZEOF( LONGINT ), EModALALLoop );
  3740. RETURN RESULT
  3741. END "MOD";
  3742. (** SIZE *)
  3743. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3744. VAR lval, rval: SIZE; dval: SIZE;
  3745. BEGIN
  3746. WHILE (len > 0) DO
  3747. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3748. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3749. DEC( len );
  3750. END;
  3751. END EModAYAYLoop;
  3752. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3753. BEGIN
  3754. ApplyBinaryAAAOp( RESULT, left, right,
  3755. SIZEOF( SIZE ), EModAYAYLoop );
  3756. RETURN RESULT
  3757. END "MOD";
  3758. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3759. (** SHORTINT *)
  3760. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3761. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3762. BEGIN
  3763. SYSTEM.GET( radr, rval );
  3764. WHILE (len > 0) DO
  3765. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3766. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3767. END;
  3768. END ModASSSLoop;
  3769. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3770. BEGIN
  3771. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3772. SIZEOF( SHORTINT ), ModASSSLoop );
  3773. RETURN RESULT
  3774. END "MOD";
  3775. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3776. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3777. BEGIN
  3778. SYSTEM.GET( radr, rval );
  3779. WHILE (len > 0) DO
  3780. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3781. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3782. END;
  3783. END ModSSASLoop;
  3784. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3785. BEGIN
  3786. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3787. SIZEOF( SHORTINT ), ModSSASLoop );
  3788. RETURN RESULT
  3789. END "MOD";
  3790. (** INTEGER *)
  3791. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3792. VAR lval, rval: INTEGER; dval: INTEGER;
  3793. BEGIN
  3794. SYSTEM.GET( radr, rval );
  3795. WHILE (len > 0) DO
  3796. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3797. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3798. END;
  3799. END ModAISILoop;
  3800. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3801. BEGIN
  3802. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3803. SIZEOF( INTEGER ), ModAISILoop );
  3804. RETURN RESULT
  3805. END "MOD";
  3806. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3807. VAR lval, rval: INTEGER; dval: INTEGER;
  3808. BEGIN
  3809. SYSTEM.GET( radr, rval );
  3810. WHILE (len > 0) DO
  3811. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3812. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3813. END;
  3814. END ModSIAILoop;
  3815. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3816. BEGIN
  3817. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3818. SIZEOF( INTEGER ), ModSIAILoop );
  3819. RETURN RESULT
  3820. END "MOD";
  3821. (** LONGINT *)
  3822. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3823. VAR lval, rval: LONGINT; dval: LONGINT;
  3824. BEGIN
  3825. SYSTEM.GET( radr, rval );
  3826. WHILE (len > 0) DO
  3827. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3828. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3829. END;
  3830. END ModALSLLoop;
  3831. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3832. BEGIN
  3833. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3834. SIZEOF( LONGINT ), ModALSLLoop );
  3835. RETURN RESULT
  3836. END "MOD";
  3837. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3838. VAR lval, rval: LONGINT; dval: LONGINT;
  3839. BEGIN
  3840. SYSTEM.GET( radr, rval );
  3841. WHILE (len > 0) DO
  3842. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3843. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3844. END;
  3845. END ModSLALLoop;
  3846. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3847. BEGIN
  3848. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3849. SIZEOF( LONGINT ), ModSLALLoop );
  3850. RETURN RESULT
  3851. END "MOD";
  3852. (** SIZE *)
  3853. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3854. VAR lval, rval: SIZE; dval: SIZE;
  3855. BEGIN
  3856. SYSTEM.GET( radr, rval );
  3857. WHILE (len > 0) DO
  3858. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3859. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3860. END;
  3861. END ModAYSYLoop;
  3862. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3863. BEGIN
  3864. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3865. SIZEOF( SIZE ), ModAYSYLoop );
  3866. RETURN RESULT
  3867. END "MOD";
  3868. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3869. VAR lval, rval: SIZE; dval: SIZE;
  3870. BEGIN
  3871. SYSTEM.GET( radr, rval );
  3872. WHILE (len > 0) DO
  3873. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3874. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3875. END;
  3876. END ModSYAYLoop;
  3877. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3878. BEGIN
  3879. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3880. SIZEOF( SIZE ), ModSYAYLoop );
  3881. RETURN RESULT
  3882. END "MOD";
  3883. (*** scalar product <array,array> -> scalar ********************************************************************)
  3884. (** SHORTINT *)
  3885. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3886. VAR lval, rval: SHORTINT; dval: LONGINT;
  3887. BEGIN
  3888. SYSTEM.GET( dadr, dval );
  3889. WHILE (len > 0) DO
  3890. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3891. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3892. END;
  3893. SYSTEM.PUT( dadr, dval );
  3894. END SPASASLoop;
  3895. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3896. VAR dest: LONGINT;
  3897. BEGIN
  3898. dest := 0;
  3899. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPASASLoop );
  3900. RETURN dest;
  3901. END "+*";
  3902. (** INTEGER *)
  3903. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3904. VAR lval, rval: INTEGER; dval: LONGINT;
  3905. BEGIN
  3906. SYSTEM.GET( dadr, dval );
  3907. WHILE (len > 0) DO
  3908. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3909. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3910. END;
  3911. SYSTEM.PUT( dadr, dval );
  3912. END SPAIAILoop;
  3913. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3914. VAR dest: LONGINT;
  3915. BEGIN
  3916. dest := 0;
  3917. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPAIAILoop );
  3918. RETURN dest;
  3919. END "+*";
  3920. (** LONGINT *)
  3921. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3922. VAR lval, rval: LONGINT; dval: LONGINT;
  3923. BEGIN
  3924. SYSTEM.GET( dadr, dval );
  3925. WHILE (len > 0) DO
  3926. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3927. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3928. END;
  3929. SYSTEM.PUT( dadr, dval );
  3930. END SPALALLoop;
  3931. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3932. VAR dest: LONGINT;
  3933. BEGIN
  3934. dest := 0;
  3935. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPALALLoop );
  3936. RETURN dest;
  3937. END "+*";
  3938. (** REAL *)
  3939. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3940. VAR lval, rval: REAL; dval: REAL;
  3941. BEGIN
  3942. SYSTEM.GET( dadr, dval );
  3943. WHILE (len > 0) DO
  3944. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3945. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3946. END;
  3947. SYSTEM.PUT( dadr, dval );
  3948. END SPARARLoop;
  3949. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3950. VAR dest: REAL;
  3951. BEGIN
  3952. dest := 0;
  3953. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPARAR );
  3954. RETURN dest;
  3955. END "+*";
  3956. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3957. VAR lval, rval, dval: LONGREAL;
  3958. BEGIN
  3959. IF debug THEN
  3960. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3961. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3962. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3963. END;
  3964. SYSTEM.GET( dadr, dval );
  3965. WHILE (len > 0) DO
  3966. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3967. dval := dval + rval * lval; DEC( len );
  3968. END;
  3969. SYSTEM.PUT( dadr, dval );
  3970. END SPAXAXLoop;
  3971. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3972. VAR dest: LONGREAL;
  3973. BEGIN
  3974. dest := 0;
  3975. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAXAX );
  3976. RETURN dest;
  3977. END "+*";
  3978. (** COMPLEX *)
  3979. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3980. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3981. BEGIN
  3982. SYSTEM.GET( dadr, dval );
  3983. WHILE (len > 0) DO
  3984. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3985. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3986. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3987. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3988. END;
  3989. SYSTEM.PUT( dadr, dval );
  3990. END SPAZAZLoop;
  3991. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3992. VAR dest: COMPLEX;
  3993. BEGIN
  3994. dest := 0;
  3995. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAZAZ );
  3996. RETURN dest;
  3997. END "+*";
  3998. (** COMPLEX *)
  3999. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4000. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4001. BEGIN
  4002. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4003. WHILE (len > 0) DO
  4004. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4005. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4006. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4007. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4008. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4009. END;
  4010. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4011. END SPALZALZLoop;
  4012. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4013. VAR dest: LONGCOMPLEX;
  4014. BEGIN
  4015. dest := 0;
  4016. ApplyBinaryAASOp( ADDRESSOF( dest ),left,right, loopSPALZALZ );
  4017. RETURN dest;
  4018. END "+*";
  4019. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4020. (** BOOLEAN *)
  4021. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4022. VAR lval, rval: BOOLEAN;
  4023. BEGIN
  4024. WHILE (len > 0) DO
  4025. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4026. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4027. END;
  4028. END EEqlABABLoop;
  4029. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4030. BEGIN
  4031. ApplyBinaryAAAOp( RESULT, left, right,
  4032. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4033. RETURN RESULT
  4034. END ".=";
  4035. (** SHORTINT *)
  4036. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4037. VAR lval, rval: SHORTINT;
  4038. BEGIN
  4039. WHILE (len > 0) DO
  4040. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4041. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4042. END;
  4043. END EEqlASASLoop;
  4044. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4045. BEGIN
  4046. ApplyBinaryAAAOp( RESULT, left, right,
  4047. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4048. RETURN RESULT
  4049. END ".=";
  4050. (** INTEGER *)
  4051. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4052. VAR lval, rval: INTEGER;
  4053. BEGIN
  4054. WHILE (len > 0) DO
  4055. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4056. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4057. END;
  4058. END EEqlAIAILoop;
  4059. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4060. BEGIN
  4061. ApplyBinaryAAAOp( RESULT, left, right,
  4062. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4063. RETURN RESULT
  4064. END ".=";
  4065. (** LONGINT *)
  4066. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4067. VAR lval, rval: LONGINT;
  4068. BEGIN
  4069. WHILE (len > 0) DO
  4070. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4071. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4072. END;
  4073. END EEqlALALLoop;
  4074. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4075. BEGIN
  4076. ApplyBinaryAAAOp( RESULT, left, right,
  4077. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4078. RETURN RESULT
  4079. END ".=";
  4080. (** REAL *)
  4081. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4082. VAR lval, rval: REAL;
  4083. BEGIN
  4084. WHILE (len > 0) DO
  4085. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4086. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4087. END;
  4088. END EEqlARARLoop;
  4089. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4090. BEGIN
  4091. ApplyBinaryAAAOp( RESULT, left, right,
  4092. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4093. RETURN RESULT
  4094. END ".=";
  4095. (** LONGREAL *)
  4096. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4097. VAR lval, rval: LONGREAL;
  4098. BEGIN
  4099. WHILE (len > 0) DO
  4100. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4101. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4102. END;
  4103. END EEqlAXAXLoop;
  4104. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4105. BEGIN
  4106. ApplyBinaryAAAOp( RESULT, left, right,
  4107. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4108. RETURN RESULT
  4109. END ".=";
  4110. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4111. (** BOOLEAN *)
  4112. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4113. VAR lval, rval: BOOLEAN;
  4114. BEGIN
  4115. SYSTEM.GET( radr, rval );
  4116. WHILE (len > 0) DO
  4117. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4118. INC( dadr, dinc ); DEC( len );
  4119. END;
  4120. END EEqlABSBLoop;
  4121. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4122. BEGIN
  4123. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4124. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4125. RETURN RESULT
  4126. END ".=";
  4127. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4128. BEGIN
  4129. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4130. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4131. RETURN RESULT
  4132. END ".=";
  4133. (** SHORTINT *)
  4134. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4135. VAR lval, rval: SHORTINT;
  4136. BEGIN
  4137. SYSTEM.GET( radr, rval );
  4138. WHILE (len > 0) DO
  4139. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4140. INC( dadr, dinc ); DEC( len );
  4141. END;
  4142. END EEqlASSSLoop;
  4143. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4144. BEGIN
  4145. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4146. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4147. RETURN RESULT
  4148. END ".=";
  4149. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4150. BEGIN
  4151. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4152. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4153. RETURN RESULT
  4154. END ".=";
  4155. (** INTEGER *)
  4156. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4157. VAR lval, rval: INTEGER;
  4158. BEGIN
  4159. SYSTEM.GET( radr, rval );
  4160. WHILE (len > 0) DO
  4161. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4162. INC( dadr, dinc ); DEC( len );
  4163. END;
  4164. END EEqlAISILoop;
  4165. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4166. BEGIN
  4167. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4168. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4169. RETURN RESULT
  4170. END ".=";
  4171. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4172. BEGIN
  4173. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4174. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4175. RETURN RESULT
  4176. END ".=";
  4177. (** LONGINT *)
  4178. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4179. VAR lval, rval: LONGINT;
  4180. BEGIN
  4181. SYSTEM.GET( radr, rval );
  4182. WHILE (len > 0) DO
  4183. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4184. INC( dadr, dinc ); DEC( len );
  4185. END;
  4186. END EEqlALSLLoop;
  4187. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4188. BEGIN
  4189. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4190. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4191. RETURN RESULT
  4192. END ".=";
  4193. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4194. BEGIN
  4195. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4196. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4197. RETURN RESULT
  4198. END ".=";
  4199. (** REAL *)
  4200. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4201. VAR lval, rval: REAL;
  4202. BEGIN
  4203. SYSTEM.GET( radr, rval );
  4204. WHILE (len > 0) DO
  4205. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4206. INC( dadr, dinc ); DEC( len );
  4207. END;
  4208. END EEqlARSRLoop;
  4209. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4210. BEGIN
  4211. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4212. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4213. RETURN RESULT
  4214. END ".=";
  4215. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4216. BEGIN
  4217. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4218. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4219. RETURN RESULT
  4220. END ".=";
  4221. (** LONGREAL *)
  4222. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4223. VAR lval, rval: LONGREAL;
  4224. BEGIN
  4225. SYSTEM.GET( radr, rval );
  4226. WHILE (len > 0) DO
  4227. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4228. INC( dadr, dinc ); DEC( len );
  4229. END;
  4230. END EEqlAXSXLoop;
  4231. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4232. BEGIN
  4233. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4234. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4235. RETURN RESULT
  4236. END ".=";
  4237. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4238. BEGIN
  4239. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4240. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4241. RETURN RESULT
  4242. END ".=";
  4243. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4244. (** BOOLEAN *)
  4245. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4246. VAR lval, rval: BOOLEAN;
  4247. BEGIN
  4248. WHILE (len > 0) DO
  4249. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4250. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4251. END;
  4252. END ENeqABABLoop;
  4253. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4254. BEGIN
  4255. ApplyBinaryAAAOp( RESULT, left, right,
  4256. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4257. RETURN RESULT
  4258. END ".#";
  4259. (** SHORTINT *)
  4260. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4261. VAR lval, rval: SHORTINT;
  4262. BEGIN
  4263. WHILE (len > 0) DO
  4264. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4265. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4266. END;
  4267. END ENeqASASLoop;
  4268. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4269. BEGIN
  4270. ApplyBinaryAAAOp( RESULT, left, right,
  4271. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4272. RETURN RESULT
  4273. END ".#";
  4274. (** INTEGER*)
  4275. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4276. VAR lval, rval: INTEGER;
  4277. BEGIN
  4278. WHILE (len > 0) DO
  4279. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4280. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4281. END;
  4282. END ENeqAIAILoop;
  4283. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4284. BEGIN
  4285. ApplyBinaryAAAOp( RESULT, left, right,
  4286. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4287. RETURN RESULT
  4288. END ".#";
  4289. (** LONGINT*)
  4290. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4291. VAR lval, rval: LONGINT;
  4292. BEGIN
  4293. WHILE (len > 0) DO
  4294. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4295. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4296. END;
  4297. END ENeqALALLoop;
  4298. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4299. BEGIN
  4300. ApplyBinaryAAAOp( RESULT, left, right,
  4301. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4302. RETURN RESULT
  4303. END ".#";
  4304. (** REAL *)
  4305. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4306. VAR lval, rval: REAL;
  4307. BEGIN
  4308. WHILE (len > 0) DO
  4309. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4310. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4311. END;
  4312. END ENeqARARLoop;
  4313. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4314. BEGIN
  4315. ApplyBinaryAAAOp( RESULT, left, right,
  4316. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4317. RETURN RESULT
  4318. END ".#";
  4319. (** LONGREAL *)
  4320. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4321. VAR lval, rval: LONGREAL;
  4322. BEGIN
  4323. WHILE (len > 0) DO
  4324. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4325. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4326. END;
  4327. END ENeqAXAXLoop;
  4328. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4329. BEGIN
  4330. ApplyBinaryAAAOp( RESULT, left, right,
  4331. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4332. RETURN RESULT
  4333. END ".#";
  4334. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4335. (** BOOLEAN *)
  4336. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4337. VAR lval, rval: BOOLEAN;
  4338. BEGIN
  4339. SYSTEM.GET( radr, rval );
  4340. WHILE (len > 0) DO
  4341. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4342. INC( dadr, dinc ); DEC( len );
  4343. END;
  4344. END ENeqABSBLoop;
  4345. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4346. BEGIN
  4347. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4348. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4349. RETURN RESULT
  4350. END ".#";
  4351. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4352. BEGIN
  4353. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4354. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4355. RETURN RESULT
  4356. END ".#";
  4357. (** SHORTINT *)
  4358. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4359. VAR lval, rval: SHORTINT;
  4360. BEGIN
  4361. SYSTEM.GET( radr, rval );
  4362. WHILE (len > 0) DO
  4363. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4364. INC( dadr, dinc ); DEC( len );
  4365. END;
  4366. END ENeqASSSLoop;
  4367. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4368. BEGIN
  4369. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4370. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4371. RETURN RESULT
  4372. END ".#";
  4373. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4374. BEGIN
  4375. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4376. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4377. RETURN RESULT
  4378. END ".#";
  4379. (** INTEGER *)
  4380. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4381. VAR lval, rval: INTEGER;
  4382. BEGIN
  4383. SYSTEM.GET( radr, rval );
  4384. WHILE (len > 0) DO
  4385. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4386. INC( dadr, dinc ); DEC( len );
  4387. END;
  4388. END ENeqAISILoop;
  4389. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4390. BEGIN
  4391. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4392. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4393. RETURN RESULT
  4394. END ".#";
  4395. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4396. BEGIN
  4397. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4398. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4399. RETURN RESULT
  4400. END ".#";
  4401. (** LONGINT *)
  4402. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4403. VAR lval, rval: LONGINT;
  4404. BEGIN
  4405. SYSTEM.GET( radr, rval );
  4406. WHILE (len > 0) DO
  4407. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4408. INC( dadr, dinc ); DEC( len );
  4409. END;
  4410. END ENeqALSLLoop;
  4411. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4412. BEGIN
  4413. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4414. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4415. RETURN RESULT
  4416. END ".#";
  4417. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4418. BEGIN
  4419. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4420. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4421. RETURN RESULT
  4422. END ".#";
  4423. (** REAL *)
  4424. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4425. VAR lval, rval: REAL;
  4426. BEGIN
  4427. SYSTEM.GET( radr, rval );
  4428. WHILE (len > 0) DO
  4429. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4430. INC( dadr, dinc ); DEC( len );
  4431. END;
  4432. END ENeqARSRLoop;
  4433. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4434. BEGIN
  4435. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4436. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4437. RETURN RESULT
  4438. END ".#";
  4439. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4440. BEGIN
  4441. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4442. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4443. RETURN RESULT
  4444. END ".#";
  4445. (** LONGREAL *)
  4446. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4447. VAR lval, rval: LONGREAL;
  4448. BEGIN
  4449. SYSTEM.GET( radr, rval );
  4450. WHILE (len > 0) DO
  4451. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4452. INC( dadr, dinc ); DEC( len );
  4453. END;
  4454. END ENeqAXSXLoop;
  4455. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4456. BEGIN
  4457. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4458. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4459. RETURN RESULT
  4460. END ".#";
  4461. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4462. BEGIN
  4463. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4464. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4465. RETURN RESULT
  4466. END ".#";
  4467. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4468. (** SHORTINT *)
  4469. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4470. VAR lval, rval: SHORTINT;
  4471. BEGIN
  4472. WHILE (len > 0) DO
  4473. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4474. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4475. END;
  4476. END EGtrASASLoop;
  4477. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4478. BEGIN
  4479. ApplyBinaryAAAOp( RESULT, left, right,
  4480. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4481. RETURN RESULT
  4482. END ".>";
  4483. (** INTEGER *)
  4484. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4485. VAR lval, rval: INTEGER;
  4486. BEGIN
  4487. WHILE (len > 0) DO
  4488. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4489. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4490. END;
  4491. END EGtrAIAILoop;
  4492. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4493. BEGIN
  4494. ApplyBinaryAAAOp( RESULT, left, right,
  4495. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4496. RETURN RESULT
  4497. END ".>";
  4498. (** LONGINT *)
  4499. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4500. VAR lval, rval: LONGINT;
  4501. BEGIN
  4502. WHILE (len > 0) DO
  4503. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4504. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4505. END;
  4506. END EGtrALALLoop;
  4507. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4508. BEGIN
  4509. ApplyBinaryAAAOp( RESULT, left, right,
  4510. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4511. RETURN RESULT
  4512. END ".>";
  4513. (** REAL *)
  4514. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4515. VAR lval, rval: REAL;
  4516. BEGIN
  4517. WHILE (len > 0) DO
  4518. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4519. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4520. END;
  4521. END EGtrARARLoop;
  4522. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4523. BEGIN
  4524. ApplyBinaryAAAOp( RESULT, left, right,
  4525. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4526. RETURN RESULT
  4527. END ".>";
  4528. (** LONGREAL *)
  4529. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4530. VAR lval, rval: LONGREAL;
  4531. BEGIN
  4532. WHILE (len > 0) DO
  4533. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4534. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4535. END;
  4536. END EGtrAXAXLoop;
  4537. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4538. BEGIN
  4539. ApplyBinaryAAAOp( RESULT, left, right,
  4540. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4541. RETURN RESULT
  4542. END ".>";
  4543. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4544. (** SHORTINT *)
  4545. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4546. VAR lval, rval: SHORTINT;
  4547. BEGIN
  4548. SYSTEM.GET( radr, rval );
  4549. WHILE (len > 0) DO
  4550. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4551. INC( dadr, dinc ); DEC( len );
  4552. END;
  4553. END EGtrASSSLoop;
  4554. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4555. BEGIN
  4556. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4557. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4558. RETURN RESULT
  4559. END ".>";
  4560. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4561. BEGIN
  4562. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4563. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4564. RETURN RESULT
  4565. END ".<";
  4566. (** INTEGER *)
  4567. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4568. VAR lval, rval: INTEGER;
  4569. BEGIN
  4570. SYSTEM.GET( radr, rval );
  4571. WHILE (len > 0) DO
  4572. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4573. INC( dadr, dinc ); DEC( len );
  4574. END;
  4575. END EGtrAISILoop;
  4576. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4577. BEGIN
  4578. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4579. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4580. RETURN RESULT
  4581. END ".>";
  4582. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4583. BEGIN
  4584. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4585. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4586. RETURN RESULT
  4587. END ".<";
  4588. (** LONGINT *)
  4589. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4590. VAR lval, rval: LONGINT;
  4591. BEGIN
  4592. SYSTEM.GET( radr, rval );
  4593. WHILE (len > 0) DO
  4594. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4595. INC( dadr, dinc ); DEC( len );
  4596. END;
  4597. END EGtrALSLLoop;
  4598. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4599. BEGIN
  4600. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4601. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4602. RETURN RESULT
  4603. END ".>";
  4604. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4605. BEGIN
  4606. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4607. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4608. RETURN RESULT
  4609. END ".<";
  4610. (** REAL *)
  4611. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4612. VAR lval, rval: REAL;
  4613. BEGIN
  4614. SYSTEM.GET( radr, rval );
  4615. WHILE (len > 0) DO
  4616. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4617. INC( dadr, dinc ); DEC( len );
  4618. END;
  4619. END EGtrARSRLoop;
  4620. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4621. BEGIN
  4622. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4623. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4624. RETURN RESULT
  4625. END ".>";
  4626. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4627. BEGIN
  4628. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4629. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4630. RETURN RESULT
  4631. END ".<";
  4632. (** LONGREAL *)
  4633. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4634. VAR lval, rval: LONGREAL;
  4635. BEGIN
  4636. SYSTEM.GET( radr, rval );
  4637. WHILE (len > 0) DO
  4638. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4639. INC( dadr, dinc ); DEC( len );
  4640. END;
  4641. END EGtrAXSXLoop;
  4642. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4643. BEGIN
  4644. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4645. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4646. RETURN RESULT
  4647. END ".>";
  4648. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4649. BEGIN
  4650. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4651. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4652. RETURN RESULT
  4653. END ".<";
  4654. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4655. (** SHORTINT *)
  4656. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4657. VAR lval, rval: SHORTINT;
  4658. BEGIN
  4659. WHILE (len > 0) DO
  4660. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4661. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4662. END;
  4663. END EGeqASASLoop;
  4664. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4665. BEGIN
  4666. ApplyBinaryAAAOp( RESULT, left, right,
  4667. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4668. RETURN RESULT
  4669. END ".>=";
  4670. (** INTEGER *)
  4671. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4672. VAR lval, rval: INTEGER;
  4673. BEGIN
  4674. WHILE (len > 0) DO
  4675. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4676. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4677. END;
  4678. END EGeqAIAILoop;
  4679. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4680. BEGIN
  4681. ApplyBinaryAAAOp( RESULT, left, right,
  4682. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4683. RETURN RESULT
  4684. END ".>=";
  4685. (** LONGINT *)
  4686. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4687. VAR lval, rval: LONGINT;
  4688. BEGIN
  4689. WHILE (len > 0) DO
  4690. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4691. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4692. END;
  4693. END EGeqALALLoop;
  4694. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4695. BEGIN
  4696. ApplyBinaryAAAOp( RESULT, left, right,
  4697. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4698. RETURN RESULT
  4699. END ".>=";
  4700. (** REAL *)
  4701. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4702. VAR lval, rval: REAL;
  4703. BEGIN
  4704. WHILE (len > 0) DO
  4705. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4706. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4707. END;
  4708. END EGeqARARLoop;
  4709. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4710. BEGIN
  4711. ApplyBinaryAAAOp( RESULT, left, right,
  4712. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4713. RETURN RESULT
  4714. END ".>=";
  4715. (** LONGREAL *)
  4716. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4717. VAR lval, rval: LONGREAL;
  4718. BEGIN
  4719. WHILE (len > 0) DO
  4720. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4721. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4722. END;
  4723. END EGeqAXAXLoop;
  4724. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4725. BEGIN
  4726. ApplyBinaryAAAOp( RESULT, left, right,
  4727. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4728. RETURN RESULT
  4729. END ".>=";
  4730. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4731. (** SHORTINT *)
  4732. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4733. VAR lval, rval: SHORTINT;
  4734. BEGIN
  4735. SYSTEM.GET( radr, rval );
  4736. WHILE (len > 0) DO
  4737. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4738. INC( dadr, dinc ); DEC( len );
  4739. END;
  4740. END EGeqASSSLoop;
  4741. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4742. BEGIN
  4743. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4744. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4745. RETURN RESULT
  4746. END ".>=";
  4747. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4748. BEGIN
  4749. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4750. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4751. RETURN RESULT
  4752. END ".<=";
  4753. (** INTEGER *)
  4754. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4755. VAR lval, rval: INTEGER;
  4756. BEGIN
  4757. SYSTEM.GET( radr, rval );
  4758. WHILE (len > 0) DO
  4759. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4760. INC( dadr, dinc ); DEC( len );
  4761. END;
  4762. END EGeqAISILoop;
  4763. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4764. BEGIN
  4765. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4766. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4767. RETURN RESULT
  4768. END ".>=";
  4769. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4770. BEGIN
  4771. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4772. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4773. RETURN RESULT
  4774. END ".<=";
  4775. (** LONGINT *)
  4776. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4777. VAR lval, rval: LONGINT;
  4778. BEGIN
  4779. SYSTEM.GET( radr, rval );
  4780. WHILE (len > 0) DO
  4781. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4782. INC( dadr, dinc ); DEC( len );
  4783. END;
  4784. END EGeqALSLLoop;
  4785. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4786. BEGIN
  4787. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4788. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4789. RETURN RESULT
  4790. END ".>=";
  4791. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4792. BEGIN
  4793. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4794. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4795. RETURN RESULT
  4796. END ".<=";
  4797. (** REAL *)
  4798. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4799. VAR lval, rval: REAL;
  4800. BEGIN
  4801. SYSTEM.GET( radr, rval );
  4802. WHILE (len > 0) DO
  4803. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4804. INC( dadr, dinc ); DEC( len );
  4805. END;
  4806. END EGeqARSRLoop;
  4807. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4808. BEGIN
  4809. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4810. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4811. RETURN RESULT
  4812. END ".>=";
  4813. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4814. BEGIN
  4815. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4816. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4817. RETURN RESULT
  4818. END ".<=";
  4819. (** LONGREAL *)
  4820. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4821. VAR lval, rval: LONGREAL;
  4822. BEGIN
  4823. SYSTEM.GET( radr, rval );
  4824. WHILE (len > 0) DO
  4825. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4826. INC( dadr, dinc ); DEC( len );
  4827. END;
  4828. END EGeqAXSXLoop;
  4829. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4830. BEGIN
  4831. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4832. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4833. RETURN RESULT
  4834. END ".>=";
  4835. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4836. BEGIN
  4837. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4838. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4839. RETURN RESULT
  4840. END ".<=";
  4841. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4842. (** SHORTINT *)
  4843. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4844. VAR lval, rval: SHORTINT;
  4845. BEGIN
  4846. WHILE (len > 0) DO
  4847. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4848. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4849. END;
  4850. END ELssASASLoop;
  4851. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4852. BEGIN
  4853. ApplyBinaryAAAOp( RESULT, left, right,
  4854. SIZEOF( BOOLEAN ), ELssASASLoop );
  4855. RETURN RESULT
  4856. END ".<";
  4857. (** INTEGER *)
  4858. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4859. VAR lval, rval: INTEGER;
  4860. BEGIN
  4861. WHILE (len > 0) DO
  4862. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4863. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4864. END;
  4865. END ELssAIAILoop;
  4866. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4867. BEGIN
  4868. ApplyBinaryAAAOp( RESULT, left, right,
  4869. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4870. RETURN RESULT
  4871. END ".<";
  4872. (** LONGINT*)
  4873. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4874. VAR lval, rval: LONGINT;
  4875. BEGIN
  4876. WHILE (len > 0) DO
  4877. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4878. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4879. END;
  4880. END ELssALALLoop;
  4881. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4882. BEGIN
  4883. ApplyBinaryAAAOp( RESULT, left, right,
  4884. SIZEOF( BOOLEAN ), ELssALALLoop );
  4885. RETURN RESULT
  4886. END ".<";
  4887. (** REAL *)
  4888. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4889. VAR lval, rval: REAL;
  4890. BEGIN
  4891. WHILE (len > 0) DO
  4892. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4893. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4894. END;
  4895. END ELssARARLoop;
  4896. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4897. BEGIN
  4898. ApplyBinaryAAAOp( RESULT, left, right,
  4899. SIZEOF( BOOLEAN ), ELssARARLoop );
  4900. RETURN RESULT
  4901. END ".<";
  4902. (** LONGREAL *)
  4903. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4904. VAR lval, rval: LONGREAL;
  4905. BEGIN
  4906. WHILE (len > 0) DO
  4907. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4908. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4909. END;
  4910. END ELssAXAXLoop;
  4911. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4912. BEGIN
  4913. ApplyBinaryAAAOp( RESULT, left, right,
  4914. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4915. RETURN RESULT
  4916. END ".<";
  4917. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4918. (** SHORTINT *)
  4919. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4920. VAR lval, rval: SHORTINT;
  4921. BEGIN
  4922. SYSTEM.GET( radr, rval );
  4923. WHILE (len > 0) DO
  4924. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4925. INC( dadr, dinc ); DEC( len );
  4926. END;
  4927. END ELssASSSLoop;
  4928. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4929. BEGIN
  4930. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4931. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4932. RETURN RESULT
  4933. END ".<";
  4934. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4935. BEGIN
  4936. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4937. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4938. RETURN RESULT
  4939. END ".>";
  4940. (** INTEGER *)
  4941. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4942. VAR lval, rval: INTEGER;
  4943. BEGIN
  4944. SYSTEM.GET( radr, rval );
  4945. WHILE (len > 0) DO
  4946. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4947. INC( dadr, dinc ); DEC( len );
  4948. END;
  4949. END ELssAISILoop;
  4950. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4951. BEGIN
  4952. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4953. SIZEOF( BOOLEAN ), ELssAISILoop );
  4954. RETURN RESULT
  4955. END ".<";
  4956. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4957. BEGIN
  4958. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4959. SIZEOF( BOOLEAN ), ELssAISILoop );
  4960. RETURN RESULT
  4961. END ".>";
  4962. (** LONGINT *)
  4963. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4964. VAR lval, rval: LONGINT;
  4965. BEGIN
  4966. SYSTEM.GET( radr, rval );
  4967. WHILE (len > 0) DO
  4968. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4969. INC( dadr, dinc ); DEC( len );
  4970. END;
  4971. END ELssALSLLoop;
  4972. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4973. BEGIN
  4974. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4975. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4976. RETURN RESULT
  4977. END ".<";
  4978. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4979. BEGIN
  4980. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4981. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4982. RETURN RESULT
  4983. END ".>";
  4984. (** REAL *)
  4985. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4986. VAR lval, rval: REAL;
  4987. BEGIN
  4988. SYSTEM.GET( radr, rval );
  4989. WHILE (len > 0) DO
  4990. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4991. INC( dadr, dinc ); DEC( len );
  4992. END;
  4993. END ELssARSRLoop;
  4994. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4995. BEGIN
  4996. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4997. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4998. RETURN RESULT
  4999. END ".<";
  5000. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5001. BEGIN
  5002. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5003. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5004. RETURN RESULT
  5005. END ".>";
  5006. (** LONGREAL *)
  5007. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5008. VAR lval, rval: LONGREAL;
  5009. BEGIN
  5010. SYSTEM.GET( radr, rval );
  5011. WHILE (len > 0) DO
  5012. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5013. INC( dadr, dinc ); DEC( len );
  5014. END;
  5015. END ELssAXSXLoop;
  5016. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5017. BEGIN
  5018. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5019. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5020. RETURN RESULT
  5021. END ".<";
  5022. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5023. BEGIN
  5024. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5025. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5026. RETURN RESULT
  5027. END ".>";
  5028. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5029. (** SHORTINT *)
  5030. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5031. VAR lval, rval: SHORTINT;
  5032. BEGIN
  5033. WHILE (len > 0) DO
  5034. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5035. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5036. END;
  5037. END ELeqASASLoop;
  5038. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5039. BEGIN
  5040. ApplyBinaryAAAOp( RESULT, left, right,
  5041. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5042. RETURN RESULT
  5043. END ".<=";
  5044. (** INTEGER *)
  5045. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5046. VAR lval, rval: INTEGER;
  5047. BEGIN
  5048. WHILE (len > 0) DO
  5049. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5050. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5051. END;
  5052. END ELeqAIAILoop;
  5053. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5054. BEGIN
  5055. ApplyBinaryAAAOp( RESULT, left, right,
  5056. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5057. RETURN RESULT
  5058. END ".<=";
  5059. (** LONGINT *)
  5060. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5061. VAR lval, rval: LONGINT;
  5062. BEGIN
  5063. WHILE (len > 0) DO
  5064. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5065. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5066. END;
  5067. END ELeqALALLoop;
  5068. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5069. BEGIN
  5070. ApplyBinaryAAAOp( RESULT, left, right,
  5071. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5072. RETURN RESULT
  5073. END ".<=";
  5074. (** REAL *)
  5075. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5076. VAR lval, rval: REAL;
  5077. BEGIN
  5078. WHILE (len > 0) DO
  5079. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5080. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5081. END;
  5082. END ELeqARARLoop;
  5083. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5084. BEGIN
  5085. ApplyBinaryAAAOp( RESULT, left, right,
  5086. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5087. RETURN RESULT
  5088. END ".<=";
  5089. (** LONGREAL*)
  5090. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5091. VAR lval, rval: LONGREAL;
  5092. BEGIN
  5093. WHILE (len > 0) DO
  5094. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5095. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5096. END;
  5097. END ELeqAXAXLoop;
  5098. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5099. BEGIN
  5100. ApplyBinaryAAAOp( RESULT, left, right,
  5101. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5102. RETURN RESULT
  5103. END ".<=";
  5104. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5105. (** SHORTINT *)
  5106. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5107. VAR lval, rval: SHORTINT;
  5108. BEGIN
  5109. SYSTEM.GET( radr, rval );
  5110. WHILE (len > 0) DO
  5111. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5112. INC( dadr, dinc ); DEC( len );
  5113. END;
  5114. END ELeqASSSLoop;
  5115. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5116. BEGIN
  5117. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5118. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5119. RETURN RESULT
  5120. END ".<=";
  5121. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5122. BEGIN
  5123. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5124. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5125. RETURN RESULT
  5126. END ".>=";
  5127. (** INTEGER *)
  5128. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5129. VAR lval, rval: INTEGER;
  5130. BEGIN
  5131. SYSTEM.GET( radr, rval );
  5132. WHILE (len > 0) DO
  5133. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5134. INC( dadr, dinc ); DEC( len );
  5135. END;
  5136. END ELeqAISILoop;
  5137. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5138. BEGIN
  5139. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5140. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5141. RETURN RESULT
  5142. END ".<=";
  5143. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5144. BEGIN
  5145. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5146. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5147. RETURN RESULT
  5148. END ".>=";
  5149. (** LONGINT *)
  5150. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5151. VAR lval, rval: LONGINT;
  5152. BEGIN
  5153. SYSTEM.GET( radr, rval );
  5154. WHILE (len > 0) DO
  5155. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5156. INC( dadr, dinc ); DEC( len );
  5157. END;
  5158. END ELeqALSLLoop;
  5159. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5160. BEGIN
  5161. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5162. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5163. RETURN RESULT
  5164. END ".<=";
  5165. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5166. BEGIN
  5167. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5168. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5169. RETURN RESULT
  5170. END ".>=";
  5171. (** REAL *)
  5172. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5173. VAR lval, rval: REAL;
  5174. BEGIN
  5175. SYSTEM.GET( radr, rval );
  5176. WHILE (len > 0) DO
  5177. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5178. INC( dadr, dinc ); DEC( len );
  5179. END;
  5180. END ELeqARSRLoop;
  5181. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5182. BEGIN
  5183. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5184. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5185. RETURN RESULT
  5186. END ".<=";
  5187. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5188. BEGIN
  5189. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5190. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5191. RETURN RESULT
  5192. END ".>=";
  5193. (** LONGREAL *)
  5194. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5195. VAR lval, rval: LONGREAL;
  5196. BEGIN
  5197. SYSTEM.GET( radr, rval );
  5198. WHILE (len > 0) DO
  5199. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5200. INC( dadr, dinc ); DEC( len );
  5201. END;
  5202. END ELeqAXSXLoop;
  5203. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5204. BEGIN
  5205. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5206. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5207. RETURN RESULT
  5208. END ".<=";
  5209. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5210. BEGIN
  5211. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5212. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5213. RETURN RESULT
  5214. END ".>=";
  5215. (*** elementwise or, elementwise and ********************************************************************)
  5216. (** array x array *)
  5217. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5218. VAR lval, rval: BOOLEAN;
  5219. BEGIN
  5220. WHILE (len > 0) DO
  5221. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5222. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5223. END;
  5224. END ElOrABABLoop;
  5225. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5226. BEGIN
  5227. ApplyBinaryAAAOp( RESULT, left, right,
  5228. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5229. RETURN RESULT
  5230. END "OR";
  5231. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5232. VAR lval, rval: BOOLEAN;
  5233. BEGIN
  5234. WHILE (len > 0) DO
  5235. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5236. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5237. END;
  5238. END ElAndABABLoop;
  5239. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5240. BEGIN
  5241. ApplyBinaryAAAOp( RESULT, left, right,
  5242. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5243. RETURN RESULT
  5244. END "&";
  5245. (** array x boolean *)
  5246. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5247. VAR lval, rval: BOOLEAN;
  5248. BEGIN
  5249. SYSTEM.GET( radr, rval );
  5250. WHILE (len > 0) DO
  5251. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5252. INC( dadr, dinc ); DEC( len );
  5253. END;
  5254. END ElOrABSBLoop;
  5255. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5256. BEGIN
  5257. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5258. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5259. RETURN RESULT
  5260. END "OR";
  5261. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5262. BEGIN
  5263. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5264. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5265. RETURN RESULT
  5266. END "OR";
  5267. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5268. VAR lval, rval: BOOLEAN;
  5269. BEGIN
  5270. SYSTEM.GET( radr, rval );
  5271. WHILE (len > 0) DO
  5272. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5273. INC( dadr, dinc ); DEC( len );
  5274. END;
  5275. END ElAndABSBLoop;
  5276. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5277. BEGIN
  5278. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5279. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5280. RETURN RESULT
  5281. END "&";
  5282. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5283. BEGIN
  5284. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5285. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5286. RETURN RESULT
  5287. END "&";
  5288. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5289. (** SHORTINT *)
  5290. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5291. VAR lval, rval: SHORTINT;
  5292. BEGIN
  5293. WHILE (len > 0) DO
  5294. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5295. IF rval <= lval THEN RETURN FALSE END;
  5296. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5297. END;
  5298. RETURN TRUE;
  5299. END LssASASLoop;
  5300. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5301. BEGIN
  5302. RETURN ApplyBinaryAABOp( left, right, LssASASLoop , FALSE);
  5303. END "<";
  5304. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5305. VAR lval, rval: SHORTINT;
  5306. BEGIN
  5307. WHILE (len > 0) DO
  5308. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5309. IF rval > lval THEN RETURN FALSE END;
  5310. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5311. END;
  5312. RETURN TRUE;
  5313. END GeqASASLoop;
  5314. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5315. BEGIN
  5316. RETURN ApplyBinaryAABOp( left, right, GeqASASLoop , FALSE);
  5317. END ">=";
  5318. (** INTEGER *)
  5319. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5320. VAR lval, rval: INTEGER;
  5321. BEGIN
  5322. WHILE (len > 0) DO
  5323. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5324. IF rval <= lval THEN RETURN FALSE END;
  5325. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5326. END;
  5327. RETURN TRUE;
  5328. END LssAIAILoop;
  5329. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5330. BEGIN
  5331. RETURN ApplyBinaryAABOp( left, right, LssAIAILoop , FALSE);
  5332. END "<";
  5333. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5334. VAR lval, rval: INTEGER;
  5335. BEGIN
  5336. WHILE (len > 0) DO
  5337. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5338. IF rval > lval THEN RETURN FALSE END;
  5339. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5340. END;
  5341. RETURN TRUE;
  5342. END GeqAIAILoop;
  5343. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5344. BEGIN
  5345. RETURN ApplyBinaryAABOp( left, right, GeqAIAILoop , FALSE);
  5346. END ">=";
  5347. (** LONGINT *)
  5348. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5349. VAR lval, rval: LONGINT;
  5350. BEGIN
  5351. WHILE (len > 0) DO
  5352. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5353. IF rval <= lval THEN RETURN FALSE END;
  5354. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5355. END;
  5356. RETURN TRUE;
  5357. END LssALALLoop;
  5358. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5359. BEGIN
  5360. RETURN ApplyBinaryAABOp( left, right, LssALALLoop , FALSE);
  5361. END "<";
  5362. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5363. VAR lval, rval: LONGINT;
  5364. BEGIN
  5365. WHILE (len > 0) DO
  5366. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5367. IF rval > lval THEN RETURN FALSE END;
  5368. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5369. END;
  5370. RETURN TRUE;
  5371. END GeqALALLoop;
  5372. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5373. BEGIN
  5374. RETURN ApplyBinaryAABOp( left, right, GeqALALLoop , FALSE);
  5375. END ">=";
  5376. (** SIZE *)
  5377. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5378. VAR lval, rval: LONGINT;
  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 LssAZAZLoop;
  5387. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5388. BEGIN
  5389. RETURN ApplyBinaryAABOp( left, right, LssAZAZLoop , FALSE);
  5390. END "<";
  5391. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5392. VAR lval, rval: SIZE;
  5393. BEGIN
  5394. WHILE (len > 0) DO
  5395. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5396. IF rval > lval THEN RETURN FALSE END;
  5397. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5398. END;
  5399. RETURN TRUE;
  5400. END GeqAZAZLoop;
  5401. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5402. BEGIN
  5403. RETURN ApplyBinaryAABOp( left, right, GeqAZAZLoop , FALSE);
  5404. END ">=";
  5405. (** REAL *)
  5406. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5407. VAR lval, rval: REAL;
  5408. BEGIN
  5409. WHILE (len > 0) DO
  5410. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5411. IF rval <= lval THEN RETURN FALSE END;
  5412. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5413. END;
  5414. RETURN TRUE;
  5415. END LssARARLoop;
  5416. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5417. BEGIN
  5418. RETURN ApplyBinaryAABOp( left, right, LssARARLoop , FALSE);
  5419. END "<";
  5420. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5421. VAR lval, rval: REAL;
  5422. BEGIN
  5423. WHILE (len > 0) DO
  5424. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5425. IF rval > lval THEN RETURN FALSE END;
  5426. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5427. END;
  5428. RETURN TRUE;
  5429. END GeqARARLoop;
  5430. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5431. BEGIN
  5432. RETURN ApplyBinaryAABOp( left, right, GeqARARLoop , FALSE);
  5433. END ">=";
  5434. (** LONGREAL *)
  5435. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5436. VAR lval, rval: LONGREAL;
  5437. BEGIN
  5438. WHILE (len > 0) DO
  5439. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5440. IF rval <= lval THEN RETURN FALSE END;
  5441. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5442. END;
  5443. RETURN TRUE;
  5444. END LssAXAXLoop;
  5445. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5446. BEGIN
  5447. RETURN ApplyBinaryAABOp( left, right, LssAXAXLoop , FALSE);
  5448. END "<";
  5449. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5450. VAR lval, rval: LONGREAL;
  5451. BEGIN
  5452. WHILE (len > 0) DO
  5453. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5454. IF rval > lval THEN RETURN FALSE END;
  5455. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5456. END;
  5457. RETURN TRUE;
  5458. END GeqAXAXLoop;
  5459. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5460. BEGIN
  5461. RETURN ApplyBinaryAABOp( left, right, GeqAXAXLoop , FALSE);
  5462. END ">=";
  5463. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5464. (** SHORTINT *)
  5465. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5466. VAR lval, rval: SHORTINT;
  5467. BEGIN
  5468. WHILE (len > 0) DO
  5469. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5470. IF rval >= lval THEN RETURN FALSE END;
  5471. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5472. END;
  5473. RETURN TRUE;
  5474. END GtrASASLoop;
  5475. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5476. BEGIN
  5477. RETURN ApplyBinaryAABOp( left, right, GtrASASLoop , FALSE);
  5478. END ">";
  5479. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5480. VAR lval, rval: SHORTINT;
  5481. BEGIN
  5482. WHILE (len > 0) DO
  5483. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5484. IF rval < lval THEN RETURN FALSE END;
  5485. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5486. END;
  5487. RETURN TRUE;
  5488. END LeqASASLoop;
  5489. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5490. BEGIN
  5491. RETURN ApplyBinaryAABOp( left, right, LeqASASLoop , FALSE);
  5492. END "<=";
  5493. (** INTEGER *)
  5494. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5495. VAR lval, rval: INTEGER;
  5496. BEGIN
  5497. WHILE (len > 0) DO
  5498. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5499. IF rval >= lval THEN RETURN FALSE END;
  5500. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5501. END;
  5502. RETURN TRUE;
  5503. END GtrAIAILoop;
  5504. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5505. BEGIN
  5506. RETURN ApplyBinaryAABOp( left, right, GtrAIAILoop , FALSE);
  5507. END ">";
  5508. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5509. VAR lval, rval: INTEGER;
  5510. BEGIN
  5511. WHILE (len > 0) DO
  5512. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5513. IF rval < lval THEN RETURN FALSE END;
  5514. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5515. END;
  5516. RETURN TRUE;
  5517. END LeqAIAILoop;
  5518. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5519. BEGIN
  5520. RETURN ApplyBinaryAABOp( left, right, LeqAIAILoop ,FALSE);
  5521. END "<=";
  5522. (** LONGINT *)
  5523. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5524. VAR lval, rval: LONGINT;
  5525. BEGIN
  5526. WHILE (len > 0) DO
  5527. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5528. IF rval >= lval THEN RETURN FALSE END;
  5529. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5530. END;
  5531. RETURN TRUE;
  5532. END GtrALALLoop;
  5533. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5534. BEGIN
  5535. RETURN ApplyBinaryAABOp( left, right, GtrALALLoop , FALSE);
  5536. END ">";
  5537. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5538. VAR lval, rval: LONGINT;
  5539. BEGIN
  5540. WHILE (len > 0) DO
  5541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5542. IF rval < lval THEN RETURN FALSE END;
  5543. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5544. END;
  5545. RETURN TRUE;
  5546. END LeqALALLoop;
  5547. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5548. BEGIN
  5549. RETURN ApplyBinaryAABOp( left, right, LeqALALLoop , FALSE);
  5550. END "<=";
  5551. (** SIZE *)
  5552. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5553. VAR lval, rval: SIZE;
  5554. BEGIN
  5555. WHILE (len > 0) DO
  5556. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5557. IF rval >= lval THEN RETURN FALSE END;
  5558. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5559. END;
  5560. RETURN TRUE;
  5561. END GtrAZAZLoop;
  5562. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5563. BEGIN
  5564. RETURN ApplyBinaryAABOp( left, right, GtrAZAZLoop , FALSE);
  5565. END ">";
  5566. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5567. VAR lval, rval: SIZE;
  5568. BEGIN
  5569. WHILE (len > 0) DO
  5570. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5571. IF rval < lval THEN RETURN FALSE END;
  5572. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5573. END;
  5574. RETURN TRUE;
  5575. END LeqAZAZLoop;
  5576. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5577. BEGIN
  5578. RETURN ApplyBinaryAABOp( left, right, LeqAZAZLoop , FALSE);
  5579. END "<=";
  5580. (** SIZE *)
  5581. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5582. VAR lval, rval: REAL;
  5583. BEGIN
  5584. WHILE (len > 0) DO
  5585. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5586. IF rval >= lval THEN RETURN FALSE END;
  5587. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5588. END;
  5589. RETURN TRUE;
  5590. END GtrARARLoop;
  5591. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5592. BEGIN
  5593. RETURN ApplyBinaryAABOp( left, right, GtrARARLoop , FALSE);
  5594. END ">";
  5595. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5596. VAR lval, rval: REAL;
  5597. BEGIN
  5598. WHILE (len > 0) DO
  5599. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5600. IF rval < lval THEN RETURN FALSE END;
  5601. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5602. END;
  5603. RETURN TRUE;
  5604. END LeqARARLoop;
  5605. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5606. BEGIN
  5607. RETURN ApplyBinaryAABOp( left, right, LeqARARLoop , FALSE);
  5608. END "<=";
  5609. (** LONGREAL *)
  5610. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5611. VAR lval, rval: LONGREAL;
  5612. BEGIN
  5613. WHILE (len > 0) DO
  5614. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5615. IF rval >= lval THEN RETURN FALSE END;
  5616. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5617. END;
  5618. RETURN TRUE;
  5619. END GtrAXAXLoop;
  5620. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5621. BEGIN
  5622. RETURN ApplyBinaryAABOp( left, right, GtrAXAXLoop , FALSE);
  5623. END ">";
  5624. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5625. VAR lval, rval: LONGREAL;
  5626. BEGIN
  5627. WHILE (len > 0) DO
  5628. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5629. IF rval < lval THEN RETURN FALSE END;
  5630. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5631. END;
  5632. RETURN TRUE;
  5633. END LeqAXAXLoop;
  5634. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5635. BEGIN
  5636. RETURN ApplyBinaryAABOp( left, right, LeqAXAXLoop , FALSE);
  5637. END "<=";
  5638. (*** equals: array x array -> boolean ********************************************************************)
  5639. (** BOOLEAN *)
  5640. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5641. VAR lval, rval: BOOLEAN;
  5642. BEGIN
  5643. WHILE (len > 0) DO
  5644. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5645. IF rval # lval THEN RETURN FALSE END;
  5646. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5647. END;
  5648. RETURN TRUE;
  5649. END EqlABABLoop;
  5650. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5651. BEGIN
  5652. RETURN ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5653. END "=";
  5654. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5655. BEGIN
  5656. RETURN ~ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5657. END "#";
  5658. (** SHORTINT *)
  5659. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5660. VAR lval, rval: SHORTINT;
  5661. BEGIN
  5662. WHILE (len > 0) DO
  5663. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5664. IF rval # lval THEN RETURN FALSE END;
  5665. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5666. END;
  5667. RETURN TRUE;
  5668. END EqlASASLoop;
  5669. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5670. BEGIN
  5671. RETURN ApplyBinaryAABOp( left, right, EqlASASLoop , FALSE);
  5672. END "=";
  5673. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5674. BEGIN
  5675. RETURN ~ApplyBinaryAABOp( left, right, EqlASASLoop, FALSE );
  5676. END "#";
  5677. (** INTEGER *)
  5678. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5679. VAR lval, rval: INTEGER;
  5680. BEGIN
  5681. WHILE (len > 0) DO
  5682. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5683. IF rval # lval THEN RETURN FALSE END;
  5684. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5685. END;
  5686. RETURN TRUE;
  5687. END EqlAIAILoop;
  5688. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5689. BEGIN
  5690. RETURN ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5691. END "=";
  5692. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5693. BEGIN
  5694. RETURN ~ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5695. END "#";
  5696. (** LONGINT *)
  5697. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5698. VAR lval, rval: LONGINT;
  5699. BEGIN
  5700. WHILE (len > 0) DO
  5701. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5702. IF rval # lval THEN RETURN FALSE END;
  5703. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5704. END;
  5705. RETURN TRUE;
  5706. END EqlALALLoop;
  5707. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5708. BEGIN
  5709. RETURN ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5710. END "=";
  5711. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5712. BEGIN
  5713. RETURN ~ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5714. END "#";
  5715. (** SIZE *)
  5716. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5717. VAR lval, rval: SIZE;
  5718. BEGIN
  5719. WHILE (len > 0) DO
  5720. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5721. IF rval # lval THEN RETURN FALSE END;
  5722. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5723. END;
  5724. RETURN TRUE;
  5725. END EqlAZAZLoop;
  5726. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5727. BEGIN
  5728. RETURN ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5729. END "=";
  5730. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5731. BEGIN
  5732. RETURN ~ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5733. END "#";
  5734. (** REAL *)
  5735. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5736. VAR lval, rval: REAL;
  5737. BEGIN
  5738. WHILE (len > 0) DO
  5739. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5740. IF rval # lval THEN RETURN FALSE END;
  5741. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5742. END;
  5743. RETURN TRUE;
  5744. END EqlARARLoop;
  5745. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5746. BEGIN
  5747. RETURN ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5748. END "=";
  5749. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5750. BEGIN
  5751. RETURN ~ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5752. END "#";
  5753. (** LONGREAL *)
  5754. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5755. VAR lval, rval: LONGREAL;
  5756. BEGIN
  5757. WHILE (len > 0) DO
  5758. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5759. IF rval # lval THEN RETURN FALSE END;
  5760. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5761. END;
  5762. RETURN TRUE;
  5763. END EqlAXAXLoop;
  5764. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5765. BEGIN
  5766. RETURN ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5767. END "=";
  5768. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5769. BEGIN
  5770. RETURN ~ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5771. END "#";
  5772. (** COMPLEX *)
  5773. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5774. VAR lval, rval: COMPLEX;
  5775. BEGIN
  5776. WHILE (len > 0) DO
  5777. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5778. IF rval # lval THEN RETURN FALSE END;
  5779. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5780. END;
  5781. RETURN TRUE;
  5782. END EqlACACLoop;
  5783. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5784. BEGIN
  5785. RETURN ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5786. END "=";
  5787. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5788. BEGIN
  5789. RETURN ~ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5790. END "#";
  5791. (** LONGCOMPLEX *)
  5792. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5793. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5794. BEGIN
  5795. WHILE (len > 0) DO
  5796. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5797. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5798. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5799. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5800. END;
  5801. RETURN TRUE;
  5802. END EqlALZALZLoop;
  5803. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5804. BEGIN
  5805. RETURN ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5806. END "=";
  5807. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5808. BEGIN
  5809. RETURN ~ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5810. END "#";
  5811. (*** equals: array x scalar -> boolean ********************************************************************)
  5812. (** BOOLEAN *)
  5813. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5814. VAR lval, rval: BOOLEAN;
  5815. BEGIN
  5816. SYSTEM.GET( radr, rval );
  5817. WHILE (len > 0) DO
  5818. SYSTEM.GET( ladr, lval );
  5819. IF lval # rval THEN RETURN FALSE END;
  5820. INC( ladr, linc ); DEC( len );
  5821. END;
  5822. RETURN TRUE;
  5823. END EqlABSBLoop;
  5824. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5825. right: BOOLEAN ): BOOLEAN;
  5826. BEGIN
  5827. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlABSBLoop );
  5828. END "=";
  5829. OPERATOR "="*( left: BOOLEAN;
  5830. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5831. BEGIN
  5832. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlABSBLoop );
  5833. END "=";
  5834. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5835. right: BOOLEAN ): BOOLEAN;
  5836. BEGIN
  5837. RETURN ~(left = right);
  5838. END "#";
  5839. OPERATOR "#"*( left: BOOLEAN;
  5840. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5841. BEGIN
  5842. RETURN ~( left = right );
  5843. END "#";
  5844. (** SHORTINT *)
  5845. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5846. VAR lval, rval: SHORTINT;
  5847. BEGIN
  5848. SYSTEM.GET( radr, rval );
  5849. WHILE (len > 0) DO
  5850. SYSTEM.GET( ladr, lval );
  5851. IF lval # rval THEN RETURN FALSE END;
  5852. INC( ladr, linc ); DEC( len );
  5853. END;
  5854. RETURN TRUE;
  5855. END EqlASSSLoop;
  5856. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5857. BEGIN
  5858. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlASSSLoop );
  5859. END "=";
  5860. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5861. BEGIN
  5862. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlASSSLoop );
  5863. END "=";
  5864. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5865. BEGIN
  5866. RETURN ~( left= right );
  5867. END "#";
  5868. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5869. BEGIN
  5870. RETURN ~( left= right );
  5871. END "#";
  5872. (** INTEGER *)
  5873. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5874. VAR lval, rval: INTEGER;
  5875. BEGIN
  5876. SYSTEM.GET( radr, rval );
  5877. WHILE (len > 0) DO
  5878. SYSTEM.GET( ladr, lval );
  5879. IF lval # rval THEN RETURN FALSE END;
  5880. INC( ladr, linc ); DEC( len );
  5881. END;
  5882. RETURN TRUE;
  5883. END EqlAISILoop;
  5884. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5885. BEGIN
  5886. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAISILoop );
  5887. END "=";
  5888. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5889. BEGIN
  5890. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAISILoop );
  5891. END "=";
  5892. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5893. BEGIN
  5894. RETURN ~( left = right );
  5895. END "#";
  5896. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5897. BEGIN
  5898. RETURN ~( left = right );
  5899. END "#";
  5900. (** LONGINT *)
  5901. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5902. VAR lval, rval: LONGINT;
  5903. BEGIN
  5904. SYSTEM.GET( radr, rval );
  5905. WHILE (len > 0) DO
  5906. SYSTEM.GET( ladr, lval );
  5907. IF lval # rval THEN RETURN FALSE END;
  5908. INC( ladr, linc ); DEC( len );
  5909. END;
  5910. RETURN TRUE;
  5911. END EqlALSLLoop;
  5912. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5913. right: LONGINT ): BOOLEAN;
  5914. BEGIN
  5915. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlALSLLoop );
  5916. END "=";
  5917. OPERATOR "="*( left: LONGINT;
  5918. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5921. END "=";
  5922. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5923. right: LONGINT ): BOOLEAN;
  5924. BEGIN
  5925. RETURN ~(left = right);
  5926. END "#";
  5927. OPERATOR "#"*( left: LONGINT;
  5928. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5929. BEGIN
  5930. RETURN ~(left = right);
  5931. END "#";
  5932. (** SIZE *)
  5933. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5934. VAR lval, rval: SIZE;
  5935. BEGIN
  5936. SYSTEM.GET( radr, rval );
  5937. WHILE (len > 0) DO
  5938. SYSTEM.GET( ladr, lval );
  5939. IF lval # rval THEN RETURN FALSE END;
  5940. INC( ladr, linc ); DEC( len );
  5941. END;
  5942. RETURN TRUE;
  5943. END EqlAZSZLoop;
  5944. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5945. right: SIZE ): BOOLEAN;
  5946. BEGIN
  5947. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAZSZLoop );
  5948. END "=";
  5949. OPERATOR "="*( left: SIZE;
  5950. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5951. BEGIN
  5952. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5953. END "=";
  5954. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5955. right: SIZE ): BOOLEAN;
  5956. BEGIN
  5957. RETURN ~(left = right);
  5958. END "#";
  5959. OPERATOR "#"*( left: SIZE;
  5960. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5961. BEGIN
  5962. RETURN ~(left = right);
  5963. END "#";
  5964. (** REAL *)
  5965. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5966. VAR lval, rval: REAL;
  5967. BEGIN
  5968. SYSTEM.GET( radr, rval );
  5969. WHILE (len > 0) DO
  5970. SYSTEM.GET( ladr, lval );
  5971. IF lval # rval THEN RETURN FALSE END;
  5972. INC( ladr, linc ); DEC( len );
  5973. END;
  5974. RETURN TRUE;
  5975. END EqlARSRLoop;
  5976. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5977. right: REAL ): BOOLEAN;
  5978. BEGIN
  5979. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlARSRLoop );
  5980. END "=";
  5981. OPERATOR "="*( left: REAL;
  5982. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5983. BEGIN
  5984. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlARSRLoop );
  5985. END "=";
  5986. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5987. right: REAL ): BOOLEAN;
  5988. BEGIN
  5989. RETURN ~( left = right );
  5990. END "#";
  5991. OPERATOR "#"*( left: REAL;
  5992. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5993. BEGIN
  5994. RETURN ~( left = right );
  5995. END "#";
  5996. (** LONGREAL *)
  5997. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5998. VAR lval, rval: LONGREAL;
  5999. BEGIN
  6000. SYSTEM.GET( radr, rval );
  6001. WHILE (len > 0) DO
  6002. SYSTEM.GET( ladr, lval );
  6003. IF lval # rval THEN RETURN FALSE END;
  6004. INC( ladr, linc ); DEC( len );
  6005. END;
  6006. RETURN TRUE;
  6007. END EqlAXSXLoop;
  6008. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6009. right: LONGREAL ): BOOLEAN;
  6010. BEGIN
  6011. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAXSXLoop );
  6012. END "=";
  6013. OPERATOR "="*( left: LONGREAL;
  6014. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6015. BEGIN
  6016. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAXSXLoop );
  6017. END "=";
  6018. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6019. right: LONGREAL ): BOOLEAN;
  6020. BEGIN
  6021. RETURN ~( left = right );
  6022. END "#";
  6023. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6024. BEGIN
  6025. RETURN ~( left= right );
  6026. END "#";
  6027. (*** gtr : array x scalar -> boolean ********************************************************************)
  6028. (** SHORTINT *)
  6029. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6030. VAR lval, rval: SHORTINT;
  6031. BEGIN
  6032. SYSTEM.GET( radr, rval );
  6033. WHILE (len > 0) DO
  6034. SYSTEM.GET( ladr, lval );
  6035. IF lval <= rval THEN RETURN FALSE END;
  6036. INC( ladr, linc ); DEC( len );
  6037. END;
  6038. RETURN TRUE;
  6039. END GtrASSSLoop;
  6040. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6041. BEGIN
  6042. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrASSSLoop );
  6043. END ">";
  6044. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6045. BEGIN
  6046. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrASSSLoop );
  6047. END "<";
  6048. (** INTEGER *)
  6049. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6050. VAR lval, rval: INTEGER;
  6051. BEGIN
  6052. SYSTEM.GET( radr, rval );
  6053. WHILE (len > 0) DO
  6054. SYSTEM.GET( ladr, lval );
  6055. IF lval <= rval THEN RETURN FALSE END;
  6056. INC( ladr, linc ); DEC( len );
  6057. END;
  6058. RETURN TRUE;
  6059. END GtrAISILoop;
  6060. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6061. BEGIN
  6062. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAISILoop );
  6063. END ">";
  6064. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6065. BEGIN
  6066. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAISILoop );
  6067. END "<";
  6068. (** LONGINT *)
  6069. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6070. VAR lval, rval: LONGINT;
  6071. BEGIN
  6072. SYSTEM.GET( radr, rval );
  6073. WHILE (len > 0) DO
  6074. SYSTEM.GET( ladr, lval );
  6075. IF lval <= rval THEN RETURN FALSE END;
  6076. INC( ladr, linc ); DEC( len );
  6077. END;
  6078. RETURN TRUE;
  6079. END GtrALSLLoop;
  6080. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6081. BEGIN
  6082. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrALSLLoop );
  6083. END ">";
  6084. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6085. BEGIN
  6086. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrALSLLoop );
  6087. END "<";
  6088. (** SIZE *)
  6089. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6090. VAR lval, rval: SIZE;
  6091. BEGIN
  6092. SYSTEM.GET( radr, rval );
  6093. WHILE (len > 0) DO
  6094. SYSTEM.GET( ladr, lval );
  6095. IF lval <= rval THEN RETURN FALSE END;
  6096. INC( ladr, linc ); DEC( len );
  6097. END;
  6098. RETURN TRUE;
  6099. END GtrAZSZLoop;
  6100. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6101. BEGIN
  6102. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAZSZLoop );
  6103. END ">";
  6104. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6105. BEGIN
  6106. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAZSZLoop );
  6107. END "<";
  6108. (** REAL *)
  6109. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6110. VAR lval, rval: REAL;
  6111. BEGIN
  6112. SYSTEM.GET( radr, rval );
  6113. WHILE (len > 0) DO
  6114. SYSTEM.GET( ladr, lval );
  6115. IF lval <= rval THEN RETURN FALSE END;
  6116. INC( ladr, linc ); DEC( len );
  6117. END;
  6118. RETURN TRUE;
  6119. END GtrARSRLoop;
  6120. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6121. right: REAL ): BOOLEAN;
  6122. BEGIN
  6123. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrARSRLoop );
  6124. END ">";
  6125. OPERATOR "<"*( left: REAL;
  6126. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6127. BEGIN
  6128. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrARSRLoop );
  6129. END "<";
  6130. (** LONGREAL *)
  6131. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6132. VAR lval, rval: LONGREAL;
  6133. BEGIN
  6134. SYSTEM.GET( radr, rval );
  6135. WHILE (len > 0) DO
  6136. SYSTEM.GET( ladr, lval );
  6137. IF lval <= rval THEN RETURN FALSE END;
  6138. INC( ladr, linc ); DEC( len );
  6139. END;
  6140. RETURN TRUE;
  6141. END GtrAXSXLoop;
  6142. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6143. right: LONGREAL ): BOOLEAN;
  6144. BEGIN
  6145. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAXSXLoop );
  6146. END ">";
  6147. OPERATOR "<"*( left: LONGREAL;
  6148. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6149. BEGIN
  6150. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAXSXLoop );
  6151. END "<";
  6152. (*** geq : array x scalar -> boolean ********************************************************************)
  6153. (** SHORTINT *)
  6154. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6155. VAR lval, rval: SHORTINT;
  6156. BEGIN
  6157. SYSTEM.GET( radr, rval );
  6158. WHILE (len > 0) DO
  6159. SYSTEM.GET( ladr, lval );
  6160. IF lval < rval THEN RETURN FALSE END;
  6161. INC( ladr, linc ); DEC( len );
  6162. END;
  6163. RETURN TRUE;
  6164. END GeqASSSLoop;
  6165. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6166. right: SHORTINT ): BOOLEAN;
  6167. BEGIN
  6168. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqASSSLoop );
  6169. END ">=";
  6170. OPERATOR "<="*( left: SHORTINT;
  6171. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6172. BEGIN
  6173. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqASSSLoop );
  6174. END "<=";
  6175. (** INTEGER *)
  6176. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6177. VAR lval, rval: INTEGER;
  6178. BEGIN
  6179. SYSTEM.GET( radr, rval );
  6180. WHILE (len > 0) DO
  6181. SYSTEM.GET( ladr, lval );
  6182. IF lval < rval THEN RETURN FALSE END;
  6183. INC( ladr, linc ); DEC( len );
  6184. END;
  6185. RETURN TRUE;
  6186. END GeqAISILoop;
  6187. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6188. BEGIN
  6189. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAISILoop );
  6190. END ">=";
  6191. OPERATOR "<="*( left: INTEGER;
  6192. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6193. BEGIN
  6194. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAISILoop );
  6195. END "<=";
  6196. (** LONGINT *)
  6197. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6198. VAR lval, rval: LONGINT;
  6199. BEGIN
  6200. SYSTEM.GET( radr, rval );
  6201. WHILE (len > 0) DO
  6202. SYSTEM.GET( ladr, lval );
  6203. IF lval < rval THEN RETURN FALSE END;
  6204. INC( ladr, linc ); DEC( len );
  6205. END;
  6206. RETURN TRUE;
  6207. END GeqALSLLoop;
  6208. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6209. right: LONGINT ): BOOLEAN;
  6210. BEGIN
  6211. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqALSLLoop );
  6212. END ">=";
  6213. OPERATOR "<="*( left: LONGINT;
  6214. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6215. BEGIN
  6216. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqALSLLoop );
  6217. END "<=";
  6218. (** SIZE *)
  6219. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6220. VAR lval, rval: SIZE;
  6221. BEGIN
  6222. SYSTEM.GET( radr, rval );
  6223. WHILE (len > 0) DO
  6224. SYSTEM.GET( ladr, lval );
  6225. IF lval < rval THEN RETURN FALSE END;
  6226. INC( ladr, linc ); DEC( len );
  6227. END;
  6228. RETURN TRUE;
  6229. END GeqAZSZLoop;
  6230. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6231. right: SIZE ): BOOLEAN;
  6232. BEGIN
  6233. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAZSZLoop );
  6234. END ">=";
  6235. OPERATOR "<="*( left:SIZE;
  6236. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6237. BEGIN
  6238. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAZSZLoop );
  6239. END "<=";
  6240. (** REAL *)
  6241. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6242. VAR lval, rval: REAL;
  6243. BEGIN
  6244. SYSTEM.GET( radr, rval );
  6245. WHILE (len > 0) DO
  6246. SYSTEM.GET( ladr, lval );
  6247. IF lval < rval THEN RETURN FALSE END;
  6248. INC( ladr, linc ); DEC( len );
  6249. END;
  6250. RETURN TRUE;
  6251. END GeqARSRLoop;
  6252. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6253. right: REAL ): BOOLEAN;
  6254. BEGIN
  6255. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqARSRLoop );
  6256. END ">=";
  6257. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6258. BEGIN
  6259. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqARSRLoop );
  6260. END "<=";
  6261. (** LONGREAL *)
  6262. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6263. VAR lval, rval: LONGREAL;
  6264. BEGIN
  6265. SYSTEM.GET( radr, rval );
  6266. WHILE (len > 0) DO
  6267. SYSTEM.GET( ladr, lval );
  6268. IF lval < rval THEN RETURN FALSE END;
  6269. INC( ladr, linc ); DEC( len );
  6270. END;
  6271. RETURN TRUE;
  6272. END GeqAXSXLoop;
  6273. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6274. BEGIN
  6275. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAXSXLoop );
  6276. END ">=";
  6277. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6278. BEGIN
  6279. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAXSXLoop );
  6280. END "<=";
  6281. (*** leq : array x scalar -> boolean ********************************************************************)
  6282. (** SHORTINT *)
  6283. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6284. VAR lval, rval: SHORTINT;
  6285. BEGIN
  6286. SYSTEM.GET( radr, rval );
  6287. WHILE (len > 0) DO
  6288. SYSTEM.GET( ladr, lval );
  6289. IF lval > rval THEN RETURN FALSE END;
  6290. INC( ladr, linc ); DEC( len );
  6291. END;
  6292. RETURN TRUE;
  6293. END LeqASSSLoop;
  6294. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6295. BEGIN
  6296. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqASSSLoop );
  6297. END "<=";
  6298. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6299. BEGIN
  6300. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqASSSLoop );
  6301. END ">=";
  6302. (** INTEGER *)
  6303. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6304. VAR lval, rval: INTEGER;
  6305. BEGIN
  6306. SYSTEM.GET( radr, rval );
  6307. WHILE (len > 0) DO
  6308. SYSTEM.GET( ladr, lval );
  6309. IF lval > rval THEN RETURN FALSE END;
  6310. INC( ladr, linc ); DEC( len );
  6311. END;
  6312. RETURN TRUE;
  6313. END LeqAISILoop;
  6314. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6315. BEGIN
  6316. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAISILoop );
  6317. END "<=";
  6318. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6319. BEGIN
  6320. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAISILoop );
  6321. END ">=";
  6322. (** LONGINT *)
  6323. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6324. VAR lval, rval: LONGINT;
  6325. BEGIN
  6326. SYSTEM.GET( radr, rval );
  6327. WHILE (len > 0) DO
  6328. SYSTEM.GET( ladr, lval );
  6329. IF lval > rval THEN RETURN FALSE END;
  6330. INC( ladr, linc ); DEC( len );
  6331. END;
  6332. RETURN TRUE;
  6333. END LeqALSLLoop;
  6334. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6335. BEGIN
  6336. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqALSLLoop );
  6337. END "<=";
  6338. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6339. BEGIN
  6340. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqALSLLoop );
  6341. END ">=";
  6342. (** SIZE *)
  6343. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6344. VAR lval, rval: SIZE;
  6345. BEGIN
  6346. SYSTEM.GET( radr, rval );
  6347. WHILE (len > 0) DO
  6348. SYSTEM.GET( ladr, lval );
  6349. IF lval > rval THEN RETURN FALSE END;
  6350. INC( ladr, linc ); DEC( len );
  6351. END;
  6352. RETURN TRUE;
  6353. END LeqAZSZLoop;
  6354. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6355. BEGIN
  6356. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAZSZLoop );
  6357. END "<=";
  6358. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6359. BEGIN
  6360. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAZSZLoop );
  6361. END ">=";
  6362. (** REAL *)
  6363. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6364. VAR lval, rval: REAL;
  6365. BEGIN
  6366. SYSTEM.GET( radr, rval );
  6367. WHILE (len > 0) DO
  6368. SYSTEM.GET( ladr, lval );
  6369. IF lval > rval THEN RETURN FALSE END;
  6370. INC( ladr, linc ); DEC( len );
  6371. END;
  6372. RETURN TRUE;
  6373. END LeqARSRLoop;
  6374. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6375. BEGIN
  6376. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqARSRLoop );
  6377. END "<=";
  6378. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6379. BEGIN
  6380. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqARSRLoop );
  6381. END ">=";
  6382. (** LONGREAL *)
  6383. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6384. VAR lval, rval: LONGREAL;
  6385. BEGIN
  6386. SYSTEM.GET( radr, rval );
  6387. WHILE (len > 0) DO
  6388. SYSTEM.GET( ladr, lval );
  6389. IF lval > rval THEN RETURN FALSE END;
  6390. INC( ladr, linc ); DEC( len );
  6391. END;
  6392. RETURN TRUE;
  6393. END LeqAXSXLoop;
  6394. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6395. BEGIN
  6396. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAXSXLoop );
  6397. END "<=";
  6398. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6399. BEGIN
  6400. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAXSXLoop );
  6401. END ">=";
  6402. (*** lss: array x scalar -> boolean ********************************************************************)
  6403. (** SHORTINT *)
  6404. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6405. VAR lval, rval: SHORTINT;
  6406. BEGIN
  6407. SYSTEM.GET( radr, rval );
  6408. WHILE (len > 0) DO
  6409. SYSTEM.GET( ladr, lval );
  6410. IF lval >= rval THEN RETURN FALSE END;
  6411. INC( ladr, linc ); DEC( len );
  6412. END;
  6413. RETURN TRUE;
  6414. END LssASSSLoop;
  6415. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6416. BEGIN
  6417. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssASSSLoop );
  6418. END "<";
  6419. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6420. BEGIN
  6421. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssASSSLoop );
  6422. END ">";
  6423. (** INTEGER *)
  6424. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6425. VAR lval, rval: INTEGER;
  6426. BEGIN
  6427. SYSTEM.GET( radr, rval );
  6428. WHILE (len > 0) DO
  6429. SYSTEM.GET( ladr, lval );
  6430. IF lval >= rval THEN RETURN FALSE END;
  6431. INC( ladr, linc ); DEC( len );
  6432. END;
  6433. RETURN TRUE;
  6434. END LssAISILoop;
  6435. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6436. BEGIN
  6437. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAISILoop );
  6438. END "<";
  6439. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6440. BEGIN
  6441. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAISILoop );
  6442. END ">";
  6443. (** LONGINT *)
  6444. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6445. VAR lval, rval: LONGINT;
  6446. BEGIN
  6447. SYSTEM.GET( radr, rval );
  6448. WHILE (len > 0) DO
  6449. SYSTEM.GET( ladr, lval );
  6450. IF lval >= rval THEN RETURN FALSE END;
  6451. INC( ladr, linc ); DEC( len );
  6452. END;
  6453. RETURN TRUE;
  6454. END LssALSLLoop;
  6455. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6456. BEGIN
  6457. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssALSLLoop );
  6458. END "<";
  6459. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6460. BEGIN
  6461. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssALSLLoop );
  6462. END ">";
  6463. (** SIZE *)
  6464. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6465. VAR lval, rval: SIZE;
  6466. BEGIN
  6467. SYSTEM.GET( radr, rval );
  6468. WHILE (len > 0) DO
  6469. SYSTEM.GET( ladr, lval );
  6470. IF lval >= rval THEN RETURN FALSE END;
  6471. INC( ladr, linc ); DEC( len );
  6472. END;
  6473. RETURN TRUE;
  6474. END LssAZSZLoop;
  6475. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6476. BEGIN
  6477. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAZSZLoop );
  6478. END "<";
  6479. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6480. BEGIN
  6481. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAZSZLoop );
  6482. END ">";
  6483. (** REAL *)
  6484. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6485. VAR lval, rval: REAL;
  6486. BEGIN
  6487. SYSTEM.GET( radr, rval );
  6488. WHILE (len > 0) DO
  6489. SYSTEM.GET( ladr, lval );
  6490. IF lval >= rval THEN RETURN FALSE END;
  6491. INC( ladr, linc ); DEC( len );
  6492. END;
  6493. RETURN TRUE;
  6494. END LssARSRLoop;
  6495. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6496. right: REAL ): BOOLEAN;
  6497. BEGIN
  6498. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssARSRLoop );
  6499. END "<";
  6500. OPERATOR ">"*( left: REAL;
  6501. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6502. BEGIN
  6503. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssARSRLoop );
  6504. END ">";
  6505. (** LONGREAL *)
  6506. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6507. VAR lval, rval: LONGREAL;
  6508. BEGIN
  6509. SYSTEM.GET( radr, rval );
  6510. WHILE (len > 0) DO
  6511. SYSTEM.GET( ladr, lval );
  6512. IF lval >= rval THEN RETURN FALSE END;
  6513. INC( ladr, linc ); DEC( len );
  6514. END;
  6515. RETURN TRUE;
  6516. END LssAXSXLoop;
  6517. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6518. right: LONGREAL ): BOOLEAN;
  6519. BEGIN
  6520. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAXSXLoop );
  6521. END "<";
  6522. OPERATOR ">"*( left: LONGREAL;
  6523. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6524. BEGIN
  6525. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAXSXLoop );
  6526. END ">";
  6527. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6528. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6529. VAR lval, val: LONGREAL;
  6530. BEGIN
  6531. SYSTEM.GET( radr, val );
  6532. WHILE (len > 0) DO
  6533. SYSTEM.GET( ladr, lval );
  6534. INC( ladr, linc ); DEC( len );
  6535. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6536. INC(dadr,dinc);
  6537. END;
  6538. END MaxAXSXLoop;
  6539. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6540. TYPE Type = LONGREAL;
  6541. BEGIN
  6542. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6543. RETURN RESULT
  6544. END "MAX";
  6545. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6546. VAR lval, val: REAL;
  6547. BEGIN
  6548. SYSTEM.GET( radr, val );
  6549. WHILE (len > 0) DO
  6550. SYSTEM.GET( ladr, lval );
  6551. INC( ladr, linc ); DEC( len );
  6552. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6553. INC(dadr,dinc);
  6554. END;
  6555. END MaxARSRLoop;
  6556. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6557. TYPE Type = REAL;
  6558. BEGIN
  6559. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6560. RETURN RESULT
  6561. END "MAX";
  6562. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6563. VAR lval, val: LONGINT;
  6564. BEGIN
  6565. SYSTEM.GET( radr, val );
  6566. WHILE (len > 0) DO
  6567. SYSTEM.GET( ladr, lval );
  6568. INC( ladr, linc ); DEC( len );
  6569. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6570. INC(dadr,dinc);
  6571. END;
  6572. END MaxALSLLoop;
  6573. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6574. TYPE Type = LONGINT;
  6575. BEGIN
  6576. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6577. RETURN RESULT
  6578. END "MAX";
  6579. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6580. VAR lval, val: INTEGER;
  6581. BEGIN
  6582. SYSTEM.GET( radr, val );
  6583. WHILE (len > 0) DO
  6584. SYSTEM.GET( ladr, lval );
  6585. INC( ladr, linc ); DEC( len );
  6586. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6587. INC(dadr,dinc);
  6588. END;
  6589. END MaxAISILoop;
  6590. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6591. TYPE Type = INTEGER;
  6592. BEGIN
  6593. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6594. RETURN RESULT
  6595. END "MAX";
  6596. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6597. VAR lval, val: SHORTINT;
  6598. BEGIN
  6599. SYSTEM.GET( radr, val );
  6600. WHILE (len > 0) DO
  6601. SYSTEM.GET( ladr, lval );
  6602. INC( ladr, linc ); DEC( len );
  6603. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6604. INC(dadr,dinc);
  6605. END;
  6606. END MaxASSSLoop;
  6607. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6608. TYPE Type = SHORTINT;
  6609. BEGIN
  6610. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6611. RETURN RESULT
  6612. END "MAX";
  6613. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6614. VAR lval, val: LONGREAL;
  6615. BEGIN
  6616. SYSTEM.GET( radr, val );
  6617. WHILE (len > 0) DO
  6618. SYSTEM.GET( ladr, lval );
  6619. INC( ladr, linc ); DEC( len );
  6620. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6621. INC(dadr,dinc);
  6622. END;
  6623. END MinAXSXLoop;
  6624. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6625. TYPE Type = LONGREAL;
  6626. BEGIN
  6627. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6628. RETURN RESULT
  6629. END "MIN";
  6630. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6631. VAR lval, val: REAL;
  6632. BEGIN
  6633. SYSTEM.GET( radr, val );
  6634. WHILE (len > 0) DO
  6635. SYSTEM.GET( ladr, lval );
  6636. INC( ladr, linc ); DEC( len );
  6637. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6638. INC(dadr,dinc);
  6639. END;
  6640. END MinARSRLoop;
  6641. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6642. TYPE Type = REAL;
  6643. BEGIN
  6644. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6645. RETURN RESULT
  6646. END "MIN";
  6647. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6648. VAR lval, val: LONGINT;
  6649. BEGIN
  6650. SYSTEM.GET( radr, val );
  6651. WHILE (len > 0) DO
  6652. SYSTEM.GET( ladr, lval );
  6653. INC( ladr, linc ); DEC( len );
  6654. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6655. INC(dadr,dinc);
  6656. END;
  6657. END MinALSLLoop;
  6658. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6659. TYPE Type = LONGINT;
  6660. BEGIN
  6661. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6662. RETURN RESULT
  6663. END "MIN";
  6664. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6665. VAR lval, val: INTEGER;
  6666. BEGIN
  6667. SYSTEM.GET( radr, val );
  6668. WHILE (len > 0) DO
  6669. SYSTEM.GET( ladr, lval );
  6670. INC( ladr, linc ); DEC( len );
  6671. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6672. INC(dadr,dinc);
  6673. END;
  6674. END MinAISILoop;
  6675. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6676. TYPE Type = INTEGER;
  6677. BEGIN
  6678. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6679. RETURN RESULT
  6680. END "MIN";
  6681. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6682. VAR lval, val: SHORTINT;
  6683. BEGIN
  6684. SYSTEM.GET( radr, val );
  6685. WHILE (len > 0) DO
  6686. SYSTEM.GET( ladr, lval );
  6687. INC( ladr, linc ); DEC( len );
  6688. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6689. INC(dadr,dinc);
  6690. END;
  6691. END MinASSSLoop;
  6692. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6693. TYPE Type = SHORTINT;
  6694. BEGIN
  6695. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6696. RETURN RESULT
  6697. END "MIN";
  6698. (**** binary max/min operators array x array -> array ********************************************************************)
  6699. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6700. VAR lval, rval: LONGREAL;
  6701. BEGIN
  6702. WHILE (len > 0) DO
  6703. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6704. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6705. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6706. INC(dadr,dinc);
  6707. END;
  6708. END MaxAXAXLoop;
  6709. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6710. BEGIN
  6711. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MaxAXAXLoop );
  6712. RETURN RESULT
  6713. END "MAX";
  6714. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6715. VAR lval, rval: REAL ;
  6716. BEGIN
  6717. WHILE (len > 0) DO
  6718. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6719. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6720. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6721. INC(dadr,dinc);
  6722. END;
  6723. END MaxARARLoop;
  6724. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6725. BEGIN
  6726. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MaxARARLoop );
  6727. RETURN RESULT
  6728. END "MAX";
  6729. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6730. VAR lval, rval: LONGINT;
  6731. BEGIN
  6732. WHILE (len > 0) DO
  6733. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6734. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6735. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6736. INC(dadr,dinc);
  6737. END;
  6738. END MaxALALLoop;
  6739. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6740. BEGIN
  6741. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MaxALALLoop );
  6742. RETURN RESULT
  6743. END "MAX";
  6744. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6745. VAR lval, rval: INTEGER;
  6746. BEGIN
  6747. WHILE (len > 0) DO
  6748. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6749. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6750. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6751. INC(dadr,dinc);
  6752. END;
  6753. END MaxAIAILoop;
  6754. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6755. BEGIN
  6756. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MaxAIAILoop );
  6757. RETURN RESULT
  6758. END "MAX";
  6759. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6760. VAR lval, rval: SHORTINT;
  6761. BEGIN
  6762. WHILE (len > 0) DO
  6763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6764. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6765. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6766. INC(dadr,dinc);
  6767. END;
  6768. END MaxASASLoop;
  6769. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6770. BEGIN
  6771. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MaxASASLoop );
  6772. RETURN RESULT
  6773. END "MAX";
  6774. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6775. VAR lval, rval: LONGREAL;
  6776. BEGIN
  6777. WHILE (len > 0) DO
  6778. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6779. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6780. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6781. INC(dadr,dinc);
  6782. END;
  6783. END MinAXAXLoop;
  6784. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6785. BEGIN
  6786. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MinAXAXLoop );
  6787. RETURN RESULT
  6788. END "MIN";
  6789. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6790. VAR lval, rval: REAL ;
  6791. BEGIN
  6792. WHILE (len > 0) DO
  6793. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6794. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6795. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6796. INC(dadr,dinc);
  6797. END;
  6798. END MinARARLoop;
  6799. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6800. BEGIN
  6801. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MinARARLoop );
  6802. RETURN RESULT
  6803. END "MIN";
  6804. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6805. VAR lval, rval: LONGINT;
  6806. BEGIN
  6807. WHILE (len > 0) DO
  6808. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6809. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6810. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6811. INC(dadr,dinc);
  6812. END;
  6813. END MinALALLoop;
  6814. *)
  6815. TYPE
  6816. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6817. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6818. BEGIN
  6819. WHILE (len > 0) DO
  6820. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6821. ladr := ladr + linc;
  6822. radr := radr + rinc;
  6823. dadr := dadr + dinc;
  6824. DEC(len);
  6825. END;
  6826. END MinALALLoop;
  6827. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6828. BEGIN
  6829. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MinALALLoop );
  6830. RETURN RESULT
  6831. END "MIN";
  6832. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6833. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6834. BEGIN
  6835. WHILE (len > 0) DO
  6836. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6837. ladr := ladr + linc;
  6838. radr := radr + rinc;
  6839. dadr := dadr + dinc;
  6840. DEC(len);
  6841. END;
  6842. END MinAYAYLoop;
  6843. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE ;
  6844. BEGIN
  6845. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SIZE ), MinAYAYLoop );
  6846. RETURN RESULT
  6847. END "MIN";
  6848. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6849. VAR lval, rval: INTEGER;
  6850. BEGIN
  6851. WHILE (len > 0) DO
  6852. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6853. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6854. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6855. INC(dadr,dinc);
  6856. END;
  6857. END MinAIAILoop;
  6858. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6859. BEGIN
  6860. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MinAIAILoop );
  6861. RETURN RESULT
  6862. END "MIN";
  6863. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6864. VAR lval, rval: SHORTINT;
  6865. BEGIN
  6866. WHILE (len > 0) DO
  6867. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6868. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6869. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6870. INC(dadr,dinc);
  6871. END;
  6872. END MinASASLoop;
  6873. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6874. BEGIN
  6875. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MinASASLoop );
  6876. RETURN RESULT
  6877. END "MIN";
  6878. (**** unary operators array -> scalar ********************************************************************)
  6879. (*** min: array -> scalar ****************************************)
  6880. (** SHORTINT *)
  6881. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6882. VAR lval, dval: SHORTINT;
  6883. BEGIN
  6884. SYSTEM.GET( dadr, dval );
  6885. WHILE (len > 0) DO
  6886. SYSTEM.GET( ladr, lval );
  6887. IF lval < dval THEN dval := lval END;
  6888. INC( ladr, linc ); DEC( len );
  6889. END;
  6890. SYSTEM.PUT( dadr, dval );
  6891. END MinASLoop;
  6892. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6893. TYPE Type = SHORTINT;
  6894. VAR val: Type;
  6895. BEGIN
  6896. val := MAX( Type );
  6897. ApplyUnaryASOp( ADDRESSOF( val ), left , MinASLoop ); RETURN val;
  6898. END "MIN";
  6899. (** INTEGER *)
  6900. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6901. VAR lval, dval: INTEGER;
  6902. BEGIN
  6903. SYSTEM.GET( dadr, dval );
  6904. WHILE (len > 0) DO
  6905. SYSTEM.GET( ladr, lval );
  6906. IF lval < dval THEN dval := lval END;
  6907. INC( ladr, linc ); DEC( len );
  6908. END;
  6909. SYSTEM.PUT( dadr, dval );
  6910. END MinAILoop;
  6911. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6912. TYPE Type = INTEGER;
  6913. VAR val: Type;
  6914. BEGIN
  6915. val := MAX( Type );
  6916. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAILoop ); RETURN val;
  6917. END "MIN";
  6918. (** LONGINT *)
  6919. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6920. VAR lval, dval: LONGINT;
  6921. BEGIN
  6922. SYSTEM.GET( dadr, dval );
  6923. WHILE (len > 0) DO
  6924. SYSTEM.GET( ladr, lval );
  6925. IF lval < dval THEN dval := lval END;
  6926. INC( ladr, linc ); DEC( len );
  6927. END;
  6928. SYSTEM.PUT( dadr, dval );
  6929. END MinALLoop;
  6930. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6931. TYPE Type = LONGINT;
  6932. VAR val: Type;
  6933. BEGIN
  6934. val := MAX( Type );
  6935. ApplyUnaryASOp( ADDRESSOF( val ), left , MinALLoop ); RETURN val;
  6936. END "MIN";
  6937. (** SIZE *)
  6938. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6939. VAR lval, dval: SIZE;
  6940. BEGIN
  6941. SYSTEM.GET( dadr, dval );
  6942. WHILE (len > 0) DO
  6943. SYSTEM.GET( ladr, lval );
  6944. IF lval < dval THEN dval := lval END;
  6945. INC( ladr, linc ); DEC( len );
  6946. END;
  6947. SYSTEM.PUT( dadr, dval );
  6948. END MinAZLoop;
  6949. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6950. TYPE Type = SIZE;
  6951. VAR val: Type;
  6952. BEGIN
  6953. val := MAX( Type );
  6954. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAZLoop ); RETURN val;
  6955. END "MIN";
  6956. (** REAL *)
  6957. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6958. VAR lval, dval: REAL;
  6959. BEGIN
  6960. SYSTEM.GET( dadr, dval );
  6961. WHILE (len > 0) DO
  6962. SYSTEM.GET( ladr, lval );
  6963. IF lval < dval THEN dval := lval END;
  6964. INC( ladr, linc ); DEC( len );
  6965. END;
  6966. SYSTEM.PUT( dadr, dval );
  6967. END MinARLoop;
  6968. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6969. TYPE Type = REAL;
  6970. VAR val: Type;
  6971. BEGIN
  6972. val := MAX( Type );
  6973. ApplyUnaryASOp( ADDRESSOF( val ), left, MinARLoop ); RETURN val;
  6974. END "MIN";
  6975. (** LONGREAL *)
  6976. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6977. VAR lval, dval: LONGREAL;
  6978. BEGIN
  6979. SYSTEM.GET( dadr, dval );
  6980. WHILE (len > 0) DO
  6981. SYSTEM.GET( ladr, lval );
  6982. IF lval < dval THEN dval := lval END;
  6983. INC( ladr, linc ); DEC( len );
  6984. END;
  6985. SYSTEM.PUT( dadr, dval );
  6986. END MinAXLoop;
  6987. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6988. TYPE Type = LONGREAL;
  6989. VAR val: Type;
  6990. BEGIN
  6991. val := MAX( Type );
  6992. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAXLoop ); RETURN val;
  6993. END "MIN";
  6994. (*** max: array -> scalar ********************************************************************)
  6995. (** SHORTINT *)
  6996. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6997. VAR lval, dval: SHORTINT;
  6998. BEGIN
  6999. SYSTEM.GET( dadr, dval );
  7000. WHILE (len > 0) DO
  7001. SYSTEM.GET( ladr, lval );
  7002. IF lval > dval THEN dval := lval END;
  7003. INC( ladr, linc ); DEC( len );
  7004. END;
  7005. SYSTEM.PUT( dadr, dval );
  7006. END MaxASLoop;
  7007. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7008. TYPE Type = SHORTINT;
  7009. VAR val: Type;
  7010. BEGIN
  7011. val := MIN( Type );
  7012. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxASLoop ); RETURN val;
  7013. END "MAX";
  7014. (** INTEGER *)
  7015. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7016. VAR lval, dval: INTEGER;
  7017. BEGIN
  7018. SYSTEM.GET( dadr, dval );
  7019. WHILE (len > 0) DO
  7020. SYSTEM.GET( ladr, lval );
  7021. IF lval > dval THEN dval := lval END;
  7022. INC( ladr, linc ); DEC( len );
  7023. END;
  7024. SYSTEM.PUT( dadr, dval );
  7025. END MaxAILoop;
  7026. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7027. TYPE Type = INTEGER;
  7028. VAR val: Type;
  7029. BEGIN
  7030. val := MIN( Type );
  7031. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAILoop ); RETURN val;
  7032. END "MAX";
  7033. (** LONGINT *)
  7034. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7035. VAR lval, dval: LONGINT;
  7036. BEGIN
  7037. SYSTEM.GET( dadr, dval );
  7038. WHILE (len > 0) DO
  7039. SYSTEM.GET( ladr, lval );
  7040. IF lval > dval THEN dval := lval END;
  7041. INC( ladr, linc ); DEC( len );
  7042. END;
  7043. SYSTEM.PUT( dadr, dval );
  7044. END MaxALLoop;
  7045. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7046. TYPE Type = LONGINT;
  7047. VAR val: Type;
  7048. BEGIN
  7049. val := MIN( Type );
  7050. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxALLoop ); RETURN val;
  7051. END "MAX";
  7052. (** REAL *)
  7053. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7054. VAR lval, dval: REAL;
  7055. BEGIN
  7056. SYSTEM.GET( dadr, dval );
  7057. WHILE (len > 0) DO
  7058. SYSTEM.GET( ladr, lval );
  7059. IF lval > dval THEN dval := lval END;
  7060. INC( ladr, linc ); DEC( len );
  7061. END;
  7062. SYSTEM.PUT( dadr, dval );
  7063. END MaxARLoop;
  7064. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7065. TYPE Type = REAL;
  7066. VAR val: Type;
  7067. BEGIN
  7068. val := MIN( Type );
  7069. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxARLoop ); RETURN val;
  7070. END "MAX";
  7071. (** LONGREAL *)
  7072. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7073. VAR lval, dval: LONGREAL;
  7074. BEGIN
  7075. SYSTEM.GET( dadr, dval );
  7076. WHILE (len > 0) DO
  7077. SYSTEM.GET( ladr, lval );
  7078. IF lval > dval THEN dval := lval END;
  7079. INC( ladr, linc ); DEC( len );
  7080. END;
  7081. SYSTEM.PUT( dadr, dval );
  7082. END MaxAXLoop;
  7083. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7084. TYPE Type = LONGREAL;
  7085. VAR val: Type;
  7086. BEGIN
  7087. val := MIN( Type );
  7088. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAXLoop ); RETURN val;
  7089. END "MAX";
  7090. (*** LEN: array -> array **)
  7091. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  7092. VAR dim,i: SIZE;
  7093. BEGIN
  7094. dim := GetDim( left );
  7095. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7096. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(left,i)) END;
  7097. RETURN RESULT
  7098. END "LEN";
  7099. (*** SUM: array -> scalar ********************************************************************)
  7100. (** SHORTINT *)
  7101. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7102. VAR lval, dval: SHORTINT;
  7103. BEGIN
  7104. SYSTEM.GET( dadr, dval );
  7105. WHILE (len > 0) DO
  7106. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7107. END;
  7108. SYSTEM.PUT( dadr, dval );
  7109. END SumASLoop;
  7110. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7111. TYPE Type = SHORTINT;
  7112. VAR val: Type;
  7113. BEGIN
  7114. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumASLoop );
  7115. RETURN val;
  7116. END "SUM";
  7117. (** INTEGER *)
  7118. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7119. VAR lval, dval: INTEGER;
  7120. BEGIN
  7121. SYSTEM.GET( dadr, dval );
  7122. WHILE (len > 0) DO
  7123. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7124. END;
  7125. SYSTEM.PUT( dadr, dval );
  7126. END SumAILoop;
  7127. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7128. TYPE Type = INTEGER;
  7129. VAR val: Type;
  7130. BEGIN
  7131. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAILoop );
  7132. RETURN val;
  7133. END "SUM";
  7134. (** LONGINT *)
  7135. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7136. VAR lval, dval: LONGINT;
  7137. BEGIN
  7138. SYSTEM.GET( dadr, dval );
  7139. WHILE (len > 0) DO
  7140. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7141. END;
  7142. SYSTEM.PUT( dadr, dval );
  7143. END SumALLoop;
  7144. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7145. TYPE Type = LONGINT;
  7146. VAR val: Type;
  7147. BEGIN
  7148. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumALLoop );
  7149. RETURN val;
  7150. END "SUM";
  7151. (** SIZE *)
  7152. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7153. VAR lval, dval: SIZE;
  7154. BEGIN
  7155. SYSTEM.GET( dadr, dval );
  7156. WHILE (len > 0) DO
  7157. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7158. END;
  7159. SYSTEM.PUT( dadr, dval );
  7160. END SumAYLoop;
  7161. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7162. TYPE Type = SIZE;
  7163. VAR val: Type;
  7164. BEGIN
  7165. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAYLoop );
  7166. RETURN val;
  7167. END "SUM";
  7168. (** REAL *)
  7169. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7170. VAR lval, dval: REAL;
  7171. BEGIN
  7172. SYSTEM.GET( dadr, dval );
  7173. WHILE (len > 0) DO
  7174. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7175. END;
  7176. SYSTEM.PUT( dadr, dval );
  7177. END SumARLoop;
  7178. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7179. TYPE Type = REAL;
  7180. VAR val: Type;
  7181. BEGIN
  7182. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumARLoop );
  7183. RETURN val;
  7184. END "SUM";
  7185. (** LONGREAL *)
  7186. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7187. VAR lval, dval: LONGREAL;
  7188. BEGIN
  7189. SYSTEM.GET( dadr, dval );
  7190. WHILE (len > 0) DO
  7191. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7192. END;
  7193. SYSTEM.PUT( dadr, dval );
  7194. END SumAXLoop;
  7195. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7196. TYPE Type = LONGREAL;
  7197. VAR val: Type;
  7198. BEGIN
  7199. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAXLoop );
  7200. RETURN val;
  7201. END "SUM";
  7202. (** COMPLEX *)
  7203. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7204. VAR lval, dval: COMPLEX;
  7205. BEGIN
  7206. SYSTEM.GET( dadr, dval );
  7207. WHILE (len > 0) DO
  7208. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7209. END;
  7210. SYSTEM.PUT( dadr, dval );
  7211. END SumAZLoop;
  7212. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7213. TYPE Type = COMPLEX;
  7214. VAR val: Type;
  7215. BEGIN
  7216. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAZLoop );
  7217. RETURN val;
  7218. END "SUM";
  7219. (** LONGCOMPLEX *)
  7220. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7221. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7222. BEGIN
  7223. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7224. WHILE (len > 0) DO
  7225. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7226. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7227. INC( ladr, linc ); DEC( len );
  7228. END;
  7229. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7230. END SumALZLoop;
  7231. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7232. TYPE Type = LONGCOMPLEX;
  7233. VAR val: Type;
  7234. BEGIN
  7235. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumALZLoop );
  7236. RETURN val;
  7237. END "SUM";
  7238. (*** monadic ABS array -> array ********************************************************************)
  7239. (** SHORTINT *)
  7240. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7241. VAR lval: SHORTINT;
  7242. BEGIN
  7243. WHILE (len > 0) DO
  7244. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7245. INC( dadr, dinc ); DEC( len );
  7246. END;
  7247. END AbsLoopS;
  7248. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  7249. BEGIN
  7250. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), AbsLoopS );
  7251. RETURN RESULT
  7252. END "ABS";
  7253. (** INTEGER *)
  7254. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7255. VAR lval: INTEGER;
  7256. BEGIN
  7257. WHILE (len > 0) DO
  7258. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7259. INC( dadr, dinc ); DEC( len );
  7260. END;
  7261. END AbsLoopI;
  7262. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  7263. BEGIN
  7264. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), AbsLoopI );
  7265. RETURN RESULT
  7266. END "ABS";
  7267. (** LONGINT *)
  7268. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7269. VAR lval: LONGINT;
  7270. BEGIN
  7271. WHILE (len > 0) DO
  7272. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7273. INC( dadr, dinc ); DEC( len );
  7274. END;
  7275. END AbsLoopL;
  7276. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  7277. BEGIN
  7278. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), AbsLoopL );
  7279. RETURN RESULT
  7280. END "ABS";
  7281. (** REAL *)
  7282. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7283. VAR lval: REAL;
  7284. BEGIN
  7285. WHILE (len > 0) DO
  7286. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7287. INC( dadr, dinc ); DEC( len );
  7288. END;
  7289. END AbsLoopR;
  7290. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  7291. BEGIN
  7292. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopR );
  7293. RETURN RESULT
  7294. END "ABS";
  7295. (** LONGREAL *)
  7296. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7297. VAR lval: LONGREAL;
  7298. BEGIN
  7299. WHILE (len > 0) DO
  7300. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7301. INC( dadr, dinc ); DEC( len );
  7302. END;
  7303. END AbsLoopX;
  7304. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7305. BEGIN
  7306. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopX );
  7307. RETURN RESULT
  7308. END "ABS";
  7309. (** COMPLEX *)
  7310. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7311. VAR lval: COMPLEX;
  7312. BEGIN
  7313. WHILE (len > 0) DO
  7314. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7315. INC( dadr, dinc ); DEC( len );
  7316. END;
  7317. END AbsLoopZ;
  7318. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF REAL;
  7319. BEGIN
  7320. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopZ );
  7321. RETURN RESULT
  7322. END "ABS";
  7323. (** LONGCOMPLEX *)
  7324. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7325. VAR lvalRe, lvalIm: LONGREAL;
  7326. BEGIN
  7327. WHILE (len > 0) DO
  7328. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7329. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7330. INC( ladr, linc );
  7331. INC( dadr, dinc ); DEC( len );
  7332. END;
  7333. END AbsLoopLZ;
  7334. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7335. BEGIN
  7336. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopLZ );
  7337. RETURN RESULT
  7338. END "ABS";
  7339. (*** assign number to array (initialisation) ********************************************************************)
  7340. (** BOOLEAN *)
  7341. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7342. VAR lval: BOOLEAN;
  7343. BEGIN
  7344. SYSTEM.GET( ladr, lval );
  7345. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7346. END AssignSBABLoop;
  7347. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF BOOLEAN; right: BOOLEAN);
  7348. BEGIN
  7349. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSBABLoop );
  7350. END ":=";
  7351. (** SHORTINT*)
  7352. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7353. VAR lval: SHORTINT;
  7354. BEGIN
  7355. SYSTEM.GET( ladr, lval );
  7356. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7357. END AssignSSASLoop;
  7358. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF SHORTINT; right: SHORTINT);
  7359. BEGIN
  7360. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSSASLoop );
  7361. END ":=";
  7362. (**INTEGER *)
  7363. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7364. VAR lval: INTEGER;
  7365. BEGIN
  7366. SYSTEM.GET( ladr, lval );
  7367. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7368. END AssignSIAILoop;
  7369. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF INTEGER; right: INTEGER);
  7370. BEGIN
  7371. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSIAILoop );
  7372. END ":=";
  7373. (** LONGINT *)
  7374. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7375. VAR lval: LONGINT;
  7376. BEGIN
  7377. SYSTEM.GET( ladr, lval );
  7378. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7379. END AssignSLALLoop;
  7380. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGINT; right: LONGINT);
  7381. BEGIN
  7382. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSLALLoop );
  7383. END ":=";
  7384. (** HUGEINT *)
  7385. PROCEDURE AssignSHAHLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7386. VAR dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: HUGEINT END; lval: HUGEINT;
  7387. BEGIN
  7388. dval := dadr;
  7389. SYSTEM.GET( ladr, lval );
  7390. WHILE (len > 0) DO
  7391. dval.val := lval;
  7392. dval := dval + dinc;
  7393. DEC( len );
  7394. END;
  7395. END AssignSHAHLoop;
  7396. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF HUGEINT; right: HUGEINT);
  7397. BEGIN
  7398. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSHAHLoop );
  7399. END ":=";
  7400. (** REAL *)
  7401. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7402. VAR lval: REAL;
  7403. BEGIN
  7404. SYSTEM.GET( ladr, lval );
  7405. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7406. END AssignSRARLoop;
  7407. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF REAL; right: REAL);
  7408. BEGIN
  7409. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSRARLoop );
  7410. END ":=";
  7411. (** LONGREAL *)
  7412. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7413. VAR lval: LONGREAL;
  7414. BEGIN
  7415. SYSTEM.GET( ladr, lval );
  7416. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7417. END AssignSXAXLoop;
  7418. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGREAL; right: LONGREAL);
  7419. BEGIN
  7420. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSXAXLoop );
  7421. END ":=";
  7422. (** COMPLEX *)
  7423. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7424. VAR lval: COMPLEX;
  7425. BEGIN
  7426. SYSTEM.GET( ladr, lval );
  7427. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7428. END AssignSZAZLoop;
  7429. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF COMPLEX; right: COMPLEX);
  7430. BEGIN
  7431. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSZAZLoop );
  7432. END ":=";
  7433. (** LONGCOMPLEX *)
  7434. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7435. VAR lvalRe, lvalIm: LONGREAL;
  7436. BEGIN
  7437. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7438. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7439. END AssignSLZALZLoop;
  7440. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7441. BEGIN
  7442. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSLZALZLoop );
  7443. END ":=";
  7444. (*** matrix multipliation ********************************************************************)
  7445. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7446. rows, cols, elementsize: SIZE ): ANY;
  7447. VAR p: ANY;
  7448. BEGIN
  7449. (*
  7450. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7451. *)
  7452. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7453. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7454. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7455. PutPtr( dest, p); RETURN p;
  7456. END AllocateMatrix;
  7457. PROCEDURE AllocateVector(CONST dest: UnsafeArrayT; l0, elementsize: SIZE );
  7458. VAR p: ANY;
  7459. BEGIN
  7460. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7461. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7462. PutPtr( dest, p );
  7463. END AllocateVector;
  7464. PROCEDURE ApplyMatMulLoop*( dest, left, right: ADDRESS; Size: SIZE;
  7465. loop: BinaryAASLoop;
  7466. fast: FastMatMul ); (* Size= element-size *)
  7467. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7468. p: ANY; overlap: BOOLEAN; destOld: UnsafeArray; destNew: UnsafeArrayT;
  7469. BEGIN
  7470. (*
  7471. <- 1 ->
  7472. xxx xxxx -> xxxx
  7473. ^ xxx xxxx xxxx
  7474. 0 xxx xxxx xxxx
  7475. v xxx xxxx
  7476. xxx xxxx
  7477. Len(..,1): #columns ; Inc(..,1): inc in rows
  7478. Len(..,0): #rows ; Inc(..,0): inc between rows
  7479. *)
  7480. (* apply multiplication D = L * R *)
  7481. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7482. colsL := GetLen( left, 1 ); (* # left columns *)
  7483. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7484. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7485. (* check geometric restriction *)
  7486. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7487. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7488. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7489. IF RangeFlag IN GetFlags( dest ) THEN
  7490. Halt( GeometryMismatch, left, right, dest )
  7491. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7492. END;
  7493. END;
  7494. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7495. IF overlap THEN
  7496. destOld := dest; destNew := NIL;
  7497. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7498. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7499. dest := destNew;
  7500. END;
  7501. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7502. HALT( 9999 )
  7503. END;
  7504. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7505. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7506. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7507. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7508. (*
  7509. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7510. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7511. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7512. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7513. *)
  7514. IF rowsL = 0 THEN RETURN
  7515. ELSIF colsL=0 THEN RETURN
  7516. ELSIF colsR=0 THEN RETURN
  7517. ELSIF (fast = NIL ) OR
  7518. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7519. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7520. radri := radr; dadri := dadr; colsRi := colsR;
  7521. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7522. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7523. INC( dadri, incD ); DEC( colsRi );
  7524. END;
  7525. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7526. END;
  7527. END;
  7528. IF overlap THEN CopyContent( destOld, dest, Size );
  7529. END;
  7530. END ApplyMatMulLoop;
  7531. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7532. Size: SIZE; loop: BinaryAASLoop;
  7533. fast: FastMatMul ); (* Size= element-size *)
  7534. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE;
  7535. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7536. BEGIN
  7537. (*
  7538. <- 0 ->
  7539. xxx T(xxx) -> T(xxxxx)
  7540. xxx
  7541. 1 xxx
  7542. xxx
  7543. xxx
  7544. Len(..,0): #columns ; Inc(..,0): inc in rows
  7545. Len(..,1): #rows ; Inc(..,1): inc between rows
  7546. *)
  7547. (* check geometric restriction *)
  7548. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7549. Halt( GeometryMismatch, left, right,0 );
  7550. END;
  7551. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7552. l2 := GetLen( left, 1 ); (* inner loop len *)
  7553. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l1, Size );
  7554. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7555. IF RangeFlag IN GetFlags( dest ) THEN
  7556. Halt( GeometryMismatch, left, right, dest );
  7557. ELSE AllocateVector( dest, l1, Size );
  7558. END;
  7559. END;
  7560. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7561. IF overlap THEN
  7562. destOld := dest; destNew := NIL;
  7563. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7564. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7565. dest := destNew;
  7566. END;
  7567. (*
  7568. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7569. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7570. END;
  7571. *)
  7572. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7573. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7574. di0 := GetIncr( dest, 0 );
  7575. IF l1=0 THEN RETURN
  7576. ELSIF l2=0 THEN RETURN
  7577. ELSIF (fast = NIL ) OR
  7578. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7579. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7580. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7581. DEC( l1 );
  7582. END;
  7583. END;
  7584. IF overlap THEN CopyContent( destOld, dest, Size );
  7585. END;
  7586. END ApplyMatVecMulLoop;
  7587. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7588. Size: SIZE; loop: BinaryAASLoop;
  7589. fast: FastMatMul ); (* Size= element-size *)
  7590. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7591. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7592. BEGIN
  7593. (*
  7594. <- 0 ->
  7595. xxx xxxx -> xxxx
  7596. xxxx
  7597. 1 xxxx
  7598. Len(..,0): #columns ; Inc(..,0): inc in rows
  7599. Len(..,1): #rows ; Inc(..,1): inc between rows
  7600. *)
  7601. (* check geometric restriction *)
  7602. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7603. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7604. l2 := GetLen( right, 0 ); (* inner loop len *)
  7605. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l0, Size );
  7606. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7607. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7608. ELSE AllocateVector( dest, l0, Size );
  7609. END;
  7610. END;
  7611. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7612. IF overlap THEN
  7613. destOld := dest; destNew := NIL;
  7614. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7615. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7616. dest := destNew;
  7617. END;
  7618. (*
  7619. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7620. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7621. END;
  7622. *)
  7623. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7624. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7625. di0 := GetIncr( dest, 0 );
  7626. IF l2=0 THEN RETURN
  7627. ELSIF l0=0 THEN RETURN
  7628. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7629. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7630. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7631. DEC( l0 );
  7632. END;
  7633. END;
  7634. IF overlap THEN CopyContent( destOld, dest, Size );
  7635. END;
  7636. END ApplyVecMatMulLoop;
  7637. (** SHORTINT *)
  7638. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7639. VAR lval, rval, dval: SHORTINT;
  7640. BEGIN
  7641. dval := 0;
  7642. WHILE (len > 0) DO
  7643. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7644. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7645. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7646. END;
  7647. SYSTEM.PUT( dadr, dval );
  7648. END MatMulASASLoop;
  7649. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7650. BEGIN
  7651. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7652. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7653. RETURN RESULT
  7654. END "*";
  7655. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7656. BEGIN
  7657. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7658. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7659. RETURN RESULT
  7660. END "*";
  7661. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7662. BEGIN
  7663. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7664. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7665. RETURN RESULT
  7666. END "*";
  7667. (** INTEGER *)
  7668. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7669. VAR lval, rval, dval: INTEGER;
  7670. BEGIN
  7671. dval := 0;
  7672. WHILE (len > 0) DO
  7673. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7674. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7675. END;
  7676. SYSTEM.PUT( dadr, dval );
  7677. END MatMulAIAILoop;
  7678. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7679. BEGIN
  7680. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7681. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7682. RETURN RESULT
  7683. END "*";
  7684. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7685. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7686. BEGIN
  7687. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7688. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7689. RETURN RESULT
  7690. END "*";
  7691. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7692. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7693. BEGIN
  7694. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7695. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7696. RETURN RESULT
  7697. END "*";
  7698. (** LONGINT *)
  7699. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7700. VAR lval, rval, dval: LONGINT;
  7701. BEGIN
  7702. dval := 0;
  7703. WHILE (len > 0) DO
  7704. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7705. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7706. END;
  7707. SYSTEM.PUT( dadr, dval );
  7708. END MatMulALALLoop;
  7709. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7710. BEGIN
  7711. (*
  7712. KernelLog.String("MatMulALAL");
  7713. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7714. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7715. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7716. KernelLog.Ln;
  7717. *)
  7718. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7719. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7720. RETURN RESULT
  7721. END "*";
  7722. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7723. BEGIN
  7724. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7725. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7726. RETURN RESULT
  7727. END "*";
  7728. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7729. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7730. BEGIN
  7731. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7732. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7733. RETURN RESULT
  7734. END "*";
  7735. (** REAL *)
  7736. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7737. VAR lval, rval, dval: REAL;
  7738. BEGIN
  7739. dval := 0;
  7740. WHILE (len > 0) DO
  7741. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7742. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7743. END;
  7744. SYSTEM.PUT( dadr, dval );
  7745. END MatMulARARLoop;
  7746. (*
  7747. Optimized for small matrices (Alexey Morozov)
  7748. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7749. *)
  7750. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7751. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7752. BEGIN
  7753. dadr := GetAdr(ADDRESSOF(RESULT));
  7754. ladr := GetAdr(ADDRESSOF(left));
  7755. radr := GetAdr(ADDRESSOF(right));
  7756. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7757. IF (ladr # dadr) & (radr # dadr) THEN
  7758. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7759. CASE SYSTEM.VAL(LONGINT,flags) OF
  7760. Mat2x2:
  7761. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7762. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7763. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7764. END;
  7765. END;
  7766. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7767. ELSE
  7768. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7769. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7770. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7771. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7772. END;
  7773. |Mat3x3:
  7774. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7775. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7776. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7777. END;
  7778. END;
  7779. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7780. ELSE
  7781. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7782. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7783. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7784. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7785. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7786. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7787. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7788. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7789. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7790. END;
  7791. |Mat4x4:
  7792. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7793. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7794. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7795. END;
  7796. END;
  7797. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7798. ELSE
  7799. 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];
  7800. 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];
  7801. 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];
  7802. 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];
  7803. 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];
  7804. 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];
  7805. 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];
  7806. 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];
  7807. 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];
  7808. 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];
  7809. 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];
  7810. 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];
  7811. 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];
  7812. 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];
  7813. 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];
  7814. 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];
  7815. END;
  7816. ELSE
  7817. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7818. loopMatMulARAR, matMulR );
  7819. END;
  7820. ELSE
  7821. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7822. loopMatMulARAR, matMulR );
  7823. END;
  7824. RETURN RESULT
  7825. END "*";
  7826. (*
  7827. Optimized for small arrays (Alexey Morozov)
  7828. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7829. *)
  7830. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7831. VAR
  7832. flags: SET; dadr, ladr, radr: ADDRESS;
  7833. v0, v1, v2: REAL;
  7834. BEGIN
  7835. dadr := GetAdr(ADDRESSOF(RESULT));
  7836. ladr := GetAdr(ADDRESSOF(left));
  7837. radr := GetAdr(ADDRESSOF(right));
  7838. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7839. CASE SYSTEM.VAL(LONGINT,flags) OF
  7840. MatVec2x2:
  7841. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7842. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7843. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7844. END;
  7845. END;
  7846. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7847. ELSE
  7848. (* account possible overlapping *)
  7849. v0 := right[0];
  7850. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7851. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7852. END;
  7853. |MatVec3x3:
  7854. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7855. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7856. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7857. END;
  7858. END;
  7859. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7860. ELSE
  7861. (* account possible overlapping *)
  7862. v0 := right[0]; v1 := right[1];
  7863. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7864. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7865. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7866. END;
  7867. |MatVec4x4:
  7868. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7869. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7870. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7871. END;
  7872. END;
  7873. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7874. ELSE
  7875. (* account possible overlapping *)
  7876. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7877. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7878. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7879. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7880. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7881. END;
  7882. ELSE
  7883. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7884. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7885. END;
  7886. RETURN RESULT
  7887. END "*";
  7888. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7889. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7890. BEGIN
  7891. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7892. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7893. RETURN RESULT
  7894. END "*";
  7895. (** LONGREAL *)
  7896. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7897. VAR lval, rval, dval: LONGREAL;
  7898. BEGIN
  7899. dval := 0;
  7900. WHILE (len > 0) DO
  7901. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7902. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7903. END;
  7904. SYSTEM.PUT( dadr, dval );
  7905. END MatMulAXAXLoop;
  7906. (*
  7907. Optimized for small matrices (Alexey Morozov)
  7908. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7909. *)
  7910. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7911. VAR
  7912. flags: SET; dadr, ladr, radr: ADDRESS;
  7913. BEGIN
  7914. dadr := GetAdr(ADDRESSOF(RESULT));
  7915. ladr := GetAdr(ADDRESSOF(left));
  7916. radr := GetAdr(ADDRESSOF(right));
  7917. IF (ladr # dadr) & (radr # dadr) THEN
  7918. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7919. CASE SYSTEM.VAL(LONGINT,flags) OF
  7920. Mat2x2:
  7921. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7922. IF dadr = 0 THEN NEW(RESULT,2,2);
  7923. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7924. END;
  7925. END;
  7926. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7927. ELSE
  7928. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7929. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7930. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7931. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7932. END;
  7933. |Mat3x3:
  7934. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7935. IF dadr = 0 THEN NEW(RESULT,3,3);
  7936. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7937. END;
  7938. END;
  7939. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7940. ELSE
  7941. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7942. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7943. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7944. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7945. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7946. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7947. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7948. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7949. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7950. END;
  7951. |Mat4x4:
  7952. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7953. IF dadr = 0 THEN NEW(RESULT,4,4);
  7954. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7955. END;
  7956. END;
  7957. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7958. ELSE
  7959. 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];
  7960. 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];
  7961. 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];
  7962. 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];
  7963. 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];
  7964. 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];
  7965. 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];
  7966. 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];
  7967. 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];
  7968. 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];
  7969. 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];
  7970. 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];
  7971. 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];
  7972. 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];
  7973. 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];
  7974. 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];
  7975. END;
  7976. ELSE
  7977. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  7978. loopMatMulAXAX, matMulX );
  7979. END;
  7980. ELSE
  7981. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  7982. loopMatMulAXAX, matMulX );
  7983. END;
  7984. RETURN RESULT
  7985. END "*";
  7986. (*
  7987. Optimized for small arrays (Alexey Morozov)
  7988. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7989. *)
  7990. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7991. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7992. VAR
  7993. flags: SET; dadr, ladr, radr: ADDRESS;
  7994. v0, v1, v2: LONGREAL;
  7995. BEGIN
  7996. dadr := GetAdr(ADDRESSOF(RESULT));
  7997. ladr := GetAdr(ADDRESSOF(left));
  7998. radr := GetAdr(ADDRESSOF(right));
  7999. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8000. CASE SYSTEM.VAL(LONGINT,flags) OF
  8001. MatVec2x2:
  8002. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8003. IF dadr = 0 THEN NEW(RESULT,2);
  8004. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8005. END;
  8006. END;
  8007. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8008. ELSE
  8009. (* account possible overlapping *)
  8010. v0 := right[0];
  8011. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8012. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8013. END;
  8014. |MatVec3x3:
  8015. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8016. IF dadr = 0 THEN NEW(RESULT,3);
  8017. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8018. END;
  8019. END;
  8020. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8021. ELSE
  8022. (* account possible overlapping *)
  8023. v0 := right[0]; v1 := right[1];
  8024. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8025. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8026. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8027. END;
  8028. |MatVec4x4:
  8029. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8030. IF dadr = 0 THEN NEW(RESULT,4);
  8031. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8032. END;
  8033. END;
  8034. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8035. ELSE
  8036. (* account possible overlapping *)
  8037. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8038. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8039. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8040. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8041. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8042. END;
  8043. ELSE
  8044. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8045. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8046. END;
  8047. RETURN RESULT
  8048. END "*";
  8049. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8050. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8051. BEGIN
  8052. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8053. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8054. RETURN RESULT
  8055. END "*";
  8056. (** SHORTINT *)
  8057. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8058. VAR lval, rval, dval: SHORTINT;
  8059. BEGIN
  8060. SYSTEM.GET( dadr, dval );
  8061. WHILE (len > 0) DO
  8062. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8063. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8064. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8065. END;
  8066. SYSTEM.PUT( dadr, dval );
  8067. END MatMulIncASASLoop;
  8068. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8069. BEGIN
  8070. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8071. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8072. RETURN RESULT
  8073. END "INCMUL";
  8074. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8075. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8076. BEGIN
  8077. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8078. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8079. RETURN RESULT
  8080. END "INCMUL";
  8081. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8082. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8083. BEGIN
  8084. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8085. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8086. RETURN RESULT
  8087. END "INCMUL";
  8088. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8089. BEGIN
  8090. RESULT := -RESULT;
  8091. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8092. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8093. RESULT := -RESULT;
  8094. RETURN RESULT
  8095. END "DECMUL";
  8096. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8097. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8098. BEGIN
  8099. RESULT := -RESULT;
  8100. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8101. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8102. RESULT := -RESULT;
  8103. RETURN RESULT
  8104. END "DECMUL";
  8105. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8106. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8107. BEGIN
  8108. RESULT := -RESULT;
  8109. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8110. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8111. RESULT := -RESULT;
  8112. RETURN RESULT
  8113. END "DECMUL";
  8114. (** INTEGER *)
  8115. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8116. VAR lval, rval, dval: INTEGER;
  8117. BEGIN
  8118. SYSTEM.GET( dadr, dval );
  8119. WHILE (len > 0) DO
  8120. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8121. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8122. END;
  8123. SYSTEM.PUT( dadr, dval );
  8124. END MatMulIncAIAILoop;
  8125. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8126. BEGIN
  8127. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8128. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8129. RETURN RESULT
  8130. END "INCMUL";
  8131. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8132. BEGIN
  8133. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8134. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8135. RETURN RESULT
  8136. END "INCMUL";
  8137. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8138. BEGIN
  8139. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8140. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8141. RETURN RESULT
  8142. END "INCMUL";
  8143. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8144. BEGIN
  8145. RESULT := -RESULT;
  8146. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8147. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8148. RESULT := -RESULT;
  8149. RETURN RESULT
  8150. END "DECMUL";
  8151. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8152. BEGIN
  8153. RESULT := -RESULT;
  8154. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8155. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8156. RESULT := -RESULT;
  8157. RETURN RESULT
  8158. END "DECMUL";
  8159. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8160. BEGIN
  8161. RESULT := -RESULT;
  8162. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8163. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8164. RESULT := -RESULT;
  8165. RETURN RESULT
  8166. END "DECMUL";
  8167. (** LONGINT *)
  8168. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8169. VAR lval, rval, dval: LONGINT;
  8170. BEGIN
  8171. SYSTEM.GET( dadr, dval );
  8172. WHILE (len > 0) DO
  8173. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8174. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8175. END;
  8176. SYSTEM.PUT( dadr, dval );
  8177. END MatMulIncALALLoop;
  8178. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8179. BEGIN
  8180. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8181. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8182. RETURN RESULT
  8183. END "INCMUL";
  8184. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8185. BEGIN
  8186. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8187. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8188. RETURN RESULT
  8189. END "INCMUL";
  8190. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8191. BEGIN
  8192. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8193. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8194. RETURN RESULT
  8195. END "INCMUL";
  8196. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8197. BEGIN
  8198. RESULT := -RESULT;
  8199. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8200. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8201. RESULT := -RESULT;
  8202. RETURN RESULT
  8203. END "DECMUL";
  8204. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8205. BEGIN
  8206. RESULT := -RESULT;
  8207. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8208. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8209. RESULT := -RESULT;
  8210. RETURN RESULT
  8211. END "DECMUL";
  8212. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8213. BEGIN
  8214. RESULT := -RESULT;
  8215. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8216. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8217. RESULT := -RESULT;
  8218. RETURN RESULT
  8219. END "DECMUL";
  8220. (** REAL *)
  8221. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8222. VAR lval, rval, dval: REAL;
  8223. BEGIN
  8224. SYSTEM.GET( dadr, dval );
  8225. WHILE (len > 0) DO
  8226. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8227. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8228. END;
  8229. SYSTEM.PUT( dadr, dval );
  8230. END MatMulIncARARLoop;
  8231. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8232. BEGIN
  8233. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8234. loopMatMulIncARAR, matMulIncR );
  8235. RETURN RESULT
  8236. END "INCMUL";
  8237. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8238. BEGIN
  8239. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8240. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8241. RETURN RESULT
  8242. END "INCMUL";
  8243. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8244. BEGIN
  8245. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8246. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8247. RETURN RESULT
  8248. END "INCMUL";
  8249. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8250. BEGIN
  8251. RESULT := -RESULT;
  8252. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8253. loopMatMulIncARAR, matMulIncR );
  8254. RESULT := -RESULT;
  8255. RETURN RESULT
  8256. END "DECMUL";
  8257. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8258. BEGIN
  8259. RESULT := -RESULT;
  8260. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8261. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8262. RESULT := -RESULT;
  8263. RETURN RESULT
  8264. END "DECMUL";
  8265. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8266. BEGIN
  8267. RESULT := -RESULT;
  8268. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8269. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8270. RESULT := -RESULT;
  8271. RETURN RESULT
  8272. END "DECMUL";
  8273. (** LONGREAL *)
  8274. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8275. VAR lval, rval, dval: LONGREAL;
  8276. BEGIN
  8277. SYSTEM.GET( dadr, dval );
  8278. WHILE (len > 0) DO
  8279. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8280. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8281. END;
  8282. SYSTEM.PUT( dadr, dval );
  8283. END MatMulIncAXAXLoop;
  8284. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8285. BEGIN
  8286. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8287. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8288. RETURN RESULT
  8289. END "INCMUL";
  8290. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8291. BEGIN
  8292. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8293. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8294. RETURN RESULT
  8295. END "INCMUL";
  8296. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8297. BEGIN
  8298. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8299. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8300. RETURN RESULT
  8301. END "INCMUL";
  8302. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8303. BEGIN
  8304. RESULT := -RESULT;
  8305. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8306. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8307. RESULT := -RESULT;
  8308. RETURN RESULT
  8309. END "DECMUL";
  8310. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8311. BEGIN
  8312. RESULT := -RESULT;
  8313. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8314. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8315. RESULT := -RESULT;
  8316. RETURN RESULT
  8317. END "DECMUL";
  8318. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8319. BEGIN
  8320. RESULT := -RESULT;
  8321. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8322. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8323. RESULT := -RESULT;
  8324. RETURN RESULT
  8325. END "DECMUL";
  8326. (*** Cross product ********************************************************************)
  8327. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8328. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8329. BEGIN
  8330. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8331. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8332. END;
  8333. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8334. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8335. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8336. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8337. RETURN RESULT
  8338. END "*";
  8339. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8340. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8341. BEGIN
  8342. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8343. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8344. END;
  8345. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8346. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8347. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8348. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8349. RETURN RESULT
  8350. END "*";
  8351. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8352. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8353. BEGIN
  8354. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8355. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8356. END;
  8357. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8358. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8359. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8360. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8361. RETURN RESULT
  8362. END "*";
  8363. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8364. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8365. BEGIN
  8366. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8367. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8368. END;
  8369. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8370. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8371. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8372. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8373. RETURN RESULT
  8374. END "*";
  8375. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8376. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8377. BEGIN
  8378. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8379. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8380. END;
  8381. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8382. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8383. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8384. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8385. RETURN RESULT
  8386. END "*";
  8387. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  8388. VAR tensor: Tensor;
  8389. BEGIN
  8390. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8391. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8392. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8393. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8394. ELSE HALT(200);
  8395. END;
  8396. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8397. loopMatMulAXAX, matMulX );
  8398. RETURN RESULT
  8399. END "*";
  8400. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  8401. BEGIN
  8402. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8403. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8404. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8405. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8406. ELSE HALT(200);
  8407. END;
  8408. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8409. loopMatMulARAR, matMulR );
  8410. RETURN RESULT
  8411. END "*";
  8412. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  8413. BEGIN
  8414. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8415. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8416. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8417. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8418. ELSE HALT(200);
  8419. END;
  8420. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8421. MatMulALALLoop, NIL );
  8422. RETURN RESULT
  8423. END "*";
  8424. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  8425. BEGIN
  8426. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8427. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8428. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8429. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8430. ELSE HALT(200);
  8431. END;
  8432. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8433. MatMulAIAILoop,NIL );
  8434. RETURN RESULT
  8435. END "*";
  8436. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  8437. BEGIN
  8438. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8439. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8440. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8441. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8442. ELSE HALT(200);
  8443. END;
  8444. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8445. MatMulASASLoop, NIL );
  8446. RETURN RESULT
  8447. END "*";
  8448. (** Transpose ********************************************************************)
  8449. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8450. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8451. BEGIN
  8452. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8453. dim := GetDim( src1 ) - 1;
  8454. WHILE (dim > 0) DO
  8455. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8456. END;
  8457. dim := GetDim( src2 ) - 1;
  8458. WHILE (dim > 0) DO
  8459. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8460. END;
  8461. IF from1 < from2 THEN RETURN to1 >= from2;
  8462. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8463. ELSE RETURN TRUE;
  8464. END;
  8465. END Overlap;
  8466. (*
  8467. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8468. VAR from1, from2, to1, to2: ADDRESS;
  8469. BEGIN
  8470. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8471. DEC( dim );
  8472. WHILE (dim > 0) DO
  8473. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8474. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8475. END;
  8476. IF from1 < from2 THEN RETURN to1 >= from2;
  8477. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8478. ELSE RETURN TRUE;
  8479. END;
  8480. END Overlap;
  8481. *)
  8482. PROCEDURE AllocateTransposed( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  8483. VAR Size: SIZE;
  8484. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8485. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8486. VAR dim,max: SIZE;
  8487. BEGIN
  8488. dim := GetDim( l );
  8489. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8490. max := dim-1;
  8491. WHILE (dim > 0) DO
  8492. DEC( dim );
  8493. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8494. END;
  8495. RETURN TRUE;
  8496. END TransposedShape;
  8497. PROCEDURE NewData;
  8498. VAR max,dim, len, size: SIZE; data: ANY;
  8499. BEGIN
  8500. dim := GetDim( src ); size := elementsize;
  8501. PutDim( dest, dim );
  8502. PutSize( dest, elementsize );
  8503. max := dim-1;
  8504. WHILE (dim > 0) DO
  8505. DEC( dim );
  8506. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8507. PutInc( dest, dim, size ); size := size * len;
  8508. END;
  8509. SYSTEM.NEW( data, size + ArrayAlignment);
  8510. PutAdr( dest, Align(data) );
  8511. PutPtr( dest, data );
  8512. END NewData;
  8513. BEGIN
  8514. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8515. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8516. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8517. dest := GetArrayDesc( GetDim( src ) );
  8518. PutFlags(dest, {TensorFlag});
  8519. NewData();
  8520. RETURN TRUE;
  8521. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8522. (* check if re-allocation of descriptor is allowed *)
  8523. IF ~(TensorFlag IN GetFlags( dest )) &
  8524. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8525. HALT( 100 );
  8526. END;
  8527. dest := GetArrayDesc( GetDim( src ) );
  8528. PutFlags(dest, {TensorFlag});
  8529. NewData();
  8530. RETURN TRUE;
  8531. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8532. (* check if re-allocation of array data is allowed *)
  8533. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8534. HALT( 100 );
  8535. END;
  8536. NewData();
  8537. END;
  8538. RETURN FALSE;
  8539. END AllocateTransposed;
  8540. PROCEDURE Transpose*(dest: UnsafeArray (* untraced! *); CONST left: UnsafeArrayT; Size: SIZE );
  8541. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8542. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8543. BEGIN
  8544. WHILE (len > 0) DO
  8545. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8546. DEC( len );
  8547. END;
  8548. END CopyLoop;
  8549. BEGIN
  8550. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8551. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8552. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8553. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8554. ELSE
  8555. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8556. IF AllocateTransposed(dest,left,Size) THEN Halt(AllocationForbidden,dest,0,0); END;
  8557. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8558. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8559. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8560. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8561. WHILE (len0 > 0) DO
  8562. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8563. INC( dadr, dinc0 ); DEC( len0 );
  8564. END;
  8565. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8566. ladr := p;
  8567. ELSE
  8568. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8569. END;
  8570. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8571. dadr := GetAdr( dest );
  8572. IF (Size = 4) & (transpose4 # NIL ) THEN
  8573. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8574. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8575. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8576. ELSE
  8577. WHILE (len0 > 0) DO
  8578. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8579. INC( dadr, dinc1 ); DEC( len0 );
  8580. END;
  8581. END;
  8582. END;
  8583. END Transpose;
  8584. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8585. BEGIN
  8586. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8587. RETURN RESULT
  8588. END "`";
  8589. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8590. BEGIN
  8591. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8592. RETURN RESULT
  8593. END "`";
  8594. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8595. BEGIN
  8596. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8597. RETURN RESULT
  8598. END "`";
  8599. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8600. BEGIN
  8601. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8602. RETURN RESULT
  8603. END "`";
  8604. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8605. BEGIN
  8606. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8607. RETURN RESULT
  8608. END "`";
  8609. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8610. VAR i: SIZE;
  8611. BEGIN
  8612. FOR i := 0 TO rdim - 1 DO
  8613. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8614. END;
  8615. FOR i := 0 TO ldim - 1 DO
  8616. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8617. END;
  8618. RETURN TRUE;
  8619. END CheckTensorGeometry;
  8620. (*
  8621. PROCEDURE Zero(p: ANY; size: LONGINT);
  8622. VAR adr: LONGINT;
  8623. BEGIN
  8624. adr := SYSTEM.VAL(LONGINT,p);
  8625. WHILE(size>0) DO
  8626. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8627. END;
  8628. END Zero;
  8629. *)
  8630. PROCEDURE DoReshape*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; CONST shape: ARRAY [ * ] OF SIZE );
  8631. VAR i, Size: SIZE;
  8632. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8633. squeezingReshape: BOOLEAN;
  8634. new: UnsafeArrayT;
  8635. PROCEDURE CheckAlloc;
  8636. BEGIN
  8637. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8638. END CheckAlloc;
  8639. PROCEDURE NewDescriptor(): UnsafeArrayT;
  8640. BEGIN
  8641. CheckAlloc;
  8642. RETURN GetArrayDesc(newDim);
  8643. END NewDescriptor;
  8644. (* Added by Alexey
  8645. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8646. *)
  8647. PROCEDURE SqueezingReshape(): BOOLEAN;
  8648. VAR
  8649. i, j, n: SIZE;
  8650. BEGIN
  8651. IF oldDim > newDim THEN
  8652. i := 0; j := 0;
  8653. WHILE (i < oldDim) & (j < newDim) DO
  8654. n := GetLen(src,i);
  8655. IF n = shape[j] THEN INC(j); END;
  8656. INC(i);
  8657. END;
  8658. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8659. ELSE
  8660. squeezingReshape := FALSE;
  8661. END;
  8662. squeezingReshape := (i = oldDim) & (j = newDim);
  8663. RETURN squeezingReshape;
  8664. END SqueezingReshape;
  8665. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8666. PROCEDURE TargetContinuous(): BOOLEAN;
  8667. VAR
  8668. i, n: SIZE;
  8669. continue: BOOLEAN;
  8670. BEGIN
  8671. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8672. continue := TRUE;
  8673. WHILE (i > 0) & continue DO
  8674. n := n * GetLen(dest,i);
  8675. DEC(i);
  8676. continue := GetIncr(dest,i) = n;
  8677. END;
  8678. (*TRACE(i,continue,Size,GetSize(dest));*)
  8679. (*tod obviously size is not what I expect it to be*)
  8680. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8681. RETURN TRUE;
  8682. ELSE
  8683. RETURN FALSE;
  8684. END;
  8685. END TargetContinuous;
  8686. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8687. PROCEDURE PreservesContiguity(): BOOLEAN;
  8688. VAR
  8689. i, n: SIZE;
  8690. continue: BOOLEAN;
  8691. BEGIN
  8692. i := oldDim-1; n := GetIncr(src,i);
  8693. continue := TRUE;
  8694. WHILE (i > 0) & continue DO
  8695. n := n * GetLen(src,i);
  8696. DEC(i);
  8697. continue := GetIncr(src,i) = n;
  8698. END;
  8699. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8700. RETURN TRUE;
  8701. ELSE Err("Not yet implemented!");
  8702. END;
  8703. END PreservesContiguity;
  8704. (* Added by Alexey *)
  8705. PROCEDURE NewDescriptorForSameData(CONST src: UnsafeArrayT): UnsafeArrayT;
  8706. VAR len, size, i, j: SIZE; new: UnsafeArrayT;
  8707. BEGIN
  8708. CheckAlloc();
  8709. new:= GetArrayDesc( newDim );
  8710. IF ~squeezingReshape THEN
  8711. size := Size;
  8712. FOR i := newDim - 1 TO 0 BY -1 DO
  8713. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8714. size := size * len;
  8715. END;
  8716. ELSE (* squeezing reshape *)
  8717. j := 0; len := shape[j];
  8718. FOR i := 0 TO oldDim-1 DO
  8719. IF GetLen(src,i) = len THEN
  8720. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8721. INC(j);
  8722. IF j < newDim THEN len := shape[j]; END;
  8723. END;
  8724. END;
  8725. END;
  8726. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8727. PutFlags(new,GetFlags(new)+{RangeFlag});
  8728. END;
  8729. PutAdr( new, GetAdr(src) );
  8730. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8731. PutSize( new, Size );
  8732. RETURN new;
  8733. END NewDescriptorForSameData;
  8734. PROCEDURE NewData(VAR dest: UnsafeArrayT);
  8735. VAR len, size, i: SIZE; data: ANY;
  8736. BEGIN
  8737. size := Size;
  8738. FOR i := newDim - 1 TO 0 BY -1 DO
  8739. len := shape[i]; PutInc( dest, i, size ); PutLen( dest, i, len );
  8740. size := size * len;
  8741. END;
  8742. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8743. PutAdr( dest, Align(data) );
  8744. PutPtr( dest, data ); PutDim( dest, newDim );
  8745. PutSize( dest, Size );
  8746. END NewData;
  8747. PROCEDURE CopyData(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8748. VAR d, s: SIZE; dadr: ADDRESS;
  8749. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8750. VAR inc, len, i: SIZE;
  8751. BEGIN
  8752. IF dim = d THEN
  8753. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8754. FOR i := 0 TO len - 1 DO
  8755. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8756. END;
  8757. ELSE
  8758. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8759. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8760. END;
  8761. END Loop;
  8762. BEGIN
  8763. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8764. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8765. s := s * GetLen( src, d ); DEC( d );
  8766. END;
  8767. IF d = -1 THEN (* special case: both continuous *)
  8768. SYSTEM.MOVE( GetAdr( src ), GetAdr( dest ), s );
  8769. ELSE dadr := GetAdr( dest ); Loop( 0, GetAdr( src ) );
  8770. END;
  8771. END CopyData;
  8772. PROCEDURE CopyDescriptor(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8773. BEGIN
  8774. ASSERT( GetDim( src ) = GetDim( dest ) );
  8775. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8776. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8777. END CopyDescriptor;
  8778. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8779. VAR i: SIZE;
  8780. BEGIN
  8781. ASSERT(GetDim(dest) = newDim);
  8782. FOR i := 0 TO newDim - 1 DO
  8783. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8784. END;
  8785. RETURN FALSE;
  8786. END ShapeDiffers;
  8787. BEGIN
  8788. (*
  8789. cases
  8790. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8791. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8792. 3.) descriptor may not be reshaped: dest = RANGE
  8793. *)
  8794. (* first check invariants *)
  8795. oldDim := GetDim( src );
  8796. IF oldDim = 0 THEN oldSize := 0
  8797. ELSE
  8798. oldSize := 1;
  8799. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8800. END;
  8801. newDim := LEN( shape, 0 );
  8802. IF newDim = 0 THEN newSize := 0
  8803. ELSE
  8804. newSize := 1;
  8805. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8806. END;
  8807. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8808. Size := GetSize( src );
  8809. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8810. IF dest = src THEN (* added by Alexey *)
  8811. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8812. dest := NewDescriptorForSameData(src);
  8813. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8814. (* create a copy of the original descriptor *)
  8815. CheckAlloc();
  8816. dest := GetArrayDesc(newDim);
  8817. CopyDescriptor(src,dest);
  8818. ELSE
  8819. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8820. END;
  8821. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8822. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8823. ELSIF (dest = temporary) THEN
  8824. dest := NewDescriptorForSameData(src);
  8825. ELSIF TargetContinuous() THEN
  8826. dest := NewDescriptor(); CopyData(src, dest);
  8827. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8828. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8829. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8830. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8831. END;
  8832. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8833. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8834. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8835. NewData(dest); CopyData(src, dest);
  8836. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8837. new := NewDescriptor(); NewData(new); CopyData(src, new); CopyData(new, dest);
  8838. ELSE (* same shape, just copy *)
  8839. CopyContent( src, dest, Size ); RETURN;
  8840. END;
  8841. END DoReshape;
  8842. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8843. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArrayT );
  8844. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8845. PROCEDURE NewData;
  8846. VAR len, size, i: SIZE;
  8847. BEGIN
  8848. size := elementSize;
  8849. FOR i := dim - 1 TO 0 BY -1 DO
  8850. len := a[i];
  8851. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8852. END;
  8853. IF tag = 0 THEN
  8854. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8855. dest.adr := Align(data);
  8856. ELSE
  8857. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8858. dest.adr := data + ADDRESS(ArrDataArrayOffset);
  8859. END;
  8860. PutPtr(dest, data);
  8861. PutSize( dest, elementSize );
  8862. END NewData;
  8863. PROCEDURE ClearData;
  8864. (*! todo *)
  8865. END ClearData;
  8866. BEGIN
  8867. dim := LEN( a,0 );
  8868. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8869. IF dest # 0 THEN
  8870. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8871. END;
  8872. descr := GetArrayDesc( LEN( a,0 ) );
  8873. dest := descr;
  8874. NewData;
  8875. Heaps.SetPC(data);
  8876. ELSE
  8877. i := 0;
  8878. same := TRUE;
  8879. WHILE (i < dim) & same DO
  8880. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8881. INC( i );
  8882. END;
  8883. IF ~same THEN
  8884. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8885. NewData;
  8886. Heaps.SetPC(data);
  8887. ELSE ClearData
  8888. END;
  8889. END;
  8890. END AllocateTensorA;
  8891. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray);
  8892. BEGIN
  8893. AllocateTensorA(a,elementSize,tag,dest);
  8894. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8895. END AllocateArrayA;
  8896. PROCEDURE DoAllocateTensorX*( VAR dest: UnsafeArrayT; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8897. VAR data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8898. PROCEDURE NewData;
  8899. VAR len, size: SIZE; i: SIZE;
  8900. BEGIN
  8901. size := Size;
  8902. FOR i := dim - 1 TO 0 BY -1 DO
  8903. len := a[i];
  8904. (*
  8905. KernelLog.Int(len,10); KernelLog.Ln;
  8906. *)
  8907. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8908. END;
  8909. IF tag = 0 THEN
  8910. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8911. PutAdr( dest, Align(data) );
  8912. ELSE
  8913. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8914. PutAdr( dest, data+ ADDRESS(ArrDataArrayOffset) );
  8915. END;
  8916. PutPtr( dest, data ); PutSize( dest, Size );
  8917. END NewData;
  8918. PROCEDURE ClearData;
  8919. (*! todo *)
  8920. END ClearData;
  8921. BEGIN
  8922. dim := LEN( a,0 );
  8923. (*! check range flag! *)
  8924. IF (dest = NIL) OR (dim # GetDim( dest )) THEN
  8925. IF dest # NIL THEN
  8926. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8927. END;
  8928. dest := GetArrayDesc( LEN( a,0 ) );
  8929. NewData;
  8930. ELSE
  8931. i := 0;
  8932. WHILE (i < dim) & same DO
  8933. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8934. INC( i );
  8935. END;
  8936. IF ~same THEN
  8937. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8938. NewData
  8939. ELSE ClearData
  8940. END;
  8941. END;
  8942. END DoAllocateTensorX;
  8943. PROCEDURE AllocateTensorX( VAR dest: ARRAY {UNSAFE} [?] OF SIZE; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8944. BEGIN
  8945. DoAllocateTensorX(dest,a,Size,tag);
  8946. END AllocateTensorX;
  8947. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8948. VAR dim, i: SIZE;
  8949. BEGIN
  8950. dim := GetDim( src );
  8951. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8952. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8953. END LenA;
  8954. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8955. VAR dim, len: SIZE; i: SIZE;
  8956. BEGIN
  8957. dim := GetDim( src ); len := LEN( dest, 0 );
  8958. IF len # dim THEN NEW( dest, dim ); END;
  8959. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8960. END IncrA;
  8961. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8962. VAR dim: SIZE;
  8963. BEGIN
  8964. dim := GetDim(src);
  8965. IF (d<0) OR (d>=dim) THEN HALT(100)
  8966. ELSE
  8967. RETURN GetLen(src,d);
  8968. END;
  8969. END Len;
  8970. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8971. VAR dim: SIZE;
  8972. BEGIN
  8973. dim := GetDim(src);
  8974. IF (d<0) OR (d>=dim) THEN HALT(100)
  8975. ELSE
  8976. RETURN GetIncr(src,d);
  8977. END;
  8978. END Incr;
  8979. PROCEDURE AllocateTensor( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT;
  8980. Size: SIZE );
  8981. VAR ldim, rdim: SIZE;
  8982. PROCEDURE NewData;
  8983. VAR len, size, i: SIZE; data: ANY;
  8984. BEGIN
  8985. size := 1;
  8986. FOR i := 0 TO ldim - 1 DO
  8987. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8988. END;
  8989. FOR i := 0 TO rdim - 1 DO
  8990. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8991. END;
  8992. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8993. (*
  8994. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8995. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8996. *)
  8997. size := Size;
  8998. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8999. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  9000. END;
  9001. PutAdr( dest, Align(data) );
  9002. PutPtr( dest, data );
  9003. END NewData;
  9004. BEGIN
  9005. ldim := GetDim( left ); rdim := GetDim( right );
  9006. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9007. dest := GetArrayDesc( ldim + rdim );
  9008. NewData();
  9009. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9010. IF ~(TensorFlag IN GetFlags( dest )) &
  9011. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9012. HALT( 100 );
  9013. END;
  9014. dest := GetArrayDesc( ldim + rdim );
  9015. NewData();
  9016. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9017. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9018. HALT( 100 );
  9019. END;
  9020. NewData();
  9021. END;
  9022. END AllocateTensor;
  9023. (* 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 *)
  9024. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9025. VAR rdim, len, linc, ri: SIZE );
  9026. (* geometric precondition: lengths must coincide *)
  9027. VAR ldim: SIZE;
  9028. BEGIN
  9029. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9030. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9031. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9032. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9033. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9034. END;
  9035. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9036. DEC( ldim );
  9037. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9038. (GetIncr( right, rdim ) = len * ri) DO
  9039. len := len * GetLen( left, ldim );
  9040. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9041. DEC( ldim );
  9042. END;
  9043. INC( ldim ); INC( rdim );
  9044. IF debug THEN
  9045. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9046. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9047. END;
  9048. END FindPatternTensor;
  9049. PROCEDURE ApplyTensorAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  9050. Loop: BinaryASALoop );
  9051. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE;
  9052. origdest: ADDRESS;
  9053. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9054. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9055. BEGIN
  9056. IF (ldim < lDim) THEN
  9057. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9058. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9059. WHILE (len > 0) DO
  9060. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9061. INC( dadr, dinc ); DEC( len );
  9062. END;
  9063. ELSIF (rdim # loopd) THEN
  9064. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9065. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9066. WHILE (len > 0) DO
  9067. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9068. INC( dadr, dinc ); DEC( len );
  9069. END;
  9070. ELSE
  9071. (*
  9072. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9073. KernelLog.Int(GetAdr(dest),10);
  9074. KernelLog.Int(GetAdr(dest)+clen,10);
  9075. KernelLog.Ln;
  9076. *)
  9077. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9078. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9079. END;
  9080. END Traverse;
  9081. BEGIN
  9082. (* check array lengths *)
  9083. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9084. AllocateTensor( dest, left, right, elementSize );
  9085. (*
  9086. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9087. p := AllocateTensor( left, right, dest, elementSize )
  9088. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9089. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9090. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9091. END;
  9092. (*! to be done: treat overlapping memory *)
  9093. END;
  9094. *)
  9095. (* debugging *)
  9096. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9097. (* check pattern: longest piece that can be done with a loop *)
  9098. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9099. (* run through dimensions *)
  9100. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9101. END ApplyTensorAAAOp;
  9102. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9103. BEGIN
  9104. ApplyTensorAAAOp( RESULT, left, right,
  9105. SIZEOF( SHORTINT ), MulASSSLoop );
  9106. RETURN RESULT
  9107. END "**";
  9108. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9109. BEGIN
  9110. ApplyTensorAAAOp( RESULT, left, right,
  9111. SIZEOF( INTEGER ), MulAISILoop );
  9112. RETURN RESULT
  9113. END "**";
  9114. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9115. BEGIN
  9116. ApplyTensorAAAOp( RESULT, left, right,
  9117. SIZEOF( LONGINT ), MulALSLLoop );
  9118. RETURN RESULT
  9119. END "**";
  9120. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  9121. BEGIN
  9122. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( REAL ),
  9123. loopMulARSR );
  9124. RETURN RESULT
  9125. END "**";
  9126. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  9127. BEGIN
  9128. ApplyTensorAAAOp( RESULT, left, right,
  9129. SIZEOF( LONGREAL ), loopMulAXSX );
  9130. RETURN RESULT
  9131. END "**";
  9132. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  9133. BEGIN
  9134. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( COMPLEX ),
  9135. loopMulAZSZ );
  9136. RETURN RESULT
  9137. END "**";
  9138. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  9139. BEGIN
  9140. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( LONGCOMPLEX ),
  9141. loopMulALZSLZ );
  9142. RETURN RESULT
  9143. END "**";
  9144. PROCEDURE InitOptimization;
  9145. VAR p: PROCEDURE;
  9146. BEGIN
  9147. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9148. IF p # NIL THEN
  9149. p;
  9150. ELSE
  9151. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9152. END;
  9153. END InitOptimization;
  9154. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9155. PROCEDURE CopyDescriptor*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9156. VAR srcDim, destDim,i,len,incr: SIZE;
  9157. BEGIN
  9158. IF src = 0 THEN
  9159. HALT(100);
  9160. ELSE
  9161. srcDim := GetDim(src);
  9162. destDim := srcDim - prefixIndices - suffixIndices;
  9163. (*
  9164. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9165. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9166. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9167. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9168. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9169. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9170. *)
  9171. dest := GetArrayDesc(destDim); (* destination dimension included *)
  9172. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9173. PutAdr(dest,GetAdr(src));
  9174. PutPtr(dest,GetPtr(src));
  9175. PutFlags(dest,GetFlags(src));
  9176. PutSize(dest,GetSize(src));
  9177. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9178. srcDim := i + prefixIndices + prefixRanges;
  9179. destDim := i + prefixRanges;
  9180. len := GetLen(src,srcDim);
  9181. incr := GetIncr(src,srcDim);
  9182. PutLen(dest,destDim,len);
  9183. PutInc(dest,destDim,incr);
  9184. END;
  9185. (*
  9186. Report("copy descriptor src",src);
  9187. Report("copy descriptor dest",dest);
  9188. *)
  9189. END;
  9190. END CopyDescriptor;
  9191. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9192. VAR dest: ARRAY [?] OF basetype
  9193. CONST src: ARRAY [?] OF basetype
  9194. CONST shape: ARRAY [*] OF LONGINT
  9195. *)
  9196. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF SIZE): ARRAY {UNSAFE} [?];
  9197. BEGIN
  9198. DoReshape(RESULT, left, right);
  9199. RETURN RESULT
  9200. END Reshape;
  9201. (* OLIVIER *)
  9202. (** creates a degenerated range from an integer.
  9203. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9204. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9205. **)
  9206. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9207. BEGIN RETURN (integer .. integer BY 1)
  9208. END RangeFromInteger;
  9209. (* OLIVIER *)
  9210. (** create an array with the same data but with more dimensions
  9211. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9212. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9213. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9214. e.g.:
  9215. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9216. performs the following type transformation:
  9217. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9218. **)
  9219. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9220. VAR
  9221. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9222. sourceADDRESS, targetADDRESS: ADDRESS;
  9223. targetArrayDescriptor: ANY;
  9224. BEGIN
  9225. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9226. targetDimensionality := LEN(keptDimensions, 0);
  9227. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9228. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9229. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9230. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9231. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9232. PutFlags(targetADDRESS, {TensorFlag});
  9233. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9234. (* set increments and lengths *)
  9235. sourceIndex := 0;
  9236. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9237. IF keptDimensions[targetIndex] THEN
  9238. (* reuse length and increment from source array *)
  9239. ASSERT(sourceIndex < DIM(sourceArray));
  9240. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9241. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9242. INC(sourceIndex)
  9243. ELSE
  9244. (* set length = 1 and increment = 0 *)
  9245. PutLen(targetADDRESS, targetIndex, 1);
  9246. PutInc(targetADDRESS, targetIndex, 0);
  9247. END
  9248. END;
  9249. (* Report("expand dimensions: ", targetADDRESS); *)
  9250. RETURN RESULT
  9251. END ExpandDimensions;
  9252. (* index ranges *)
  9253. (* the length of a range, i.e. the number of indices that it stands for *)
  9254. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9255. VAR
  9256. temp, result: SIZE;
  9257. BEGIN
  9258. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9259. (* invalid range *)
  9260. result := 0
  9261. ELSIF LAST(range) = MAX(LONGINT) THEN
  9262. (* open-ended range *)
  9263. result := MAX(LONGINT)
  9264. ELSE
  9265. temp := 1 + LAST(range) - FIRST(range);
  9266. result := temp DIV STEP(range);
  9267. IF (temp MOD STEP(range)) # 0 THEN
  9268. INC(result)
  9269. END
  9270. END;
  9271. RETURN result
  9272. END "LEN";
  9273. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9274. BEGIN
  9275. ApplyGenericUnaryAAOpS(RESULT, x, SIZEOF(SHORTINT),GenericLoopS,op);
  9276. RETURN RESULT;
  9277. END "ALL";
  9278. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9279. BEGIN
  9280. ApplyGenericUnaryAAOpI(RESULT,x,SIZEOF(INTEGER),GenericLoopI,op);
  9281. RETURN RESULT;
  9282. END "ALL";
  9283. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9284. BEGIN
  9285. ApplyGenericUnaryAAOpL(RESULT,x,SIZEOF(LONGINT),GenericLoopL,op);
  9286. RETURN RESULT;
  9287. END "ALL";
  9288. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT; (*should also accept operator ?*)
  9289. BEGIN
  9290. ApplyGenericUnaryAAOpH(RESULT,x,SIZEOF(HUGEINT),GenericLoopH,op);
  9291. RETURN RESULT;
  9292. END "ALL";
  9293. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY {UNSAFE} [?] OF REAL; (*should also accept operator ?*)
  9294. BEGIN
  9295. ApplyGenericUnaryAAOpR(RESULT,x,SIZEOF(REAL),GenericLoopR,op);
  9296. RETURN RESULT;
  9297. END "ALL";
  9298. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY{UNSAFE} [?] OF LONGREAL; (*should also accept operator ?*)
  9299. BEGIN
  9300. ApplyGenericUnaryAAOpX(RESULT,x,SIZEOF(LONGREAL),GenericLoopX,op);
  9301. RETURN RESULT;
  9302. END "ALL";
  9303. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX; (*should also accept operator ?*)
  9304. BEGIN
  9305. ApplyGenericUnaryAAOpZ(RESULT,x,SIZEOF(COMPLEX),GenericLoopZ,op);
  9306. RETURN RESULT;
  9307. END "ALL";
  9308. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9309. BEGIN
  9310. ApplyGenericUnaryAAOpLZ(RESULT,x,SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9311. RETURN RESULT;
  9312. END "ALL";
  9313. BEGIN
  9314. alloc := 0; NEW(temporary);
  9315. PutFlags(temporary,{TensorFlag});
  9316. PutDim(temporary, 0);
  9317. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9318. END FoxArrayBase.
  9319. Compiler.Compile FoxArrayBase.Mod ~
  9320. System.ListModules
  9321. System.FreeDownTo FoxArrayBase ~
  9322. Debugging.DisableGC