FoxArrayBase.Mod 340 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. Address = LONGINT;
  7. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: SHORTINT): SHORTINT );
  8. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: INTEGER): INTEGER );
  9. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: LONGINT): LONGINT );
  10. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: HUGEINT): HUGEINT );
  11. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: REAL): REAL );
  12. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: LONGREAL): LONGREAL );
  13. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: COMPLEX): COMPLEX );
  14. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  15. UnaryAALoop = PROCEDURE ( ladr, dadr, linc, dinc, len: Address );
  16. UnaryASLoop = PROCEDURE ( ladr, dadr, linc, len: Address );
  17. UnarySALoop = PROCEDURE ( ladr, dadr, dinc, len: Address );
  18. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  19. BinaryASALoop = PROCEDURE ( ladr, radr, dadr, linc, dinc, len: Address );
  20. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr, linc, rinc, len: Address );
  21. BinaryAABLoop = PROCEDURE ( ladr, radr, linc, rinc, len: Address ): BOOLEAN;
  22. BinaryASBLoop = PROCEDURE ( ladr, radr, linc, len: Address ): BOOLEAN;
  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=16; (* 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. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  40. down = 0; up = 1; (* memory copy modes *)
  41. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  42. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  43. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  44. Size2Flag = 4; (* size = 2 *)
  45. Size3Flag = 5; (* size = 3 *)
  46. Size4Flag = 6; (* size = 4 *)
  47. Size5Flag = 7; (* size = 5 *)
  48. Size6Flag = 8; (* size = 6 *)
  49. Size7Flag = 9; (* size = 7 *)
  50. Size8Flag = 10; (* size = 8 *)
  51. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  52. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  53. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  54. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  55. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  56. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  57. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  58. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  59. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  60. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  61. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  62. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  63. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  64. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  65. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  66. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  67. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  68. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  69. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  70. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  71. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  72. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  73. TYPE
  74. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC, IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: LONGINT ): BOOLEAN;
  75. TransposeP* = PROCEDURE ( ladr, dadr, lstride, linc, dstride, dinc, rows, cols: LONGINT );
  76. LenInc = RECORD
  77. len: SIZE;
  78. inc: SIZE
  79. END;
  80. ArrayDescriptor*= RECORD
  81. ptr: ANY;
  82. adr: ADDRESS;
  83. flags: SET;
  84. dim: SIZE;
  85. elementSize: SIZE;
  86. END;
  87. UnsafeArray*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  88. lens: ARRAY 8 OF LenInc;
  89. END;
  90. A0 = RECORD(ArrayDescriptor) END;
  91. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  92. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  93. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  94. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  95. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  96. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  97. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  98. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  99. T0 = POINTER TO A0;
  100. T1 = POINTER TO A1;
  101. T2 = POINTER TO A2;
  102. T3 = POINTER TO A3;
  103. T4 = POINTER TO A4;
  104. T5 = POINTER TO A5;
  105. T6 = POINTER TO A6;
  106. T7 = POINTER TO A7;
  107. T8 = POINTER TO A8;
  108. (*
  109. (* tensor shape descriptors, statically typed, maximal dimension of a tensor limited to 32 for the time being *)
  110. T0 = POINTER TO RECORD ptr: ANY; a: ARRAY MathLenOffset + 0* 8 OF CHAR END;
  111. T1 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 1 * 8 OF CHAR END;
  112. T2 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 2 * 8 OF CHAR END;
  113. T3 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 3 * 8 OF CHAR END;
  114. T4 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 4 * 8 OF CHAR END;
  115. T5 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 5 * 8 OF CHAR END;
  116. T6 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 6 * 8 OF CHAR END;
  117. T7 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 7 * 8 OF CHAR END;
  118. T8 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 8 * 8 OF CHAR END;
  119. *)
  120. T9 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 9 * 8 OF CHAR END;
  121. T10 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 10 * 8 OF CHAR END;
  122. T11 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 11 * 8 OF CHAR END;
  123. T12 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 12 * 8 OF CHAR END;
  124. T13 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 13 * 8 OF CHAR END;
  125. T14 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 14 * 8 OF CHAR END;
  126. T15 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 15 * 8 OF CHAR END;
  127. T16 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 16 * 8 OF CHAR END;
  128. T17 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 17 * 8 OF CHAR END;
  129. T18 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 18 * 8 OF CHAR END;
  130. T19 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 19 * 8 OF CHAR END;
  131. T20 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 20 * 8 OF CHAR END;
  132. T21 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 21 * 8 OF CHAR END;
  133. T22 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 22 * 8 OF CHAR END;
  134. T23 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 23 * 8 OF CHAR END;
  135. T24 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 24 * 8 OF CHAR END;
  136. T25 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 25 * 8 OF CHAR END;
  137. T26 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 26 * 8 OF CHAR END;
  138. T27 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 27 * 8 OF CHAR END;
  139. T28 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 28 * 8 OF CHAR END;
  140. T29 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 29 * 8 OF CHAR END;
  141. T30 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 30 * 8 OF CHAR END;
  142. T31 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 31 * 8 OF CHAR END;
  143. T32 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 32 * 8 OF CHAR END;
  144. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  145. SmallMatMul* = PROCEDURE(dadr, ladr, radr: LONGINT);
  146. VAR
  147. alloc*: LONGINT; (* statistics *)
  148. allocTemp*: LONGINT; (* statistics *)
  149. (* procedures that might be replaced by ASM methods *)
  150. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  151. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  152. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  153. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  154. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  155. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  156. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  157. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  158. transpose4*: TransposeP; transpose8*: TransposeP;
  159. (* optimizations for small arrays (Alexey Morozov) *)
  160. matMulR2x2*: SmallMatMul;
  161. matMulR3x3*: SmallMatMul;
  162. matMulR4x4*: SmallMatMul;
  163. matVecMulR2x2*: SmallMatMul;
  164. matVecMulR3x3*: SmallMatMul;
  165. matVecMulR4x4*: SmallMatMul;
  166. matMulLR2x2*: SmallMatMul;
  167. matMulLR3x3*: SmallMatMul;
  168. matMulLR4x4*: SmallMatMul;
  169. matVecMulLR2x2*: SmallMatMul;
  170. matVecMulLR3x3*: SmallMatMul;
  171. matVecMulLR4x4*: SmallMatMul;
  172. (*
  173. TensorTypePool: ARRAY 32 OF TensorType;
  174. *)
  175. PROCEDURE SetDefaults*; (* set standard procedures *)
  176. BEGIN
  177. KernelLog.String( "ArrayBase: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  178. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  179. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  180. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  181. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  182. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  183. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  184. loopIncMulAXSX := IncMulAXSXLoop;
  185. loopMatMulIncARAR := MatMulIncARARLoop;
  186. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  187. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  188. loopMulAZSZ := MulAZSZLoop;
  189. loopMulALZSLZ := MulALZSLZLoop;
  190. END SetDefaults;
  191. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  192. BEGIN
  193. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  194. END Err;
  195. (* get increment of dimension dim *)
  196. PROCEDURE GetIncr(base,dim: Address): LONGINT;
  197. VAR result: LONGINT;
  198. BEGIN
  199. SYSTEM.GET(base+MathIncrOffset+8*dim,result);
  200. RETURN result
  201. END GetIncr;
  202. (* set increment of dimension dim *)
  203. PROCEDURE PutInc(base,dim,val: Address);
  204. BEGIN
  205. SYSTEM.PUT(base+MathIncrOffset+8*dim,val)
  206. END PutInc;
  207. (* get length of dimension dim *)
  208. PROCEDURE GetLen(base,dim: Address): LONGINT;
  209. VAR result: LONGINT;
  210. BEGIN
  211. SYSTEM.GET(base+MathLenOffset+8*dim,result);
  212. RETURN result
  213. END GetLen;
  214. (* set length of dimension dim *)
  215. PROCEDURE PutLen(base,dim,val: Address);
  216. BEGIN
  217. SYSTEM.PUT(base+MathLenOffset+8*dim,val)
  218. END PutLen;
  219. (* get data address *)
  220. PROCEDURE GetAdr(base: Address): Address;
  221. VAR result: LONGINT;
  222. BEGIN
  223. SYSTEM.GET(base+MathAdrOffset,result);
  224. RETURN result
  225. END GetAdr;
  226. (* set data address *)
  227. PROCEDURE PutAdr(base,value: Address);
  228. BEGIN
  229. SYSTEM.PUT(base+MathAdrOffset,value)
  230. END PutAdr;
  231. (* get data base pointer (GC protection) *)
  232. PROCEDURE GetPtr(base: Address): Address;
  233. VAR result: LONGINT;
  234. BEGIN
  235. SYSTEM.GET(base+MathPtrOffset,result);
  236. RETURN result
  237. END GetPtr;
  238. (* set data base pointer (GC protection) *)
  239. PROCEDURE PutPtr(base,value: Address);
  240. BEGIN
  241. SYSTEM.PUT(base+MathPtrOffset,value)
  242. END PutPtr;
  243. PROCEDURE GetSize( base: Address ): LONGINT;
  244. VAR dim: LONGINT;
  245. BEGIN
  246. IF base = 0 THEN RETURN 0 ELSE SYSTEM.GET( base + MathElementSizeOffset, dim ); RETURN dim; END;
  247. END GetSize;
  248. PROCEDURE PutSize( base: Address; dim: LONGINT );
  249. BEGIN
  250. SYSTEM.PUT( base + MathElementSizeOffset, dim );
  251. END PutSize;
  252. PROCEDURE GetDim( base: Address ): LONGINT;
  253. VAR dim: LONGINT;
  254. BEGIN
  255. IF base = 0 THEN RETURN 0 ELSE SYSTEM.GET( base + MathDimOffset, dim ); RETURN dim; END;
  256. END GetDim;
  257. PROCEDURE GetFlags( base: Address ): SET;
  258. VAR set: SET;
  259. BEGIN
  260. SYSTEM.GET( base + MathFlagsOffset, set ); RETURN set;
  261. END GetFlags;
  262. PROCEDURE PutDim( base: Address; dim: LONGINT );
  263. BEGIN
  264. SYSTEM.PUT( base + MathDimOffset, dim );
  265. END PutDim;
  266. PROCEDURE PutFlags( base: Address; flags: SET );
  267. BEGIN
  268. SYSTEM.PUT( base + MathFlagsOffset, flags );
  269. END PutFlags;
  270. (* report geometry of array passed via address s *)
  271. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: LONGINT );
  272. VAR i: LONGINT; dim: LONGINT;
  273. PROCEDURE Set( s: SET );
  274. VAR i: LONGINT; first: BOOLEAN;
  275. BEGIN
  276. KernelLog.String( "{" ); first := TRUE;
  277. FOR i := 31 TO 0 BY -1 DO
  278. IF i IN s THEN
  279. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  280. KernelLog.Int( i, 1 );
  281. END;
  282. END;
  283. KernelLog.String( "}" );
  284. END Set;
  285. BEGIN
  286. KernelLog.String( name );
  287. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  288. ELSE
  289. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  290. KernelLog.Int( GetPtr( s ), 1 ); KernelLog.String( "; adr= " );
  291. KernelLog.Int( GetAdr( s ), 1 ); KernelLog.String( "; dim=" );
  292. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  293. KernelLog.Ln; dim := GetDim( s );
  294. IF dim > 32 THEN dim := 0 END;
  295. FOR i := 0 TO dim - 1 DO
  296. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  297. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  298. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  299. END;
  300. (*
  301. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  302. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  303. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  304. *)
  305. END;
  306. END Report;
  307. PROCEDURE GetArrayDesc( dim: LONGINT ): ANY;
  308. VAR (* t: TensorType; *) ptr: ANY;
  309. p0: T0;
  310. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8; p9: T9;
  311. p10: T10; p11: T11; p12: T12; p13: T13; p14: T14; p15: T15; p16: T16; p17: T17; p18: T18; p19: T19;
  312. p20: T20; p21: T21; p22: T22; p23: T23; p24: T24; p25: T25; p26: T26; p27: T27; p28: T28; p29: T29;
  313. p30: T30; p31: T31; p32: T32;
  314. BEGIN
  315. (*
  316. IF dim < LEN( TensorTypePool ) THEN t := TensorTypePool[dim]
  317. ELSE NewTensorType( dim, t );
  318. END;
  319. Heaps.NewRec( ptr, t.tag );
  320. *)
  321. CASE dim OF
  322. |0: NEW(p0); ptr := p0;
  323. |1:NEW(p1); ptr := p1;
  324. |2:NEW(p2); ptr := p2;
  325. |3:NEW(p3); ptr := p3;
  326. |4:NEW(p4); ptr := p4;
  327. |5:NEW(p5); ptr := p5;
  328. |6:NEW(p6); ptr := p6;
  329. |7:NEW(p7); ptr := p7;
  330. |8:NEW(p8); ptr := p8;
  331. |9:NEW(p9); ptr := p9;
  332. |10:NEW(p10); ptr := p10;
  333. |11:NEW(p11); ptr := p11;
  334. |12:NEW(p12); ptr := p12;
  335. |13:NEW(p13); ptr := p13;
  336. |14:NEW(p14); ptr := p14;
  337. |15:NEW(p15); ptr := p15;
  338. |16:NEW(p16); ptr := p16;
  339. |17:NEW(p17); ptr := p17;
  340. |18:NEW(p18); ptr := p18;
  341. |19:NEW(p19); ptr := p19;
  342. |20:NEW(p20); ptr := p20;
  343. |21:NEW(p21); ptr := p21;
  344. |22:NEW(p22); ptr := p22;
  345. |23:NEW(p23); ptr := p23;
  346. |24:NEW(p24); ptr := p24;
  347. |25:NEW(p25); ptr := p25;
  348. |26:NEW(p26); ptr := p26;
  349. |27:NEW(p27); ptr := p27;
  350. |28:NEW(p28); ptr := p28;
  351. |29:NEW(p29); ptr := p29;
  352. |30:NEW(p30); ptr := p30;
  353. |31:NEW(p31); ptr := p31;
  354. |32:NEW(p32); ptr := p32;
  355. END;
  356. PutDim( SYSTEM.VAL( LONGINT, ptr ), dim );
  357. PutFlags( SYSTEM.VAL( LONGINT, ptr ), {TensorFlag} ); RETURN ptr;
  358. END GetArrayDesc;
  359. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  360. VAR reason: ARRAY 64 OF CHAR;
  361. BEGIN
  362. IF left # 0 THEN Report( "Source operand ", left ) END;
  363. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  364. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  365. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  366. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  367. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  368. ELSE reason := "unknown";
  369. END;
  370. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  371. HALT( 400 );
  372. END Halt;
  373. (** patterns ********************************************************************)
  374. (* 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 *)
  375. PROCEDURE FindPattern1( left, dim: Address; VAR d, len, linc: LONGINT );
  376. BEGIN
  377. d := dim - 1; len := GetLen( left, d );
  378. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  379. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  380. linc := GetIncr( left, d ); DEC( d );
  381. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  382. len := len * GetLen( left, d ); DEC( d );
  383. END; (* find dimension where pattern does not work any more *)
  384. INC( d );
  385. IF debug THEN
  386. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  387. KernelLog.Ln;
  388. END;
  389. END FindPattern1;
  390. (* 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 *)
  391. PROCEDURE FindPattern2( left, right: Address; dim: LONGINT;
  392. VAR d, len, linc, ri: LONGINT );
  393. (* geometric precondition: lengths must coincide *)
  394. BEGIN
  395. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  396. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  397. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  398. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  399. len := len * GetLen( left, d ); DEC( d );
  400. END;
  401. INC( d );
  402. IF debug THEN
  403. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  404. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  405. END;
  406. END FindPattern2;
  407. (* 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 *)
  408. PROCEDURE FindPattern3( left, right, dest: Address; dim: LONGINT;
  409. VAR d, len, linc, ri, di: LONGINT );
  410. (* geometric precondition: lengths must coincide *)
  411. BEGIN
  412. d := dim - 1; len := GetLen( left, d );
  413. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  414. END;
  415. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  416. DEC( d );
  417. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  418. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  419. len := len * GetLen( left, d ); DEC( d );
  420. END;
  421. INC( d );
  422. IF debug THEN
  423. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  424. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  425. END;
  426. END FindPattern3;
  427. PROCEDURE Reverse( src: Address; dim: LONGINT );
  428. VAR d, sl, sr: LONGINT;
  429. BEGIN
  430. d := 0; sl := GetAdr( src );
  431. WHILE (d < dim) DO
  432. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  433. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  434. END;
  435. PutAdr( src, sl + sr );
  436. END Reverse;
  437. (* check if forward copy may be performed *)
  438. PROCEDURE CopyUpCompatible( dest, src: Address; VAR modes: SET );
  439. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  440. (* precondition: len(src,i)=len(dest,i) *)
  441. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  442. Sufficient (but not necessary) conditions:
  443. 1.) no overlap: src right < dest left or src left > dest right or
  444. 2.) same geometry and src left >= dest left
  445. same geometry if ginc(s)=ginc(d) with
  446. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  447. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  448. *)
  449. BEGIN
  450. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  451. dim := GetDim( src );
  452. WHILE (d < dim) DO
  453. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  454. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  455. END;
  456. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  457. ELSIF ((sr - sl) = (dr - dl)) THEN
  458. IF (sl = dl) THEN (* same memory region, both directions possible *)
  459. ELSIF (sl > dl) THEN
  460. EXCL( modes, down ) (* only copy up possible *)
  461. ELSE (*sl < dl*)
  462. EXCL( modes, up ) (* only copy down possible *)
  463. END;
  464. ELSE
  465. modes := modes - {down, up}; (* neither nor *)
  466. END;
  467. END CopyUpCompatible;
  468. PROCEDURE AllocateTemp( VAR dest: Address; src: Address;
  469. Size: LONGINT ): ANY;
  470. (* allocate a temporary block containing both descriptor and data *)
  471. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  472. BEGIN
  473. IF statistics THEN INC( allocTemp ) END;
  474. d := 0; len := Size; dim := GetDim( src );
  475. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  476. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  477. dest := SYSTEM.VAL( LONGINT, p );
  478. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  479. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  480. FOR i := 0 TO dim - 1 DO
  481. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  482. len := len * GetLen( src, i );
  483. END;
  484. (* Report("allocdest",dest,dim); *)
  485. RETURN p;
  486. END AllocateTemp;
  487. (*** procedures to traverse arrays and apply operators *)
  488. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  489. PROCEDURE ApplyGenericUnaryAAOpS( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  490. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  491. origdest: LONGINT; modes: SET;
  492. dest, left, dim: LONGINT;
  493. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  494. VAR len: LONGINT; linc, dinc: LONGINT;
  495. BEGIN
  496. IF dim = loopd THEN
  497. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  498. IF conservative THEN INC( glen, looplen ) END;
  499. ELSE
  500. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  501. dinc := GetIncr( dest, dim ); INC( dim );
  502. WHILE (len > 0) DO
  503. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  504. END;
  505. END;
  506. END Traverse;
  507. BEGIN
  508. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  509. origdest := 0; modes := {up, down};
  510. (* allocate destination, if necessary *)
  511. p := AllocateSame( dest, left, elementSize );
  512. IF p = NIL THEN
  513. CopyUpCompatible( dest, left, modes );
  514. IF up IN modes THEN (* nothing to be done *)
  515. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  516. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  517. END;
  518. END;
  519. (* allocate destination, if necessary *)
  520. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  521. ELSIF CheckGeometry( left, dest, dim )
  522. END; *)
  523. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  524. (* check pattern: longest piece that can be done with a loop *)
  525. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  526. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  527. IF up IN modes THEN (* nothing to be done *)
  528. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  529. ELSE CopyContent( origdest, dest, elementSize );
  530. END;
  531. SYSTEM.PUT( d, dest );
  532. END ApplyGenericUnaryAAOpS;
  533. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  534. PROCEDURE ApplyGenericUnaryAAOpI( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  535. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  536. origdest: LONGINT; modes: SET;
  537. dest, left, dim: LONGINT;
  538. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  539. VAR len: LONGINT; linc, dinc: LONGINT;
  540. BEGIN
  541. IF dim = loopd THEN
  542. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  543. IF conservative THEN INC( glen, looplen ) END;
  544. ELSE
  545. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  546. dinc := GetIncr( dest, dim ); INC( dim );
  547. WHILE (len > 0) DO
  548. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  549. END;
  550. END;
  551. END Traverse;
  552. BEGIN
  553. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  554. origdest := 0; modes := {up, down};
  555. (* allocate destination, if necessary *)
  556. p := AllocateSame( dest, left, elementSize );
  557. IF p = NIL THEN
  558. CopyUpCompatible( dest, left, modes );
  559. IF up IN modes THEN (* nothing to be done *)
  560. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  561. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  562. END;
  563. END;
  564. (* allocate destination, if necessary *)
  565. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  566. ELSIF CheckGeometry( left, dest, dim )
  567. END; *)
  568. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  569. (* check pattern: longest piece that can be done with a loop *)
  570. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  571. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  572. IF up IN modes THEN (* nothing to be done *)
  573. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  574. ELSE CopyContent( origdest, dest, elementSize );
  575. END;
  576. SYSTEM.PUT( d, dest );
  577. END ApplyGenericUnaryAAOpI;
  578. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  579. PROCEDURE ApplyGenericUnaryAAOpL( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  580. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  581. origdest: LONGINT; modes: SET;
  582. dest, left, dim: LONGINT;
  583. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  584. VAR len: LONGINT; linc, dinc: LONGINT;
  585. BEGIN
  586. IF dim = loopd THEN
  587. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  588. IF conservative THEN INC( glen, looplen ) END;
  589. ELSE
  590. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  591. dinc := GetIncr( dest, dim ); INC( dim );
  592. WHILE (len > 0) DO
  593. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  594. END;
  595. END;
  596. END Traverse;
  597. BEGIN
  598. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  599. origdest := 0; modes := {up, down};
  600. (* allocate destination, if necessary *)
  601. p := AllocateSame( dest, left, elementSize );
  602. IF p = NIL THEN
  603. CopyUpCompatible( dest, left, modes );
  604. IF up IN modes THEN (* nothing to be done *)
  605. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  606. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  607. END;
  608. END;
  609. (* allocate destination, if necessary *)
  610. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  611. ELSIF CheckGeometry( left, dest, dim )
  612. END; *)
  613. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  614. (* check pattern: longest piece that can be done with a loop *)
  615. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  616. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  617. IF up IN modes THEN (* nothing to be done *)
  618. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  619. ELSE CopyContent( origdest, dest, elementSize );
  620. END;
  621. SYSTEM.PUT( d, dest );
  622. END ApplyGenericUnaryAAOpL;
  623. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  624. PROCEDURE ApplyGenericUnaryAAOpH( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  625. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  626. origdest: LONGINT; modes: SET;
  627. VAR dest, left, dim: LONGINT;
  628. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  629. VAR len: LONGINT; linc, dinc: LONGINT;
  630. BEGIN
  631. IF dim = loopd THEN
  632. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  633. IF conservative THEN INC( glen, looplen ) END;
  634. ELSE
  635. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  636. dinc := GetIncr( dest, dim ); INC( dim );
  637. WHILE (len > 0) DO
  638. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  639. DEC( len );
  640. END;
  641. END;
  642. END Traverse;
  643. BEGIN
  644. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  645. origdest := 0; modes := {up, down};
  646. (* allocate destination, if necessary *)
  647. p := AllocateSame( dest, left, elementSize );
  648. IF p = NIL THEN
  649. CopyUpCompatible( dest, left, modes );
  650. IF up IN modes THEN (* nothing to be done *)
  651. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  652. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  653. END;
  654. END;
  655. (*
  656. (* allocate destination, if necessary *)
  657. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  658. ELSIF CheckGeometry( left, dest, dim )
  659. END;
  660. *)
  661. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  662. (* check pattern: longest piece that can be done with a loop *)
  663. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  664. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  665. IF up IN modes THEN (* nothing to be done *)
  666. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  667. ELSE CopyContent( origdest, dest, elementSize );
  668. END;
  669. SYSTEM.PUT( d, dest );
  670. END ApplyGenericUnaryAAOpH;
  671. (** apply unary operator to array: array REAL -> array REAL *)
  672. PROCEDURE ApplyGenericUnaryAAOpR( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  673. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  674. origdest: LONGINT; modes: SET;
  675. dest, left, dim: LONGINT;
  676. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  677. VAR len: LONGINT; linc, dinc: LONGINT;
  678. BEGIN
  679. IF dim = loopd THEN
  680. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  681. IF conservative THEN INC( glen, looplen ) END;
  682. ELSE
  683. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  684. dinc := GetIncr( dest, dim ); INC( dim );
  685. WHILE (len > 0) DO
  686. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  687. END;
  688. END;
  689. END Traverse;
  690. BEGIN
  691. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  692. origdest := 0; modes := {up, down};
  693. (* allocate destination, if necessary *)
  694. p := AllocateSame( dest, left, elementSize );
  695. IF p = NIL THEN
  696. CopyUpCompatible( dest, left, modes );
  697. IF up IN modes THEN (* nothing to be done *)
  698. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  699. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  700. END;
  701. END;
  702. (* allocate destination, if necessary *)
  703. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  704. ELSIF CheckGeometry( left, dest, dim )
  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, GetAdr( left ), GetAdr( dest ) );
  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. SYSTEM.PUT( d, dest );
  715. END ApplyGenericUnaryAAOpR;
  716. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  717. PROCEDURE ApplyGenericUnaryAAOpX( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  718. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  719. origdest: LONGINT; modes: SET;
  720. VAR dest, left, dim: LONGINT;
  721. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  722. VAR len: LONGINT; linc, dinc: LONGINT;
  723. BEGIN
  724. IF dim = loopd THEN
  725. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  726. IF conservative THEN INC( glen, looplen ) END;
  727. ELSE
  728. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  729. dinc := GetIncr( dest, dim ); INC( dim );
  730. WHILE (len > 0) DO
  731. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  732. DEC( len );
  733. END;
  734. END;
  735. END Traverse;
  736. BEGIN
  737. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  738. origdest := 0; modes := {up, down};
  739. (* allocate destination, if necessary *)
  740. p := AllocateSame( dest, left, elementSize );
  741. IF p = NIL THEN
  742. CopyUpCompatible( dest, left, modes );
  743. IF up IN modes THEN (* nothing to be done *)
  744. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  745. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  746. END;
  747. END;
  748. (*
  749. (* allocate destination, if necessary *)
  750. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  751. ELSIF CheckGeometry( left, dest, dim )
  752. END;
  753. *)
  754. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  755. (* check pattern: longest piece that can be done with a loop *)
  756. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  757. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  758. IF up IN modes THEN (* nothing to be done *)
  759. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  760. ELSE CopyContent( origdest, dest, elementSize );
  761. END;
  762. SYSTEM.PUT( d, dest );
  763. END ApplyGenericUnaryAAOpX;
  764. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  765. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  766. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  767. origdest: LONGINT; modes: SET;
  768. VAR dest, left, dim: LONGINT;
  769. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  770. VAR len: LONGINT; linc, dinc: LONGINT;
  771. BEGIN
  772. IF dim = loopd THEN
  773. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  774. IF conservative THEN INC( glen, looplen ) END;
  775. ELSE
  776. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  777. dinc := GetIncr( dest, dim ); INC( dim );
  778. WHILE (len > 0) DO
  779. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  780. DEC( len );
  781. END;
  782. END;
  783. END Traverse;
  784. BEGIN
  785. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  786. origdest := 0; modes := {up, down};
  787. (* allocate destination, if necessary *)
  788. p := AllocateSame( dest, left, elementSize );
  789. IF p = NIL THEN
  790. CopyUpCompatible( dest, left, modes );
  791. IF up IN modes THEN (* nothing to be done *)
  792. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  793. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  794. END;
  795. END;
  796. (*
  797. (* allocate destination, if necessary *)
  798. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  799. ELSIF CheckGeometry( left, dest, dim )
  800. END;
  801. *)
  802. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  803. (* check pattern: longest piece that can be done with a loop *)
  804. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  805. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  806. IF up IN modes THEN (* nothing to be done *)
  807. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  808. ELSE CopyContent( origdest, dest, elementSize );
  809. END;
  810. SYSTEM.PUT( d, dest );
  811. END ApplyGenericUnaryAAOpZ;
  812. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  813. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  814. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  815. origdest: LONGINT; modes: SET;
  816. VAR dest, left, dim: LONGINT;
  817. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  818. VAR len: LONGINT; linc, dinc: LONGINT;
  819. BEGIN
  820. IF dim = loopd THEN
  821. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  822. IF conservative THEN INC( glen, looplen ) END;
  823. ELSE
  824. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  825. dinc := GetIncr( dest, dim ); INC( dim );
  826. WHILE (len > 0) DO
  827. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  828. DEC( len );
  829. END;
  830. END;
  831. END Traverse;
  832. BEGIN
  833. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  834. origdest := 0; modes := {up, down};
  835. (* allocate destination, if necessary *)
  836. p := AllocateSame( dest, left, elementSize );
  837. IF p = NIL THEN
  838. CopyUpCompatible( dest, left, modes );
  839. IF up IN modes THEN (* nothing to be done *)
  840. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  841. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  842. END;
  843. END;
  844. (*
  845. (* allocate destination, if necessary *)
  846. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  847. ELSIF CheckGeometry( left, dest, dim )
  848. END;
  849. *)
  850. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  851. (* check pattern: longest piece that can be done with a loop *)
  852. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  853. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  854. IF up IN modes THEN (* nothing to be done *)
  855. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  856. ELSE CopyContent( origdest, dest, elementSize );
  857. END;
  858. SYSTEM.PUT( d, dest );
  859. END ApplyGenericUnaryAAOpLZ;
  860. (** apply unary operator to array: array -> array *)
  861. PROCEDURE ApplyUnaryAAOp( d, l: Address; elementSize: LONGINT;
  862. Loop: UnaryAALoop );
  863. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  864. origdest: LONGINT; modes: SET;
  865. VAR dest, left, dim: LONGINT;
  866. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  867. VAR len: LONGINT; linc, dinc: LONGINT;
  868. BEGIN
  869. IF dim = loopd THEN
  870. Loop( ladr, dadr, loopli, loopdi, looplen );
  871. IF conservative THEN INC( glen, looplen ) END;
  872. ELSE
  873. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  874. dinc := GetIncr( dest, dim ); INC( dim );
  875. WHILE (len > 0) DO
  876. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  877. DEC( len );
  878. END;
  879. END;
  880. END Traverse;
  881. BEGIN
  882. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  883. origdest := 0; modes := {up, down};
  884. (* allocate destination, if necessary *)
  885. p := AllocateSame( dest, left, elementSize );
  886. IF p = NIL THEN
  887. CopyUpCompatible( dest, left, modes );
  888. IF up IN modes THEN (* nothing to be done *)
  889. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  890. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  891. END;
  892. END;
  893. (*
  894. (* allocate destination, if necessary *)
  895. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  896. ELSIF CheckGeometry( left, dest, dim )
  897. END;
  898. *)
  899. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  900. (* check pattern: longest piece that can be done with a loop *)
  901. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  902. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  903. IF up IN modes THEN (* nothing to be done *)
  904. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  905. ELSE CopyContent( origdest, dest, elementSize );
  906. END;
  907. SYSTEM.PUT( d, dest );
  908. END ApplyUnaryAAOp;
  909. (** apply unary operator to array: array -> scalar *)
  910. PROCEDURE ApplyUnaryASOp( dest, l: Address; Loop: UnaryASLoop );
  911. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  912. VAR left, dim: LONGINT;
  913. PROCEDURE Traverse( dim: LONGINT; ladr: Address );
  914. VAR len: LONGINT; linc: LONGINT;
  915. BEGIN
  916. IF dim = loopd THEN
  917. Loop( ladr, dest, loopli, looplen );
  918. IF conservative THEN INC( glen, looplen ) END;
  919. ELSE
  920. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  921. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  922. END;
  923. END Traverse;
  924. BEGIN
  925. SYSTEM.GET( l, left ); dim := GetDim( left );
  926. IF debug THEN Report( "AS: left", left ); END;
  927. (* check pattern: longest piece that can be done with a loop *)
  928. IF conservative THEN glen := 0 END;
  929. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  930. IF conservative THEN
  931. looplen := 1;
  932. WHILE (dim > 0) DO
  933. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  934. END;
  935. ASSERT( looplen = glen );
  936. END;
  937. END ApplyUnaryASOp;
  938. (** apply unary operator to array: scalar -> array *)
  939. PROCEDURE ApplyUnarySAOp( d, right: Address; Loop: UnarySALoop );
  940. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  941. VAR dest, dim: LONGINT;
  942. PROCEDURE Traverse( dim: LONGINT; dadr: Address );
  943. VAR len: LONGINT; dinc: LONGINT;
  944. BEGIN
  945. IF dim = loopd THEN
  946. Loop( right, dadr, loopdi, looplen );
  947. IF conservative THEN INC( glen, looplen ) END;
  948. ELSE
  949. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  950. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  951. END;
  952. END Traverse;
  953. BEGIN
  954. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  955. IF debug THEN Report( "AS: dest", dest ); END;
  956. (* check pattern: longest piece that can be done with a loop *)
  957. IF conservative THEN glen := 0 END;
  958. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  959. IF conservative THEN
  960. looplen := 1;
  961. WHILE (dim > 0) DO
  962. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  963. END;
  964. ASSERT( looplen = glen );
  965. END;
  966. END ApplyUnarySAOp;
  967. (** apply binary operator : array x array -> array *)
  968. PROCEDURE ApplyBinaryAAAOp( d, l, r: Address; elementSize: LONGINT;
  969. Loop: BinaryAAALoop );
  970. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  971. origdest: LONGINT; modes: SET; left, right, dest: Address; dim: LONGINT;
  972. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: Address );
  973. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  974. BEGIN
  975. IF dim = loopd THEN
  976. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  977. IF conservative THEN INC( glen, looplen ) END;
  978. ELSE
  979. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  980. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  981. WHILE (len > 0) DO
  982. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  983. INC( dadr, dinc ); DEC( len );
  984. END;
  985. END;
  986. END Traverse;
  987. BEGIN
  988. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  989. (* allocate destination, if necessary *)
  990. IF ~SameShape( left, right ) THEN
  991. Halt( GeometryMismatch, left, right, 0 )
  992. END;
  993. origdest := 0; modes := {up, down};
  994. p := AllocateSame( dest, left, elementSize );
  995. IF p = NIL THEN
  996. CopyUpCompatible( dest, left, modes );
  997. CopyUpCompatible( dest, right, modes );
  998. IF up IN modes THEN (* nothing to be done *)
  999. ELSIF down IN modes THEN
  1000. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  1001. ELSE
  1002. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  1003. END;
  1004. END;
  1005. (* debugging *)
  1006. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  1007. (* check pattern: longest piece that can be done with a loop *)
  1008. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  1009. (* run through dimensions *)
  1010. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  1011. IF up IN modes THEN (* nothing to be done *)
  1012. ELSIF down IN modes THEN
  1013. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  1014. ELSE CopyContent( origdest, dest, elementSize );
  1015. END;
  1016. SYSTEM.PUT( d, dest );
  1017. END ApplyBinaryAAAOp;
  1018. (** apply binary operator: array x scalar -> array *)
  1019. PROCEDURE ApplyBinaryASAOp( d, l, right: Address;
  1020. elementSize: LONGINT;
  1021. Loop: BinaryASALoop );
  1022. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1023. origdest: LONGINT; modes: SET; dest, left, dim: LONGINT;
  1024. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  1025. VAR len: LONGINT; linc, dinc: LONGINT;
  1026. BEGIN
  1027. IF dim = loopd THEN
  1028. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1029. IF conservative THEN INC( glen, looplen ) END;
  1030. ELSE
  1031. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1032. dinc := GetIncr( dest, dim ); INC( dim );
  1033. WHILE (len > 0) DO
  1034. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1035. DEC( len );
  1036. END;
  1037. END;
  1038. END Traverse;
  1039. BEGIN
  1040. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1041. (* allocate destination, if necessary *)
  1042. origdest := 0; modes := {up, down};
  1043. p := AllocateSame( dest, left, elementSize );
  1044. IF p = NIL THEN
  1045. CopyUpCompatible( dest, left, modes );
  1046. IF up IN modes THEN (* nothing to be done *)
  1047. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1048. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1049. END;
  1050. END;
  1051. (* debugging *)
  1052. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1053. (* check pattern: longest piece that can be done with a loop *)
  1054. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1055. (* run through dimensions *)
  1056. IF conservative THEN glen := 0 END;
  1057. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1058. IF conservative THEN
  1059. looplen := 1;
  1060. WHILE (dim > 0) DO
  1061. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1062. END;
  1063. ASSERT( looplen = glen );
  1064. END;
  1065. IF up IN modes THEN (* nothing to be done *)
  1066. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1067. ELSE CopyContent( origdest, dest, elementSize );
  1068. END;
  1069. SYSTEM.PUT( d, dest );
  1070. END ApplyBinaryASAOp;
  1071. (** apply binary operator: array x array -> scalar *)
  1072. PROCEDURE ApplyBinaryAASOp( dest, l, r: Address; Loop: BinaryAASLoop );
  1073. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1074. left, right, dim: LONGINT;
  1075. PROCEDURE Traverse( dim: LONGINT; ladr, radr: Address );
  1076. VAR len: LONGINT; linc, rinc: LONGINT;
  1077. BEGIN
  1078. IF dim = loopd THEN
  1079. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1080. IF conservative THEN INC( glen, looplen ) END;
  1081. ELSE
  1082. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1083. rinc := GetIncr( right, dim ); INC( dim );
  1084. WHILE (len > 0) DO
  1085. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1086. DEC( len );
  1087. END;
  1088. END;
  1089. END Traverse;
  1090. BEGIN
  1091. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1092. (* check array lengths *)
  1093. IF ~SameShape( left, right ) THEN
  1094. Halt( GeometryMismatch, left, right, 0 )
  1095. END;
  1096. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1097. (* check pattern: longest piece that can be done with a loop *)
  1098. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1099. (* run through dimensions *)
  1100. IF conservative THEN glen := 0 END;
  1101. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1102. IF conservative THEN
  1103. looplen := 1;
  1104. WHILE (dim > 0) DO
  1105. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1106. END;
  1107. ASSERT( looplen = glen );
  1108. END;
  1109. END ApplyBinaryAASOp;
  1110. (** special binary operator: array x array -> boolean *)
  1111. PROCEDURE ApplyBinaryAABOp( l, r: Address;
  1112. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1113. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1114. PROCEDURE Traverse( dim: LONGINT; ladr, radr: Address ): BOOLEAN;
  1115. VAR len: LONGINT; linc, rinc: LONGINT;
  1116. BEGIN
  1117. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1118. ELSE
  1119. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1120. rinc := GetIncr( right, dim ); INC( dim );
  1121. WHILE (len > 0) DO
  1122. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1123. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1124. END;
  1125. RETURN TRUE;
  1126. END;
  1127. END Traverse;
  1128. BEGIN
  1129. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1130. (* check array lengths *)
  1131. IF ~SameShape( left, right ) THEN
  1132. RETURN geometryMismatchDefault
  1133. END;
  1134. (* is destination already allocated? (might be a temporary result) *)
  1135. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1136. (* check pattern: longest piece that can be done with a loop *)
  1137. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1138. (* run through dimensions *)
  1139. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1140. END ApplyBinaryAABOp;
  1141. (** special binary operator: array x scalar -> boolean *)
  1142. PROCEDURE ApplyBinaryASBOp( l, right: Address;
  1143. Loop: BinaryASBLoop ): BOOLEAN;
  1144. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1145. PROCEDURE Traverse( dim: LONGINT; ladr: Address ): BOOLEAN;
  1146. VAR len: LONGINT; linc: LONGINT;
  1147. BEGIN
  1148. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1149. ELSE
  1150. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1151. WHILE (len > 0) DO
  1152. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1153. INC( ladr, linc ); DEC( len );
  1154. END;
  1155. RETURN TRUE;
  1156. END;
  1157. END Traverse;
  1158. BEGIN
  1159. SYSTEM.GET( l, left ); dim := GetDim( left );
  1160. IF debug THEN Report( "AAB:left", left ); END;
  1161. (* check pattern: longest piece that can be done with a loop *)
  1162. FindPattern1( left, dim, loopd, looplen, loopli );
  1163. (* run through dimensions *)
  1164. RETURN Traverse( 0, GetAdr( left ) );
  1165. END ApplyBinaryASBOp;
  1166. (**** operators *)
  1167. (*** copy *)
  1168. PROCEDURE Copy4( ladr, dadr, linc, dinc, len: LONGINT );
  1169. CODE {SYSTEM.i386}
  1170. MOV ECX, [EBP+ladr] ; ECX := ladr
  1171. MOV EDX, [EBP+dadr] ; EDX := dadr
  1172. MOV EBX, [EBP+len] ; EBX := len
  1173. start:
  1174. CMP EBX, 0 ;
  1175. JLE end ; WHILE EBX > 0 DO
  1176. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1177. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1178. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1179. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1180. DEC EBX ; DEC(EBX)
  1181. JMP start
  1182. end:
  1183. END Copy4;
  1184. PROCEDURE Copy2( ladr, dadr, linc, dinc, len: LONGINT );
  1185. CODE {SYSTEM.i386}
  1186. MOV ECX, [EBP+ladr] ; ECX := ladr
  1187. MOV EDX, [EBP+dadr] ; EDX := dadr
  1188. MOV EBX, [EBP+len] ; EBX := len
  1189. start:
  1190. CMP EBX, 0 ;
  1191. JLE end ; WHILE EBX > 0 DO
  1192. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1193. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1194. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1195. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1196. DEC EBX ; DEC(EBX)
  1197. JMP start
  1198. end:
  1199. END Copy2;
  1200. PROCEDURE Copy1( ladr, dadr, linc, dinc, len: LONGINT );
  1201. CODE {SYSTEM.i386}
  1202. MOV ECX, [EBP+ladr] ; ECX := ladr
  1203. MOV EDX, [EBP+dadr] ; EDX := dadr
  1204. MOV EBX, [EBP+len] ; EBX := len
  1205. start:
  1206. CMP EBX, 0 ;
  1207. JLE end ; WHILE EBX > 0 DO
  1208. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1209. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1210. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1211. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1212. DEC EBX ; DEC(EBX)
  1213. JMP start
  1214. end:
  1215. END Copy1;
  1216. PROCEDURE Copy8( ladr, dadr, linc, dinc, len: LONGINT );
  1217. CODE {SYSTEM.i386}
  1218. MOV ECX, [EBP+ladr] ; ECX := ladr
  1219. MOV EDX, [EBP+dadr] ; EDX := dadr
  1220. MOV EBX, [EBP+len] ; EBX := len
  1221. start:
  1222. CMP EBX, 0 ;
  1223. JLE end ; WHILE EBX > 0 DO
  1224. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1225. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1226. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1227. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1228. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1229. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1230. DEC EBX ; DEC(EBX)
  1231. JMP start
  1232. end:
  1233. END Copy8;
  1234. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1235. (** Correct move if overlap, might be important for some array operations,
  1236. do not use SYSTEM.MOVE. *)
  1237. CODE {SYSTEM.i386}
  1238. MOV ECX, [ESP] ; len
  1239. MOV EDI, [ESP+4] ; destadr
  1240. MOV ESI, [ESP+8] ; srcadr
  1241. CMP ESI, EDI
  1242. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1243. MOV EAX, ESI
  1244. ADD EAX, ECX
  1245. CMP EAX, EDI
  1246. JBE moveup ; no overlap, no problem, move up
  1247. MOV ESI, EAX
  1248. ADD EDI, ECX
  1249. DEC ESI
  1250. DEC EDI
  1251. STD ; move down since overlap occured
  1252. REP
  1253. MOVSB
  1254. JMP done
  1255. moveup:
  1256. CLD
  1257. MOV BL, CL
  1258. SHR ECX, 2
  1259. AND BL, 00000003H ; rest to move after 4 byte move
  1260. REP
  1261. MOVSD ; move 4 bytes each step
  1262. MOV CL, BL
  1263. REP
  1264. MOVSB ; move rest in one byte steps
  1265. done:
  1266. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1267. END MoveB;
  1268. PROCEDURE CopyContent( dest, src, elementSize: LONGINT ); (**! optimize *)
  1269. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1270. origdest: LONGINT; modes: SET; dim: LONGINT;
  1271. PROCEDURE Loop( ladr, dadr, linc, dinc, len: LONGINT );
  1272. BEGIN
  1273. IF (dinc = elementSize) & (linc = elementSize) THEN
  1274. MoveB( ladr, dadr, len * elementSize );
  1275. (*
  1276. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1277. *)
  1278. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1279. len := len * elementSize;
  1280. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1281. ELSIF elementSize = 1 THEN
  1282. Copy1( ladr, dadr, linc, dinc, len );
  1283. (*
  1284. WHILE (len > 0) DO
  1285. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1286. END;
  1287. *)
  1288. ELSIF elementSize = 2 THEN
  1289. Copy2( ladr, dadr, linc, dinc, len );
  1290. (*
  1291. WHILE (len > 0) DO
  1292. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1293. END;
  1294. *)
  1295. ELSIF elementSize = 4 THEN
  1296. Copy4( ladr, dadr, linc, dinc, len );
  1297. (*
  1298. WHILE (len > 0) DO
  1299. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1300. END;
  1301. *)
  1302. ELSIF elementSize = 8 THEN
  1303. Copy8( ladr, dadr, linc, dinc, len );
  1304. (*
  1305. WHILE (len > 0) DO
  1306. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1307. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1308. INC( dadr, dinc );
  1309. END;
  1310. *)
  1311. ELSE (* SYSTEM.MOVE is expensive ! *)
  1312. WHILE (len > 0) DO
  1313. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1314. INC( dadr, dinc );
  1315. END;
  1316. END;
  1317. END Loop;
  1318. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  1319. VAR len: LONGINT; linc, dinc: LONGINT;
  1320. BEGIN
  1321. IF dim = loopd THEN
  1322. Loop( ladr, dadr, loopli, loopdi, looplen );
  1323. IF conservative THEN INC( glen, looplen ) END;
  1324. ELSE
  1325. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1326. dinc := GetIncr( dest, dim ); INC( dim );
  1327. WHILE (len > 0) DO
  1328. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1329. DEC( len );
  1330. END;
  1331. END;
  1332. END Traverse;
  1333. BEGIN
  1334. dim := GetDim( src );
  1335. origdest := 0; modes := {up, down}; (* copy modes *)
  1336. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1337. CopyUpCompatible( dest, src, modes );
  1338. IF up IN modes THEN (* nothing to be done *)
  1339. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1340. Reverse( src, dim ); Reverse( dest, dim )
  1341. ELSE (* can only copy via double buffer *)
  1342. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1343. END;
  1344. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1345. END;
  1346. (* check pattern: longest piece that can be done with a loop *)
  1347. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1348. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1349. IF up IN modes THEN (* nothing to be done *)
  1350. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1351. ELSE CopyContent( origdest, dest, elementSize );
  1352. END;
  1353. END CopyContent;
  1354. PROCEDURE AllocateSame( VAR dest: LONGINT; src: LONGINT;
  1355. elementsize: LONGINT ): ANY;
  1356. VAR ptr, data: ANY; Size: LONGINT;
  1357. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1358. PROCEDURE UseDescriptor;
  1359. VAR tag: LONGINT;
  1360. BEGIN
  1361. SYSTEM.GET( src - 4, tag );
  1362. Heaps.NewRec( ptr, tag, FALSE );
  1363. dest := SYSTEM.VAL( LONGINT, ptr );
  1364. END UseDescriptor;
  1365. PROCEDURE NewData;
  1366. VAR dim, len, size: LONGINT;
  1367. BEGIN
  1368. dim := GetDim( src ); size := elementsize;
  1369. PutDim( dest, dim );
  1370. PutSize( dest, elementsize );
  1371. WHILE (dim > 0) DO
  1372. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1373. PutInc( dest, dim, size ); size := size * len;
  1374. END;
  1375. SYSTEM.NEW( data, size );
  1376. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  1377. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) );
  1378. END NewData;
  1379. BEGIN
  1380. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  1381. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1382. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1383. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  1384. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1385. END;
  1386. PutFlags(dest, {TensorFlag});
  1387. NewData(); RETURN ptr;
  1388. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1389. (* check if re-allocation of descriptor is allowed *)
  1390. IF ~(TensorFlag IN GetFlags( dest )) &
  1391. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1392. HALT( 100 );
  1393. END;
  1394. UseDescriptor();
  1395. PutFlags(dest, {TensorFlag});
  1396. NewData(); RETURN ptr;
  1397. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1398. (* check if re-allocation of array data is allowed *)
  1399. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1400. HALT( 100 );
  1401. END;
  1402. NewData();
  1403. RETURN data;
  1404. ELSE (* nothing to do *)
  1405. RETURN NIL;
  1406. END;
  1407. END AllocateSame;
  1408. PROCEDURE TempDescCopy( src: Address ): ANY;
  1409. VAR p: ANY; dim: LONGINT;
  1410. BEGIN
  1411. dim := GetDim( src ); SYSTEM.NEW( p, dim * 8 + MathLenOffset );
  1412. SYSTEM.MOVE( src, SYSTEM.VAL( LONGINT, p ), dim * 8 + MathLenOffset ); PutAdr( src, 0 );
  1413. PutPtr( src, 0 ); PutFlags( src, {} ); RETURN p;
  1414. END TempDescCopy;
  1415. PROCEDURE CopyArraySelf*( dest, src: Address; elementsize: LONGINT );
  1416. VAR p: ANY;
  1417. BEGIN
  1418. ASSERT( src = dest ); p := TempDescCopy( src );
  1419. CopyArray( dest, SYSTEM.VAL( LONGINT, p ), elementsize );
  1420. END CopyArraySelf;
  1421. PROCEDURE CopyArray*( dest: Address; src: Address; elementsize: LONGINT );
  1422. VAR p: ANY; srcdim, destdim: LONGINT;
  1423. BEGIN
  1424. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1425. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1426. srcdim := GetDim(src);
  1427. destdim := GetDim(dest);
  1428. (*
  1429. Debugging.Stack("copy array");
  1430. *)
  1431. Report( "copy array source", src ); Report( "copy array des", dest );
  1432. HALT(100);
  1433. ELSIF src = dest THEN (* self copy *)
  1434. CopyArraySelf( dest, src, elementsize );
  1435. ELSE
  1436. p := AllocateSame( dest, src, elementsize );
  1437. CopyContent( dest, src, elementsize )
  1438. END;
  1439. END CopyArray;
  1440. PROCEDURE CopyTensorSelf*( VAR dest: Address; src: Address; elementsize: LONGINT );
  1441. BEGIN
  1442. dest := 0; CopyTensor( dest, src, elementsize );
  1443. END CopyTensorSelf;
  1444. PROCEDURE CopyTensor*( VAR dest: Address; src: Address;
  1445. elementsize: LONGINT );
  1446. VAR p: ANY;
  1447. BEGIN
  1448. (* Report("dest",dest); Report("src",src); *)
  1449. IF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1450. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1451. CopyContent( dest, src, elementsize );
  1452. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1453. ELSE CopyContent( dest, src, elementsize )
  1454. END;
  1455. END CopyTensor;
  1456. (* copy descriptor of src to that of dest. If not existent then create.*)
  1457. PROCEDURE ShallowCopy*(VAR dest: Address; src: Address);
  1458. VAR ptr: ANY; flags: SET;
  1459. PROCEDURE UseTypeDescriptor;
  1460. VAR tag: LONGINT; ptr: ANY;
  1461. BEGIN
  1462. SYSTEM.GET( src + Heaps.TypeDescOffset, tag ); Heaps.NewRec( ptr, tag, FALSE );
  1463. dest := SYSTEM.VAL( LONGINT, ptr );
  1464. END UseTypeDescriptor;
  1465. PROCEDURE CopyDescriptor;
  1466. BEGIN
  1467. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(Address) * GetDim( src ) *2 );
  1468. END CopyDescriptor;
  1469. BEGIN
  1470. (*
  1471. KernelLog.String("ShallowCopy called with ");
  1472. KernelLog.Int(src,10); KernelLog.Int(dest,10);
  1473. KernelLog.Ln;
  1474. Report( "scopy source", src ); Report( "scopy dest", dest );
  1475. *)
  1476. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1477. IF TensorFlag IN GetFlags( src ) THEN UseTypeDescriptor();
  1478. ELSE
  1479. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr ); (* ??? *)
  1480. END;
  1481. CopyDescriptor();
  1482. PutFlags(dest, {TensorFlag});
  1483. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1484. flags := GetFlags(dest);
  1485. (* check if re-allocation of descriptor is allowed *)
  1486. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1487. Halt(DimensionMismatch,src,0,dest);
  1488. END;
  1489. (* create a new descriptor!!! (added by Alexey) *)
  1490. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1491. CopyDescriptor();
  1492. PutFlags(dest, flags);
  1493. ELSE
  1494. flags := GetFlags(dest);
  1495. (* check if re-allocation of array data is allowed *)
  1496. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1497. Halt(AllocationForbidden,src,0,dest);
  1498. END;
  1499. CopyDescriptor();
  1500. PutFlags(dest, flags);
  1501. END;
  1502. END ShallowCopy;
  1503. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1504. BEGIN
  1505. IF debug THEN
  1506. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1507. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1508. END;
  1509. SYSTEM.MOVE( src, dest, 2*SIZEOF(Address) ); (* adr and ptr *)
  1510. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(Address) * GetDim( src ) *2 ); (* lens and increments *)
  1511. END DescriptorCopy;
  1512. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1513. VAR s,d: LONGINT;
  1514. BEGIN
  1515. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1516. ShallowCopy(d,s);
  1517. SYSTEM.PUT(ADDRESSOF(dest),d);
  1518. END ZeroCopy;
  1519. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1520. BEGIN
  1521. ZeroCopy(src, RESULT);
  1522. RETURN RESULT
  1523. END "ALIAS";
  1524. PROCEDURE SameShape( l, r: LONGINT ): BOOLEAN;
  1525. VAR dim: LONGINT;
  1526. BEGIN
  1527. dim := GetDim( l );
  1528. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1529. WHILE (dim > 0) DO
  1530. DEC( dim );
  1531. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1532. END;
  1533. RETURN TRUE;
  1534. END SameShape;
  1535. (*
  1536. PROCEDURE ZeroCopyArray*( dest: Address; src: Address; elementsize: LONGINT );
  1537. (*
  1538. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1539. check if deep copy can be avoided and if so then do a shallow copy
  1540. *)
  1541. BEGIN
  1542. ASSERT( dest # 0 ); (* impossible *)
  1543. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1544. HALT( 100 );
  1545. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1546. (* must copy (and allocate) *)
  1547. CopyArray( dest, src, elementsize );
  1548. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1549. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1550. ELSE CopyContent( dest, src, elementsize )
  1551. END;
  1552. ELSE DescriptorCopy( src, dest )
  1553. END;
  1554. END ZeroCopyArray;
  1555. PROCEDURE ZeroCopyTensor*( VAR dest: Address; src: Address; elementsize: LONGINT );
  1556. (*
  1557. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1558. check if deep copy can be avoided and if so then do a shallow copy
  1559. *)
  1560. BEGIN
  1561. IF debug THEN
  1562. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1563. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1564. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1565. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1566. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1567. END;
  1568. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1569. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1570. ELSE
  1571. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1572. END;
  1573. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1574. (* must copy (and allocate) *)
  1575. CopyTensor( dest, src, elementsize );
  1576. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1577. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1578. ELSE
  1579. HALT( 100 ); (* copy forbidden *)
  1580. END;
  1581. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1582. DescriptorCopy( src, dest );
  1583. ELSE
  1584. HALT( 100 ); (* different shapes: not allowed *)
  1585. END;
  1586. END ZeroCopyTensor;
  1587. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1588. VAR i: LONGINT;
  1589. BEGIN
  1590. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1591. CopyContent( dest, left, elementSize )
  1592. ELSE
  1593. IF debug THEN
  1594. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1595. KernelLog.Ln;
  1596. END;
  1597. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1598. FOR i := 0 TO dim - 1 DO
  1599. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1600. END;
  1601. END;
  1602. END ZeroCopy;
  1603. *)
  1604. (*** conversions ****)
  1605. (** SHORTINT -> INTEGER *)
  1606. PROCEDURE ConvertASAILoop( ladr, dadr, linc, dinc, len: LONGINT );
  1607. BEGIN
  1608. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1609. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1610. DEC( len );
  1611. END;
  1612. END ConvertASAILoop;
  1613. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1614. BEGIN
  1615. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1616. RETURN RESULT
  1617. END "@Convert";
  1618. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1619. BEGIN
  1620. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1621. RETURN RESULT
  1622. END "LONG";
  1623. (** SHORTINT -> LONGINT *)
  1624. PROCEDURE ConvertLoopSL( ladr, dadr, linc, dinc, len: LONGINT );
  1625. BEGIN
  1626. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1627. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1628. DEC( len );
  1629. END;
  1630. END ConvertLoopSL;
  1631. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1632. BEGIN
  1633. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1634. RETURN RESULT
  1635. END "@Convert";
  1636. (** SHORTINT -> REAL *)
  1637. PROCEDURE ConvertLoopSR( ladr, dadr, linc, dinc, len: LONGINT );
  1638. VAR lval: SHORTINT; dval: REAL;
  1639. BEGIN
  1640. WHILE (len > 0) DO
  1641. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1642. INC( dadr, dinc ); DEC( len );
  1643. END;
  1644. END ConvertLoopSR;
  1645. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1646. BEGIN
  1647. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1648. RETURN RESULT
  1649. END "@Convert";
  1650. (** SHORTINT -> LONGREAL *)
  1651. PROCEDURE ConvertLoopSX( ladr, dadr, linc, dinc, len: LONGINT );
  1652. VAR lval: SHORTINT; dval: LONGREAL;
  1653. BEGIN
  1654. WHILE (len > 0) DO
  1655. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1656. INC( dadr, dinc ); DEC( len );
  1657. END;
  1658. END ConvertLoopSX;
  1659. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1660. BEGIN
  1661. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1662. RETURN RESULT
  1663. END "@Convert";
  1664. (** INTEGER -> SHORTINT (SHORT) *)
  1665. PROCEDURE ConvertLoopIS( ladr, dadr, linc, dinc, len: LONGINT );
  1666. VAR lval: INTEGER; dval: SHORTINT;
  1667. BEGIN
  1668. WHILE (len > 0) DO
  1669. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1670. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1671. END;
  1672. END ConvertLoopIS;
  1673. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1674. BEGIN
  1675. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1676. RETURN RESULT
  1677. END "@Convert";
  1678. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1679. BEGIN
  1680. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1681. RETURN RESULT
  1682. END "SHORT";
  1683. (** INTEGER -> LONGINT *)
  1684. PROCEDURE ConvertLoopIL( ladr, dadr, linc, dinc, len: LONGINT );
  1685. BEGIN
  1686. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1687. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1688. DEC( len );
  1689. END;
  1690. END ConvertLoopIL;
  1691. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1692. BEGIN
  1693. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1694. RETURN RESULT
  1695. END "@Convert";
  1696. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1697. BEGIN
  1698. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1699. RETURN RESULT
  1700. END "LONG";
  1701. (** INTEGER -> REAL *)
  1702. PROCEDURE ConvertLoopIR( ladr, dadr, linc, dinc, len: LONGINT );
  1703. VAR lval: INTEGER; dval: REAL;
  1704. BEGIN
  1705. WHILE (len > 0) DO
  1706. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1707. INC( dadr, dinc ); DEC( len );
  1708. END;
  1709. END ConvertLoopIR;
  1710. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1711. BEGIN
  1712. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1713. RETURN RESULT
  1714. END "@Convert";
  1715. (** INTEGER -> LONGREAL *)
  1716. PROCEDURE ConvertLoopIX( ladr, dadr, linc, dinc, len: LONGINT );
  1717. VAR lval: INTEGER; dval: LONGREAL;
  1718. BEGIN
  1719. WHILE (len > 0) DO
  1720. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1721. INC( dadr, dinc ); DEC( len );
  1722. END;
  1723. END ConvertLoopIX;
  1724. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1725. BEGIN
  1726. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1727. RETURN RESULT
  1728. END "@Convert";
  1729. (** LONGINT -> INTEGER (SHORT) *)
  1730. PROCEDURE ConvertLoopLI( ladr, dadr, linc, dinc, len: LONGINT );
  1731. VAR lval: LONGINT; dval: INTEGER;
  1732. BEGIN
  1733. WHILE (len > 0) DO
  1734. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1735. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1736. END;
  1737. END ConvertLoopLI;
  1738. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1739. BEGIN
  1740. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1741. RETURN RESULT
  1742. END "@Convert";
  1743. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1744. BEGIN
  1745. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1746. RETURN RESULT
  1747. END "SHORT";
  1748. (** LONGINT -> REAL *)
  1749. PROCEDURE ConvertLoopLR( ladr, dadr, linc, dinc, len: LONGINT );
  1750. VAR lval: LONGINT; dval: REAL;
  1751. BEGIN
  1752. WHILE (len > 0) DO
  1753. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1754. INC( dadr, dinc ); DEC( len );
  1755. END;
  1756. END ConvertLoopLR;
  1757. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1758. BEGIN
  1759. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1760. RETURN RESULT
  1761. END "@Convert";
  1762. (** LONGINT -> LONGREAL *)
  1763. PROCEDURE ConvertLoopLX( ladr, dadr, linc, dinc, len: LONGINT );
  1764. VAR lval: LONGINT; dval: LONGREAL;
  1765. BEGIN
  1766. WHILE (len > 0) DO
  1767. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1768. INC( dadr, dinc ); DEC( len );
  1769. END;
  1770. END ConvertLoopLX;
  1771. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1772. BEGIN
  1773. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1774. RETURN RESULT
  1775. END "@Convert";
  1776. (** REAL -> LONGINT (ENTIER) *)
  1777. PROCEDURE ConvertLoopRL( ladr, dadr, linc, dinc, len: LONGINT );
  1778. VAR lval: REAL; dval: LONGINT;
  1779. BEGIN
  1780. WHILE (len > 0) DO
  1781. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1782. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1783. END;
  1784. END ConvertLoopRL;
  1785. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1786. BEGIN
  1787. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1788. RETURN RESULT
  1789. END "@Convert";
  1790. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1791. BEGIN
  1792. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1793. RETURN RESULT
  1794. END "ENTIER";
  1795. (** REAL -> LONGREAL *)
  1796. PROCEDURE ConvertLoopRX( ladr, dadr, linc, dinc, len: LONGINT );
  1797. VAR lval: REAL; dval: LONGREAL;
  1798. BEGIN
  1799. WHILE (len > 0) DO
  1800. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1801. INC( dadr, dinc ); DEC( len );
  1802. END;
  1803. END ConvertLoopRX;
  1804. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1805. BEGIN
  1806. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1807. RETURN RESULT
  1808. END "@Convert";
  1809. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1810. BEGIN
  1811. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1812. RETURN RESULT
  1813. END "LONG";
  1814. (** LONGREAL -> REAL (SHORT) *)
  1815. PROCEDURE ConvertLoopXR( ladr, dadr, linc, dinc, len: LONGINT );
  1816. VAR lval: LONGREAL; dval: REAL;
  1817. BEGIN
  1818. WHILE (len > 0) DO
  1819. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1820. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1821. END;
  1822. END ConvertLoopXR;
  1823. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1824. BEGIN
  1825. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1826. RETURN RESULT
  1827. END "@Convert";
  1828. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1829. BEGIN
  1830. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1831. RETURN RESULT
  1832. END "SHORT";
  1833. (** LONGREAL -> LONGINT (ENTIER) *)
  1834. PROCEDURE ConvertLoopXL( ladr, dadr, linc, dinc, len: LONGINT );
  1835. VAR lval: LONGREAL; dval: LONGINT;
  1836. BEGIN
  1837. WHILE (len > 0) DO
  1838. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1839. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1840. END;
  1841. END ConvertLoopXL;
  1842. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1843. BEGIN
  1844. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1845. RETURN RESULT
  1846. END "@Convert";
  1847. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1848. BEGIN
  1849. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1850. RETURN RESULT
  1851. END "ENTIER";
  1852. (*** monadic not A -> ~A ********************************************************************)
  1853. (** BOOLEAN *)
  1854. PROCEDURE NotLoopAB( ladr, dadr, linc, dinc, len: LONGINT );
  1855. VAR lval: BOOLEAN;
  1856. BEGIN
  1857. WHILE (len > 0) DO
  1858. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1859. DEC( len );
  1860. END;
  1861. END NotLoopAB;
  1862. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1863. BEGIN
  1864. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1865. RETURN RESULT
  1866. END "~";
  1867. (*** monadic generic (A) -> -A ********************************************************************)
  1868. (** SHORTINT *)
  1869. PROCEDURE GenericLoopS( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1870. VAR lval: SHORTINT;
  1871. BEGIN
  1872. WHILE (len > 0) DO
  1873. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1874. DEC( len );
  1875. END;
  1876. END GenericLoopS;
  1877. (** INTEGER *)
  1878. PROCEDURE GenericLoopI( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: INTEGER): INTEGER );
  1879. VAR lval: INTEGER;
  1880. BEGIN
  1881. WHILE (len > 0) DO
  1882. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1883. DEC( len );
  1884. END;
  1885. END GenericLoopI;
  1886. (** LONGINT *)
  1887. PROCEDURE GenericLoopL( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGINT): LONGINT );
  1888. VAR lval: LONGINT;
  1889. BEGIN
  1890. WHILE (len > 0) DO
  1891. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1892. DEC( len );
  1893. END;
  1894. END GenericLoopL;
  1895. (** HUGEINT *)
  1896. PROCEDURE GenericLoopH( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1897. VAR lval: HUGEINT;
  1898. BEGIN
  1899. WHILE (len > 0) DO
  1900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1901. DEC( len );
  1902. END;
  1903. END GenericLoopH;
  1904. (** REAL *)
  1905. PROCEDURE GenericLoopR( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: REAL): REAL );
  1906. VAR lval: REAL;
  1907. BEGIN
  1908. WHILE (len > 0) DO
  1909. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1910. DEC( len );
  1911. END;
  1912. END GenericLoopR;
  1913. (** LONGREAL *)
  1914. PROCEDURE GenericLoopX( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1915. VAR lval: LONGREAL;
  1916. BEGIN
  1917. WHILE (len > 0) DO
  1918. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1919. DEC( len );
  1920. END;
  1921. END GenericLoopX;
  1922. (** COMPLEX *)
  1923. PROCEDURE GenericLoopZ( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1924. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1925. BEGIN
  1926. WHILE (len > 0) DO
  1927. lval := ladr;
  1928. dval := dadr;
  1929. dval.val := op(lval.val);
  1930. INC( ladr, linc ); INC( dadr, dinc );
  1931. DEC( len );
  1932. END;
  1933. END GenericLoopZ;
  1934. (** LONGCOMPLEX *)
  1935. PROCEDURE GenericLoopLZ( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1936. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1937. BEGIN
  1938. WHILE (len > 0) DO
  1939. lval := ladr;
  1940. dval := dadr;
  1941. dval.val := op (lval.val);
  1942. INC( ladr, linc ); INC( dadr, dinc );
  1943. DEC( len );
  1944. END;
  1945. END GenericLoopLZ;
  1946. (*** monadic minus A -> -A ********************************************************************)
  1947. (** SHORTINT *)
  1948. PROCEDURE MinusLoopS( ladr, dadr, linc, dinc, len: LONGINT );
  1949. VAR lval: SHORTINT;
  1950. BEGIN
  1951. WHILE (len > 0) DO
  1952. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1953. DEC( len );
  1954. END;
  1955. END MinusLoopS;
  1956. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1957. BEGIN
  1958. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1959. RETURN RESULT
  1960. END "-";
  1961. (** INTEGER *)
  1962. PROCEDURE MinusLoopI( ladr, dadr, linc, dinc, len: LONGINT );
  1963. VAR lval: INTEGER;
  1964. BEGIN
  1965. WHILE (len > 0) DO
  1966. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1967. DEC( len );
  1968. END;
  1969. END MinusLoopI;
  1970. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1971. BEGIN
  1972. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1973. RETURN RESULT
  1974. END "-";
  1975. (** LONGINT *)
  1976. PROCEDURE MinusLoopL( ladr, dadr, linc, dinc, len: LONGINT );
  1977. VAR lval: LONGINT;
  1978. BEGIN
  1979. WHILE (len > 0) DO
  1980. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1981. DEC( len );
  1982. END;
  1983. END MinusLoopL;
  1984. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1985. BEGIN
  1986. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1987. RETURN RESULT
  1988. END "-";
  1989. (** REAL *)
  1990. PROCEDURE MinusLoopR( ladr, dadr, linc, dinc, len: LONGINT );
  1991. VAR lval: REAL;
  1992. BEGIN
  1993. WHILE (len > 0) DO
  1994. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1995. DEC( len );
  1996. END;
  1997. END MinusLoopR;
  1998. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1999. BEGIN
  2000. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  2001. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  2002. RETURN RESULT
  2003. END "-";
  2004. (** LONGREAL *)
  2005. PROCEDURE MinusLoopX( ladr, dadr, linc, dinc, len: LONGINT );
  2006. VAR lval: LONGREAL;
  2007. BEGIN
  2008. WHILE (len > 0) DO
  2009. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2010. DEC( len );
  2011. END;
  2012. END MinusLoopX;
  2013. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2014. BEGIN
  2015. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  2016. MinusLoopX );
  2017. RETURN RESULT
  2018. END "-";
  2019. (*** add array + array -> array ********************************************************************)
  2020. (** SHORTINT *)
  2021. PROCEDURE AddASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2022. VAR lval, rval: SHORTINT;
  2023. BEGIN
  2024. WHILE (len > 0) DO
  2025. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2026. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2027. END;
  2028. END AddASASLoop;
  2029. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2030. BEGIN
  2031. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2032. SIZEOF( SHORTINT ), AddASASLoop );
  2033. RETURN RESULT
  2034. END "+";
  2035. (** INTEGER *)
  2036. PROCEDURE AddAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2037. VAR lval, rval: INTEGER;
  2038. BEGIN
  2039. WHILE (len > 0) DO
  2040. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2041. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2042. END;
  2043. END AddAIAILoop;
  2044. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2045. BEGIN
  2046. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2047. SIZEOF( INTEGER ), AddAIAILoop );
  2048. RETURN RESULT
  2049. END "+";
  2050. (** LONGINT *)
  2051. PROCEDURE AddALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2052. VAR lval, rval: LONGINT;
  2053. BEGIN
  2054. WHILE (len > 0) DO
  2055. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2056. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2057. END;
  2058. END AddALALLoop;
  2059. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2060. BEGIN
  2061. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2062. SIZEOF( LONGINT ), AddALALLoop );
  2063. RETURN RESULT
  2064. END "+";
  2065. (** REAL *)
  2066. PROCEDURE AddARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2067. VAR lval, rval: REAL;
  2068. BEGIN
  2069. WHILE (len > 0) DO
  2070. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2071. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2072. END;
  2073. END AddARARLoop;
  2074. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2075. BEGIN
  2076. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2077. loopAddARAR );
  2078. RETURN RESULT
  2079. END "+";
  2080. (** LONGREAL *)
  2081. PROCEDURE AddAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2082. VAR lval, rval: LONGREAL;
  2083. BEGIN
  2084. WHILE (len > 0) DO
  2085. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2086. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2087. END;
  2088. END AddAXAXLoop;
  2089. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2090. BEGIN
  2091. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2092. SIZEOF( LONGREAL ), loopAddAXAX );
  2093. RETURN RESULT
  2094. END "+";
  2095. (** COMPLEX *)
  2096. PROCEDURE AddAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2097. VAR lval, rval: COMPLEX;
  2098. BEGIN
  2099. WHILE (len > 0) DO
  2100. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2101. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2102. END;
  2103. END AddAZAZLoop;
  2104. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2105. BEGIN
  2106. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2107. SIZEOF( COMPLEX ), loopAddAZAZ );
  2108. RETURN RESULT
  2109. END "+";
  2110. (** LONGCOMPLEX *)
  2111. PROCEDURE AddALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2112. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2113. BEGIN
  2114. WHILE (len > 0) DO
  2115. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2116. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2117. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2118. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2119. DEC( len );
  2120. END;
  2121. END AddALZALZLoop;
  2122. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2123. BEGIN
  2124. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2125. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2126. RETURN RESULT
  2127. END "+";
  2128. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2129. (** SHORTINT *)
  2130. PROCEDURE AddASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2131. VAR lval, rval: SHORTINT;
  2132. BEGIN
  2133. SYSTEM.GET( radr, rval );
  2134. WHILE (len > 0) DO
  2135. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2136. INC( dadr, dinc ); DEC( len );
  2137. END;
  2138. END AddASSSLoop;
  2139. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2140. BEGIN
  2141. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2142. SIZEOF( SHORTINT ), AddASSSLoop );
  2143. RETURN RESULT
  2144. END "+";
  2145. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2146. BEGIN
  2147. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2148. SIZEOF( SHORTINT ), AddASSSLoop );
  2149. RETURN RESULT
  2150. END "+";
  2151. (** INTEGER *)
  2152. PROCEDURE AddAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2153. VAR lval, rval: INTEGER;
  2154. BEGIN
  2155. SYSTEM.GET( radr, rval );
  2156. WHILE (len > 0) DO
  2157. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2158. INC( dadr, dinc ); DEC( len );
  2159. END;
  2160. END AddAISILoop;
  2161. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2162. BEGIN
  2163. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2164. SIZEOF( INTEGER ), AddAISILoop );
  2165. RETURN RESULT
  2166. END "+";
  2167. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2168. BEGIN
  2169. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2170. SIZEOF( INTEGER ), AddAISILoop );
  2171. RETURN RESULT
  2172. END "+";
  2173. (** LONGINT *)
  2174. PROCEDURE AddALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2175. VAR lval, rval: LONGINT;
  2176. BEGIN
  2177. SYSTEM.GET( radr, rval );
  2178. WHILE (len > 0) DO
  2179. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2180. INC( dadr, dinc ); DEC( len );
  2181. END;
  2182. END AddALSLLoop;
  2183. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2184. BEGIN
  2185. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2186. SIZEOF( LONGINT ), AddALSLLoop );
  2187. RETURN RESULT
  2188. END "+";
  2189. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2190. BEGIN
  2191. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2192. SIZEOF( LONGINT ), AddALSLLoop );
  2193. RETURN RESULT
  2194. END "+";
  2195. (** REAL *)
  2196. PROCEDURE AddARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2197. VAR lval, rval: REAL;
  2198. BEGIN
  2199. SYSTEM.GET( radr, rval );
  2200. WHILE (len > 0) DO
  2201. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2202. INC( dadr, dinc ); DEC( len );
  2203. END;
  2204. END AddARSRLoop;
  2205. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2206. BEGIN
  2207. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2208. AddARSRLoop );
  2209. RETURN RESULT
  2210. END "+";
  2211. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2212. BEGIN
  2213. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2214. AddARSRLoop );
  2215. RETURN RESULT
  2216. END "+";
  2217. (** LONGREAL *)
  2218. PROCEDURE AddAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2219. VAR lval, rval: LONGREAL;
  2220. BEGIN
  2221. SYSTEM.GET( radr, rval );
  2222. WHILE (len > 0) DO
  2223. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2224. INC( dadr, dinc ); DEC( len );
  2225. END;
  2226. END AddAXSXLoop;
  2227. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2228. BEGIN
  2229. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2230. SIZEOF( LONGREAL ), AddAXSXLoop );
  2231. RETURN RESULT
  2232. END "+";
  2233. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2234. BEGIN
  2235. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2236. SIZEOF( LONGREAL ), AddAXSXLoop );
  2237. RETURN RESULT
  2238. END "+";
  2239. (** COMPLEX *)
  2240. PROCEDURE AddAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2241. VAR lval, rval: COMPLEX;
  2242. BEGIN
  2243. SYSTEM.GET( radr, rval );
  2244. WHILE (len > 0) DO
  2245. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2246. INC( dadr, dinc ); DEC( len );
  2247. END;
  2248. END AddAZSZLoop;
  2249. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2250. BEGIN
  2251. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2252. AddAZSZLoop );
  2253. RETURN RESULT
  2254. END "+";
  2255. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2256. BEGIN
  2257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2258. AddAZSZLoop );
  2259. RETURN RESULT
  2260. END "+";
  2261. (** LONGCOMPLEX *)
  2262. PROCEDURE AddALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2263. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2264. BEGIN
  2265. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2266. WHILE (len > 0) DO
  2267. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2268. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2269. INC( ladr, linc );
  2270. INC( dadr, dinc ); DEC( len );
  2271. END;
  2272. END AddALZSLZLoop;
  2273. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2274. BEGIN
  2275. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2276. AddALZSLZLoop );
  2277. RETURN RESULT
  2278. END "+";
  2279. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2280. BEGIN
  2281. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2282. AddALZSLZLoop );
  2283. RETURN RESULT
  2284. END "+";
  2285. (*** subtraction array - array -> array ********************************************************************)
  2286. (** SHORTINT *)
  2287. PROCEDURE SubASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2288. VAR lval, rval: SHORTINT;
  2289. BEGIN
  2290. WHILE (len > 0) DO
  2291. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2292. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2293. END;
  2294. END SubASASLoop;
  2295. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2296. BEGIN
  2297. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2298. SIZEOF( SHORTINT ), SubASASLoop );
  2299. RETURN RESULT
  2300. END "-";
  2301. (** INTEGER *)
  2302. PROCEDURE SubAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2303. VAR lval, rval: INTEGER;
  2304. BEGIN
  2305. WHILE (len > 0) DO
  2306. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2307. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2308. END;
  2309. END SubAIAILoop;
  2310. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2311. BEGIN
  2312. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2313. SIZEOF( INTEGER ), SubAIAILoop );
  2314. RETURN RESULT
  2315. END "-";
  2316. (** LONGINT *)
  2317. PROCEDURE SubALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2318. VAR lval, rval: LONGINT;
  2319. BEGIN
  2320. WHILE (len > 0) DO
  2321. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2322. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2323. END;
  2324. END SubALALLoop;
  2325. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2326. BEGIN
  2327. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2328. SIZEOF( LONGINT ), SubALALLoop );
  2329. RETURN RESULT
  2330. END "-";
  2331. (** REAL *)
  2332. PROCEDURE SubARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2333. VAR lval, rval: REAL;
  2334. BEGIN
  2335. WHILE (len > 0) DO
  2336. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2337. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2338. END;
  2339. END SubARARLoop;
  2340. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2341. BEGIN
  2342. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2343. SubARARLoop );
  2344. RETURN RESULT
  2345. END "-";
  2346. (** LONGREAL *)
  2347. PROCEDURE SubAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2348. VAR lval, rval: LONGREAL;
  2349. BEGIN
  2350. WHILE (len > 0) DO
  2351. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2352. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2353. END;
  2354. END SubAXAXLoop;
  2355. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2356. BEGIN
  2357. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2358. SIZEOF( LONGREAL ), SubAXAXLoop );
  2359. RETURN RESULT
  2360. END "-";
  2361. (** COMPLEX *)
  2362. PROCEDURE SubAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2363. VAR lval, rval: COMPLEX;
  2364. BEGIN
  2365. WHILE (len > 0) DO
  2366. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2367. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2368. END;
  2369. END SubAZAZLoop;
  2370. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2371. BEGIN
  2372. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2373. SIZEOF( COMPLEX ), SubAZAZLoop );
  2374. RETURN RESULT
  2375. END "-";
  2376. (** LONGCOMPLEX *)
  2377. PROCEDURE SubALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2378. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2379. BEGIN
  2380. WHILE (len > 0) DO
  2381. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2382. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2383. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2384. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2385. DEC( len );
  2386. END;
  2387. END SubALZALZLoop;
  2388. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2389. BEGIN
  2390. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2391. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2392. RETURN RESULT
  2393. END "-";
  2394. (*** subtraction array-scalar -> array ********************************************************************)
  2395. (** SHORTINT *)
  2396. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2397. BEGIN
  2398. RESULT := left + (-right);
  2399. RETURN RESULT
  2400. END "-";
  2401. (** INTEGER *)
  2402. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2403. BEGIN
  2404. RESULT := left + (-right);
  2405. RETURN RESULT
  2406. END "-";
  2407. (** LONGINT *)
  2408. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2409. BEGIN
  2410. RESULT := left + (-right);
  2411. RETURN RESULT
  2412. END "-";
  2413. (** REAL *)
  2414. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2415. BEGIN
  2416. RESULT := left + (-right);
  2417. RETURN RESULT
  2418. END "-";
  2419. (** LONGREAL *)
  2420. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2421. BEGIN
  2422. RESULT := left + (-right);
  2423. RETURN RESULT
  2424. END "-";
  2425. (** COMPLEX *)
  2426. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2427. BEGIN
  2428. RESULT := left + (-right);
  2429. RETURN RESULT
  2430. END "-";
  2431. (** LONGCOMPLEX *)
  2432. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2433. BEGIN
  2434. RESULT := left + (-right);
  2435. RETURN RESULT
  2436. END "-";
  2437. (*** subtraction scalar-array -> array ********************************************************************)
  2438. (** SHORTINT *)
  2439. PROCEDURE SubSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2440. VAR lval, rval, dval: SHORTINT;
  2441. BEGIN
  2442. SYSTEM.GET( radr, rval );
  2443. WHILE (len > 0) DO
  2444. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2445. INC( dadr, dinc ); DEC( len );
  2446. END;
  2447. END SubSSASLoop;
  2448. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2449. BEGIN
  2450. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2451. SIZEOF( SHORTINT ), SubSSASLoop );
  2452. RETURN RESULT
  2453. END "-";
  2454. (** INTEGER *)
  2455. PROCEDURE SubSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2456. VAR lval, rval, dval: INTEGER;
  2457. BEGIN
  2458. SYSTEM.GET( radr, rval );
  2459. WHILE (len > 0) DO
  2460. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2461. INC( dadr, dinc ); DEC( len );
  2462. END;
  2463. END SubSIAILoop;
  2464. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2465. BEGIN
  2466. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2467. SIZEOF( INTEGER ), SubSIAILoop );
  2468. RETURN RESULT
  2469. END "-";
  2470. (** LONGINT *)
  2471. PROCEDURE SubSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2472. VAR lval, rval, dval: LONGINT;
  2473. BEGIN
  2474. SYSTEM.GET( radr, rval );
  2475. WHILE (len > 0) DO
  2476. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2477. INC( dadr, dinc ); DEC( len );
  2478. END;
  2479. END SubSLALLoop;
  2480. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2481. BEGIN
  2482. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2483. SIZEOF( LONGINT ), SubSLALLoop );
  2484. RETURN RESULT
  2485. END "-";
  2486. (** REAL *)
  2487. PROCEDURE SubSRARLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2488. VAR lval, rval, dval: REAL;
  2489. BEGIN
  2490. SYSTEM.GET( radr, rval );
  2491. WHILE (len > 0) DO
  2492. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2493. INC( dadr, dinc ); DEC( len );
  2494. END;
  2495. END SubSRARLoop;
  2496. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2497. BEGIN
  2498. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2499. SubSRARLoop );
  2500. RETURN RESULT
  2501. END "-";
  2502. (** LONGREAL *)
  2503. PROCEDURE SubSXAXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2504. VAR lval, rval, dval: LONGREAL;
  2505. BEGIN
  2506. SYSTEM.GET( radr, rval );
  2507. WHILE (len > 0) DO
  2508. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2509. INC( dadr, dinc ); DEC( len );
  2510. END;
  2511. END SubSXAXLoop;
  2512. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2513. BEGIN
  2514. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2515. SIZEOF( LONGREAL ), SubSXAXLoop );
  2516. RETURN RESULT
  2517. END "-";
  2518. (** COMPLEX *)
  2519. PROCEDURE SubSZAZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2520. VAR lval, rval, dval: COMPLEX;
  2521. BEGIN
  2522. SYSTEM.GET( radr, rval );
  2523. WHILE (len > 0) DO
  2524. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2525. INC( dadr, dinc ); DEC( len );
  2526. END;
  2527. END SubSZAZLoop;
  2528. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2529. BEGIN
  2530. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2531. SIZEOF( COMPLEX ), SubSZAZLoop );
  2532. RETURN RESULT
  2533. END "-";
  2534. (** LONGCOMPLEX *)
  2535. PROCEDURE SubSLZALZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2536. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2537. BEGIN
  2538. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2539. WHILE (len > 0) DO
  2540. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2541. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2542. INC( ladr, linc );
  2543. INC( dadr, dinc ); DEC( len );
  2544. END;
  2545. END SubSLZALZLoop;
  2546. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2547. BEGIN
  2548. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2549. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2550. RETURN RESULT
  2551. END "-";
  2552. (*** element-wise multiply array x array -> array ********************************************************************)
  2553. (** SHORTINT *)
  2554. PROCEDURE EMulASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2555. VAR lval, rval: SHORTINT;
  2556. BEGIN
  2557. WHILE (len > 0) DO
  2558. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2559. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2560. END;
  2561. END EMulASASLoop;
  2562. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2563. BEGIN
  2564. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2565. SIZEOF( SHORTINT ), EMulASASLoop );
  2566. RETURN RESULT
  2567. END ".*";
  2568. (** INTEGER *)
  2569. PROCEDURE EMulAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2570. VAR lval, rval: INTEGER; dval: INTEGER;
  2571. BEGIN
  2572. WHILE (len > 0) DO
  2573. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2574. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2575. DEC( len );
  2576. END;
  2577. END EMulAIAILoop;
  2578. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2579. BEGIN
  2580. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2581. SIZEOF( INTEGER ), EMulAIAILoop );
  2582. RETURN RESULT
  2583. END ".*";
  2584. (** LONGINT *)
  2585. PROCEDURE EMulALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2586. VAR lval, rval: LONGINT;
  2587. BEGIN
  2588. WHILE (len > 0) DO
  2589. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2590. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2591. END;
  2592. END EMulALALLoop;
  2593. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2594. BEGIN
  2595. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2596. SIZEOF( LONGINT ), EMulALALLoop );
  2597. RETURN RESULT
  2598. END ".*";
  2599. (** REAL *)
  2600. PROCEDURE EMulARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2601. VAR lval, rval: REAL;
  2602. BEGIN
  2603. WHILE (len > 0) DO
  2604. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2605. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2606. END;
  2607. END EMulARARLoop;
  2608. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2609. BEGIN
  2610. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2611. EMulARARLoop );
  2612. RETURN RESULT
  2613. END ".*";
  2614. (** LONGREAL *)
  2615. PROCEDURE EMulAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2616. VAR lval, rval: LONGREAL;
  2617. BEGIN
  2618. WHILE (len > 0) DO
  2619. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2620. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2621. END;
  2622. END EMulAXAXLoop;
  2623. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2624. BEGIN
  2625. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2626. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2627. RETURN RESULT
  2628. END ".*";
  2629. (** COMPLEX *)
  2630. PROCEDURE EMulAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2631. VAR lval, rval: COMPLEX;
  2632. BEGIN
  2633. WHILE (len > 0) DO
  2634. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2635. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2636. END;
  2637. END EMulAZAZLoop;
  2638. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2639. BEGIN
  2640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2641. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2642. RETURN RESULT
  2643. END ".*";
  2644. (** LONGCOMPLEX *)
  2645. PROCEDURE EMulALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2646. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2647. BEGIN
  2648. WHILE (len > 0) DO
  2649. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2650. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2651. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2652. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2653. DEC( len );
  2654. END;
  2655. END EMulALZALZLoop;
  2656. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2657. BEGIN
  2658. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2659. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2660. RETURN RESULT
  2661. END ".*";
  2662. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2663. (** SHORTINT *)
  2664. PROCEDURE EMulIncASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2665. VAR lval, rval,dval: SHORTINT;
  2666. BEGIN
  2667. WHILE (len > 0) DO
  2668. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2669. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2670. END;
  2671. END EMulIncASASLoop;
  2672. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2673. BEGIN
  2674. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2675. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2676. END ".*+";
  2677. (** INTEGER *)
  2678. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2679. VAR lval, rval,dval: INTEGER;
  2680. BEGIN
  2681. WHILE (len > 0) DO
  2682. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2683. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2684. DEC( len );
  2685. END;
  2686. END EMulIncAIAILoop;
  2687. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2688. BEGIN
  2689. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2690. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2691. END ".*+";
  2692. (** LONGINT *)
  2693. PROCEDURE EMulIncALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2694. VAR lval, rval,dval: LONGINT;
  2695. BEGIN
  2696. WHILE (len > 0) DO
  2697. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2698. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2699. END;
  2700. END EMulIncALALLoop;
  2701. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2702. BEGIN
  2703. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2704. SIZEOF( LONGINT ), EMulIncALALLoop );
  2705. END ".*+";
  2706. (** REAL *)
  2707. PROCEDURE EMulIncARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2708. VAR lval, rval,dval: REAL;
  2709. BEGIN
  2710. WHILE (len > 0) DO
  2711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2712. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2713. END;
  2714. END EMulIncARARLoop;
  2715. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2716. BEGIN
  2717. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2718. EMulIncARARLoop );
  2719. END ".*+";
  2720. (** LONGREAL *)
  2721. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2722. VAR lval, rval,dval: LONGREAL;
  2723. BEGIN
  2724. WHILE (len > 0) DO
  2725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2726. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END EMulIncAXAXLoop;
  2729. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2730. BEGIN
  2731. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2732. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2733. END ".*+";
  2734. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2735. (** SHORTINT *)
  2736. PROCEDURE MulASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2737. VAR lval, rval: SHORTINT;
  2738. BEGIN
  2739. SYSTEM.GET( radr, rval );
  2740. WHILE (len > 0) DO
  2741. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2742. INC( dadr, dinc ); DEC( len );
  2743. END;
  2744. END MulASSSLoop;
  2745. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2746. BEGIN
  2747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2748. SIZEOF( SHORTINT ), MulASSSLoop );
  2749. RETURN RESULT
  2750. END "*";
  2751. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2752. BEGIN
  2753. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2754. SIZEOF( SHORTINT ), MulASSSLoop );
  2755. RETURN RESULT
  2756. END "*";
  2757. (** INTEGER *)
  2758. PROCEDURE MulAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2759. VAR lval, rval: INTEGER;
  2760. BEGIN
  2761. SYSTEM.GET( radr, rval );
  2762. WHILE (len > 0) DO
  2763. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2764. INC( dadr, dinc ); DEC( len );
  2765. END;
  2766. END MulAISILoop;
  2767. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2768. BEGIN
  2769. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2770. SIZEOF( INTEGER ), MulAISILoop );
  2771. RETURN RESULT
  2772. END "*";
  2773. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2774. BEGIN
  2775. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2776. SIZEOF( INTEGER ), MulAISILoop );
  2777. RETURN RESULT
  2778. END "*";
  2779. (** LONGINT *)
  2780. PROCEDURE MulALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2781. VAR lval, rval: LONGINT;
  2782. BEGIN
  2783. SYSTEM.GET( radr, rval );
  2784. WHILE (len > 0) DO
  2785. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2786. INC( dadr, dinc ); DEC( len );
  2787. END;
  2788. END MulALSLLoop;
  2789. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2790. BEGIN
  2791. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2792. SIZEOF( LONGINT ), MulALSLLoop );
  2793. RETURN RESULT
  2794. END "*";
  2795. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2796. BEGIN
  2797. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2798. SIZEOF( LONGINT ), MulALSLLoop );
  2799. RETURN RESULT
  2800. END "*";
  2801. (** REAL *)
  2802. PROCEDURE MulARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2803. VAR lval, rval: REAL;
  2804. BEGIN
  2805. SYSTEM.GET( radr, rval );
  2806. WHILE (len > 0) DO
  2807. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2808. INC( dadr, dinc ); DEC( len );
  2809. END;
  2810. END MulARSRLoop;
  2811. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2812. BEGIN
  2813. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2814. loopMulARSR );
  2815. RETURN RESULT
  2816. END "*";
  2817. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2818. BEGIN
  2819. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2820. loopMulARSR );
  2821. RETURN RESULT
  2822. END "*";
  2823. (** LONGREAL *)
  2824. PROCEDURE MulAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2825. VAR lval, rval: LONGREAL;
  2826. BEGIN
  2827. IF debug THEN
  2828. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2829. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2830. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2831. END;
  2832. SYSTEM.GET( radr, rval );
  2833. WHILE (len > 0) DO
  2834. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2835. INC( dadr, dinc ); DEC( len );
  2836. END;
  2837. END MulAXSXLoop;
  2838. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2839. BEGIN
  2840. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2841. SIZEOF( LONGREAL ), loopMulAXSX );
  2842. RETURN RESULT
  2843. END "*";
  2844. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2845. BEGIN
  2846. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2847. SIZEOF( LONGREAL ), loopMulAXSX );
  2848. RETURN RESULT
  2849. END "*";
  2850. (** COMPLEX *)
  2851. PROCEDURE MulAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2852. VAR lval, rval: COMPLEX;
  2853. BEGIN
  2854. SYSTEM.GET( radr, rval );
  2855. WHILE (len > 0) DO
  2856. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2857. INC( dadr, dinc ); DEC( len );
  2858. END;
  2859. END MulAZSZLoop;
  2860. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2861. BEGIN
  2862. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2863. loopMulAZSZ );
  2864. RETURN RESULT
  2865. END "*";
  2866. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2867. BEGIN
  2868. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2869. loopMulAZSZ );
  2870. RETURN RESULT
  2871. END "*";
  2872. (** LONGCOMPLEX *)
  2873. PROCEDURE MulALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2874. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2875. BEGIN
  2876. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2877. WHILE (len > 0) DO
  2878. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2879. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2880. INC( ladr, linc );
  2881. INC( dadr, dinc ); DEC( len );
  2882. END;
  2883. END MulALZSLZLoop;
  2884. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2885. BEGIN
  2886. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2887. loopMulALZSLZ );
  2888. RETURN RESULT
  2889. END "*";
  2890. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2891. BEGIN
  2892. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2893. loopMulALZSLZ );
  2894. RETURN RESULT
  2895. END "*";
  2896. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2897. (** SHORTINT *)
  2898. PROCEDURE IncMulASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2899. VAR lval, rval, dval: SHORTINT;
  2900. BEGIN
  2901. SYSTEM.GET( radr, rval );
  2902. WHILE (len > 0) DO
  2903. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2904. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2905. END;
  2906. END IncMulASSSLoop;
  2907. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2908. BEGIN
  2909. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2910. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2911. END "IncMul";
  2912. OPERATOR "IncMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2913. BEGIN
  2914. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2915. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2916. RETURN RESULT
  2917. END "IncMul";
  2918. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2919. BEGIN
  2920. RESULT := -RESULT;
  2921. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2922. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2923. RESULT := -RESULT;
  2924. RETURN RESULT
  2925. END "DecMul";
  2926. OPERATOR "DecMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2927. BEGIN
  2928. RESULT := -RESULT;
  2929. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2930. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2931. RESULT := -RESULT;
  2932. RETURN RESULT
  2933. END "DecMul";
  2934. (** INTEGER *)
  2935. PROCEDURE IncMulAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2936. VAR lval, rval, dval: INTEGER;
  2937. BEGIN
  2938. SYSTEM.GET( radr, rval );
  2939. WHILE (len > 0) DO
  2940. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2941. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2942. END;
  2943. END IncMulAISILoop;
  2944. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2945. BEGIN
  2946. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2947. SIZEOF( INTEGER ), IncMulAISILoop );
  2948. RETURN RESULT
  2949. END "IncMul";
  2950. OPERATOR "IncMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2951. BEGIN
  2952. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2953. SIZEOF( INTEGER ), IncMulAISILoop );
  2954. RETURN RESULT
  2955. END "IncMul";
  2956. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2957. BEGIN
  2958. RESULT := -RESULT;
  2959. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2960. SIZEOF( INTEGER ), IncMulAISILoop );
  2961. RESULT := -RESULT;
  2962. RETURN RESULT
  2963. END "DecMul";
  2964. OPERATOR "DecMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2965. BEGIN
  2966. RESULT := -RESULT;
  2967. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2968. SIZEOF( INTEGER ), IncMulAISILoop );
  2969. RESULT := -RESULT;
  2970. RETURN RESULT
  2971. END "DecMul";
  2972. (** LONGINT *)
  2973. PROCEDURE IncMulALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2974. VAR lval, rval, dval: LONGINT;
  2975. BEGIN
  2976. SYSTEM.GET( radr, rval );
  2977. WHILE (len > 0) DO
  2978. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2979. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2980. END;
  2981. END IncMulALSLLoop;
  2982. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2983. BEGIN
  2984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2985. SIZEOF( LONGINT ), IncMulALSLLoop );
  2986. RETURN RESULT
  2987. END "IncMul";
  2988. OPERATOR "IncMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2989. BEGIN
  2990. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2991. SIZEOF( LONGINT ), IncMulALSLLoop );
  2992. RETURN RESULT
  2993. END "IncMul";
  2994. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2995. BEGIN
  2996. RESULT := -RESULT;
  2997. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2998. SIZEOF( LONGINT ), IncMulALSLLoop );
  2999. RESULT := -RESULT;
  3000. RETURN RESULT
  3001. END "DecMul";
  3002. OPERATOR "DecMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3003. BEGIN
  3004. RESULT := -RESULT;
  3005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3006. SIZEOF( LONGINT ), IncMulALSLLoop );
  3007. RESULT := -RESULT;
  3008. RETURN RESULT
  3009. END "DecMul";
  3010. (** REAL *)
  3011. PROCEDURE IncMulARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3012. VAR lval, rval, dval: REAL;
  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 IncMulARSRLoop;
  3020. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3021. BEGIN
  3022. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3023. loopIncMulARSR );
  3024. RETURN RESULT
  3025. END "IncMul";
  3026. OPERATOR "IncMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3027. BEGIN
  3028. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3029. loopIncMulARSR );
  3030. RETURN RESULT
  3031. END "IncMul";
  3032. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3033. BEGIN
  3034. RESULT := -RESULT;
  3035. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3036. loopIncMulARSR );
  3037. RESULT := -RESULT;
  3038. RETURN RESULT
  3039. END "DecMul";
  3040. OPERATOR "DecMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3041. BEGIN
  3042. RESULT := -RESULT;
  3043. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3044. loopIncMulARSR );
  3045. RESULT := -RESULT;
  3046. RETURN RESULT
  3047. END "DecMul";
  3048. (** LONGREAL *)
  3049. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3050. VAR lval, rval, dval: LONGREAL;
  3051. BEGIN
  3052. IF debug THEN
  3053. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3054. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3055. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3056. END;
  3057. SYSTEM.GET( radr, rval );
  3058. WHILE (len > 0) DO
  3059. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3060. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3061. END;
  3062. END IncMulAXSXLoop;
  3063. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3064. BEGIN
  3065. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3066. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3067. RETURN RESULT
  3068. END "IncMul";
  3069. OPERATOR "IncMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3070. BEGIN
  3071. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3072. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3073. RETURN RESULT
  3074. END "IncMul";
  3075. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3076. BEGIN
  3077. RESULT := -RESULT;
  3078. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3079. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3080. RESULT := -RESULT;
  3081. RETURN RESULT
  3082. END "DecMul";
  3083. OPERATOR "DecMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3084. BEGIN
  3085. RESULT := -RESULT;
  3086. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3087. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3088. RESULT := -RESULT;
  3089. RETURN RESULT
  3090. END "DecMul";
  3091. (*** element-wise division array / array -> array ********************************************************************)
  3092. (** SHORTINT *)
  3093. PROCEDURE EDivideASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3094. VAR lval, rval: SHORTINT; dval: REAL;
  3095. BEGIN
  3096. WHILE (len > 0) DO
  3097. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3098. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3099. DEC( len );
  3100. END;
  3101. END EDivideASASLoop;
  3102. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3103. BEGIN
  3104. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3105. EDivideASASLoop );
  3106. RETURN RESULT
  3107. END "./";
  3108. (** INTEGER *)
  3109. PROCEDURE EDivideAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3110. VAR lval, rval: INTEGER; dval: REAL;
  3111. BEGIN
  3112. WHILE (len > 0) DO
  3113. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3114. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3115. DEC( len );
  3116. END;
  3117. END EDivideAIAILoop;
  3118. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3119. BEGIN
  3120. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3121. EDivideAIAILoop );
  3122. RETURN RESULT
  3123. END "./";
  3124. (** LONGINT *)
  3125. PROCEDURE EDivideALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3126. VAR lval, rval: LONGINT; dval: REAL;
  3127. BEGIN
  3128. WHILE (len > 0) DO
  3129. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3130. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3131. DEC( len );
  3132. END;
  3133. END EDivideALALLoop;
  3134. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3135. BEGIN
  3136. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3137. EDivideALALLoop );
  3138. RETURN RESULT
  3139. END "./";
  3140. (** REAL *)
  3141. PROCEDURE EDivideARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3142. VAR lval, rval: REAL; dval: REAL;
  3143. BEGIN
  3144. WHILE (len > 0) DO
  3145. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3146. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3147. DEC( len );
  3148. END;
  3149. END EDivideARARLoop;
  3150. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3151. BEGIN
  3152. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3153. EDivideARARLoop );
  3154. RETURN RESULT
  3155. END "./";
  3156. (** LONGREAL *)
  3157. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3158. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3159. BEGIN
  3160. WHILE (len > 0) DO
  3161. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3162. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3163. DEC( len );
  3164. END;
  3165. END EDivideAXAXLoop;
  3166. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3167. BEGIN
  3168. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3169. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3170. RETURN RESULT
  3171. END "./";
  3172. (** COMPLEX *)
  3173. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3174. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3175. BEGIN
  3176. WHILE (len > 0) DO
  3177. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3178. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3179. DEC( len );
  3180. END;
  3181. END EDivideAZAZLoop;
  3182. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3183. BEGIN
  3184. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3185. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3186. RETURN RESULT
  3187. END "./";
  3188. (** LONGCOMPLEX *)
  3189. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3190. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3191. BEGIN
  3192. WHILE (len > 0) DO
  3193. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3194. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3195. IF rvalIm # 0.0D0 THEN
  3196. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3197. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3198. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3199. ELSE
  3200. dvalRe := lvalRe/rvalRe;
  3201. dvalIm := lvalIm/rvalRe;
  3202. END;
  3203. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3204. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3205. DEC( len );
  3206. END;
  3207. END EDivideALZALZLoop;
  3208. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3209. BEGIN
  3210. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3211. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3212. RETURN RESULT
  3213. END "./";
  3214. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3215. (** SHORTINT *)
  3216. PROCEDURE DivideASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3217. VAR lval, rval: SHORTINT; dval: REAL;
  3218. BEGIN
  3219. SYSTEM.GET( radr, rval );
  3220. WHILE (len > 0) DO
  3221. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3222. INC( dadr, dinc ); DEC( len );
  3223. END;
  3224. END DivideASSSLoop;
  3225. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3226. BEGIN
  3227. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3228. DivideASSSLoop );
  3229. RETURN RESULT
  3230. END "/";
  3231. PROCEDURE DivideSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3232. VAR lval, rval: SHORTINT; dval: REAL;
  3233. BEGIN
  3234. SYSTEM.GET( radr, rval );
  3235. WHILE (len > 0) DO
  3236. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3237. INC( dadr, dinc ); DEC( len );
  3238. END;
  3239. END DivideSSASLoop;
  3240. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3241. BEGIN
  3242. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3243. DivideSSASLoop );
  3244. RETURN RESULT
  3245. END "/";
  3246. (** INTEGER *)
  3247. PROCEDURE DivideAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3248. VAR lval, rval: INTEGER; dval: REAL;
  3249. BEGIN
  3250. SYSTEM.GET( radr, rval );
  3251. WHILE (len > 0) DO
  3252. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3253. INC( dadr, dinc ); DEC( len );
  3254. END;
  3255. END DivideAISILoop;
  3256. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3257. BEGIN
  3258. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3259. DivideAISILoop );
  3260. RETURN RESULT
  3261. END "/";
  3262. PROCEDURE DivideSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3263. VAR lval, rval: INTEGER; dval: REAL;
  3264. BEGIN
  3265. SYSTEM.GET( radr, rval );
  3266. WHILE (len > 0) DO
  3267. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3268. INC( dadr, dinc ); DEC( len );
  3269. END;
  3270. END DivideSIAILoop;
  3271. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3272. BEGIN
  3273. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3274. DivideSIAILoop );
  3275. RETURN RESULT
  3276. END "/";
  3277. (** LONGINT *)
  3278. PROCEDURE DivideALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3279. VAR lval, rval: LONGINT; dval: REAL;
  3280. BEGIN
  3281. SYSTEM.GET( radr, rval );
  3282. WHILE (len > 0) DO
  3283. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3284. INC( dadr, dinc ); DEC( len );
  3285. END;
  3286. END DivideALSLLoop;
  3287. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3288. BEGIN
  3289. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3290. DivideALSLLoop );
  3291. RETURN RESULT
  3292. END "/";
  3293. PROCEDURE DivideSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3294. VAR lval, rval: LONGINT; dval: REAL;
  3295. BEGIN
  3296. SYSTEM.GET( radr, rval );
  3297. WHILE (len > 0) DO
  3298. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3299. INC( dadr, dinc ); DEC( len );
  3300. END;
  3301. END DivideSLALLoop;
  3302. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3303. BEGIN
  3304. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3305. DivideSLALLoop );
  3306. RETURN RESULT
  3307. END "/";
  3308. (** REAL *)
  3309. PROCEDURE DivideARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3310. VAR lval, rval: REAL; dval: REAL;
  3311. BEGIN
  3312. SYSTEM.GET( radr, rval );
  3313. WHILE (len > 0) DO
  3314. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3315. INC( dadr, dinc ); DEC( len );
  3316. END;
  3317. END DivideARSRLoop;
  3318. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3319. BEGIN
  3320. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3321. DivideARSRLoop );
  3322. RETURN RESULT
  3323. END "/";
  3324. PROCEDURE DivideSRARLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3325. VAR lval, rval: REAL; dval: REAL;
  3326. BEGIN
  3327. SYSTEM.GET( radr, rval );
  3328. WHILE (len > 0) DO
  3329. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3330. INC( dadr, dinc ); DEC( len );
  3331. END;
  3332. END DivideSRARLoop;
  3333. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3334. BEGIN
  3335. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3336. DivideSRARLoop );
  3337. RETURN RESULT
  3338. END "/";
  3339. (** LONGREAL *)
  3340. PROCEDURE DivideAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3341. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3342. BEGIN
  3343. SYSTEM.GET( radr, rval );
  3344. WHILE (len > 0) DO
  3345. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3346. INC( dadr, dinc ); DEC( len );
  3347. END;
  3348. END DivideAXSXLoop;
  3349. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3350. BEGIN
  3351. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3352. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3353. RETURN RESULT
  3354. END "/";
  3355. PROCEDURE DivideSXAXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3356. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3357. BEGIN
  3358. SYSTEM.GET( radr, rval );
  3359. WHILE (len > 0) DO
  3360. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3361. INC( dadr, dinc ); DEC( len );
  3362. END;
  3363. END DivideSXAXLoop;
  3364. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3365. BEGIN
  3366. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3367. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3368. RETURN RESULT
  3369. END "/";
  3370. (** COMPLEX *)
  3371. PROCEDURE DivideAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3372. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3373. BEGIN
  3374. SYSTEM.GET( radr, rval );
  3375. WHILE (len > 0) DO
  3376. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3377. INC( dadr, dinc ); DEC( len );
  3378. END;
  3379. END DivideAZSZLoop;
  3380. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3381. BEGIN
  3382. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3383. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3384. RETURN RESULT
  3385. END "/";
  3386. PROCEDURE DivideSZAZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3387. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3388. BEGIN
  3389. SYSTEM.GET( radr, rval );
  3390. WHILE (len > 0) DO
  3391. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3392. INC( dadr, dinc ); DEC( len );
  3393. END;
  3394. END DivideSZAZLoop;
  3395. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3396. BEGIN
  3397. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3398. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3399. RETURN RESULT
  3400. END "/";
  3401. (** LONGCOMPLEX *)
  3402. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3403. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3404. BEGIN
  3405. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3406. IF rvalIm # 0.0D0 THEN
  3407. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3408. WHILE (len > 0) DO
  3409. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3410. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3411. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3412. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3413. INC( ladr, linc );
  3414. INC( dadr, dinc ); DEC( len );
  3415. END;
  3416. ELSE
  3417. WHILE (len > 0) DO
  3418. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3419. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3420. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3421. INC( ladr, linc );
  3422. INC( dadr, dinc ); DEC( len );
  3423. END;
  3424. END;
  3425. END DivideALZSLZLoop;
  3426. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3427. BEGIN
  3428. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3429. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3430. RETURN RESULT
  3431. END "/";
  3432. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3433. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3434. BEGIN
  3435. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3436. WHILE (len > 0) DO
  3437. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3438. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3439. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3440. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3441. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3442. INC( ladr, linc );
  3443. INC( dadr, dinc ); DEC( len );
  3444. END;
  3445. END DivideSLZALZLoop;
  3446. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3447. BEGIN
  3448. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3449. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3450. RETURN RESULT
  3451. END "/";
  3452. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3453. (** SHORTINT *)
  3454. PROCEDURE EDivASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3455. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3456. BEGIN
  3457. WHILE (len > 0) DO
  3458. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3459. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3460. DEC( len );
  3461. END;
  3462. END EDivASASLoop;
  3463. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3464. BEGIN
  3465. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3466. SIZEOF( SHORTINT ), EDivASASLoop );
  3467. RETURN RESULT
  3468. END "DIV";
  3469. (** INTEGER *)
  3470. PROCEDURE EDivAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3471. VAR lval, rval: INTEGER; dval: INTEGER;
  3472. BEGIN
  3473. WHILE (len > 0) DO
  3474. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3475. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3476. DEC( len );
  3477. END;
  3478. END EDivAIAILoop;
  3479. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3480. BEGIN
  3481. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3482. SIZEOF( INTEGER ), EDivAIAILoop );
  3483. RETURN RESULT
  3484. END "DIV";
  3485. (** LONGINT *)
  3486. PROCEDURE EDivALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3487. VAR lval, rval: LONGINT; dval: LONGINT;
  3488. BEGIN
  3489. WHILE (len > 0) DO
  3490. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3491. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3492. DEC( len );
  3493. END;
  3494. END EDivALALLoop;
  3495. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3496. BEGIN
  3497. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3498. SIZEOF( LONGINT ), EDivALALLoop );
  3499. RETURN RESULT
  3500. END "DIV";
  3501. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3502. (** SHORTINT *)
  3503. PROCEDURE DivASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3504. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3505. BEGIN
  3506. SYSTEM.GET( radr, rval );
  3507. WHILE (len > 0) DO
  3508. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3509. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3510. END;
  3511. END DivASSSLoop;
  3512. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3513. BEGIN
  3514. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3515. SIZEOF( SHORTINT ), DivASSSLoop );
  3516. RETURN RESULT
  3517. END "DIV";
  3518. PROCEDURE DivSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3519. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3520. BEGIN
  3521. SYSTEM.GET( radr, rval );
  3522. WHILE (len > 0) DO
  3523. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3524. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3525. END;
  3526. END DivSSASLoop;
  3527. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3528. BEGIN
  3529. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3530. SIZEOF( SHORTINT ), DivSSASLoop );
  3531. RETURN RESULT
  3532. END "DIV";
  3533. (** INTEGER *)
  3534. PROCEDURE DivAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3535. VAR lval, rval: INTEGER; dval: INTEGER;
  3536. BEGIN
  3537. SYSTEM.GET( radr, rval );
  3538. WHILE (len > 0) DO
  3539. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3540. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3541. END;
  3542. END DivAISILoop;
  3543. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3544. BEGIN
  3545. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3546. SIZEOF( INTEGER ), DivAISILoop );
  3547. RETURN RESULT
  3548. END "DIV";
  3549. PROCEDURE DivSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3550. VAR lval, rval: INTEGER; dval: INTEGER;
  3551. BEGIN
  3552. SYSTEM.GET( radr, rval );
  3553. WHILE (len > 0) DO
  3554. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3555. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3556. END;
  3557. END DivSIAILoop;
  3558. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3559. BEGIN
  3560. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3561. SIZEOF( INTEGER ), DivSIAILoop );
  3562. RETURN RESULT
  3563. END "DIV";
  3564. (** LONGINT *)
  3565. PROCEDURE DivALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3566. VAR lval, rval: LONGINT; dval: LONGINT;
  3567. BEGIN
  3568. SYSTEM.GET( radr, rval );
  3569. WHILE (len > 0) DO
  3570. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3571. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3572. END;
  3573. END DivALSLLoop;
  3574. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3575. BEGIN
  3576. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3577. SIZEOF( LONGINT ), DivALSLLoop );
  3578. RETURN RESULT
  3579. END "DIV";
  3580. PROCEDURE DivSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3581. VAR lval, rval: LONGINT; dval: LONGINT;
  3582. BEGIN
  3583. SYSTEM.GET( radr, rval );
  3584. WHILE (len > 0) DO
  3585. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3586. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3587. END;
  3588. END DivSLALLoop;
  3589. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3590. BEGIN
  3591. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3592. SIZEOF( LONGINT ), DivSLALLoop );
  3593. RETURN RESULT
  3594. END "DIV";
  3595. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3596. (** SHORTINT *)
  3597. PROCEDURE EModASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3598. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3599. BEGIN
  3600. WHILE (len > 0) DO
  3601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3602. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3603. DEC( len );
  3604. END;
  3605. END EModASASLoop;
  3606. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3607. BEGIN
  3608. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3609. SIZEOF( SHORTINT ), EModASASLoop );
  3610. RETURN RESULT
  3611. END "MOD";
  3612. (** INTEGER *)
  3613. PROCEDURE EModAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3614. VAR lval, rval: INTEGER; dval: INTEGER;
  3615. BEGIN
  3616. WHILE (len > 0) DO
  3617. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3618. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3619. DEC( len );
  3620. END;
  3621. END EModAIAILoop;
  3622. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3623. BEGIN
  3624. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3625. SIZEOF( INTEGER ), EModAIAILoop );
  3626. RETURN RESULT
  3627. END "MOD";
  3628. (** LONGINT *)
  3629. PROCEDURE EModALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3630. VAR lval, rval: LONGINT; dval: LONGINT;
  3631. BEGIN
  3632. WHILE (len > 0) DO
  3633. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3634. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3635. DEC( len );
  3636. END;
  3637. END EModALALLoop;
  3638. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3639. BEGIN
  3640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3641. SIZEOF( LONGINT ), EModALALLoop );
  3642. RETURN RESULT
  3643. END "MOD";
  3644. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3645. (** SHORTINT *)
  3646. PROCEDURE ModASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3647. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3648. BEGIN
  3649. SYSTEM.GET( radr, rval );
  3650. WHILE (len > 0) DO
  3651. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3652. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3653. END;
  3654. END ModASSSLoop;
  3655. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3656. BEGIN
  3657. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3658. SIZEOF( SHORTINT ), ModASSSLoop );
  3659. RETURN RESULT
  3660. END "MOD";
  3661. PROCEDURE ModSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3662. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3663. BEGIN
  3664. SYSTEM.GET( radr, rval );
  3665. WHILE (len > 0) DO
  3666. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3667. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3668. END;
  3669. END ModSSASLoop;
  3670. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3671. BEGIN
  3672. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3673. SIZEOF( SHORTINT ), ModSSASLoop );
  3674. RETURN RESULT
  3675. END "MOD";
  3676. (** INTEGER *)
  3677. PROCEDURE ModAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3678. VAR lval, rval: INTEGER; dval: INTEGER;
  3679. BEGIN
  3680. SYSTEM.GET( radr, rval );
  3681. WHILE (len > 0) DO
  3682. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3683. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3684. END;
  3685. END ModAISILoop;
  3686. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3687. BEGIN
  3688. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3689. SIZEOF( INTEGER ), ModAISILoop );
  3690. RETURN RESULT
  3691. END "MOD";
  3692. PROCEDURE ModSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3693. VAR lval, rval: INTEGER; dval: INTEGER;
  3694. BEGIN
  3695. SYSTEM.GET( radr, rval );
  3696. WHILE (len > 0) DO
  3697. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3698. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3699. END;
  3700. END ModSIAILoop;
  3701. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3702. BEGIN
  3703. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3704. SIZEOF( INTEGER ), ModSIAILoop );
  3705. RETURN RESULT
  3706. END "MOD";
  3707. (** LONGINT *)
  3708. PROCEDURE ModALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3709. VAR lval, rval: LONGINT; dval: LONGINT;
  3710. BEGIN
  3711. SYSTEM.GET( radr, rval );
  3712. WHILE (len > 0) DO
  3713. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3714. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3715. END;
  3716. END ModALSLLoop;
  3717. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3718. BEGIN
  3719. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3720. SIZEOF( LONGINT ), ModALSLLoop );
  3721. RETURN RESULT
  3722. END "MOD";
  3723. PROCEDURE ModSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3724. VAR lval, rval: LONGINT; dval: LONGINT;
  3725. BEGIN
  3726. SYSTEM.GET( radr, rval );
  3727. WHILE (len > 0) DO
  3728. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3729. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3730. END;
  3731. END ModSLALLoop;
  3732. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3733. BEGIN
  3734. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3735. SIZEOF( LONGINT ), ModSLALLoop );
  3736. RETURN RESULT
  3737. END "MOD";
  3738. (*** scalar product <array,array> -> scalar ********************************************************************)
  3739. (** SHORTINT *)
  3740. PROCEDURE SPASASLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3741. VAR lval, rval: SHORTINT; dval: LONGINT;
  3742. BEGIN
  3743. SYSTEM.GET( dadr, dval );
  3744. WHILE (len > 0) DO
  3745. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3746. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3747. END;
  3748. SYSTEM.PUT( dadr, dval );
  3749. END SPASASLoop;
  3750. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3751. VAR dest: LONGINT;
  3752. BEGIN
  3753. dest := 0;
  3754. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3755. RETURN dest;
  3756. END "+*";
  3757. (** INTEGER *)
  3758. PROCEDURE SPAIAILoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3759. VAR lval, rval: INTEGER; dval: LONGINT;
  3760. BEGIN
  3761. SYSTEM.GET( dadr, dval );
  3762. WHILE (len > 0) DO
  3763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3764. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3765. END;
  3766. SYSTEM.PUT( dadr, dval );
  3767. END SPAIAILoop;
  3768. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3769. VAR dest: LONGINT;
  3770. BEGIN
  3771. dest := 0;
  3772. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3773. RETURN dest;
  3774. END "+*";
  3775. (** LONGINT *)
  3776. PROCEDURE SPALALLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3777. VAR lval, rval: LONGINT; dval: LONGINT;
  3778. BEGIN
  3779. SYSTEM.GET( dadr, dval );
  3780. WHILE (len > 0) DO
  3781. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3782. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3783. END;
  3784. SYSTEM.PUT( dadr, dval );
  3785. END SPALALLoop;
  3786. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3787. VAR dest: LONGINT;
  3788. BEGIN
  3789. dest := 0;
  3790. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3791. RETURN dest;
  3792. END "+*";
  3793. (** REAL *)
  3794. PROCEDURE SPARARLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3795. VAR lval, rval: REAL; dval: REAL;
  3796. BEGIN
  3797. SYSTEM.GET( dadr, dval );
  3798. WHILE (len > 0) DO
  3799. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3800. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3801. END;
  3802. SYSTEM.PUT( dadr, dval );
  3803. END SPARARLoop;
  3804. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3805. VAR dest: REAL;
  3806. BEGIN
  3807. dest := 0;
  3808. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3809. RETURN dest;
  3810. END "+*";
  3811. PROCEDURE SPAXAXLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3812. VAR lval, rval, dval: LONGREAL;
  3813. BEGIN
  3814. IF debug THEN
  3815. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3816. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3817. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3818. END;
  3819. SYSTEM.GET( dadr, dval );
  3820. WHILE (len > 0) DO
  3821. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3822. dval := dval + rval * lval; DEC( len );
  3823. END;
  3824. SYSTEM.PUT( dadr, dval );
  3825. END SPAXAXLoop;
  3826. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3827. VAR dest: LONGREAL;
  3828. BEGIN
  3829. dest := 0;
  3830. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3831. RETURN dest;
  3832. END "+*";
  3833. (** COMPLEX *)
  3834. PROCEDURE SPAZAZLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3835. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3836. BEGIN
  3837. SYSTEM.GET( dadr, dval );
  3838. WHILE (len > 0) DO
  3839. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3840. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3841. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3842. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3843. END;
  3844. SYSTEM.PUT( dadr, dval );
  3845. END SPAZAZLoop;
  3846. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3847. VAR dest: COMPLEX;
  3848. BEGIN
  3849. dest := 0;
  3850. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3851. RETURN dest;
  3852. END "+*";
  3853. (** COMPLEX *)
  3854. PROCEDURE SPALZALZLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3855. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3856. BEGIN
  3857. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3858. WHILE (len > 0) DO
  3859. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3860. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3861. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3862. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3863. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3864. END;
  3865. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3866. END SPALZALZLoop;
  3867. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3868. VAR dest: LONGCOMPLEX;
  3869. BEGIN
  3870. dest := 0;
  3871. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3872. RETURN dest;
  3873. END "+*";
  3874. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3875. (** BOOLEAN *)
  3876. PROCEDURE EEqlABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3877. VAR lval, rval: BOOLEAN;
  3878. BEGIN
  3879. WHILE (len > 0) DO
  3880. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3881. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3882. END;
  3883. END EEqlABABLoop;
  3884. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3885. BEGIN
  3886. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3887. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3888. RETURN RESULT
  3889. END ".=";
  3890. (** SHORTINT *)
  3891. PROCEDURE EEqlASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3892. VAR lval, rval: SHORTINT;
  3893. BEGIN
  3894. WHILE (len > 0) DO
  3895. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3896. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3897. END;
  3898. END EEqlASASLoop;
  3899. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3900. BEGIN
  3901. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3902. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3903. RETURN RESULT
  3904. END ".=";
  3905. (** INTEGER *)
  3906. PROCEDURE EEqlAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3907. VAR lval, rval: INTEGER;
  3908. BEGIN
  3909. WHILE (len > 0) DO
  3910. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3911. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3912. END;
  3913. END EEqlAIAILoop;
  3914. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3915. BEGIN
  3916. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3917. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3918. RETURN RESULT
  3919. END ".=";
  3920. (** LONGINT *)
  3921. PROCEDURE EEqlALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3922. VAR lval, rval: LONGINT;
  3923. BEGIN
  3924. WHILE (len > 0) DO
  3925. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3926. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3927. END;
  3928. END EEqlALALLoop;
  3929. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3930. BEGIN
  3931. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3932. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3933. RETURN RESULT
  3934. END ".=";
  3935. (** REAL *)
  3936. PROCEDURE EEqlARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3937. VAR lval, rval: REAL;
  3938. BEGIN
  3939. WHILE (len > 0) DO
  3940. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3941. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3942. END;
  3943. END EEqlARARLoop;
  3944. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3945. BEGIN
  3946. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3947. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3948. RETURN RESULT
  3949. END ".=";
  3950. (** LONGREAL *)
  3951. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3952. VAR lval, rval: LONGREAL;
  3953. BEGIN
  3954. WHILE (len > 0) DO
  3955. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3956. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3957. END;
  3958. END EEqlAXAXLoop;
  3959. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3960. BEGIN
  3961. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3962. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3963. RETURN RESULT
  3964. END ".=";
  3965. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3966. (** BOOLEAN *)
  3967. PROCEDURE EEqlABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3968. VAR lval, rval: BOOLEAN;
  3969. BEGIN
  3970. SYSTEM.GET( radr, rval );
  3971. WHILE (len > 0) DO
  3972. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3973. INC( dadr, dinc ); DEC( len );
  3974. END;
  3975. END EEqlABSBLoop;
  3976. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3977. BEGIN
  3978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3979. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3980. RETURN RESULT
  3981. END ".=";
  3982. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3983. BEGIN
  3984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3985. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3986. RETURN RESULT
  3987. END ".=";
  3988. (** SHORTINT *)
  3989. PROCEDURE EEqlASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3990. VAR lval, rval: SHORTINT;
  3991. BEGIN
  3992. SYSTEM.GET( radr, rval );
  3993. WHILE (len > 0) DO
  3994. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3995. INC( dadr, dinc ); DEC( len );
  3996. END;
  3997. END EEqlASSSLoop;
  3998. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3999. BEGIN
  4000. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4001. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4002. RETURN RESULT
  4003. END ".=";
  4004. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4005. BEGIN
  4006. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4007. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4008. RETURN RESULT
  4009. END ".=";
  4010. (** INTEGER *)
  4011. PROCEDURE EEqlAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4012. VAR lval, rval: INTEGER;
  4013. BEGIN
  4014. SYSTEM.GET( radr, rval );
  4015. WHILE (len > 0) DO
  4016. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4017. INC( dadr, dinc ); DEC( len );
  4018. END;
  4019. END EEqlAISILoop;
  4020. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4021. BEGIN
  4022. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4023. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4024. RETURN RESULT
  4025. END ".=";
  4026. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4027. BEGIN
  4028. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4029. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4030. RETURN RESULT
  4031. END ".=";
  4032. (** LONGINT *)
  4033. PROCEDURE EEqlALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4034. VAR lval, rval: LONGINT;
  4035. BEGIN
  4036. SYSTEM.GET( radr, rval );
  4037. WHILE (len > 0) DO
  4038. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4039. INC( dadr, dinc ); DEC( len );
  4040. END;
  4041. END EEqlALSLLoop;
  4042. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4043. BEGIN
  4044. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4045. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4046. RETURN RESULT
  4047. END ".=";
  4048. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4049. BEGIN
  4050. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4051. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4052. RETURN RESULT
  4053. END ".=";
  4054. (** REAL *)
  4055. PROCEDURE EEqlARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4056. VAR lval, rval: REAL;
  4057. BEGIN
  4058. SYSTEM.GET( radr, rval );
  4059. WHILE (len > 0) DO
  4060. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4061. INC( dadr, dinc ); DEC( len );
  4062. END;
  4063. END EEqlARSRLoop;
  4064. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4065. BEGIN
  4066. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4067. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4068. RETURN RESULT
  4069. END ".=";
  4070. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4071. BEGIN
  4072. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4073. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4074. RETURN RESULT
  4075. END ".=";
  4076. (** LONGREAL *)
  4077. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4078. VAR lval, rval: LONGREAL;
  4079. BEGIN
  4080. SYSTEM.GET( radr, rval );
  4081. WHILE (len > 0) DO
  4082. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4083. INC( dadr, dinc ); DEC( len );
  4084. END;
  4085. END EEqlAXSXLoop;
  4086. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4087. BEGIN
  4088. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4089. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4090. RETURN RESULT
  4091. END ".=";
  4092. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4093. BEGIN
  4094. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4095. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4096. RETURN RESULT
  4097. END ".=";
  4098. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4099. (** BOOLEAN *)
  4100. PROCEDURE ENeqABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4101. VAR lval, rval: BOOLEAN;
  4102. BEGIN
  4103. WHILE (len > 0) DO
  4104. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4105. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4106. END;
  4107. END ENeqABABLoop;
  4108. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4109. BEGIN
  4110. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4111. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4112. RETURN RESULT
  4113. END ".#";
  4114. (** SHORTINT *)
  4115. PROCEDURE ENeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4116. VAR lval, rval: SHORTINT;
  4117. BEGIN
  4118. WHILE (len > 0) DO
  4119. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4120. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4121. END;
  4122. END ENeqASASLoop;
  4123. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4124. BEGIN
  4125. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4126. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4127. RETURN RESULT
  4128. END ".#";
  4129. (** INTEGER*)
  4130. PROCEDURE ENeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4131. VAR lval, rval: INTEGER;
  4132. BEGIN
  4133. WHILE (len > 0) DO
  4134. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4135. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4136. END;
  4137. END ENeqAIAILoop;
  4138. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4139. BEGIN
  4140. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4141. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4142. RETURN RESULT
  4143. END ".#";
  4144. (** LONGINT*)
  4145. PROCEDURE ENeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4146. VAR lval, rval: LONGINT;
  4147. BEGIN
  4148. WHILE (len > 0) DO
  4149. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4150. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4151. END;
  4152. END ENeqALALLoop;
  4153. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4154. BEGIN
  4155. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4156. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4157. RETURN RESULT
  4158. END ".#";
  4159. (** REAL *)
  4160. PROCEDURE ENeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4161. VAR lval, rval: REAL;
  4162. BEGIN
  4163. WHILE (len > 0) DO
  4164. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4165. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4166. END;
  4167. END ENeqARARLoop;
  4168. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4169. BEGIN
  4170. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4171. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4172. RETURN RESULT
  4173. END ".#";
  4174. (** LONGREAL *)
  4175. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4176. VAR lval, rval: LONGREAL;
  4177. BEGIN
  4178. WHILE (len > 0) DO
  4179. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4180. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4181. END;
  4182. END ENeqAXAXLoop;
  4183. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4184. BEGIN
  4185. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4186. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4187. RETURN RESULT
  4188. END ".#";
  4189. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4190. (** BOOLEAN *)
  4191. PROCEDURE ENeqABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4192. VAR lval, rval: BOOLEAN;
  4193. BEGIN
  4194. SYSTEM.GET( radr, rval );
  4195. WHILE (len > 0) DO
  4196. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4197. INC( dadr, dinc ); DEC( len );
  4198. END;
  4199. END ENeqABSBLoop;
  4200. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4201. BEGIN
  4202. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4203. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4204. RETURN RESULT
  4205. END ".#";
  4206. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4207. BEGIN
  4208. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4209. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4210. RETURN RESULT
  4211. END ".#";
  4212. (** SHORTINT *)
  4213. PROCEDURE ENeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4214. VAR lval, rval: SHORTINT;
  4215. BEGIN
  4216. SYSTEM.GET( radr, rval );
  4217. WHILE (len > 0) DO
  4218. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4219. INC( dadr, dinc ); DEC( len );
  4220. END;
  4221. END ENeqASSSLoop;
  4222. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4223. BEGIN
  4224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4225. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4226. RETURN RESULT
  4227. END ".#";
  4228. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4229. BEGIN
  4230. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4231. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4232. RETURN RESULT
  4233. END ".#";
  4234. (** INTEGER *)
  4235. PROCEDURE ENeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4236. VAR lval, rval: INTEGER;
  4237. BEGIN
  4238. SYSTEM.GET( radr, rval );
  4239. WHILE (len > 0) DO
  4240. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4241. INC( dadr, dinc ); DEC( len );
  4242. END;
  4243. END ENeqAISILoop;
  4244. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4245. BEGIN
  4246. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4247. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4248. RETURN RESULT
  4249. END ".#";
  4250. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4251. BEGIN
  4252. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4253. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4254. RETURN RESULT
  4255. END ".#";
  4256. (** LONGINT *)
  4257. PROCEDURE ENeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4258. VAR lval, rval: LONGINT;
  4259. BEGIN
  4260. SYSTEM.GET( radr, rval );
  4261. WHILE (len > 0) DO
  4262. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4263. INC( dadr, dinc ); DEC( len );
  4264. END;
  4265. END ENeqALSLLoop;
  4266. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4267. BEGIN
  4268. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4269. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4270. RETURN RESULT
  4271. END ".#";
  4272. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4273. BEGIN
  4274. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4275. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4276. RETURN RESULT
  4277. END ".#";
  4278. (** REAL *)
  4279. PROCEDURE ENeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4280. VAR lval, rval: REAL;
  4281. BEGIN
  4282. SYSTEM.GET( radr, rval );
  4283. WHILE (len > 0) DO
  4284. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4285. INC( dadr, dinc ); DEC( len );
  4286. END;
  4287. END ENeqARSRLoop;
  4288. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4289. BEGIN
  4290. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4291. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4292. RETURN RESULT
  4293. END ".#";
  4294. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4295. BEGIN
  4296. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4297. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4298. RETURN RESULT
  4299. END ".#";
  4300. (** LONGREAL *)
  4301. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4302. VAR lval, rval: LONGREAL;
  4303. BEGIN
  4304. SYSTEM.GET( radr, rval );
  4305. WHILE (len > 0) DO
  4306. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4307. INC( dadr, dinc ); DEC( len );
  4308. END;
  4309. END ENeqAXSXLoop;
  4310. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4311. BEGIN
  4312. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4313. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4314. RETURN RESULT
  4315. END ".#";
  4316. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4317. BEGIN
  4318. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4319. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4320. RETURN RESULT
  4321. END ".#";
  4322. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4323. (** SHORTINT *)
  4324. PROCEDURE EGtrASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4325. VAR lval, rval: SHORTINT;
  4326. BEGIN
  4327. WHILE (len > 0) DO
  4328. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4329. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4330. END;
  4331. END EGtrASASLoop;
  4332. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4333. BEGIN
  4334. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4335. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4336. RETURN RESULT
  4337. END ".>";
  4338. (** INTEGER *)
  4339. PROCEDURE EGtrAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4340. VAR lval, rval: INTEGER;
  4341. BEGIN
  4342. WHILE (len > 0) DO
  4343. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4344. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4345. END;
  4346. END EGtrAIAILoop;
  4347. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4348. BEGIN
  4349. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4350. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4351. RETURN RESULT
  4352. END ".>";
  4353. (** LONGINT *)
  4354. PROCEDURE EGtrALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4355. VAR lval, rval: LONGINT;
  4356. BEGIN
  4357. WHILE (len > 0) DO
  4358. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4359. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4360. END;
  4361. END EGtrALALLoop;
  4362. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4363. BEGIN
  4364. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4365. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4366. RETURN RESULT
  4367. END ".>";
  4368. (** REAL *)
  4369. PROCEDURE EGtrARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4370. VAR lval, rval: REAL;
  4371. BEGIN
  4372. WHILE (len > 0) DO
  4373. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4374. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4375. END;
  4376. END EGtrARARLoop;
  4377. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4378. BEGIN
  4379. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4380. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4381. RETURN RESULT
  4382. END ".>";
  4383. (** LONGREAL *)
  4384. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4385. VAR lval, rval: LONGREAL;
  4386. BEGIN
  4387. WHILE (len > 0) DO
  4388. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4389. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4390. END;
  4391. END EGtrAXAXLoop;
  4392. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4393. BEGIN
  4394. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4395. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4396. RETURN RESULT
  4397. END ".>";
  4398. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4399. (** SHORTINT *)
  4400. PROCEDURE EGtrASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4401. VAR lval, rval: SHORTINT;
  4402. BEGIN
  4403. SYSTEM.GET( radr, rval );
  4404. WHILE (len > 0) DO
  4405. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4406. INC( dadr, dinc ); DEC( len );
  4407. END;
  4408. END EGtrASSSLoop;
  4409. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4410. BEGIN
  4411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4412. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4413. RETURN RESULT
  4414. END ".>";
  4415. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4416. BEGIN
  4417. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4418. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4419. RETURN RESULT
  4420. END ".<";
  4421. (** INTEGER *)
  4422. PROCEDURE EGtrAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4423. VAR lval, rval: INTEGER;
  4424. BEGIN
  4425. SYSTEM.GET( radr, rval );
  4426. WHILE (len > 0) DO
  4427. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4428. INC( dadr, dinc ); DEC( len );
  4429. END;
  4430. END EGtrAISILoop;
  4431. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4432. BEGIN
  4433. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4434. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4435. RETURN RESULT
  4436. END ".>";
  4437. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4438. BEGIN
  4439. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4440. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4441. RETURN RESULT
  4442. END ".<";
  4443. (** LONGINT *)
  4444. PROCEDURE EGtrALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4445. VAR lval, rval: LONGINT;
  4446. BEGIN
  4447. SYSTEM.GET( radr, rval );
  4448. WHILE (len > 0) DO
  4449. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4450. INC( dadr, dinc ); DEC( len );
  4451. END;
  4452. END EGtrALSLLoop;
  4453. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4454. BEGIN
  4455. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4456. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4457. RETURN RESULT
  4458. END ".>";
  4459. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4460. BEGIN
  4461. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4462. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4463. RETURN RESULT
  4464. END ".<";
  4465. (** REAL *)
  4466. PROCEDURE EGtrARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4467. VAR lval, rval: REAL;
  4468. BEGIN
  4469. SYSTEM.GET( radr, rval );
  4470. WHILE (len > 0) DO
  4471. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4472. INC( dadr, dinc ); DEC( len );
  4473. END;
  4474. END EGtrARSRLoop;
  4475. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4476. BEGIN
  4477. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4478. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4479. RETURN RESULT
  4480. END ".>";
  4481. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4482. BEGIN
  4483. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4484. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4485. RETURN RESULT
  4486. END ".<";
  4487. (** LONGREAL *)
  4488. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4489. VAR lval, rval: LONGREAL;
  4490. BEGIN
  4491. SYSTEM.GET( radr, rval );
  4492. WHILE (len > 0) DO
  4493. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4494. INC( dadr, dinc ); DEC( len );
  4495. END;
  4496. END EGtrAXSXLoop;
  4497. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4498. BEGIN
  4499. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4500. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4501. RETURN RESULT
  4502. END ".>";
  4503. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4504. BEGIN
  4505. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4506. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4507. RETURN RESULT
  4508. END ".<";
  4509. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4510. (** SHORTINT *)
  4511. PROCEDURE EGeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4512. VAR lval, rval: SHORTINT;
  4513. BEGIN
  4514. WHILE (len > 0) DO
  4515. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4516. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4517. END;
  4518. END EGeqASASLoop;
  4519. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4520. BEGIN
  4521. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4522. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4523. RETURN RESULT
  4524. END ".>=";
  4525. (** INTEGER *)
  4526. PROCEDURE EGeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4527. VAR lval, rval: INTEGER;
  4528. BEGIN
  4529. WHILE (len > 0) DO
  4530. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4531. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4532. END;
  4533. END EGeqAIAILoop;
  4534. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4535. BEGIN
  4536. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4537. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4538. RETURN RESULT
  4539. END ".>=";
  4540. (** LONGINT *)
  4541. PROCEDURE EGeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4542. VAR lval, rval: LONGINT;
  4543. BEGIN
  4544. WHILE (len > 0) DO
  4545. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4546. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4547. END;
  4548. END EGeqALALLoop;
  4549. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4550. BEGIN
  4551. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4552. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4553. RETURN RESULT
  4554. END ".>=";
  4555. (** REAL *)
  4556. PROCEDURE EGeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4557. VAR lval, rval: REAL;
  4558. BEGIN
  4559. WHILE (len > 0) DO
  4560. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4561. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4562. END;
  4563. END EGeqARARLoop;
  4564. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4565. BEGIN
  4566. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4567. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4568. RETURN RESULT
  4569. END ".>=";
  4570. (** LONGREAL *)
  4571. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4572. VAR lval, rval: LONGREAL;
  4573. BEGIN
  4574. WHILE (len > 0) DO
  4575. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4576. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4577. END;
  4578. END EGeqAXAXLoop;
  4579. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4580. BEGIN
  4581. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4582. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4583. RETURN RESULT
  4584. END ".>=";
  4585. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4586. (** SHORTINT *)
  4587. PROCEDURE EGeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4588. VAR lval, rval: SHORTINT;
  4589. BEGIN
  4590. SYSTEM.GET( radr, rval );
  4591. WHILE (len > 0) DO
  4592. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4593. INC( dadr, dinc ); DEC( len );
  4594. END;
  4595. END EGeqASSSLoop;
  4596. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4597. BEGIN
  4598. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4599. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4600. RETURN RESULT
  4601. END ".>=";
  4602. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4603. BEGIN
  4604. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4605. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4606. RETURN RESULT
  4607. END ".<=";
  4608. (** INTEGER *)
  4609. PROCEDURE EGeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4610. VAR lval, rval: INTEGER;
  4611. BEGIN
  4612. SYSTEM.GET( radr, rval );
  4613. WHILE (len > 0) DO
  4614. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4615. INC( dadr, dinc ); DEC( len );
  4616. END;
  4617. END EGeqAISILoop;
  4618. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4619. BEGIN
  4620. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4621. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4622. RETURN RESULT
  4623. END ".>=";
  4624. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4625. BEGIN
  4626. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4627. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4628. RETURN RESULT
  4629. END ".<=";
  4630. (** LONGINT *)
  4631. PROCEDURE EGeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4632. VAR lval, rval: LONGINT;
  4633. BEGIN
  4634. SYSTEM.GET( radr, rval );
  4635. WHILE (len > 0) DO
  4636. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4637. INC( dadr, dinc ); DEC( len );
  4638. END;
  4639. END EGeqALSLLoop;
  4640. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4641. BEGIN
  4642. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4643. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4644. RETURN RESULT
  4645. END ".>=";
  4646. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4647. BEGIN
  4648. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4649. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4650. RETURN RESULT
  4651. END ".<=";
  4652. (** REAL *)
  4653. PROCEDURE EGeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4654. VAR lval, rval: REAL;
  4655. BEGIN
  4656. SYSTEM.GET( radr, rval );
  4657. WHILE (len > 0) DO
  4658. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4659. INC( dadr, dinc ); DEC( len );
  4660. END;
  4661. END EGeqARSRLoop;
  4662. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4663. BEGIN
  4664. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4665. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4666. RETURN RESULT
  4667. END ".>=";
  4668. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4669. BEGIN
  4670. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4671. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4672. RETURN RESULT
  4673. END ".<=";
  4674. (** LONGREAL *)
  4675. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4676. VAR lval, rval: LONGREAL;
  4677. BEGIN
  4678. SYSTEM.GET( radr, rval );
  4679. WHILE (len > 0) DO
  4680. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4681. INC( dadr, dinc ); DEC( len );
  4682. END;
  4683. END EGeqAXSXLoop;
  4684. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4685. BEGIN
  4686. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4687. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4688. RETURN RESULT
  4689. END ".>=";
  4690. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4691. BEGIN
  4692. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4693. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4694. RETURN RESULT
  4695. END ".<=";
  4696. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4697. (** SHORTINT *)
  4698. PROCEDURE ELssASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4699. VAR lval, rval: SHORTINT;
  4700. BEGIN
  4701. WHILE (len > 0) DO
  4702. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4703. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4704. END;
  4705. END ELssASASLoop;
  4706. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4707. BEGIN
  4708. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4709. SIZEOF( BOOLEAN ), ELssASASLoop );
  4710. RETURN RESULT
  4711. END ".<";
  4712. (** INTEGER *)
  4713. PROCEDURE ELssAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4714. VAR lval, rval: INTEGER;
  4715. BEGIN
  4716. WHILE (len > 0) DO
  4717. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4718. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4719. END;
  4720. END ELssAIAILoop;
  4721. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4722. BEGIN
  4723. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4724. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4725. RETURN RESULT
  4726. END ".<";
  4727. (** LONGINT*)
  4728. PROCEDURE ELssALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4729. VAR lval, rval: LONGINT;
  4730. BEGIN
  4731. WHILE (len > 0) DO
  4732. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4733. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4734. END;
  4735. END ELssALALLoop;
  4736. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4737. BEGIN
  4738. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4739. SIZEOF( BOOLEAN ), ELssALALLoop );
  4740. RETURN RESULT
  4741. END ".<";
  4742. (** REAL *)
  4743. PROCEDURE ELssARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4744. VAR lval, rval: REAL;
  4745. BEGIN
  4746. WHILE (len > 0) DO
  4747. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4748. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4749. END;
  4750. END ELssARARLoop;
  4751. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4752. BEGIN
  4753. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4754. SIZEOF( BOOLEAN ), ELssARARLoop );
  4755. RETURN RESULT
  4756. END ".<";
  4757. (** LONGREAL *)
  4758. PROCEDURE ELssAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4759. VAR lval, rval: LONGREAL;
  4760. BEGIN
  4761. WHILE (len > 0) DO
  4762. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4763. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4764. END;
  4765. END ELssAXAXLoop;
  4766. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4767. BEGIN
  4768. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4769. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4770. RETURN RESULT
  4771. END ".<";
  4772. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4773. (** SHORTINT *)
  4774. PROCEDURE ELssASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4775. VAR lval, rval: SHORTINT;
  4776. BEGIN
  4777. SYSTEM.GET( radr, rval );
  4778. WHILE (len > 0) DO
  4779. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4780. INC( dadr, dinc ); DEC( len );
  4781. END;
  4782. END ELssASSSLoop;
  4783. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4784. BEGIN
  4785. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4786. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4787. RETURN RESULT
  4788. END ".<";
  4789. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4790. BEGIN
  4791. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4792. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4793. RETURN RESULT
  4794. END ".>";
  4795. (** INTEGER *)
  4796. PROCEDURE ELssAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4797. VAR lval, rval: INTEGER;
  4798. BEGIN
  4799. SYSTEM.GET( radr, rval );
  4800. WHILE (len > 0) DO
  4801. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4802. INC( dadr, dinc ); DEC( len );
  4803. END;
  4804. END ELssAISILoop;
  4805. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4806. BEGIN
  4807. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4808. SIZEOF( BOOLEAN ), ELssAISILoop );
  4809. RETURN RESULT
  4810. END ".<";
  4811. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4812. BEGIN
  4813. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4814. SIZEOF( BOOLEAN ), ELssAISILoop );
  4815. RETURN RESULT
  4816. END ".>";
  4817. (** LONGINT *)
  4818. PROCEDURE ELssALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4819. VAR lval, rval: LONGINT;
  4820. BEGIN
  4821. SYSTEM.GET( radr, rval );
  4822. WHILE (len > 0) DO
  4823. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4824. INC( dadr, dinc ); DEC( len );
  4825. END;
  4826. END ELssALSLLoop;
  4827. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4828. BEGIN
  4829. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4830. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4831. RETURN RESULT
  4832. END ".<";
  4833. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4834. BEGIN
  4835. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4836. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4837. RETURN RESULT
  4838. END ".>";
  4839. (** REAL *)
  4840. PROCEDURE ELssARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4841. VAR lval, rval: REAL;
  4842. BEGIN
  4843. SYSTEM.GET( radr, rval );
  4844. WHILE (len > 0) DO
  4845. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4846. INC( dadr, dinc ); DEC( len );
  4847. END;
  4848. END ELssARSRLoop;
  4849. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4850. BEGIN
  4851. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4852. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4853. RETURN RESULT
  4854. END ".<";
  4855. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4856. BEGIN
  4857. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4858. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4859. RETURN RESULT
  4860. END ".>";
  4861. (** LONGREAL *)
  4862. PROCEDURE ELssAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4863. VAR lval, rval: LONGREAL;
  4864. BEGIN
  4865. SYSTEM.GET( radr, rval );
  4866. WHILE (len > 0) DO
  4867. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4868. INC( dadr, dinc ); DEC( len );
  4869. END;
  4870. END ELssAXSXLoop;
  4871. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4872. BEGIN
  4873. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4874. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4875. RETURN RESULT
  4876. END ".<";
  4877. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4878. BEGIN
  4879. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4880. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4881. RETURN RESULT
  4882. END ".>";
  4883. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4884. (** SHORTINT *)
  4885. PROCEDURE ELeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4886. VAR lval, rval: SHORTINT;
  4887. BEGIN
  4888. WHILE (len > 0) DO
  4889. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4890. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4891. END;
  4892. END ELeqASASLoop;
  4893. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4894. BEGIN
  4895. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4896. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4897. RETURN RESULT
  4898. END ".<=";
  4899. (** INTEGER *)
  4900. PROCEDURE ELeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4901. VAR lval, rval: INTEGER;
  4902. BEGIN
  4903. WHILE (len > 0) DO
  4904. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4905. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4906. END;
  4907. END ELeqAIAILoop;
  4908. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4909. BEGIN
  4910. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4911. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4912. RETURN RESULT
  4913. END ".<=";
  4914. (** LONGINT *)
  4915. PROCEDURE ELeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4916. VAR lval, rval: LONGINT;
  4917. BEGIN
  4918. WHILE (len > 0) DO
  4919. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4920. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4921. END;
  4922. END ELeqALALLoop;
  4923. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4924. BEGIN
  4925. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4926. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4927. RETURN RESULT
  4928. END ".<=";
  4929. (** REAL *)
  4930. PROCEDURE ELeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4931. VAR lval, rval: REAL;
  4932. BEGIN
  4933. WHILE (len > 0) DO
  4934. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4935. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4936. END;
  4937. END ELeqARARLoop;
  4938. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4939. BEGIN
  4940. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4941. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4942. RETURN RESULT
  4943. END ".<=";
  4944. (** LONGREAL*)
  4945. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4946. VAR lval, rval: LONGREAL;
  4947. BEGIN
  4948. WHILE (len > 0) DO
  4949. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4950. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4951. END;
  4952. END ELeqAXAXLoop;
  4953. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4954. BEGIN
  4955. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4956. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4957. RETURN RESULT
  4958. END ".<=";
  4959. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4960. (** SHORTINT *)
  4961. PROCEDURE ELeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4962. VAR lval, rval: SHORTINT;
  4963. BEGIN
  4964. SYSTEM.GET( radr, rval );
  4965. WHILE (len > 0) DO
  4966. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4967. INC( dadr, dinc ); DEC( len );
  4968. END;
  4969. END ELeqASSSLoop;
  4970. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4971. BEGIN
  4972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4973. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4974. RETURN RESULT
  4975. END ".<=";
  4976. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4977. BEGIN
  4978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4979. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4980. RETURN RESULT
  4981. END ".>=";
  4982. (** INTEGER *)
  4983. PROCEDURE ELeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4984. VAR lval, rval: INTEGER;
  4985. BEGIN
  4986. SYSTEM.GET( radr, rval );
  4987. WHILE (len > 0) DO
  4988. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4989. INC( dadr, dinc ); DEC( len );
  4990. END;
  4991. END ELeqAISILoop;
  4992. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4993. BEGIN
  4994. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4995. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4996. RETURN RESULT
  4997. END ".<=";
  4998. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4999. BEGIN
  5000. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5001. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5002. RETURN RESULT
  5003. END ".>=";
  5004. (** LONGINT *)
  5005. PROCEDURE ELeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5006. VAR lval, rval: LONGINT;
  5007. BEGIN
  5008. SYSTEM.GET( radr, rval );
  5009. WHILE (len > 0) DO
  5010. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5011. INC( dadr, dinc ); DEC( len );
  5012. END;
  5013. END ELeqALSLLoop;
  5014. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5015. BEGIN
  5016. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5017. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5018. RETURN RESULT
  5019. END ".<=";
  5020. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5021. BEGIN
  5022. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5023. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5024. RETURN RESULT
  5025. END ".>=";
  5026. (** REAL *)
  5027. PROCEDURE ELeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5028. VAR lval, rval: REAL;
  5029. BEGIN
  5030. SYSTEM.GET( radr, rval );
  5031. WHILE (len > 0) DO
  5032. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5033. INC( dadr, dinc ); DEC( len );
  5034. END;
  5035. END ELeqARSRLoop;
  5036. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5037. BEGIN
  5038. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5039. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5040. RETURN RESULT
  5041. END ".<=";
  5042. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5043. BEGIN
  5044. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5045. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5046. RETURN RESULT
  5047. END ".>=";
  5048. (** LONGREAL *)
  5049. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5050. VAR lval, rval: LONGREAL;
  5051. BEGIN
  5052. SYSTEM.GET( radr, rval );
  5053. WHILE (len > 0) DO
  5054. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5055. INC( dadr, dinc ); DEC( len );
  5056. END;
  5057. END ELeqAXSXLoop;
  5058. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5059. BEGIN
  5060. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5061. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5062. RETURN RESULT
  5063. END ".<=";
  5064. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5065. BEGIN
  5066. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5067. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5068. RETURN RESULT
  5069. END ".>=";
  5070. (*** elementwise or, elementwise and ********************************************************************)
  5071. (** array x array *)
  5072. PROCEDURE ElOrABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  5073. VAR lval, rval: BOOLEAN;
  5074. BEGIN
  5075. WHILE (len > 0) DO
  5076. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5077. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5078. END;
  5079. END ElOrABABLoop;
  5080. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5081. BEGIN
  5082. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5083. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5084. RETURN RESULT
  5085. END "OR";
  5086. PROCEDURE ElAndABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  5087. VAR lval, rval: BOOLEAN;
  5088. BEGIN
  5089. WHILE (len > 0) DO
  5090. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5091. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5092. END;
  5093. END ElAndABABLoop;
  5094. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5095. BEGIN
  5096. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5097. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5098. RETURN RESULT
  5099. END "&";
  5100. (** array x boolean *)
  5101. PROCEDURE ElOrABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5102. VAR lval, rval: BOOLEAN;
  5103. BEGIN
  5104. SYSTEM.GET( radr, rval );
  5105. WHILE (len > 0) DO
  5106. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5107. INC( dadr, dinc ); DEC( len );
  5108. END;
  5109. END ElOrABSBLoop;
  5110. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5111. BEGIN
  5112. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5113. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5114. RETURN RESULT
  5115. END "OR";
  5116. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5117. BEGIN
  5118. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5119. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5120. RETURN RESULT
  5121. END "OR";
  5122. PROCEDURE ElAndABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5123. VAR lval, rval: BOOLEAN;
  5124. BEGIN
  5125. SYSTEM.GET( radr, rval );
  5126. WHILE (len > 0) DO
  5127. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5128. INC( dadr, dinc ); DEC( len );
  5129. END;
  5130. END ElAndABSBLoop;
  5131. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5132. BEGIN
  5133. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5134. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5135. RETURN RESULT
  5136. END "&";
  5137. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5138. BEGIN
  5139. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5140. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5141. RETURN RESULT
  5142. END "&";
  5143. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5144. (** SHORTINT *)
  5145. PROCEDURE LssASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5146. VAR lval, rval: SHORTINT;
  5147. BEGIN
  5148. WHILE (len > 0) DO
  5149. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5150. IF rval <= lval THEN RETURN FALSE END;
  5151. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5152. END;
  5153. RETURN TRUE;
  5154. END LssASASLoop;
  5155. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5156. BEGIN
  5157. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5158. END "<";
  5159. PROCEDURE GeqASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5160. VAR lval, rval: SHORTINT;
  5161. BEGIN
  5162. WHILE (len > 0) DO
  5163. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5164. IF rval > lval THEN RETURN FALSE END;
  5165. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5166. END;
  5167. RETURN TRUE;
  5168. END GeqASASLoop;
  5169. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5170. BEGIN
  5171. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5172. END ">=";
  5173. (** INTEGER *)
  5174. PROCEDURE LssAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5175. VAR lval, rval: INTEGER;
  5176. BEGIN
  5177. WHILE (len > 0) DO
  5178. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5179. IF rval <= lval THEN RETURN FALSE END;
  5180. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5181. END;
  5182. RETURN TRUE;
  5183. END LssAIAILoop;
  5184. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5185. BEGIN
  5186. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5187. END "<";
  5188. PROCEDURE GeqAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5189. VAR lval, rval: INTEGER;
  5190. BEGIN
  5191. WHILE (len > 0) DO
  5192. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5193. IF rval > lval THEN RETURN FALSE END;
  5194. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5195. END;
  5196. RETURN TRUE;
  5197. END GeqAIAILoop;
  5198. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5199. BEGIN
  5200. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5201. END ">=";
  5202. (** LONGINT *)
  5203. PROCEDURE LssALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5204. VAR lval, rval: LONGINT;
  5205. BEGIN
  5206. WHILE (len > 0) DO
  5207. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5208. IF rval <= lval THEN RETURN FALSE END;
  5209. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5210. END;
  5211. RETURN TRUE;
  5212. END LssALALLoop;
  5213. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5214. BEGIN
  5215. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5216. END "<";
  5217. PROCEDURE GeqALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5218. VAR lval, rval: LONGINT;
  5219. BEGIN
  5220. WHILE (len > 0) DO
  5221. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5222. IF rval > lval THEN RETURN FALSE END;
  5223. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5224. END;
  5225. RETURN TRUE;
  5226. END GeqALALLoop;
  5227. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5228. BEGIN
  5229. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5230. END ">=";
  5231. (** REAL *)
  5232. PROCEDURE LssARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5233. VAR lval, rval: REAL;
  5234. BEGIN
  5235. WHILE (len > 0) DO
  5236. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5237. IF rval <= lval THEN RETURN FALSE END;
  5238. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5239. END;
  5240. RETURN TRUE;
  5241. END LssARARLoop;
  5242. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5243. BEGIN
  5244. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5245. END "<";
  5246. PROCEDURE GeqARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5247. VAR lval, rval: REAL;
  5248. BEGIN
  5249. WHILE (len > 0) DO
  5250. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5251. IF rval > lval THEN RETURN FALSE END;
  5252. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5253. END;
  5254. RETURN TRUE;
  5255. END GeqARARLoop;
  5256. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5257. BEGIN
  5258. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5259. END ">=";
  5260. (** LONGREAL *)
  5261. PROCEDURE LssAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5262. VAR lval, rval: LONGREAL;
  5263. BEGIN
  5264. WHILE (len > 0) DO
  5265. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5266. IF rval <= lval THEN RETURN FALSE END;
  5267. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5268. END;
  5269. RETURN TRUE;
  5270. END LssAXAXLoop;
  5271. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5272. BEGIN
  5273. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5274. END "<";
  5275. PROCEDURE GeqAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5276. VAR lval, rval: LONGREAL;
  5277. BEGIN
  5278. WHILE (len > 0) DO
  5279. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5280. IF rval > lval THEN RETURN FALSE END;
  5281. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5282. END;
  5283. RETURN TRUE;
  5284. END GeqAXAXLoop;
  5285. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5286. BEGIN
  5287. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5288. END ">=";
  5289. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5290. (** SHORTINT *)
  5291. PROCEDURE GtrASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5292. VAR lval, rval: SHORTINT;
  5293. BEGIN
  5294. WHILE (len > 0) DO
  5295. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5296. IF rval >= lval THEN RETURN FALSE END;
  5297. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5298. END;
  5299. RETURN TRUE;
  5300. END GtrASASLoop;
  5301. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5302. BEGIN
  5303. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5304. END ">";
  5305. PROCEDURE LeqASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5306. VAR lval, rval: SHORTINT;
  5307. BEGIN
  5308. WHILE (len > 0) DO
  5309. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5310. IF rval < lval THEN RETURN FALSE END;
  5311. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5312. END;
  5313. RETURN TRUE;
  5314. END LeqASASLoop;
  5315. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5316. BEGIN
  5317. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5318. END "<=";
  5319. (** INTEGER *)
  5320. PROCEDURE GtrAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5321. VAR lval, rval: INTEGER;
  5322. BEGIN
  5323. WHILE (len > 0) DO
  5324. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5325. IF rval >= lval THEN RETURN FALSE END;
  5326. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5327. END;
  5328. RETURN TRUE;
  5329. END GtrAIAILoop;
  5330. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5331. BEGIN
  5332. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5333. END ">";
  5334. PROCEDURE LeqAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5335. VAR lval, rval: INTEGER;
  5336. BEGIN
  5337. WHILE (len > 0) DO
  5338. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5339. IF rval < lval THEN RETURN FALSE END;
  5340. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5341. END;
  5342. RETURN TRUE;
  5343. END LeqAIAILoop;
  5344. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5345. BEGIN
  5346. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5347. END "<=";
  5348. (** LONGINT *)
  5349. PROCEDURE GtrALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5350. VAR lval, rval: LONGINT;
  5351. BEGIN
  5352. WHILE (len > 0) DO
  5353. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5354. IF rval >= lval THEN RETURN FALSE END;
  5355. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5356. END;
  5357. RETURN TRUE;
  5358. END GtrALALLoop;
  5359. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5360. BEGIN
  5361. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5362. END ">";
  5363. PROCEDURE LeqALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5364. VAR lval, rval: LONGINT;
  5365. BEGIN
  5366. WHILE (len > 0) DO
  5367. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5368. IF rval < lval THEN RETURN FALSE END;
  5369. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5370. END;
  5371. RETURN TRUE;
  5372. END LeqALALLoop;
  5373. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5374. BEGIN
  5375. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5376. END "<=";
  5377. (** REAL *)
  5378. PROCEDURE GtrARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5379. VAR lval, rval: REAL;
  5380. BEGIN
  5381. WHILE (len > 0) DO
  5382. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5383. IF rval >= lval THEN RETURN FALSE END;
  5384. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5385. END;
  5386. RETURN TRUE;
  5387. END GtrARARLoop;
  5388. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5389. BEGIN
  5390. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5391. END ">";
  5392. PROCEDURE LeqARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5393. VAR lval, rval: REAL;
  5394. BEGIN
  5395. WHILE (len > 0) DO
  5396. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5397. IF rval < lval THEN RETURN FALSE END;
  5398. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5399. END;
  5400. RETURN TRUE;
  5401. END LeqARARLoop;
  5402. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5403. BEGIN
  5404. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5405. END "<=";
  5406. (** LONGREAL *)
  5407. PROCEDURE GtrAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5408. VAR lval, rval: LONGREAL;
  5409. BEGIN
  5410. WHILE (len > 0) DO
  5411. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5412. IF rval >= lval THEN RETURN FALSE END;
  5413. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5414. END;
  5415. RETURN TRUE;
  5416. END GtrAXAXLoop;
  5417. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5418. BEGIN
  5419. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5420. END ">";
  5421. PROCEDURE LeqAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5422. VAR lval, rval: LONGREAL;
  5423. BEGIN
  5424. WHILE (len > 0) DO
  5425. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5426. IF rval < lval THEN RETURN FALSE END;
  5427. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5428. END;
  5429. RETURN TRUE;
  5430. END LeqAXAXLoop;
  5431. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5432. BEGIN
  5433. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5434. END "<=";
  5435. (*** equals: array x array -> boolean ********************************************************************)
  5436. (** BOOLEAN *)
  5437. PROCEDURE EqlABABLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5438. VAR lval, rval: BOOLEAN;
  5439. BEGIN
  5440. WHILE (len > 0) DO
  5441. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5442. IF rval # lval THEN RETURN FALSE END;
  5443. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5444. END;
  5445. RETURN TRUE;
  5446. END EqlABABLoop;
  5447. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5448. BEGIN
  5449. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5450. END "=";
  5451. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5452. BEGIN
  5453. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5454. END "#";
  5455. (** SHORTINT *)
  5456. PROCEDURE EqlASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5457. VAR lval, rval: SHORTINT;
  5458. BEGIN
  5459. WHILE (len > 0) DO
  5460. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5461. IF rval # lval THEN RETURN FALSE END;
  5462. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5463. END;
  5464. RETURN TRUE;
  5465. END EqlASASLoop;
  5466. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5467. BEGIN
  5468. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5469. END "=";
  5470. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5471. BEGIN
  5472. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5473. END "#";
  5474. (** INTEGER *)
  5475. PROCEDURE EqlAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5476. VAR lval, rval: INTEGER;
  5477. BEGIN
  5478. WHILE (len > 0) DO
  5479. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5480. IF rval # lval THEN RETURN FALSE END;
  5481. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5482. END;
  5483. RETURN TRUE;
  5484. END EqlAIAILoop;
  5485. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5486. BEGIN
  5487. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5488. END "=";
  5489. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5490. BEGIN
  5491. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5492. END "#";
  5493. (** LONGINT *)
  5494. PROCEDURE EqlALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5495. VAR lval, rval: LONGINT;
  5496. BEGIN
  5497. WHILE (len > 0) DO
  5498. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5499. IF rval # lval THEN RETURN FALSE END;
  5500. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5501. END;
  5502. RETURN TRUE;
  5503. END EqlALALLoop;
  5504. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5505. BEGIN
  5506. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5507. END "=";
  5508. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5509. BEGIN
  5510. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5511. END "#";
  5512. (** REAL *)
  5513. PROCEDURE EqlARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5514. VAR lval, rval: REAL;
  5515. BEGIN
  5516. WHILE (len > 0) DO
  5517. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5518. IF rval # lval THEN RETURN FALSE END;
  5519. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5520. END;
  5521. RETURN TRUE;
  5522. END EqlARARLoop;
  5523. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5524. BEGIN
  5525. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5526. END "=";
  5527. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5528. BEGIN
  5529. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5530. END "#";
  5531. (** LONGREAL *)
  5532. PROCEDURE EqlAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5533. VAR lval, rval: LONGREAL;
  5534. BEGIN
  5535. WHILE (len > 0) DO
  5536. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5537. IF rval # lval THEN RETURN FALSE END;
  5538. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5539. END;
  5540. RETURN TRUE;
  5541. END EqlAXAXLoop;
  5542. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5543. BEGIN
  5544. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5545. END "=";
  5546. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5547. BEGIN
  5548. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5549. END "#";
  5550. (** COMPLEX *)
  5551. PROCEDURE EqlAZAZLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5552. VAR lval, rval: COMPLEX;
  5553. BEGIN
  5554. WHILE (len > 0) DO
  5555. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5556. IF rval # lval THEN RETURN FALSE END;
  5557. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5558. END;
  5559. RETURN TRUE;
  5560. END EqlAZAZLoop;
  5561. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5562. BEGIN
  5563. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5564. END "=";
  5565. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5566. BEGIN
  5567. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5568. END "#";
  5569. (** LONGCOMPLEX *)
  5570. PROCEDURE EqlALZALZLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5571. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5572. BEGIN
  5573. WHILE (len > 0) DO
  5574. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5575. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5576. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5577. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5578. END;
  5579. RETURN TRUE;
  5580. END EqlALZALZLoop;
  5581. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5582. BEGIN
  5583. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5584. END "=";
  5585. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5586. BEGIN
  5587. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5588. END "#";
  5589. (*** equals: array x scalar -> boolean ********************************************************************)
  5590. (** BOOLEAN *)
  5591. PROCEDURE EqlABSBLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5592. VAR lval, rval: BOOLEAN;
  5593. BEGIN
  5594. SYSTEM.GET( radr, rval );
  5595. WHILE (len > 0) DO
  5596. SYSTEM.GET( ladr, lval );
  5597. IF lval # rval THEN RETURN FALSE END;
  5598. INC( ladr, linc ); DEC( len );
  5599. END;
  5600. RETURN TRUE;
  5601. END EqlABSBLoop;
  5602. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5603. right: BOOLEAN ): BOOLEAN;
  5604. BEGIN
  5605. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5606. END "=";
  5607. OPERATOR "="*( left: BOOLEAN;
  5608. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5609. BEGIN
  5610. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5611. END "=";
  5612. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5613. right: BOOLEAN ): BOOLEAN;
  5614. BEGIN
  5615. RETURN ~(left = right);
  5616. END "#";
  5617. OPERATOR "#"*( left: BOOLEAN;
  5618. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5619. BEGIN
  5620. RETURN ~( left = right );
  5621. END "#";
  5622. (** SHORTINT *)
  5623. PROCEDURE EqlASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5624. VAR lval, rval: SHORTINT;
  5625. BEGIN
  5626. SYSTEM.GET( radr, rval );
  5627. WHILE (len > 0) DO
  5628. SYSTEM.GET( ladr, lval );
  5629. IF lval # rval THEN RETURN FALSE END;
  5630. INC( ladr, linc ); DEC( len );
  5631. END;
  5632. RETURN TRUE;
  5633. END EqlASSSLoop;
  5634. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5635. BEGIN
  5636. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5637. END "=";
  5638. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5639. BEGIN
  5640. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5641. END "=";
  5642. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5643. BEGIN
  5644. RETURN ~( left= right );
  5645. END "#";
  5646. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5647. BEGIN
  5648. RETURN ~( left= right );
  5649. END "#";
  5650. (** INTEGER *)
  5651. PROCEDURE EqlAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5652. VAR lval, rval: INTEGER;
  5653. BEGIN
  5654. SYSTEM.GET( radr, rval );
  5655. WHILE (len > 0) DO
  5656. SYSTEM.GET( ladr, lval );
  5657. IF lval # rval THEN RETURN FALSE END;
  5658. INC( ladr, linc ); DEC( len );
  5659. END;
  5660. RETURN TRUE;
  5661. END EqlAISILoop;
  5662. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5663. BEGIN
  5664. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5665. END "=";
  5666. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5667. BEGIN
  5668. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5669. END "=";
  5670. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5671. BEGIN
  5672. RETURN ~( left = right );
  5673. END "#";
  5674. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5675. BEGIN
  5676. RETURN ~( left = right );
  5677. END "#";
  5678. (** LONGINT *)
  5679. PROCEDURE EqlALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5680. VAR lval, rval: LONGINT;
  5681. BEGIN
  5682. SYSTEM.GET( radr, rval );
  5683. WHILE (len > 0) DO
  5684. SYSTEM.GET( ladr, lval );
  5685. IF lval # rval THEN RETURN FALSE END;
  5686. INC( ladr, linc ); DEC( len );
  5687. END;
  5688. RETURN TRUE;
  5689. END EqlALSLLoop;
  5690. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5691. right: LONGINT ): BOOLEAN;
  5692. BEGIN
  5693. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5694. END "=";
  5695. OPERATOR "="*( left: LONGINT;
  5696. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5697. BEGIN
  5698. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5699. END "=";
  5700. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5701. right: LONGINT ): BOOLEAN;
  5702. BEGIN
  5703. RETURN ~(left = right);
  5704. END "#";
  5705. OPERATOR "#"*( left: LONGINT;
  5706. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5707. BEGIN
  5708. RETURN ~(left = right);
  5709. END "#";
  5710. (** REAL *)
  5711. PROCEDURE EqlARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5712. VAR lval, rval: REAL;
  5713. BEGIN
  5714. SYSTEM.GET( radr, rval );
  5715. WHILE (len > 0) DO
  5716. SYSTEM.GET( ladr, lval );
  5717. IF lval # rval THEN RETURN FALSE END;
  5718. INC( ladr, linc ); DEC( len );
  5719. END;
  5720. RETURN TRUE;
  5721. END EqlARSRLoop;
  5722. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5723. right: REAL ): BOOLEAN;
  5724. BEGIN
  5725. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5726. END "=";
  5727. OPERATOR "="*( left: REAL;
  5728. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5729. BEGIN
  5730. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5731. END "=";
  5732. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5733. right: REAL ): BOOLEAN;
  5734. BEGIN
  5735. RETURN ~( left = right );
  5736. END "#";
  5737. OPERATOR "#"*( left: REAL;
  5738. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5739. BEGIN
  5740. RETURN ~( left = right );
  5741. END "#";
  5742. (** LONGREAL *)
  5743. PROCEDURE EqlAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5744. VAR lval, rval: LONGREAL;
  5745. BEGIN
  5746. SYSTEM.GET( radr, rval );
  5747. WHILE (len > 0) DO
  5748. SYSTEM.GET( ladr, lval );
  5749. IF lval # rval THEN RETURN FALSE END;
  5750. INC( ladr, linc ); DEC( len );
  5751. END;
  5752. RETURN TRUE;
  5753. END EqlAXSXLoop;
  5754. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5755. right: LONGREAL ): BOOLEAN;
  5756. BEGIN
  5757. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5758. END "=";
  5759. OPERATOR "="*( left: LONGREAL;
  5760. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5761. BEGIN
  5762. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5763. END "=";
  5764. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5765. right: LONGREAL ): BOOLEAN;
  5766. BEGIN
  5767. RETURN ~( left = right );
  5768. END "#";
  5769. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5770. BEGIN
  5771. RETURN ~( left= right );
  5772. END "#";
  5773. (*** gtr : array x scalar -> boolean ********************************************************************)
  5774. (** SHORTINT *)
  5775. PROCEDURE GtrASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5776. VAR lval, rval: SHORTINT;
  5777. BEGIN
  5778. SYSTEM.GET( radr, rval );
  5779. WHILE (len > 0) DO
  5780. SYSTEM.GET( ladr, lval );
  5781. IF lval <= rval THEN RETURN FALSE END;
  5782. INC( ladr, linc ); DEC( len );
  5783. END;
  5784. RETURN TRUE;
  5785. END GtrASSSLoop;
  5786. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5787. BEGIN
  5788. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5789. END ">";
  5790. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5791. BEGIN
  5792. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5793. END "<";
  5794. (** INTEGER *)
  5795. PROCEDURE GtrAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5796. VAR lval, rval: INTEGER;
  5797. BEGIN
  5798. SYSTEM.GET( radr, rval );
  5799. WHILE (len > 0) DO
  5800. SYSTEM.GET( ladr, lval );
  5801. IF lval <= rval THEN RETURN FALSE END;
  5802. INC( ladr, linc ); DEC( len );
  5803. END;
  5804. RETURN TRUE;
  5805. END GtrAISILoop;
  5806. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5807. BEGIN
  5808. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5809. END ">";
  5810. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5811. BEGIN
  5812. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5813. END "<";
  5814. (** LONGINT *)
  5815. PROCEDURE GtrALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5816. VAR lval, rval: LONGINT;
  5817. BEGIN
  5818. SYSTEM.GET( radr, rval );
  5819. WHILE (len > 0) DO
  5820. SYSTEM.GET( ladr, lval );
  5821. IF lval <= rval THEN RETURN FALSE END;
  5822. INC( ladr, linc ); DEC( len );
  5823. END;
  5824. RETURN TRUE;
  5825. END GtrALSLLoop;
  5826. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5827. BEGIN
  5828. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5829. END ">";
  5830. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5831. BEGIN
  5832. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5833. END "<";
  5834. (** REAL *)
  5835. PROCEDURE GtrARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5836. VAR lval, rval: REAL;
  5837. BEGIN
  5838. SYSTEM.GET( radr, rval );
  5839. WHILE (len > 0) DO
  5840. SYSTEM.GET( ladr, lval );
  5841. IF lval <= rval THEN RETURN FALSE END;
  5842. INC( ladr, linc ); DEC( len );
  5843. END;
  5844. RETURN TRUE;
  5845. END GtrARSRLoop;
  5846. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5847. right: REAL ): BOOLEAN;
  5848. BEGIN
  5849. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5850. END ">";
  5851. OPERATOR "<"*( left: REAL;
  5852. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5853. BEGIN
  5854. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5855. END "<";
  5856. (** LONGREAL *)
  5857. PROCEDURE GtrAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5858. VAR lval, rval: LONGREAL;
  5859. BEGIN
  5860. SYSTEM.GET( radr, rval );
  5861. WHILE (len > 0) DO
  5862. SYSTEM.GET( ladr, lval );
  5863. IF lval <= rval THEN RETURN FALSE END;
  5864. INC( ladr, linc ); DEC( len );
  5865. END;
  5866. RETURN TRUE;
  5867. END GtrAXSXLoop;
  5868. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5869. right: LONGREAL ): BOOLEAN;
  5870. BEGIN
  5871. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5872. END ">";
  5873. OPERATOR "<"*( left: LONGREAL;
  5874. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5875. BEGIN
  5876. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5877. END "<";
  5878. (*** geq : array x scalar -> boolean ********************************************************************)
  5879. (** SHORTINT *)
  5880. PROCEDURE GeqASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5881. VAR lval, rval: SHORTINT;
  5882. BEGIN
  5883. SYSTEM.GET( radr, rval );
  5884. WHILE (len > 0) DO
  5885. SYSTEM.GET( ladr, lval );
  5886. IF lval < rval THEN RETURN FALSE END;
  5887. INC( ladr, linc ); DEC( len );
  5888. END;
  5889. RETURN TRUE;
  5890. END GeqASSSLoop;
  5891. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5892. right: SHORTINT ): BOOLEAN;
  5893. BEGIN
  5894. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5895. END ">=";
  5896. OPERATOR "<="*( left: SHORTINT;
  5897. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5898. BEGIN
  5899. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5900. END "<=";
  5901. (** INTEGER *)
  5902. PROCEDURE GeqAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5903. VAR lval, rval: INTEGER;
  5904. BEGIN
  5905. SYSTEM.GET( radr, rval );
  5906. WHILE (len > 0) DO
  5907. SYSTEM.GET( ladr, lval );
  5908. IF lval < rval THEN RETURN FALSE END;
  5909. INC( ladr, linc ); DEC( len );
  5910. END;
  5911. RETURN TRUE;
  5912. END GeqAISILoop;
  5913. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5914. BEGIN
  5915. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5916. END ">=";
  5917. OPERATOR "<="*( left: INTEGER;
  5918. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5921. END "<=";
  5922. (** LONGINT *)
  5923. PROCEDURE GeqALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5924. VAR lval, rval: LONGINT;
  5925. BEGIN
  5926. SYSTEM.GET( radr, rval );
  5927. WHILE (len > 0) DO
  5928. SYSTEM.GET( ladr, lval );
  5929. IF lval < rval THEN RETURN FALSE END;
  5930. INC( ladr, linc ); DEC( len );
  5931. END;
  5932. RETURN TRUE;
  5933. END GeqALSLLoop;
  5934. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5935. right: LONGINT ): BOOLEAN;
  5936. BEGIN
  5937. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5938. END ">=";
  5939. OPERATOR "<="*( left: LONGINT;
  5940. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5941. BEGIN
  5942. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5943. END "<=";
  5944. (** REAL *)
  5945. PROCEDURE GeqARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5946. VAR lval, rval: REAL;
  5947. BEGIN
  5948. SYSTEM.GET( radr, rval );
  5949. WHILE (len > 0) DO
  5950. SYSTEM.GET( ladr, lval );
  5951. IF lval < rval THEN RETURN FALSE END;
  5952. INC( ladr, linc ); DEC( len );
  5953. END;
  5954. RETURN TRUE;
  5955. END GeqARSRLoop;
  5956. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5957. right: REAL ): BOOLEAN;
  5958. BEGIN
  5959. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5960. END ">=";
  5961. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5962. BEGIN
  5963. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5964. END "<=";
  5965. (** LONGREAL *)
  5966. PROCEDURE GeqAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5967. VAR lval, rval: LONGREAL;
  5968. BEGIN
  5969. SYSTEM.GET( radr, rval );
  5970. WHILE (len > 0) DO
  5971. SYSTEM.GET( ladr, lval );
  5972. IF lval < rval THEN RETURN FALSE END;
  5973. INC( ladr, linc ); DEC( len );
  5974. END;
  5975. RETURN TRUE;
  5976. END GeqAXSXLoop;
  5977. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5978. BEGIN
  5979. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5980. END ">=";
  5981. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5982. BEGIN
  5983. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5984. END "<=";
  5985. (*** leq : array x scalar -> boolean ********************************************************************)
  5986. (** SHORTINT *)
  5987. PROCEDURE LeqASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5988. VAR lval, rval: SHORTINT;
  5989. BEGIN
  5990. SYSTEM.GET( radr, rval );
  5991. WHILE (len > 0) DO
  5992. SYSTEM.GET( ladr, lval );
  5993. IF lval > rval THEN RETURN FALSE END;
  5994. INC( ladr, linc ); DEC( len );
  5995. END;
  5996. RETURN TRUE;
  5997. END LeqASSSLoop;
  5998. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5999. BEGIN
  6000. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6001. END "<=";
  6002. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6003. BEGIN
  6004. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6005. END ">=";
  6006. (** INTEGER *)
  6007. PROCEDURE LeqAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6008. VAR lval, rval: INTEGER;
  6009. BEGIN
  6010. SYSTEM.GET( radr, rval );
  6011. WHILE (len > 0) DO
  6012. SYSTEM.GET( ladr, lval );
  6013. IF lval > rval THEN RETURN FALSE END;
  6014. INC( ladr, linc ); DEC( len );
  6015. END;
  6016. RETURN TRUE;
  6017. END LeqAISILoop;
  6018. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6019. BEGIN
  6020. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6021. END "<=";
  6022. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6023. BEGIN
  6024. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6025. END ">=";
  6026. (** LONGINT *)
  6027. PROCEDURE LeqALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6028. VAR lval, rval: LONGINT;
  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 LeqALSLLoop;
  6038. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6039. BEGIN
  6040. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6041. END "<=";
  6042. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6043. BEGIN
  6044. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6045. END ">=";
  6046. (** REAL *)
  6047. PROCEDURE LeqARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6048. VAR lval, rval: REAL;
  6049. BEGIN
  6050. SYSTEM.GET( radr, rval );
  6051. WHILE (len > 0) DO
  6052. SYSTEM.GET( ladr, lval );
  6053. IF lval > rval THEN RETURN FALSE END;
  6054. INC( ladr, linc ); DEC( len );
  6055. END;
  6056. RETURN TRUE;
  6057. END LeqARSRLoop;
  6058. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6059. BEGIN
  6060. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6061. END "<=";
  6062. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6063. BEGIN
  6064. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6065. END ">=";
  6066. (** LONGREAL *)
  6067. PROCEDURE LeqAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6068. VAR lval, rval: LONGREAL;
  6069. BEGIN
  6070. SYSTEM.GET( radr, rval );
  6071. WHILE (len > 0) DO
  6072. SYSTEM.GET( ladr, lval );
  6073. IF lval > rval THEN RETURN FALSE END;
  6074. INC( ladr, linc ); DEC( len );
  6075. END;
  6076. RETURN TRUE;
  6077. END LeqAXSXLoop;
  6078. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6079. BEGIN
  6080. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6081. END "<=";
  6082. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6083. BEGIN
  6084. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6085. END ">=";
  6086. (*** lss: array x scalar -> boolean ********************************************************************)
  6087. (** SHORTINT *)
  6088. PROCEDURE LssASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6089. VAR lval, rval: SHORTINT;
  6090. BEGIN
  6091. SYSTEM.GET( radr, rval );
  6092. WHILE (len > 0) DO
  6093. SYSTEM.GET( ladr, lval );
  6094. IF lval >= rval THEN RETURN FALSE END;
  6095. INC( ladr, linc ); DEC( len );
  6096. END;
  6097. RETURN TRUE;
  6098. END LssASSSLoop;
  6099. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6100. BEGIN
  6101. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6102. END "<";
  6103. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6104. BEGIN
  6105. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6106. END ">";
  6107. (** INTEGER *)
  6108. PROCEDURE LssAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6109. VAR lval, rval: INTEGER;
  6110. BEGIN
  6111. SYSTEM.GET( radr, rval );
  6112. WHILE (len > 0) DO
  6113. SYSTEM.GET( ladr, lval );
  6114. IF lval >= rval THEN RETURN FALSE END;
  6115. INC( ladr, linc ); DEC( len );
  6116. END;
  6117. RETURN TRUE;
  6118. END LssAISILoop;
  6119. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6120. BEGIN
  6121. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6122. END "<";
  6123. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6124. BEGIN
  6125. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6126. END ">";
  6127. (** LONGINT *)
  6128. PROCEDURE LssALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6129. VAR lval, rval: LONGINT;
  6130. BEGIN
  6131. SYSTEM.GET( radr, rval );
  6132. WHILE (len > 0) DO
  6133. SYSTEM.GET( ladr, lval );
  6134. IF lval >= rval THEN RETURN FALSE END;
  6135. INC( ladr, linc ); DEC( len );
  6136. END;
  6137. RETURN TRUE;
  6138. END LssALSLLoop;
  6139. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6140. BEGIN
  6141. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6142. END "<";
  6143. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6144. BEGIN
  6145. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6146. END ">";
  6147. (** REAL *)
  6148. PROCEDURE LssARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6149. VAR lval, rval: REAL;
  6150. BEGIN
  6151. SYSTEM.GET( radr, rval );
  6152. WHILE (len > 0) DO
  6153. SYSTEM.GET( ladr, lval );
  6154. IF lval >= rval THEN RETURN FALSE END;
  6155. INC( ladr, linc ); DEC( len );
  6156. END;
  6157. RETURN TRUE;
  6158. END LssARSRLoop;
  6159. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6160. right: REAL ): BOOLEAN;
  6161. BEGIN
  6162. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6163. END "<";
  6164. OPERATOR ">"*( left: REAL;
  6165. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6166. BEGIN
  6167. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6168. END ">";
  6169. (** LONGREAL *)
  6170. PROCEDURE LssAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6171. VAR lval, rval: LONGREAL;
  6172. BEGIN
  6173. SYSTEM.GET( radr, rval );
  6174. WHILE (len > 0) DO
  6175. SYSTEM.GET( ladr, lval );
  6176. IF lval >= rval THEN RETURN FALSE END;
  6177. INC( ladr, linc ); DEC( len );
  6178. END;
  6179. RETURN TRUE;
  6180. END LssAXSXLoop;
  6181. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6182. right: LONGREAL ): BOOLEAN;
  6183. BEGIN
  6184. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6185. END "<";
  6186. OPERATOR ">"*( left: LONGREAL;
  6187. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6188. BEGIN
  6189. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6190. END ">";
  6191. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6192. PROCEDURE MaxAXSXLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6193. VAR lval, val: LONGREAL;
  6194. BEGIN
  6195. SYSTEM.GET( radr, val );
  6196. WHILE (len > 0) DO
  6197. SYSTEM.GET( ladr, lval );
  6198. INC( ladr, linc ); DEC( len );
  6199. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6200. INC(dadr,dinc);
  6201. END;
  6202. END MaxAXSXLoop;
  6203. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6204. TYPE Type = LONGREAL;
  6205. BEGIN
  6206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6207. RETURN RESULT
  6208. END "MAX";
  6209. PROCEDURE MaxARSRLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6210. VAR lval, val: REAL;
  6211. BEGIN
  6212. SYSTEM.GET( radr, val );
  6213. WHILE (len > 0) DO
  6214. SYSTEM.GET( ladr, lval );
  6215. INC( ladr, linc ); DEC( len );
  6216. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6217. INC(dadr,dinc);
  6218. END;
  6219. END MaxARSRLoop;
  6220. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6221. TYPE Type = REAL;
  6222. BEGIN
  6223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6224. RETURN RESULT
  6225. END "MAX";
  6226. PROCEDURE MaxALSLLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6227. VAR lval, val: LONGINT;
  6228. BEGIN
  6229. SYSTEM.GET( radr, val );
  6230. WHILE (len > 0) DO
  6231. SYSTEM.GET( ladr, lval );
  6232. INC( ladr, linc ); DEC( len );
  6233. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6234. INC(dadr,dinc);
  6235. END;
  6236. END MaxALSLLoop;
  6237. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6238. TYPE Type = LONGINT;
  6239. BEGIN
  6240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6241. RETURN RESULT
  6242. END "MAX";
  6243. PROCEDURE MaxAISILoop( ladr, radr, dadr, linc, dinc, len: Address );
  6244. VAR lval, val: INTEGER;
  6245. BEGIN
  6246. SYSTEM.GET( radr, val );
  6247. WHILE (len > 0) DO
  6248. SYSTEM.GET( ladr, lval );
  6249. INC( ladr, linc ); DEC( len );
  6250. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6251. INC(dadr,dinc);
  6252. END;
  6253. END MaxAISILoop;
  6254. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6255. TYPE Type = INTEGER;
  6256. BEGIN
  6257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6258. RETURN RESULT
  6259. END "MAX";
  6260. PROCEDURE MaxASSSLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6261. VAR lval, val: SHORTINT;
  6262. BEGIN
  6263. SYSTEM.GET( radr, val );
  6264. WHILE (len > 0) DO
  6265. SYSTEM.GET( ladr, lval );
  6266. INC( ladr, linc ); DEC( len );
  6267. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6268. INC(dadr,dinc);
  6269. END;
  6270. END MaxASSSLoop;
  6271. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6272. TYPE Type = SHORTINT;
  6273. BEGIN
  6274. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6275. RETURN RESULT
  6276. END "MAX";
  6277. PROCEDURE MinAXSXLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6278. VAR lval, val: LONGREAL;
  6279. BEGIN
  6280. SYSTEM.GET( radr, val );
  6281. WHILE (len > 0) DO
  6282. SYSTEM.GET( ladr, lval );
  6283. INC( ladr, linc ); DEC( len );
  6284. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6285. INC(dadr,dinc);
  6286. END;
  6287. END MinAXSXLoop;
  6288. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6289. TYPE Type = LONGREAL;
  6290. BEGIN
  6291. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6292. RETURN RESULT
  6293. END "MIN";
  6294. PROCEDURE MinARSRLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6295. VAR lval, val: REAL;
  6296. BEGIN
  6297. SYSTEM.GET( radr, val );
  6298. WHILE (len > 0) DO
  6299. SYSTEM.GET( ladr, lval );
  6300. INC( ladr, linc ); DEC( len );
  6301. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6302. INC(dadr,dinc);
  6303. END;
  6304. END MinARSRLoop;
  6305. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6306. TYPE Type = REAL;
  6307. BEGIN
  6308. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6309. RETURN RESULT
  6310. END "MIN";
  6311. PROCEDURE MinALSLLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6312. VAR lval, val: LONGINT;
  6313. BEGIN
  6314. SYSTEM.GET( radr, val );
  6315. WHILE (len > 0) DO
  6316. SYSTEM.GET( ladr, lval );
  6317. INC( ladr, linc ); DEC( len );
  6318. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6319. INC(dadr,dinc);
  6320. END;
  6321. END MinALSLLoop;
  6322. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6323. TYPE Type = LONGINT;
  6324. BEGIN
  6325. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6326. RETURN RESULT
  6327. END "MIN";
  6328. PROCEDURE MinAISILoop( ladr, radr, dadr, linc, dinc, len: Address );
  6329. VAR lval, val: INTEGER;
  6330. BEGIN
  6331. SYSTEM.GET( radr, val );
  6332. WHILE (len > 0) DO
  6333. SYSTEM.GET( ladr, lval );
  6334. INC( ladr, linc ); DEC( len );
  6335. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6336. INC(dadr,dinc);
  6337. END;
  6338. END MinAISILoop;
  6339. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6340. TYPE Type = INTEGER;
  6341. BEGIN
  6342. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6343. RETURN RESULT
  6344. END "MIN";
  6345. PROCEDURE MinASSSLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6346. VAR lval, val: SHORTINT;
  6347. BEGIN
  6348. SYSTEM.GET( radr, val );
  6349. WHILE (len > 0) DO
  6350. SYSTEM.GET( ladr, lval );
  6351. INC( ladr, linc ); DEC( len );
  6352. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6353. INC(dadr,dinc);
  6354. END;
  6355. END MinASSSLoop;
  6356. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6357. TYPE Type = SHORTINT;
  6358. BEGIN
  6359. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6360. RETURN RESULT
  6361. END "MIN";
  6362. (**** binary max/min operators array x array -> array ********************************************************************)
  6363. PROCEDURE MaxAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6364. VAR lval, rval: LONGREAL;
  6365. BEGIN
  6366. WHILE (len > 0) DO
  6367. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6368. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6369. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6370. INC(dadr,dinc);
  6371. END;
  6372. END MaxAXAXLoop;
  6373. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6374. BEGIN
  6375. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6376. RETURN RESULT
  6377. END "MAX";
  6378. PROCEDURE MaxARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6379. VAR lval, rval: REAL ;
  6380. BEGIN
  6381. WHILE (len > 0) DO
  6382. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6383. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6384. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6385. INC(dadr,dinc);
  6386. END;
  6387. END MaxARARLoop;
  6388. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6389. BEGIN
  6390. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6391. RETURN RESULT
  6392. END "MAX";
  6393. PROCEDURE MaxALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6394. VAR lval, rval: LONGINT;
  6395. BEGIN
  6396. WHILE (len > 0) DO
  6397. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6398. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6399. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6400. INC(dadr,dinc);
  6401. END;
  6402. END MaxALALLoop;
  6403. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6404. BEGIN
  6405. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6406. RETURN RESULT
  6407. END "MAX";
  6408. PROCEDURE MaxAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6409. VAR lval, rval: INTEGER;
  6410. BEGIN
  6411. WHILE (len > 0) DO
  6412. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6413. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6414. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6415. INC(dadr,dinc);
  6416. END;
  6417. END MaxAIAILoop;
  6418. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6419. BEGIN
  6420. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6421. RETURN RESULT
  6422. END "MAX";
  6423. PROCEDURE MaxASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6424. VAR lval, rval: SHORTINT;
  6425. BEGIN
  6426. WHILE (len > 0) DO
  6427. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6428. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6429. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6430. INC(dadr,dinc);
  6431. END;
  6432. END MaxASASLoop;
  6433. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6434. BEGIN
  6435. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6436. RETURN RESULT
  6437. END "MAX";
  6438. PROCEDURE MinAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6439. VAR lval, rval: LONGREAL;
  6440. BEGIN
  6441. WHILE (len > 0) DO
  6442. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6443. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6444. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6445. INC(dadr,dinc);
  6446. END;
  6447. END MinAXAXLoop;
  6448. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6449. BEGIN
  6450. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6451. RETURN RESULT
  6452. END "MIN";
  6453. PROCEDURE MinARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6454. VAR lval, rval: REAL ;
  6455. BEGIN
  6456. WHILE (len > 0) DO
  6457. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6458. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6459. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6460. INC(dadr,dinc);
  6461. END;
  6462. END MinARARLoop;
  6463. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6464. BEGIN
  6465. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6466. RETURN RESULT
  6467. END "MIN";
  6468. PROCEDURE MinALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6469. VAR lval, rval: LONGINT;
  6470. BEGIN
  6471. WHILE (len > 0) DO
  6472. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6473. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6474. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6475. INC(dadr,dinc);
  6476. END;
  6477. END MinALALLoop;
  6478. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6479. BEGIN
  6480. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6481. RETURN RESULT
  6482. END "MIN";
  6483. PROCEDURE MinAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6484. VAR lval, rval: INTEGER;
  6485. BEGIN
  6486. WHILE (len > 0) DO
  6487. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6488. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6489. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6490. INC(dadr,dinc);
  6491. END;
  6492. END MinAIAILoop;
  6493. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6494. BEGIN
  6495. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6496. RETURN RESULT
  6497. END "MIN";
  6498. PROCEDURE MinASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6499. VAR lval, rval: SHORTINT;
  6500. BEGIN
  6501. WHILE (len > 0) DO
  6502. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6503. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6504. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6505. INC(dadr,dinc);
  6506. END;
  6507. END MinASASLoop;
  6508. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6509. BEGIN
  6510. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6511. RETURN RESULT
  6512. END "MIN";
  6513. (**** unary operators array -> scalar ********************************************************************)
  6514. (*** min: array -> scalar ****************************************)
  6515. (** SHORTINT *)
  6516. PROCEDURE MinASLoop( ladr, dadr, linc, len: LONGINT );
  6517. VAR lval, dval: SHORTINT;
  6518. BEGIN
  6519. SYSTEM.GET( dadr, dval );
  6520. WHILE (len > 0) DO
  6521. SYSTEM.GET( ladr, lval );
  6522. IF lval < dval THEN dval := lval END;
  6523. INC( ladr, linc ); DEC( len );
  6524. END;
  6525. SYSTEM.PUT( dadr, dval );
  6526. END MinASLoop;
  6527. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6528. TYPE Type = SHORTINT;
  6529. VAR val: Type;
  6530. BEGIN
  6531. val := MAX( Type );
  6532. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6533. END "MIN";
  6534. (** INTEGER *)
  6535. PROCEDURE MinAILoop( ladr, dadr, linc, len: LONGINT );
  6536. VAR lval, dval: INTEGER;
  6537. BEGIN
  6538. SYSTEM.GET( dadr, dval );
  6539. WHILE (len > 0) DO
  6540. SYSTEM.GET( ladr, lval );
  6541. IF lval < dval THEN dval := lval END;
  6542. INC( ladr, linc ); DEC( len );
  6543. END;
  6544. SYSTEM.PUT( dadr, dval );
  6545. END MinAILoop;
  6546. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6547. TYPE Type = INTEGER;
  6548. VAR val: Type;
  6549. BEGIN
  6550. val := MAX( Type );
  6551. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6552. END "MIN";
  6553. (** LONGINT *)
  6554. PROCEDURE MinALLoop( ladr, dadr, linc, len: LONGINT );
  6555. VAR lval, dval: LONGINT;
  6556. BEGIN
  6557. SYSTEM.GET( dadr, dval );
  6558. WHILE (len > 0) DO
  6559. SYSTEM.GET( ladr, lval );
  6560. IF lval < dval THEN dval := lval END;
  6561. INC( ladr, linc ); DEC( len );
  6562. END;
  6563. SYSTEM.PUT( dadr, dval );
  6564. END MinALLoop;
  6565. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6566. TYPE Type = LONGINT;
  6567. VAR val: Type;
  6568. BEGIN
  6569. val := MAX( Type );
  6570. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6571. END "MIN";
  6572. (** REAL *)
  6573. PROCEDURE MinARLoop( ladr, dadr, linc, len: LONGINT );
  6574. VAR lval, dval: REAL;
  6575. BEGIN
  6576. SYSTEM.GET( dadr, dval );
  6577. WHILE (len > 0) DO
  6578. SYSTEM.GET( ladr, lval );
  6579. IF lval < dval THEN dval := lval END;
  6580. INC( ladr, linc ); DEC( len );
  6581. END;
  6582. SYSTEM.PUT( dadr, dval );
  6583. END MinARLoop;
  6584. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6585. TYPE Type = REAL;
  6586. VAR val: Type;
  6587. BEGIN
  6588. val := MAX( Type );
  6589. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6590. END "MIN";
  6591. (** LONGREAL *)
  6592. PROCEDURE MinAXLoop( ladr, dadr, linc, len: LONGINT );
  6593. VAR lval, dval: LONGREAL;
  6594. BEGIN
  6595. SYSTEM.GET( dadr, dval );
  6596. WHILE (len > 0) DO
  6597. SYSTEM.GET( ladr, lval );
  6598. IF lval < dval THEN dval := lval END;
  6599. INC( ladr, linc ); DEC( len );
  6600. END;
  6601. SYSTEM.PUT( dadr, dval );
  6602. END MinAXLoop;
  6603. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6604. TYPE Type = LONGREAL;
  6605. VAR val: Type;
  6606. BEGIN
  6607. val := MAX( Type );
  6608. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6609. END "MIN";
  6610. (*** max: array -> scalar ********************************************************************)
  6611. (** SHORTINT *)
  6612. PROCEDURE MaxASLoop( ladr, dadr, linc, len: LONGINT );
  6613. VAR lval, dval: SHORTINT;
  6614. BEGIN
  6615. SYSTEM.GET( dadr, dval );
  6616. WHILE (len > 0) DO
  6617. SYSTEM.GET( ladr, lval );
  6618. IF lval > dval THEN dval := lval END;
  6619. INC( ladr, linc ); DEC( len );
  6620. END;
  6621. SYSTEM.PUT( dadr, dval );
  6622. END MaxASLoop;
  6623. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6624. TYPE Type = SHORTINT;
  6625. VAR val: Type;
  6626. BEGIN
  6627. val := MIN( Type );
  6628. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6629. END "MAX";
  6630. (** INTEGER *)
  6631. PROCEDURE MaxAILoop( ladr, dadr, linc, len: LONGINT );
  6632. VAR lval, dval: INTEGER;
  6633. BEGIN
  6634. SYSTEM.GET( dadr, dval );
  6635. WHILE (len > 0) DO
  6636. SYSTEM.GET( ladr, lval );
  6637. IF lval > dval THEN dval := lval END;
  6638. INC( ladr, linc ); DEC( len );
  6639. END;
  6640. SYSTEM.PUT( dadr, dval );
  6641. END MaxAILoop;
  6642. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6643. TYPE Type = INTEGER;
  6644. VAR val: Type;
  6645. BEGIN
  6646. val := MIN( Type );
  6647. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6648. END "MAX";
  6649. (** LONGINT *)
  6650. PROCEDURE MaxALLoop( ladr, dadr, linc, len: LONGINT );
  6651. VAR lval, dval: LONGINT;
  6652. BEGIN
  6653. SYSTEM.GET( dadr, dval );
  6654. WHILE (len > 0) DO
  6655. SYSTEM.GET( ladr, lval );
  6656. IF lval > dval THEN dval := lval END;
  6657. INC( ladr, linc ); DEC( len );
  6658. END;
  6659. SYSTEM.PUT( dadr, dval );
  6660. END MaxALLoop;
  6661. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6662. TYPE Type = LONGINT;
  6663. VAR val: Type;
  6664. BEGIN
  6665. val := MIN( Type );
  6666. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6667. END "MAX";
  6668. (** REAL *)
  6669. PROCEDURE MaxARLoop( ladr, dadr, linc, len: LONGINT );
  6670. VAR lval, dval: REAL;
  6671. BEGIN
  6672. SYSTEM.GET( dadr, dval );
  6673. WHILE (len > 0) DO
  6674. SYSTEM.GET( ladr, lval );
  6675. IF lval > dval THEN dval := lval END;
  6676. INC( ladr, linc ); DEC( len );
  6677. END;
  6678. SYSTEM.PUT( dadr, dval );
  6679. END MaxARLoop;
  6680. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6681. TYPE Type = REAL;
  6682. VAR val: Type;
  6683. BEGIN
  6684. val := MIN( Type );
  6685. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6686. END "MAX";
  6687. (** LONGREAL *)
  6688. PROCEDURE MaxAXLoop( ladr, dadr, linc, len: LONGINT );
  6689. VAR lval, dval: LONGREAL;
  6690. BEGIN
  6691. SYSTEM.GET( dadr, dval );
  6692. WHILE (len > 0) DO
  6693. SYSTEM.GET( ladr, lval );
  6694. IF lval > dval THEN dval := lval END;
  6695. INC( ladr, linc ); DEC( len );
  6696. END;
  6697. SYSTEM.PUT( dadr, dval );
  6698. END MaxAXLoop;
  6699. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6700. TYPE Type = LONGREAL;
  6701. VAR val: Type;
  6702. BEGIN
  6703. val := MIN( Type );
  6704. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6705. END "MAX";
  6706. (*** LEN: array -> array **)
  6707. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6708. VAR src,dim,i: LONGINT;
  6709. BEGIN
  6710. src := SYSTEM.VAL(LONGINT,left);
  6711. dim := GetDim( src );
  6712. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6713. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6714. RETURN RESULT
  6715. END "LEN";
  6716. (*** SUM: array -> scalar ********************************************************************)
  6717. (** SHORTINT *)
  6718. PROCEDURE SumASLoop( ladr, dadr, linc, len: LONGINT );
  6719. VAR lval, dval: SHORTINT;
  6720. BEGIN
  6721. SYSTEM.GET( dadr, dval );
  6722. WHILE (len > 0) DO
  6723. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6724. END;
  6725. SYSTEM.PUT( dadr, dval );
  6726. END SumASLoop;
  6727. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6728. TYPE Type = SHORTINT;
  6729. VAR val: Type;
  6730. BEGIN
  6731. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6732. RETURN val;
  6733. END "SUM";
  6734. (** INTEGER *)
  6735. PROCEDURE SumAILoop( ladr, dadr, linc, len: LONGINT );
  6736. VAR lval, dval: INTEGER;
  6737. BEGIN
  6738. SYSTEM.GET( dadr, dval );
  6739. WHILE (len > 0) DO
  6740. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6741. END;
  6742. SYSTEM.PUT( dadr, dval );
  6743. END SumAILoop;
  6744. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6745. TYPE Type = INTEGER;
  6746. VAR val: Type;
  6747. BEGIN
  6748. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6749. RETURN val;
  6750. END "SUM";
  6751. (** LONGINT *)
  6752. PROCEDURE SumALLoop( ladr, dadr, linc, len: LONGINT );
  6753. VAR lval, dval: LONGINT;
  6754. BEGIN
  6755. SYSTEM.GET( dadr, dval );
  6756. WHILE (len > 0) DO
  6757. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6758. END;
  6759. SYSTEM.PUT( dadr, dval );
  6760. END SumALLoop;
  6761. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6762. TYPE Type = LONGINT;
  6763. VAR val: Type;
  6764. BEGIN
  6765. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6766. RETURN val;
  6767. END "SUM";
  6768. (** REAL *)
  6769. PROCEDURE SumARLoop( ladr, dadr, linc, len: LONGINT );
  6770. VAR lval, dval: REAL;
  6771. BEGIN
  6772. SYSTEM.GET( dadr, dval );
  6773. WHILE (len > 0) DO
  6774. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6775. END;
  6776. SYSTEM.PUT( dadr, dval );
  6777. END SumARLoop;
  6778. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6779. TYPE Type = REAL;
  6780. VAR val: Type;
  6781. BEGIN
  6782. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6783. RETURN val;
  6784. END "SUM";
  6785. (** LONGREAL *)
  6786. PROCEDURE SumAXLoop( ladr, dadr, linc, len: LONGINT );
  6787. VAR lval, dval: LONGREAL;
  6788. BEGIN
  6789. SYSTEM.GET( dadr, dval );
  6790. WHILE (len > 0) DO
  6791. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6792. END;
  6793. SYSTEM.PUT( dadr, dval );
  6794. END SumAXLoop;
  6795. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6796. TYPE Type = LONGREAL;
  6797. VAR val: Type;
  6798. BEGIN
  6799. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6800. RETURN val;
  6801. END "SUM";
  6802. (** COMPLEX *)
  6803. PROCEDURE SumAZLoop( ladr, dadr, linc, len: LONGINT );
  6804. VAR lval, dval: COMPLEX;
  6805. BEGIN
  6806. SYSTEM.GET( dadr, dval );
  6807. WHILE (len > 0) DO
  6808. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6809. END;
  6810. SYSTEM.PUT( dadr, dval );
  6811. END SumAZLoop;
  6812. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6813. TYPE Type = COMPLEX;
  6814. VAR val: Type;
  6815. BEGIN
  6816. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6817. RETURN val;
  6818. END "SUM";
  6819. (** LONGCOMPLEX *)
  6820. PROCEDURE SumALZLoop( ladr, dadr, linc, len: LONGINT );
  6821. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6822. BEGIN
  6823. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6824. WHILE (len > 0) DO
  6825. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6826. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6827. INC( ladr, linc ); DEC( len );
  6828. END;
  6829. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6830. END SumALZLoop;
  6831. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6832. TYPE Type = LONGCOMPLEX;
  6833. VAR val: Type;
  6834. BEGIN
  6835. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6836. RETURN val;
  6837. END "SUM";
  6838. (*** monadic ABS array -> array ********************************************************************)
  6839. (** SHORTINT *)
  6840. PROCEDURE AbsLoopS( ladr, dadr, linc, dinc, len: LONGINT );
  6841. VAR lval: SHORTINT;
  6842. BEGIN
  6843. WHILE (len > 0) DO
  6844. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6845. INC( dadr, dinc ); DEC( len );
  6846. END;
  6847. END AbsLoopS;
  6848. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6849. BEGIN
  6850. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6851. RETURN RESULT
  6852. END "ABS";
  6853. (** INTEGER *)
  6854. PROCEDURE AbsLoopI( ladr, dadr, linc, dinc, len: LONGINT );
  6855. VAR lval: INTEGER;
  6856. BEGIN
  6857. WHILE (len > 0) DO
  6858. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6859. INC( dadr, dinc ); DEC( len );
  6860. END;
  6861. END AbsLoopI;
  6862. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6863. BEGIN
  6864. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6865. RETURN RESULT
  6866. END "ABS";
  6867. (** LONGINT *)
  6868. PROCEDURE AbsLoopL( ladr, dadr, linc, dinc, len: LONGINT );
  6869. VAR lval: LONGINT;
  6870. BEGIN
  6871. WHILE (len > 0) DO
  6872. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6873. INC( dadr, dinc ); DEC( len );
  6874. END;
  6875. END AbsLoopL;
  6876. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6877. BEGIN
  6878. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6879. RETURN RESULT
  6880. END "ABS";
  6881. (** REAL *)
  6882. PROCEDURE AbsLoopR( ladr, dadr, linc, dinc, len: LONGINT );
  6883. VAR lval: REAL;
  6884. BEGIN
  6885. WHILE (len > 0) DO
  6886. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6887. INC( dadr, dinc ); DEC( len );
  6888. END;
  6889. END AbsLoopR;
  6890. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6891. BEGIN
  6892. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6893. RETURN RESULT
  6894. END "ABS";
  6895. (** LONGREAL *)
  6896. PROCEDURE AbsLoopX( ladr, dadr, linc, dinc, len: LONGINT );
  6897. VAR lval: LONGREAL;
  6898. BEGIN
  6899. WHILE (len > 0) DO
  6900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6901. INC( dadr, dinc ); DEC( len );
  6902. END;
  6903. END AbsLoopX;
  6904. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6905. BEGIN
  6906. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6907. RETURN RESULT
  6908. END "ABS";
  6909. (** COMPLEX *)
  6910. PROCEDURE AbsLoopZ( ladr, dadr, linc, dinc, len: LONGINT );
  6911. VAR lval: COMPLEX;
  6912. BEGIN
  6913. WHILE (len > 0) DO
  6914. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6915. INC( dadr, dinc ); DEC( len );
  6916. END;
  6917. END AbsLoopZ;
  6918. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6919. BEGIN
  6920. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6921. RETURN RESULT
  6922. END "ABS";
  6923. (** LONGCOMPLEX *)
  6924. PROCEDURE AbsLoopLZ( ladr, dadr, linc, dinc, len: LONGINT );
  6925. VAR lvalRe, lvalIm: LONGREAL;
  6926. BEGIN
  6927. WHILE (len > 0) DO
  6928. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6929. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6930. INC( ladr, linc );
  6931. INC( dadr, dinc ); DEC( len );
  6932. END;
  6933. END AbsLoopLZ;
  6934. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6935. BEGIN
  6936. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6937. RETURN RESULT
  6938. END "ABS";
  6939. (*** assign number to array (initialisation) ********************************************************************)
  6940. (** BOOLEAN *)
  6941. PROCEDURE AssignSBABLoop( ladr, dadr, dinc, len: LONGINT );
  6942. VAR lval: BOOLEAN;
  6943. BEGIN
  6944. SYSTEM.GET( ladr, lval );
  6945. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6946. END AssignSBABLoop;
  6947. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6948. BEGIN
  6949. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6950. END ":=";
  6951. (** SHORTINT*)
  6952. PROCEDURE AssignSSASLoop( ladr, dadr, dinc, len: LONGINT );
  6953. VAR lval: SHORTINT;
  6954. BEGIN
  6955. SYSTEM.GET( ladr, lval );
  6956. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6957. END AssignSSASLoop;
  6958. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6959. BEGIN
  6960. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6961. END ":=";
  6962. (**INTEGER *)
  6963. PROCEDURE AssignSIAILoop( ladr, dadr, dinc, len: LONGINT );
  6964. VAR lval: INTEGER;
  6965. BEGIN
  6966. SYSTEM.GET( ladr, lval );
  6967. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6968. END AssignSIAILoop;
  6969. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6970. BEGIN
  6971. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6972. END ":=";
  6973. (** LONGINT *)
  6974. PROCEDURE AssignSLALLoop( ladr, dadr, dinc, len: LONGINT );
  6975. VAR lval: LONGINT;
  6976. BEGIN
  6977. SYSTEM.GET( ladr, lval );
  6978. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6979. END AssignSLALLoop;
  6980. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6981. BEGIN
  6982. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6983. END ":=";
  6984. (** REAL *)
  6985. PROCEDURE AssignSRARLoop( ladr, dadr, dinc, len: LONGINT );
  6986. VAR lval: REAL;
  6987. BEGIN
  6988. SYSTEM.GET( ladr, lval );
  6989. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6990. END AssignSRARLoop;
  6991. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6992. BEGIN
  6993. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6994. END ":=";
  6995. (** LONGREAL *)
  6996. PROCEDURE AssignSXAXLoop( ladr, dadr, dinc, len: LONGINT );
  6997. VAR lval: LONGREAL;
  6998. BEGIN
  6999. SYSTEM.GET( ladr, lval );
  7000. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7001. END AssignSXAXLoop;
  7002. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7003. BEGIN
  7004. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7005. END ":=";
  7006. (** COMPLEX *)
  7007. PROCEDURE AssignSZAZLoop( ladr, dadr, dinc, len: LONGINT );
  7008. VAR lval: COMPLEX;
  7009. BEGIN
  7010. SYSTEM.GET( ladr, lval );
  7011. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7012. END AssignSZAZLoop;
  7013. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7014. BEGIN
  7015. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7016. END ":=";
  7017. (** LONGCOMPLEX *)
  7018. PROCEDURE AssignSLZALZLoop( ladr, dadr, dinc, len: LONGINT );
  7019. VAR lvalRe, lvalIm: LONGREAL;
  7020. BEGIN
  7021. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7022. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7023. END AssignSLZALZLoop;
  7024. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7025. BEGIN
  7026. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7027. END ":=";
  7028. (*** matrix multipliation ********************************************************************)
  7029. PROCEDURE AllocateMatrix( dest: Address;
  7030. rows, cols, elementsize: LONGINT ): ANY;
  7031. VAR p: ANY;
  7032. BEGIN
  7033. (*
  7034. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7035. *)
  7036. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  7037. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7038. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  7039. PutPtr( dest, SYSTEM.VAL( LONGINT, p ) ); RETURN p;
  7040. END AllocateMatrix;
  7041. PROCEDURE AllocateVector( dest: Address; l0, elementsize: LONGINT ): ANY;
  7042. VAR p: ANY;
  7043. BEGIN
  7044. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  7045. PutInc( dest, 0, elementsize ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  7046. PutPtr( dest, SYSTEM.VAL( LONGINT, p ) ); RETURN p;
  7047. END AllocateVector;
  7048. PROCEDURE ApplyMatMulLoop( dest, left, right: Address; Size: LONGINT;
  7049. loop: BinaryAASLoop;
  7050. fast: FastMatMul ); (* Size= element-size *)
  7051. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  7052. p: ANY; overlap: BOOLEAN; destOld, destNew: LONGINT;
  7053. BEGIN
  7054. (*
  7055. <- 1 ->
  7056. xxx xxxx -> xxxx
  7057. ^ xxx xxxx xxxx
  7058. 0 xxx xxxx xxxx
  7059. v xxx xxxx
  7060. xxx xxxx
  7061. Len(..,1): #columns ; Inc(..,1): inc in rows
  7062. Len(..,0): #rows ; Inc(..,0): inc between rows
  7063. *)
  7064. (* apply multiplication D = L * R *)
  7065. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7066. colsL := GetLen( left, 1 ); (* # left columns *)
  7067. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7068. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7069. (* check geometric restriction *)
  7070. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7071. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7072. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7073. IF RangeFlag IN GetFlags( dest ) THEN
  7074. Halt( GeometryMismatch, left, right, dest )
  7075. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7076. END;
  7077. END;
  7078. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7079. IF overlap THEN
  7080. destOld := dest; destNew := 0;
  7081. p := AllocateSame( destNew, destOld, Size );
  7082. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7083. dest := destNew;
  7084. END;
  7085. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7086. HALT( 9999 )
  7087. END;
  7088. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7089. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7090. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7091. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7092. (*
  7093. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7094. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7095. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7096. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7097. *)
  7098. IF rowsL = 0 THEN RETURN
  7099. ELSIF colsL=0 THEN RETURN
  7100. ELSIF colsR=0 THEN RETURN
  7101. ELSIF (fast = NIL ) OR
  7102. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7103. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7104. radri := radr; dadri := dadr; colsRi := colsR;
  7105. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7106. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7107. INC( dadri, incD ); DEC( colsRi );
  7108. END;
  7109. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7110. END;
  7111. END;
  7112. IF overlap THEN CopyContent( destOld, dest, Size );
  7113. END;
  7114. END ApplyMatMulLoop;
  7115. PROCEDURE ApplyMatVecMulLoop( dest, left, right: Address;
  7116. Size: LONGINT; loop: BinaryAASLoop;
  7117. fast: FastMatMul ); (* Size= element-size *)
  7118. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7119. overlap: BOOLEAN; destOld, destNew: LONGINT;
  7120. BEGIN
  7121. (*
  7122. <- 0 ->
  7123. xxx T(xxx) -> T(xxxxx)
  7124. xxx
  7125. 1 xxx
  7126. xxx
  7127. xxx
  7128. Len(..,0): #columns ; Inc(..,0): inc in rows
  7129. Len(..,1): #rows ; Inc(..,1): inc between rows
  7130. *)
  7131. (* check geometric restriction *)
  7132. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7133. Halt( GeometryMismatch, left, right,0 );
  7134. END;
  7135. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7136. l2 := GetLen( left, 1 ); (* inner loop len *)
  7137. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7138. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7139. IF RangeFlag IN GetFlags( dest ) THEN
  7140. Halt( GeometryMismatch, left, right, dest );
  7141. ELSE p := AllocateVector( dest, l1, Size );
  7142. END;
  7143. END;
  7144. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7145. IF overlap THEN
  7146. destOld := dest; destNew := 0;
  7147. p := AllocateSame( destNew, destOld, Size );
  7148. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7149. dest := destNew;
  7150. END;
  7151. (*
  7152. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7153. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7154. END;
  7155. *)
  7156. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7157. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7158. di0 := GetIncr( dest, 0 );
  7159. IF l1=0 THEN RETURN
  7160. ELSIF l2=0 THEN RETURN
  7161. ELSIF (fast = NIL ) OR
  7162. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7163. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7164. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7165. DEC( l1 );
  7166. END;
  7167. END;
  7168. IF overlap THEN CopyContent( destOld, dest, Size );
  7169. END;
  7170. END ApplyMatVecMulLoop;
  7171. PROCEDURE ApplyVecMatMulLoop( dest, left, right: Address;
  7172. Size: LONGINT; loop: BinaryAASLoop;
  7173. fast: FastMatMul ); (* Size= element-size *)
  7174. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7175. overlap: BOOLEAN; destOld, destNew: LONGINT;
  7176. BEGIN
  7177. (*
  7178. <- 0 ->
  7179. xxx xxxx -> xxxx
  7180. xxxx
  7181. 1 xxxx
  7182. Len(..,0): #columns ; Inc(..,0): inc in rows
  7183. Len(..,1): #rows ; Inc(..,1): inc between rows
  7184. *)
  7185. (* check geometric restriction *)
  7186. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7187. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7188. l2 := GetLen( right, 0 ); (* inner loop len *)
  7189. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7190. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7191. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7192. ELSE p := AllocateVector( dest, l0, Size );
  7193. END;
  7194. END;
  7195. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7196. IF overlap THEN
  7197. destOld := dest; destNew := 0;
  7198. p := AllocateSame( destNew, destOld, Size );
  7199. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7200. dest := destNew;
  7201. END;
  7202. (*
  7203. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7204. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7205. END;
  7206. *)
  7207. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7208. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7209. di0 := GetIncr( dest, 0 );
  7210. IF l2=0 THEN RETURN
  7211. ELSIF l0=0 THEN RETURN
  7212. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7213. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7214. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7215. DEC( l0 );
  7216. END;
  7217. END;
  7218. IF overlap THEN CopyContent( destOld, dest, Size );
  7219. END;
  7220. END ApplyVecMatMulLoop;
  7221. (** SHORTINT *)
  7222. PROCEDURE MatMulASASLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7223. VAR lval, rval, dval: SHORTINT;
  7224. BEGIN
  7225. dval := 0;
  7226. WHILE (len > 0) DO
  7227. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7228. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7229. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7230. END;
  7231. SYSTEM.PUT( dadr, dval );
  7232. END MatMulASASLoop;
  7233. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7234. BEGIN
  7235. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7236. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7237. RETURN RESULT
  7238. END "*";
  7239. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7240. BEGIN
  7241. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7242. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7243. RETURN RESULT
  7244. END "*";
  7245. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7246. BEGIN
  7247. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7248. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7249. RETURN RESULT
  7250. END "*";
  7251. (** INTEGER *)
  7252. PROCEDURE MatMulAIAILoop( ladr, radr, dadr, linc, rinc, len: Address );
  7253. VAR lval, rval, dval: INTEGER;
  7254. BEGIN
  7255. dval := 0;
  7256. WHILE (len > 0) DO
  7257. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7258. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7259. END;
  7260. SYSTEM.PUT( dadr, dval );
  7261. END MatMulAIAILoop;
  7262. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7263. BEGIN
  7264. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7265. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7266. RETURN RESULT
  7267. END "*";
  7268. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7269. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7270. BEGIN
  7271. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7272. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7273. RETURN RESULT
  7274. END "*";
  7275. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7276. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7277. BEGIN
  7278. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7279. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7280. RETURN RESULT
  7281. END "*";
  7282. (** LONGINT *)
  7283. PROCEDURE MatMulALALLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7284. VAR lval, rval, dval: LONGINT;
  7285. BEGIN
  7286. dval := 0;
  7287. WHILE (len > 0) DO
  7288. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7289. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7290. END;
  7291. SYSTEM.PUT( dadr, dval );
  7292. END MatMulALALLoop;
  7293. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7294. BEGIN
  7295. (*
  7296. KernelLog.String("MatMulALAL");
  7297. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7298. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7299. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7300. KernelLog.Ln;
  7301. *)
  7302. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7303. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7304. RETURN RESULT
  7305. END "*";
  7306. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7307. BEGIN
  7308. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7309. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7310. RETURN RESULT
  7311. END "*";
  7312. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7313. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7314. BEGIN
  7315. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7316. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7317. RETURN RESULT
  7318. END "*";
  7319. (** REAL *)
  7320. PROCEDURE MatMulARARLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7321. VAR lval, rval, dval: REAL;
  7322. BEGIN
  7323. dval := 0;
  7324. WHILE (len > 0) DO
  7325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7326. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7327. END;
  7328. SYSTEM.PUT( dadr, dval );
  7329. END MatMulARARLoop;
  7330. (*
  7331. Optimized for small matrices (Alexey Morozov)
  7332. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7333. *)
  7334. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7335. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7336. BEGIN
  7337. dadr := GetAdr(ADDRESSOF(RESULT));
  7338. ladr := GetAdr(ADDRESSOF(left));
  7339. radr := GetAdr(ADDRESSOF(right));
  7340. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7341. IF (ladr # dadr) & (radr # dadr) THEN
  7342. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7343. CASE SYSTEM.VAL(LONGINT,flags) OF
  7344. Mat2x2:
  7345. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7346. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7347. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7348. END;
  7349. END;
  7350. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7351. ELSE
  7352. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7353. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7354. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7355. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7356. END;
  7357. |Mat3x3:
  7358. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7359. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7360. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7361. END;
  7362. END;
  7363. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7364. ELSE
  7365. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7366. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7367. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7368. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7369. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7370. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7371. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7372. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7373. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7374. END;
  7375. |Mat4x4:
  7376. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7377. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7378. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7379. END;
  7380. END;
  7381. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7382. ELSE
  7383. 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];
  7384. 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];
  7385. 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];
  7386. 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];
  7387. 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];
  7388. 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];
  7389. 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];
  7390. 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];
  7391. 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];
  7392. 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];
  7393. 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];
  7394. 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];
  7395. 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];
  7396. 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];
  7397. 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];
  7398. 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];
  7399. END;
  7400. ELSE
  7401. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7402. loopMatMulARAR, matMulR );
  7403. END;
  7404. ELSE
  7405. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7406. loopMatMulARAR, matMulR );
  7407. END;
  7408. RETURN RESULT
  7409. END "*";
  7410. (*
  7411. Optimized for small arrays (Alexey Morozov)
  7412. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7413. *)
  7414. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7415. VAR
  7416. flags: SET; dadr, ladr, radr: LONGINT;
  7417. v0, v1, v2: REAL;
  7418. BEGIN
  7419. dadr := GetAdr(ADDRESSOF(RESULT));
  7420. ladr := GetAdr(ADDRESSOF(left));
  7421. radr := GetAdr(ADDRESSOF(right));
  7422. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7423. CASE SYSTEM.VAL(LONGINT,flags) OF
  7424. MatVec2x2:
  7425. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7426. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7427. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7428. END;
  7429. END;
  7430. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7431. ELSE
  7432. (* account possible overlapping *)
  7433. v0 := right[0];
  7434. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7435. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7436. END;
  7437. |MatVec3x3:
  7438. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7439. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7440. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7441. END;
  7442. END;
  7443. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7444. ELSE
  7445. (* account possible overlapping *)
  7446. v0 := right[0]; v1 := right[1];
  7447. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7448. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7449. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7450. END;
  7451. |MatVec4x4:
  7452. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7453. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7454. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7455. END;
  7456. END;
  7457. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7458. ELSE
  7459. (* account possible overlapping *)
  7460. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7461. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7462. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7463. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7464. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7465. END;
  7466. ELSE
  7467. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7468. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7469. END;
  7470. RETURN RESULT
  7471. END "*";
  7472. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7473. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7474. BEGIN
  7475. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7476. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7477. RETURN RESULT
  7478. END "*";
  7479. (** LONGREAL *)
  7480. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7481. VAR lval, rval, dval: LONGREAL;
  7482. BEGIN
  7483. dval := 0;
  7484. WHILE (len > 0) DO
  7485. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7486. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7487. END;
  7488. SYSTEM.PUT( dadr, dval );
  7489. END MatMulAXAXLoop;
  7490. (*
  7491. Optimized for small matrices (Alexey Morozov)
  7492. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7493. *)
  7494. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7495. VAR
  7496. flags: SET; dadr, ladr, radr: LONGINT;
  7497. BEGIN
  7498. dadr := GetAdr(ADDRESSOF(RESULT));
  7499. ladr := GetAdr(ADDRESSOF(left));
  7500. radr := GetAdr(ADDRESSOF(right));
  7501. IF (ladr # dadr) & (radr # dadr) THEN
  7502. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7503. CASE SYSTEM.VAL(LONGINT,flags) OF
  7504. Mat2x2:
  7505. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7506. IF dadr = 0 THEN NEW(RESULT,2,2);
  7507. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7508. END;
  7509. END;
  7510. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7511. ELSE
  7512. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7513. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7514. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7515. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7516. END;
  7517. |Mat3x3:
  7518. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7519. IF dadr = 0 THEN NEW(RESULT,3,3);
  7520. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7521. END;
  7522. END;
  7523. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7524. ELSE
  7525. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7526. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7527. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7528. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7529. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7530. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7531. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7532. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7533. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7534. END;
  7535. |Mat4x4:
  7536. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7537. IF dadr = 0 THEN NEW(RESULT,4,4);
  7538. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7539. END;
  7540. END;
  7541. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7542. ELSE
  7543. 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];
  7544. 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];
  7545. 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];
  7546. 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];
  7547. 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];
  7548. 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];
  7549. 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];
  7550. 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];
  7551. 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];
  7552. 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];
  7553. 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];
  7554. 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];
  7555. 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];
  7556. 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];
  7557. 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];
  7558. 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];
  7559. END;
  7560. ELSE
  7561. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7562. loopMatMulAXAX, matMulX );
  7563. END;
  7564. ELSE
  7565. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7566. loopMatMulAXAX, matMulX );
  7567. END;
  7568. RETURN RESULT
  7569. END "*";
  7570. (*
  7571. Optimized for small arrays (Alexey Morozov)
  7572. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7573. *)
  7574. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7575. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7576. VAR
  7577. flags: SET; dadr, ladr, radr: LONGINT;
  7578. v0, v1, v2: LONGREAL;
  7579. BEGIN
  7580. dadr := GetAdr(ADDRESSOF(RESULT));
  7581. ladr := GetAdr(ADDRESSOF(left));
  7582. radr := GetAdr(ADDRESSOF(right));
  7583. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7584. CASE SYSTEM.VAL(LONGINT,flags) OF
  7585. MatVec2x2:
  7586. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7587. IF dadr = 0 THEN NEW(RESULT,2);
  7588. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7589. END;
  7590. END;
  7591. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7592. ELSE
  7593. (* account possible overlapping *)
  7594. v0 := right[0];
  7595. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7596. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7597. END;
  7598. |MatVec3x3:
  7599. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7600. IF dadr = 0 THEN NEW(RESULT,3);
  7601. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7602. END;
  7603. END;
  7604. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7605. ELSE
  7606. (* account possible overlapping *)
  7607. v0 := right[0]; v1 := right[1];
  7608. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7609. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7610. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7611. END;
  7612. |MatVec4x4:
  7613. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7614. IF dadr = 0 THEN NEW(RESULT,4);
  7615. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7616. END;
  7617. END;
  7618. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7619. ELSE
  7620. (* account possible overlapping *)
  7621. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7622. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7623. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7624. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7625. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7626. END;
  7627. ELSE
  7628. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7629. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7630. END;
  7631. RETURN RESULT
  7632. END "*";
  7633. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7634. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7635. BEGIN
  7636. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7637. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7638. RETURN RESULT
  7639. END "*";
  7640. (** SHORTINT *)
  7641. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7642. VAR lval, rval, dval: SHORTINT;
  7643. BEGIN
  7644. SYSTEM.GET( dadr, dval );
  7645. WHILE (len > 0) DO
  7646. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7647. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7648. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7649. END;
  7650. SYSTEM.PUT( dadr, dval );
  7651. END MatMulIncASASLoop;
  7652. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7653. BEGIN
  7654. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7655. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7656. RETURN RESULT
  7657. END "@MulInc";
  7658. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7659. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7660. BEGIN
  7661. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7662. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7663. RETURN RESULT
  7664. END "@MulInc";
  7665. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7666. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7667. BEGIN
  7668. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7669. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7670. RETURN RESULT
  7671. END "@MulInc";
  7672. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7673. BEGIN
  7674. RESULT := -RESULT;
  7675. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7676. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7677. RESULT := -RESULT;
  7678. RETURN RESULT
  7679. END "@MulDec";
  7680. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7681. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7682. BEGIN
  7683. RESULT := -RESULT;
  7684. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7685. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7686. RESULT := -RESULT;
  7687. RETURN RESULT
  7688. END "@MulDec";
  7689. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7690. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7691. BEGIN
  7692. RESULT := -RESULT;
  7693. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7694. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7695. RESULT := -RESULT;
  7696. RETURN RESULT
  7697. END "@MulDec";
  7698. (** INTEGER *)
  7699. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr, linc, rinc, len: Address );
  7700. VAR lval, rval, dval: INTEGER;
  7701. BEGIN
  7702. SYSTEM.GET( dadr, dval );
  7703. WHILE (len > 0) DO
  7704. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7705. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7706. END;
  7707. SYSTEM.PUT( dadr, dval );
  7708. END MatMulIncAIAILoop;
  7709. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7710. BEGIN
  7711. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7712. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7713. RETURN RESULT
  7714. END "@MulInc";
  7715. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7716. BEGIN
  7717. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7718. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7719. RETURN RESULT
  7720. END "@MulInc";
  7721. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7722. BEGIN
  7723. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7724. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7725. RETURN RESULT
  7726. END "@MulInc";
  7727. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7728. BEGIN
  7729. RESULT := -RESULT;
  7730. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7731. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7732. RESULT := -RESULT;
  7733. RETURN RESULT
  7734. END "@MulDec";
  7735. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7736. BEGIN
  7737. RESULT := -RESULT;
  7738. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7739. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7740. RESULT := -RESULT;
  7741. RETURN RESULT
  7742. END "@MulDec";
  7743. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7744. BEGIN
  7745. RESULT := -RESULT;
  7746. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7747. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7748. RESULT := -RESULT;
  7749. RETURN RESULT
  7750. END "@MulDec";
  7751. (** LONGINT *)
  7752. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7753. VAR lval, rval, dval: LONGINT;
  7754. BEGIN
  7755. SYSTEM.GET( dadr, dval );
  7756. WHILE (len > 0) DO
  7757. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7758. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7759. END;
  7760. SYSTEM.PUT( dadr, dval );
  7761. END MatMulIncALALLoop;
  7762. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7763. BEGIN
  7764. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7765. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7766. RETURN RESULT
  7767. END "@MulInc";
  7768. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7769. BEGIN
  7770. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7771. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7772. RETURN RESULT
  7773. END "@MulInc";
  7774. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7775. BEGIN
  7776. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7777. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7778. RETURN RESULT
  7779. END "@MulInc";
  7780. OPERATOR "@MulDec"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7781. BEGIN
  7782. RESULT := -RESULT;
  7783. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7784. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7785. RESULT := -RESULT;
  7786. RETURN RESULT
  7787. END "@MulDec";
  7788. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7789. BEGIN
  7790. RESULT := -RESULT;
  7791. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7792. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7793. RESULT := -RESULT;
  7794. RETURN RESULT
  7795. END "@MulDec";
  7796. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7797. BEGIN
  7798. RESULT := -RESULT;
  7799. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7800. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7801. RESULT := -RESULT;
  7802. RETURN RESULT
  7803. END "@MulDec";
  7804. (** REAL *)
  7805. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7806. VAR lval, rval, dval: REAL;
  7807. BEGIN
  7808. SYSTEM.GET( dadr, dval );
  7809. WHILE (len > 0) DO
  7810. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7811. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7812. END;
  7813. SYSTEM.PUT( dadr, dval );
  7814. END MatMulIncARARLoop;
  7815. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7816. BEGIN
  7817. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7818. loopMatMulIncARAR, matMulIncR );
  7819. RETURN RESULT
  7820. END "@MulInc";
  7821. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7822. BEGIN
  7823. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7824. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7825. RETURN RESULT
  7826. END "@MulInc";
  7827. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7828. BEGIN
  7829. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7830. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7831. RETURN RESULT
  7832. END "@MulInc";
  7833. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7834. BEGIN
  7835. RESULT := -RESULT;
  7836. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7837. loopMatMulIncARAR, matMulIncR );
  7838. RESULT := -RESULT;
  7839. RETURN RESULT
  7840. END "@MulDec";
  7841. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7842. BEGIN
  7843. RESULT := -RESULT;
  7844. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7845. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7846. RESULT := -RESULT;
  7847. RETURN RESULT
  7848. END "@MulDec";
  7849. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7850. BEGIN
  7851. RESULT := -RESULT;
  7852. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7853. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7854. RESULT := -RESULT;
  7855. RETURN RESULT
  7856. END "@MulDec";
  7857. (** LONGREAL *)
  7858. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7859. VAR lval, rval, dval: LONGREAL;
  7860. BEGIN
  7861. SYSTEM.GET( dadr, dval );
  7862. WHILE (len > 0) DO
  7863. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7864. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7865. END;
  7866. SYSTEM.PUT( dadr, dval );
  7867. END MatMulIncAXAXLoop;
  7868. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7869. BEGIN
  7870. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7871. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7872. RETURN RESULT
  7873. END "@MulInc";
  7874. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7875. BEGIN
  7876. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7877. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7878. RETURN RESULT
  7879. END "@MulInc";
  7880. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7881. BEGIN
  7882. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7883. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7884. RETURN RESULT
  7885. END "@MulInc";
  7886. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7887. BEGIN
  7888. RESULT := -RESULT;
  7889. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7890. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7891. RESULT := -RESULT;
  7892. RETURN RESULT
  7893. END "@MulDec";
  7894. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7895. BEGIN
  7896. RESULT := -RESULT;
  7897. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7898. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7899. RESULT := -RESULT;
  7900. RETURN RESULT
  7901. END "@MulDec";
  7902. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7903. BEGIN
  7904. RESULT := -RESULT;
  7905. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7906. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7907. RESULT := -RESULT;
  7908. RETURN RESULT
  7909. END "@MulDec";
  7910. (*** Cross product ********************************************************************)
  7911. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7912. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7913. BEGIN
  7914. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7915. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7916. END;
  7917. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7918. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7919. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7920. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7921. RETURN RESULT
  7922. END "*";
  7923. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7924. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7925. BEGIN
  7926. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7927. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7928. END;
  7929. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7930. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7931. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7932. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7933. RETURN RESULT
  7934. END "*";
  7935. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7936. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7937. BEGIN
  7938. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7939. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7940. END;
  7941. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7942. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7943. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7944. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7945. RETURN RESULT
  7946. END "*";
  7947. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7948. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7949. BEGIN
  7950. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7951. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7952. END;
  7953. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7954. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7955. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7956. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7957. RETURN RESULT
  7958. END "*";
  7959. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7960. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7961. BEGIN
  7962. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7963. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7964. END;
  7965. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7966. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7967. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7968. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7969. RETURN RESULT
  7970. END "*";
  7971. (** Transpose ********************************************************************)
  7972. PROCEDURE Overlap( src1, src2: Address ): BOOLEAN;
  7973. VAR from1, from2, to1, to2: Address; dim: LONGINT;
  7974. BEGIN
  7975. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7976. dim := GetDim( src1 ) - 1;
  7977. WHILE (dim > 0) DO
  7978. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7979. END;
  7980. dim := GetDim( src2 ) - 1;
  7981. WHILE (dim > 0) DO
  7982. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7983. END;
  7984. IF from1 < from2 THEN RETURN to1 >= from2;
  7985. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7986. ELSE RETURN TRUE;
  7987. END;
  7988. END Overlap;
  7989. (*
  7990. PROCEDURE Overlap( src1, src2, dim: Address ): BOOLEAN;
  7991. VAR from1, from2, to1, to2: Address;
  7992. BEGIN
  7993. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7994. DEC( dim );
  7995. WHILE (dim > 0) DO
  7996. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  7997. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7998. END;
  7999. IF from1 < from2 THEN RETURN to1 >= from2;
  8000. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8001. ELSE RETURN TRUE;
  8002. END;
  8003. END Overlap;
  8004. *)
  8005. PROCEDURE AllocateTransposed( VAR dest: LONGINT; src: LONGINT;
  8006. elementsize: LONGINT ): ANY;
  8007. VAR ptr, data: ANY; Size: LONGINT;
  8008. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8009. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  8010. VAR dim,max: LONGINT;
  8011. BEGIN
  8012. dim := GetDim( l );
  8013. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8014. max := dim-1;
  8015. WHILE (dim > 0) DO
  8016. DEC( dim );
  8017. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8018. END;
  8019. RETURN TRUE;
  8020. END TransposedShape;
  8021. PROCEDURE UseDescriptor;
  8022. VAR tag: LONGINT;
  8023. BEGIN
  8024. SYSTEM.GET( src - 4, tag );
  8025. Heaps.NewRec( ptr, tag, FALSE );
  8026. dest := SYSTEM.VAL( LONGINT, ptr );
  8027. END UseDescriptor;
  8028. PROCEDURE NewData;
  8029. VAR max,dim, len, size: LONGINT;
  8030. BEGIN
  8031. dim := GetDim( src ); size := elementsize;
  8032. PutDim( dest, dim );
  8033. PutSize( dest, elementsize );
  8034. max := dim-1;
  8035. WHILE (dim > 0) DO
  8036. DEC( dim );
  8037. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8038. PutInc( dest, dim, size ); size := size * len;
  8039. END;
  8040. SYSTEM.NEW( data, size );
  8041. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8042. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) );
  8043. END NewData;
  8044. BEGIN
  8045. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8046. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8047. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8048. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  8049. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  8050. END;
  8051. PutFlags(dest, {TensorFlag});
  8052. NewData(); RETURN ptr;
  8053. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8054. (* check if re-allocation of descriptor is allowed *)
  8055. IF ~(TensorFlag IN GetFlags( dest )) &
  8056. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8057. HALT( 100 );
  8058. END;
  8059. UseDescriptor();
  8060. PutFlags(dest, {TensorFlag});
  8061. NewData(); RETURN ptr;
  8062. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8063. (* check if re-allocation of array data is allowed *)
  8064. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8065. HALT( 100 );
  8066. END;
  8067. NewData();
  8068. RETURN data;
  8069. ELSE (* nothing to do *)
  8070. RETURN NIL;
  8071. END;
  8072. END AllocateTransposed;
  8073. PROCEDURE Transpose*( dest, left: Address; Size: LONGINT );
  8074. VAR len0, len1, linc0, linc1, dinc0, dinc1, ladr, dadr: LONGINT; p: ANY;
  8075. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8076. BEGIN
  8077. WHILE (len > 0) DO
  8078. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8079. DEC( len );
  8080. END;
  8081. END CopyLoop;
  8082. BEGIN
  8083. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8084. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8085. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8086. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8087. ELSE
  8088. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8089. p := AllocateTransposed(dest,left,Size);
  8090. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8091. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8092. dadr := SYSTEM.VAL( LONGINT, p ); linc0 := GetIncr( left, 0 );
  8093. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8094. WHILE (len0 > 0) DO
  8095. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8096. INC( dadr, dinc0 ); DEC( len0 );
  8097. END;
  8098. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8099. ladr := SYSTEM.VAL( LONGINT, p );
  8100. ELSE
  8101. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8102. END;
  8103. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8104. dadr := GetAdr( dest );
  8105. IF (Size = 4) & (transpose4 # NIL ) THEN
  8106. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8107. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8108. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8109. ELSE
  8110. WHILE (len0 > 0) DO
  8111. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8112. INC( dadr, dinc1 ); DEC( len0 );
  8113. END;
  8114. END;
  8115. END;
  8116. END Transpose;
  8117. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8118. BEGIN
  8119. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8120. RETURN RESULT
  8121. END "`";
  8122. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8123. BEGIN
  8124. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8125. RETURN RESULT
  8126. END "`";
  8127. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8128. BEGIN
  8129. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8130. RETURN RESULT
  8131. END "`";
  8132. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8133. BEGIN
  8134. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8135. RETURN RESULT
  8136. END "`";
  8137. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8138. BEGIN
  8139. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8140. RETURN RESULT
  8141. END "`";
  8142. PROCEDURE CheckTensorGeometry( left, right, dest: Address; ldim, rdim: LONGINT ): BOOLEAN;
  8143. VAR i: LONGINT;
  8144. BEGIN
  8145. FOR i := 0 TO rdim - 1 DO
  8146. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8147. END;
  8148. FOR i := 0 TO ldim - 1 DO
  8149. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8150. END;
  8151. RETURN TRUE;
  8152. END CheckTensorGeometry;
  8153. (*
  8154. PROCEDURE Zero(p: ANY; size: LONGINT);
  8155. VAR adr: LONGINT;
  8156. BEGIN
  8157. adr := SYSTEM.VAL(LONGINT,p);
  8158. WHILE(size>0) DO
  8159. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8160. END;
  8161. END Zero;
  8162. *)
  8163. PROCEDURE DoReshape*( VAR dest: LONGINT; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8164. VAR i, Size: LONGINT; ptr, data: ANY; new: LONGINT;
  8165. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8166. squeezingReshape: BOOLEAN;
  8167. PROCEDURE NewDescriptor;
  8168. BEGIN
  8169. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8170. END NewDescriptor;
  8171. (* Added by Alexey
  8172. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8173. *)
  8174. PROCEDURE SqueezingReshape(): BOOLEAN;
  8175. VAR
  8176. i, j, n: LONGINT;
  8177. BEGIN
  8178. IF oldDim > newDim THEN
  8179. i := 0; j := 0;
  8180. WHILE (i < oldDim) & (j < newDim) DO
  8181. n := GetLen(src,i);
  8182. IF n = shape[j] THEN INC(j); END;
  8183. INC(i);
  8184. END;
  8185. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8186. ELSE
  8187. squeezingReshape := FALSE;
  8188. END;
  8189. squeezingReshape := (i = oldDim) & (j = newDim);
  8190. RETURN squeezingReshape;
  8191. END SqueezingReshape;
  8192. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8193. PROCEDURE TargetContinuous(): BOOLEAN;
  8194. VAR
  8195. i, n: LONGINT;
  8196. continue: BOOLEAN;
  8197. BEGIN
  8198. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8199. continue := TRUE;
  8200. WHILE (i > 0) & continue DO
  8201. n := n * GetLen(dest,i);
  8202. DEC(i);
  8203. continue := GetIncr(dest,i) = n;
  8204. END;
  8205. (*TRACE(i,continue,Size,GetSize(dest));*)
  8206. (*tod obviously size is not what I expect it to be*)
  8207. IF (i = 0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8208. RETURN TRUE;
  8209. ELSE
  8210. RETURN FALSE;
  8211. END;
  8212. END TargetContinuous;
  8213. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8214. PROCEDURE PreservesContiguity(): BOOLEAN;
  8215. VAR
  8216. i, n: LONGINT;
  8217. continue: BOOLEAN;
  8218. BEGIN
  8219. i := oldDim-1; n := GetIncr(src,i);
  8220. continue := TRUE;
  8221. WHILE (i > 0) & continue DO
  8222. n := n * GetLen(src,i);
  8223. DEC(i);
  8224. continue := GetIncr(src,i) = n;
  8225. END;
  8226. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8227. RETURN TRUE;
  8228. ELSE Err("Not yet implemented!");
  8229. END;
  8230. END PreservesContiguity;
  8231. (* Added by Alexey *)
  8232. PROCEDURE NewDescriptorForSameData;
  8233. VAR len, size, i, j: LONGINT;
  8234. BEGIN
  8235. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8236. IF ~squeezingReshape THEN
  8237. size := Size;
  8238. FOR i := newDim - 1 TO 0 BY -1 DO
  8239. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8240. size := size * len;
  8241. END;
  8242. ELSE (* squeezing reshape *)
  8243. j := 0; len := shape[j];
  8244. FOR i := 0 TO oldDim-1 DO
  8245. IF GetLen(src,i) = len THEN
  8246. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8247. INC(j);
  8248. IF j < newDim THEN len := shape[j]; END;
  8249. END;
  8250. END;
  8251. END;
  8252. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8253. PutFlags(new,GetFlags(new)+{RangeFlag});
  8254. END;
  8255. PutAdr( new, GetAdr(src) );
  8256. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8257. PutSize( new, Size );
  8258. END NewDescriptorForSameData;
  8259. PROCEDURE NewData;
  8260. VAR len, size, i: LONGINT;
  8261. BEGIN
  8262. size := Size;
  8263. FOR i := newDim - 1 TO 0 BY -1 DO
  8264. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8265. size := size * len;
  8266. END;
  8267. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8268. PutAdr( new, SYSTEM.VAL( LONGINT, data ) );
  8269. PutPtr( new, SYSTEM.VAL( LONGINT, data ) ); PutDim( new, newDim );
  8270. PutSize( new, Size );
  8271. END NewData;
  8272. PROCEDURE CopyData;
  8273. VAR d, s, dadr: LONGINT;
  8274. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8275. VAR inc, len, i: LONGINT;
  8276. BEGIN
  8277. IF dim = d THEN
  8278. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8279. FOR i := 0 TO len - 1 DO
  8280. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8281. END;
  8282. ELSE
  8283. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8284. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8285. END;
  8286. END Loop;
  8287. BEGIN
  8288. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8289. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8290. s := s * GetLen( src, d ); DEC( d );
  8291. END;
  8292. IF d = -1 THEN (* special case: both continuous *)
  8293. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8294. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8295. END;
  8296. END CopyData;
  8297. PROCEDURE CopyDataBack;
  8298. VAR d, s: LONGINT; sadr: LONGINT;
  8299. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8300. VAR inc, len, i: LONGINT;
  8301. BEGIN
  8302. IF dim = d THEN
  8303. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8304. FOR i := 0 TO len - 1 DO
  8305. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8306. END;
  8307. ELSE
  8308. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8309. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8310. END;
  8311. END Loop;
  8312. BEGIN
  8313. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8314. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8315. s := s * GetLen( dest, d ); DEC( d );
  8316. END;
  8317. IF d = -1 THEN (* special case: both continuous *)
  8318. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8319. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8320. END;
  8321. END CopyDataBack;
  8322. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8323. BEGIN
  8324. ASSERT( GetDim( src ) = GetDim( dest ) );
  8325. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8326. END CopyDescriptor;
  8327. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8328. VAR i: LONGINT;
  8329. BEGIN
  8330. ASSERT(GetDim(dest) = newDim);
  8331. FOR i := 0 TO newDim - 1 DO
  8332. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8333. END;
  8334. RETURN FALSE;
  8335. END ShapeDiffers;
  8336. BEGIN
  8337. (*
  8338. cases
  8339. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8340. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8341. 3.) descriptor may not be reshaped: dest = RANGE
  8342. *)
  8343. (* first check invariants *)
  8344. oldDim := GetDim( src );
  8345. IF oldDim = 0 THEN oldSize := 0
  8346. ELSE
  8347. oldSize := 1;
  8348. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8349. END;
  8350. newDim := LEN( shape, 0 );
  8351. IF newDim = 0 THEN newSize := 0
  8352. ELSE
  8353. newSize := 1;
  8354. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8355. END;
  8356. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8357. Size := GetSize( src );
  8358. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8359. IF dest = src THEN (* added by Alexey *)
  8360. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8361. NewDescriptorForSameData;
  8362. dest := new;
  8363. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8364. (* create a copy of the original descriptor *)
  8365. ptr := GetArrayDesc(newDim); dest := SYSTEM.VAL(LONGINT,ptr); CopyDescriptor(src,dest);
  8366. ELSE
  8367. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8368. END;
  8369. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8370. NewDescriptor; NewData; CopyData; dest := new;
  8371. ELSIF TargetContinuous() THEN
  8372. NewDescriptor; new:=dest; CopyData;
  8373. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8374. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8375. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8376. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8377. END;
  8378. NewDescriptor; NewData; CopyData; dest := new;
  8379. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8380. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8381. NewDescriptor; NewData; CopyData; CopyDescriptor( new, dest );
  8382. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8383. NewDescriptor; NewData; CopyData; CopyDataBack;
  8384. ELSE (* same shape, just copy *)
  8385. CopyContent( src, dest, Size ); RETURN;
  8386. END;
  8387. END DoReshape;
  8388. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: ADDRESS );
  8389. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8390. PROCEDURE NewData;
  8391. VAR len, size, i: LONGINT;
  8392. BEGIN
  8393. size := elementSize;
  8394. FOR i := dim - 1 TO 0 BY -1 DO
  8395. len := a[i];
  8396. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8397. END;
  8398. IF tag = 0 THEN
  8399. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8400. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8401. ELSE
  8402. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8403. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) + ArrDataArrayOffset );
  8404. END;
  8405. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) ); PutSize( dest, elementSize );
  8406. END NewData;
  8407. PROCEDURE ClearData;
  8408. (*! todo *)
  8409. END ClearData;
  8410. BEGIN
  8411. dim := LEN( a,0 );
  8412. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8413. IF dest # 0 THEN
  8414. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8415. END;
  8416. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8417. NewData;
  8418. ELSE
  8419. i := 0;
  8420. WHILE (i < dim) & same DO
  8421. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8422. INC( i );
  8423. END;
  8424. IF ~same THEN
  8425. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8426. NewData
  8427. ELSE ClearData
  8428. END;
  8429. END;
  8430. END AllocateTensorA;
  8431. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: ADDRESS );
  8432. BEGIN
  8433. AllocateTensorA(a,elementSize,tag,dest);
  8434. END AllocateArrayA;
  8435. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: LONGINT; tag: LONGINT );
  8436. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT; dest: Address;
  8437. PROCEDURE NewData;
  8438. VAR len, size, i: LONGINT;
  8439. BEGIN
  8440. size := Size;
  8441. FOR i := dim - 1 TO 0 BY -1 DO
  8442. len := a[i];
  8443. (*
  8444. KernelLog.Int(len,10); KernelLog.Ln;
  8445. *)
  8446. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8447. END;
  8448. IF tag = 0 THEN
  8449. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8450. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8451. ELSE
  8452. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8453. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) + ArrDataArrayOffset );
  8454. END;
  8455. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) ); PutSize( dest, Size );
  8456. END NewData;
  8457. PROCEDURE ClearData;
  8458. (*! todo *)
  8459. END ClearData;
  8460. BEGIN
  8461. dim := LEN( a,0 );
  8462. dest := SYSTEM.VAL(Address,destA);
  8463. (*! check range flag! *)
  8464. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8465. IF dest # 0 THEN
  8466. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8467. END;
  8468. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8469. NewData;
  8470. ELSE
  8471. i := 0;
  8472. WHILE (i < dim) & same DO
  8473. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8474. INC( i );
  8475. END;
  8476. IF ~same THEN
  8477. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8478. NewData
  8479. ELSE ClearData
  8480. END;
  8481. END;
  8482. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8483. END AllocateTensorX;
  8484. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF LONGINT; src: Address );
  8485. VAR dim, i: LONGINT;
  8486. BEGIN
  8487. dim := GetDim( src );
  8488. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8489. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8490. END LenA;
  8491. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF LONGINT; src: Address );
  8492. VAR dim, i, len: LONGINT;
  8493. BEGIN
  8494. dim := GetDim( src ); len := LEN( dest, 0 );
  8495. IF len # dim THEN NEW( dest, dim ); END;
  8496. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8497. END IncrA;
  8498. PROCEDURE Len*(src: Address; d: LONGINT): LONGINT;
  8499. VAR dim: LONGINT;
  8500. BEGIN
  8501. dim := GetDim(src);
  8502. IF (d<0) OR (d>=dim) THEN HALT(100)
  8503. ELSE
  8504. RETURN GetLen(src,d);
  8505. END;
  8506. END Len;
  8507. PROCEDURE Incr*(src: Address; d: LONGINT): LONGINT;
  8508. VAR dim: LONGINT;
  8509. BEGIN
  8510. dim := GetDim(src);
  8511. IF (d<0) OR (d>=dim) THEN HALT(100)
  8512. ELSE
  8513. RETURN GetIncr(src,d);
  8514. END;
  8515. END Incr;
  8516. PROCEDURE AllocateTensor( VAR dest: LONGINT; left, right: Address;
  8517. Size: LONGINT ): ANY;
  8518. VAR ldim, rdim: LONGINT; ptr, data: ANY;
  8519. PROCEDURE NewData;
  8520. VAR len, size, i: LONGINT;
  8521. BEGIN
  8522. size := 1;
  8523. FOR i := 0 TO ldim - 1 DO
  8524. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8525. END;
  8526. FOR i := 0 TO rdim - 1 DO
  8527. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8528. END;
  8529. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8530. (*
  8531. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8532. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8533. *)
  8534. size := Size;
  8535. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8536. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8537. END;
  8538. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8539. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) );
  8540. END NewData;
  8541. BEGIN
  8542. ldim := GetDim( left ); rdim := GetDim( right );
  8543. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8544. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8545. NewData(); RETURN ptr;
  8546. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8547. IF ~(TensorFlag IN GetFlags( dest )) &
  8548. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8549. HALT( 100 );
  8550. END;
  8551. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8552. NewData(); RETURN ptr;
  8553. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8554. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8555. HALT( 100 );
  8556. END;
  8557. NewData(); RETURN data;
  8558. END;
  8559. RETURN NIL;
  8560. END AllocateTensor;
  8561. (* 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 *)
  8562. PROCEDURE FindPatternTensor( left, right: Address;
  8563. VAR rdim, len, linc, ri: LONGINT );
  8564. (* geometric precondition: lengths must coincide *)
  8565. VAR ldim: LONGINT;
  8566. BEGIN
  8567. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8568. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8569. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8570. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8571. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8572. END;
  8573. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8574. DEC( ldim );
  8575. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8576. (GetIncr( right, rdim ) = len * ri) DO
  8577. len := len * GetLen( left, ldim );
  8578. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8579. DEC( ldim );
  8580. END;
  8581. INC( ldim ); INC( rdim );
  8582. IF debug THEN
  8583. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8584. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8585. END;
  8586. END FindPatternTensor;
  8587. PROCEDURE ApplyTensorAAAOp( d, l, r: Address; elementSize: LONGINT;
  8588. Loop: BinaryASALoop );
  8589. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8590. origdest: LONGINT; left, right, dest: Address;
  8591. PROCEDURE Traverse( ladr, radr, dadr: Address; ldim, rdim: LONGINT );
  8592. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8593. BEGIN
  8594. IF (ldim < lDim) THEN
  8595. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8596. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8597. WHILE (len > 0) DO
  8598. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8599. INC( dadr, dinc ); DEC( len );
  8600. END;
  8601. ELSIF (rdim # loopd) THEN
  8602. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8603. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8604. WHILE (len > 0) DO
  8605. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8606. INC( dadr, dinc ); DEC( len );
  8607. END;
  8608. ELSE
  8609. (*
  8610. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8611. KernelLog.Int(GetAdr(dest),10);
  8612. KernelLog.Int(GetAdr(dest)+clen,10);
  8613. KernelLog.Ln;
  8614. *)
  8615. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8616. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8617. END;
  8618. END Traverse;
  8619. BEGIN
  8620. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8621. (* check array lengths *)
  8622. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8623. p := AllocateTensor( dest, left, right, elementSize );
  8624. (*
  8625. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8626. p := AllocateTensor( left, right, dest, elementSize )
  8627. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8628. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8629. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8630. END;
  8631. (*! to be done: treat overlapping memory *)
  8632. END;
  8633. *)
  8634. (* debugging *)
  8635. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8636. (* check pattern: longest piece that can be done with a loop *)
  8637. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8638. (* run through dimensions *)
  8639. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8640. SYSTEM.PUT( d, dest );
  8641. END ApplyTensorAAAOp;
  8642. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8643. BEGIN
  8644. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8645. SIZEOF( SHORTINT ), MulASSSLoop );
  8646. RETURN RESULT
  8647. END "**";
  8648. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8649. BEGIN
  8650. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8651. SIZEOF( INTEGER ), MulAISILoop );
  8652. RETURN RESULT
  8653. END "**";
  8654. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8655. BEGIN
  8656. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8657. SIZEOF( LONGINT ), MulALSLLoop );
  8658. RETURN RESULT
  8659. END "**";
  8660. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8661. BEGIN
  8662. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8663. loopMulARSR );
  8664. RETURN RESULT
  8665. END "**";
  8666. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8667. BEGIN
  8668. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8669. SIZEOF( LONGREAL ), loopMulAXSX );
  8670. RETURN RESULT
  8671. END "**";
  8672. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8673. BEGIN
  8674. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8675. loopMulAZSZ );
  8676. RETURN RESULT
  8677. END "**";
  8678. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8679. BEGIN
  8680. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8681. loopMulALZSLZ );
  8682. RETURN RESULT
  8683. END "**";
  8684. PROCEDURE InitOptimization;
  8685. VAR p: PROCEDURE;
  8686. BEGIN
  8687. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8688. IF p # NIL THEN
  8689. p;
  8690. ELSE
  8691. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8692. END;
  8693. END InitOptimization;
  8694. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8695. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: Address;
  8696. BEGIN
  8697. IF src = 0 THEN
  8698. HALT(100);
  8699. ELSE
  8700. srcDim := GetDim(src);
  8701. destDim := srcDim - prefixIndices - suffixIndices;
  8702. (*
  8703. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8704. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8705. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8706. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8707. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8708. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8709. *)
  8710. destPtr := GetArrayDesc(destDim);
  8711. dest := SYSTEM.VAL(LONGINT,destPtr);
  8712. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8713. PutAdr(dest,GetAdr(src));
  8714. PutPtr(dest,GetPtr(src));
  8715. PutFlags(dest,GetFlags(src));
  8716. PutSize(dest,GetSize(src));
  8717. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8718. srcDim := i + prefixIndices + prefixRanges;
  8719. destDim := i + prefixRanges;
  8720. len := GetLen(src,srcDim);
  8721. incr := GetIncr(src,srcDim);
  8722. PutLen(dest,destDim,len);
  8723. PutInc(dest,destDim,incr);
  8724. END;
  8725. (*
  8726. Report("copy descriptor src",src);
  8727. Report("copy descriptor dest",dest);
  8728. *)
  8729. END;
  8730. END CopyDescriptor;
  8731. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8732. VAR dest: ARRAY [?] OF basetype
  8733. CONST src: ARRAY [?] OF basetype
  8734. CONST shape: ARRAY [*] OF LONGINT
  8735. *)
  8736. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8737. BEGIN
  8738. DoReshape(SYSTEM.VAL(LONGINT,RESULT), SYSTEM.VAL(LONGINT,left), right);
  8739. RETURN RESULT
  8740. END Reshape;
  8741. (* OLIVIER *)
  8742. (** creates a degenerated range from an integer.
  8743. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8744. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8745. **)
  8746. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8747. BEGIN RETURN (integer .. integer BY 1)
  8748. END RangeFromInteger;
  8749. (* OLIVIER *)
  8750. (** create an array with the same data but with more dimensions
  8751. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8752. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8753. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8754. e.g.:
  8755. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8756. performs the following type transformation:
  8757. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8758. **)
  8759. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8760. VAR
  8761. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8762. sourceAddress, targetAddress: LONGINT;
  8763. targetArrayDescriptor: ANY;
  8764. BEGIN
  8765. sourceAddress := SYSTEM.VAL(LONGINT, sourceArray);
  8766. targetDimensionality := LEN(keptDimensions, 0);
  8767. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8768. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8769. targetAddress := SYSTEM.VAL(LONGINT, RESULT);
  8770. PutAdr(targetAddress, GetAdr(sourceAddress));
  8771. PutPtr(targetAddress, GetPtr(sourceAddress));
  8772. PutFlags(targetAddress, {TensorFlag});
  8773. PutSize(targetAddress, GetSize(sourceAddress));
  8774. (* set increments and lengths *)
  8775. sourceIndex := 0;
  8776. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8777. IF keptDimensions[targetIndex] THEN
  8778. (* reuse length and increment from source array *)
  8779. ASSERT(sourceIndex < DIM(sourceArray));
  8780. PutLen(targetAddress, targetIndex, GetLen(sourceAddress, sourceIndex));
  8781. PutInc(targetAddress, targetIndex, GetIncr(sourceAddress, sourceIndex));
  8782. INC(sourceIndex)
  8783. ELSE
  8784. (* set length = 1 and increment = 0 *)
  8785. PutLen(targetAddress, targetIndex, 1);
  8786. PutInc(targetAddress, targetIndex, 0);
  8787. END
  8788. END;
  8789. (* Report("expand dimensions: ", targetAddress); *)
  8790. RETURN RESULT
  8791. END ExpandDimensions;
  8792. (* index ranges *)
  8793. (* the length of a range, i.e. the number of indices that it stands for *)
  8794. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8795. VAR
  8796. temp, result: LONGINT;
  8797. BEGIN
  8798. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8799. (* invalid range *)
  8800. result := 0
  8801. ELSIF LAST(range) = MAX(LONGINT) THEN
  8802. (* open-ended range *)
  8803. result := MAX(LONGINT)
  8804. ELSE
  8805. temp := 1 + LAST(range) - FIRST(range);
  8806. result := temp DIV STEP(range);
  8807. IF (temp MOD STEP(range)) # 0 THEN
  8808. INC(result)
  8809. END
  8810. END;
  8811. RETURN result
  8812. END "LEN";
  8813. (* complex numbers *)
  8814. OPERATOR "+"*(CONST left, right: COMPLEX): COMPLEX;
  8815. VAR result: COMPLEX;
  8816. BEGIN
  8817. RE(result) := RE(left) + RE(right);
  8818. IM(result) := IM(left) + IM(right);
  8819. RETURN result
  8820. END "+";
  8821. OPERATOR "+"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8822. VAR result: LONGCOMPLEX;
  8823. BEGIN
  8824. RE(result) := RE(left) + RE(right);
  8825. IM(result) := IM(left) + IM(right);
  8826. RETURN result
  8827. END "+";
  8828. OPERATOR "-"*(CONST left, right: COMPLEX): COMPLEX;
  8829. VAR result: COMPLEX;
  8830. BEGIN
  8831. RE(result) := RE(left) - RE(right);
  8832. IM(result) := IM(left) - IM(right);
  8833. RETURN result
  8834. END "-";
  8835. OPERATOR "-"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8836. VAR result: LONGCOMPLEX;
  8837. BEGIN
  8838. RE(result) := RE(left) - RE(right);
  8839. IM(result) := IM(left) - IM(right);
  8840. RETURN result
  8841. END "-";
  8842. OPERATOR "*"*(CONST left, right: COMPLEX): COMPLEX;
  8843. VAR result: COMPLEX;
  8844. BEGIN
  8845. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8846. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8847. RETURN result
  8848. END "*";
  8849. OPERATOR "*"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8850. VAR result: LONGCOMPLEX;
  8851. BEGIN
  8852. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8853. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8854. RETURN result
  8855. END "*";
  8856. OPERATOR "/"*(CONST left, right: COMPLEX): COMPLEX;
  8857. VAR result: COMPLEX; iDivisor: REAL;
  8858. BEGIN
  8859. iDivisor := 1.0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8860. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8861. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8862. RETURN result
  8863. END "/";
  8864. OPERATOR "/"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8865. VAR result: LONGCOMPLEX; iDivisor: LONGREAL;
  8866. BEGIN
  8867. iDivisor := 1.0D0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8868. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8869. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8870. RETURN result
  8871. END "/";
  8872. OPERATOR "ABS"*(CONST arg: COMPLEX): REAL;
  8873. BEGIN RETURN Math.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8874. END "ABS";
  8875. OPERATOR "ABS"*(CONST arg: LONGCOMPLEX): LONGREAL;
  8876. BEGIN RETURN MathL.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8877. END "ABS";
  8878. OPERATOR "~"*(CONST left: COMPLEX): COMPLEX;
  8879. BEGIN
  8880. RETURN RE(left) - IM(left) * IMAG
  8881. END "~";
  8882. OPERATOR "~"*(CONST left: LONGCOMPLEX): LONGCOMPLEX;
  8883. BEGIN
  8884. RETURN RE(left) - IM(left) * IMAG
  8885. END "~";
  8886. OPERATOR "<="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8887. OPERATOR ">="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8888. OPERATOR "<"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8889. OPERATOR ">"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8890. OPERATOR "<="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8891. OPERATOR ">="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8892. OPERATOR "<"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8893. OPERATOR ">"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8894. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8895. BEGIN
  8896. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8897. RETURN RESULT;
  8898. END "ALL";
  8899. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8900. BEGIN
  8901. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8902. RETURN RESULT;
  8903. END "ALL";
  8904. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8905. BEGIN
  8906. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8907. RETURN RESULT;
  8908. END "ALL";
  8909. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8910. BEGIN
  8911. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8912. RETURN RESULT;
  8913. END "ALL";
  8914. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8915. BEGIN
  8916. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8917. RETURN RESULT;
  8918. END "ALL";
  8919. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8920. BEGIN
  8921. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8922. RETURN RESULT;
  8923. END "ALL";
  8924. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8925. BEGIN
  8926. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8927. RETURN RESULT;
  8928. END "ALL";
  8929. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8930. BEGIN
  8931. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8932. RETURN RESULT;
  8933. END "ALL";
  8934. BEGIN
  8935. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8936. END FoxArrayBase.
  8937. Compiler.Compile FoxArrayBase.Mod ~
  8938. SystemTools.ListModules