FoxArrayBase.Mod 346 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770
  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. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  124. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  125. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  126. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  127. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  128. transpose4*: TransposeP; transpose8*: TransposeP;
  129. (* optimizations for small arrays (Alexey Morozov) *)
  130. matMulR2x2*: SmallMatMul;
  131. matMulR3x3*: SmallMatMul;
  132. matMulR4x4*: SmallMatMul;
  133. matVecMulR2x2*: SmallMatMul;
  134. matVecMulR3x3*: SmallMatMul;
  135. matVecMulR4x4*: SmallMatMul;
  136. matMulLR2x2*: SmallMatMul;
  137. matMulLR3x3*: SmallMatMul;
  138. matMulLR4x4*: SmallMatMul;
  139. matVecMulLR2x2*: SmallMatMul;
  140. matVecMulLR3x3*: SmallMatMul;
  141. matVecMulLR4x4*: SmallMatMul;
  142. (*
  143. TensorTypePool: ARRAY 32 OF TensorType;
  144. *)
  145. PROCEDURE SetDefaults*; (* set standard procedures *)
  146. BEGIN
  147. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  148. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  149. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  150. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  151. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  152. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  153. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  154. loopIncMulAXSX := IncMulAXSXLoop;
  155. loopMatMulIncARAR := MatMulIncARARLoop;
  156. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  157. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  158. loopMulAZSZ := MulAZSZLoop;
  159. loopMulALZSLZ := MulALZSLZLoop;
  160. END SetDefaults;
  161. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  162. BEGIN
  163. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  164. END Err;
  165. (* get increment of dimension dim *)
  166. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  167. BEGIN{UNCHECKED}
  168. RETURN base.lens[dim].inc
  169. END GetIncr;
  170. (* set increment of dimension dim *)
  171. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  172. BEGIN{UNCHECKED}
  173. base.lens[dim].inc := val
  174. END PutInc;
  175. (* get length of dimension dim *)
  176. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  177. BEGIN{UNCHECKED}
  178. RETURN base.lens[dim].len
  179. END GetLen;
  180. (* set length of dimension dim *)
  181. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  182. BEGIN{UNCHECKED}
  183. base.lens[dim].len := val
  184. END PutLen;
  185. (* get data address *)
  186. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  187. BEGIN
  188. RETURN base.adr;
  189. END GetAdr;
  190. (* set data address *)
  191. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  192. BEGIN
  193. base.adr := value
  194. END PutAdr;
  195. PROCEDURE Align(value: ADDRESS): ADDRESS;
  196. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  197. END Align;
  198. (* get data base pointer (GC protection) *)
  199. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  200. BEGIN
  201. RETURN base.ptr;
  202. END GetPtr;
  203. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  204. BEGIN
  205. dest := src;
  206. END SafePut;
  207. (* set data base pointer (GC protection) *)
  208. PROCEDURE PutPtr(CONST base: UnsafeArray; value: ANY);
  209. BEGIN
  210. base.ptr := value;
  211. (*
  212. SafePut(base.ptr,value);
  213. *)
  214. END PutPtr;
  215. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  216. BEGIN
  217. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  218. END GetSize;
  219. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  220. BEGIN
  221. base.elementSize := val
  222. END PutSize;
  223. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  224. BEGIN
  225. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  226. END GetDim;
  227. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  228. BEGIN
  229. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  230. END GetFlags;
  231. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  232. BEGIN
  233. base.dim := dim
  234. END PutDim;
  235. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  236. BEGIN
  237. base.flags := flags
  238. END PutFlags;
  239. (* report geometry of array passed via address s *)
  240. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  241. VAR i: SIZE; dim: SIZE;
  242. PROCEDURE Set( s: SET );
  243. VAR i: SIZE; first: BOOLEAN;
  244. BEGIN
  245. KernelLog.String( "{" ); first := TRUE;
  246. FOR i := 31 TO 0 BY -1 DO
  247. IF i IN s THEN
  248. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  249. KernelLog.Int( i, 1 );
  250. END;
  251. END;
  252. KernelLog.String( "}" );
  253. END Set;
  254. BEGIN
  255. KernelLog.String( name );
  256. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  257. ELSE
  258. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  259. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  260. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  261. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  262. KernelLog.Ln; dim := GetDim( s );
  263. IF dim > 32 THEN dim := 0 END;
  264. FOR i := 0 TO dim - 1 DO
  265. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  266. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  267. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  268. END;
  269. (*
  270. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  271. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  272. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  273. *)
  274. END;
  275. END Report;
  276. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  277. VAR (* t: TensorType; *) ptr: Tensor;
  278. p0: T0;
  279. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  280. BEGIN
  281. CASE dim OF
  282. |0: NEW(p0); ptr := p0;
  283. |1:NEW(p1); ptr := p1;
  284. |2:NEW(p2); ptr := p2;
  285. |3:NEW(p3); ptr := p3;
  286. |4:NEW(p4); ptr := p4;
  287. |5:NEW(p5); ptr := p5;
  288. |6:NEW(p6); ptr := p6;
  289. |7:NEW(p7); ptr := p7;
  290. |8:NEW(p8); ptr := p8;
  291. ELSE
  292. HALT(200)
  293. END;
  294. ptr.dim := dim;
  295. ptr.flags := {TensorFlag};
  296. RETURN ptr;
  297. END GetArrayDesc;
  298. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  299. BEGIN
  300. IF d = NIL THEN
  301. d := GetArrayDesc(dim);
  302. ELSIF d.dim # dim THEN
  303. IF ~(TensorFlag IN d.flags) &
  304. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  305. HALT( 100 );
  306. END;
  307. d := GetArrayDesc(dim)
  308. (* ELSE keep as is *)
  309. END;
  310. END EnsureArrayDesc;
  311. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  312. VAR reason: ARRAY 64 OF CHAR;
  313. BEGIN
  314. IF left # 0 THEN Report( "Source operand ", left ) END;
  315. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  316. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  317. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  318. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  319. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  320. ELSE reason := "unknown";
  321. END;
  322. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  323. HALT( 400 );
  324. END Halt;
  325. (** patterns ********************************************************************)
  326. (* 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 *)
  327. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  328. BEGIN
  329. d := dim - 1; len := GetLen( left, d );
  330. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  331. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  332. linc := GetIncr( left, d ); DEC( d );
  333. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  334. len := len * GetLen( left, d ); DEC( d );
  335. END; (* find dimension where pattern does not work any more *)
  336. INC( d );
  337. IF debug THEN
  338. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  339. KernelLog.Ln;
  340. END;
  341. END FindPattern1;
  342. (* 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 *)
  343. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  344. VAR d, len, linc, ri: SIZE );
  345. (* geometric precondition: lengths must coincide *)
  346. BEGIN
  347. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  348. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  349. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  350. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  351. len := len * GetLen( left, d ); DEC( d );
  352. END;
  353. INC( d );
  354. IF debug THEN
  355. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  356. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  357. END;
  358. END FindPattern2;
  359. (* 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 *)
  360. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  361. VAR d, len, linc, ri, di: SIZE );
  362. (* geometric precondition: lengths must coincide *)
  363. BEGIN
  364. d := dim - 1; len := GetLen( left, d );
  365. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  366. END;
  367. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  368. DEC( d );
  369. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  370. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  371. len := len * GetLen( left, d ); DEC( d );
  372. END;
  373. INC( d );
  374. IF debug THEN
  375. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  376. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  377. END;
  378. END FindPattern3;
  379. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  380. VAR d, sl, sr: SIZE;
  381. BEGIN
  382. d := 0; sl := GetAdr( src );
  383. WHILE (d < dim) DO
  384. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  385. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  386. END;
  387. PutAdr( src, sl + sr );
  388. END Reverse;
  389. (* check if forward copy may be performed *)
  390. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  391. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  392. (* precondition: len(src,i)=len(dest,i) *)
  393. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  394. Sufficient (but not necessary) conditions:
  395. 1.) no overlap: src right < dest left or src left > dest right or
  396. 2.) same geometry and src left >= dest left
  397. same geometry if ginc(s)=ginc(d) with
  398. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  399. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  400. *)
  401. BEGIN
  402. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  403. dim := GetDim( src );
  404. WHILE (d < dim) DO
  405. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  406. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  407. END;
  408. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  409. ELSIF ((sr - sl) = (dr - dl)) THEN
  410. IF (sl = dl) THEN (* same memory region, both directions possible *)
  411. ELSIF (sl > dl) THEN
  412. EXCL( modes, down ) (* only copy up possible *)
  413. ELSE (*sl < dl*)
  414. EXCL( modes, up ) (* only copy down possible *)
  415. END;
  416. ELSE
  417. modes := modes - {down, up}; (* neither nor *)
  418. END;
  419. END CopyUpCompatible;
  420. PROCEDURE AllocateTemp(dest: ADDRESS; src: ADDRESS;
  421. Size: SIZE ): ANY;
  422. (* allocate a temporary block containing both descriptor and data *)
  423. BEGIN
  424. HALT(100);
  425. (*
  426. IF statistics THEN INC( allocTemp ) END;
  427. d := 0; len := Size; dim := GetDim( src );
  428. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  429. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  430. dest := SYSTEM.VAL( SIZE, p );
  431. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  432. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  433. FOR i := 0 TO dim - 1 DO
  434. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  435. len := len * GetLen( src, i );
  436. END;
  437. (* Report("allocdest",dest,dim); *)
  438. RETURN p;
  439. *)
  440. END AllocateTemp;
  441. (*** procedures to traverse arrays and apply operators *)
  442. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  443. PROCEDURE ApplyGenericUnaryAAOpS(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  444. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  445. origdest: ADDRESS; modes: SET;
  446. dim: SIZE;
  447. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  448. VAR len: SIZE; linc, dinc: SIZE;
  449. BEGIN
  450. IF dim = loopd THEN
  451. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  452. IF conservative THEN INC( glen, looplen ) END;
  453. ELSE
  454. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  455. dinc := GetIncr( dest, dim ); INC( dim );
  456. WHILE (len > 0) DO
  457. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  458. END;
  459. END;
  460. END Traverse;
  461. BEGIN
  462. dim := GetDim( left );
  463. origdest := 0; modes := {up, down};
  464. (* allocate destination, if necessary *)
  465. IF ~AllocateSameT( dest, left, elementSize ) THEN
  466. CopyUpCompatible( dest, left, modes );
  467. IF up IN modes THEN (* nothing to be done *)
  468. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  469. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  470. END;
  471. END;
  472. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  473. (* check pattern: longest piece that can be done with a loop *)
  474. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  475. Traverse( 0, left.adr, dest.adr);
  476. IF up IN modes THEN (* nothing to be done *)
  477. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  478. ELSE CopyContent( origdest, dest, elementSize );
  479. END;
  480. END ApplyGenericUnaryAAOpS;
  481. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  482. PROCEDURE ApplyGenericUnaryAAOpI(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  483. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  484. origdest: ADDRESS; modes: SET;
  485. dim: SIZE;
  486. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  487. VAR len: SIZE; linc, dinc: SIZE;
  488. BEGIN
  489. IF dim = loopd THEN
  490. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  491. IF conservative THEN INC( glen, looplen ) END;
  492. ELSE
  493. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  494. dinc := GetIncr( dest, dim ); INC( dim );
  495. WHILE (len > 0) DO
  496. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  497. END;
  498. END;
  499. END Traverse;
  500. BEGIN
  501. dim := GetDim( left );
  502. origdest := 0; modes := {up, down};
  503. (* allocate destination, if necessary *)
  504. IF ~AllocateSameT( dest, left, elementSize ) THEN
  505. CopyUpCompatible( dest, left, modes );
  506. IF up IN modes THEN (* nothing to be done *)
  507. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  508. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  509. END;
  510. END;
  511. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  512. (* check pattern: longest piece that can be done with a loop *)
  513. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  514. Traverse( 0, left.adr, dest.adr);
  515. IF up IN modes THEN (* nothing to be done *)
  516. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  517. ELSE CopyContent( origdest, dest, elementSize );
  518. END;
  519. END ApplyGenericUnaryAAOpI;
  520. (** apply unary operator to array: array SIZE -> array SIZE *)
  521. PROCEDURE ApplyGenericUnaryAAOpL(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  522. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  523. origdest: ADDRESS; modes: SET;
  524. dim: SIZE;
  525. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  526. VAR len: SIZE; linc, dinc: SIZE;
  527. BEGIN
  528. IF dim = loopd THEN
  529. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  530. IF conservative THEN INC( glen, looplen ) END;
  531. ELSE
  532. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  533. dinc := GetIncr( dest, dim ); INC( dim );
  534. WHILE (len > 0) DO
  535. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  536. END;
  537. END;
  538. END Traverse;
  539. BEGIN
  540. dim := GetDim( left );
  541. origdest := 0; modes := {up, down};
  542. (* allocate destination, if necessary *)
  543. IF ~AllocateSameT( dest, left, elementSize ) THEN
  544. CopyUpCompatible( dest, left, modes );
  545. IF up IN modes THEN (* nothing to be done *)
  546. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  547. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  548. END;
  549. END;
  550. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  551. (* check pattern: longest piece that can be done with a loop *)
  552. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  553. Traverse( 0, left.adr, dest.adr);
  554. IF up IN modes THEN (* nothing to be done *)
  555. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  556. ELSE CopyContent( origdest, dest, elementSize );
  557. END;
  558. END ApplyGenericUnaryAAOpL;
  559. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  560. PROCEDURE ApplyGenericUnaryAAOpH(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  561. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  562. origdest: ADDRESS; modes: SET;
  563. dim: SIZE;
  564. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  565. VAR len: SIZE; linc, dinc: SIZE;
  566. BEGIN
  567. IF dim = loopd THEN
  568. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  569. IF conservative THEN INC( glen, looplen ) END;
  570. ELSE
  571. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  572. dinc := GetIncr( dest, dim ); INC( dim );
  573. WHILE (len > 0) DO
  574. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  575. END;
  576. END;
  577. END Traverse;
  578. BEGIN
  579. dim := GetDim( left );
  580. origdest := 0; modes := {up, down};
  581. (* allocate destination, if necessary *)
  582. IF ~AllocateSameT( dest, left, elementSize ) THEN
  583. CopyUpCompatible( dest, left, modes );
  584. IF up IN modes THEN (* nothing to be done *)
  585. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  586. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  587. END;
  588. END;
  589. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  590. (* check pattern: longest piece that can be done with a loop *)
  591. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  592. Traverse( 0, left.adr, dest.adr);
  593. IF up IN modes THEN (* nothing to be done *)
  594. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  595. ELSE CopyContent( origdest, dest, elementSize );
  596. END;
  597. END ApplyGenericUnaryAAOpH;
  598. (** apply unary operator to array: array REAL -> array REAL *)
  599. PROCEDURE ApplyGenericUnaryAAOpR(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  600. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  601. origdest: ADDRESS; modes: SET;
  602. dim: SIZE;
  603. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  604. VAR len: SIZE; linc, dinc: SIZE;
  605. BEGIN
  606. IF dim = loopd THEN
  607. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  608. IF conservative THEN INC( glen, looplen ) END;
  609. ELSE
  610. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  611. dinc := GetIncr( dest, dim ); INC( dim );
  612. WHILE (len > 0) DO
  613. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  614. END;
  615. END;
  616. END Traverse;
  617. BEGIN
  618. dim := GetDim( left );
  619. origdest := 0; modes := {up, down};
  620. (* allocate destination, if necessary *)
  621. IF ~AllocateSameT( dest, left, elementSize ) THEN
  622. CopyUpCompatible( dest, left, modes );
  623. IF up IN modes THEN (* nothing to be done *)
  624. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  625. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  626. END;
  627. END;
  628. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  629. (* check pattern: longest piece that can be done with a loop *)
  630. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  631. Traverse( 0, left.adr, dest.adr);
  632. IF up IN modes THEN (* nothing to be done *)
  633. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  634. ELSE CopyContent( origdest, dest, elementSize );
  635. END;
  636. END ApplyGenericUnaryAAOpR;
  637. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  638. PROCEDURE ApplyGenericUnaryAAOpX(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  639. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  640. origdest: ADDRESS; modes: SET;
  641. dim: SIZE;
  642. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  643. VAR len: SIZE; linc, dinc: SIZE;
  644. BEGIN
  645. IF dim = loopd THEN
  646. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  647. IF conservative THEN INC( glen, looplen ) END;
  648. ELSE
  649. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  650. dinc := GetIncr( dest, dim ); INC( dim );
  651. WHILE (len > 0) DO
  652. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  653. END;
  654. END;
  655. END Traverse;
  656. BEGIN
  657. dim := GetDim( left );
  658. origdest := 0; modes := {up, down};
  659. (* allocate destination, if necessary *)
  660. IF ~AllocateSameT( dest, left, elementSize ) THEN
  661. CopyUpCompatible( dest, left, modes );
  662. IF up IN modes THEN (* nothing to be done *)
  663. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  664. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  665. END;
  666. END;
  667. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  668. (* check pattern: longest piece that can be done with a loop *)
  669. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  670. Traverse( 0, left.adr, dest.adr);
  671. IF up IN modes THEN (* nothing to be done *)
  672. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  673. ELSE CopyContent( origdest, dest, elementSize );
  674. END;
  675. END ApplyGenericUnaryAAOpX;
  676. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  677. PROCEDURE ApplyGenericUnaryAAOpZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  678. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  679. origdest: ADDRESS; modes: SET;
  680. dim: SIZE;
  681. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  682. VAR len: SIZE; linc, dinc: SIZE;
  683. BEGIN
  684. IF dim = loopd THEN
  685. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  686. IF conservative THEN INC( glen, looplen ) END;
  687. ELSE
  688. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  689. dinc := GetIncr( dest, dim ); INC( dim );
  690. WHILE (len > 0) DO
  691. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  692. END;
  693. END;
  694. END Traverse;
  695. BEGIN
  696. dim := GetDim( left );
  697. origdest := 0; modes := {up, down};
  698. (* allocate destination, if necessary *)
  699. IF ~AllocateSameT( dest, left, elementSize ) THEN
  700. CopyUpCompatible( dest, left, modes );
  701. IF up IN modes THEN (* nothing to be done *)
  702. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  703. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  704. END;
  705. END;
  706. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  707. (* check pattern: longest piece that can be done with a loop *)
  708. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  709. Traverse( 0, left.adr, dest.adr);
  710. IF up IN modes THEN (* nothing to be done *)
  711. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  712. ELSE CopyContent( origdest, dest, elementSize );
  713. END;
  714. END ApplyGenericUnaryAAOpZ;
  715. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  716. PROCEDURE ApplyGenericUnaryAAOpLZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  717. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  718. origdest: ADDRESS; modes: SET;
  719. dim: SIZE;
  720. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  721. VAR len: SIZE; linc, dinc: SIZE;
  722. BEGIN
  723. IF dim = loopd THEN
  724. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  725. IF conservative THEN INC( glen, looplen ) END;
  726. ELSE
  727. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  728. dinc := GetIncr( dest, dim ); INC( dim );
  729. WHILE (len > 0) DO
  730. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  731. END;
  732. END;
  733. END Traverse;
  734. BEGIN
  735. dim := GetDim( left );
  736. origdest := 0; modes := {up, down};
  737. (* allocate destination, if necessary *)
  738. IF ~AllocateSameT( dest, left, elementSize ) THEN
  739. CopyUpCompatible( dest, left, modes );
  740. IF up IN modes THEN (* nothing to be done *)
  741. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  742. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  743. END;
  744. END;
  745. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  746. (* check pattern: longest piece that can be done with a loop *)
  747. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  748. Traverse( 0, left.adr, dest.adr);
  749. IF up IN modes THEN (* nothing to be done *)
  750. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  751. ELSE CopyContent( origdest, dest, elementSize );
  752. END;
  753. END ApplyGenericUnaryAAOpLZ;
  754. (** apply unary operator to array: array -> array *)
  755. PROCEDURE ApplyUnaryAAOp(VAR dest: UnsafeArrayT; CONST left: UnsafeArray; elementSize: SIZE;
  756. Loop: UnaryAALoop );
  757. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  758. origdest: SIZE; modes: SET;
  759. dim: SIZE;
  760. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  761. VAR len: SIZE; linc, dinc: SIZE;
  762. BEGIN
  763. IF dim = loopd THEN
  764. Loop( ladr, dadr, loopli, loopdi, looplen );
  765. IF conservative THEN INC( glen, looplen ) END;
  766. ELSE
  767. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  768. dinc := GetIncr( dest, dim ); INC( dim );
  769. WHILE (len > 0) DO
  770. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  771. DEC( len );
  772. END;
  773. END;
  774. END Traverse;
  775. BEGIN
  776. dim := GetDim( left );
  777. origdest := 0; modes := {up, down};
  778. (* allocate destination, if necessary *)
  779. IF ~AllocateSameT( dest, left, elementSize ) THEN
  780. CopyUpCompatible( dest, left, modes );
  781. IF up IN modes THEN (* nothing to be done *)
  782. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  783. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  784. END;
  785. END;
  786. (*
  787. (* allocate destination, if necessary *)
  788. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  789. ELSIF CheckGeometry( left, dest, dim )
  790. END;
  791. *)
  792. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  793. (* check pattern: longest piece that can be done with a loop *)
  794. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  795. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  796. IF up IN modes THEN (* nothing to be done *)
  797. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  798. ELSE CopyContent( origdest, dest, elementSize );
  799. END;
  800. END ApplyUnaryAAOp;
  801. (** apply unary operator to array: array -> scalar *)
  802. PROCEDURE ApplyUnaryASOp( dest: ADDRESS; CONST left: UnsafeArray; Loop: UnaryASLoop );
  803. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  804. VAR dim: SIZE;
  805. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  806. VAR len: SIZE; linc: SIZE;
  807. BEGIN
  808. IF dim = loopd THEN
  809. Loop( ladr, dest, loopli, looplen );
  810. IF conservative THEN INC( glen, looplen ) END;
  811. ELSE
  812. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  813. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  814. END;
  815. END Traverse;
  816. BEGIN
  817. dim := GetDim( left );
  818. IF debug THEN Report( "AS: left", left ); END;
  819. (* check pattern: longest piece that can be done with a loop *)
  820. IF conservative THEN glen := 0 END;
  821. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  822. IF conservative THEN
  823. looplen := 1;
  824. WHILE (dim > 0) DO
  825. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  826. END;
  827. ASSERT( looplen = glen );
  828. END;
  829. END ApplyUnaryASOp;
  830. (** apply unary operator to array: scalar -> array *)
  831. PROCEDURE ApplyUnarySAOp( VAR dest: UnsafeArrayT; right: ADDRESS; Loop: UnarySALoop );
  832. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  833. VAR dim: SIZE;
  834. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  835. VAR len: SIZE; dinc: SIZE;
  836. BEGIN
  837. IF dim = loopd THEN
  838. Loop( right, dadr, loopdi, looplen );
  839. IF conservative THEN INC( glen, looplen ) END;
  840. ELSE
  841. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  842. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  843. END;
  844. END Traverse;
  845. BEGIN
  846. dim := GetDim( dest );
  847. IF debug THEN Report( "AS: dest", dest ); END;
  848. (* check pattern: longest piece that can be done with a loop *)
  849. IF conservative THEN glen := 0 END;
  850. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  851. IF conservative THEN
  852. looplen := 1;
  853. WHILE (dim > 0) DO
  854. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  855. END;
  856. ASSERT( looplen = glen );
  857. END;
  858. END ApplyUnarySAOp;
  859. (** apply binary operator : array x array -> array *)
  860. PROCEDURE ApplyBinaryAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  861. Loop: BinaryAAALoop );
  862. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  863. origdest: SIZE; modes: SET; dim: SIZE;
  864. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  865. VAR len: SIZE; linc, rinc, dinc: SIZE;
  866. BEGIN
  867. IF dim = loopd THEN
  868. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  869. IF conservative THEN INC( glen, looplen ) END;
  870. ELSE
  871. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  872. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  873. WHILE (len > 0) DO
  874. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  875. INC( dadr, dinc ); DEC( len );
  876. END;
  877. END;
  878. END Traverse;
  879. BEGIN
  880. dim := GetDim( left );
  881. (* allocate destination, if necessary *)
  882. IF ~SameShape( left, right ) THEN
  883. Halt( GeometryMismatch, left, right, 0 )
  884. END;
  885. origdest := 0; modes := {up, down};
  886. IF ~AllocateSameT( dest, left, elementSize ) THEN
  887. CopyUpCompatible( dest, left, modes );
  888. CopyUpCompatible( dest, right, modes );
  889. IF up IN modes THEN (* nothing to be done *)
  890. ELSIF down IN modes THEN
  891. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  892. ELSE
  893. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  894. END;
  895. END;
  896. (* debugging *)
  897. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  898. (* check pattern: longest piece that can be done with a loop *)
  899. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  900. (* run through dimensions *)
  901. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  902. IF up IN modes THEN (* nothing to be done *)
  903. ELSIF down IN modes THEN
  904. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  905. ELSE CopyContent( origdest, dest, elementSize );
  906. END;
  907. END ApplyBinaryAAAOp;
  908. (** apply binary operator: array x scalar -> array *)
  909. PROCEDURE ApplyBinaryASAOp( VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; right: ADDRESS;
  910. elementSize: SIZE;
  911. Loop: BinaryASALoop );
  912. VAR loopd, looplen, loopli, loopdi: SIZE; glen: SIZE;
  913. origdest: SIZE; modes: SET; dim: SIZE;
  914. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  915. VAR len: SIZE; linc, dinc: SIZE;
  916. BEGIN
  917. IF dim = loopd THEN
  918. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  919. IF conservative THEN INC( glen, looplen ) END;
  920. ELSE
  921. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  922. dinc := GetIncr( dest, dim ); INC( dim );
  923. WHILE (len > 0) DO
  924. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  925. DEC( len );
  926. END;
  927. END;
  928. END Traverse;
  929. BEGIN
  930. dim := GetDim( left );
  931. (* allocate destination, if necessary *)
  932. origdest := 0; modes := {up, down};
  933. IF ~AllocateSameT( dest, left, elementSize ) THEN
  934. CopyUpCompatible( dest, left, modes );
  935. IF up IN modes THEN (* nothing to be done *)
  936. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  937. ELSE origdest := dest; HALT(100); (*p := AllocateTemp( dest, origdest, elementSize );*)
  938. END;
  939. END;
  940. (* debugging *)
  941. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  942. (* check pattern: longest piece that can be done with a loop *)
  943. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  944. (* run through dimensions *)
  945. IF conservative THEN glen := 0 END;
  946. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  947. IF conservative THEN
  948. looplen := 1;
  949. WHILE (dim > 0) DO
  950. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  951. END;
  952. ASSERT( looplen = glen );
  953. END;
  954. IF up IN modes THEN (* nothing to be done *)
  955. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  956. ELSE CopyContent( origdest, dest, elementSize );
  957. END;
  958. END ApplyBinaryASAOp;
  959. (** apply binary operator: array x array -> scalar *)
  960. PROCEDURE ApplyBinaryAASOp( dest: ADDRESS; CONST left, right: UnsafeArrayT; Loop: BinaryAASLoop );
  961. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  962. dim: SIZE;
  963. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  964. VAR len: SIZE; linc, rinc: SIZE;
  965. BEGIN
  966. IF dim = loopd THEN
  967. Loop( ladr, radr, dest, loopli, loopri, looplen );
  968. IF conservative THEN INC( glen, looplen ) END;
  969. ELSE
  970. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  971. rinc := GetIncr( right, dim ); INC( dim );
  972. WHILE (len > 0) DO
  973. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  974. DEC( len );
  975. END;
  976. END;
  977. END Traverse;
  978. BEGIN
  979. dim := GetDim( left );
  980. (* check array lengths *)
  981. IF ~SameShape( left, right ) THEN
  982. Halt( GeometryMismatch, left, right, 0 )
  983. END;
  984. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  985. (* check pattern: longest piece that can be done with a loop *)
  986. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  987. (* run through dimensions *)
  988. IF conservative THEN glen := 0 END;
  989. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  990. IF conservative THEN
  991. looplen := 1;
  992. WHILE (dim > 0) DO
  993. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  994. END;
  995. ASSERT( looplen = glen );
  996. END;
  997. END ApplyBinaryAASOp;
  998. (** special binary operator: array x array -> boolean *)
  999. PROCEDURE ApplyBinaryAABOp( CONST left, right: UnsafeArrayT;
  1000. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1001. VAR loopd, looplen, loopli, loopri: SIZE; dim: SIZE;
  1002. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1003. VAR len: SIZE; linc, rinc: SIZE;
  1004. BEGIN
  1005. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1006. ELSE
  1007. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1008. rinc := GetIncr( right, dim ); INC( dim );
  1009. WHILE (len > 0) DO
  1010. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1011. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1012. END;
  1013. RETURN TRUE;
  1014. END;
  1015. END Traverse;
  1016. BEGIN
  1017. dim := GetDim( left );
  1018. (* check array lengths *)
  1019. IF ~SameShape( left, right ) THEN
  1020. RETURN geometryMismatchDefault
  1021. END;
  1022. (* is destination already allocated? (might be a temporary result) *)
  1023. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1024. (* check pattern: longest piece that can be done with a loop *)
  1025. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1026. (* run through dimensions *)
  1027. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1028. END ApplyBinaryAABOp;
  1029. (** special binary operator: array x scalar -> boolean *)
  1030. PROCEDURE ApplyBinaryASBOp( CONST left: UnsafeArrayT; right: ADDRESS;
  1031. Loop: BinaryASBLoop ): BOOLEAN;
  1032. VAR loopd, looplen, loopli: SIZE; dim: SIZE;
  1033. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1034. VAR len: SIZE; linc: SIZE;
  1035. BEGIN
  1036. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1037. ELSE
  1038. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1039. WHILE (len > 0) DO
  1040. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1041. INC( ladr, linc ); DEC( len );
  1042. END;
  1043. RETURN TRUE;
  1044. END;
  1045. END Traverse;
  1046. BEGIN
  1047. dim := GetDim( left );
  1048. IF debug THEN Report( "AAB:left", left ); END;
  1049. (* check pattern: longest piece that can be done with a loop *)
  1050. FindPattern1( left, dim, loopd, looplen, loopli );
  1051. (* run through dimensions *)
  1052. RETURN Traverse( 0, GetAdr( left ) );
  1053. END ApplyBinaryASBOp;
  1054. (**** operators *)
  1055. (*** copy *)
  1056. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1057. BEGIN
  1058. WHILE len > 0 DO
  1059. SYSTEM.PUT32(dadr, SYSTEM.GET32(ladr));
  1060. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1061. END;
  1062. (*CODE {SYSTEM.i386}
  1063. MOV ECX, [EBP+ladr] ; ECX := ladr
  1064. MOV EDX, [EBP+dadr] ; EDX := dadr
  1065. MOV EBX, [EBP+len] ; EBX := len
  1066. start:
  1067. CMP EBX, 0 ;
  1068. JLE end ; WHILE EBX > 0 DO
  1069. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1070. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1071. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1072. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1073. DEC EBX ; DEC(EBX)
  1074. JMP start
  1075. end:*)
  1076. END Copy4;
  1077. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1078. BEGIN
  1079. WHILE len > 0 DO
  1080. SYSTEM.PUT16(dadr, SYSTEM.GET16(ladr));
  1081. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1082. END;
  1083. (*CODE {SYSTEM.i386}
  1084. MOV ECX, [EBP+ladr] ; ECX := ladr
  1085. MOV EDX, [EBP+dadr] ; EDX := dadr
  1086. MOV EBX, [EBP+len] ; EBX := len
  1087. start:
  1088. CMP EBX, 0 ;
  1089. JLE end ; WHILE EBX > 0 DO
  1090. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1091. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1092. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1093. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1094. DEC EBX ; DEC(EBX)
  1095. JMP start
  1096. end:*)
  1097. END Copy2;
  1098. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1099. BEGIN
  1100. WHILE len > 0 DO
  1101. SYSTEM.PUT8(dadr, SYSTEM.GET8(ladr));
  1102. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1103. END;
  1104. (*CODE {SYSTEM.i386}
  1105. MOV ECX, [EBP+ladr] ; ECX := ladr
  1106. MOV EDX, [EBP+dadr] ; EDX := dadr
  1107. MOV EBX, [EBP+len] ; EBX := len
  1108. start:
  1109. CMP EBX, 0 ;
  1110. JLE end ; WHILE EBX > 0 DO
  1111. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1112. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1113. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1114. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1115. DEC EBX ; DEC(EBX)
  1116. JMP start
  1117. end:*)
  1118. END Copy1;
  1119. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1120. BEGIN
  1121. WHILE len > 0 DO
  1122. SYSTEM.PUT64(dadr, SYSTEM.GET64(ladr));
  1123. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1124. END;
  1125. (*CODE {SYSTEM.i386}
  1126. MOV ECX, [EBP+ladr] ; ECX := ladr
  1127. MOV EDX, [EBP+dadr] ; EDX := dadr
  1128. MOV EBX, [EBP+len] ; EBX := len
  1129. start:
  1130. CMP EBX, 0 ;
  1131. JLE end ; WHILE EBX > 0 DO
  1132. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1133. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1134. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1135. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1136. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1137. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1138. DEC EBX ; DEC(EBX)
  1139. JMP start
  1140. end:*)
  1141. END Copy8;
  1142. PROCEDURE (*-*)MoveB*( srcadr, destadr, len: SIZE );
  1143. BEGIN
  1144. IF (srcadr >= destadr) OR (srcadr+len >= destadr) THEN
  1145. SYSTEM.MOVE(srcadr, destadr, len);
  1146. ELSE
  1147. INC(srcadr,len-1); INC(destadr,len-1);
  1148. WHILE len > 0 DO
  1149. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1150. DEC(srcadr); DEC(destadr); DEC(len);
  1151. END;
  1152. END;
  1153. (**
  1154. (** Correct move if overlap, might be important for some array operations,
  1155. do not use SYSTEM.MOVE. *)
  1156. CODE {SYSTEM.i386}
  1157. MOV ECX, [ESP] ; len
  1158. MOV EDI, [ESP+4] ; destadr
  1159. MOV ESI, [ESP+8] ; srcadr
  1160. CMP ESI, EDI
  1161. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1162. MOV EAX, ESI
  1163. ADD EAX, ECX
  1164. CMP EAX, EDI
  1165. JBE moveup ; no overlap, no problem, move up
  1166. MOV ESI, EAX
  1167. ADD EDI, ECX
  1168. DEC ESI
  1169. DEC EDI
  1170. STD ; move down since overlap occured
  1171. REP
  1172. MOVSB
  1173. JMP done
  1174. moveup:
  1175. CLD
  1176. MOV BL, CL
  1177. SHR ECX, 2
  1178. AND BL, 00000003H ; rest to move after 4 byte move
  1179. REP
  1180. MOVSD ; move 4 bytes each step
  1181. MOV CL, BL
  1182. REP
  1183. MOVSB ; move rest in one byte steps
  1184. done:
  1185. ADD ESP, 12 ; adjust stack pointer(inline procedure!)*)
  1186. END MoveB;
  1187. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1188. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1189. origdest: ADDRESS; modes: SET; dim: SIZE;
  1190. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1191. BEGIN
  1192. IF (dinc = elementSize) & (linc = elementSize) THEN
  1193. MoveB( ladr, dadr, len * elementSize );
  1194. (*
  1195. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1196. *)
  1197. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1198. len := len * elementSize;
  1199. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1200. ELSIF elementSize = 1 THEN
  1201. Copy1( ladr, dadr, linc, dinc, len );
  1202. (*
  1203. WHILE (len > 0) DO
  1204. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1205. END;
  1206. *)
  1207. ELSIF elementSize = 2 THEN
  1208. Copy2( ladr, dadr, linc, dinc, len );
  1209. (*
  1210. WHILE (len > 0) DO
  1211. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1212. END;
  1213. *)
  1214. ELSIF elementSize = 4 THEN
  1215. Copy4( ladr, dadr, linc, dinc, len );
  1216. (*
  1217. WHILE (len > 0) DO
  1218. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1219. END;
  1220. *)
  1221. ELSIF elementSize = 8 THEN
  1222. Copy8( ladr, dadr, linc, dinc, len );
  1223. (*
  1224. WHILE (len > 0) DO
  1225. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1226. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1227. INC( dadr, dinc );
  1228. END;
  1229. *)
  1230. ELSE (* SYSTEM.MOVE is expensive ! *)
  1231. WHILE (len > 0) DO
  1232. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1233. INC( dadr, dinc );
  1234. END;
  1235. END;
  1236. END Loop;
  1237. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1238. VAR len: SIZE; linc, dinc: SIZE;
  1239. BEGIN
  1240. IF dim = loopd THEN
  1241. Loop( ladr, dadr, loopli, loopdi, looplen );
  1242. IF conservative THEN INC( glen, looplen ) END;
  1243. ELSE
  1244. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1245. dinc := GetIncr( dest, dim ); INC( dim );
  1246. WHILE (len > 0) DO
  1247. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1248. DEC( len );
  1249. END;
  1250. END;
  1251. END Traverse;
  1252. BEGIN
  1253. dim := GetDim( src );
  1254. origdest := 0; modes := {up, down}; (* copy modes *)
  1255. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1256. CopyUpCompatible( dest, src, modes );
  1257. IF up IN modes THEN (* nothing to be done *)
  1258. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1259. Reverse( src, dim ); Reverse( dest, dim )
  1260. ELSE (* can only copy via double buffer *)
  1261. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1262. END;
  1263. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1264. END;
  1265. (* check pattern: longest piece that can be done with a loop *)
  1266. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1267. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1268. IF up IN modes THEN (* nothing to be done *)
  1269. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1270. ELSE CopyContent( origdest, dest, elementSize );
  1271. END;
  1272. END CopyContent;
  1273. PROCEDURE AllocateSameT( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  1274. VAR data: ANY; Size: SIZE;
  1275. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1276. PROCEDURE NewData;
  1277. VAR dim, len, size: SIZE;
  1278. BEGIN
  1279. dim := GetDim( src ); size := elementsize;
  1280. PutDim( dest, dim );
  1281. PutSize( dest, elementsize );
  1282. WHILE (dim > 0) DO
  1283. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1284. PutInc( dest, dim, size ); size := size * len;
  1285. END;
  1286. SYSTEM.NEW( data, size + ArrayAlignment);
  1287. PutAdr( dest, Align(data));
  1288. PutPtr( dest, data );
  1289. END NewData;
  1290. BEGIN
  1291. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1292. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1293. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1294. dest := GetArrayDesc( GetDim( src ) );
  1295. PutFlags(dest, {TensorFlag});
  1296. NewData();
  1297. RETURN TRUE;
  1298. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1299. (* check if re-allocation of descriptor is allowed *)
  1300. IF ~(TensorFlag IN GetFlags( dest )) &
  1301. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1302. HALT( 100 );
  1303. END;
  1304. dest := GetArrayDesc( GetDim( src ) );
  1305. PutFlags(dest, {TensorFlag});
  1306. NewData();
  1307. RETURN TRUE;
  1308. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1309. (* check if re-allocation of array data is allowed *)
  1310. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1311. HALT( 100 );
  1312. END;
  1313. NewData();
  1314. RETURN TRUE;
  1315. ELSE (* nothing to do *)
  1316. RETURN FALSE;
  1317. END;
  1318. END AllocateSameT;
  1319. PROCEDURE Assign*(VAR dest: ADDRESS; src: ADDRESS);
  1320. VAR oldDest: ADDRESS;
  1321. BEGIN
  1322. IF (dest # NIL) THEN
  1323. IF (TensorFlag IN GetFlags( dest )) THEN (* old heap pointer overwritten *)
  1324. oldDest := dest;
  1325. Heaps.Assign(dest, src);
  1326. (*TRACE(Heaps.RefCount(oldDest)); *)
  1327. ELSE
  1328. (*
  1329. Heaps.ResetMathArray(dest);
  1330. *)
  1331. dest := src;
  1332. END;
  1333. ELSE
  1334. (* Heaps.Refer(src);*)
  1335. dest := src;
  1336. END;
  1337. END Assign;
  1338. PROCEDURE TempDescCopy( CONST src: UnsafeArrayT ): UnsafeArrayT;
  1339. VAR dest: UnsafeArrayT; adr: ADDRESS;dim: SIZE;
  1340. BEGIN
  1341. dim := GetDim(src);
  1342. dest := GetArrayDesc(dim);
  1343. SYSTEM.MOVE( src, dest, dim * SIZEOF(LenInc) + MathLenOffset );
  1344. dest.adr := NIL;
  1345. SYSTEM.PUT(ADDRESS OF dest.ptr, NIL); (* no refcounting here ! *)
  1346. PutFlags( dest, {} );
  1347. RETURN dest;
  1348. END TempDescCopy;
  1349. (* used when arrays are passed by value *)
  1350. PROCEDURE CopyArraySelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1351. VAR p: UnsafeArrayT;
  1352. BEGIN
  1353. ASSERT( src = dest );
  1354. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1355. CopyArray( dest, p, elementsize );
  1356. END CopyArraySelf;
  1357. PROCEDURE CopyArray*( dest: UnsafeArray (* untraced! *); CONST src: UnsafeArrayT; elementsize: SIZE );
  1358. VAR srcdim, destdim: SIZE;
  1359. BEGIN
  1360. ASSERT(dest # NIL); (* only possible by compiler error *)
  1361. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1362. srcdim := GetDim(src);
  1363. destdim := GetDim(dest);
  1364. (*
  1365. Debugging.Stack("copy array");
  1366. *)
  1367. Report( "copy array source", src ); Report( "copy array des", dest );
  1368. HALT(100);
  1369. ELSIF src = dest THEN (* self copy *)
  1370. CopyArraySelf( dest, src, elementsize );
  1371. ELSE
  1372. IF AllocateSameT( dest, src, elementsize ) THEN END;
  1373. CopyContent( dest, src, elementsize )
  1374. END;
  1375. END CopyArray;
  1376. PROCEDURE CopyTensorSelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1377. BEGIN
  1378. dest := NIL;
  1379. CopyTensor( dest, src, elementsize );
  1380. END CopyTensorSelf;
  1381. PROCEDURE CopyTensor*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT;
  1382. elementsize: SIZE );
  1383. BEGIN
  1384. (* Report("dest",dest); Report("src",src); *)
  1385. IF (src = NIL) THEN dest := NIL
  1386. ELSIF (dest = NIL) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1387. IF AllocateSameT( dest, src, elementsize ) THEN END; (* includes check if allocation is allowed *)
  1388. CopyContent( dest, src, elementsize );
  1389. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1390. ELSE CopyContent( dest, src, elementsize )
  1391. END;
  1392. END CopyTensor;
  1393. (* copy descriptor of src to that of dest. If not existent then create.*)
  1394. PROCEDURE ShallowCopy*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT);
  1395. VAR ptr: ANY; flags: SET;
  1396. PROCEDURE CopyDescriptor;
  1397. BEGIN
  1398. dest.ptr := src.ptr;(* GC! Must do before MOVE (NIL <- src.ptr), then copy redundant *)
  1399. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1400. END CopyDescriptor;
  1401. BEGIN
  1402. (*
  1403. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1404. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1405. *)
  1406. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1407. dest := GetArrayDesc( GetDim( src ) );
  1408. CopyDescriptor();
  1409. PutFlags(dest, {TensorFlag});
  1410. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1411. flags := GetFlags(dest);
  1412. (* check if re-allocation of descriptor is allowed *)
  1413. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1414. Halt(DimensionMismatch,src,0,dest);
  1415. END;
  1416. (* create a new descriptor!!! (added by Alexey) *)
  1417. dest := GetArrayDesc( GetDim( src ) );
  1418. CopyDescriptor();
  1419. PutFlags(dest, flags);
  1420. ELSE
  1421. flags := GetFlags(dest);
  1422. (* check if re-allocation of array data is allowed *)
  1423. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1424. Halt(AllocationForbidden,src,0,dest);
  1425. END;
  1426. CopyDescriptor();
  1427. PutFlags(dest, flags);
  1428. END;
  1429. END ShallowCopy;
  1430. (*
  1431. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1432. BEGIN
  1433. IF debug THEN
  1434. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1435. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1436. END;
  1437. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1438. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1439. END DescriptorCopy;
  1440. *)
  1441. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY {UNSAFE} [?]);
  1442. BEGIN
  1443. ShallowCopy(dest,src);
  1444. END ZeroCopy;
  1445. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1446. BEGIN
  1447. ZeroCopy(src, RESULT);
  1448. RETURN RESULT
  1449. END "ALIAS";
  1450. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1451. VAR dim: SIZE;
  1452. BEGIN
  1453. dim := GetDim( l );
  1454. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1455. WHILE (dim > 0) DO
  1456. DEC( dim );
  1457. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1458. END;
  1459. RETURN TRUE;
  1460. END SameShape;
  1461. (*
  1462. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1463. (*
  1464. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1465. check if deep copy can be avoided and if so then do a shallow copy
  1466. *)
  1467. BEGIN
  1468. ASSERT( dest # 0 ); (* impossible *)
  1469. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1470. HALT( 100 );
  1471. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1472. (* must copy (and allocate) *)
  1473. CopyArray( dest, src, elementsize );
  1474. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1475. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1476. ELSE CopyContent( dest, src, elementsize )
  1477. END;
  1478. ELSE DescriptorCopy( src, dest )
  1479. END;
  1480. END ZeroCopyArray;
  1481. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1482. (*
  1483. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1484. check if deep copy can be avoided and if so then do a shallow copy
  1485. *)
  1486. BEGIN
  1487. IF debug THEN
  1488. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1489. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1490. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1491. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1492. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1493. END;
  1494. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1495. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1496. ELSE
  1497. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1498. END;
  1499. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1500. (* must copy (and allocate) *)
  1501. CopyTensor( dest, src, elementsize );
  1502. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1503. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1504. ELSE
  1505. HALT( 100 ); (* copy forbidden *)
  1506. END;
  1507. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1508. DescriptorCopy( src, dest );
  1509. ELSE
  1510. HALT( 100 ); (* different shapes: not allowed *)
  1511. END;
  1512. END ZeroCopyTensor;
  1513. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1514. VAR i: LONGINT;
  1515. BEGIN
  1516. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1517. CopyContent( dest, left, elementSize )
  1518. ELSE
  1519. IF debug THEN
  1520. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1521. KernelLog.Ln;
  1522. END;
  1523. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1524. FOR i := 0 TO dim - 1 DO
  1525. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1526. END;
  1527. END;
  1528. END ZeroCopy;
  1529. *)
  1530. (*** conversions ****)
  1531. (** SHORTINT -> INTEGER *)
  1532. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1533. BEGIN
  1534. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1535. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1536. DEC( len );
  1537. END;
  1538. END ConvertASAILoop;
  1539. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1540. BEGIN
  1541. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1542. RETURN RESULT
  1543. END "@Convert";
  1544. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1545. BEGIN
  1546. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1547. RETURN RESULT
  1548. END "LONG";
  1549. (** SHORTINT -> LONGINT *)
  1550. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1551. BEGIN
  1552. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1553. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1554. DEC( len );
  1555. END;
  1556. END ConvertLoopSL;
  1557. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF LONGINT;
  1558. BEGIN
  1559. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopSL );
  1560. RETURN RESULT
  1561. END "@Convert";
  1562. (** SHORTINT -> REAL *)
  1563. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1564. VAR lval: SHORTINT; dval: REAL;
  1565. BEGIN
  1566. WHILE (len > 0) DO
  1567. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1568. INC( dadr, dinc ); DEC( len );
  1569. END;
  1570. END ConvertLoopSR;
  1571. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF REAL;
  1572. BEGIN
  1573. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopSR );
  1574. RETURN RESULT
  1575. END "@Convert";
  1576. (** SHORTINT -> LONGREAL *)
  1577. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1578. VAR lval: SHORTINT; dval: LONGREAL;
  1579. BEGIN
  1580. WHILE (len > 0) DO
  1581. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1582. INC( dadr, dinc ); DEC( len );
  1583. END;
  1584. END ConvertLoopSX;
  1585. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1586. BEGIN
  1587. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopSX );
  1588. RETURN RESULT
  1589. END "@Convert";
  1590. (** INTEGER -> SHORTINT (SHORT) *)
  1591. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1592. VAR lval: INTEGER; dval: SHORTINT;
  1593. BEGIN
  1594. WHILE (len > 0) DO
  1595. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1596. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1597. END;
  1598. END ConvertLoopIS;
  1599. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1600. BEGIN
  1601. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1602. RETURN RESULT
  1603. END "@Convert";
  1604. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1605. BEGIN
  1606. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1607. RETURN RESULT
  1608. END "SHORT";
  1609. (** INTEGER -> LONGINT *)
  1610. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1611. BEGIN
  1612. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1613. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1614. DEC( len );
  1615. END;
  1616. END ConvertLoopIL;
  1617. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1618. BEGIN
  1619. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1620. RETURN RESULT
  1621. END "@Convert";
  1622. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1623. BEGIN
  1624. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1625. RETURN RESULT
  1626. END "LONG";
  1627. (** INTEGER -> REAL *)
  1628. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1629. VAR lval: INTEGER; dval: REAL;
  1630. BEGIN
  1631. WHILE (len > 0) DO
  1632. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1633. INC( dadr, dinc ); DEC( len );
  1634. END;
  1635. END ConvertLoopIR;
  1636. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1637. BEGIN
  1638. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopIR );
  1639. RETURN RESULT
  1640. END "@Convert";
  1641. (** INTEGER -> LONGREAL *)
  1642. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1643. VAR lval: INTEGER; dval: LONGREAL;
  1644. BEGIN
  1645. WHILE (len > 0) DO
  1646. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1647. INC( dadr, dinc ); DEC( len );
  1648. END;
  1649. END ConvertLoopIX;
  1650. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1651. BEGIN
  1652. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopIX );
  1653. RETURN RESULT
  1654. END "@Convert";
  1655. (** LONGINT -> INTEGER (SHORT) *)
  1656. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1657. VAR lval: LONGINT; dval: INTEGER;
  1658. BEGIN
  1659. WHILE (len > 0) DO
  1660. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1661. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1662. END;
  1663. END ConvertLoopLI;
  1664. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1665. BEGIN
  1666. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1667. RETURN RESULT
  1668. END "@Convert";
  1669. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1670. BEGIN
  1671. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1672. RETURN RESULT
  1673. END "SHORT";
  1674. (** LONGINT -> REAL *)
  1675. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1676. VAR lval: LONGINT; dval: REAL;
  1677. BEGIN
  1678. WHILE (len > 0) DO
  1679. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1680. INC( dadr, dinc ); DEC( len );
  1681. END;
  1682. END ConvertLoopLR;
  1683. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1684. BEGIN
  1685. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopLR );
  1686. RETURN RESULT
  1687. END "@Convert";
  1688. (** LONGINT -> LONGREAL *)
  1689. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1690. VAR lval: LONGINT; dval: LONGREAL;
  1691. BEGIN
  1692. WHILE (len > 0) DO
  1693. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1694. INC( dadr, dinc ); DEC( len );
  1695. END;
  1696. END ConvertLoopLX;
  1697. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1698. BEGIN
  1699. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopLX );
  1700. RETURN RESULT
  1701. END "@Convert";
  1702. (** REAL -> LONGINT (ENTIER) *)
  1703. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1704. VAR lval: REAL; dval: LONGINT;
  1705. BEGIN
  1706. WHILE (len > 0) DO
  1707. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1708. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1709. END;
  1710. END ConvertLoopRL;
  1711. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1712. BEGIN
  1713. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1714. RETURN RESULT
  1715. END "@Convert";
  1716. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1717. BEGIN
  1718. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1719. RETURN RESULT
  1720. END "ENTIER";
  1721. (** REAL -> LONGREAL *)
  1722. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1723. VAR lval: REAL; dval: LONGREAL;
  1724. BEGIN
  1725. WHILE (len > 0) DO
  1726. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1727. INC( dadr, dinc ); DEC( len );
  1728. END;
  1729. END ConvertLoopRX;
  1730. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1731. BEGIN
  1732. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1733. RETURN RESULT
  1734. END "@Convert";
  1735. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1736. BEGIN
  1737. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1738. RETURN RESULT
  1739. END "LONG";
  1740. (** LONGREAL -> REAL (SHORT) *)
  1741. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1742. VAR lval: LONGREAL; dval: REAL;
  1743. BEGIN
  1744. WHILE (len > 0) DO
  1745. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1746. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1747. END;
  1748. END ConvertLoopXR;
  1749. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1750. BEGIN
  1751. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1752. RETURN RESULT
  1753. END "@Convert";
  1754. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1755. BEGIN
  1756. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1757. RETURN RESULT
  1758. END "SHORT";
  1759. (** LONGREAL -> LONGINT (ENTIER) *)
  1760. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1761. VAR lval: LONGREAL; dval: LONGINT;
  1762. BEGIN
  1763. WHILE (len > 0) DO
  1764. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1765. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1766. END;
  1767. END ConvertLoopXL;
  1768. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1769. BEGIN
  1770. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1771. RETURN RESULT
  1772. END "@Convert";
  1773. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1774. BEGIN
  1775. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1776. RETURN RESULT
  1777. END "ENTIER";
  1778. (** SIZES **)
  1779. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1780. VAR lval: LONGINT; dval: SIZE;
  1781. BEGIN
  1782. WHILE (len > 0) DO
  1783. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1784. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1785. END;
  1786. END ConvertLoopLY;
  1787. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1788. BEGIN
  1789. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), ConvertLoopLY );
  1790. RETURN RESULT
  1791. END "@Convert";
  1792. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1793. VAR lval: SIZE; dval: LONGREAL;
  1794. BEGIN
  1795. WHILE (len > 0) DO
  1796. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1797. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1798. END;
  1799. END ConvertLoopYZ;
  1800. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1801. BEGIN
  1802. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopYZ );
  1803. RETURN RESULT
  1804. END "@Convert";
  1805. PROCEDURE ConvertLoopYR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1806. VAR lval: SIZE; dval: REAL;
  1807. BEGIN
  1808. WHILE (len > 0) DO
  1809. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1810. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1811. END;
  1812. END ConvertLoopYR;
  1813. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1814. BEGIN
  1815. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopYR );
  1816. RETURN RESULT
  1817. END "@Convert";
  1818. (*** monadic not A -> ~A ********************************************************************)
  1819. (** BOOLEAN *)
  1820. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1821. VAR lval: BOOLEAN;
  1822. BEGIN
  1823. WHILE (len > 0) DO
  1824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1825. DEC( len );
  1826. END;
  1827. END NotLoopAB;
  1828. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  1829. BEGIN
  1830. ApplyUnaryAAOp(RESULT, src,SIZEOF( BOOLEAN ), NotLoopAB );
  1831. RETURN RESULT
  1832. END "~";
  1833. (*** monadic generic (A) -> -A ********************************************************************)
  1834. (** SHORTINT *)
  1835. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1836. VAR lval: SHORTINT;
  1837. BEGIN
  1838. WHILE (len > 0) DO
  1839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1840. DEC( len );
  1841. END;
  1842. END GenericLoopS;
  1843. (** INTEGER *)
  1844. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1845. VAR lval: INTEGER;
  1846. BEGIN
  1847. WHILE (len > 0) DO
  1848. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1849. DEC( len );
  1850. END;
  1851. END GenericLoopI;
  1852. (** LONGINT *)
  1853. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1854. VAR lval: LONGINT;
  1855. BEGIN
  1856. WHILE (len > 0) DO
  1857. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1858. DEC( len );
  1859. END;
  1860. END GenericLoopL;
  1861. (** HUGEINT *)
  1862. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1863. VAR lval: HUGEINT;
  1864. BEGIN
  1865. WHILE (len > 0) DO
  1866. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1867. DEC( len );
  1868. END;
  1869. END GenericLoopH;
  1870. (** REAL *)
  1871. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1872. VAR lval: REAL;
  1873. BEGIN
  1874. WHILE (len > 0) DO
  1875. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1876. DEC( len );
  1877. END;
  1878. END GenericLoopR;
  1879. (** LONGREAL *)
  1880. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1881. VAR lval: LONGREAL;
  1882. BEGIN
  1883. WHILE (len > 0) DO
  1884. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1885. DEC( len );
  1886. END;
  1887. END GenericLoopX;
  1888. (** COMPLEX *)
  1889. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1890. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1891. BEGIN
  1892. WHILE (len > 0) DO
  1893. lval := ladr;
  1894. dval := dadr;
  1895. dval.val := op(lval.val);
  1896. INC( ladr, linc ); INC( dadr, dinc );
  1897. DEC( len );
  1898. END;
  1899. END GenericLoopZ;
  1900. (** LONGCOMPLEX *)
  1901. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1902. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1903. BEGIN
  1904. WHILE (len > 0) DO
  1905. lval := ladr;
  1906. dval := dadr;
  1907. dval.val := op (lval.val);
  1908. INC( ladr, linc ); INC( dadr, dinc );
  1909. DEC( len );
  1910. END;
  1911. END GenericLoopLZ;
  1912. (*** monadic minus A -> -A ********************************************************************)
  1913. (** SHORTINT *)
  1914. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1915. VAR lval: SHORTINT;
  1916. BEGIN
  1917. WHILE (len > 0) DO
  1918. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1919. DEC( len );
  1920. END;
  1921. END MinusLoopS;
  1922. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1923. BEGIN
  1924. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), MinusLoopS );
  1925. RETURN RESULT
  1926. END "-";
  1927. (** INTEGER *)
  1928. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1929. VAR lval: INTEGER;
  1930. BEGIN
  1931. WHILE (len > 0) DO
  1932. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1933. DEC( len );
  1934. END;
  1935. END MinusLoopI;
  1936. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1937. BEGIN
  1938. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), MinusLoopI );
  1939. RETURN RESULT
  1940. END "-";
  1941. (** LONGINT *)
  1942. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1943. VAR lval: LONGINT;
  1944. BEGIN
  1945. WHILE (len > 0) DO
  1946. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1947. DEC( len );
  1948. END;
  1949. END MinusLoopL;
  1950. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1951. BEGIN
  1952. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), MinusLoopL );
  1953. RETURN RESULT
  1954. END "-";
  1955. (** SIZE *)
  1956. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1957. VAR lval: SIZE;
  1958. BEGIN
  1959. WHILE (len > 0) DO
  1960. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1961. DEC( len );
  1962. END;
  1963. END MinusLoopY;
  1964. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1965. BEGIN
  1966. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), MinusLoopY );
  1967. RETURN RESULT
  1968. END "-";
  1969. (** REAL *)
  1970. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1971. VAR lval: REAL;
  1972. BEGIN
  1973. WHILE (len > 0) DO
  1974. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1975. DEC( len );
  1976. END;
  1977. END MinusLoopR;
  1978. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  1979. BEGIN
  1980. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1981. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), MinusLoopR );
  1982. RETURN RESULT
  1983. END "-";
  1984. (** LONGREAL *)
  1985. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1986. VAR lval: LONGREAL;
  1987. BEGIN
  1988. WHILE (len > 0) DO
  1989. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1990. DEC( len );
  1991. END;
  1992. END MinusLoopX;
  1993. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1994. BEGIN
  1995. ApplyUnaryAAOp(RESULT, src, SIZEOF( LONGREAL ),
  1996. MinusLoopX );
  1997. RETURN RESULT
  1998. END "-";
  1999. (*** add array + array -> array ********************************************************************)
  2000. (** SHORTINT *)
  2001. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2002. VAR lval, rval: SHORTINT;
  2003. BEGIN
  2004. WHILE (len > 0) DO
  2005. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2006. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2007. END;
  2008. END AddASASLoop;
  2009. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2010. BEGIN
  2011. ApplyBinaryAAAOp( RESULT, left, right,
  2012. SIZEOF( SHORTINT ), AddASASLoop );
  2013. RETURN RESULT
  2014. END "+";
  2015. (** INTEGER *)
  2016. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2017. VAR lval, rval: INTEGER;
  2018. BEGIN
  2019. WHILE (len > 0) DO
  2020. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2021. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2022. END;
  2023. END AddAIAILoop;
  2024. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2025. BEGIN
  2026. ApplyBinaryAAAOp( RESULT, left, right,
  2027. SIZEOF( INTEGER ), AddAIAILoop );
  2028. RETURN RESULT
  2029. END "+";
  2030. (** LONGINT *)
  2031. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2032. VAR lval, rval: LONGINT;
  2033. BEGIN
  2034. WHILE (len > 0) DO
  2035. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2036. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2037. END;
  2038. END AddALALLoop;
  2039. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2040. BEGIN
  2041. ApplyBinaryAAAOp( RESULT, left, right,
  2042. SIZEOF( LONGINT ), AddALALLoop );
  2043. RETURN RESULT
  2044. END "+";
  2045. (** REAL *)
  2046. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2047. VAR lval, rval: REAL;
  2048. BEGIN
  2049. WHILE (len > 0) DO
  2050. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2051. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2052. END;
  2053. END AddARARLoop;
  2054. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2055. BEGIN
  2056. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2057. loopAddARAR );
  2058. RETURN RESULT
  2059. END "+";
  2060. (** LONGREAL *)
  2061. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2062. VAR lval, rval: LONGREAL;
  2063. BEGIN
  2064. WHILE (len > 0) DO
  2065. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2066. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2067. END;
  2068. END AddAXAXLoop;
  2069. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2070. BEGIN
  2071. ApplyBinaryAAAOp( RESULT, left, right,
  2072. SIZEOF( LONGREAL ), loopAddAXAX );
  2073. RETURN RESULT
  2074. END "+";
  2075. (** COMPLEX *)
  2076. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2077. VAR lval, rval: COMPLEX;
  2078. BEGIN
  2079. WHILE (len > 0) DO
  2080. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2081. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2082. END;
  2083. END AddAZAZLoop;
  2084. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2085. BEGIN
  2086. ApplyBinaryAAAOp( RESULT, left, right,
  2087. SIZEOF( COMPLEX ), loopAddAZAZ );
  2088. RETURN RESULT
  2089. END "+";
  2090. (** HUGEINT *)
  2091. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2092. VAR lval, rval: HUGEINT;
  2093. BEGIN
  2094. WHILE (len > 0) DO
  2095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2096. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2097. END;
  2098. END AddAHAHLoop;
  2099. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT;
  2100. BEGIN
  2101. ApplyBinaryAAAOp( RESULT, left, right,
  2102. SIZEOF( HUGEINT ), AddAHAHLoop);
  2103. RETURN RESULT
  2104. END "+";
  2105. (** SIZE *)
  2106. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2107. VAR lval, rval: SIZE;
  2108. BEGIN
  2109. WHILE (len > 0) DO
  2110. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2111. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2112. END;
  2113. END AddAYAYLoop;
  2114. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2115. BEGIN
  2116. ApplyBinaryAAAOp( RESULT, left, right,
  2117. SIZEOF( SIZE ), AddAYAYLoop);
  2118. RETURN RESULT
  2119. END "+";
  2120. (** LONGCOMPLEX *)
  2121. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2122. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2123. BEGIN
  2124. WHILE (len > 0) DO
  2125. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2126. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2127. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2128. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2129. DEC( len );
  2130. END;
  2131. END AddALZALZLoop;
  2132. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2133. BEGIN
  2134. ApplyBinaryAAAOp( RESULT, left, right,
  2135. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2136. RETURN RESULT
  2137. END "+";
  2138. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2139. (** SHORTINT *)
  2140. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2141. VAR lval, rval: SHORTINT;
  2142. BEGIN
  2143. SYSTEM.GET( radr, rval );
  2144. WHILE (len > 0) DO
  2145. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2146. INC( dadr, dinc ); DEC( len );
  2147. END;
  2148. END AddASSSLoop;
  2149. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2150. BEGIN
  2151. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2152. SIZEOF( SHORTINT ), AddASSSLoop );
  2153. RETURN RESULT
  2154. END "+";
  2155. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2156. BEGIN
  2157. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2158. SIZEOF( SHORTINT ), AddASSSLoop );
  2159. RETURN RESULT
  2160. END "+";
  2161. (** INTEGER *)
  2162. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2163. VAR lval, rval: INTEGER;
  2164. BEGIN
  2165. SYSTEM.GET( radr, rval );
  2166. WHILE (len > 0) DO
  2167. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2168. INC( dadr, dinc ); DEC( len );
  2169. END;
  2170. END AddAISILoop;
  2171. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2172. BEGIN
  2173. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2174. SIZEOF( INTEGER ), AddAISILoop );
  2175. RETURN RESULT
  2176. END "+";
  2177. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2178. BEGIN
  2179. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2180. SIZEOF( INTEGER ), AddAISILoop );
  2181. RETURN RESULT
  2182. END "+";
  2183. (** LONGINT *)
  2184. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2185. VAR lval, rval: LONGINT;
  2186. BEGIN
  2187. SYSTEM.GET( radr, rval );
  2188. WHILE (len > 0) DO
  2189. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2190. INC( dadr, dinc ); DEC( len );
  2191. END;
  2192. END AddALSLLoop;
  2193. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2194. BEGIN
  2195. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2196. SIZEOF( LONGINT ), AddALSLLoop );
  2197. RETURN RESULT
  2198. END "+";
  2199. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2200. BEGIN
  2201. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2202. SIZEOF( LONGINT ), AddALSLLoop );
  2203. RETURN RESULT
  2204. END "+";
  2205. (** REAL *)
  2206. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2207. VAR lval, rval: REAL;
  2208. BEGIN
  2209. SYSTEM.GET( radr, rval );
  2210. WHILE (len > 0) DO
  2211. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2212. INC( dadr, dinc ); DEC( len );
  2213. END;
  2214. END AddARSRLoop;
  2215. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2216. BEGIN
  2217. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2218. AddARSRLoop );
  2219. RETURN RESULT
  2220. END "+";
  2221. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2222. BEGIN
  2223. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2224. AddARSRLoop );
  2225. RETURN RESULT
  2226. END "+";
  2227. (** LONGREAL *)
  2228. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2229. VAR lval, rval: LONGREAL;
  2230. BEGIN
  2231. SYSTEM.GET( radr, rval );
  2232. WHILE (len > 0) DO
  2233. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2234. INC( dadr, dinc ); DEC( len );
  2235. END;
  2236. END AddAXSXLoop;
  2237. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2238. BEGIN
  2239. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2240. SIZEOF( LONGREAL ), AddAXSXLoop );
  2241. RETURN RESULT
  2242. END "+";
  2243. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2244. BEGIN
  2245. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2246. SIZEOF( LONGREAL ), AddAXSXLoop );
  2247. RETURN RESULT
  2248. END "+";
  2249. (** COMPLEX *)
  2250. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2251. VAR lval, rval: COMPLEX;
  2252. BEGIN
  2253. SYSTEM.GET( radr, rval );
  2254. WHILE (len > 0) DO
  2255. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2256. INC( dadr, dinc ); DEC( len );
  2257. END;
  2258. END AddAZSZLoop;
  2259. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2260. BEGIN
  2261. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2262. AddAZSZLoop );
  2263. RETURN RESULT
  2264. END "+";
  2265. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2266. BEGIN
  2267. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2268. AddAZSZLoop );
  2269. RETURN RESULT
  2270. END "+";
  2271. (** HUGEINT *)
  2272. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2273. VAR lval, rval: HUGEINT;
  2274. BEGIN
  2275. SYSTEM.GET( radr, rval );
  2276. WHILE (len > 0) DO
  2277. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2278. INC( dadr, dinc ); DEC( len );
  2279. END;
  2280. END AddAHSHLoop;
  2281. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2282. BEGIN
  2283. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2284. AddAHSHLoop );
  2285. RETURN RESULT
  2286. END "+";
  2287. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2288. BEGIN
  2289. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2290. AddAHSHLoop );
  2291. RETURN RESULT
  2292. END "+";
  2293. (** SIZE *)
  2294. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2295. VAR lval, rval: SIZE;
  2296. BEGIN
  2297. SYSTEM.GET( radr, rval );
  2298. WHILE (len > 0) DO
  2299. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2300. INC( dadr, dinc ); DEC( len );
  2301. END;
  2302. END AddAYSYLoop;
  2303. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2304. BEGIN
  2305. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( SIZE ),
  2306. AddAYSYLoop );
  2307. RETURN RESULT
  2308. END "+";
  2309. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2310. BEGIN
  2311. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( SIZE ),
  2312. AddAYSYLoop );
  2313. RETURN RESULT
  2314. END "+";
  2315. (** LONGCOMPLEX *)
  2316. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2317. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2318. BEGIN
  2319. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2320. WHILE (len > 0) DO
  2321. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2322. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2323. INC( ladr, linc );
  2324. INC( dadr, dinc ); DEC( len );
  2325. END;
  2326. END AddALZSLZLoop;
  2327. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2328. BEGIN
  2329. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2330. AddALZSLZLoop );
  2331. RETURN RESULT
  2332. END "+";
  2333. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2334. BEGIN
  2335. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2336. AddALZSLZLoop );
  2337. RETURN RESULT
  2338. END "+";
  2339. (*** subtraction array - array -> array ********************************************************************)
  2340. (** SHORTINT *)
  2341. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2342. VAR lval, rval: SHORTINT;
  2343. BEGIN
  2344. WHILE (len > 0) DO
  2345. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2346. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2347. END;
  2348. END SubASASLoop;
  2349. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2350. BEGIN
  2351. ApplyBinaryAAAOp( RESULT, left, right,
  2352. SIZEOF( SHORTINT ), SubASASLoop );
  2353. RETURN RESULT
  2354. END "-";
  2355. (** INTEGER *)
  2356. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2357. VAR lval, rval: INTEGER;
  2358. BEGIN
  2359. WHILE (len > 0) DO
  2360. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2361. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2362. END;
  2363. END SubAIAILoop;
  2364. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2365. BEGIN
  2366. ApplyBinaryAAAOp( RESULT, left, right,
  2367. SIZEOF( INTEGER ), SubAIAILoop );
  2368. RETURN RESULT
  2369. END "-";
  2370. (** LONGINT *)
  2371. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2372. VAR lval, rval: LONGINT;
  2373. BEGIN
  2374. WHILE (len > 0) DO
  2375. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2376. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2377. END;
  2378. END SubALALLoop;
  2379. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2380. BEGIN
  2381. ApplyBinaryAAAOp( RESULT, left, right,
  2382. SIZEOF( LONGINT ), SubALALLoop );
  2383. RETURN RESULT
  2384. END "-";
  2385. (** SIZE *)
  2386. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2387. VAR lval, rval: SIZE;
  2388. BEGIN
  2389. WHILE (len > 0) DO
  2390. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2391. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2392. END;
  2393. END SubAYAYLoop;
  2394. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2395. BEGIN
  2396. ApplyBinaryAAAOp( RESULT, left, right,
  2397. SIZEOF( SIZE ), SubAYAYLoop );
  2398. RETURN RESULT
  2399. END "-";
  2400. (** REAL *)
  2401. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2402. VAR lval, rval: REAL;
  2403. BEGIN
  2404. WHILE (len > 0) DO
  2405. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2406. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2407. END;
  2408. END SubARARLoop;
  2409. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2410. BEGIN
  2411. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2412. SubARARLoop );
  2413. RETURN RESULT
  2414. END "-";
  2415. (** LONGREAL *)
  2416. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2417. VAR lval, rval: LONGREAL;
  2418. BEGIN
  2419. WHILE (len > 0) DO
  2420. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2421. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2422. END;
  2423. END SubAXAXLoop;
  2424. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2425. BEGIN
  2426. ApplyBinaryAAAOp( RESULT, left, right,
  2427. SIZEOF( LONGREAL ), SubAXAXLoop );
  2428. RETURN RESULT
  2429. END "-";
  2430. (** COMPLEX *)
  2431. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2432. VAR lval, rval: COMPLEX;
  2433. BEGIN
  2434. WHILE (len > 0) DO
  2435. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2436. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2437. END;
  2438. END SubAZAZLoop;
  2439. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2440. BEGIN
  2441. ApplyBinaryAAAOp( RESULT, left, right,
  2442. SIZEOF( COMPLEX ), SubAZAZLoop );
  2443. RETURN RESULT
  2444. END "-";
  2445. (** LONGCOMPLEX *)
  2446. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2447. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2448. BEGIN
  2449. WHILE (len > 0) DO
  2450. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2451. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2452. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2453. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2454. DEC( len );
  2455. END;
  2456. END SubALZALZLoop;
  2457. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2458. BEGIN
  2459. ApplyBinaryAAAOp( RESULT, left, right,
  2460. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2461. RETURN RESULT
  2462. END "-";
  2463. (*** subtraction array-scalar -> array ********************************************************************)
  2464. (** SHORTINT *)
  2465. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2466. BEGIN
  2467. RESULT := left + (-right);
  2468. RETURN RESULT
  2469. END "-";
  2470. (** INTEGER *)
  2471. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2472. BEGIN
  2473. RESULT := left + (-right);
  2474. RETURN RESULT
  2475. END "-";
  2476. (** LONGINT *)
  2477. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2478. BEGIN
  2479. RESULT := left + (-right);
  2480. RETURN RESULT
  2481. END "-";
  2482. (** LONGINT *)
  2483. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2484. BEGIN
  2485. RESULT := left + (-right);
  2486. RETURN RESULT
  2487. END "-";
  2488. (** REAL *)
  2489. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2490. BEGIN
  2491. RESULT := left + (-right);
  2492. RETURN RESULT
  2493. END "-";
  2494. (** LONGREAL *)
  2495. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2496. BEGIN
  2497. RESULT := left + (-right);
  2498. RETURN RESULT
  2499. END "-";
  2500. (** COMPLEX *)
  2501. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2502. BEGIN
  2503. RESULT := left + (-right);
  2504. RETURN RESULT
  2505. END "-";
  2506. (** LONGCOMPLEX *)
  2507. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2508. BEGIN
  2509. RESULT := left + (-right);
  2510. RETURN RESULT
  2511. END "-";
  2512. (*** subtraction scalar-array -> array ********************************************************************)
  2513. (** SHORTINT *)
  2514. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2515. VAR lval, rval, dval: SHORTINT;
  2516. BEGIN
  2517. SYSTEM.GET( radr, rval );
  2518. WHILE (len > 0) DO
  2519. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2520. INC( dadr, dinc ); DEC( len );
  2521. END;
  2522. END SubSSASLoop;
  2523. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2524. BEGIN
  2525. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2526. SIZEOF( SHORTINT ), SubSSASLoop );
  2527. RETURN RESULT
  2528. END "-";
  2529. (** INTEGER *)
  2530. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2531. VAR lval, rval, dval: INTEGER;
  2532. BEGIN
  2533. SYSTEM.GET( radr, rval );
  2534. WHILE (len > 0) DO
  2535. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2536. INC( dadr, dinc ); DEC( len );
  2537. END;
  2538. END SubSIAILoop;
  2539. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2540. BEGIN
  2541. ApplyBinaryASAOp( RESULT, right, ADDRESSOF( left ),
  2542. SIZEOF( INTEGER ), SubSIAILoop );
  2543. RETURN RESULT
  2544. END "-";
  2545. (** LONGINT *)
  2546. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2547. VAR lval, rval, dval: LONGINT;
  2548. BEGIN
  2549. SYSTEM.GET( radr, rval );
  2550. WHILE (len > 0) DO
  2551. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2552. INC( dadr, dinc ); DEC( len );
  2553. END;
  2554. END SubSLALLoop;
  2555. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2556. BEGIN
  2557. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2558. SIZEOF( LONGINT ), SubSLALLoop );
  2559. RETURN RESULT
  2560. END "-";
  2561. (** SIZE *)
  2562. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2563. VAR lval, rval, dval: SIZE;
  2564. BEGIN
  2565. SYSTEM.GET( radr, rval );
  2566. WHILE (len > 0) DO
  2567. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2568. INC( dadr, dinc ); DEC( len );
  2569. END;
  2570. END SubSYAYLoop;
  2571. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2572. BEGIN
  2573. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2574. SIZEOF( SIZE ), SubSYAYLoop );
  2575. RETURN RESULT
  2576. END "-";
  2577. (** REAL *)
  2578. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2579. VAR lval, rval, dval: REAL;
  2580. BEGIN
  2581. SYSTEM.GET( radr, rval );
  2582. WHILE (len > 0) DO
  2583. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2584. INC( dadr, dinc ); DEC( len );
  2585. END;
  2586. END SubSRARLoop;
  2587. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2588. BEGIN
  2589. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2590. SubSRARLoop );
  2591. RETURN RESULT
  2592. END "-";
  2593. (** LONGREAL *)
  2594. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2595. VAR lval, rval, dval: LONGREAL;
  2596. BEGIN
  2597. SYSTEM.GET( radr, rval );
  2598. WHILE (len > 0) DO
  2599. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2600. INC( dadr, dinc ); DEC( len );
  2601. END;
  2602. END SubSXAXLoop;
  2603. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2604. BEGIN
  2605. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2606. SIZEOF( LONGREAL ), SubSXAXLoop );
  2607. RETURN RESULT
  2608. END "-";
  2609. (** COMPLEX *)
  2610. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2611. VAR lval, rval, dval: COMPLEX;
  2612. BEGIN
  2613. SYSTEM.GET( radr, rval );
  2614. WHILE (len > 0) DO
  2615. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2616. INC( dadr, dinc ); DEC( len );
  2617. END;
  2618. END SubSZAZLoop;
  2619. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2620. BEGIN
  2621. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2622. SIZEOF( COMPLEX ), SubSZAZLoop );
  2623. RETURN RESULT
  2624. END "-";
  2625. (** LONGCOMPLEX *)
  2626. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2627. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2628. BEGIN
  2629. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2630. WHILE (len > 0) DO
  2631. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2632. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2633. INC( ladr, linc );
  2634. INC( dadr, dinc ); DEC( len );
  2635. END;
  2636. END SubSLZALZLoop;
  2637. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2638. BEGIN
  2639. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2640. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2641. RETURN RESULT
  2642. END "-";
  2643. (*** element-wise multiply array x array -> array ********************************************************************)
  2644. (** SHORTINT *)
  2645. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2646. VAR lval, rval: SHORTINT;
  2647. BEGIN
  2648. WHILE (len > 0) DO
  2649. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2650. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2651. END;
  2652. END EMulASASLoop;
  2653. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2654. BEGIN
  2655. ApplyBinaryAAAOp( RESULT, left, right,
  2656. SIZEOF( SHORTINT ), EMulASASLoop );
  2657. RETURN RESULT
  2658. END ".*";
  2659. (** INTEGER *)
  2660. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2661. VAR lval, rval: INTEGER; dval: INTEGER;
  2662. BEGIN
  2663. WHILE (len > 0) DO
  2664. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2665. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2666. DEC( len );
  2667. END;
  2668. END EMulAIAILoop;
  2669. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2670. BEGIN
  2671. ApplyBinaryAAAOp( RESULT, left, right,
  2672. SIZEOF( INTEGER ), EMulAIAILoop );
  2673. RETURN RESULT
  2674. END ".*";
  2675. (** LONGINT *)
  2676. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2677. VAR lval, rval: LONGINT;
  2678. BEGIN
  2679. WHILE (len > 0) DO
  2680. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2681. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2682. END;
  2683. END EMulALALLoop;
  2684. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2685. BEGIN
  2686. ApplyBinaryAAAOp( RESULT, left, right,
  2687. SIZEOF( LONGINT ), EMulALALLoop );
  2688. RETURN RESULT
  2689. END ".*";
  2690. (** REAL *)
  2691. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2692. VAR lval, rval: REAL;
  2693. BEGIN
  2694. WHILE (len > 0) DO
  2695. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2696. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2697. END;
  2698. END EMulARARLoop;
  2699. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2700. BEGIN
  2701. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2702. EMulARARLoop );
  2703. RETURN RESULT
  2704. END ".*";
  2705. (** LONGREAL *)
  2706. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2707. VAR lval, rval: LONGREAL;
  2708. BEGIN
  2709. WHILE (len > 0) DO
  2710. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2711. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2712. END;
  2713. END EMulAXAXLoop;
  2714. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2715. BEGIN
  2716. ApplyBinaryAAAOp( RESULT, left, right,
  2717. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2718. RETURN RESULT
  2719. END ".*";
  2720. (** COMPLEX *)
  2721. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2722. VAR lval, rval: COMPLEX;
  2723. BEGIN
  2724. WHILE (len > 0) DO
  2725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2726. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END EMulAZAZLoop;
  2729. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2730. BEGIN
  2731. ApplyBinaryAAAOp( RESULT, left, right,
  2732. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2733. RETURN RESULT
  2734. END ".*";
  2735. (** LONGCOMPLEX *)
  2736. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2737. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2738. BEGIN
  2739. WHILE (len > 0) DO
  2740. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2741. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2742. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2743. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2744. DEC( len );
  2745. END;
  2746. END EMulALZALZLoop;
  2747. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2748. BEGIN
  2749. ApplyBinaryAAAOp( RESULT, left, right,
  2750. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2751. RETURN RESULT
  2752. END ".*";
  2753. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2754. (** SHORTINT *)
  2755. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2756. VAR lval, rval,dval: SHORTINT;
  2757. BEGIN
  2758. WHILE (len > 0) DO
  2759. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2760. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2761. END;
  2762. END EMulIncASASLoop;
  2763. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2764. BEGIN
  2765. ApplyBinaryAAAOp( RESULT, left, right,
  2766. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2767. END ".*+";
  2768. (** INTEGER *)
  2769. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2770. VAR lval, rval,dval: INTEGER;
  2771. BEGIN
  2772. WHILE (len > 0) DO
  2773. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2774. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2775. DEC( len );
  2776. END;
  2777. END EMulIncAIAILoop;
  2778. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2779. BEGIN
  2780. ApplyBinaryAAAOp( RESULT, left, right,
  2781. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2782. END ".*+";
  2783. (** LONGINT *)
  2784. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2785. VAR lval, rval,dval: LONGINT;
  2786. BEGIN
  2787. WHILE (len > 0) DO
  2788. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2789. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2790. END;
  2791. END EMulIncALALLoop;
  2792. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2793. BEGIN
  2794. ApplyBinaryAAAOp( RESULT, left, right,
  2795. SIZEOF( LONGINT ), EMulIncALALLoop );
  2796. END ".*+";
  2797. (** REAL *)
  2798. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2799. VAR lval, rval,dval: REAL;
  2800. BEGIN
  2801. WHILE (len > 0) DO
  2802. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2803. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2804. END;
  2805. END EMulIncARARLoop;
  2806. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2807. BEGIN
  2808. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2809. EMulIncARARLoop );
  2810. END ".*+";
  2811. (** LONGREAL *)
  2812. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2813. VAR lval, rval,dval: LONGREAL;
  2814. BEGIN
  2815. WHILE (len > 0) DO
  2816. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2817. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2818. END;
  2819. END EMulIncAXAXLoop;
  2820. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2821. BEGIN
  2822. ApplyBinaryAAAOp( RESULT, left, right,
  2823. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2824. END ".*+";
  2825. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2826. (** SHORTINT *)
  2827. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2828. VAR lval, rval: SHORTINT;
  2829. BEGIN
  2830. SYSTEM.GET( radr, rval );
  2831. WHILE (len > 0) DO
  2832. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2833. INC( dadr, dinc ); DEC( len );
  2834. END;
  2835. END MulASSSLoop;
  2836. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2837. BEGIN
  2838. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2839. SIZEOF( SHORTINT ), MulASSSLoop );
  2840. RETURN RESULT
  2841. END "*";
  2842. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2843. BEGIN
  2844. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2845. SIZEOF( SHORTINT ), MulASSSLoop );
  2846. RETURN RESULT
  2847. END "*";
  2848. (** INTEGER *)
  2849. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2850. VAR lval, rval: INTEGER;
  2851. BEGIN
  2852. SYSTEM.GET( radr, rval );
  2853. WHILE (len > 0) DO
  2854. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2855. INC( dadr, dinc ); DEC( len );
  2856. END;
  2857. END MulAISILoop;
  2858. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2859. BEGIN
  2860. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2861. SIZEOF( INTEGER ), MulAISILoop );
  2862. RETURN RESULT
  2863. END "*";
  2864. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2865. BEGIN
  2866. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2867. SIZEOF( INTEGER ), MulAISILoop );
  2868. RETURN RESULT
  2869. END "*";
  2870. (** LONGINT *)
  2871. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2872. VAR lval, rval: LONGINT;
  2873. BEGIN
  2874. SYSTEM.GET( radr, rval );
  2875. WHILE (len > 0) DO
  2876. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2877. INC( dadr, dinc ); DEC( len );
  2878. END;
  2879. END MulALSLLoop;
  2880. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2881. BEGIN
  2882. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2883. SIZEOF( LONGINT ), MulALSLLoop );
  2884. RETURN RESULT
  2885. END "*";
  2886. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2887. BEGIN
  2888. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2889. SIZEOF( LONGINT ), MulALSLLoop );
  2890. RETURN RESULT
  2891. END "*";
  2892. (** SIZE *)
  2893. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2894. VAR lval, rval: SIZE;
  2895. BEGIN
  2896. SYSTEM.GET( radr, rval );
  2897. WHILE (len > 0) DO
  2898. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2899. INC( dadr, dinc ); DEC( len );
  2900. END;
  2901. END MulAYSYLoop;
  2902. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2903. BEGIN
  2904. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2905. SIZEOF( SIZE ), MulAYSYLoop );
  2906. RETURN RESULT
  2907. END "*";
  2908. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2909. BEGIN
  2910. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2911. SIZEOF( SIZE ), MulAYSYLoop );
  2912. RETURN RESULT
  2913. END "*";
  2914. (** REAL *)
  2915. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2916. VAR lval, rval: REAL;
  2917. BEGIN
  2918. SYSTEM.GET( radr, rval );
  2919. WHILE (len > 0) DO
  2920. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2921. INC( dadr, dinc ); DEC( len );
  2922. END;
  2923. END MulARSRLoop;
  2924. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2925. BEGIN
  2926. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2927. loopMulARSR );
  2928. RETURN RESULT
  2929. END "*";
  2930. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2931. BEGIN
  2932. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2933. loopMulARSR );
  2934. RETURN RESULT
  2935. END "*";
  2936. (** LONGREAL *)
  2937. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2938. VAR lval, rval: LONGREAL;
  2939. BEGIN
  2940. IF debug THEN
  2941. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2942. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2943. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2944. END;
  2945. SYSTEM.GET( radr, rval );
  2946. WHILE (len > 0) DO
  2947. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2948. INC( dadr, dinc ); DEC( len );
  2949. END;
  2950. END MulAXSXLoop;
  2951. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2952. BEGIN
  2953. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2954. SIZEOF( LONGREAL ), loopMulAXSX );
  2955. RETURN RESULT
  2956. END "*";
  2957. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2958. BEGIN
  2959. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2960. SIZEOF( LONGREAL ), loopMulAXSX );
  2961. RETURN RESULT
  2962. END "*";
  2963. (** COMPLEX *)
  2964. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2965. VAR lval, rval: COMPLEX;
  2966. BEGIN
  2967. SYSTEM.GET( radr, rval );
  2968. WHILE (len > 0) DO
  2969. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2970. INC( dadr, dinc ); DEC( len );
  2971. END;
  2972. END MulAZSZLoop;
  2973. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2974. BEGIN
  2975. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2976. loopMulAZSZ );
  2977. RETURN RESULT
  2978. END "*";
  2979. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2980. BEGIN
  2981. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2982. loopMulAZSZ );
  2983. RETURN RESULT
  2984. END "*";
  2985. (** LONGCOMPLEX *)
  2986. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2987. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2988. BEGIN
  2989. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2990. WHILE (len > 0) DO
  2991. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2992. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2993. INC( ladr, linc );
  2994. INC( dadr, dinc ); DEC( len );
  2995. END;
  2996. END MulALZSLZLoop;
  2997. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2998. BEGIN
  2999. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  3000. loopMulALZSLZ );
  3001. RETURN RESULT
  3002. END "*";
  3003. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3004. BEGIN
  3005. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  3006. loopMulALZSLZ );
  3007. RETURN RESULT
  3008. END "*";
  3009. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  3010. (** SHORTINT *)
  3011. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3012. VAR lval, rval, dval: SHORTINT;
  3013. BEGIN
  3014. SYSTEM.GET( radr, rval );
  3015. WHILE (len > 0) DO
  3016. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3017. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3018. END;
  3019. END IncMulASSSLoop;
  3020. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3021. BEGIN
  3022. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3023. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3024. END "INCMUL";
  3025. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3026. BEGIN
  3027. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3028. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3029. RETURN RESULT
  3030. END "INCMUL";
  3031. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3032. BEGIN
  3033. RESULT := -RESULT;
  3034. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3035. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3036. RESULT := -RESULT;
  3037. RETURN RESULT
  3038. END "DECMUL";
  3039. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3040. BEGIN
  3041. RESULT := -RESULT;
  3042. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3043. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3044. RESULT := -RESULT;
  3045. RETURN RESULT
  3046. END "DECMUL";
  3047. (** INTEGER *)
  3048. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3049. VAR lval, rval, dval: INTEGER;
  3050. BEGIN
  3051. SYSTEM.GET( radr, rval );
  3052. WHILE (len > 0) DO
  3053. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3054. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3055. END;
  3056. END IncMulAISILoop;
  3057. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3058. BEGIN
  3059. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3060. SIZEOF( INTEGER ), IncMulAISILoop );
  3061. RETURN RESULT
  3062. END "INCMUL";
  3063. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3064. BEGIN
  3065. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3066. SIZEOF( INTEGER ), IncMulAISILoop );
  3067. RETURN RESULT
  3068. END "INCMUL";
  3069. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3070. BEGIN
  3071. RESULT := -RESULT;
  3072. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3073. SIZEOF( INTEGER ), IncMulAISILoop );
  3074. RESULT := -RESULT;
  3075. RETURN RESULT
  3076. END "DECMUL";
  3077. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3078. BEGIN
  3079. RESULT := -RESULT;
  3080. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3081. SIZEOF( INTEGER ), IncMulAISILoop );
  3082. RESULT := -RESULT;
  3083. RETURN RESULT
  3084. END "DECMUL";
  3085. (** LONGINT *)
  3086. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3087. VAR lval, rval, dval: LONGINT;
  3088. BEGIN
  3089. SYSTEM.GET( radr, rval );
  3090. WHILE (len > 0) DO
  3091. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3092. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3093. END;
  3094. END IncMulALSLLoop;
  3095. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3096. BEGIN
  3097. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3098. SIZEOF( LONGINT ), IncMulALSLLoop );
  3099. RETURN RESULT
  3100. END "INCMUL";
  3101. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3102. BEGIN
  3103. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3104. SIZEOF( LONGINT ), IncMulALSLLoop );
  3105. RETURN RESULT
  3106. END "INCMUL";
  3107. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3108. BEGIN
  3109. RESULT := -RESULT;
  3110. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3111. SIZEOF( LONGINT ), IncMulALSLLoop );
  3112. RESULT := -RESULT;
  3113. RETURN RESULT
  3114. END "DECMUL";
  3115. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3116. BEGIN
  3117. RESULT := -RESULT;
  3118. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3119. SIZEOF( LONGINT ), IncMulALSLLoop );
  3120. RESULT := -RESULT;
  3121. RETURN RESULT
  3122. END "DECMUL";
  3123. (** REAL *)
  3124. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3125. VAR lval, rval, dval: REAL;
  3126. BEGIN
  3127. SYSTEM.GET( radr, rval );
  3128. WHILE (len > 0) DO
  3129. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3130. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3131. END;
  3132. END IncMulARSRLoop;
  3133. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3134. BEGIN
  3135. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3136. loopIncMulARSR );
  3137. RETURN RESULT
  3138. END "INCMUL";
  3139. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3140. BEGIN
  3141. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3142. loopIncMulARSR );
  3143. RETURN RESULT
  3144. END "INCMUL";
  3145. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3146. BEGIN
  3147. RESULT := -RESULT;
  3148. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3149. loopIncMulARSR );
  3150. RESULT := -RESULT;
  3151. RETURN RESULT
  3152. END "DECMUL";
  3153. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3154. BEGIN
  3155. RESULT := -RESULT;
  3156. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3157. loopIncMulARSR );
  3158. RESULT := -RESULT;
  3159. RETURN RESULT
  3160. END "DECMUL";
  3161. (** LONGREAL *)
  3162. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3163. VAR lval, rval, dval: LONGREAL;
  3164. BEGIN
  3165. IF debug THEN
  3166. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3167. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3168. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3169. END;
  3170. SYSTEM.GET( radr, rval );
  3171. WHILE (len > 0) DO
  3172. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3173. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3174. END;
  3175. END IncMulAXSXLoop;
  3176. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3177. BEGIN
  3178. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3179. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3180. RETURN RESULT
  3181. END "INCMUL";
  3182. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3183. BEGIN
  3184. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3185. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3186. RETURN RESULT
  3187. END "INCMUL";
  3188. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3189. BEGIN
  3190. RESULT := -RESULT;
  3191. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3192. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3193. RESULT := -RESULT;
  3194. RETURN RESULT
  3195. END "DECMUL";
  3196. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3197. BEGIN
  3198. RESULT := -RESULT;
  3199. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3200. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3201. RESULT := -RESULT;
  3202. RETURN RESULT
  3203. END "DECMUL";
  3204. (*** element-wise division array / array -> array ********************************************************************)
  3205. (** SHORTINT *)
  3206. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3207. VAR lval, rval: SHORTINT; dval: REAL;
  3208. BEGIN
  3209. WHILE (len > 0) DO
  3210. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3211. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3212. DEC( len );
  3213. END;
  3214. END EDivideASASLoop;
  3215. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF REAL;
  3216. BEGIN
  3217. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3218. EDivideASASLoop );
  3219. RETURN RESULT
  3220. END "./";
  3221. (** INTEGER *)
  3222. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3223. VAR lval, rval: INTEGER; dval: REAL;
  3224. BEGIN
  3225. WHILE (len > 0) DO
  3226. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3227. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3228. DEC( len );
  3229. END;
  3230. END EDivideAIAILoop;
  3231. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF REAL;
  3232. BEGIN
  3233. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3234. EDivideAIAILoop );
  3235. RETURN RESULT
  3236. END "./";
  3237. (** LONGINT *)
  3238. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3239. VAR lval, rval: LONGINT; dval: REAL;
  3240. BEGIN
  3241. WHILE (len > 0) DO
  3242. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3243. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3244. DEC( len );
  3245. END;
  3246. END EDivideALALLoop;
  3247. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF REAL;
  3248. BEGIN
  3249. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3250. EDivideALALLoop );
  3251. RETURN RESULT
  3252. END "./";
  3253. (** REAL *)
  3254. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3255. VAR lval, rval: REAL; dval: REAL;
  3256. BEGIN
  3257. WHILE (len > 0) DO
  3258. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3259. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3260. DEC( len );
  3261. END;
  3262. END EDivideARARLoop;
  3263. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  3264. BEGIN
  3265. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3266. EDivideARARLoop );
  3267. RETURN RESULT
  3268. END "./";
  3269. (** LONGREAL *)
  3270. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3271. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3272. BEGIN
  3273. WHILE (len > 0) DO
  3274. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3275. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3276. DEC( len );
  3277. END;
  3278. END EDivideAXAXLoop;
  3279. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  3280. BEGIN
  3281. ApplyBinaryAAAOp( RESULT, left, right,
  3282. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3283. RETURN RESULT
  3284. END "./";
  3285. (** COMPLEX *)
  3286. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3287. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3288. BEGIN
  3289. WHILE (len > 0) DO
  3290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3291. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3292. DEC( len );
  3293. END;
  3294. END EDivideAZAZLoop;
  3295. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  3296. BEGIN
  3297. ApplyBinaryAAAOp( RESULT, left, right,
  3298. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3299. RETURN RESULT
  3300. END "./";
  3301. (** LONGCOMPLEX *)
  3302. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3303. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3304. BEGIN
  3305. WHILE (len > 0) DO
  3306. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3307. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3308. IF rvalIm # 0.0D0 THEN
  3309. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3310. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3311. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3312. ELSE
  3313. dvalRe := lvalRe/rvalRe;
  3314. dvalIm := lvalIm/rvalRe;
  3315. END;
  3316. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3317. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3318. DEC( len );
  3319. END;
  3320. END EDivideALZALZLoop;
  3321. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  3322. BEGIN
  3323. ApplyBinaryAAAOp( RESULT, left, right,
  3324. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3325. RETURN RESULT
  3326. END "./";
  3327. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3328. (** SHORTINT *)
  3329. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3330. VAR lval, rval: SHORTINT; 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 DivideASSSLoop;
  3338. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3339. BEGIN
  3340. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3341. DivideASSSLoop );
  3342. RETURN RESULT
  3343. END "/";
  3344. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3345. VAR lval, rval: SHORTINT; 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 DivideSSASLoop;
  3353. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3354. BEGIN
  3355. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3356. DivideSSASLoop );
  3357. RETURN RESULT
  3358. END "/";
  3359. (** INTEGER *)
  3360. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3361. VAR lval, rval: INTEGER; 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 DivideAISILoop;
  3369. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3370. BEGIN
  3371. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3372. DivideAISILoop );
  3373. RETURN RESULT
  3374. END "/";
  3375. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3376. VAR lval, rval: INTEGER; 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 DivideSIAILoop;
  3384. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF REAL;
  3385. BEGIN
  3386. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3387. DivideSIAILoop );
  3388. RETURN RESULT
  3389. END "/";
  3390. (** LONGINT *)
  3391. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3392. VAR lval, rval: LONGINT; dval: REAL;
  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 DivideALSLLoop;
  3400. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3401. BEGIN
  3402. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3403. DivideALSLLoop );
  3404. RETURN RESULT
  3405. END "/";
  3406. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3407. VAR lval, rval: LONGINT; dval: REAL;
  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 DivideSLALLoop;
  3415. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3416. BEGIN
  3417. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3418. DivideSLALLoop );
  3419. RETURN RESULT
  3420. END "/";
  3421. (** REAL *)
  3422. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3423. VAR lval, rval: REAL; dval: REAL;
  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 DivideARSRLoop;
  3431. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3432. BEGIN
  3433. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3434. DivideARSRLoop );
  3435. RETURN RESULT
  3436. END "/";
  3437. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3438. VAR lval, rval: REAL; dval: REAL;
  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 DivideSRARLoop;
  3446. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3447. BEGIN
  3448. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3449. DivideSRARLoop );
  3450. RETURN RESULT
  3451. END "/";
  3452. (** LONGREAL *)
  3453. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3454. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3455. BEGIN
  3456. SYSTEM.GET( radr, rval );
  3457. WHILE (len > 0) DO
  3458. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3459. INC( dadr, dinc ); DEC( len );
  3460. END;
  3461. END DivideAXSXLoop;
  3462. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3463. BEGIN
  3464. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3465. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3466. RETURN RESULT
  3467. END "/";
  3468. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3469. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3470. BEGIN
  3471. SYSTEM.GET( radr, rval );
  3472. WHILE (len > 0) DO
  3473. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3474. INC( dadr, dinc ); DEC( len );
  3475. END;
  3476. END DivideSXAXLoop;
  3477. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3478. BEGIN
  3479. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3480. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3481. RETURN RESULT
  3482. END "/";
  3483. (** COMPLEX *)
  3484. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3485. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3486. BEGIN
  3487. SYSTEM.GET( radr, rval );
  3488. WHILE (len > 0) DO
  3489. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3490. INC( dadr, dinc ); DEC( len );
  3491. END;
  3492. END DivideAZSZLoop;
  3493. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3494. BEGIN
  3495. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3496. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3497. RETURN RESULT
  3498. END "/";
  3499. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3500. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3501. BEGIN
  3502. SYSTEM.GET( radr, rval );
  3503. WHILE (len > 0) DO
  3504. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3505. INC( dadr, dinc ); DEC( len );
  3506. END;
  3507. END DivideSZAZLoop;
  3508. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3509. BEGIN
  3510. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3511. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3512. RETURN RESULT
  3513. END "/";
  3514. (** LONGCOMPLEX *)
  3515. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3516. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3517. BEGIN
  3518. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3519. IF rvalIm # 0.0D0 THEN
  3520. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3521. WHILE (len > 0) DO
  3522. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3523. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3524. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3525. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3526. INC( ladr, linc );
  3527. INC( dadr, dinc ); DEC( len );
  3528. END;
  3529. ELSE
  3530. WHILE (len > 0) DO
  3531. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3532. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3533. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3534. INC( ladr, linc );
  3535. INC( dadr, dinc ); DEC( len );
  3536. END;
  3537. END;
  3538. END DivideALZSLZLoop;
  3539. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3540. BEGIN
  3541. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3542. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3543. RETURN RESULT
  3544. END "/";
  3545. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3546. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3547. BEGIN
  3548. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3549. WHILE (len > 0) DO
  3550. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3551. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3552. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3553. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3554. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3555. INC( ladr, linc );
  3556. INC( dadr, dinc ); DEC( len );
  3557. END;
  3558. END DivideSLZALZLoop;
  3559. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3560. BEGIN
  3561. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3562. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3563. RETURN RESULT
  3564. END "/";
  3565. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3566. (** SHORTINT *)
  3567. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3568. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3569. BEGIN
  3570. WHILE (len > 0) DO
  3571. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3572. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3573. DEC( len );
  3574. END;
  3575. END EDivASASLoop;
  3576. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3577. BEGIN
  3578. ApplyBinaryAAAOp( RESULT, left, right,
  3579. SIZEOF( SHORTINT ), EDivASASLoop );
  3580. RETURN RESULT
  3581. END "DIV";
  3582. (** INTEGER *)
  3583. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3584. VAR lval, rval: INTEGER; dval: INTEGER;
  3585. BEGIN
  3586. WHILE (len > 0) DO
  3587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3588. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3589. DEC( len );
  3590. END;
  3591. END EDivAIAILoop;
  3592. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3593. BEGIN
  3594. ApplyBinaryAAAOp( RESULT, left, right,
  3595. SIZEOF( INTEGER ), EDivAIAILoop );
  3596. RETURN RESULT
  3597. END "DIV";
  3598. (** LONGINT *)
  3599. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3600. VAR lval, rval: LONGINT; dval: LONGINT;
  3601. BEGIN
  3602. WHILE (len > 0) DO
  3603. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3604. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3605. DEC( len );
  3606. END;
  3607. END EDivALALLoop;
  3608. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3609. BEGIN
  3610. ApplyBinaryAAAOp( RESULT, left, right,
  3611. SIZEOF( LONGINT ), EDivALALLoop );
  3612. RETURN RESULT
  3613. END "DIV";
  3614. (** SIZE *)
  3615. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3616. VAR lval, rval: SIZE; dval: SIZE;
  3617. BEGIN
  3618. WHILE (len > 0) DO
  3619. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3620. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3621. DEC( len );
  3622. END;
  3623. END EDivAYAYLoop;
  3624. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3625. BEGIN
  3626. ApplyBinaryAAAOp( RESULT, left, right,
  3627. SIZEOF( SIZE ), EDivAYAYLoop );
  3628. RETURN RESULT
  3629. END "DIV";
  3630. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3631. (** SHORTINT *)
  3632. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3633. VAR lval, rval: SHORTINT; dval: SHORTINT;
  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 DivASSSLoop;
  3641. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3642. BEGIN
  3643. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3644. SIZEOF( SHORTINT ), DivASSSLoop );
  3645. RETURN RESULT
  3646. END "DIV";
  3647. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3648. VAR lval, rval: SHORTINT; dval: SHORTINT;
  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 DivSSASLoop;
  3656. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3657. BEGIN
  3658. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3659. SIZEOF( SHORTINT ), DivSSASLoop );
  3660. RETURN RESULT
  3661. END "DIV";
  3662. (** INTEGER *)
  3663. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3664. VAR lval, rval: INTEGER; dval: INTEGER;
  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 DivAISILoop;
  3672. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3673. BEGIN
  3674. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3675. SIZEOF( INTEGER ), DivAISILoop );
  3676. RETURN RESULT
  3677. END "DIV";
  3678. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3679. VAR lval, rval: INTEGER; dval: INTEGER;
  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 DivSIAILoop;
  3687. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3688. BEGIN
  3689. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3690. SIZEOF( INTEGER ), DivSIAILoop );
  3691. RETURN RESULT
  3692. END "DIV";
  3693. (** LONGINT *)
  3694. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3695. VAR lval, rval: LONGINT; dval: LONGINT;
  3696. BEGIN
  3697. SYSTEM.GET( radr, rval );
  3698. WHILE (len > 0) DO
  3699. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3700. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3701. END;
  3702. END DivALSLLoop;
  3703. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3704. BEGIN
  3705. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3706. SIZEOF( LONGINT ), DivALSLLoop );
  3707. RETURN RESULT
  3708. END "DIV";
  3709. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3710. VAR lval, rval: LONGINT; dval: LONGINT;
  3711. BEGIN
  3712. SYSTEM.GET( radr, rval );
  3713. WHILE (len > 0) DO
  3714. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3715. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3716. END;
  3717. END DivSLALLoop;
  3718. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3719. BEGIN
  3720. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3721. SIZEOF( LONGINT ), DivSLALLoop );
  3722. RETURN RESULT
  3723. END "DIV";
  3724. (** SIZE *)
  3725. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3726. VAR lval, rval: SIZE; dval: SIZE;
  3727. BEGIN
  3728. SYSTEM.GET( radr, rval );
  3729. WHILE (len > 0) DO
  3730. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3731. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3732. END;
  3733. END DivAYSYLoop;
  3734. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3735. BEGIN
  3736. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3737. SIZEOF( SIZE ), DivAYSYLoop );
  3738. RETURN RESULT
  3739. END "DIV";
  3740. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3741. VAR lval, rval: SIZE; dval: SIZE;
  3742. BEGIN
  3743. SYSTEM.GET( radr, rval );
  3744. WHILE (len > 0) DO
  3745. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3746. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3747. END;
  3748. END DivSYAYLoop;
  3749. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3750. BEGIN
  3751. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3752. SIZEOF( SIZE ), DivSYAYLoop );
  3753. RETURN RESULT
  3754. END "DIV";
  3755. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3756. (** SHORTINT *)
  3757. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3758. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3759. BEGIN
  3760. WHILE (len > 0) DO
  3761. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3762. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3763. DEC( len );
  3764. END;
  3765. END EModASASLoop;
  3766. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3767. BEGIN
  3768. ApplyBinaryAAAOp( RESULT, left, right,
  3769. SIZEOF( SHORTINT ), EModASASLoop );
  3770. RETURN RESULT
  3771. END "MOD";
  3772. (** INTEGER *)
  3773. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3774. VAR lval, rval: INTEGER; dval: INTEGER;
  3775. BEGIN
  3776. WHILE (len > 0) DO
  3777. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3778. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3779. DEC( len );
  3780. END;
  3781. END EModAIAILoop;
  3782. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3783. BEGIN
  3784. ApplyBinaryAAAOp( RESULT, left, right,
  3785. SIZEOF( INTEGER ), EModAIAILoop );
  3786. RETURN RESULT
  3787. END "MOD";
  3788. (** LONGINT *)
  3789. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3790. VAR lval, rval: LONGINT; dval: LONGINT;
  3791. BEGIN
  3792. WHILE (len > 0) DO
  3793. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3794. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3795. DEC( len );
  3796. END;
  3797. END EModALALLoop;
  3798. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3799. BEGIN
  3800. ApplyBinaryAAAOp( RESULT, left, right,
  3801. SIZEOF( LONGINT ), EModALALLoop );
  3802. RETURN RESULT
  3803. END "MOD";
  3804. (** SIZE *)
  3805. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3806. VAR lval, rval: SIZE; dval: SIZE;
  3807. BEGIN
  3808. WHILE (len > 0) DO
  3809. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3810. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3811. DEC( len );
  3812. END;
  3813. END EModAYAYLoop;
  3814. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3815. BEGIN
  3816. ApplyBinaryAAAOp( RESULT, left, right,
  3817. SIZEOF( SIZE ), EModAYAYLoop );
  3818. RETURN RESULT
  3819. END "MOD";
  3820. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3821. (** SHORTINT *)
  3822. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3823. VAR lval, rval: SHORTINT; dval: SHORTINT;
  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 ModASSSLoop;
  3831. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3832. BEGIN
  3833. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3834. SIZEOF( SHORTINT ), ModASSSLoop );
  3835. RETURN RESULT
  3836. END "MOD";
  3837. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3838. VAR lval, rval: SHORTINT; dval: SHORTINT;
  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 ModSSASLoop;
  3846. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3847. BEGIN
  3848. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3849. SIZEOF( SHORTINT ), ModSSASLoop );
  3850. RETURN RESULT
  3851. END "MOD";
  3852. (** INTEGER *)
  3853. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3854. VAR lval, rval: INTEGER; dval: INTEGER;
  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 ModAISILoop;
  3862. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3863. BEGIN
  3864. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3865. SIZEOF( INTEGER ), ModAISILoop );
  3866. RETURN RESULT
  3867. END "MOD";
  3868. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3869. VAR lval, rval: INTEGER; dval: INTEGER;
  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 ModSIAILoop;
  3877. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3878. BEGIN
  3879. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3880. SIZEOF( INTEGER ), ModSIAILoop );
  3881. RETURN RESULT
  3882. END "MOD";
  3883. (** LONGINT *)
  3884. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3885. VAR lval, rval: LONGINT; dval: LONGINT;
  3886. BEGIN
  3887. SYSTEM.GET( radr, rval );
  3888. WHILE (len > 0) DO
  3889. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3890. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3891. END;
  3892. END ModALSLLoop;
  3893. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3894. BEGIN
  3895. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3896. SIZEOF( LONGINT ), ModALSLLoop );
  3897. RETURN RESULT
  3898. END "MOD";
  3899. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3900. VAR lval, rval: LONGINT; dval: LONGINT;
  3901. BEGIN
  3902. SYSTEM.GET( radr, rval );
  3903. WHILE (len > 0) DO
  3904. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3905. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3906. END;
  3907. END ModSLALLoop;
  3908. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3909. BEGIN
  3910. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3911. SIZEOF( LONGINT ), ModSLALLoop );
  3912. RETURN RESULT
  3913. END "MOD";
  3914. (** SIZE *)
  3915. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3916. VAR lval, rval: SIZE; dval: SIZE;
  3917. BEGIN
  3918. SYSTEM.GET( radr, rval );
  3919. WHILE (len > 0) DO
  3920. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3921. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3922. END;
  3923. END ModAYSYLoop;
  3924. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3925. BEGIN
  3926. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3927. SIZEOF( SIZE ), ModAYSYLoop );
  3928. RETURN RESULT
  3929. END "MOD";
  3930. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3931. VAR lval, rval: SIZE; dval: SIZE;
  3932. BEGIN
  3933. SYSTEM.GET( radr, rval );
  3934. WHILE (len > 0) DO
  3935. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3936. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3937. END;
  3938. END ModSYAYLoop;
  3939. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3940. BEGIN
  3941. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3942. SIZEOF( SIZE ), ModSYAYLoop );
  3943. RETURN RESULT
  3944. END "MOD";
  3945. (*** scalar product <array,array> -> scalar ********************************************************************)
  3946. (** SHORTINT *)
  3947. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3948. VAR lval, rval: SHORTINT; dval: LONGINT;
  3949. BEGIN
  3950. SYSTEM.GET( dadr, dval );
  3951. WHILE (len > 0) DO
  3952. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3953. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3954. END;
  3955. SYSTEM.PUT( dadr, dval );
  3956. END SPASASLoop;
  3957. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3958. VAR dest: LONGINT;
  3959. BEGIN
  3960. dest := 0;
  3961. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPASASLoop );
  3962. RETURN dest;
  3963. END "+*";
  3964. (** INTEGER *)
  3965. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3966. VAR lval, rval: INTEGER; dval: LONGINT;
  3967. BEGIN
  3968. SYSTEM.GET( dadr, dval );
  3969. WHILE (len > 0) DO
  3970. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3971. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3972. END;
  3973. SYSTEM.PUT( dadr, dval );
  3974. END SPAIAILoop;
  3975. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3976. VAR dest: LONGINT;
  3977. BEGIN
  3978. dest := 0;
  3979. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPAIAILoop );
  3980. RETURN dest;
  3981. END "+*";
  3982. (** LONGINT *)
  3983. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3984. VAR lval, rval: LONGINT; dval: LONGINT;
  3985. BEGIN
  3986. SYSTEM.GET( dadr, dval );
  3987. WHILE (len > 0) DO
  3988. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3989. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3990. END;
  3991. SYSTEM.PUT( dadr, dval );
  3992. END SPALALLoop;
  3993. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3994. VAR dest: LONGINT;
  3995. BEGIN
  3996. dest := 0;
  3997. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPALALLoop );
  3998. RETURN dest;
  3999. END "+*";
  4000. (** REAL *)
  4001. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4002. VAR lval, rval: REAL; dval: REAL;
  4003. BEGIN
  4004. SYSTEM.GET( dadr, dval );
  4005. WHILE (len > 0) DO
  4006. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4007. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4008. END;
  4009. SYSTEM.PUT( dadr, dval );
  4010. END SPARARLoop;
  4011. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  4012. VAR dest: REAL;
  4013. BEGIN
  4014. dest := 0;
  4015. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPARAR );
  4016. RETURN dest;
  4017. END "+*";
  4018. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4019. VAR lval, rval, dval: LONGREAL;
  4020. BEGIN
  4021. IF debug THEN
  4022. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  4023. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  4024. KernelLog.Int( len, 10 ); KernelLog.Ln;
  4025. END;
  4026. SYSTEM.GET( dadr, dval );
  4027. WHILE (len > 0) DO
  4028. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  4029. dval := dval + rval * lval; DEC( len );
  4030. END;
  4031. SYSTEM.PUT( dadr, dval );
  4032. END SPAXAXLoop;
  4033. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  4034. VAR dest: LONGREAL;
  4035. BEGIN
  4036. dest := 0;
  4037. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAXAX );
  4038. RETURN dest;
  4039. END "+*";
  4040. (** COMPLEX *)
  4041. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4042. VAR lval, rval: COMPLEX; dval: COMPLEX;
  4043. BEGIN
  4044. SYSTEM.GET( dadr, dval );
  4045. WHILE (len > 0) DO
  4046. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  4047. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  4048. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  4049. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4050. END;
  4051. SYSTEM.PUT( dadr, dval );
  4052. END SPAZAZLoop;
  4053. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  4054. VAR dest: COMPLEX;
  4055. BEGIN
  4056. dest := 0;
  4057. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAZAZ );
  4058. RETURN dest;
  4059. END "+*";
  4060. (** COMPLEX *)
  4061. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4062. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4063. BEGIN
  4064. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4065. WHILE (len > 0) DO
  4066. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4067. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4068. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4069. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4070. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4071. END;
  4072. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4073. END SPALZALZLoop;
  4074. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4075. VAR dest: LONGCOMPLEX;
  4076. BEGIN
  4077. dest := 0;
  4078. ApplyBinaryAASOp( ADDRESSOF( dest ),left,right, loopSPALZALZ );
  4079. RETURN dest;
  4080. END "+*";
  4081. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4082. (** BOOLEAN *)
  4083. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4084. VAR lval, rval: BOOLEAN;
  4085. BEGIN
  4086. WHILE (len > 0) DO
  4087. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4088. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4089. END;
  4090. END EEqlABABLoop;
  4091. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4092. BEGIN
  4093. ApplyBinaryAAAOp( RESULT, left, right,
  4094. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4095. RETURN RESULT
  4096. END ".=";
  4097. (** SHORTINT *)
  4098. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4099. VAR lval, rval: SHORTINT;
  4100. BEGIN
  4101. WHILE (len > 0) DO
  4102. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4103. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4104. END;
  4105. END EEqlASASLoop;
  4106. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4107. BEGIN
  4108. ApplyBinaryAAAOp( RESULT, left, right,
  4109. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4110. RETURN RESULT
  4111. END ".=";
  4112. (** INTEGER *)
  4113. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4114. VAR lval, rval: INTEGER;
  4115. BEGIN
  4116. WHILE (len > 0) DO
  4117. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4118. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4119. END;
  4120. END EEqlAIAILoop;
  4121. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4122. BEGIN
  4123. ApplyBinaryAAAOp( RESULT, left, right,
  4124. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4125. RETURN RESULT
  4126. END ".=";
  4127. (** LONGINT *)
  4128. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4129. VAR lval, rval: LONGINT;
  4130. BEGIN
  4131. WHILE (len > 0) DO
  4132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4133. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4134. END;
  4135. END EEqlALALLoop;
  4136. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4137. BEGIN
  4138. ApplyBinaryAAAOp( RESULT, left, right,
  4139. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4140. RETURN RESULT
  4141. END ".=";
  4142. (** REAL *)
  4143. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4144. VAR lval, rval: REAL;
  4145. BEGIN
  4146. WHILE (len > 0) DO
  4147. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4148. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4149. END;
  4150. END EEqlARARLoop;
  4151. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4152. BEGIN
  4153. ApplyBinaryAAAOp( RESULT, left, right,
  4154. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4155. RETURN RESULT
  4156. END ".=";
  4157. (** LONGREAL *)
  4158. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4159. VAR lval, rval: LONGREAL;
  4160. BEGIN
  4161. WHILE (len > 0) DO
  4162. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4163. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4164. END;
  4165. END EEqlAXAXLoop;
  4166. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4167. BEGIN
  4168. ApplyBinaryAAAOp( RESULT, left, right,
  4169. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4170. RETURN RESULT
  4171. END ".=";
  4172. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4173. (** BOOLEAN *)
  4174. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4175. VAR lval, rval: BOOLEAN;
  4176. BEGIN
  4177. SYSTEM.GET( radr, rval );
  4178. WHILE (len > 0) DO
  4179. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4180. INC( dadr, dinc ); DEC( len );
  4181. END;
  4182. END EEqlABSBLoop;
  4183. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4184. BEGIN
  4185. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4186. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4187. RETURN RESULT
  4188. END ".=";
  4189. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4190. BEGIN
  4191. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4192. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4193. RETURN RESULT
  4194. END ".=";
  4195. (** SHORTINT *)
  4196. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4197. VAR lval, rval: SHORTINT;
  4198. BEGIN
  4199. SYSTEM.GET( radr, rval );
  4200. WHILE (len > 0) DO
  4201. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4202. INC( dadr, dinc ); DEC( len );
  4203. END;
  4204. END EEqlASSSLoop;
  4205. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4206. BEGIN
  4207. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4208. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4209. RETURN RESULT
  4210. END ".=";
  4211. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4212. BEGIN
  4213. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4214. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4215. RETURN RESULT
  4216. END ".=";
  4217. (** INTEGER *)
  4218. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4219. VAR lval, rval: INTEGER;
  4220. BEGIN
  4221. SYSTEM.GET( radr, rval );
  4222. WHILE (len > 0) DO
  4223. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4224. INC( dadr, dinc ); DEC( len );
  4225. END;
  4226. END EEqlAISILoop;
  4227. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4228. BEGIN
  4229. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4230. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4231. RETURN RESULT
  4232. END ".=";
  4233. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4234. BEGIN
  4235. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4236. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4237. RETURN RESULT
  4238. END ".=";
  4239. (** LONGINT *)
  4240. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4241. VAR lval, rval: LONGINT;
  4242. BEGIN
  4243. SYSTEM.GET( radr, rval );
  4244. WHILE (len > 0) DO
  4245. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4246. INC( dadr, dinc ); DEC( len );
  4247. END;
  4248. END EEqlALSLLoop;
  4249. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4250. BEGIN
  4251. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4252. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4253. RETURN RESULT
  4254. END ".=";
  4255. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4256. BEGIN
  4257. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4258. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4259. RETURN RESULT
  4260. END ".=";
  4261. (** REAL *)
  4262. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4263. VAR lval, rval: REAL;
  4264. BEGIN
  4265. SYSTEM.GET( radr, rval );
  4266. WHILE (len > 0) DO
  4267. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4268. INC( dadr, dinc ); DEC( len );
  4269. END;
  4270. END EEqlARSRLoop;
  4271. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4272. BEGIN
  4273. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4274. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4275. RETURN RESULT
  4276. END ".=";
  4277. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4278. BEGIN
  4279. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4280. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4281. RETURN RESULT
  4282. END ".=";
  4283. (** LONGREAL *)
  4284. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4285. VAR lval, rval: LONGREAL;
  4286. BEGIN
  4287. SYSTEM.GET( radr, rval );
  4288. WHILE (len > 0) DO
  4289. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4290. INC( dadr, dinc ); DEC( len );
  4291. END;
  4292. END EEqlAXSXLoop;
  4293. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4294. BEGIN
  4295. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4296. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4297. RETURN RESULT
  4298. END ".=";
  4299. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4300. BEGIN
  4301. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4302. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4303. RETURN RESULT
  4304. END ".=";
  4305. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4306. (** BOOLEAN *)
  4307. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4308. VAR lval, rval: BOOLEAN;
  4309. BEGIN
  4310. WHILE (len > 0) DO
  4311. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4312. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4313. END;
  4314. END ENeqABABLoop;
  4315. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4316. BEGIN
  4317. ApplyBinaryAAAOp( RESULT, left, right,
  4318. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4319. RETURN RESULT
  4320. END ".#";
  4321. (** SHORTINT *)
  4322. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4323. VAR lval, rval: SHORTINT;
  4324. BEGIN
  4325. WHILE (len > 0) DO
  4326. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4327. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4328. END;
  4329. END ENeqASASLoop;
  4330. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4331. BEGIN
  4332. ApplyBinaryAAAOp( RESULT, left, right,
  4333. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4334. RETURN RESULT
  4335. END ".#";
  4336. (** INTEGER*)
  4337. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4338. VAR lval, rval: INTEGER;
  4339. BEGIN
  4340. WHILE (len > 0) DO
  4341. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4342. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4343. END;
  4344. END ENeqAIAILoop;
  4345. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4346. BEGIN
  4347. ApplyBinaryAAAOp( RESULT, left, right,
  4348. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4349. RETURN RESULT
  4350. END ".#";
  4351. (** LONGINT*)
  4352. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4353. VAR lval, rval: LONGINT;
  4354. BEGIN
  4355. WHILE (len > 0) DO
  4356. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4357. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4358. END;
  4359. END ENeqALALLoop;
  4360. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4361. BEGIN
  4362. ApplyBinaryAAAOp( RESULT, left, right,
  4363. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4364. RETURN RESULT
  4365. END ".#";
  4366. (** REAL *)
  4367. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4368. VAR lval, rval: REAL;
  4369. BEGIN
  4370. WHILE (len > 0) DO
  4371. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4372. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4373. END;
  4374. END ENeqARARLoop;
  4375. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4376. BEGIN
  4377. ApplyBinaryAAAOp( RESULT, left, right,
  4378. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4379. RETURN RESULT
  4380. END ".#";
  4381. (** LONGREAL *)
  4382. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4383. VAR lval, rval: LONGREAL;
  4384. BEGIN
  4385. WHILE (len > 0) DO
  4386. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4387. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4388. END;
  4389. END ENeqAXAXLoop;
  4390. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4391. BEGIN
  4392. ApplyBinaryAAAOp( RESULT, left, right,
  4393. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4394. RETURN RESULT
  4395. END ".#";
  4396. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4397. (** BOOLEAN *)
  4398. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4399. VAR lval, rval: BOOLEAN;
  4400. BEGIN
  4401. SYSTEM.GET( radr, rval );
  4402. WHILE (len > 0) DO
  4403. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4404. INC( dadr, dinc ); DEC( len );
  4405. END;
  4406. END ENeqABSBLoop;
  4407. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4408. BEGIN
  4409. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4410. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4411. RETURN RESULT
  4412. END ".#";
  4413. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4414. BEGIN
  4415. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4416. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4417. RETURN RESULT
  4418. END ".#";
  4419. (** SHORTINT *)
  4420. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4421. VAR lval, rval: SHORTINT;
  4422. BEGIN
  4423. SYSTEM.GET( radr, rval );
  4424. WHILE (len > 0) DO
  4425. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4426. INC( dadr, dinc ); DEC( len );
  4427. END;
  4428. END ENeqASSSLoop;
  4429. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4430. BEGIN
  4431. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4432. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4433. RETURN RESULT
  4434. END ".#";
  4435. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4436. BEGIN
  4437. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4438. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4439. RETURN RESULT
  4440. END ".#";
  4441. (** INTEGER *)
  4442. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4443. VAR lval, rval: INTEGER;
  4444. BEGIN
  4445. SYSTEM.GET( radr, rval );
  4446. WHILE (len > 0) DO
  4447. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4448. INC( dadr, dinc ); DEC( len );
  4449. END;
  4450. END ENeqAISILoop;
  4451. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4452. BEGIN
  4453. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4454. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4455. RETURN RESULT
  4456. END ".#";
  4457. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4458. BEGIN
  4459. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4460. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4461. RETURN RESULT
  4462. END ".#";
  4463. (** LONGINT *)
  4464. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4465. VAR lval, rval: LONGINT;
  4466. BEGIN
  4467. SYSTEM.GET( radr, rval );
  4468. WHILE (len > 0) DO
  4469. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4470. INC( dadr, dinc ); DEC( len );
  4471. END;
  4472. END ENeqALSLLoop;
  4473. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4474. BEGIN
  4475. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4476. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4477. RETURN RESULT
  4478. END ".#";
  4479. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4480. BEGIN
  4481. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4482. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4483. RETURN RESULT
  4484. END ".#";
  4485. (** REAL *)
  4486. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4487. VAR lval, rval: REAL;
  4488. BEGIN
  4489. SYSTEM.GET( radr, rval );
  4490. WHILE (len > 0) DO
  4491. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4492. INC( dadr, dinc ); DEC( len );
  4493. END;
  4494. END ENeqARSRLoop;
  4495. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4496. BEGIN
  4497. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4498. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4499. RETURN RESULT
  4500. END ".#";
  4501. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4502. BEGIN
  4503. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4504. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4505. RETURN RESULT
  4506. END ".#";
  4507. (** LONGREAL *)
  4508. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4509. VAR lval, rval: LONGREAL;
  4510. BEGIN
  4511. SYSTEM.GET( radr, rval );
  4512. WHILE (len > 0) DO
  4513. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4514. INC( dadr, dinc ); DEC( len );
  4515. END;
  4516. END ENeqAXSXLoop;
  4517. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4518. BEGIN
  4519. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4520. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4521. RETURN RESULT
  4522. END ".#";
  4523. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4524. BEGIN
  4525. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4526. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4527. RETURN RESULT
  4528. END ".#";
  4529. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4530. (** SHORTINT *)
  4531. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4532. VAR lval, rval: SHORTINT;
  4533. BEGIN
  4534. WHILE (len > 0) DO
  4535. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4536. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4537. END;
  4538. END EGtrASASLoop;
  4539. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4540. BEGIN
  4541. ApplyBinaryAAAOp( RESULT, left, right,
  4542. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4543. RETURN RESULT
  4544. END ".>";
  4545. (** INTEGER *)
  4546. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4547. VAR lval, rval: INTEGER;
  4548. BEGIN
  4549. WHILE (len > 0) DO
  4550. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4551. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4552. END;
  4553. END EGtrAIAILoop;
  4554. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4555. BEGIN
  4556. ApplyBinaryAAAOp( RESULT, left, right,
  4557. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4558. RETURN RESULT
  4559. END ".>";
  4560. (** LONGINT *)
  4561. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4562. VAR lval, rval: LONGINT;
  4563. BEGIN
  4564. WHILE (len > 0) DO
  4565. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4566. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4567. END;
  4568. END EGtrALALLoop;
  4569. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4570. BEGIN
  4571. ApplyBinaryAAAOp( RESULT, left, right,
  4572. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4573. RETURN RESULT
  4574. END ".>";
  4575. (** REAL *)
  4576. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4577. VAR lval, rval: REAL;
  4578. BEGIN
  4579. WHILE (len > 0) DO
  4580. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4581. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4582. END;
  4583. END EGtrARARLoop;
  4584. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4585. BEGIN
  4586. ApplyBinaryAAAOp( RESULT, left, right,
  4587. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4588. RETURN RESULT
  4589. END ".>";
  4590. (** LONGREAL *)
  4591. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4592. VAR lval, rval: LONGREAL;
  4593. BEGIN
  4594. WHILE (len > 0) DO
  4595. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4596. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4597. END;
  4598. END EGtrAXAXLoop;
  4599. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4600. BEGIN
  4601. ApplyBinaryAAAOp( RESULT, left, right,
  4602. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4603. RETURN RESULT
  4604. END ".>";
  4605. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4606. (** SHORTINT *)
  4607. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4608. VAR lval, rval: SHORTINT;
  4609. BEGIN
  4610. SYSTEM.GET( radr, rval );
  4611. WHILE (len > 0) DO
  4612. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4613. INC( dadr, dinc ); DEC( len );
  4614. END;
  4615. END EGtrASSSLoop;
  4616. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4617. BEGIN
  4618. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4619. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4620. RETURN RESULT
  4621. END ".>";
  4622. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4623. BEGIN
  4624. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4625. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4626. RETURN RESULT
  4627. END ".<";
  4628. (** INTEGER *)
  4629. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4630. VAR lval, rval: INTEGER;
  4631. BEGIN
  4632. SYSTEM.GET( radr, rval );
  4633. WHILE (len > 0) DO
  4634. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4635. INC( dadr, dinc ); DEC( len );
  4636. END;
  4637. END EGtrAISILoop;
  4638. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4639. BEGIN
  4640. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4641. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4642. RETURN RESULT
  4643. END ".>";
  4644. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4645. BEGIN
  4646. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4647. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4648. RETURN RESULT
  4649. END ".<";
  4650. (** LONGINT *)
  4651. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4652. VAR lval, rval: LONGINT;
  4653. BEGIN
  4654. SYSTEM.GET( radr, rval );
  4655. WHILE (len > 0) DO
  4656. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4657. INC( dadr, dinc ); DEC( len );
  4658. END;
  4659. END EGtrALSLLoop;
  4660. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4661. BEGIN
  4662. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4663. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4664. RETURN RESULT
  4665. END ".>";
  4666. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4667. BEGIN
  4668. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4669. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4670. RETURN RESULT
  4671. END ".<";
  4672. (** REAL *)
  4673. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4674. VAR lval, rval: REAL;
  4675. BEGIN
  4676. SYSTEM.GET( radr, rval );
  4677. WHILE (len > 0) DO
  4678. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4679. INC( dadr, dinc ); DEC( len );
  4680. END;
  4681. END EGtrARSRLoop;
  4682. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4683. BEGIN
  4684. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4685. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4686. RETURN RESULT
  4687. END ".>";
  4688. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4689. BEGIN
  4690. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4691. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4692. RETURN RESULT
  4693. END ".<";
  4694. (** LONGREAL *)
  4695. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4696. VAR lval, rval: LONGREAL;
  4697. BEGIN
  4698. SYSTEM.GET( radr, rval );
  4699. WHILE (len > 0) DO
  4700. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4701. INC( dadr, dinc ); DEC( len );
  4702. END;
  4703. END EGtrAXSXLoop;
  4704. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4705. BEGIN
  4706. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4707. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4708. RETURN RESULT
  4709. END ".>";
  4710. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4711. BEGIN
  4712. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4713. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4714. RETURN RESULT
  4715. END ".<";
  4716. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4717. (** SHORTINT *)
  4718. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4719. VAR lval, rval: SHORTINT;
  4720. BEGIN
  4721. WHILE (len > 0) DO
  4722. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4723. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4724. END;
  4725. END EGeqASASLoop;
  4726. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4727. BEGIN
  4728. ApplyBinaryAAAOp( RESULT, left, right,
  4729. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4730. RETURN RESULT
  4731. END ".>=";
  4732. (** INTEGER *)
  4733. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4734. VAR lval, rval: INTEGER;
  4735. BEGIN
  4736. WHILE (len > 0) DO
  4737. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4738. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4739. END;
  4740. END EGeqAIAILoop;
  4741. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4742. BEGIN
  4743. ApplyBinaryAAAOp( RESULT, left, right,
  4744. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4745. RETURN RESULT
  4746. END ".>=";
  4747. (** LONGINT *)
  4748. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4749. VAR lval, rval: LONGINT;
  4750. BEGIN
  4751. WHILE (len > 0) DO
  4752. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4753. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4754. END;
  4755. END EGeqALALLoop;
  4756. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4757. BEGIN
  4758. ApplyBinaryAAAOp( RESULT, left, right,
  4759. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4760. RETURN RESULT
  4761. END ".>=";
  4762. (** REAL *)
  4763. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4764. VAR lval, rval: REAL;
  4765. BEGIN
  4766. WHILE (len > 0) DO
  4767. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4768. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4769. END;
  4770. END EGeqARARLoop;
  4771. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4772. BEGIN
  4773. ApplyBinaryAAAOp( RESULT, left, right,
  4774. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4775. RETURN RESULT
  4776. END ".>=";
  4777. (** LONGREAL *)
  4778. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4779. VAR lval, rval: LONGREAL;
  4780. BEGIN
  4781. WHILE (len > 0) DO
  4782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4783. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4784. END;
  4785. END EGeqAXAXLoop;
  4786. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4787. BEGIN
  4788. ApplyBinaryAAAOp( RESULT, left, right,
  4789. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4790. RETURN RESULT
  4791. END ".>=";
  4792. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4793. (** SHORTINT *)
  4794. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4795. VAR lval, rval: SHORTINT;
  4796. BEGIN
  4797. SYSTEM.GET( radr, rval );
  4798. WHILE (len > 0) DO
  4799. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4800. INC( dadr, dinc ); DEC( len );
  4801. END;
  4802. END EGeqASSSLoop;
  4803. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4804. BEGIN
  4805. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4806. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4807. RETURN RESULT
  4808. END ".>=";
  4809. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4810. BEGIN
  4811. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4812. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4813. RETURN RESULT
  4814. END ".<=";
  4815. (** INTEGER *)
  4816. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4817. VAR lval, rval: INTEGER;
  4818. BEGIN
  4819. SYSTEM.GET( radr, rval );
  4820. WHILE (len > 0) DO
  4821. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4822. INC( dadr, dinc ); DEC( len );
  4823. END;
  4824. END EGeqAISILoop;
  4825. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4826. BEGIN
  4827. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4828. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4829. RETURN RESULT
  4830. END ".>=";
  4831. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4832. BEGIN
  4833. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4834. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4835. RETURN RESULT
  4836. END ".<=";
  4837. (** LONGINT *)
  4838. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4839. VAR lval, rval: LONGINT;
  4840. BEGIN
  4841. SYSTEM.GET( radr, rval );
  4842. WHILE (len > 0) DO
  4843. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4844. INC( dadr, dinc ); DEC( len );
  4845. END;
  4846. END EGeqALSLLoop;
  4847. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4848. BEGIN
  4849. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4850. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4851. RETURN RESULT
  4852. END ".>=";
  4853. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4854. BEGIN
  4855. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4856. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4857. RETURN RESULT
  4858. END ".<=";
  4859. (** REAL *)
  4860. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4861. VAR lval, rval: REAL;
  4862. BEGIN
  4863. SYSTEM.GET( radr, rval );
  4864. WHILE (len > 0) DO
  4865. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4866. INC( dadr, dinc ); DEC( len );
  4867. END;
  4868. END EGeqARSRLoop;
  4869. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4870. BEGIN
  4871. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4872. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4873. RETURN RESULT
  4874. END ".>=";
  4875. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4876. BEGIN
  4877. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4878. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4879. RETURN RESULT
  4880. END ".<=";
  4881. (** LONGREAL *)
  4882. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4883. VAR lval, rval: LONGREAL;
  4884. BEGIN
  4885. SYSTEM.GET( radr, rval );
  4886. WHILE (len > 0) DO
  4887. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4888. INC( dadr, dinc ); DEC( len );
  4889. END;
  4890. END EGeqAXSXLoop;
  4891. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4892. BEGIN
  4893. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4894. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4895. RETURN RESULT
  4896. END ".>=";
  4897. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4898. BEGIN
  4899. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4900. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4901. RETURN RESULT
  4902. END ".<=";
  4903. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4904. (** SHORTINT *)
  4905. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4906. VAR lval, rval: SHORTINT;
  4907. BEGIN
  4908. WHILE (len > 0) DO
  4909. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4910. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4911. END;
  4912. END ELssASASLoop;
  4913. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4914. BEGIN
  4915. ApplyBinaryAAAOp( RESULT, left, right,
  4916. SIZEOF( BOOLEAN ), ELssASASLoop );
  4917. RETURN RESULT
  4918. END ".<";
  4919. (** INTEGER *)
  4920. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4921. VAR lval, rval: INTEGER;
  4922. BEGIN
  4923. WHILE (len > 0) DO
  4924. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4925. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4926. END;
  4927. END ELssAIAILoop;
  4928. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4929. BEGIN
  4930. ApplyBinaryAAAOp( RESULT, left, right,
  4931. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4932. RETURN RESULT
  4933. END ".<";
  4934. (** LONGINT*)
  4935. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4936. VAR lval, rval: LONGINT;
  4937. BEGIN
  4938. WHILE (len > 0) DO
  4939. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4940. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4941. END;
  4942. END ELssALALLoop;
  4943. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4944. BEGIN
  4945. ApplyBinaryAAAOp( RESULT, left, right,
  4946. SIZEOF( BOOLEAN ), ELssALALLoop );
  4947. RETURN RESULT
  4948. END ".<";
  4949. (** REAL *)
  4950. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4951. VAR lval, rval: REAL;
  4952. BEGIN
  4953. WHILE (len > 0) DO
  4954. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4955. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4956. END;
  4957. END ELssARARLoop;
  4958. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4959. BEGIN
  4960. ApplyBinaryAAAOp( RESULT, left, right,
  4961. SIZEOF( BOOLEAN ), ELssARARLoop );
  4962. RETURN RESULT
  4963. END ".<";
  4964. (** LONGREAL *)
  4965. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4966. VAR lval, rval: LONGREAL;
  4967. BEGIN
  4968. WHILE (len > 0) DO
  4969. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4970. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4971. END;
  4972. END ELssAXAXLoop;
  4973. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4974. BEGIN
  4975. ApplyBinaryAAAOp( RESULT, left, right,
  4976. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4977. RETURN RESULT
  4978. END ".<";
  4979. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4980. (** SHORTINT *)
  4981. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4982. VAR lval, rval: SHORTINT;
  4983. BEGIN
  4984. SYSTEM.GET( radr, rval );
  4985. WHILE (len > 0) DO
  4986. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4987. INC( dadr, dinc ); DEC( len );
  4988. END;
  4989. END ELssASSSLoop;
  4990. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4991. BEGIN
  4992. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4993. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4994. RETURN RESULT
  4995. END ".<";
  4996. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4997. BEGIN
  4998. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4999. SIZEOF( BOOLEAN ), ELssASSSLoop );
  5000. RETURN RESULT
  5001. END ".>";
  5002. (** INTEGER *)
  5003. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5004. VAR lval, rval: INTEGER;
  5005. BEGIN
  5006. SYSTEM.GET( radr, rval );
  5007. WHILE (len > 0) DO
  5008. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5009. INC( dadr, dinc ); DEC( len );
  5010. END;
  5011. END ELssAISILoop;
  5012. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5013. BEGIN
  5014. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5015. SIZEOF( BOOLEAN ), ELssAISILoop );
  5016. RETURN RESULT
  5017. END ".<";
  5018. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5019. BEGIN
  5020. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5021. SIZEOF( BOOLEAN ), ELssAISILoop );
  5022. RETURN RESULT
  5023. END ".>";
  5024. (** LONGINT *)
  5025. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5026. VAR lval, rval: LONGINT;
  5027. BEGIN
  5028. SYSTEM.GET( radr, rval );
  5029. WHILE (len > 0) DO
  5030. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5031. INC( dadr, dinc ); DEC( len );
  5032. END;
  5033. END ELssALSLLoop;
  5034. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5035. BEGIN
  5036. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5037. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5038. RETURN RESULT
  5039. END ".<";
  5040. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5041. BEGIN
  5042. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5043. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5044. RETURN RESULT
  5045. END ".>";
  5046. (** REAL *)
  5047. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5048. VAR lval, rval: REAL;
  5049. BEGIN
  5050. SYSTEM.GET( radr, rval );
  5051. WHILE (len > 0) DO
  5052. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5053. INC( dadr, dinc ); DEC( len );
  5054. END;
  5055. END ELssARSRLoop;
  5056. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5057. BEGIN
  5058. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5059. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5060. RETURN RESULT
  5061. END ".<";
  5062. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5063. BEGIN
  5064. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5065. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5066. RETURN RESULT
  5067. END ".>";
  5068. (** LONGREAL *)
  5069. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5070. VAR lval, rval: LONGREAL;
  5071. BEGIN
  5072. SYSTEM.GET( radr, rval );
  5073. WHILE (len > 0) DO
  5074. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5075. INC( dadr, dinc ); DEC( len );
  5076. END;
  5077. END ELssAXSXLoop;
  5078. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5079. BEGIN
  5080. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5081. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5082. RETURN RESULT
  5083. END ".<";
  5084. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5085. BEGIN
  5086. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5087. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5088. RETURN RESULT
  5089. END ".>";
  5090. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5091. (** SHORTINT *)
  5092. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5093. VAR lval, rval: SHORTINT;
  5094. BEGIN
  5095. WHILE (len > 0) DO
  5096. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5097. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5098. END;
  5099. END ELeqASASLoop;
  5100. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5101. BEGIN
  5102. ApplyBinaryAAAOp( RESULT, left, right,
  5103. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5104. RETURN RESULT
  5105. END ".<=";
  5106. (** INTEGER *)
  5107. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5108. VAR lval, rval: INTEGER;
  5109. BEGIN
  5110. WHILE (len > 0) DO
  5111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5112. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5113. END;
  5114. END ELeqAIAILoop;
  5115. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5116. BEGIN
  5117. ApplyBinaryAAAOp( RESULT, left, right,
  5118. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5119. RETURN RESULT
  5120. END ".<=";
  5121. (** LONGINT *)
  5122. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5123. VAR lval, rval: LONGINT;
  5124. BEGIN
  5125. WHILE (len > 0) DO
  5126. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5127. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5128. END;
  5129. END ELeqALALLoop;
  5130. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5131. BEGIN
  5132. ApplyBinaryAAAOp( RESULT, left, right,
  5133. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5134. RETURN RESULT
  5135. END ".<=";
  5136. (** REAL *)
  5137. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5138. VAR lval, rval: REAL;
  5139. BEGIN
  5140. WHILE (len > 0) DO
  5141. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5142. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5143. END;
  5144. END ELeqARARLoop;
  5145. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5146. BEGIN
  5147. ApplyBinaryAAAOp( RESULT, left, right,
  5148. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5149. RETURN RESULT
  5150. END ".<=";
  5151. (** LONGREAL*)
  5152. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5153. VAR lval, rval: LONGREAL;
  5154. BEGIN
  5155. WHILE (len > 0) DO
  5156. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5157. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5158. END;
  5159. END ELeqAXAXLoop;
  5160. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5161. BEGIN
  5162. ApplyBinaryAAAOp( RESULT, left, right,
  5163. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5164. RETURN RESULT
  5165. END ".<=";
  5166. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5167. (** SHORTINT *)
  5168. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5169. VAR lval, rval: SHORTINT;
  5170. BEGIN
  5171. SYSTEM.GET( radr, rval );
  5172. WHILE (len > 0) DO
  5173. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5174. INC( dadr, dinc ); DEC( len );
  5175. END;
  5176. END ELeqASSSLoop;
  5177. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5178. BEGIN
  5179. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5180. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5181. RETURN RESULT
  5182. END ".<=";
  5183. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5184. BEGIN
  5185. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5186. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5187. RETURN RESULT
  5188. END ".>=";
  5189. (** INTEGER *)
  5190. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5191. VAR lval, rval: INTEGER;
  5192. BEGIN
  5193. SYSTEM.GET( radr, rval );
  5194. WHILE (len > 0) DO
  5195. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5196. INC( dadr, dinc ); DEC( len );
  5197. END;
  5198. END ELeqAISILoop;
  5199. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5200. BEGIN
  5201. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5202. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5203. RETURN RESULT
  5204. END ".<=";
  5205. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5206. BEGIN
  5207. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5208. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5209. RETURN RESULT
  5210. END ".>=";
  5211. (** LONGINT *)
  5212. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5213. VAR lval, rval: LONGINT;
  5214. BEGIN
  5215. SYSTEM.GET( radr, rval );
  5216. WHILE (len > 0) DO
  5217. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5218. INC( dadr, dinc ); DEC( len );
  5219. END;
  5220. END ELeqALSLLoop;
  5221. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5222. BEGIN
  5223. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5224. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5225. RETURN RESULT
  5226. END ".<=";
  5227. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5228. BEGIN
  5229. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5230. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5231. RETURN RESULT
  5232. END ".>=";
  5233. (** REAL *)
  5234. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5235. VAR lval, rval: REAL;
  5236. BEGIN
  5237. SYSTEM.GET( radr, rval );
  5238. WHILE (len > 0) DO
  5239. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5240. INC( dadr, dinc ); DEC( len );
  5241. END;
  5242. END ELeqARSRLoop;
  5243. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5244. BEGIN
  5245. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5246. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5247. RETURN RESULT
  5248. END ".<=";
  5249. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5250. BEGIN
  5251. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5252. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5253. RETURN RESULT
  5254. END ".>=";
  5255. (** LONGREAL *)
  5256. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5257. VAR lval, rval: LONGREAL;
  5258. BEGIN
  5259. SYSTEM.GET( radr, rval );
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5262. INC( dadr, dinc ); DEC( len );
  5263. END;
  5264. END ELeqAXSXLoop;
  5265. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5266. BEGIN
  5267. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5268. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5269. RETURN RESULT
  5270. END ".<=";
  5271. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5272. BEGIN
  5273. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5274. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5275. RETURN RESULT
  5276. END ".>=";
  5277. (*** elementwise or, elementwise and ********************************************************************)
  5278. (** array x array *)
  5279. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5280. VAR lval, rval: BOOLEAN;
  5281. BEGIN
  5282. WHILE (len > 0) DO
  5283. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5284. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5285. END;
  5286. END ElOrABABLoop;
  5287. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5288. BEGIN
  5289. ApplyBinaryAAAOp( RESULT, left, right,
  5290. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5291. RETURN RESULT
  5292. END "OR";
  5293. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5294. VAR lval, rval: BOOLEAN;
  5295. BEGIN
  5296. WHILE (len > 0) DO
  5297. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5298. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5299. END;
  5300. END ElAndABABLoop;
  5301. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5302. BEGIN
  5303. ApplyBinaryAAAOp( RESULT, left, right,
  5304. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5305. RETURN RESULT
  5306. END "&";
  5307. (** array x boolean *)
  5308. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5309. VAR lval, rval: BOOLEAN;
  5310. BEGIN
  5311. SYSTEM.GET( radr, rval );
  5312. WHILE (len > 0) DO
  5313. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5314. INC( dadr, dinc ); DEC( len );
  5315. END;
  5316. END ElOrABSBLoop;
  5317. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5318. BEGIN
  5319. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5320. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5321. RETURN RESULT
  5322. END "OR";
  5323. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5324. BEGIN
  5325. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5326. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5327. RETURN RESULT
  5328. END "OR";
  5329. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5330. VAR lval, rval: BOOLEAN;
  5331. BEGIN
  5332. SYSTEM.GET( radr, rval );
  5333. WHILE (len > 0) DO
  5334. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5335. INC( dadr, dinc ); DEC( len );
  5336. END;
  5337. END ElAndABSBLoop;
  5338. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5339. BEGIN
  5340. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5341. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5342. RETURN RESULT
  5343. END "&";
  5344. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5345. BEGIN
  5346. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5347. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5348. RETURN RESULT
  5349. END "&";
  5350. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5351. (** SHORTINT *)
  5352. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5353. VAR lval, rval: SHORTINT;
  5354. BEGIN
  5355. WHILE (len > 0) DO
  5356. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5357. IF rval <= lval THEN RETURN FALSE END;
  5358. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5359. END;
  5360. RETURN TRUE;
  5361. END LssASASLoop;
  5362. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5363. BEGIN
  5364. RETURN ApplyBinaryAABOp( left, right, LssASASLoop , FALSE);
  5365. END "<";
  5366. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5367. VAR lval, rval: SHORTINT;
  5368. BEGIN
  5369. WHILE (len > 0) DO
  5370. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5371. IF rval > lval THEN RETURN FALSE END;
  5372. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5373. END;
  5374. RETURN TRUE;
  5375. END GeqASASLoop;
  5376. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5377. BEGIN
  5378. RETURN ApplyBinaryAABOp( left, right, GeqASASLoop , FALSE);
  5379. END ">=";
  5380. (** INTEGER *)
  5381. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5382. VAR lval, rval: INTEGER;
  5383. BEGIN
  5384. WHILE (len > 0) DO
  5385. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5386. IF rval <= lval THEN RETURN FALSE END;
  5387. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5388. END;
  5389. RETURN TRUE;
  5390. END LssAIAILoop;
  5391. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5392. BEGIN
  5393. RETURN ApplyBinaryAABOp( left, right, LssAIAILoop , FALSE);
  5394. END "<";
  5395. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5396. VAR lval, rval: INTEGER;
  5397. BEGIN
  5398. WHILE (len > 0) DO
  5399. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5400. IF rval > lval THEN RETURN FALSE END;
  5401. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5402. END;
  5403. RETURN TRUE;
  5404. END GeqAIAILoop;
  5405. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5406. BEGIN
  5407. RETURN ApplyBinaryAABOp( left, right, GeqAIAILoop , FALSE);
  5408. END ">=";
  5409. (** LONGINT *)
  5410. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5411. VAR lval, rval: LONGINT;
  5412. BEGIN
  5413. WHILE (len > 0) DO
  5414. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5415. IF rval <= lval THEN RETURN FALSE END;
  5416. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5417. END;
  5418. RETURN TRUE;
  5419. END LssALALLoop;
  5420. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5421. BEGIN
  5422. RETURN ApplyBinaryAABOp( left, right, LssALALLoop , FALSE);
  5423. END "<";
  5424. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5425. VAR lval, rval: LONGINT;
  5426. BEGIN
  5427. WHILE (len > 0) DO
  5428. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5429. IF rval > lval THEN RETURN FALSE END;
  5430. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5431. END;
  5432. RETURN TRUE;
  5433. END GeqALALLoop;
  5434. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5435. BEGIN
  5436. RETURN ApplyBinaryAABOp( left, right, GeqALALLoop , FALSE);
  5437. END ">=";
  5438. (** SIZE *)
  5439. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5440. VAR lval, rval: LONGINT;
  5441. BEGIN
  5442. WHILE (len > 0) DO
  5443. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5444. IF rval <= lval THEN RETURN FALSE END;
  5445. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5446. END;
  5447. RETURN TRUE;
  5448. END LssAZAZLoop;
  5449. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5450. BEGIN
  5451. RETURN ApplyBinaryAABOp( left, right, LssAZAZLoop , FALSE);
  5452. END "<";
  5453. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5454. VAR lval, rval: SIZE;
  5455. BEGIN
  5456. WHILE (len > 0) DO
  5457. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5458. IF rval > lval THEN RETURN FALSE END;
  5459. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5460. END;
  5461. RETURN TRUE;
  5462. END GeqAZAZLoop;
  5463. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5464. BEGIN
  5465. RETURN ApplyBinaryAABOp( left, right, GeqAZAZLoop , FALSE);
  5466. END ">=";
  5467. (** REAL *)
  5468. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5469. VAR lval, rval: REAL;
  5470. BEGIN
  5471. WHILE (len > 0) DO
  5472. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5473. IF rval <= lval THEN RETURN FALSE END;
  5474. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5475. END;
  5476. RETURN TRUE;
  5477. END LssARARLoop;
  5478. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5479. BEGIN
  5480. RETURN ApplyBinaryAABOp( left, right, LssARARLoop , FALSE);
  5481. END "<";
  5482. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5483. VAR lval, rval: REAL;
  5484. BEGIN
  5485. WHILE (len > 0) DO
  5486. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5487. IF rval > lval THEN RETURN FALSE END;
  5488. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5489. END;
  5490. RETURN TRUE;
  5491. END GeqARARLoop;
  5492. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5493. BEGIN
  5494. RETURN ApplyBinaryAABOp( left, right, GeqARARLoop , FALSE);
  5495. END ">=";
  5496. (** LONGREAL *)
  5497. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5498. VAR lval, rval: LONGREAL;
  5499. BEGIN
  5500. WHILE (len > 0) DO
  5501. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5502. IF rval <= lval THEN RETURN FALSE END;
  5503. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5504. END;
  5505. RETURN TRUE;
  5506. END LssAXAXLoop;
  5507. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5508. BEGIN
  5509. RETURN ApplyBinaryAABOp( left, right, LssAXAXLoop , FALSE);
  5510. END "<";
  5511. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5512. VAR lval, rval: LONGREAL;
  5513. BEGIN
  5514. WHILE (len > 0) DO
  5515. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5516. IF rval > lval THEN RETURN FALSE END;
  5517. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5518. END;
  5519. RETURN TRUE;
  5520. END GeqAXAXLoop;
  5521. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5522. BEGIN
  5523. RETURN ApplyBinaryAABOp( left, right, GeqAXAXLoop , FALSE);
  5524. END ">=";
  5525. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5526. (** SHORTINT *)
  5527. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5528. VAR lval, rval: SHORTINT;
  5529. BEGIN
  5530. WHILE (len > 0) DO
  5531. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5532. IF rval >= lval THEN RETURN FALSE END;
  5533. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5534. END;
  5535. RETURN TRUE;
  5536. END GtrASASLoop;
  5537. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5538. BEGIN
  5539. RETURN ApplyBinaryAABOp( left, right, GtrASASLoop , FALSE);
  5540. END ">";
  5541. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5542. VAR lval, rval: SHORTINT;
  5543. BEGIN
  5544. WHILE (len > 0) DO
  5545. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5546. IF rval < lval THEN RETURN FALSE END;
  5547. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5548. END;
  5549. RETURN TRUE;
  5550. END LeqASASLoop;
  5551. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5552. BEGIN
  5553. RETURN ApplyBinaryAABOp( left, right, LeqASASLoop , FALSE);
  5554. END "<=";
  5555. (** INTEGER *)
  5556. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5557. VAR lval, rval: INTEGER;
  5558. BEGIN
  5559. WHILE (len > 0) DO
  5560. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5561. IF rval >= lval THEN RETURN FALSE END;
  5562. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5563. END;
  5564. RETURN TRUE;
  5565. END GtrAIAILoop;
  5566. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5567. BEGIN
  5568. RETURN ApplyBinaryAABOp( left, right, GtrAIAILoop , FALSE);
  5569. END ">";
  5570. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5571. VAR lval, rval: INTEGER;
  5572. BEGIN
  5573. WHILE (len > 0) DO
  5574. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5575. IF rval < lval THEN RETURN FALSE END;
  5576. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5577. END;
  5578. RETURN TRUE;
  5579. END LeqAIAILoop;
  5580. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5581. BEGIN
  5582. RETURN ApplyBinaryAABOp( left, right, LeqAIAILoop ,FALSE);
  5583. END "<=";
  5584. (** LONGINT *)
  5585. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5586. VAR lval, rval: LONGINT;
  5587. BEGIN
  5588. WHILE (len > 0) DO
  5589. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5590. IF rval >= lval THEN RETURN FALSE END;
  5591. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5592. END;
  5593. RETURN TRUE;
  5594. END GtrALALLoop;
  5595. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5596. BEGIN
  5597. RETURN ApplyBinaryAABOp( left, right, GtrALALLoop , FALSE);
  5598. END ">";
  5599. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5600. VAR lval, rval: LONGINT;
  5601. BEGIN
  5602. WHILE (len > 0) DO
  5603. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5604. IF rval < lval THEN RETURN FALSE END;
  5605. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5606. END;
  5607. RETURN TRUE;
  5608. END LeqALALLoop;
  5609. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5610. BEGIN
  5611. RETURN ApplyBinaryAABOp( left, right, LeqALALLoop , FALSE);
  5612. END "<=";
  5613. (** SIZE *)
  5614. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5615. VAR lval, rval: SIZE;
  5616. BEGIN
  5617. WHILE (len > 0) DO
  5618. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5619. IF rval >= lval THEN RETURN FALSE END;
  5620. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5621. END;
  5622. RETURN TRUE;
  5623. END GtrAZAZLoop;
  5624. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5625. BEGIN
  5626. RETURN ApplyBinaryAABOp( left, right, GtrAZAZLoop , FALSE);
  5627. END ">";
  5628. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5629. VAR lval, rval: SIZE;
  5630. BEGIN
  5631. WHILE (len > 0) DO
  5632. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5633. IF rval < lval THEN RETURN FALSE END;
  5634. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5635. END;
  5636. RETURN TRUE;
  5637. END LeqAZAZLoop;
  5638. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5639. BEGIN
  5640. RETURN ApplyBinaryAABOp( left, right, LeqAZAZLoop , FALSE);
  5641. END "<=";
  5642. (** SIZE *)
  5643. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5644. VAR lval, rval: REAL;
  5645. BEGIN
  5646. WHILE (len > 0) DO
  5647. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5648. IF rval >= lval THEN RETURN FALSE END;
  5649. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5650. END;
  5651. RETURN TRUE;
  5652. END GtrARARLoop;
  5653. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5654. BEGIN
  5655. RETURN ApplyBinaryAABOp( left, right, GtrARARLoop , FALSE);
  5656. END ">";
  5657. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5658. VAR lval, rval: REAL;
  5659. BEGIN
  5660. WHILE (len > 0) DO
  5661. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5662. IF rval < lval THEN RETURN FALSE END;
  5663. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5664. END;
  5665. RETURN TRUE;
  5666. END LeqARARLoop;
  5667. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5668. BEGIN
  5669. RETURN ApplyBinaryAABOp( left, right, LeqARARLoop , FALSE);
  5670. END "<=";
  5671. (** LONGREAL *)
  5672. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5673. VAR lval, rval: LONGREAL;
  5674. BEGIN
  5675. WHILE (len > 0) DO
  5676. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5677. IF rval >= lval THEN RETURN FALSE END;
  5678. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5679. END;
  5680. RETURN TRUE;
  5681. END GtrAXAXLoop;
  5682. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5683. BEGIN
  5684. RETURN ApplyBinaryAABOp( left, right, GtrAXAXLoop , FALSE);
  5685. END ">";
  5686. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5687. VAR lval, rval: LONGREAL;
  5688. BEGIN
  5689. WHILE (len > 0) DO
  5690. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5691. IF rval < lval THEN RETURN FALSE END;
  5692. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5693. END;
  5694. RETURN TRUE;
  5695. END LeqAXAXLoop;
  5696. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5697. BEGIN
  5698. RETURN ApplyBinaryAABOp( left, right, LeqAXAXLoop , FALSE);
  5699. END "<=";
  5700. (*** equals: array x array -> boolean ********************************************************************)
  5701. (** BOOLEAN *)
  5702. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5703. VAR lval, rval: BOOLEAN;
  5704. BEGIN
  5705. WHILE (len > 0) DO
  5706. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5707. IF rval # lval THEN RETURN FALSE END;
  5708. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5709. END;
  5710. RETURN TRUE;
  5711. END EqlABABLoop;
  5712. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5713. BEGIN
  5714. RETURN ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5715. END "=";
  5716. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5717. BEGIN
  5718. RETURN ~ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5719. END "#";
  5720. (** SHORTINT *)
  5721. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5722. VAR lval, rval: SHORTINT;
  5723. BEGIN
  5724. WHILE (len > 0) DO
  5725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5726. IF rval # lval THEN RETURN FALSE END;
  5727. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5728. END;
  5729. RETURN TRUE;
  5730. END EqlASASLoop;
  5731. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5732. BEGIN
  5733. RETURN ApplyBinaryAABOp( left, right, EqlASASLoop , FALSE);
  5734. END "=";
  5735. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5736. BEGIN
  5737. RETURN ~ApplyBinaryAABOp( left, right, EqlASASLoop, FALSE );
  5738. END "#";
  5739. (** INTEGER *)
  5740. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5741. VAR lval, rval: INTEGER;
  5742. BEGIN
  5743. WHILE (len > 0) DO
  5744. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5745. IF rval # lval THEN RETURN FALSE END;
  5746. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5747. END;
  5748. RETURN TRUE;
  5749. END EqlAIAILoop;
  5750. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5751. BEGIN
  5752. RETURN ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5753. END "=";
  5754. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5755. BEGIN
  5756. RETURN ~ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5757. END "#";
  5758. (** LONGINT *)
  5759. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5760. VAR lval, rval: LONGINT;
  5761. BEGIN
  5762. WHILE (len > 0) DO
  5763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5764. IF rval # lval THEN RETURN FALSE END;
  5765. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5766. END;
  5767. RETURN TRUE;
  5768. END EqlALALLoop;
  5769. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5770. BEGIN
  5771. RETURN ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5772. END "=";
  5773. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5774. BEGIN
  5775. RETURN ~ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5776. END "#";
  5777. (** SIZE *)
  5778. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5779. VAR lval, rval: SIZE;
  5780. BEGIN
  5781. WHILE (len > 0) DO
  5782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5783. IF rval # lval THEN RETURN FALSE END;
  5784. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5785. END;
  5786. RETURN TRUE;
  5787. END EqlAZAZLoop;
  5788. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5789. BEGIN
  5790. RETURN ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5791. END "=";
  5792. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ~ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5795. END "#";
  5796. (** REAL *)
  5797. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5798. VAR lval, rval: REAL;
  5799. BEGIN
  5800. WHILE (len > 0) DO
  5801. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5802. IF rval # lval THEN RETURN FALSE END;
  5803. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5804. END;
  5805. RETURN TRUE;
  5806. END EqlARARLoop;
  5807. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5808. BEGIN
  5809. RETURN ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5810. END "=";
  5811. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5812. BEGIN
  5813. RETURN ~ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5814. END "#";
  5815. (** LONGREAL *)
  5816. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5817. VAR lval, rval: LONGREAL;
  5818. BEGIN
  5819. WHILE (len > 0) DO
  5820. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5821. IF rval # lval THEN RETURN FALSE END;
  5822. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5823. END;
  5824. RETURN TRUE;
  5825. END EqlAXAXLoop;
  5826. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5827. BEGIN
  5828. RETURN ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5829. END "=";
  5830. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5831. BEGIN
  5832. RETURN ~ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5833. END "#";
  5834. (** COMPLEX *)
  5835. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5836. VAR lval, rval: COMPLEX;
  5837. BEGIN
  5838. WHILE (len > 0) DO
  5839. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5840. IF rval # lval THEN RETURN FALSE END;
  5841. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5842. END;
  5843. RETURN TRUE;
  5844. END EqlACACLoop;
  5845. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5846. BEGIN
  5847. RETURN ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5848. END "=";
  5849. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5850. BEGIN
  5851. RETURN ~ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5852. END "#";
  5853. (** LONGCOMPLEX *)
  5854. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5855. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5856. BEGIN
  5857. WHILE (len > 0) DO
  5858. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5859. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5860. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5861. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5862. END;
  5863. RETURN TRUE;
  5864. END EqlALZALZLoop;
  5865. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5866. BEGIN
  5867. RETURN ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5868. END "=";
  5869. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5870. BEGIN
  5871. RETURN ~ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5872. END "#";
  5873. (*** equals: array x scalar -> boolean ********************************************************************)
  5874. (** BOOLEAN *)
  5875. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5876. VAR lval, rval: BOOLEAN;
  5877. BEGIN
  5878. SYSTEM.GET( radr, rval );
  5879. WHILE (len > 0) DO
  5880. SYSTEM.GET( ladr, lval );
  5881. IF lval # rval THEN RETURN FALSE END;
  5882. INC( ladr, linc ); DEC( len );
  5883. END;
  5884. RETURN TRUE;
  5885. END EqlABSBLoop;
  5886. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5887. right: BOOLEAN ): BOOLEAN;
  5888. BEGIN
  5889. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlABSBLoop );
  5890. END "=";
  5891. OPERATOR "="*( left: BOOLEAN;
  5892. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5893. BEGIN
  5894. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlABSBLoop );
  5895. END "=";
  5896. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5897. right: BOOLEAN ): BOOLEAN;
  5898. BEGIN
  5899. RETURN ~(left = right);
  5900. END "#";
  5901. OPERATOR "#"*( left: BOOLEAN;
  5902. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5903. BEGIN
  5904. RETURN ~( left = right );
  5905. END "#";
  5906. (** SHORTINT *)
  5907. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5908. VAR lval, rval: SHORTINT;
  5909. BEGIN
  5910. SYSTEM.GET( radr, rval );
  5911. WHILE (len > 0) DO
  5912. SYSTEM.GET( ladr, lval );
  5913. IF lval # rval THEN RETURN FALSE END;
  5914. INC( ladr, linc ); DEC( len );
  5915. END;
  5916. RETURN TRUE;
  5917. END EqlASSSLoop;
  5918. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlASSSLoop );
  5921. END "=";
  5922. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlASSSLoop );
  5925. END "=";
  5926. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5927. BEGIN
  5928. RETURN ~( left= right );
  5929. END "#";
  5930. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5931. BEGIN
  5932. RETURN ~( left= right );
  5933. END "#";
  5934. (** INTEGER *)
  5935. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5936. VAR lval, rval: INTEGER;
  5937. BEGIN
  5938. SYSTEM.GET( radr, rval );
  5939. WHILE (len > 0) DO
  5940. SYSTEM.GET( ladr, lval );
  5941. IF lval # rval THEN RETURN FALSE END;
  5942. INC( ladr, linc ); DEC( len );
  5943. END;
  5944. RETURN TRUE;
  5945. END EqlAISILoop;
  5946. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5947. BEGIN
  5948. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAISILoop );
  5949. END "=";
  5950. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5951. BEGIN
  5952. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAISILoop );
  5953. END "=";
  5954. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5955. BEGIN
  5956. RETURN ~( left = right );
  5957. END "#";
  5958. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5959. BEGIN
  5960. RETURN ~( left = right );
  5961. END "#";
  5962. (** LONGINT *)
  5963. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5964. VAR lval, rval: LONGINT;
  5965. BEGIN
  5966. SYSTEM.GET( radr, rval );
  5967. WHILE (len > 0) DO
  5968. SYSTEM.GET( ladr, lval );
  5969. IF lval # rval THEN RETURN FALSE END;
  5970. INC( ladr, linc ); DEC( len );
  5971. END;
  5972. RETURN TRUE;
  5973. END EqlALSLLoop;
  5974. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5975. right: LONGINT ): BOOLEAN;
  5976. BEGIN
  5977. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlALSLLoop );
  5978. END "=";
  5979. OPERATOR "="*( left: LONGINT;
  5980. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5981. BEGIN
  5982. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5983. END "=";
  5984. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5985. right: LONGINT ): BOOLEAN;
  5986. BEGIN
  5987. RETURN ~(left = right);
  5988. END "#";
  5989. OPERATOR "#"*( left: LONGINT;
  5990. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5991. BEGIN
  5992. RETURN ~(left = right);
  5993. END "#";
  5994. (** SIZE *)
  5995. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5996. VAR lval, rval: SIZE;
  5997. BEGIN
  5998. SYSTEM.GET( radr, rval );
  5999. WHILE (len > 0) DO
  6000. SYSTEM.GET( ladr, lval );
  6001. IF lval # rval THEN RETURN FALSE END;
  6002. INC( ladr, linc ); DEC( len );
  6003. END;
  6004. RETURN TRUE;
  6005. END EqlAZSZLoop;
  6006. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  6007. right: SIZE ): BOOLEAN;
  6008. BEGIN
  6009. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAZSZLoop );
  6010. END "=";
  6011. OPERATOR "="*( left: SIZE;
  6012. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6013. BEGIN
  6014. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  6015. END "=";
  6016. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  6017. right: SIZE ): BOOLEAN;
  6018. BEGIN
  6019. RETURN ~(left = right);
  6020. END "#";
  6021. OPERATOR "#"*( left: SIZE;
  6022. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6023. BEGIN
  6024. RETURN ~(left = right);
  6025. END "#";
  6026. (** REAL *)
  6027. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6028. VAR lval, rval: REAL;
  6029. BEGIN
  6030. SYSTEM.GET( radr, rval );
  6031. WHILE (len > 0) DO
  6032. SYSTEM.GET( ladr, lval );
  6033. IF lval # rval THEN RETURN FALSE END;
  6034. INC( ladr, linc ); DEC( len );
  6035. END;
  6036. RETURN TRUE;
  6037. END EqlARSRLoop;
  6038. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  6039. right: REAL ): BOOLEAN;
  6040. BEGIN
  6041. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlARSRLoop );
  6042. END "=";
  6043. OPERATOR "="*( left: REAL;
  6044. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6045. BEGIN
  6046. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlARSRLoop );
  6047. END "=";
  6048. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  6049. right: REAL ): BOOLEAN;
  6050. BEGIN
  6051. RETURN ~( left = right );
  6052. END "#";
  6053. OPERATOR "#"*( left: REAL;
  6054. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6055. BEGIN
  6056. RETURN ~( left = right );
  6057. END "#";
  6058. (** LONGREAL *)
  6059. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6060. VAR lval, rval: LONGREAL;
  6061. BEGIN
  6062. SYSTEM.GET( radr, rval );
  6063. WHILE (len > 0) DO
  6064. SYSTEM.GET( ladr, lval );
  6065. IF lval # rval THEN RETURN FALSE END;
  6066. INC( ladr, linc ); DEC( len );
  6067. END;
  6068. RETURN TRUE;
  6069. END EqlAXSXLoop;
  6070. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6071. right: LONGREAL ): BOOLEAN;
  6072. BEGIN
  6073. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAXSXLoop );
  6074. END "=";
  6075. OPERATOR "="*( left: LONGREAL;
  6076. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6077. BEGIN
  6078. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAXSXLoop );
  6079. END "=";
  6080. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6081. right: LONGREAL ): BOOLEAN;
  6082. BEGIN
  6083. RETURN ~( left = right );
  6084. END "#";
  6085. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6086. BEGIN
  6087. RETURN ~( left= right );
  6088. END "#";
  6089. (*** gtr : array x scalar -> boolean ********************************************************************)
  6090. (** SHORTINT *)
  6091. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6092. VAR lval, rval: SHORTINT;
  6093. BEGIN
  6094. SYSTEM.GET( radr, rval );
  6095. WHILE (len > 0) DO
  6096. SYSTEM.GET( ladr, lval );
  6097. IF lval <= rval THEN RETURN FALSE END;
  6098. INC( ladr, linc ); DEC( len );
  6099. END;
  6100. RETURN TRUE;
  6101. END GtrASSSLoop;
  6102. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6103. BEGIN
  6104. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrASSSLoop );
  6105. END ">";
  6106. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6107. BEGIN
  6108. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrASSSLoop );
  6109. END "<";
  6110. (** INTEGER *)
  6111. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6112. VAR lval, rval: INTEGER;
  6113. BEGIN
  6114. SYSTEM.GET( radr, rval );
  6115. WHILE (len > 0) DO
  6116. SYSTEM.GET( ladr, lval );
  6117. IF lval <= rval THEN RETURN FALSE END;
  6118. INC( ladr, linc ); DEC( len );
  6119. END;
  6120. RETURN TRUE;
  6121. END GtrAISILoop;
  6122. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6123. BEGIN
  6124. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAISILoop );
  6125. END ">";
  6126. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6127. BEGIN
  6128. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAISILoop );
  6129. END "<";
  6130. (** LONGINT *)
  6131. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6132. VAR lval, rval: LONGINT;
  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 GtrALSLLoop;
  6142. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6143. BEGIN
  6144. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrALSLLoop );
  6145. END ">";
  6146. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6147. BEGIN
  6148. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrALSLLoop );
  6149. END "<";
  6150. (** SIZE *)
  6151. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6152. VAR lval, rval: SIZE;
  6153. BEGIN
  6154. SYSTEM.GET( radr, rval );
  6155. WHILE (len > 0) DO
  6156. SYSTEM.GET( ladr, lval );
  6157. IF lval <= rval THEN RETURN FALSE END;
  6158. INC( ladr, linc ); DEC( len );
  6159. END;
  6160. RETURN TRUE;
  6161. END GtrAZSZLoop;
  6162. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6163. BEGIN
  6164. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAZSZLoop );
  6165. END ">";
  6166. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6167. BEGIN
  6168. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAZSZLoop );
  6169. END "<";
  6170. (** REAL *)
  6171. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6172. VAR lval, rval: REAL;
  6173. BEGIN
  6174. SYSTEM.GET( radr, rval );
  6175. WHILE (len > 0) DO
  6176. SYSTEM.GET( ladr, lval );
  6177. IF lval <= rval THEN RETURN FALSE END;
  6178. INC( ladr, linc ); DEC( len );
  6179. END;
  6180. RETURN TRUE;
  6181. END GtrARSRLoop;
  6182. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6183. right: REAL ): BOOLEAN;
  6184. BEGIN
  6185. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrARSRLoop );
  6186. END ">";
  6187. OPERATOR "<"*( left: REAL;
  6188. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6189. BEGIN
  6190. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrARSRLoop );
  6191. END "<";
  6192. (** LONGREAL *)
  6193. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6194. VAR lval, rval: LONGREAL;
  6195. BEGIN
  6196. SYSTEM.GET( radr, rval );
  6197. WHILE (len > 0) DO
  6198. SYSTEM.GET( ladr, lval );
  6199. IF lval <= rval THEN RETURN FALSE END;
  6200. INC( ladr, linc ); DEC( len );
  6201. END;
  6202. RETURN TRUE;
  6203. END GtrAXSXLoop;
  6204. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6205. right: LONGREAL ): BOOLEAN;
  6206. BEGIN
  6207. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAXSXLoop );
  6208. END ">";
  6209. OPERATOR "<"*( left: LONGREAL;
  6210. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6211. BEGIN
  6212. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAXSXLoop );
  6213. END "<";
  6214. (*** geq : array x scalar -> boolean ********************************************************************)
  6215. (** SHORTINT *)
  6216. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6217. VAR lval, rval: SHORTINT;
  6218. BEGIN
  6219. SYSTEM.GET( radr, rval );
  6220. WHILE (len > 0) DO
  6221. SYSTEM.GET( ladr, lval );
  6222. IF lval < rval THEN RETURN FALSE END;
  6223. INC( ladr, linc ); DEC( len );
  6224. END;
  6225. RETURN TRUE;
  6226. END GeqASSSLoop;
  6227. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6228. right: SHORTINT ): BOOLEAN;
  6229. BEGIN
  6230. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqASSSLoop );
  6231. END ">=";
  6232. OPERATOR "<="*( left: SHORTINT;
  6233. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6234. BEGIN
  6235. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqASSSLoop );
  6236. END "<=";
  6237. (** INTEGER *)
  6238. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6239. VAR lval, rval: INTEGER;
  6240. BEGIN
  6241. SYSTEM.GET( radr, rval );
  6242. WHILE (len > 0) DO
  6243. SYSTEM.GET( ladr, lval );
  6244. IF lval < rval THEN RETURN FALSE END;
  6245. INC( ladr, linc ); DEC( len );
  6246. END;
  6247. RETURN TRUE;
  6248. END GeqAISILoop;
  6249. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6250. BEGIN
  6251. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAISILoop );
  6252. END ">=";
  6253. OPERATOR "<="*( left: INTEGER;
  6254. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6255. BEGIN
  6256. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAISILoop );
  6257. END "<=";
  6258. (** LONGINT *)
  6259. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6260. VAR lval, rval: LONGINT;
  6261. BEGIN
  6262. SYSTEM.GET( radr, rval );
  6263. WHILE (len > 0) DO
  6264. SYSTEM.GET( ladr, lval );
  6265. IF lval < rval THEN RETURN FALSE END;
  6266. INC( ladr, linc ); DEC( len );
  6267. END;
  6268. RETURN TRUE;
  6269. END GeqALSLLoop;
  6270. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6271. right: LONGINT ): BOOLEAN;
  6272. BEGIN
  6273. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqALSLLoop );
  6274. END ">=";
  6275. OPERATOR "<="*( left: LONGINT;
  6276. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6277. BEGIN
  6278. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqALSLLoop );
  6279. END "<=";
  6280. (** SIZE *)
  6281. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6282. VAR lval, rval: SIZE;
  6283. BEGIN
  6284. SYSTEM.GET( radr, rval );
  6285. WHILE (len > 0) DO
  6286. SYSTEM.GET( ladr, lval );
  6287. IF lval < rval THEN RETURN FALSE END;
  6288. INC( ladr, linc ); DEC( len );
  6289. END;
  6290. RETURN TRUE;
  6291. END GeqAZSZLoop;
  6292. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6293. right: SIZE ): BOOLEAN;
  6294. BEGIN
  6295. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAZSZLoop );
  6296. END ">=";
  6297. OPERATOR "<="*( left:SIZE;
  6298. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6299. BEGIN
  6300. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAZSZLoop );
  6301. END "<=";
  6302. (** REAL *)
  6303. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6304. VAR lval, rval: REAL;
  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 GeqARSRLoop;
  6314. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6315. right: REAL ): BOOLEAN;
  6316. BEGIN
  6317. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqARSRLoop );
  6318. END ">=";
  6319. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6320. BEGIN
  6321. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqARSRLoop );
  6322. END "<=";
  6323. (** LONGREAL *)
  6324. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6325. VAR lval, rval: LONGREAL;
  6326. BEGIN
  6327. SYSTEM.GET( radr, rval );
  6328. WHILE (len > 0) DO
  6329. SYSTEM.GET( ladr, lval );
  6330. IF lval < rval THEN RETURN FALSE END;
  6331. INC( ladr, linc ); DEC( len );
  6332. END;
  6333. RETURN TRUE;
  6334. END GeqAXSXLoop;
  6335. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6336. BEGIN
  6337. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAXSXLoop );
  6338. END ">=";
  6339. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6340. BEGIN
  6341. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAXSXLoop );
  6342. END "<=";
  6343. (*** leq : array x scalar -> boolean ********************************************************************)
  6344. (** SHORTINT *)
  6345. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6346. VAR lval, rval: SHORTINT;
  6347. BEGIN
  6348. SYSTEM.GET( radr, rval );
  6349. WHILE (len > 0) DO
  6350. SYSTEM.GET( ladr, lval );
  6351. IF lval > rval THEN RETURN FALSE END;
  6352. INC( ladr, linc ); DEC( len );
  6353. END;
  6354. RETURN TRUE;
  6355. END LeqASSSLoop;
  6356. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6357. BEGIN
  6358. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqASSSLoop );
  6359. END "<=";
  6360. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6361. BEGIN
  6362. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqASSSLoop );
  6363. END ">=";
  6364. (** INTEGER *)
  6365. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6366. VAR lval, rval: INTEGER;
  6367. BEGIN
  6368. SYSTEM.GET( radr, rval );
  6369. WHILE (len > 0) DO
  6370. SYSTEM.GET( ladr, lval );
  6371. IF lval > rval THEN RETURN FALSE END;
  6372. INC( ladr, linc ); DEC( len );
  6373. END;
  6374. RETURN TRUE;
  6375. END LeqAISILoop;
  6376. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6377. BEGIN
  6378. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAISILoop );
  6379. END "<=";
  6380. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6381. BEGIN
  6382. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAISILoop );
  6383. END ">=";
  6384. (** LONGINT *)
  6385. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6386. VAR lval, rval: LONGINT;
  6387. BEGIN
  6388. SYSTEM.GET( radr, rval );
  6389. WHILE (len > 0) DO
  6390. SYSTEM.GET( ladr, lval );
  6391. IF lval > rval THEN RETURN FALSE END;
  6392. INC( ladr, linc ); DEC( len );
  6393. END;
  6394. RETURN TRUE;
  6395. END LeqALSLLoop;
  6396. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6397. BEGIN
  6398. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqALSLLoop );
  6399. END "<=";
  6400. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6401. BEGIN
  6402. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqALSLLoop );
  6403. END ">=";
  6404. (** SIZE *)
  6405. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6406. VAR lval, rval: SIZE;
  6407. BEGIN
  6408. SYSTEM.GET( radr, rval );
  6409. WHILE (len > 0) DO
  6410. SYSTEM.GET( ladr, lval );
  6411. IF lval > rval THEN RETURN FALSE END;
  6412. INC( ladr, linc ); DEC( len );
  6413. END;
  6414. RETURN TRUE;
  6415. END LeqAZSZLoop;
  6416. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6417. BEGIN
  6418. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAZSZLoop );
  6419. END "<=";
  6420. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6421. BEGIN
  6422. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAZSZLoop );
  6423. END ">=";
  6424. (** REAL *)
  6425. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6426. VAR lval, rval: REAL;
  6427. BEGIN
  6428. SYSTEM.GET( radr, rval );
  6429. WHILE (len > 0) DO
  6430. SYSTEM.GET( ladr, lval );
  6431. IF lval > rval THEN RETURN FALSE END;
  6432. INC( ladr, linc ); DEC( len );
  6433. END;
  6434. RETURN TRUE;
  6435. END LeqARSRLoop;
  6436. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6437. BEGIN
  6438. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqARSRLoop );
  6439. END "<=";
  6440. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6441. BEGIN
  6442. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqARSRLoop );
  6443. END ">=";
  6444. (** LONGREAL *)
  6445. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6446. VAR lval, rval: LONGREAL;
  6447. BEGIN
  6448. SYSTEM.GET( radr, rval );
  6449. WHILE (len > 0) DO
  6450. SYSTEM.GET( ladr, lval );
  6451. IF lval > rval THEN RETURN FALSE END;
  6452. INC( ladr, linc ); DEC( len );
  6453. END;
  6454. RETURN TRUE;
  6455. END LeqAXSXLoop;
  6456. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6457. BEGIN
  6458. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAXSXLoop );
  6459. END "<=";
  6460. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6461. BEGIN
  6462. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAXSXLoop );
  6463. END ">=";
  6464. (*** lss: array x scalar -> boolean ********************************************************************)
  6465. (** SHORTINT *)
  6466. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6467. VAR lval, rval: SHORTINT;
  6468. BEGIN
  6469. SYSTEM.GET( radr, rval );
  6470. WHILE (len > 0) DO
  6471. SYSTEM.GET( ladr, lval );
  6472. IF lval >= rval THEN RETURN FALSE END;
  6473. INC( ladr, linc ); DEC( len );
  6474. END;
  6475. RETURN TRUE;
  6476. END LssASSSLoop;
  6477. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6478. BEGIN
  6479. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssASSSLoop );
  6480. END "<";
  6481. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6482. BEGIN
  6483. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssASSSLoop );
  6484. END ">";
  6485. (** INTEGER *)
  6486. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6487. VAR lval, rval: INTEGER;
  6488. BEGIN
  6489. SYSTEM.GET( radr, rval );
  6490. WHILE (len > 0) DO
  6491. SYSTEM.GET( ladr, lval );
  6492. IF lval >= rval THEN RETURN FALSE END;
  6493. INC( ladr, linc ); DEC( len );
  6494. END;
  6495. RETURN TRUE;
  6496. END LssAISILoop;
  6497. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6498. BEGIN
  6499. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAISILoop );
  6500. END "<";
  6501. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6502. BEGIN
  6503. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAISILoop );
  6504. END ">";
  6505. (** LONGINT *)
  6506. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6507. VAR lval, rval: LONGINT;
  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 LssALSLLoop;
  6517. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6518. BEGIN
  6519. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssALSLLoop );
  6520. END "<";
  6521. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6522. BEGIN
  6523. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssALSLLoop );
  6524. END ">";
  6525. (** SIZE *)
  6526. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6527. VAR lval, rval: SIZE;
  6528. BEGIN
  6529. SYSTEM.GET( radr, rval );
  6530. WHILE (len > 0) DO
  6531. SYSTEM.GET( ladr, lval );
  6532. IF lval >= rval THEN RETURN FALSE END;
  6533. INC( ladr, linc ); DEC( len );
  6534. END;
  6535. RETURN TRUE;
  6536. END LssAZSZLoop;
  6537. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6538. BEGIN
  6539. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAZSZLoop );
  6540. END "<";
  6541. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6542. BEGIN
  6543. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAZSZLoop );
  6544. END ">";
  6545. (** REAL *)
  6546. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6547. VAR lval, rval: REAL;
  6548. BEGIN
  6549. SYSTEM.GET( radr, rval );
  6550. WHILE (len > 0) DO
  6551. SYSTEM.GET( ladr, lval );
  6552. IF lval >= rval THEN RETURN FALSE END;
  6553. INC( ladr, linc ); DEC( len );
  6554. END;
  6555. RETURN TRUE;
  6556. END LssARSRLoop;
  6557. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6558. right: REAL ): BOOLEAN;
  6559. BEGIN
  6560. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssARSRLoop );
  6561. END "<";
  6562. OPERATOR ">"*( left: REAL;
  6563. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6564. BEGIN
  6565. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssARSRLoop );
  6566. END ">";
  6567. (** LONGREAL *)
  6568. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6569. VAR lval, rval: LONGREAL;
  6570. BEGIN
  6571. SYSTEM.GET( radr, rval );
  6572. WHILE (len > 0) DO
  6573. SYSTEM.GET( ladr, lval );
  6574. IF lval >= rval THEN RETURN FALSE END;
  6575. INC( ladr, linc ); DEC( len );
  6576. END;
  6577. RETURN TRUE;
  6578. END LssAXSXLoop;
  6579. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6580. right: LONGREAL ): BOOLEAN;
  6581. BEGIN
  6582. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAXSXLoop );
  6583. END "<";
  6584. OPERATOR ">"*( left: LONGREAL;
  6585. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6586. BEGIN
  6587. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAXSXLoop );
  6588. END ">";
  6589. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6590. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6591. VAR lval, val: LONGREAL;
  6592. BEGIN
  6593. SYSTEM.GET( radr, val );
  6594. WHILE (len > 0) DO
  6595. SYSTEM.GET( ladr, lval );
  6596. INC( ladr, linc ); DEC( len );
  6597. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6598. INC(dadr,dinc);
  6599. END;
  6600. END MaxAXSXLoop;
  6601. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6602. TYPE Type = LONGREAL;
  6603. BEGIN
  6604. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6605. RETURN RESULT
  6606. END "MAX";
  6607. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6608. VAR lval, val: REAL;
  6609. BEGIN
  6610. SYSTEM.GET( radr, val );
  6611. WHILE (len > 0) DO
  6612. SYSTEM.GET( ladr, lval );
  6613. INC( ladr, linc ); DEC( len );
  6614. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6615. INC(dadr,dinc);
  6616. END;
  6617. END MaxARSRLoop;
  6618. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6619. TYPE Type = REAL;
  6620. BEGIN
  6621. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6622. RETURN RESULT
  6623. END "MAX";
  6624. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6625. VAR lval, val: LONGINT;
  6626. BEGIN
  6627. SYSTEM.GET( radr, val );
  6628. WHILE (len > 0) DO
  6629. SYSTEM.GET( ladr, lval );
  6630. INC( ladr, linc ); DEC( len );
  6631. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6632. INC(dadr,dinc);
  6633. END;
  6634. END MaxALSLLoop;
  6635. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6636. TYPE Type = LONGINT;
  6637. BEGIN
  6638. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6639. RETURN RESULT
  6640. END "MAX";
  6641. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6642. VAR lval, val: INTEGER;
  6643. BEGIN
  6644. SYSTEM.GET( radr, val );
  6645. WHILE (len > 0) DO
  6646. SYSTEM.GET( ladr, lval );
  6647. INC( ladr, linc ); DEC( len );
  6648. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6649. INC(dadr,dinc);
  6650. END;
  6651. END MaxAISILoop;
  6652. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6653. TYPE Type = INTEGER;
  6654. BEGIN
  6655. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6656. RETURN RESULT
  6657. END "MAX";
  6658. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6659. VAR lval, val: SHORTINT;
  6660. BEGIN
  6661. SYSTEM.GET( radr, val );
  6662. WHILE (len > 0) DO
  6663. SYSTEM.GET( ladr, lval );
  6664. INC( ladr, linc ); DEC( len );
  6665. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6666. INC(dadr,dinc);
  6667. END;
  6668. END MaxASSSLoop;
  6669. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6670. TYPE Type = SHORTINT;
  6671. BEGIN
  6672. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6673. RETURN RESULT
  6674. END "MAX";
  6675. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6676. VAR lval, val: LONGREAL;
  6677. BEGIN
  6678. SYSTEM.GET( radr, val );
  6679. WHILE (len > 0) DO
  6680. SYSTEM.GET( ladr, lval );
  6681. INC( ladr, linc ); DEC( len );
  6682. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6683. INC(dadr,dinc);
  6684. END;
  6685. END MinAXSXLoop;
  6686. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6687. TYPE Type = LONGREAL;
  6688. BEGIN
  6689. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6690. RETURN RESULT
  6691. END "MIN";
  6692. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6693. VAR lval, val: REAL;
  6694. BEGIN
  6695. SYSTEM.GET( radr, val );
  6696. WHILE (len > 0) DO
  6697. SYSTEM.GET( ladr, lval );
  6698. INC( ladr, linc ); DEC( len );
  6699. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6700. INC(dadr,dinc);
  6701. END;
  6702. END MinARSRLoop;
  6703. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6704. TYPE Type = REAL;
  6705. BEGIN
  6706. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6707. RETURN RESULT
  6708. END "MIN";
  6709. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6710. VAR lval, val: LONGINT;
  6711. BEGIN
  6712. SYSTEM.GET( radr, val );
  6713. WHILE (len > 0) DO
  6714. SYSTEM.GET( ladr, lval );
  6715. INC( ladr, linc ); DEC( len );
  6716. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6717. INC(dadr,dinc);
  6718. END;
  6719. END MinALSLLoop;
  6720. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6721. TYPE Type = LONGINT;
  6722. BEGIN
  6723. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6724. RETURN RESULT
  6725. END "MIN";
  6726. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6727. VAR lval, val: INTEGER;
  6728. BEGIN
  6729. SYSTEM.GET( radr, val );
  6730. WHILE (len > 0) DO
  6731. SYSTEM.GET( ladr, lval );
  6732. INC( ladr, linc ); DEC( len );
  6733. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6734. INC(dadr,dinc);
  6735. END;
  6736. END MinAISILoop;
  6737. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6738. TYPE Type = INTEGER;
  6739. BEGIN
  6740. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6741. RETURN RESULT
  6742. END "MIN";
  6743. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6744. VAR lval, val: SHORTINT;
  6745. BEGIN
  6746. SYSTEM.GET( radr, val );
  6747. WHILE (len > 0) DO
  6748. SYSTEM.GET( ladr, lval );
  6749. INC( ladr, linc ); DEC( len );
  6750. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6751. INC(dadr,dinc);
  6752. END;
  6753. END MinASSSLoop;
  6754. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6755. TYPE Type = SHORTINT;
  6756. BEGIN
  6757. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6758. RETURN RESULT
  6759. END "MIN";
  6760. (**** binary max/min operators array x array -> array ********************************************************************)
  6761. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6762. VAR lval, rval: LONGREAL;
  6763. BEGIN
  6764. WHILE (len > 0) DO
  6765. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6766. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6767. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6768. INC(dadr,dinc);
  6769. END;
  6770. END MaxAXAXLoop;
  6771. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6772. BEGIN
  6773. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MaxAXAXLoop );
  6774. RETURN RESULT
  6775. END "MAX";
  6776. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6777. VAR lval, rval: REAL ;
  6778. BEGIN
  6779. WHILE (len > 0) DO
  6780. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6781. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6782. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6783. INC(dadr,dinc);
  6784. END;
  6785. END MaxARARLoop;
  6786. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6787. BEGIN
  6788. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MaxARARLoop );
  6789. RETURN RESULT
  6790. END "MAX";
  6791. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6792. VAR lval, rval: LONGINT;
  6793. BEGIN
  6794. WHILE (len > 0) DO
  6795. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6796. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6797. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6798. INC(dadr,dinc);
  6799. END;
  6800. END MaxALALLoop;
  6801. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6802. BEGIN
  6803. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MaxALALLoop );
  6804. RETURN RESULT
  6805. END "MAX";
  6806. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6807. VAR lval, rval: INTEGER;
  6808. BEGIN
  6809. WHILE (len > 0) DO
  6810. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6811. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6812. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6813. INC(dadr,dinc);
  6814. END;
  6815. END MaxAIAILoop;
  6816. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6817. BEGIN
  6818. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MaxAIAILoop );
  6819. RETURN RESULT
  6820. END "MAX";
  6821. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6822. VAR lval, rval: SHORTINT;
  6823. BEGIN
  6824. WHILE (len > 0) DO
  6825. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6826. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6827. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6828. INC(dadr,dinc);
  6829. END;
  6830. END MaxASASLoop;
  6831. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6832. BEGIN
  6833. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MaxASASLoop );
  6834. RETURN RESULT
  6835. END "MAX";
  6836. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6837. VAR lval, rval: LONGREAL;
  6838. BEGIN
  6839. WHILE (len > 0) DO
  6840. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6841. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6842. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6843. INC(dadr,dinc);
  6844. END;
  6845. END MinAXAXLoop;
  6846. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6847. BEGIN
  6848. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MinAXAXLoop );
  6849. RETURN RESULT
  6850. END "MIN";
  6851. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6852. VAR lval, rval: REAL ;
  6853. BEGIN
  6854. WHILE (len > 0) DO
  6855. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6856. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6857. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6858. INC(dadr,dinc);
  6859. END;
  6860. END MinARARLoop;
  6861. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6862. BEGIN
  6863. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MinARARLoop );
  6864. RETURN RESULT
  6865. END "MIN";
  6866. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6867. VAR lval, rval: LONGINT;
  6868. BEGIN
  6869. WHILE (len > 0) DO
  6870. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6871. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6872. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6873. INC(dadr,dinc);
  6874. END;
  6875. END MinALALLoop;
  6876. *)
  6877. TYPE
  6878. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6879. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6880. BEGIN
  6881. WHILE (len > 0) DO
  6882. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6883. ladr := ladr + linc;
  6884. radr := radr + rinc;
  6885. dadr := dadr + dinc;
  6886. DEC(len);
  6887. END;
  6888. END MinALALLoop;
  6889. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6890. BEGIN
  6891. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MinALALLoop );
  6892. RETURN RESULT
  6893. END "MIN";
  6894. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6895. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6896. BEGIN
  6897. WHILE (len > 0) DO
  6898. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6899. ladr := ladr + linc;
  6900. radr := radr + rinc;
  6901. dadr := dadr + dinc;
  6902. DEC(len);
  6903. END;
  6904. END MinAYAYLoop;
  6905. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE ;
  6906. BEGIN
  6907. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SIZE ), MinAYAYLoop );
  6908. RETURN RESULT
  6909. END "MIN";
  6910. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6911. VAR lval, rval: INTEGER;
  6912. BEGIN
  6913. WHILE (len > 0) DO
  6914. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6915. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6916. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6917. INC(dadr,dinc);
  6918. END;
  6919. END MinAIAILoop;
  6920. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6921. BEGIN
  6922. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MinAIAILoop );
  6923. RETURN RESULT
  6924. END "MIN";
  6925. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6926. VAR lval, rval: SHORTINT;
  6927. BEGIN
  6928. WHILE (len > 0) DO
  6929. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6930. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6931. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6932. INC(dadr,dinc);
  6933. END;
  6934. END MinASASLoop;
  6935. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6936. BEGIN
  6937. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MinASASLoop );
  6938. RETURN RESULT
  6939. END "MIN";
  6940. (**** unary operators array -> scalar ********************************************************************)
  6941. (*** min: array -> scalar ****************************************)
  6942. (** SHORTINT *)
  6943. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6944. VAR lval, dval: SHORTINT;
  6945. BEGIN
  6946. SYSTEM.GET( dadr, dval );
  6947. WHILE (len > 0) DO
  6948. SYSTEM.GET( ladr, lval );
  6949. IF lval < dval THEN dval := lval END;
  6950. INC( ladr, linc ); DEC( len );
  6951. END;
  6952. SYSTEM.PUT( dadr, dval );
  6953. END MinASLoop;
  6954. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6955. TYPE Type = SHORTINT;
  6956. VAR val: Type;
  6957. BEGIN
  6958. val := MAX( Type );
  6959. ApplyUnaryASOp( ADDRESSOF( val ), left , MinASLoop ); RETURN val;
  6960. END "MIN";
  6961. (** INTEGER *)
  6962. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6963. VAR lval, dval: INTEGER;
  6964. BEGIN
  6965. SYSTEM.GET( dadr, dval );
  6966. WHILE (len > 0) DO
  6967. SYSTEM.GET( ladr, lval );
  6968. IF lval < dval THEN dval := lval END;
  6969. INC( ladr, linc ); DEC( len );
  6970. END;
  6971. SYSTEM.PUT( dadr, dval );
  6972. END MinAILoop;
  6973. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6974. TYPE Type = INTEGER;
  6975. VAR val: Type;
  6976. BEGIN
  6977. val := MAX( Type );
  6978. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAILoop ); RETURN val;
  6979. END "MIN";
  6980. (** LONGINT *)
  6981. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6982. VAR lval, dval: LONGINT;
  6983. BEGIN
  6984. SYSTEM.GET( dadr, dval );
  6985. WHILE (len > 0) DO
  6986. SYSTEM.GET( ladr, lval );
  6987. IF lval < dval THEN dval := lval END;
  6988. INC( ladr, linc ); DEC( len );
  6989. END;
  6990. SYSTEM.PUT( dadr, dval );
  6991. END MinALLoop;
  6992. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6993. TYPE Type = LONGINT;
  6994. VAR val: Type;
  6995. BEGIN
  6996. val := MAX( Type );
  6997. ApplyUnaryASOp( ADDRESSOF( val ), left , MinALLoop ); RETURN val;
  6998. END "MIN";
  6999. (** SIZE *)
  7000. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7001. VAR lval, dval: SIZE;
  7002. BEGIN
  7003. SYSTEM.GET( dadr, dval );
  7004. WHILE (len > 0) DO
  7005. SYSTEM.GET( ladr, lval );
  7006. IF lval < dval THEN dval := lval END;
  7007. INC( ladr, linc ); DEC( len );
  7008. END;
  7009. SYSTEM.PUT( dadr, dval );
  7010. END MinAZLoop;
  7011. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7012. TYPE Type = SIZE;
  7013. VAR val: Type;
  7014. BEGIN
  7015. val := MAX( Type );
  7016. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAZLoop ); RETURN val;
  7017. END "MIN";
  7018. (** REAL *)
  7019. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7020. VAR lval, dval: REAL;
  7021. BEGIN
  7022. SYSTEM.GET( dadr, dval );
  7023. WHILE (len > 0) DO
  7024. SYSTEM.GET( ladr, lval );
  7025. IF lval < dval THEN dval := lval END;
  7026. INC( ladr, linc ); DEC( len );
  7027. END;
  7028. SYSTEM.PUT( dadr, dval );
  7029. END MinARLoop;
  7030. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7031. TYPE Type = REAL;
  7032. VAR val: Type;
  7033. BEGIN
  7034. val := MAX( Type );
  7035. ApplyUnaryASOp( ADDRESSOF( val ), left, MinARLoop ); RETURN val;
  7036. END "MIN";
  7037. (** LONGREAL *)
  7038. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7039. VAR lval, dval: LONGREAL;
  7040. BEGIN
  7041. SYSTEM.GET( dadr, dval );
  7042. WHILE (len > 0) DO
  7043. SYSTEM.GET( ladr, lval );
  7044. IF lval < dval THEN dval := lval END;
  7045. INC( ladr, linc ); DEC( len );
  7046. END;
  7047. SYSTEM.PUT( dadr, dval );
  7048. END MinAXLoop;
  7049. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7050. TYPE Type = LONGREAL;
  7051. VAR val: Type;
  7052. BEGIN
  7053. val := MAX( Type );
  7054. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAXLoop ); RETURN val;
  7055. END "MIN";
  7056. (*** max: array -> scalar ********************************************************************)
  7057. (** SHORTINT *)
  7058. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7059. VAR lval, dval: SHORTINT;
  7060. BEGIN
  7061. SYSTEM.GET( dadr, dval );
  7062. WHILE (len > 0) DO
  7063. SYSTEM.GET( ladr, lval );
  7064. IF lval > dval THEN dval := lval END;
  7065. INC( ladr, linc ); DEC( len );
  7066. END;
  7067. SYSTEM.PUT( dadr, dval );
  7068. END MaxASLoop;
  7069. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7070. TYPE Type = SHORTINT;
  7071. VAR val: Type;
  7072. BEGIN
  7073. val := MIN( Type );
  7074. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxASLoop ); RETURN val;
  7075. END "MAX";
  7076. (** INTEGER *)
  7077. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7078. VAR lval, dval: INTEGER;
  7079. BEGIN
  7080. SYSTEM.GET( dadr, dval );
  7081. WHILE (len > 0) DO
  7082. SYSTEM.GET( ladr, lval );
  7083. IF lval > dval THEN dval := lval END;
  7084. INC( ladr, linc ); DEC( len );
  7085. END;
  7086. SYSTEM.PUT( dadr, dval );
  7087. END MaxAILoop;
  7088. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7089. TYPE Type = INTEGER;
  7090. VAR val: Type;
  7091. BEGIN
  7092. val := MIN( Type );
  7093. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAILoop ); RETURN val;
  7094. END "MAX";
  7095. (** LONGINT *)
  7096. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7097. VAR lval, dval: LONGINT;
  7098. BEGIN
  7099. SYSTEM.GET( dadr, dval );
  7100. WHILE (len > 0) DO
  7101. SYSTEM.GET( ladr, lval );
  7102. IF lval > dval THEN dval := lval END;
  7103. INC( ladr, linc ); DEC( len );
  7104. END;
  7105. SYSTEM.PUT( dadr, dval );
  7106. END MaxALLoop;
  7107. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7108. TYPE Type = LONGINT;
  7109. VAR val: Type;
  7110. BEGIN
  7111. val := MIN( Type );
  7112. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxALLoop ); RETURN val;
  7113. END "MAX";
  7114. (** REAL *)
  7115. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7116. VAR lval, dval: REAL;
  7117. BEGIN
  7118. SYSTEM.GET( dadr, dval );
  7119. WHILE (len > 0) DO
  7120. SYSTEM.GET( ladr, lval );
  7121. IF lval > dval THEN dval := lval END;
  7122. INC( ladr, linc ); DEC( len );
  7123. END;
  7124. SYSTEM.PUT( dadr, dval );
  7125. END MaxARLoop;
  7126. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7127. TYPE Type = REAL;
  7128. VAR val: Type;
  7129. BEGIN
  7130. val := MIN( Type );
  7131. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxARLoop ); RETURN val;
  7132. END "MAX";
  7133. (** LONGREAL *)
  7134. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7135. VAR lval, dval: LONGREAL;
  7136. BEGIN
  7137. SYSTEM.GET( dadr, dval );
  7138. WHILE (len > 0) DO
  7139. SYSTEM.GET( ladr, lval );
  7140. IF lval > dval THEN dval := lval END;
  7141. INC( ladr, linc ); DEC( len );
  7142. END;
  7143. SYSTEM.PUT( dadr, dval );
  7144. END MaxAXLoop;
  7145. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7146. TYPE Type = LONGREAL;
  7147. VAR val: Type;
  7148. BEGIN
  7149. val := MIN( Type );
  7150. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAXLoop ); RETURN val;
  7151. END "MAX";
  7152. (*** LEN: array -> array **)
  7153. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  7154. VAR src: ADDRESS; dim,i: SIZE;
  7155. BEGIN
  7156. src := SYSTEM.VAL(ADDRESS,left);
  7157. dim := GetDim( src );
  7158. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7159. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(src,i)) END;
  7160. RETURN RESULT
  7161. END "LEN";
  7162. (*** SUM: array -> scalar ********************************************************************)
  7163. (** SHORTINT *)
  7164. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7165. VAR lval, dval: SHORTINT;
  7166. BEGIN
  7167. SYSTEM.GET( dadr, dval );
  7168. WHILE (len > 0) DO
  7169. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7170. END;
  7171. SYSTEM.PUT( dadr, dval );
  7172. END SumASLoop;
  7173. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7174. TYPE Type = SHORTINT;
  7175. VAR val: Type;
  7176. BEGIN
  7177. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumASLoop );
  7178. RETURN val;
  7179. END "SUM";
  7180. (** INTEGER *)
  7181. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7182. VAR lval, dval: INTEGER;
  7183. BEGIN
  7184. SYSTEM.GET( dadr, dval );
  7185. WHILE (len > 0) DO
  7186. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7187. END;
  7188. SYSTEM.PUT( dadr, dval );
  7189. END SumAILoop;
  7190. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7191. TYPE Type = INTEGER;
  7192. VAR val: Type;
  7193. BEGIN
  7194. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAILoop );
  7195. RETURN val;
  7196. END "SUM";
  7197. (** LONGINT *)
  7198. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7199. VAR lval, dval: LONGINT;
  7200. BEGIN
  7201. SYSTEM.GET( dadr, dval );
  7202. WHILE (len > 0) DO
  7203. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7204. END;
  7205. SYSTEM.PUT( dadr, dval );
  7206. END SumALLoop;
  7207. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7208. TYPE Type = LONGINT;
  7209. VAR val: Type;
  7210. BEGIN
  7211. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumALLoop );
  7212. RETURN val;
  7213. END "SUM";
  7214. (** SIZE *)
  7215. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7216. VAR lval, dval: SIZE;
  7217. BEGIN
  7218. SYSTEM.GET( dadr, dval );
  7219. WHILE (len > 0) DO
  7220. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7221. END;
  7222. SYSTEM.PUT( dadr, dval );
  7223. END SumAYLoop;
  7224. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7225. TYPE Type = SIZE;
  7226. VAR val: Type;
  7227. BEGIN
  7228. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAYLoop );
  7229. RETURN val;
  7230. END "SUM";
  7231. (** REAL *)
  7232. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7233. VAR lval, dval: REAL;
  7234. BEGIN
  7235. SYSTEM.GET( dadr, dval );
  7236. WHILE (len > 0) DO
  7237. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7238. END;
  7239. SYSTEM.PUT( dadr, dval );
  7240. END SumARLoop;
  7241. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7242. TYPE Type = REAL;
  7243. VAR val: Type;
  7244. BEGIN
  7245. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumARLoop );
  7246. RETURN val;
  7247. END "SUM";
  7248. (** LONGREAL *)
  7249. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7250. VAR lval, dval: LONGREAL;
  7251. BEGIN
  7252. SYSTEM.GET( dadr, dval );
  7253. WHILE (len > 0) DO
  7254. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7255. END;
  7256. SYSTEM.PUT( dadr, dval );
  7257. END SumAXLoop;
  7258. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7259. TYPE Type = LONGREAL;
  7260. VAR val: Type;
  7261. BEGIN
  7262. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAXLoop );
  7263. RETURN val;
  7264. END "SUM";
  7265. (** COMPLEX *)
  7266. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7267. VAR lval, dval: COMPLEX;
  7268. BEGIN
  7269. SYSTEM.GET( dadr, dval );
  7270. WHILE (len > 0) DO
  7271. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7272. END;
  7273. SYSTEM.PUT( dadr, dval );
  7274. END SumAZLoop;
  7275. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7276. TYPE Type = COMPLEX;
  7277. VAR val: Type;
  7278. BEGIN
  7279. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAZLoop );
  7280. RETURN val;
  7281. END "SUM";
  7282. (** LONGCOMPLEX *)
  7283. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7284. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7285. BEGIN
  7286. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7287. WHILE (len > 0) DO
  7288. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7289. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7290. INC( ladr, linc ); DEC( len );
  7291. END;
  7292. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7293. END SumALZLoop;
  7294. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7295. TYPE Type = LONGCOMPLEX;
  7296. VAR val: Type;
  7297. BEGIN
  7298. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumALZLoop );
  7299. RETURN val;
  7300. END "SUM";
  7301. (*** monadic ABS array -> array ********************************************************************)
  7302. (** SHORTINT *)
  7303. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7304. VAR lval: SHORTINT;
  7305. BEGIN
  7306. WHILE (len > 0) DO
  7307. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7308. INC( dadr, dinc ); DEC( len );
  7309. END;
  7310. END AbsLoopS;
  7311. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  7312. BEGIN
  7313. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), AbsLoopS );
  7314. RETURN RESULT
  7315. END "ABS";
  7316. (** INTEGER *)
  7317. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7318. VAR lval: INTEGER;
  7319. BEGIN
  7320. WHILE (len > 0) DO
  7321. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7322. INC( dadr, dinc ); DEC( len );
  7323. END;
  7324. END AbsLoopI;
  7325. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  7326. BEGIN
  7327. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), AbsLoopI );
  7328. RETURN RESULT
  7329. END "ABS";
  7330. (** LONGINT *)
  7331. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7332. VAR lval: LONGINT;
  7333. BEGIN
  7334. WHILE (len > 0) DO
  7335. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7336. INC( dadr, dinc ); DEC( len );
  7337. END;
  7338. END AbsLoopL;
  7339. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  7340. BEGIN
  7341. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), AbsLoopL );
  7342. RETURN RESULT
  7343. END "ABS";
  7344. (** REAL *)
  7345. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7346. VAR lval: REAL;
  7347. BEGIN
  7348. WHILE (len > 0) DO
  7349. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7350. INC( dadr, dinc ); DEC( len );
  7351. END;
  7352. END AbsLoopR;
  7353. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  7354. BEGIN
  7355. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopR );
  7356. RETURN RESULT
  7357. END "ABS";
  7358. (** LONGREAL *)
  7359. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7360. VAR lval: LONGREAL;
  7361. BEGIN
  7362. WHILE (len > 0) DO
  7363. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7364. INC( dadr, dinc ); DEC( len );
  7365. END;
  7366. END AbsLoopX;
  7367. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7368. BEGIN
  7369. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopX );
  7370. RETURN RESULT
  7371. END "ABS";
  7372. (** COMPLEX *)
  7373. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7374. VAR lval: COMPLEX;
  7375. BEGIN
  7376. WHILE (len > 0) DO
  7377. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7378. INC( dadr, dinc ); DEC( len );
  7379. END;
  7380. END AbsLoopZ;
  7381. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF REAL;
  7382. BEGIN
  7383. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopZ );
  7384. RETURN RESULT
  7385. END "ABS";
  7386. (** LONGCOMPLEX *)
  7387. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7388. VAR lvalRe, lvalIm: LONGREAL;
  7389. BEGIN
  7390. WHILE (len > 0) DO
  7391. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7392. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7393. INC( ladr, linc );
  7394. INC( dadr, dinc ); DEC( len );
  7395. END;
  7396. END AbsLoopLZ;
  7397. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7398. BEGIN
  7399. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopLZ );
  7400. RETURN RESULT
  7401. END "ABS";
  7402. (*** assign number to array (initialisation) ********************************************************************)
  7403. (** BOOLEAN *)
  7404. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7405. VAR lval: BOOLEAN;
  7406. BEGIN
  7407. SYSTEM.GET( ladr, lval );
  7408. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7409. END AssignSBABLoop;
  7410. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF BOOLEAN; right: BOOLEAN);
  7411. BEGIN
  7412. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSBABLoop );
  7413. END ":=";
  7414. (** SHORTINT*)
  7415. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7416. VAR lval: SHORTINT;
  7417. BEGIN
  7418. SYSTEM.GET( ladr, lval );
  7419. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7420. END AssignSSASLoop;
  7421. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF SHORTINT; right: SHORTINT);
  7422. BEGIN
  7423. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSSASLoop );
  7424. END ":=";
  7425. (**INTEGER *)
  7426. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7427. VAR lval: INTEGER;
  7428. BEGIN
  7429. SYSTEM.GET( ladr, lval );
  7430. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7431. END AssignSIAILoop;
  7432. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF INTEGER; right: INTEGER);
  7433. BEGIN
  7434. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSIAILoop );
  7435. END ":=";
  7436. (** LONGINT *)
  7437. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7438. VAR lval: LONGINT;
  7439. BEGIN
  7440. SYSTEM.GET( ladr, lval );
  7441. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7442. END AssignSLALLoop;
  7443. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGINT; right: LONGINT);
  7444. BEGIN
  7445. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSLALLoop );
  7446. END ":=";
  7447. (** HUGEINT *)
  7448. PROCEDURE AssignSHAHLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7449. VAR dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: HUGEINT END; lval: HUGEINT;
  7450. BEGIN
  7451. dval := dadr;
  7452. SYSTEM.GET( ladr, lval );
  7453. WHILE (len > 0) DO
  7454. dval.val := lval;
  7455. dval := dval + dinc;
  7456. DEC( len );
  7457. END;
  7458. END AssignSHAHLoop;
  7459. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF HUGEINT; right: HUGEINT);
  7460. BEGIN
  7461. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSHAHLoop );
  7462. END ":=";
  7463. (** REAL *)
  7464. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7465. VAR lval: REAL;
  7466. BEGIN
  7467. SYSTEM.GET( ladr, lval );
  7468. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7469. END AssignSRARLoop;
  7470. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF REAL; right: REAL);
  7471. BEGIN
  7472. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSRARLoop );
  7473. END ":=";
  7474. (** LONGREAL *)
  7475. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7476. VAR lval: LONGREAL;
  7477. BEGIN
  7478. SYSTEM.GET( ladr, lval );
  7479. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7480. END AssignSXAXLoop;
  7481. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGREAL; right: LONGREAL);
  7482. BEGIN
  7483. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSXAXLoop );
  7484. END ":=";
  7485. (** COMPLEX *)
  7486. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7487. VAR lval: COMPLEX;
  7488. BEGIN
  7489. SYSTEM.GET( ladr, lval );
  7490. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7491. END AssignSZAZLoop;
  7492. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF COMPLEX; right: COMPLEX);
  7493. BEGIN
  7494. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSZAZLoop );
  7495. END ":=";
  7496. (** LONGCOMPLEX *)
  7497. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7498. VAR lvalRe, lvalIm: LONGREAL;
  7499. BEGIN
  7500. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7501. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7502. END AssignSLZALZLoop;
  7503. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7504. BEGIN
  7505. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSLZALZLoop );
  7506. END ":=";
  7507. (*** matrix multipliation ********************************************************************)
  7508. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7509. rows, cols, elementsize: SIZE ): ANY;
  7510. VAR p: ANY;
  7511. BEGIN
  7512. (*
  7513. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7514. *)
  7515. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7516. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7517. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7518. PutPtr( dest, p); RETURN p;
  7519. END AllocateMatrix;
  7520. PROCEDURE AllocateVector(CONST dest: UnsafeArrayT; l0, elementsize: SIZE );
  7521. VAR p: ANY;
  7522. BEGIN
  7523. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7524. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7525. PutPtr( dest, p );
  7526. END AllocateVector;
  7527. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7528. loop: BinaryAASLoop;
  7529. fast: FastMatMul ); (* Size= element-size *)
  7530. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7531. p: ANY; overlap: BOOLEAN; destOld: UnsafeArray; destNew: UnsafeArrayT;
  7532. BEGIN
  7533. (*
  7534. <- 1 ->
  7535. xxx xxxx -> xxxx
  7536. ^ xxx xxxx xxxx
  7537. 0 xxx xxxx xxxx
  7538. v xxx xxxx
  7539. xxx xxxx
  7540. Len(..,1): #columns ; Inc(..,1): inc in rows
  7541. Len(..,0): #rows ; Inc(..,0): inc between rows
  7542. *)
  7543. (* apply multiplication D = L * R *)
  7544. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7545. colsL := GetLen( left, 1 ); (* # left columns *)
  7546. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7547. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7548. (* check geometric restriction *)
  7549. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7550. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7551. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7552. IF RangeFlag IN GetFlags( dest ) THEN
  7553. Halt( GeometryMismatch, left, right, dest )
  7554. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7555. END;
  7556. END;
  7557. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7558. IF overlap THEN
  7559. destOld := dest; destNew := NIL;
  7560. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7561. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7562. dest := destNew;
  7563. END;
  7564. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7565. HALT( 9999 )
  7566. END;
  7567. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7568. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7569. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7570. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7571. (*
  7572. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7573. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7574. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7575. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7576. *)
  7577. IF rowsL = 0 THEN RETURN
  7578. ELSIF colsL=0 THEN RETURN
  7579. ELSIF colsR=0 THEN RETURN
  7580. ELSIF (fast = NIL ) OR
  7581. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7582. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7583. radri := radr; dadri := dadr; colsRi := colsR;
  7584. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7585. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7586. INC( dadri, incD ); DEC( colsRi );
  7587. END;
  7588. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7589. END;
  7590. END;
  7591. IF overlap THEN CopyContent( destOld, dest, Size );
  7592. END;
  7593. END ApplyMatMulLoop;
  7594. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7595. Size: SIZE; loop: BinaryAASLoop;
  7596. fast: FastMatMul ); (* Size= element-size *)
  7597. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE;
  7598. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7599. BEGIN
  7600. (*
  7601. <- 0 ->
  7602. xxx T(xxx) -> T(xxxxx)
  7603. xxx
  7604. 1 xxx
  7605. xxx
  7606. xxx
  7607. Len(..,0): #columns ; Inc(..,0): inc in rows
  7608. Len(..,1): #rows ; Inc(..,1): inc between rows
  7609. *)
  7610. (* check geometric restriction *)
  7611. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7612. Halt( GeometryMismatch, left, right,0 );
  7613. END;
  7614. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7615. l2 := GetLen( left, 1 ); (* inner loop len *)
  7616. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l1, Size );
  7617. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7618. IF RangeFlag IN GetFlags( dest ) THEN
  7619. Halt( GeometryMismatch, left, right, dest );
  7620. ELSE AllocateVector( dest, l1, Size );
  7621. END;
  7622. END;
  7623. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7624. IF overlap THEN
  7625. destOld := dest; destNew := NIL;
  7626. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7627. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7628. dest := destNew;
  7629. END;
  7630. (*
  7631. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7632. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7633. END;
  7634. *)
  7635. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7636. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7637. di0 := GetIncr( dest, 0 );
  7638. IF l1=0 THEN RETURN
  7639. ELSIF l2=0 THEN RETURN
  7640. ELSIF (fast = NIL ) OR
  7641. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7642. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7643. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7644. DEC( l1 );
  7645. END;
  7646. END;
  7647. IF overlap THEN CopyContent( destOld, dest, Size );
  7648. END;
  7649. END ApplyMatVecMulLoop;
  7650. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7651. Size: SIZE; loop: BinaryAASLoop;
  7652. fast: FastMatMul ); (* Size= element-size *)
  7653. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7654. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7655. BEGIN
  7656. (*
  7657. <- 0 ->
  7658. xxx xxxx -> xxxx
  7659. xxxx
  7660. 1 xxxx
  7661. Len(..,0): #columns ; Inc(..,0): inc in rows
  7662. Len(..,1): #rows ; Inc(..,1): inc between rows
  7663. *)
  7664. (* check geometric restriction *)
  7665. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7666. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7667. l2 := GetLen( right, 0 ); (* inner loop len *)
  7668. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l0, Size );
  7669. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7670. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7671. ELSE AllocateVector( dest, l0, Size );
  7672. END;
  7673. END;
  7674. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7675. IF overlap THEN
  7676. destOld := dest; destNew := NIL;
  7677. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7678. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7679. dest := destNew;
  7680. END;
  7681. (*
  7682. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7683. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7684. END;
  7685. *)
  7686. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7687. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7688. di0 := GetIncr( dest, 0 );
  7689. IF l2=0 THEN RETURN
  7690. ELSIF l0=0 THEN RETURN
  7691. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7692. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7693. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7694. DEC( l0 );
  7695. END;
  7696. END;
  7697. IF overlap THEN CopyContent( destOld, dest, Size );
  7698. END;
  7699. END ApplyVecMatMulLoop;
  7700. (** SHORTINT *)
  7701. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7702. VAR lval, rval, dval: SHORTINT;
  7703. BEGIN
  7704. dval := 0;
  7705. WHILE (len > 0) DO
  7706. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7707. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7708. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7709. END;
  7710. SYSTEM.PUT( dadr, dval );
  7711. END MatMulASASLoop;
  7712. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7713. BEGIN
  7714. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7715. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7716. RETURN RESULT
  7717. END "*";
  7718. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7719. BEGIN
  7720. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7721. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7722. RETURN RESULT
  7723. END "*";
  7724. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7725. BEGIN
  7726. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7727. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7728. RETURN RESULT
  7729. END "*";
  7730. (** INTEGER *)
  7731. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7732. VAR lval, rval, dval: INTEGER;
  7733. BEGIN
  7734. dval := 0;
  7735. WHILE (len > 0) DO
  7736. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7737. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7738. END;
  7739. SYSTEM.PUT( dadr, dval );
  7740. END MatMulAIAILoop;
  7741. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7742. BEGIN
  7743. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7744. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7745. RETURN RESULT
  7746. END "*";
  7747. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7748. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7749. BEGIN
  7750. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7751. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7752. RETURN RESULT
  7753. END "*";
  7754. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7755. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7756. BEGIN
  7757. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7758. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7759. RETURN RESULT
  7760. END "*";
  7761. (** LONGINT *)
  7762. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7763. VAR lval, rval, dval: LONGINT;
  7764. BEGIN
  7765. dval := 0;
  7766. WHILE (len > 0) DO
  7767. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7768. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7769. END;
  7770. SYSTEM.PUT( dadr, dval );
  7771. END MatMulALALLoop;
  7772. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7773. BEGIN
  7774. (*
  7775. KernelLog.String("MatMulALAL");
  7776. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7777. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7778. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7779. KernelLog.Ln;
  7780. *)
  7781. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7782. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7783. RETURN RESULT
  7784. END "*";
  7785. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7786. BEGIN
  7787. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7788. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7789. RETURN RESULT
  7790. END "*";
  7791. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7792. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7793. BEGIN
  7794. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7795. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7796. RETURN RESULT
  7797. END "*";
  7798. (** REAL *)
  7799. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7800. VAR lval, rval, dval: REAL;
  7801. BEGIN
  7802. dval := 0;
  7803. WHILE (len > 0) DO
  7804. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7805. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7806. END;
  7807. SYSTEM.PUT( dadr, dval );
  7808. END MatMulARARLoop;
  7809. (*
  7810. Optimized for small matrices (Alexey Morozov)
  7811. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7812. *)
  7813. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7814. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7815. BEGIN
  7816. dadr := GetAdr(ADDRESSOF(RESULT));
  7817. ladr := GetAdr(ADDRESSOF(left));
  7818. radr := GetAdr(ADDRESSOF(right));
  7819. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7820. IF (ladr # dadr) & (radr # dadr) THEN
  7821. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7822. CASE SYSTEM.VAL(LONGINT,flags) OF
  7823. Mat2x2:
  7824. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7825. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7826. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7827. END;
  7828. END;
  7829. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7830. ELSE
  7831. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7832. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7833. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7834. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7835. END;
  7836. |Mat3x3:
  7837. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7838. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7839. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7840. END;
  7841. END;
  7842. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7843. ELSE
  7844. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7845. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7846. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7847. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7848. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7849. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7850. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7851. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7852. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7853. END;
  7854. |Mat4x4:
  7855. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7856. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7857. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7858. END;
  7859. END;
  7860. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7861. ELSE
  7862. 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];
  7863. 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];
  7864. 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];
  7865. 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];
  7866. 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];
  7867. 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];
  7868. 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];
  7869. 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];
  7870. 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];
  7871. 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];
  7872. 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];
  7873. 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];
  7874. 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];
  7875. 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];
  7876. 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];
  7877. 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];
  7878. END;
  7879. ELSE
  7880. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7881. loopMatMulARAR, matMulR );
  7882. END;
  7883. ELSE
  7884. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7885. loopMatMulARAR, matMulR );
  7886. END;
  7887. RETURN RESULT
  7888. END "*";
  7889. (*
  7890. Optimized for small arrays (Alexey Morozov)
  7891. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7892. *)
  7893. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7894. VAR
  7895. flags: SET; dadr, ladr, radr: ADDRESS;
  7896. v0, v1, v2: REAL;
  7897. BEGIN
  7898. dadr := GetAdr(ADDRESSOF(RESULT));
  7899. ladr := GetAdr(ADDRESSOF(left));
  7900. radr := GetAdr(ADDRESSOF(right));
  7901. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7902. CASE SYSTEM.VAL(LONGINT,flags) OF
  7903. MatVec2x2:
  7904. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7905. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7906. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7907. END;
  7908. END;
  7909. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7910. ELSE
  7911. (* account possible overlapping *)
  7912. v0 := right[0];
  7913. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7914. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7915. END;
  7916. |MatVec3x3:
  7917. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7918. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7919. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7920. END;
  7921. END;
  7922. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7923. ELSE
  7924. (* account possible overlapping *)
  7925. v0 := right[0]; v1 := right[1];
  7926. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7927. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7928. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7929. END;
  7930. |MatVec4x4:
  7931. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7932. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7933. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7934. END;
  7935. END;
  7936. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7937. ELSE
  7938. (* account possible overlapping *)
  7939. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7940. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7941. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7942. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7943. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7944. END;
  7945. ELSE
  7946. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7947. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7948. END;
  7949. RETURN RESULT
  7950. END "*";
  7951. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7952. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7953. BEGIN
  7954. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7955. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7956. RETURN RESULT
  7957. END "*";
  7958. (** LONGREAL *)
  7959. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7960. VAR lval, rval, dval: LONGREAL;
  7961. BEGIN
  7962. dval := 0;
  7963. WHILE (len > 0) DO
  7964. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7965. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7966. END;
  7967. SYSTEM.PUT( dadr, dval );
  7968. END MatMulAXAXLoop;
  7969. (*
  7970. Optimized for small matrices (Alexey Morozov)
  7971. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7972. *)
  7973. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7974. VAR
  7975. flags: SET; dadr, ladr, radr: ADDRESS;
  7976. BEGIN
  7977. dadr := GetAdr(ADDRESSOF(RESULT));
  7978. ladr := GetAdr(ADDRESSOF(left));
  7979. radr := GetAdr(ADDRESSOF(right));
  7980. IF (ladr # dadr) & (radr # dadr) THEN
  7981. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7982. CASE SYSTEM.VAL(LONGINT,flags) OF
  7983. Mat2x2:
  7984. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7985. IF dadr = 0 THEN NEW(RESULT,2,2);
  7986. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7987. END;
  7988. END;
  7989. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7990. ELSE
  7991. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7992. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7993. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7994. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7995. END;
  7996. |Mat3x3:
  7997. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7998. IF dadr = 0 THEN NEW(RESULT,3,3);
  7999. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8000. END;
  8001. END;
  8002. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  8003. ELSE
  8004. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  8005. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  8006. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  8007. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  8008. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  8009. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  8010. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  8011. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  8012. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  8013. END;
  8014. |Mat4x4:
  8015. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  8016. IF dadr = 0 THEN NEW(RESULT,4,4);
  8017. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8018. END;
  8019. END;
  8020. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  8021. ELSE
  8022. 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];
  8023. 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];
  8024. 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];
  8025. 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];
  8026. 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];
  8027. 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];
  8028. 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];
  8029. 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];
  8030. 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];
  8031. 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];
  8032. 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];
  8033. 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];
  8034. 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];
  8035. 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];
  8036. 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];
  8037. 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];
  8038. END;
  8039. ELSE
  8040. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  8041. loopMatMulAXAX, matMulX );
  8042. END;
  8043. ELSE
  8044. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  8045. loopMatMulAXAX, matMulX );
  8046. END;
  8047. RETURN RESULT
  8048. END "*";
  8049. (*
  8050. Optimized for small arrays (Alexey Morozov)
  8051. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  8052. *)
  8053. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  8054. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8055. VAR
  8056. flags: SET; dadr, ladr, radr: ADDRESS;
  8057. v0, v1, v2: LONGREAL;
  8058. BEGIN
  8059. dadr := GetAdr(ADDRESSOF(RESULT));
  8060. ladr := GetAdr(ADDRESSOF(left));
  8061. radr := GetAdr(ADDRESSOF(right));
  8062. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8063. CASE SYSTEM.VAL(LONGINT,flags) OF
  8064. MatVec2x2:
  8065. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8066. IF dadr = 0 THEN NEW(RESULT,2);
  8067. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8068. END;
  8069. END;
  8070. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8071. ELSE
  8072. (* account possible overlapping *)
  8073. v0 := right[0];
  8074. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8075. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8076. END;
  8077. |MatVec3x3:
  8078. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8079. IF dadr = 0 THEN NEW(RESULT,3);
  8080. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8081. END;
  8082. END;
  8083. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8084. ELSE
  8085. (* account possible overlapping *)
  8086. v0 := right[0]; v1 := right[1];
  8087. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8088. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8089. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8090. END;
  8091. |MatVec4x4:
  8092. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8093. IF dadr = 0 THEN NEW(RESULT,4);
  8094. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8095. END;
  8096. END;
  8097. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8098. ELSE
  8099. (* account possible overlapping *)
  8100. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8101. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8102. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8103. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8104. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8105. END;
  8106. ELSE
  8107. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8108. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8109. END;
  8110. RETURN RESULT
  8111. END "*";
  8112. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8113. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8114. BEGIN
  8115. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8116. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8117. RETURN RESULT
  8118. END "*";
  8119. (** SHORTINT *)
  8120. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8121. VAR lval, rval, dval: SHORTINT;
  8122. BEGIN
  8123. SYSTEM.GET( dadr, dval );
  8124. WHILE (len > 0) DO
  8125. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8126. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8127. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8128. END;
  8129. SYSTEM.PUT( dadr, dval );
  8130. END MatMulIncASASLoop;
  8131. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8132. BEGIN
  8133. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8134. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8135. RETURN RESULT
  8136. END "INCMUL";
  8137. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8138. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8139. BEGIN
  8140. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8141. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8142. RETURN RESULT
  8143. END "INCMUL";
  8144. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8145. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8146. BEGIN
  8147. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8148. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8149. RETURN RESULT
  8150. END "INCMUL";
  8151. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8152. BEGIN
  8153. RESULT := -RESULT;
  8154. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8155. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8156. RESULT := -RESULT;
  8157. RETURN RESULT
  8158. END "DECMUL";
  8159. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8160. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8161. BEGIN
  8162. RESULT := -RESULT;
  8163. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8164. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8165. RESULT := -RESULT;
  8166. RETURN RESULT
  8167. END "DECMUL";
  8168. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8169. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8170. BEGIN
  8171. RESULT := -RESULT;
  8172. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8173. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8174. RESULT := -RESULT;
  8175. RETURN RESULT
  8176. END "DECMUL";
  8177. (** INTEGER *)
  8178. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8179. VAR lval, rval, dval: INTEGER;
  8180. BEGIN
  8181. SYSTEM.GET( dadr, dval );
  8182. WHILE (len > 0) DO
  8183. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8184. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8185. END;
  8186. SYSTEM.PUT( dadr, dval );
  8187. END MatMulIncAIAILoop;
  8188. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8189. BEGIN
  8190. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8191. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8192. RETURN RESULT
  8193. END "INCMUL";
  8194. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8195. BEGIN
  8196. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8197. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8198. RETURN RESULT
  8199. END "INCMUL";
  8200. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8201. BEGIN
  8202. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8203. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8204. RETURN RESULT
  8205. END "INCMUL";
  8206. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8207. BEGIN
  8208. RESULT := -RESULT;
  8209. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8210. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8211. RESULT := -RESULT;
  8212. RETURN RESULT
  8213. END "DECMUL";
  8214. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8215. BEGIN
  8216. RESULT := -RESULT;
  8217. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8218. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8219. RESULT := -RESULT;
  8220. RETURN RESULT
  8221. END "DECMUL";
  8222. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8223. BEGIN
  8224. RESULT := -RESULT;
  8225. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8226. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8227. RESULT := -RESULT;
  8228. RETURN RESULT
  8229. END "DECMUL";
  8230. (** LONGINT *)
  8231. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8232. VAR lval, rval, dval: LONGINT;
  8233. BEGIN
  8234. SYSTEM.GET( dadr, dval );
  8235. WHILE (len > 0) DO
  8236. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8237. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8238. END;
  8239. SYSTEM.PUT( dadr, dval );
  8240. END MatMulIncALALLoop;
  8241. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8242. BEGIN
  8243. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8244. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8245. RETURN RESULT
  8246. END "INCMUL";
  8247. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8248. BEGIN
  8249. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8250. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8251. RETURN RESULT
  8252. END "INCMUL";
  8253. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8254. BEGIN
  8255. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8256. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8257. RETURN RESULT
  8258. END "INCMUL";
  8259. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8260. BEGIN
  8261. RESULT := -RESULT;
  8262. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8263. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8264. RESULT := -RESULT;
  8265. RETURN RESULT
  8266. END "DECMUL";
  8267. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8268. BEGIN
  8269. RESULT := -RESULT;
  8270. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8271. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8272. RESULT := -RESULT;
  8273. RETURN RESULT
  8274. END "DECMUL";
  8275. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8276. BEGIN
  8277. RESULT := -RESULT;
  8278. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8279. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8280. RESULT := -RESULT;
  8281. RETURN RESULT
  8282. END "DECMUL";
  8283. (** REAL *)
  8284. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8285. VAR lval, rval, dval: REAL;
  8286. BEGIN
  8287. SYSTEM.GET( dadr, dval );
  8288. WHILE (len > 0) DO
  8289. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8290. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8291. END;
  8292. SYSTEM.PUT( dadr, dval );
  8293. END MatMulIncARARLoop;
  8294. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8295. BEGIN
  8296. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8297. loopMatMulIncARAR, matMulIncR );
  8298. RETURN RESULT
  8299. END "INCMUL";
  8300. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8301. BEGIN
  8302. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8303. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8304. RETURN RESULT
  8305. END "INCMUL";
  8306. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8307. BEGIN
  8308. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8309. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8310. RETURN RESULT
  8311. END "INCMUL";
  8312. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8313. BEGIN
  8314. RESULT := -RESULT;
  8315. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8316. loopMatMulIncARAR, matMulIncR );
  8317. RESULT := -RESULT;
  8318. RETURN RESULT
  8319. END "DECMUL";
  8320. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8321. BEGIN
  8322. RESULT := -RESULT;
  8323. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8324. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8325. RESULT := -RESULT;
  8326. RETURN RESULT
  8327. END "DECMUL";
  8328. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8329. BEGIN
  8330. RESULT := -RESULT;
  8331. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8332. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8333. RESULT := -RESULT;
  8334. RETURN RESULT
  8335. END "DECMUL";
  8336. (** LONGREAL *)
  8337. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8338. VAR lval, rval, dval: LONGREAL;
  8339. BEGIN
  8340. SYSTEM.GET( dadr, dval );
  8341. WHILE (len > 0) DO
  8342. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8343. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8344. END;
  8345. SYSTEM.PUT( dadr, dval );
  8346. END MatMulIncAXAXLoop;
  8347. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8348. BEGIN
  8349. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8350. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8351. RETURN RESULT
  8352. END "INCMUL";
  8353. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8354. BEGIN
  8355. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8356. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8357. RETURN RESULT
  8358. END "INCMUL";
  8359. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8360. BEGIN
  8361. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8362. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8363. RETURN RESULT
  8364. END "INCMUL";
  8365. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8366. BEGIN
  8367. RESULT := -RESULT;
  8368. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8369. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8370. RESULT := -RESULT;
  8371. RETURN RESULT
  8372. END "DECMUL";
  8373. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8374. BEGIN
  8375. RESULT := -RESULT;
  8376. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8377. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8378. RESULT := -RESULT;
  8379. RETURN RESULT
  8380. END "DECMUL";
  8381. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8382. BEGIN
  8383. RESULT := -RESULT;
  8384. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8385. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8386. RESULT := -RESULT;
  8387. RETURN RESULT
  8388. END "DECMUL";
  8389. (*** Cross product ********************************************************************)
  8390. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8391. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8392. BEGIN
  8393. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8394. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8395. END;
  8396. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8397. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8398. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8399. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8400. RETURN RESULT
  8401. END "*";
  8402. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8403. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8404. BEGIN
  8405. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8406. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8407. END;
  8408. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8409. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8410. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8411. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8412. RETURN RESULT
  8413. END "*";
  8414. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8415. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8416. BEGIN
  8417. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8418. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8419. END;
  8420. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8421. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8422. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8423. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8424. RETURN RESULT
  8425. END "*";
  8426. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8427. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8428. BEGIN
  8429. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8430. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8431. END;
  8432. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8433. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8434. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8435. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8436. RETURN RESULT
  8437. END "*";
  8438. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8439. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8440. BEGIN
  8441. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8442. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8443. END;
  8444. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8445. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8446. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8447. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8448. RETURN RESULT
  8449. END "*";
  8450. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  8451. VAR tensor: Tensor;
  8452. BEGIN
  8453. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8454. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8455. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8456. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8457. ELSE HALT(200);
  8458. END;
  8459. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8460. loopMatMulAXAX, matMulX );
  8461. RETURN RESULT
  8462. END "*";
  8463. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  8464. BEGIN
  8465. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8466. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8467. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8468. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8469. ELSE HALT(200);
  8470. END;
  8471. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8472. loopMatMulARAR, matMulR );
  8473. RETURN RESULT
  8474. END "*";
  8475. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  8476. BEGIN
  8477. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8478. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8479. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8480. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8481. ELSE HALT(200);
  8482. END;
  8483. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8484. MatMulALALLoop, NIL );
  8485. RETURN RESULT
  8486. END "*";
  8487. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  8488. BEGIN
  8489. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8490. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8491. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8492. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8493. ELSE HALT(200);
  8494. END;
  8495. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8496. MatMulAIAILoop,NIL );
  8497. RETURN RESULT
  8498. END "*";
  8499. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  8500. BEGIN
  8501. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8502. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8503. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8504. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8505. ELSE HALT(200);
  8506. END;
  8507. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8508. MatMulASASLoop, NIL );
  8509. RETURN RESULT
  8510. END "*";
  8511. (** Transpose ********************************************************************)
  8512. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8513. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8514. BEGIN
  8515. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8516. dim := GetDim( src1 ) - 1;
  8517. WHILE (dim > 0) DO
  8518. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8519. END;
  8520. dim := GetDim( src2 ) - 1;
  8521. WHILE (dim > 0) DO
  8522. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8523. END;
  8524. IF from1 < from2 THEN RETURN to1 >= from2;
  8525. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8526. ELSE RETURN TRUE;
  8527. END;
  8528. END Overlap;
  8529. (*
  8530. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8531. VAR from1, from2, to1, to2: ADDRESS;
  8532. BEGIN
  8533. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8534. DEC( dim );
  8535. WHILE (dim > 0) DO
  8536. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8537. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8538. END;
  8539. IF from1 < from2 THEN RETURN to1 >= from2;
  8540. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8541. ELSE RETURN TRUE;
  8542. END;
  8543. END Overlap;
  8544. *)
  8545. PROCEDURE AllocateTransposed( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  8546. VAR Size: SIZE;
  8547. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8548. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8549. VAR dim,max: SIZE;
  8550. BEGIN
  8551. dim := GetDim( l );
  8552. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8553. max := dim-1;
  8554. WHILE (dim > 0) DO
  8555. DEC( dim );
  8556. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8557. END;
  8558. RETURN TRUE;
  8559. END TransposedShape;
  8560. PROCEDURE NewData;
  8561. VAR max,dim, len, size: SIZE; data: ANY;
  8562. BEGIN
  8563. dim := GetDim( src ); size := elementsize;
  8564. PutDim( dest, dim );
  8565. PutSize( dest, elementsize );
  8566. max := dim-1;
  8567. WHILE (dim > 0) DO
  8568. DEC( dim );
  8569. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8570. PutInc( dest, dim, size ); size := size * len;
  8571. END;
  8572. SYSTEM.NEW( data, size + ArrayAlignment);
  8573. PutAdr( dest, Align(data) );
  8574. PutPtr( dest, data );
  8575. END NewData;
  8576. BEGIN
  8577. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8578. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8579. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8580. dest := GetArrayDesc( GetDim( src ) );
  8581. PutFlags(dest, {TensorFlag});
  8582. NewData();
  8583. RETURN TRUE;
  8584. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8585. (* check if re-allocation of descriptor is allowed *)
  8586. IF ~(TensorFlag IN GetFlags( dest )) &
  8587. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8588. HALT( 100 );
  8589. END;
  8590. dest := GetArrayDesc( GetDim( src ) );
  8591. PutFlags(dest, {TensorFlag});
  8592. NewData();
  8593. RETURN TRUE;
  8594. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8595. (* check if re-allocation of array data is allowed *)
  8596. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8597. HALT( 100 );
  8598. END;
  8599. NewData();
  8600. END;
  8601. RETURN FALSE;
  8602. END AllocateTransposed;
  8603. PROCEDURE Transpose*(dest: UnsafeArray (* untraced! *); CONST left: UnsafeArrayT; Size: SIZE );
  8604. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8605. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8606. BEGIN
  8607. WHILE (len > 0) DO
  8608. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8609. DEC( len );
  8610. END;
  8611. END CopyLoop;
  8612. BEGIN
  8613. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8614. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8615. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8616. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8617. ELSE
  8618. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8619. IF AllocateTransposed(dest,left,Size) THEN Halt(AllocationForbidden,dest,0,0); END;
  8620. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8621. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8622. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8623. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8624. WHILE (len0 > 0) DO
  8625. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8626. INC( dadr, dinc0 ); DEC( len0 );
  8627. END;
  8628. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8629. ladr := p;
  8630. ELSE
  8631. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8632. END;
  8633. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8634. dadr := GetAdr( dest );
  8635. IF (Size = 4) & (transpose4 # NIL ) THEN
  8636. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8637. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8638. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8639. ELSE
  8640. WHILE (len0 > 0) DO
  8641. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8642. INC( dadr, dinc1 ); DEC( len0 );
  8643. END;
  8644. END;
  8645. END;
  8646. END Transpose;
  8647. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8648. BEGIN
  8649. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8650. RETURN RESULT
  8651. END "`";
  8652. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8653. BEGIN
  8654. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8655. RETURN RESULT
  8656. END "`";
  8657. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8658. BEGIN
  8659. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8660. RETURN RESULT
  8661. END "`";
  8662. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8663. BEGIN
  8664. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8665. RETURN RESULT
  8666. END "`";
  8667. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8668. BEGIN
  8669. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8670. RETURN RESULT
  8671. END "`";
  8672. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8673. VAR i: SIZE;
  8674. BEGIN
  8675. FOR i := 0 TO rdim - 1 DO
  8676. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8677. END;
  8678. FOR i := 0 TO ldim - 1 DO
  8679. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8680. END;
  8681. RETURN TRUE;
  8682. END CheckTensorGeometry;
  8683. (*
  8684. PROCEDURE Zero(p: ANY; size: LONGINT);
  8685. VAR adr: LONGINT;
  8686. BEGIN
  8687. adr := SYSTEM.VAL(LONGINT,p);
  8688. WHILE(size>0) DO
  8689. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8690. END;
  8691. END Zero;
  8692. *)
  8693. PROCEDURE DoReshape*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; CONST shape: ARRAY [ * ] OF SIZE );
  8694. VAR i, Size: SIZE;
  8695. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8696. squeezingReshape: BOOLEAN;
  8697. new: UnsafeArrayT;
  8698. PROCEDURE CheckAlloc;
  8699. BEGIN
  8700. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8701. END CheckAlloc;
  8702. PROCEDURE NewDescriptor(): UnsafeArrayT;
  8703. BEGIN
  8704. CheckAlloc;
  8705. RETURN GetArrayDesc(newDim);
  8706. END NewDescriptor;
  8707. (* Added by Alexey
  8708. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8709. *)
  8710. PROCEDURE SqueezingReshape(): BOOLEAN;
  8711. VAR
  8712. i, j, n: SIZE;
  8713. BEGIN
  8714. IF oldDim > newDim THEN
  8715. i := 0; j := 0;
  8716. WHILE (i < oldDim) & (j < newDim) DO
  8717. n := GetLen(src,i);
  8718. IF n = shape[j] THEN INC(j); END;
  8719. INC(i);
  8720. END;
  8721. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8722. ELSE
  8723. squeezingReshape := FALSE;
  8724. END;
  8725. squeezingReshape := (i = oldDim) & (j = newDim);
  8726. RETURN squeezingReshape;
  8727. END SqueezingReshape;
  8728. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8729. PROCEDURE TargetContinuous(): BOOLEAN;
  8730. VAR
  8731. i, n: SIZE;
  8732. continue: BOOLEAN;
  8733. BEGIN
  8734. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8735. continue := TRUE;
  8736. WHILE (i > 0) & continue DO
  8737. n := n * GetLen(dest,i);
  8738. DEC(i);
  8739. continue := GetIncr(dest,i) = n;
  8740. END;
  8741. (*TRACE(i,continue,Size,GetSize(dest));*)
  8742. (*tod obviously size is not what I expect it to be*)
  8743. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8744. RETURN TRUE;
  8745. ELSE
  8746. RETURN FALSE;
  8747. END;
  8748. END TargetContinuous;
  8749. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8750. PROCEDURE PreservesContiguity(): BOOLEAN;
  8751. VAR
  8752. i, n: SIZE;
  8753. continue: BOOLEAN;
  8754. BEGIN
  8755. i := oldDim-1; n := GetIncr(src,i);
  8756. continue := TRUE;
  8757. WHILE (i > 0) & continue DO
  8758. n := n * GetLen(src,i);
  8759. DEC(i);
  8760. continue := GetIncr(src,i) = n;
  8761. END;
  8762. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8763. RETURN TRUE;
  8764. ELSE Err("Not yet implemented!");
  8765. END;
  8766. END PreservesContiguity;
  8767. (* Added by Alexey *)
  8768. PROCEDURE NewDescriptorForSameData(CONST src: UnsafeArrayT): UnsafeArrayT;
  8769. VAR len, size, i, j: SIZE; new: UnsafeArrayT;
  8770. BEGIN
  8771. CheckAlloc();
  8772. new:= GetArrayDesc( newDim );
  8773. IF ~squeezingReshape THEN
  8774. size := Size;
  8775. FOR i := newDim - 1 TO 0 BY -1 DO
  8776. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8777. size := size * len;
  8778. END;
  8779. ELSE (* squeezing reshape *)
  8780. j := 0; len := shape[j];
  8781. FOR i := 0 TO oldDim-1 DO
  8782. IF GetLen(src,i) = len THEN
  8783. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8784. INC(j);
  8785. IF j < newDim THEN len := shape[j]; END;
  8786. END;
  8787. END;
  8788. END;
  8789. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8790. PutFlags(new,GetFlags(new)+{RangeFlag});
  8791. END;
  8792. PutAdr( new, GetAdr(src) );
  8793. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8794. PutSize( new, Size );
  8795. RETURN new;
  8796. END NewDescriptorForSameData;
  8797. PROCEDURE NewData(VAR dest: UnsafeArrayT);
  8798. VAR len, size, i: SIZE; data: ANY;
  8799. BEGIN
  8800. size := Size;
  8801. FOR i := newDim - 1 TO 0 BY -1 DO
  8802. len := shape[i]; PutInc( dest, i, size ); PutLen( dest, i, len );
  8803. size := size * len;
  8804. END;
  8805. TRACE(size);
  8806. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8807. PutAdr( dest, Align(data) );
  8808. PutPtr( dest, data ); PutDim( dest, newDim );
  8809. PutSize( dest, Size );
  8810. END NewData;
  8811. PROCEDURE CopyData(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8812. VAR d, s: SIZE; dadr: ADDRESS;
  8813. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8814. VAR inc, len, i: SIZE;
  8815. BEGIN
  8816. IF dim = d THEN
  8817. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8818. FOR i := 0 TO len - 1 DO
  8819. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8820. END;
  8821. ELSE
  8822. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8823. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8824. END;
  8825. END Loop;
  8826. BEGIN
  8827. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8828. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8829. s := s * GetLen( src, d ); DEC( d );
  8830. END;
  8831. IF d = -1 THEN (* special case: both continuous *)
  8832. SYSTEM.MOVE( GetAdr( src ), GetAdr( dest ), s );
  8833. ELSE dadr := GetAdr( dest ); Loop( 0, GetAdr( src ) );
  8834. END;
  8835. END CopyData;
  8836. PROCEDURE CopyDescriptor(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8837. BEGIN
  8838. ASSERT( GetDim( src ) = GetDim( dest ) );
  8839. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8840. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8841. END CopyDescriptor;
  8842. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8843. VAR i: SIZE;
  8844. BEGIN
  8845. ASSERT(GetDim(dest) = newDim);
  8846. FOR i := 0 TO newDim - 1 DO
  8847. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8848. END;
  8849. RETURN FALSE;
  8850. END ShapeDiffers;
  8851. BEGIN
  8852. (*
  8853. cases
  8854. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8855. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8856. 3.) descriptor may not be reshaped: dest = RANGE
  8857. *)
  8858. (* first check invariants *)
  8859. oldDim := GetDim( src );
  8860. IF oldDim = 0 THEN oldSize := 0
  8861. ELSE
  8862. oldSize := 1;
  8863. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8864. END;
  8865. newDim := LEN( shape, 0 );
  8866. IF newDim = 0 THEN newSize := 0
  8867. ELSE
  8868. newSize := 1;
  8869. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8870. END;
  8871. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8872. Size := GetSize( src );
  8873. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8874. IF dest = src THEN (* added by Alexey *)
  8875. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8876. dest := NewDescriptorForSameData(src);
  8877. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8878. (* create a copy of the original descriptor *)
  8879. CheckAlloc();
  8880. dest := GetArrayDesc(newDim);
  8881. CopyDescriptor(src,dest);
  8882. ELSE
  8883. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8884. END;
  8885. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8886. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8887. ELSIF (dest = temporary) THEN
  8888. dest := NewDescriptorForSameData(src);
  8889. ELSIF TargetContinuous() THEN
  8890. dest := NewDescriptor(); CopyData(src, dest);
  8891. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8892. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8893. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8894. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8895. END;
  8896. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8897. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8898. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8899. NewData(dest); CopyData(src, dest);
  8900. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8901. new := NewDescriptor(); NewData(new); CopyData(src, new); CopyData(new, dest);
  8902. ELSE (* same shape, just copy *)
  8903. CopyContent( src, dest, Size ); RETURN;
  8904. END;
  8905. END DoReshape;
  8906. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8907. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8908. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8909. PROCEDURE NewData;
  8910. VAR len, size, i: SIZE;
  8911. BEGIN
  8912. size := elementSize;
  8913. FOR i := dim - 1 TO 0 BY -1 DO
  8914. len := a[i];
  8915. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8916. END;
  8917. IF tag = 0 THEN
  8918. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8919. dest.adr := Align(data);
  8920. ELSE
  8921. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8922. dest.adr := data + ADDRESS(ArrDataArrayOffset);
  8923. END;
  8924. PutPtr(dest, data);
  8925. PutSize( dest, elementSize );
  8926. END NewData;
  8927. PROCEDURE ClearData;
  8928. (*! todo *)
  8929. END ClearData;
  8930. BEGIN
  8931. dim := LEN( a,0 );
  8932. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8933. IF dest # 0 THEN
  8934. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8935. END;
  8936. descr := GetArrayDesc( LEN( a,0 ) );
  8937. dest := descr;
  8938. NewData;
  8939. Heaps.SetPC(data);
  8940. ELSE
  8941. i := 0;
  8942. same := TRUE;
  8943. WHILE (i < dim) & same DO
  8944. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8945. INC( i );
  8946. END;
  8947. IF ~same THEN
  8948. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8949. NewData;
  8950. Heaps.SetPC(data);
  8951. ELSE ClearData
  8952. END;
  8953. END;
  8954. END AllocateTensorA;
  8955. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8956. BEGIN
  8957. AllocateTensorA(a,elementSize,tag,dest);
  8958. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8959. END AllocateArrayA;
  8960. PROCEDURE DoAllocateTensorX*( VAR dest: UnsafeArrayT; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8961. VAR data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8962. PROCEDURE NewData;
  8963. VAR len, size: SIZE; i: SIZE;
  8964. BEGIN
  8965. size := Size;
  8966. FOR i := dim - 1 TO 0 BY -1 DO
  8967. len := a[i];
  8968. (*
  8969. KernelLog.Int(len,10); KernelLog.Ln;
  8970. *)
  8971. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8972. END;
  8973. IF tag = 0 THEN
  8974. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8975. PutAdr( dest, Align(data) );
  8976. ELSE
  8977. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8978. PutAdr( dest, data+ ADDRESS(ArrDataArrayOffset) );
  8979. END;
  8980. PutPtr( dest, data ); PutSize( dest, Size );
  8981. END NewData;
  8982. PROCEDURE ClearData;
  8983. (*! todo *)
  8984. END ClearData;
  8985. BEGIN
  8986. dim := LEN( a,0 );
  8987. (*! check range flag! *)
  8988. IF (dest = NIL) OR (dim # GetDim( dest )) THEN
  8989. IF dest # NIL THEN
  8990. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8991. END;
  8992. dest := GetArrayDesc( LEN( a,0 ) );
  8993. NewData;
  8994. ELSE
  8995. i := 0;
  8996. WHILE (i < dim) & same DO
  8997. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8998. INC( i );
  8999. END;
  9000. IF ~same THEN
  9001. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  9002. NewData
  9003. ELSE ClearData
  9004. END;
  9005. END;
  9006. END DoAllocateTensorX;
  9007. PROCEDURE AllocateTensorX( VAR dest: ARRAY {UNSAFE} [?] OF SIZE; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  9008. BEGIN
  9009. DoAllocateTensorX(dest,a,Size,tag);
  9010. END AllocateTensorX;
  9011. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9012. VAR dim, i: SIZE;
  9013. BEGIN
  9014. dim := GetDim( src );
  9015. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  9016. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  9017. END LenA;
  9018. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9019. VAR dim, len: SIZE; i: SIZE;
  9020. BEGIN
  9021. dim := GetDim( src ); len := LEN( dest, 0 );
  9022. IF len # dim THEN NEW( dest, dim ); END;
  9023. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  9024. END IncrA;
  9025. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  9026. VAR dim: SIZE;
  9027. BEGIN
  9028. dim := GetDim(src);
  9029. IF (d<0) OR (d>=dim) THEN HALT(100)
  9030. ELSE
  9031. RETURN GetLen(src,d);
  9032. END;
  9033. END Len;
  9034. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  9035. VAR dim: SIZE;
  9036. BEGIN
  9037. dim := GetDim(src);
  9038. IF (d<0) OR (d>=dim) THEN HALT(100)
  9039. ELSE
  9040. RETURN GetIncr(src,d);
  9041. END;
  9042. END Incr;
  9043. PROCEDURE AllocateTensor( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT;
  9044. Size: SIZE );
  9045. VAR ldim, rdim: SIZE;
  9046. PROCEDURE NewData;
  9047. VAR len, size, i: SIZE; data: ANY;
  9048. BEGIN
  9049. size := 1;
  9050. FOR i := 0 TO ldim - 1 DO
  9051. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  9052. END;
  9053. FOR i := 0 TO rdim - 1 DO
  9054. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  9055. END;
  9056. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  9057. (*
  9058. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  9059. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  9060. *)
  9061. size := Size;
  9062. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  9063. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  9064. END;
  9065. PutAdr( dest, Align(data) );
  9066. PutPtr( dest, data );
  9067. END NewData;
  9068. BEGIN
  9069. ldim := GetDim( left ); rdim := GetDim( right );
  9070. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9071. dest := GetArrayDesc( ldim + rdim );
  9072. NewData();
  9073. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9074. IF ~(TensorFlag IN GetFlags( dest )) &
  9075. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9076. HALT( 100 );
  9077. END;
  9078. dest := GetArrayDesc( ldim + rdim );
  9079. NewData();
  9080. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9081. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9082. HALT( 100 );
  9083. END;
  9084. NewData();
  9085. END;
  9086. END AllocateTensor;
  9087. (* 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 *)
  9088. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9089. VAR rdim, len, linc, ri: SIZE );
  9090. (* geometric precondition: lengths must coincide *)
  9091. VAR ldim: SIZE;
  9092. BEGIN
  9093. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9094. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9095. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9096. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9097. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9098. END;
  9099. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9100. DEC( ldim );
  9101. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9102. (GetIncr( right, rdim ) = len * ri) DO
  9103. len := len * GetLen( left, ldim );
  9104. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9105. DEC( ldim );
  9106. END;
  9107. INC( ldim ); INC( rdim );
  9108. IF debug THEN
  9109. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9110. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9111. END;
  9112. END FindPatternTensor;
  9113. PROCEDURE ApplyTensorAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  9114. Loop: BinaryASALoop );
  9115. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE;
  9116. origdest: ADDRESS;
  9117. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9118. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9119. BEGIN
  9120. IF (ldim < lDim) THEN
  9121. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9122. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9123. WHILE (len > 0) DO
  9124. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9125. INC( dadr, dinc ); DEC( len );
  9126. END;
  9127. ELSIF (rdim # loopd) THEN
  9128. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9129. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9130. WHILE (len > 0) DO
  9131. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9132. INC( dadr, dinc ); DEC( len );
  9133. END;
  9134. ELSE
  9135. (*
  9136. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9137. KernelLog.Int(GetAdr(dest),10);
  9138. KernelLog.Int(GetAdr(dest)+clen,10);
  9139. KernelLog.Ln;
  9140. *)
  9141. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9142. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9143. END;
  9144. END Traverse;
  9145. BEGIN
  9146. (* check array lengths *)
  9147. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9148. AllocateTensor( dest, left, right, elementSize );
  9149. (*
  9150. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9151. p := AllocateTensor( left, right, dest, elementSize )
  9152. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9153. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9154. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9155. END;
  9156. (*! to be done: treat overlapping memory *)
  9157. END;
  9158. *)
  9159. (* debugging *)
  9160. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9161. (* check pattern: longest piece that can be done with a loop *)
  9162. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9163. (* run through dimensions *)
  9164. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9165. END ApplyTensorAAAOp;
  9166. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9167. BEGIN
  9168. ApplyTensorAAAOp( RESULT, left, right,
  9169. SIZEOF( SHORTINT ), MulASSSLoop );
  9170. RETURN RESULT
  9171. END "**";
  9172. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9173. BEGIN
  9174. ApplyTensorAAAOp( RESULT, left, right,
  9175. SIZEOF( INTEGER ), MulAISILoop );
  9176. RETURN RESULT
  9177. END "**";
  9178. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9179. BEGIN
  9180. ApplyTensorAAAOp( RESULT, left, right,
  9181. SIZEOF( LONGINT ), MulALSLLoop );
  9182. RETURN RESULT
  9183. END "**";
  9184. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  9185. BEGIN
  9186. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( REAL ),
  9187. loopMulARSR );
  9188. RETURN RESULT
  9189. END "**";
  9190. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  9191. BEGIN
  9192. ApplyTensorAAAOp( RESULT, left, right,
  9193. SIZEOF( LONGREAL ), loopMulAXSX );
  9194. RETURN RESULT
  9195. END "**";
  9196. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  9197. BEGIN
  9198. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( COMPLEX ),
  9199. loopMulAZSZ );
  9200. RETURN RESULT
  9201. END "**";
  9202. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  9203. BEGIN
  9204. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( LONGCOMPLEX ),
  9205. loopMulALZSLZ );
  9206. RETURN RESULT
  9207. END "**";
  9208. PROCEDURE InitOptimization;
  9209. VAR p: PROCEDURE;
  9210. BEGIN
  9211. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9212. IF p # NIL THEN
  9213. p;
  9214. ELSE
  9215. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9216. END;
  9217. END InitOptimization;
  9218. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9219. PROCEDURE CopyDescriptor*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9220. VAR srcDim, destDim,i,len,incr: SIZE;
  9221. BEGIN
  9222. IF src = 0 THEN
  9223. HALT(100);
  9224. ELSE
  9225. srcDim := GetDim(src);
  9226. destDim := srcDim - prefixIndices - suffixIndices;
  9227. (*
  9228. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9229. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9230. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9231. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9232. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9233. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9234. *)
  9235. dest := GetArrayDesc(destDim); (* destination dimension included *)
  9236. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9237. PutAdr(dest,GetAdr(src));
  9238. PutPtr(dest,GetPtr(src));
  9239. PutFlags(dest,GetFlags(src));
  9240. PutSize(dest,GetSize(src));
  9241. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9242. srcDim := i + prefixIndices + prefixRanges;
  9243. destDim := i + prefixRanges;
  9244. len := GetLen(src,srcDim);
  9245. incr := GetIncr(src,srcDim);
  9246. PutLen(dest,destDim,len);
  9247. PutInc(dest,destDim,incr);
  9248. END;
  9249. (*
  9250. Report("copy descriptor src",src);
  9251. Report("copy descriptor dest",dest);
  9252. *)
  9253. END;
  9254. END CopyDescriptor;
  9255. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9256. VAR dest: ARRAY [?] OF basetype
  9257. CONST src: ARRAY [?] OF basetype
  9258. CONST shape: ARRAY [*] OF LONGINT
  9259. *)
  9260. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF SIZE): ARRAY {UNSAFE} [?];
  9261. BEGIN
  9262. DoReshape(RESULT, left, right);
  9263. RETURN RESULT
  9264. END Reshape;
  9265. (* OLIVIER *)
  9266. (** creates a degenerated range from an integer.
  9267. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9268. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9269. **)
  9270. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9271. BEGIN RETURN (integer .. integer BY 1)
  9272. END RangeFromInteger;
  9273. (* OLIVIER *)
  9274. (** create an array with the same data but with more dimensions
  9275. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9276. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9277. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9278. e.g.:
  9279. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9280. performs the following type transformation:
  9281. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9282. **)
  9283. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9284. VAR
  9285. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9286. sourceADDRESS, targetADDRESS: ADDRESS;
  9287. targetArrayDescriptor: ANY;
  9288. BEGIN
  9289. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9290. targetDimensionality := LEN(keptDimensions, 0);
  9291. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9292. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9293. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9294. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9295. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9296. PutFlags(targetADDRESS, {TensorFlag});
  9297. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9298. (* set increments and lengths *)
  9299. sourceIndex := 0;
  9300. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9301. IF keptDimensions[targetIndex] THEN
  9302. (* reuse length and increment from source array *)
  9303. ASSERT(sourceIndex < DIM(sourceArray));
  9304. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9305. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9306. INC(sourceIndex)
  9307. ELSE
  9308. (* set length = 1 and increment = 0 *)
  9309. PutLen(targetADDRESS, targetIndex, 1);
  9310. PutInc(targetADDRESS, targetIndex, 0);
  9311. END
  9312. END;
  9313. (* Report("expand dimensions: ", targetADDRESS); *)
  9314. RETURN RESULT
  9315. END ExpandDimensions;
  9316. (* index ranges *)
  9317. (* the length of a range, i.e. the number of indices that it stands for *)
  9318. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9319. VAR
  9320. temp, result: SIZE;
  9321. BEGIN
  9322. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9323. (* invalid range *)
  9324. result := 0
  9325. ELSIF LAST(range) = MAX(LONGINT) THEN
  9326. (* open-ended range *)
  9327. result := MAX(LONGINT)
  9328. ELSE
  9329. temp := 1 + LAST(range) - FIRST(range);
  9330. result := temp DIV STEP(range);
  9331. IF (temp MOD STEP(range)) # 0 THEN
  9332. INC(result)
  9333. END
  9334. END;
  9335. RETURN result
  9336. END "LEN";
  9337. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9338. BEGIN
  9339. ApplyGenericUnaryAAOpS(RESULT, x, SIZEOF(SHORTINT),GenericLoopS,op);
  9340. RETURN RESULT;
  9341. END "ALL";
  9342. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9343. BEGIN
  9344. ApplyGenericUnaryAAOpI(RESULT,x,SIZEOF(INTEGER),GenericLoopI,op);
  9345. RETURN RESULT;
  9346. END "ALL";
  9347. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9348. BEGIN
  9349. ApplyGenericUnaryAAOpL(RESULT,x,SIZEOF(LONGINT),GenericLoopL,op);
  9350. RETURN RESULT;
  9351. END "ALL";
  9352. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT; (*should also accept operator ?*)
  9353. BEGIN
  9354. ApplyGenericUnaryAAOpH(RESULT,x,SIZEOF(HUGEINT),GenericLoopH,op);
  9355. RETURN RESULT;
  9356. END "ALL";
  9357. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY {UNSAFE} [?] OF REAL; (*should also accept operator ?*)
  9358. BEGIN
  9359. ApplyGenericUnaryAAOpR(RESULT,x,SIZEOF(REAL),GenericLoopR,op);
  9360. RETURN RESULT;
  9361. END "ALL";
  9362. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY{UNSAFE} [?] OF LONGREAL; (*should also accept operator ?*)
  9363. BEGIN
  9364. ApplyGenericUnaryAAOpX(RESULT,x,SIZEOF(LONGREAL),GenericLoopX,op);
  9365. RETURN RESULT;
  9366. END "ALL";
  9367. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX; (*should also accept operator ?*)
  9368. BEGIN
  9369. ApplyGenericUnaryAAOpZ(RESULT,x,SIZEOF(COMPLEX),GenericLoopZ,op);
  9370. RETURN RESULT;
  9371. END "ALL";
  9372. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9373. BEGIN
  9374. ApplyGenericUnaryAAOpLZ(RESULT,x,SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9375. RETURN RESULT;
  9376. END "ALL";
  9377. BEGIN
  9378. alloc := 0; NEW(temporary);
  9379. PutFlags(temporary,{TensorFlag});
  9380. PutDim(temporary, 0);
  9381. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9382. END FoxArrayBase.
  9383. Compiler.Compile FoxArrayBase.Mod ~
  9384. System.ListModules
  9385. System.FreeDownTo FoxArrayBase ~