FoxArrayBase.Mod 336 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155
  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=ADDRESS(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. Tensor = POINTER TO ArrayDescriptor;
  88. UnsafeArray*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  89. lens*: ARRAY 8 OF LenInc;
  90. END;
  91. A0 = RECORD(ArrayDescriptor) END;
  92. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  93. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  94. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  95. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  96. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  97. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  98. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  99. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  100. T0 = POINTER TO A0;
  101. T1 = POINTER TO A1;
  102. T2 = POINTER TO A2;
  103. T3 = POINTER TO A3;
  104. T4 = POINTER TO A4;
  105. T5 = POINTER TO A5;
  106. T6 = POINTER TO A6;
  107. T7 = POINTER TO A7;
  108. T8 = POINTER TO A8;
  109. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  110. SmallMatMul* = PROCEDURE(dadr, ladr, radr: LONGINT);
  111. VAR
  112. alloc*: LONGINT; (* statistics *)
  113. allocTemp*: LONGINT; (* statistics *)
  114. (* procedures that might be replaced by ASM methods *)
  115. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  116. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  117. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  118. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  119. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  120. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  121. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  122. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  123. transpose4*: TransposeP; transpose8*: TransposeP;
  124. (* optimizations for small arrays (Alexey Morozov) *)
  125. matMulR2x2*: SmallMatMul;
  126. matMulR3x3*: SmallMatMul;
  127. matMulR4x4*: SmallMatMul;
  128. matVecMulR2x2*: SmallMatMul;
  129. matVecMulR3x3*: SmallMatMul;
  130. matVecMulR4x4*: SmallMatMul;
  131. matMulLR2x2*: SmallMatMul;
  132. matMulLR3x3*: SmallMatMul;
  133. matMulLR4x4*: SmallMatMul;
  134. matVecMulLR2x2*: SmallMatMul;
  135. matVecMulLR3x3*: SmallMatMul;
  136. matVecMulLR4x4*: SmallMatMul;
  137. (*
  138. TensorTypePool: ARRAY 32 OF TensorType;
  139. *)
  140. PROCEDURE SetDefaults*; (* set standard procedures *)
  141. BEGIN
  142. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  143. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  144. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  145. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  146. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  147. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  148. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  149. loopIncMulAXSX := IncMulAXSXLoop;
  150. loopMatMulIncARAR := MatMulIncARARLoop;
  151. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  152. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  153. loopMulAZSZ := MulAZSZLoop;
  154. loopMulALZSLZ := MulALZSLZLoop;
  155. END SetDefaults;
  156. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  157. BEGIN
  158. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  159. END Err;
  160. (* get increment of dimension dim *)
  161. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  162. BEGIN{UNCHECKED}
  163. RETURN base.lens[dim].inc
  164. END GetIncr;
  165. (* set increment of dimension dim *)
  166. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  167. BEGIN{UNCHECKED}
  168. base.lens[dim].inc := val
  169. END PutInc;
  170. (* get length of dimension dim *)
  171. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): LONGINT;
  172. BEGIN{UNCHECKED}
  173. RETURN base.lens[dim].len
  174. END GetLen;
  175. (* set length of dimension dim *)
  176. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  177. BEGIN{UNCHECKED}
  178. base.lens[dim].len := val
  179. END PutLen;
  180. (* get data address *)
  181. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  182. BEGIN
  183. RETURN base.adr;
  184. END GetAdr;
  185. (* set data address *)
  186. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  187. BEGIN
  188. base.adr := value
  189. END PutAdr;
  190. (* get data base pointer (GC protection) *)
  191. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  192. BEGIN
  193. RETURN base.ptr;
  194. END GetPtr;
  195. (* set data base pointer (GC protection) *)
  196. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  197. BEGIN
  198. base.ptr := value
  199. END PutPtr;
  200. PROCEDURE GetSize( base: UnsafeArray ): LONGINT;
  201. BEGIN
  202. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  203. END GetSize;
  204. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  205. BEGIN
  206. base.elementSize := val
  207. END PutSize;
  208. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  209. VAR dim: LONGINT;
  210. BEGIN
  211. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  212. END GetDim;
  213. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  214. BEGIN
  215. RETURN base.flags
  216. END GetFlags;
  217. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  218. BEGIN
  219. base.dim := dim
  220. END PutDim;
  221. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  222. BEGIN
  223. base.flags := flags
  224. END PutFlags;
  225. (* report geometry of array passed via address s *)
  226. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: LONGINT );
  227. VAR i: LONGINT; dim: LONGINT;
  228. PROCEDURE Set( s: SET );
  229. VAR i: LONGINT; first: BOOLEAN;
  230. BEGIN
  231. KernelLog.String( "{" ); first := TRUE;
  232. FOR i := 31 TO 0 BY -1 DO
  233. IF i IN s THEN
  234. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  235. KernelLog.Int( i, 1 );
  236. END;
  237. END;
  238. KernelLog.String( "}" );
  239. END Set;
  240. BEGIN
  241. KernelLog.String( name );
  242. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  243. ELSE
  244. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  245. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  246. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  247. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  248. KernelLog.Ln; dim := GetDim( s );
  249. IF dim > 32 THEN dim := 0 END;
  250. FOR i := 0 TO dim - 1 DO
  251. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  252. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  253. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  254. END;
  255. (*
  256. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  257. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  258. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  259. *)
  260. END;
  261. END Report;
  262. PROCEDURE GetArrayDesc( dim: LONGINT ): ANY;
  263. VAR (* t: TensorType; *) ptr: Tensor;
  264. p0: T0;
  265. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  266. BEGIN
  267. (*
  268. IF dim < LEN( TensorTypePool ) THEN t := TensorTypePool[dim]
  269. ELSE NewTensorType( dim, t );
  270. END;
  271. Heaps.NewRec( ptr, t.tag );
  272. *)
  273. CASE dim OF
  274. |0: NEW(p0); ptr := p0;
  275. |1:NEW(p1); ptr := p1;
  276. |2:NEW(p2); ptr := p2;
  277. |3:NEW(p3); ptr := p3;
  278. |4:NEW(p4); ptr := p4;
  279. |5:NEW(p5); ptr := p5;
  280. |6:NEW(p6); ptr := p6;
  281. |7:NEW(p7); ptr := p7;
  282. |8:NEW(p8); ptr := p8;
  283. ELSE
  284. HALT(200)
  285. END;
  286. ptr.dim := dim;
  287. ptr.flags := {TensorFlag};
  288. RETURN ptr;
  289. END GetArrayDesc;
  290. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  291. VAR reason: ARRAY 64 OF CHAR;
  292. BEGIN
  293. IF left # 0 THEN Report( "Source operand ", left ) END;
  294. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  295. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  296. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  297. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  298. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  299. ELSE reason := "unknown";
  300. END;
  301. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  302. HALT( 400 );
  303. END Halt;
  304. (** patterns ********************************************************************)
  305. (* 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 *)
  306. PROCEDURE FindPattern1( left, dim: Address; VAR d, len, linc: LONGINT );
  307. BEGIN
  308. d := dim - 1; len := GetLen( left, d );
  309. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  310. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  311. linc := GetIncr( left, d ); DEC( d );
  312. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  313. len := len * GetLen( left, d ); DEC( d );
  314. END; (* find dimension where pattern does not work any more *)
  315. INC( d );
  316. IF debug THEN
  317. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  318. KernelLog.Ln;
  319. END;
  320. END FindPattern1;
  321. (* 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 *)
  322. PROCEDURE FindPattern2( left, right: Address; dim: LONGINT;
  323. VAR d, len, linc, ri: LONGINT );
  324. (* geometric precondition: lengths must coincide *)
  325. BEGIN
  326. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  327. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  328. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  329. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  330. len := len * GetLen( left, d ); DEC( d );
  331. END;
  332. INC( d );
  333. IF debug THEN
  334. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  335. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  336. END;
  337. END FindPattern2;
  338. (* 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 *)
  339. PROCEDURE FindPattern3( left, right, dest: Address; dim: LONGINT;
  340. VAR d, len, linc, ri, di: LONGINT );
  341. (* geometric precondition: lengths must coincide *)
  342. BEGIN
  343. d := dim - 1; len := GetLen( left, d );
  344. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  345. END;
  346. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  347. DEC( d );
  348. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  349. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  350. len := len * GetLen( left, d ); DEC( d );
  351. END;
  352. INC( d );
  353. IF debug THEN
  354. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  355. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  356. END;
  357. END FindPattern3;
  358. PROCEDURE Reverse( src: Address; dim: LONGINT );
  359. VAR d, sl, sr: LONGINT;
  360. BEGIN
  361. d := 0; sl := GetAdr( src );
  362. WHILE (d < dim) DO
  363. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  364. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  365. END;
  366. PutAdr( src, sl + sr );
  367. END Reverse;
  368. (* check if forward copy may be performed *)
  369. PROCEDURE CopyUpCompatible( dest, src: Address; VAR modes: SET );
  370. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  371. (* precondition: len(src,i)=len(dest,i) *)
  372. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  373. Sufficient (but not necessary) conditions:
  374. 1.) no overlap: src right < dest left or src left > dest right or
  375. 2.) same geometry and src left >= dest left
  376. same geometry if ginc(s)=ginc(d) with
  377. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  378. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  379. *)
  380. BEGIN
  381. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  382. dim := GetDim( src );
  383. WHILE (d < dim) DO
  384. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  385. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  386. END;
  387. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  388. ELSIF ((sr - sl) = (dr - dl)) THEN
  389. IF (sl = dl) THEN (* same memory region, both directions possible *)
  390. ELSIF (sl > dl) THEN
  391. EXCL( modes, down ) (* only copy up possible *)
  392. ELSE (*sl < dl*)
  393. EXCL( modes, up ) (* only copy down possible *)
  394. END;
  395. ELSE
  396. modes := modes - {down, up}; (* neither nor *)
  397. END;
  398. END CopyUpCompatible;
  399. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  400. Size: LONGINT ): ANY;
  401. (* allocate a temporary block containing both descriptor and data *)
  402. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  403. BEGIN
  404. HALT(100);
  405. (*
  406. IF statistics THEN INC( allocTemp ) END;
  407. d := 0; len := Size; dim := GetDim( src );
  408. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  409. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  410. dest := SYSTEM.VAL( LONGINT, p );
  411. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  412. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  413. FOR i := 0 TO dim - 1 DO
  414. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  415. len := len * GetLen( src, i );
  416. END;
  417. (* Report("allocdest",dest,dim); *)
  418. RETURN p;
  419. *)
  420. END AllocateTemp;
  421. (*** procedures to traverse arrays and apply operators *)
  422. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  423. PROCEDURE ApplyGenericUnaryAAOpS( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  424. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  425. origdest: LONGINT; modes: SET;
  426. dest, left: ADDRESS; dim: SIZE;
  427. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  428. VAR len: LONGINT; linc, dinc: LONGINT;
  429. BEGIN
  430. IF dim = loopd THEN
  431. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  432. IF conservative THEN INC( glen, looplen ) END;
  433. ELSE
  434. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  435. dinc := GetIncr( dest, dim ); INC( dim );
  436. WHILE (len > 0) DO
  437. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  438. END;
  439. END;
  440. END Traverse;
  441. BEGIN
  442. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  443. origdest := 0; modes := {up, down};
  444. (* allocate destination, if necessary *)
  445. p := AllocateSame( dest, left, elementSize );
  446. IF p = NIL THEN
  447. CopyUpCompatible( dest, left, modes );
  448. IF up IN modes THEN (* nothing to be done *)
  449. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  450. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  451. END;
  452. END;
  453. (* allocate destination, if necessary *)
  454. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  455. ELSIF CheckGeometry( left, dest, dim )
  456. END; *)
  457. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  458. (* check pattern: longest piece that can be done with a loop *)
  459. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  460. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  461. IF up IN modes THEN (* nothing to be done *)
  462. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  463. ELSE CopyContent( origdest, dest, elementSize );
  464. END;
  465. SYSTEM.PUT( d, dest );
  466. END ApplyGenericUnaryAAOpS;
  467. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  468. PROCEDURE ApplyGenericUnaryAAOpI( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  469. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  470. origdest: LONGINT; modes: SET;
  471. dest, left: ADDRESS; dim: SIZE;
  472. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  473. VAR len: LONGINT; linc, dinc: LONGINT;
  474. BEGIN
  475. IF dim = loopd THEN
  476. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  477. IF conservative THEN INC( glen, looplen ) END;
  478. ELSE
  479. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  480. dinc := GetIncr( dest, dim ); INC( dim );
  481. WHILE (len > 0) DO
  482. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  483. END;
  484. END;
  485. END Traverse;
  486. BEGIN
  487. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  488. origdest := 0; modes := {up, down};
  489. (* allocate destination, if necessary *)
  490. p := AllocateSame( dest, left, elementSize );
  491. IF p = NIL THEN
  492. CopyUpCompatible( dest, left, modes );
  493. IF up IN modes THEN (* nothing to be done *)
  494. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  495. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  496. END;
  497. END;
  498. (* allocate destination, if necessary *)
  499. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  500. ELSIF CheckGeometry( left, dest, dim )
  501. END; *)
  502. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  503. (* check pattern: longest piece that can be done with a loop *)
  504. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  505. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  506. IF up IN modes THEN (* nothing to be done *)
  507. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  508. ELSE CopyContent( origdest, dest, elementSize );
  509. END;
  510. SYSTEM.PUT( d, dest );
  511. END ApplyGenericUnaryAAOpI;
  512. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  513. PROCEDURE ApplyGenericUnaryAAOpL( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  514. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  515. origdest: LONGINT; modes: SET;
  516. dest, left: ADDRESS; dim: SIZE;
  517. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  518. VAR len: LONGINT; linc, dinc: LONGINT;
  519. BEGIN
  520. IF dim = loopd THEN
  521. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  522. IF conservative THEN INC( glen, looplen ) END;
  523. ELSE
  524. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  525. dinc := GetIncr( dest, dim ); INC( dim );
  526. WHILE (len > 0) DO
  527. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  528. END;
  529. END;
  530. END Traverse;
  531. BEGIN
  532. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  533. origdest := 0; modes := {up, down};
  534. (* allocate destination, if necessary *)
  535. p := AllocateSame( dest, left, elementSize );
  536. IF p = NIL THEN
  537. CopyUpCompatible( dest, left, modes );
  538. IF up IN modes THEN (* nothing to be done *)
  539. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  540. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  541. END;
  542. END;
  543. (* allocate destination, if necessary *)
  544. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  545. ELSIF CheckGeometry( left, dest, dim )
  546. END; *)
  547. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  548. (* check pattern: longest piece that can be done with a loop *)
  549. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  550. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  551. IF up IN modes THEN (* nothing to be done *)
  552. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  553. ELSE CopyContent( origdest, dest, elementSize );
  554. END;
  555. SYSTEM.PUT( d, dest );
  556. END ApplyGenericUnaryAAOpL;
  557. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  558. PROCEDURE ApplyGenericUnaryAAOpH( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  559. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  560. origdest: LONGINT; modes: SET;
  561. VAR dest, left: ADDRESS; dim: SIZE;
  562. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  563. VAR len: LONGINT; linc, dinc: LONGINT;
  564. BEGIN
  565. IF dim = loopd THEN
  566. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  567. IF conservative THEN INC( glen, looplen ) END;
  568. ELSE
  569. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  570. dinc := GetIncr( dest, dim ); INC( dim );
  571. WHILE (len > 0) DO
  572. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  573. DEC( len );
  574. END;
  575. END;
  576. END Traverse;
  577. BEGIN
  578. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  579. origdest := 0; modes := {up, down};
  580. (* allocate destination, if necessary *)
  581. p := AllocateSame( dest, left, elementSize );
  582. IF p = NIL THEN
  583. CopyUpCompatible( dest, left, modes );
  584. IF up IN modes THEN (* nothing to be done *)
  585. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  586. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  587. END;
  588. END;
  589. (*
  590. (* allocate destination, if necessary *)
  591. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  592. ELSIF CheckGeometry( left, dest, dim )
  593. END;
  594. *)
  595. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  596. (* check pattern: longest piece that can be done with a loop *)
  597. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  598. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  599. IF up IN modes THEN (* nothing to be done *)
  600. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  601. ELSE CopyContent( origdest, dest, elementSize );
  602. END;
  603. SYSTEM.PUT( d, dest );
  604. END ApplyGenericUnaryAAOpH;
  605. (** apply unary operator to array: array REAL -> array REAL *)
  606. PROCEDURE ApplyGenericUnaryAAOpR( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  607. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  608. origdest: LONGINT; modes: SET;
  609. dest, left: ADDRESS; dim: SIZE;
  610. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  611. VAR len: LONGINT; linc, dinc: LONGINT;
  612. BEGIN
  613. IF dim = loopd THEN
  614. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  615. IF conservative THEN INC( glen, looplen ) END;
  616. ELSE
  617. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  618. dinc := GetIncr( dest, dim ); INC( dim );
  619. WHILE (len > 0) DO
  620. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  621. END;
  622. END;
  623. END Traverse;
  624. BEGIN
  625. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  626. origdest := 0; modes := {up, down};
  627. (* allocate destination, if necessary *)
  628. p := AllocateSame( dest, left, elementSize );
  629. IF p = NIL THEN
  630. CopyUpCompatible( dest, left, modes );
  631. IF up IN modes THEN (* nothing to be done *)
  632. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  633. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  634. END;
  635. END;
  636. (* allocate destination, if necessary *)
  637. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  638. ELSIF CheckGeometry( left, dest, dim )
  639. END; *)
  640. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  641. (* check pattern: longest piece that can be done with a loop *)
  642. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  643. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  644. IF up IN modes THEN (* nothing to be done *)
  645. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  646. ELSE CopyContent( origdest, dest, elementSize );
  647. END;
  648. SYSTEM.PUT( d, dest );
  649. END ApplyGenericUnaryAAOpR;
  650. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  651. PROCEDURE ApplyGenericUnaryAAOpX( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  652. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  653. origdest: LONGINT; modes: SET;
  654. dest, left: ADDRESS; dim: SIZE;
  655. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  656. VAR len: LONGINT; linc, dinc: LONGINT;
  657. BEGIN
  658. IF dim = loopd THEN
  659. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  660. IF conservative THEN INC( glen, looplen ) END;
  661. ELSE
  662. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  663. dinc := GetIncr( dest, dim ); INC( dim );
  664. WHILE (len > 0) DO
  665. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  666. DEC( len );
  667. END;
  668. END;
  669. END Traverse;
  670. BEGIN
  671. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  672. origdest := 0; modes := {up, down};
  673. (* allocate destination, if necessary *)
  674. p := AllocateSame( dest, left, elementSize );
  675. IF p = NIL THEN
  676. CopyUpCompatible( dest, left, modes );
  677. IF up IN modes THEN (* nothing to be done *)
  678. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  679. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  680. END;
  681. END;
  682. (*
  683. (* allocate destination, if necessary *)
  684. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  685. ELSIF CheckGeometry( left, dest, dim )
  686. END;
  687. *)
  688. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  689. (* check pattern: longest piece that can be done with a loop *)
  690. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  691. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  692. IF up IN modes THEN (* nothing to be done *)
  693. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  694. ELSE CopyContent( origdest, dest, elementSize );
  695. END;
  696. SYSTEM.PUT( d, dest );
  697. END ApplyGenericUnaryAAOpX;
  698. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  699. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  700. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  701. origdest: LONGINT; modes: SET;
  702. dest, left: ADDRESS; dim: SIZE;
  703. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  704. VAR len: LONGINT; linc, dinc: LONGINT;
  705. BEGIN
  706. IF dim = loopd THEN
  707. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  708. IF conservative THEN INC( glen, looplen ) END;
  709. ELSE
  710. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  711. dinc := GetIncr( dest, dim ); INC( dim );
  712. WHILE (len > 0) DO
  713. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  714. DEC( len );
  715. END;
  716. END;
  717. END Traverse;
  718. BEGIN
  719. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  720. origdest := 0; modes := {up, down};
  721. (* allocate destination, if necessary *)
  722. p := AllocateSame( dest, left, elementSize );
  723. IF p = NIL THEN
  724. CopyUpCompatible( dest, left, modes );
  725. IF up IN modes THEN (* nothing to be done *)
  726. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  727. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  728. END;
  729. END;
  730. (*
  731. (* allocate destination, if necessary *)
  732. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  733. ELSIF CheckGeometry( left, dest, dim )
  734. END;
  735. *)
  736. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  737. (* check pattern: longest piece that can be done with a loop *)
  738. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  739. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  740. IF up IN modes THEN (* nothing to be done *)
  741. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  742. ELSE CopyContent( origdest, dest, elementSize );
  743. END;
  744. SYSTEM.PUT( d, dest );
  745. END ApplyGenericUnaryAAOpZ;
  746. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  747. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  748. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  749. origdest: LONGINT; modes: SET;
  750. dest, left: ADDRESS; dim: SIZE;
  751. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  752. VAR len: LONGINT; linc, dinc: LONGINT;
  753. BEGIN
  754. IF dim = loopd THEN
  755. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  756. IF conservative THEN INC( glen, looplen ) END;
  757. ELSE
  758. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  759. dinc := GetIncr( dest, dim ); INC( dim );
  760. WHILE (len > 0) DO
  761. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  762. DEC( len );
  763. END;
  764. END;
  765. END Traverse;
  766. BEGIN
  767. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  768. origdest := 0; modes := {up, down};
  769. (* allocate destination, if necessary *)
  770. p := AllocateSame( dest, left, elementSize );
  771. IF p = NIL THEN
  772. CopyUpCompatible( dest, left, modes );
  773. IF up IN modes THEN (* nothing to be done *)
  774. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  775. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  776. END;
  777. END;
  778. (*
  779. (* allocate destination, if necessary *)
  780. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  781. ELSIF CheckGeometry( left, dest, dim )
  782. END;
  783. *)
  784. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  785. (* check pattern: longest piece that can be done with a loop *)
  786. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  787. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  788. IF up IN modes THEN (* nothing to be done *)
  789. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  790. ELSE CopyContent( origdest, dest, elementSize );
  791. END;
  792. SYSTEM.PUT( d, dest );
  793. END ApplyGenericUnaryAAOpLZ;
  794. (** apply unary operator to array: array -> array *)
  795. PROCEDURE ApplyUnaryAAOp( d, l: Address; elementSize: LONGINT;
  796. Loop: UnaryAALoop );
  797. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  798. origdest: LONGINT; modes: SET;
  799. dest, left: ADDRESS; dim: SIZE;
  800. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  801. VAR len: LONGINT; linc, dinc: LONGINT;
  802. BEGIN
  803. IF dim = loopd THEN
  804. Loop( ladr, dadr, loopli, loopdi, looplen );
  805. IF conservative THEN INC( glen, looplen ) END;
  806. ELSE
  807. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  808. dinc := GetIncr( dest, dim ); INC( dim );
  809. WHILE (len > 0) DO
  810. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  811. DEC( len );
  812. END;
  813. END;
  814. END Traverse;
  815. BEGIN
  816. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  817. origdest := 0; modes := {up, down};
  818. (* allocate destination, if necessary *)
  819. p := AllocateSame( dest, left, elementSize );
  820. IF p = NIL THEN
  821. CopyUpCompatible( dest, left, modes );
  822. IF up IN modes THEN (* nothing to be done *)
  823. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  824. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  825. END;
  826. END;
  827. (*
  828. (* allocate destination, if necessary *)
  829. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  830. ELSIF CheckGeometry( left, dest, dim )
  831. END;
  832. *)
  833. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  834. (* check pattern: longest piece that can be done with a loop *)
  835. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  836. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  837. IF up IN modes THEN (* nothing to be done *)
  838. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  839. ELSE CopyContent( origdest, dest, elementSize );
  840. END;
  841. SYSTEM.PUT( d, dest );
  842. END ApplyUnaryAAOp;
  843. (** apply unary operator to array: array -> scalar *)
  844. PROCEDURE ApplyUnaryASOp( dest, l: Address; Loop: UnaryASLoop );
  845. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  846. VAR left, dim: LONGINT;
  847. PROCEDURE Traverse( dim: LONGINT; ladr: Address );
  848. VAR len: LONGINT; linc: LONGINT;
  849. BEGIN
  850. IF dim = loopd THEN
  851. Loop( ladr, dest, loopli, looplen );
  852. IF conservative THEN INC( glen, looplen ) END;
  853. ELSE
  854. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  855. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  856. END;
  857. END Traverse;
  858. BEGIN
  859. SYSTEM.GET( l, left ); dim := GetDim( left );
  860. IF debug THEN Report( "AS: left", left ); END;
  861. (* check pattern: longest piece that can be done with a loop *)
  862. IF conservative THEN glen := 0 END;
  863. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  864. IF conservative THEN
  865. looplen := 1;
  866. WHILE (dim > 0) DO
  867. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  868. END;
  869. ASSERT( looplen = glen );
  870. END;
  871. END ApplyUnaryASOp;
  872. (** apply unary operator to array: scalar -> array *)
  873. PROCEDURE ApplyUnarySAOp( d, right: Address; Loop: UnarySALoop );
  874. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  875. VAR dest, dim: LONGINT;
  876. PROCEDURE Traverse( dim: LONGINT; dadr: Address );
  877. VAR len: LONGINT; dinc: LONGINT;
  878. BEGIN
  879. IF dim = loopd THEN
  880. Loop( right, dadr, loopdi, looplen );
  881. IF conservative THEN INC( glen, looplen ) END;
  882. ELSE
  883. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  884. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  885. END;
  886. END Traverse;
  887. BEGIN
  888. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  889. IF debug THEN Report( "AS: dest", dest ); END;
  890. (* check pattern: longest piece that can be done with a loop *)
  891. IF conservative THEN glen := 0 END;
  892. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  893. IF conservative THEN
  894. looplen := 1;
  895. WHILE (dim > 0) DO
  896. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  897. END;
  898. ASSERT( looplen = glen );
  899. END;
  900. END ApplyUnarySAOp;
  901. (** apply binary operator : array x array -> array *)
  902. PROCEDURE ApplyBinaryAAAOp( d, l, r: Address; elementSize: LONGINT;
  903. Loop: BinaryAAALoop );
  904. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  905. origdest: LONGINT; modes: SET; left, right, dest: ADDRESS; dim: LONGINT;
  906. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: Address );
  907. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  908. BEGIN
  909. IF dim = loopd THEN
  910. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  911. IF conservative THEN INC( glen, looplen ) END;
  912. ELSE
  913. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  914. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  915. WHILE (len > 0) DO
  916. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  917. INC( dadr, dinc ); DEC( len );
  918. END;
  919. END;
  920. END Traverse;
  921. BEGIN
  922. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  923. (* allocate destination, if necessary *)
  924. IF ~SameShape( left, right ) THEN
  925. Halt( GeometryMismatch, left, right, 0 )
  926. END;
  927. origdest := 0; modes := {up, down};
  928. p := AllocateSame( dest, left, elementSize );
  929. IF p = NIL THEN
  930. CopyUpCompatible( dest, left, modes );
  931. CopyUpCompatible( dest, right, modes );
  932. IF up IN modes THEN (* nothing to be done *)
  933. ELSIF down IN modes THEN
  934. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  935. ELSE
  936. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  937. END;
  938. END;
  939. (* debugging *)
  940. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  941. (* check pattern: longest piece that can be done with a loop *)
  942. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  943. (* run through dimensions *)
  944. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  945. IF up IN modes THEN (* nothing to be done *)
  946. ELSIF down IN modes THEN
  947. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  948. ELSE CopyContent( origdest, dest, elementSize );
  949. END;
  950. SYSTEM.PUT( d, dest );
  951. END ApplyBinaryAAAOp;
  952. (** apply binary operator: array x scalar -> array *)
  953. PROCEDURE ApplyBinaryASAOp( d, l, right: Address;
  954. elementSize: LONGINT;
  955. Loop: BinaryASALoop );
  956. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  957. origdest: LONGINT; modes: SET; dest, left: ADDRESS; dim: SIZE;
  958. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  959. VAR len: LONGINT; linc, dinc: LONGINT;
  960. BEGIN
  961. IF dim = loopd THEN
  962. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  963. IF conservative THEN INC( glen, looplen ) END;
  964. ELSE
  965. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  966. dinc := GetIncr( dest, dim ); INC( dim );
  967. WHILE (len > 0) DO
  968. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  969. DEC( len );
  970. END;
  971. END;
  972. END Traverse;
  973. BEGIN
  974. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  975. (* allocate destination, if necessary *)
  976. origdest := 0; modes := {up, down};
  977. p := AllocateSame( dest, left, elementSize );
  978. IF p = NIL THEN
  979. CopyUpCompatible( dest, left, modes );
  980. IF up IN modes THEN (* nothing to be done *)
  981. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  982. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  983. END;
  984. END;
  985. (* debugging *)
  986. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  987. (* check pattern: longest piece that can be done with a loop *)
  988. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  989. (* run through dimensions *)
  990. IF conservative THEN glen := 0 END;
  991. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  992. IF conservative THEN
  993. looplen := 1;
  994. WHILE (dim > 0) DO
  995. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  996. END;
  997. ASSERT( looplen = glen );
  998. END;
  999. IF up IN modes THEN (* nothing to be done *)
  1000. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1001. ELSE CopyContent( origdest, dest, elementSize );
  1002. END;
  1003. SYSTEM.PUT( d, dest );
  1004. END ApplyBinaryASAOp;
  1005. (** apply binary operator: array x array -> scalar *)
  1006. PROCEDURE ApplyBinaryAASOp( dest, l, r: Address; Loop: BinaryAASLoop );
  1007. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1008. left, right, dim: LONGINT;
  1009. PROCEDURE Traverse( dim: LONGINT; ladr, radr: Address );
  1010. VAR len: LONGINT; linc, rinc: LONGINT;
  1011. BEGIN
  1012. IF dim = loopd THEN
  1013. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1014. IF conservative THEN INC( glen, looplen ) END;
  1015. ELSE
  1016. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1017. rinc := GetIncr( right, dim ); INC( dim );
  1018. WHILE (len > 0) DO
  1019. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1020. DEC( len );
  1021. END;
  1022. END;
  1023. END Traverse;
  1024. BEGIN
  1025. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1026. (* check array lengths *)
  1027. IF ~SameShape( left, right ) THEN
  1028. Halt( GeometryMismatch, left, right, 0 )
  1029. END;
  1030. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1031. (* check pattern: longest piece that can be done with a loop *)
  1032. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1033. (* run through dimensions *)
  1034. IF conservative THEN glen := 0 END;
  1035. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1036. IF conservative THEN
  1037. looplen := 1;
  1038. WHILE (dim > 0) DO
  1039. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1040. END;
  1041. ASSERT( looplen = glen );
  1042. END;
  1043. END ApplyBinaryAASOp;
  1044. (** special binary operator: array x array -> boolean *)
  1045. PROCEDURE ApplyBinaryAABOp( l, r: Address;
  1046. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1047. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1048. PROCEDURE Traverse( dim: LONGINT; ladr, radr: Address ): BOOLEAN;
  1049. VAR len: LONGINT; linc, rinc: LONGINT;
  1050. BEGIN
  1051. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1052. ELSE
  1053. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1054. rinc := GetIncr( right, dim ); INC( dim );
  1055. WHILE (len > 0) DO
  1056. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1057. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1058. END;
  1059. RETURN TRUE;
  1060. END;
  1061. END Traverse;
  1062. BEGIN
  1063. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1064. (* check array lengths *)
  1065. IF ~SameShape( left, right ) THEN
  1066. RETURN geometryMismatchDefault
  1067. END;
  1068. (* is destination already allocated? (might be a temporary result) *)
  1069. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1070. (* check pattern: longest piece that can be done with a loop *)
  1071. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1072. (* run through dimensions *)
  1073. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1074. END ApplyBinaryAABOp;
  1075. (** special binary operator: array x scalar -> boolean *)
  1076. PROCEDURE ApplyBinaryASBOp( l, right: Address;
  1077. Loop: BinaryASBLoop ): BOOLEAN;
  1078. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1079. PROCEDURE Traverse( dim: LONGINT; ladr: Address ): BOOLEAN;
  1080. VAR len: LONGINT; linc: LONGINT;
  1081. BEGIN
  1082. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1083. ELSE
  1084. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1085. WHILE (len > 0) DO
  1086. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1087. INC( ladr, linc ); DEC( len );
  1088. END;
  1089. RETURN TRUE;
  1090. END;
  1091. END Traverse;
  1092. BEGIN
  1093. SYSTEM.GET( l, left ); dim := GetDim( left );
  1094. IF debug THEN Report( "AAB:left", left ); END;
  1095. (* check pattern: longest piece that can be done with a loop *)
  1096. FindPattern1( left, dim, loopd, looplen, loopli );
  1097. (* run through dimensions *)
  1098. RETURN Traverse( 0, GetAdr( left ) );
  1099. END ApplyBinaryASBOp;
  1100. (**** operators *)
  1101. (*** copy *)
  1102. PROCEDURE Copy4( ladr, dadr, linc, dinc, len: LONGINT );
  1103. CODE {SYSTEM.i386}
  1104. MOV ECX, [EBP+ladr] ; ECX := ladr
  1105. MOV EDX, [EBP+dadr] ; EDX := dadr
  1106. MOV EBX, [EBP+len] ; EBX := len
  1107. start:
  1108. CMP EBX, 0 ;
  1109. JLE end ; WHILE EBX > 0 DO
  1110. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1111. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1112. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1113. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1114. DEC EBX ; DEC(EBX)
  1115. JMP start
  1116. end:
  1117. END Copy4;
  1118. PROCEDURE Copy2( ladr, dadr, linc, dinc, len: LONGINT );
  1119. CODE {SYSTEM.i386}
  1120. MOV ECX, [EBP+ladr] ; ECX := ladr
  1121. MOV EDX, [EBP+dadr] ; EDX := dadr
  1122. MOV EBX, [EBP+len] ; EBX := len
  1123. start:
  1124. CMP EBX, 0 ;
  1125. JLE end ; WHILE EBX > 0 DO
  1126. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1127. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1128. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1129. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1130. DEC EBX ; DEC(EBX)
  1131. JMP start
  1132. end:
  1133. END Copy2;
  1134. PROCEDURE Copy1( ladr, dadr, linc, dinc, len: LONGINT );
  1135. CODE {SYSTEM.i386}
  1136. MOV ECX, [EBP+ladr] ; ECX := ladr
  1137. MOV EDX, [EBP+dadr] ; EDX := dadr
  1138. MOV EBX, [EBP+len] ; EBX := len
  1139. start:
  1140. CMP EBX, 0 ;
  1141. JLE end ; WHILE EBX > 0 DO
  1142. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1143. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1144. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1145. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1146. DEC EBX ; DEC(EBX)
  1147. JMP start
  1148. end:
  1149. END Copy1;
  1150. PROCEDURE Copy8( ladr, dadr, linc, dinc, len: LONGINT );
  1151. CODE {SYSTEM.i386}
  1152. MOV ECX, [EBP+ladr] ; ECX := ladr
  1153. MOV EDX, [EBP+dadr] ; EDX := dadr
  1154. MOV EBX, [EBP+len] ; EBX := len
  1155. start:
  1156. CMP EBX, 0 ;
  1157. JLE end ; WHILE EBX > 0 DO
  1158. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1159. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1160. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1161. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1162. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1163. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1164. DEC EBX ; DEC(EBX)
  1165. JMP start
  1166. end:
  1167. END Copy8;
  1168. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1169. (** Correct move if overlap, might be important for some array operations,
  1170. do not use SYSTEM.MOVE. *)
  1171. CODE {SYSTEM.i386}
  1172. MOV ECX, [ESP] ; len
  1173. MOV EDI, [ESP+4] ; destadr
  1174. MOV ESI, [ESP+8] ; srcadr
  1175. CMP ESI, EDI
  1176. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1177. MOV EAX, ESI
  1178. ADD EAX, ECX
  1179. CMP EAX, EDI
  1180. JBE moveup ; no overlap, no problem, move up
  1181. MOV ESI, EAX
  1182. ADD EDI, ECX
  1183. DEC ESI
  1184. DEC EDI
  1185. STD ; move down since overlap occured
  1186. REP
  1187. MOVSB
  1188. JMP done
  1189. moveup:
  1190. CLD
  1191. MOV BL, CL
  1192. SHR ECX, 2
  1193. AND BL, 00000003H ; rest to move after 4 byte move
  1194. REP
  1195. MOVSD ; move 4 bytes each step
  1196. MOV CL, BL
  1197. REP
  1198. MOVSB ; move rest in one byte steps
  1199. done:
  1200. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1201. END MoveB;
  1202. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1203. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1204. origdest: ADDRESS; modes: SET; dim: LONGINT;
  1205. PROCEDURE Loop( ladr, dadr, linc, dinc, len: LONGINT );
  1206. BEGIN
  1207. IF (dinc = elementSize) & (linc = elementSize) THEN
  1208. MoveB( ladr, dadr, len * elementSize );
  1209. (*
  1210. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1211. *)
  1212. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1213. len := len * elementSize;
  1214. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1215. ELSIF elementSize = 1 THEN
  1216. Copy1( ladr, dadr, linc, dinc, len );
  1217. (*
  1218. WHILE (len > 0) DO
  1219. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1220. END;
  1221. *)
  1222. ELSIF elementSize = 2 THEN
  1223. Copy2( ladr, dadr, linc, dinc, len );
  1224. (*
  1225. WHILE (len > 0) DO
  1226. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1227. END;
  1228. *)
  1229. ELSIF elementSize = 4 THEN
  1230. Copy4( ladr, dadr, linc, dinc, len );
  1231. (*
  1232. WHILE (len > 0) DO
  1233. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1234. END;
  1235. *)
  1236. ELSIF elementSize = 8 THEN
  1237. Copy8( ladr, dadr, linc, dinc, len );
  1238. (*
  1239. WHILE (len > 0) DO
  1240. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1241. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1242. INC( dadr, dinc );
  1243. END;
  1244. *)
  1245. ELSE (* SYSTEM.MOVE is expensive ! *)
  1246. WHILE (len > 0) DO
  1247. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1248. INC( dadr, dinc );
  1249. END;
  1250. END;
  1251. END Loop;
  1252. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  1253. VAR len: LONGINT; linc, dinc: LONGINT;
  1254. BEGIN
  1255. IF dim = loopd THEN
  1256. Loop( ladr, dadr, loopli, loopdi, looplen );
  1257. IF conservative THEN INC( glen, looplen ) END;
  1258. ELSE
  1259. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1260. dinc := GetIncr( dest, dim ); INC( dim );
  1261. WHILE (len > 0) DO
  1262. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1263. DEC( len );
  1264. END;
  1265. END;
  1266. END Traverse;
  1267. BEGIN
  1268. dim := GetDim( src );
  1269. origdest := 0; modes := {up, down}; (* copy modes *)
  1270. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1271. CopyUpCompatible( dest, src, modes );
  1272. IF up IN modes THEN (* nothing to be done *)
  1273. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1274. Reverse( src, dim ); Reverse( dest, dim )
  1275. ELSE (* can only copy via double buffer *)
  1276. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1277. END;
  1278. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1279. END;
  1280. (* check pattern: longest piece that can be done with a loop *)
  1281. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1282. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1283. IF up IN modes THEN (* nothing to be done *)
  1284. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1285. ELSE CopyContent( origdest, dest, elementSize );
  1286. END;
  1287. END CopyContent;
  1288. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS;
  1289. elementsize: LONGINT ): ANY;
  1290. VAR ptr, data: ANY; Size: LONGINT;
  1291. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1292. PROCEDURE UseDescriptor;
  1293. VAR tag: LONGINT;
  1294. BEGIN
  1295. SYSTEM.GET( src - 4, tag );
  1296. Heaps.NewRec( ptr, tag, FALSE );
  1297. dest := SYSTEM.VAL( LONGINT, ptr );
  1298. END UseDescriptor;
  1299. PROCEDURE NewData;
  1300. VAR dim, len, size: LONGINT;
  1301. BEGIN
  1302. dim := GetDim( src ); size := elementsize;
  1303. PutDim( dest, dim );
  1304. PutSize( dest, elementsize );
  1305. WHILE (dim > 0) DO
  1306. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1307. PutInc( dest, dim, size ); size := size * len;
  1308. END;
  1309. SYSTEM.NEW( data, size );
  1310. PutAdr( dest, data);
  1311. PutPtr( dest, data );
  1312. END NewData;
  1313. BEGIN
  1314. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  1315. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1316. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1317. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  1318. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1319. END;
  1320. PutFlags(dest, {TensorFlag});
  1321. NewData(); RETURN ptr;
  1322. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1323. (* check if re-allocation of descriptor is allowed *)
  1324. IF ~(TensorFlag IN GetFlags( dest )) &
  1325. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1326. HALT( 100 );
  1327. END;
  1328. UseDescriptor();
  1329. PutFlags(dest, {TensorFlag});
  1330. NewData(); RETURN ptr;
  1331. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1332. (* check if re-allocation of array data is allowed *)
  1333. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1334. HALT( 100 );
  1335. END;
  1336. NewData();
  1337. RETURN data;
  1338. ELSE (* nothing to do *)
  1339. RETURN NIL;
  1340. END;
  1341. END AllocateSame;
  1342. PROCEDURE TempDescCopy( src: Address ): ANY;
  1343. VAR p: ANY; dim: LONGINT;
  1344. BEGIN
  1345. dim := GetDim( src ); SYSTEM.NEW( p, dim * 8 + MathLenOffset );
  1346. SYSTEM.MOVE( src, SYSTEM.VAL( LONGINT, p ), dim * 8 + MathLenOffset ); PutAdr( src, 0 );
  1347. PutPtr( src, NIL ); PutFlags( src, {} ); RETURN p;
  1348. END TempDescCopy;
  1349. PROCEDURE CopyArraySelf*( dest, src: Address; elementsize: LONGINT );
  1350. VAR p: ANY;
  1351. BEGIN
  1352. ASSERT( src = dest ); p := TempDescCopy( src );
  1353. CopyArray( dest, SYSTEM.VAL( LONGINT, p ), elementsize );
  1354. END CopyArraySelf;
  1355. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1356. VAR p: ANY; srcdim, destdim: LONGINT;
  1357. BEGIN
  1358. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1359. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1360. srcdim := GetDim(src);
  1361. destdim := GetDim(dest);
  1362. (*
  1363. Debugging.Stack("copy array");
  1364. *)
  1365. Report( "copy array source", src ); Report( "copy array des", dest );
  1366. HALT(100);
  1367. ELSIF src = dest THEN (* self copy *)
  1368. CopyArraySelf( dest, src, elementsize );
  1369. ELSE
  1370. p := AllocateSame( dest, src, elementsize );
  1371. CopyContent( dest, src, elementsize )
  1372. END;
  1373. END CopyArray;
  1374. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1375. BEGIN
  1376. dest := 0; CopyTensor( dest, src, elementsize );
  1377. END CopyTensorSelf;
  1378. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1379. elementsize: SIZE );
  1380. VAR p: ANY;
  1381. BEGIN
  1382. (* Report("dest",dest); Report("src",src); *)
  1383. IF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1384. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1385. CopyContent( dest, src, elementsize );
  1386. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1387. ELSE CopyContent( dest, src, elementsize )
  1388. END;
  1389. END CopyTensor;
  1390. (* copy descriptor of src to that of dest. If not existent then create.*)
  1391. PROCEDURE ShallowCopy*(VAR dest: Address; src: Address);
  1392. VAR ptr: ANY; flags: SET;
  1393. PROCEDURE UseTypeDescriptor;
  1394. VAR tag: LONGINT; ptr: ANY;
  1395. BEGIN
  1396. SYSTEM.GET( src + Heaps.TypeDescOffset, tag ); Heaps.NewRec( ptr, tag, FALSE );
  1397. dest := SYSTEM.VAL( LONGINT, ptr );
  1398. END UseTypeDescriptor;
  1399. PROCEDURE CopyDescriptor;
  1400. BEGIN
  1401. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(Address) * GetDim( src ) *2 );
  1402. END CopyDescriptor;
  1403. BEGIN
  1404. (*
  1405. KernelLog.String("ShallowCopy called with ");
  1406. KernelLog.Int(src,10); KernelLog.Int(dest,10);
  1407. KernelLog.Ln;
  1408. Report( "scopy source", src ); Report( "scopy dest", dest );
  1409. *)
  1410. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1411. IF TensorFlag IN GetFlags( src ) THEN UseTypeDescriptor();
  1412. ELSE
  1413. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr ); (* ??? *)
  1414. END;
  1415. CopyDescriptor();
  1416. PutFlags(dest, {TensorFlag});
  1417. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1418. flags := GetFlags(dest);
  1419. (* check if re-allocation of descriptor is allowed *)
  1420. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1421. Halt(DimensionMismatch,src,0,dest);
  1422. END;
  1423. (* create a new descriptor!!! (added by Alexey) *)
  1424. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1425. CopyDescriptor();
  1426. PutFlags(dest, flags);
  1427. ELSE
  1428. flags := GetFlags(dest);
  1429. (* check if re-allocation of array data is allowed *)
  1430. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1431. Halt(AllocationForbidden,src,0,dest);
  1432. END;
  1433. CopyDescriptor();
  1434. PutFlags(dest, flags);
  1435. END;
  1436. END ShallowCopy;
  1437. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1438. BEGIN
  1439. IF debug THEN
  1440. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1441. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1442. END;
  1443. SYSTEM.MOVE( src, dest, 2*SIZEOF(Address) ); (* adr and ptr *)
  1444. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(Address) * GetDim( src ) *2 ); (* lens and increments *)
  1445. END DescriptorCopy;
  1446. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1447. VAR s,d: LONGINT;
  1448. BEGIN
  1449. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1450. ShallowCopy(d,s);
  1451. SYSTEM.PUT(ADDRESSOF(dest),d);
  1452. END ZeroCopy;
  1453. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1454. BEGIN
  1455. ZeroCopy(src, RESULT);
  1456. RETURN RESULT
  1457. END "ALIAS";
  1458. PROCEDURE SameShape( l, r: LONGINT ): BOOLEAN;
  1459. VAR dim: LONGINT;
  1460. BEGIN
  1461. dim := GetDim( l );
  1462. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1463. WHILE (dim > 0) DO
  1464. DEC( dim );
  1465. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1466. END;
  1467. RETURN TRUE;
  1468. END SameShape;
  1469. (*
  1470. PROCEDURE ZeroCopyArray*( dest: Address; src: Address; elementsize: LONGINT );
  1471. (*
  1472. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1473. check if deep copy can be avoided and if so then do a shallow copy
  1474. *)
  1475. BEGIN
  1476. ASSERT( dest # 0 ); (* impossible *)
  1477. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1478. HALT( 100 );
  1479. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1480. (* must copy (and allocate) *)
  1481. CopyArray( dest, src, elementsize );
  1482. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1483. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1484. ELSE CopyContent( dest, src, elementsize )
  1485. END;
  1486. ELSE DescriptorCopy( src, dest )
  1487. END;
  1488. END ZeroCopyArray;
  1489. PROCEDURE ZeroCopyTensor*( VAR dest: Address; src: Address; elementsize: LONGINT );
  1490. (*
  1491. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1492. check if deep copy can be avoided and if so then do a shallow copy
  1493. *)
  1494. BEGIN
  1495. IF debug THEN
  1496. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1497. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1498. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1499. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1500. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1501. END;
  1502. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1503. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1504. ELSE
  1505. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1506. END;
  1507. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1508. (* must copy (and allocate) *)
  1509. CopyTensor( dest, src, elementsize );
  1510. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1511. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1512. ELSE
  1513. HALT( 100 ); (* copy forbidden *)
  1514. END;
  1515. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1516. DescriptorCopy( src, dest );
  1517. ELSE
  1518. HALT( 100 ); (* different shapes: not allowed *)
  1519. END;
  1520. END ZeroCopyTensor;
  1521. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1522. VAR i: LONGINT;
  1523. BEGIN
  1524. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1525. CopyContent( dest, left, elementSize )
  1526. ELSE
  1527. IF debug THEN
  1528. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1529. KernelLog.Ln;
  1530. END;
  1531. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1532. FOR i := 0 TO dim - 1 DO
  1533. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1534. END;
  1535. END;
  1536. END ZeroCopy;
  1537. *)
  1538. (*** conversions ****)
  1539. (** SHORTINT -> INTEGER *)
  1540. PROCEDURE ConvertASAILoop( ladr, dadr, linc, dinc, len: LONGINT );
  1541. BEGIN
  1542. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1543. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1544. DEC( len );
  1545. END;
  1546. END ConvertASAILoop;
  1547. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1548. BEGIN
  1549. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1550. RETURN RESULT
  1551. END "@Convert";
  1552. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1553. BEGIN
  1554. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1555. RETURN RESULT
  1556. END "LONG";
  1557. (** SHORTINT -> LONGINT *)
  1558. PROCEDURE ConvertLoopSL( ladr, dadr, linc, dinc, len: LONGINT );
  1559. BEGIN
  1560. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1561. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1562. DEC( len );
  1563. END;
  1564. END ConvertLoopSL;
  1565. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1566. BEGIN
  1567. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1568. RETURN RESULT
  1569. END "@Convert";
  1570. (** SHORTINT -> REAL *)
  1571. PROCEDURE ConvertLoopSR( ladr, dadr, linc, dinc, len: LONGINT );
  1572. VAR lval: SHORTINT; dval: REAL;
  1573. BEGIN
  1574. WHILE (len > 0) DO
  1575. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1576. INC( dadr, dinc ); DEC( len );
  1577. END;
  1578. END ConvertLoopSR;
  1579. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1580. BEGIN
  1581. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1582. RETURN RESULT
  1583. END "@Convert";
  1584. (** SHORTINT -> LONGREAL *)
  1585. PROCEDURE ConvertLoopSX( ladr, dadr, linc, dinc, len: LONGINT );
  1586. VAR lval: SHORTINT; dval: LONGREAL;
  1587. BEGIN
  1588. WHILE (len > 0) DO
  1589. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1590. INC( dadr, dinc ); DEC( len );
  1591. END;
  1592. END ConvertLoopSX;
  1593. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1594. BEGIN
  1595. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1596. RETURN RESULT
  1597. END "@Convert";
  1598. (** INTEGER -> SHORTINT (SHORT) *)
  1599. PROCEDURE ConvertLoopIS( ladr, dadr, linc, dinc, len: LONGINT );
  1600. VAR lval: INTEGER; dval: SHORTINT;
  1601. BEGIN
  1602. WHILE (len > 0) DO
  1603. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1604. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1605. END;
  1606. END ConvertLoopIS;
  1607. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1608. BEGIN
  1609. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1610. RETURN RESULT
  1611. END "@Convert";
  1612. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1613. BEGIN
  1614. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1615. RETURN RESULT
  1616. END "SHORT";
  1617. (** INTEGER -> LONGINT *)
  1618. PROCEDURE ConvertLoopIL( ladr, dadr, linc, dinc, len: LONGINT );
  1619. BEGIN
  1620. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1621. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1622. DEC( len );
  1623. END;
  1624. END ConvertLoopIL;
  1625. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1626. BEGIN
  1627. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1628. RETURN RESULT
  1629. END "@Convert";
  1630. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1631. BEGIN
  1632. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1633. RETURN RESULT
  1634. END "LONG";
  1635. (** INTEGER -> REAL *)
  1636. PROCEDURE ConvertLoopIR( ladr, dadr, linc, dinc, len: LONGINT );
  1637. VAR lval: INTEGER; dval: REAL;
  1638. BEGIN
  1639. WHILE (len > 0) DO
  1640. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1641. INC( dadr, dinc ); DEC( len );
  1642. END;
  1643. END ConvertLoopIR;
  1644. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1645. BEGIN
  1646. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1647. RETURN RESULT
  1648. END "@Convert";
  1649. (** INTEGER -> LONGREAL *)
  1650. PROCEDURE ConvertLoopIX( ladr, dadr, linc, dinc, len: LONGINT );
  1651. VAR lval: INTEGER; dval: LONGREAL;
  1652. BEGIN
  1653. WHILE (len > 0) DO
  1654. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1655. INC( dadr, dinc ); DEC( len );
  1656. END;
  1657. END ConvertLoopIX;
  1658. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1659. BEGIN
  1660. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1661. RETURN RESULT
  1662. END "@Convert";
  1663. (** LONGINT -> INTEGER (SHORT) *)
  1664. PROCEDURE ConvertLoopLI( ladr, dadr, linc, dinc, len: LONGINT );
  1665. VAR lval: LONGINT; dval: INTEGER;
  1666. BEGIN
  1667. WHILE (len > 0) DO
  1668. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1669. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1670. END;
  1671. END ConvertLoopLI;
  1672. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1673. BEGIN
  1674. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1675. RETURN RESULT
  1676. END "@Convert";
  1677. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1678. BEGIN
  1679. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1680. RETURN RESULT
  1681. END "SHORT";
  1682. (** LONGINT -> REAL *)
  1683. PROCEDURE ConvertLoopLR( ladr, dadr, linc, dinc, len: LONGINT );
  1684. VAR lval: LONGINT; dval: REAL;
  1685. BEGIN
  1686. WHILE (len > 0) DO
  1687. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1688. INC( dadr, dinc ); DEC( len );
  1689. END;
  1690. END ConvertLoopLR;
  1691. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1692. BEGIN
  1693. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1694. RETURN RESULT
  1695. END "@Convert";
  1696. (** LONGINT -> LONGREAL *)
  1697. PROCEDURE ConvertLoopLX( ladr, dadr, linc, dinc, len: LONGINT );
  1698. VAR lval: LONGINT; dval: LONGREAL;
  1699. BEGIN
  1700. WHILE (len > 0) DO
  1701. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1702. INC( dadr, dinc ); DEC( len );
  1703. END;
  1704. END ConvertLoopLX;
  1705. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1706. BEGIN
  1707. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1708. RETURN RESULT
  1709. END "@Convert";
  1710. (** REAL -> LONGINT (ENTIER) *)
  1711. PROCEDURE ConvertLoopRL( ladr, dadr, linc, dinc, len: LONGINT );
  1712. VAR lval: REAL; dval: LONGINT;
  1713. BEGIN
  1714. WHILE (len > 0) DO
  1715. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1716. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1717. END;
  1718. END ConvertLoopRL;
  1719. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1720. BEGIN
  1721. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1722. RETURN RESULT
  1723. END "@Convert";
  1724. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1725. BEGIN
  1726. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1727. RETURN RESULT
  1728. END "ENTIER";
  1729. (** REAL -> LONGREAL *)
  1730. PROCEDURE ConvertLoopRX( ladr, dadr, linc, dinc, len: LONGINT );
  1731. VAR lval: REAL; dval: LONGREAL;
  1732. BEGIN
  1733. WHILE (len > 0) DO
  1734. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1735. INC( dadr, dinc ); DEC( len );
  1736. END;
  1737. END ConvertLoopRX;
  1738. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1739. BEGIN
  1740. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1741. RETURN RESULT
  1742. END "@Convert";
  1743. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1744. BEGIN
  1745. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1746. RETURN RESULT
  1747. END "LONG";
  1748. (** LONGREAL -> REAL (SHORT) *)
  1749. PROCEDURE ConvertLoopXR( ladr, dadr, linc, dinc, len: LONGINT );
  1750. VAR lval: LONGREAL; dval: REAL;
  1751. BEGIN
  1752. WHILE (len > 0) DO
  1753. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1754. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1755. END;
  1756. END ConvertLoopXR;
  1757. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1758. BEGIN
  1759. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1760. RETURN RESULT
  1761. END "@Convert";
  1762. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1763. BEGIN
  1764. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1765. RETURN RESULT
  1766. END "SHORT";
  1767. (** LONGREAL -> LONGINT (ENTIER) *)
  1768. PROCEDURE ConvertLoopXL( ladr, dadr, linc, dinc, len: LONGINT );
  1769. VAR lval: LONGREAL; dval: LONGINT;
  1770. BEGIN
  1771. WHILE (len > 0) DO
  1772. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1773. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1774. END;
  1775. END ConvertLoopXL;
  1776. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1777. BEGIN
  1778. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1779. RETURN RESULT
  1780. END "@Convert";
  1781. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1782. BEGIN
  1783. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1784. RETURN RESULT
  1785. END "ENTIER";
  1786. (*** monadic not A -> ~A ********************************************************************)
  1787. (** BOOLEAN *)
  1788. PROCEDURE NotLoopAB( ladr, dadr, linc, dinc, len: LONGINT );
  1789. VAR lval: BOOLEAN;
  1790. BEGIN
  1791. WHILE (len > 0) DO
  1792. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1793. DEC( len );
  1794. END;
  1795. END NotLoopAB;
  1796. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1797. BEGIN
  1798. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1799. RETURN RESULT
  1800. END "~";
  1801. (*** monadic generic (A) -> -A ********************************************************************)
  1802. (** SHORTINT *)
  1803. PROCEDURE GenericLoopS( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1804. VAR lval: SHORTINT;
  1805. BEGIN
  1806. WHILE (len > 0) DO
  1807. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1808. DEC( len );
  1809. END;
  1810. END GenericLoopS;
  1811. (** INTEGER *)
  1812. PROCEDURE GenericLoopI( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: INTEGER): INTEGER );
  1813. VAR lval: INTEGER;
  1814. BEGIN
  1815. WHILE (len > 0) DO
  1816. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1817. DEC( len );
  1818. END;
  1819. END GenericLoopI;
  1820. (** LONGINT *)
  1821. PROCEDURE GenericLoopL( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGINT): LONGINT );
  1822. VAR lval: LONGINT;
  1823. BEGIN
  1824. WHILE (len > 0) DO
  1825. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1826. DEC( len );
  1827. END;
  1828. END GenericLoopL;
  1829. (** HUGEINT *)
  1830. PROCEDURE GenericLoopH( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1831. VAR lval: HUGEINT;
  1832. BEGIN
  1833. WHILE (len > 0) DO
  1834. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1835. DEC( len );
  1836. END;
  1837. END GenericLoopH;
  1838. (** REAL *)
  1839. PROCEDURE GenericLoopR( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: REAL): REAL );
  1840. VAR lval: REAL;
  1841. BEGIN
  1842. WHILE (len > 0) DO
  1843. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1844. DEC( len );
  1845. END;
  1846. END GenericLoopR;
  1847. (** LONGREAL *)
  1848. PROCEDURE GenericLoopX( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1849. VAR lval: LONGREAL;
  1850. BEGIN
  1851. WHILE (len > 0) DO
  1852. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1853. DEC( len );
  1854. END;
  1855. END GenericLoopX;
  1856. (** COMPLEX *)
  1857. PROCEDURE GenericLoopZ( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1858. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1859. BEGIN
  1860. WHILE (len > 0) DO
  1861. lval := ladr;
  1862. dval := dadr;
  1863. dval.val := op(lval.val);
  1864. INC( ladr, linc ); INC( dadr, dinc );
  1865. DEC( len );
  1866. END;
  1867. END GenericLoopZ;
  1868. (** LONGCOMPLEX *)
  1869. PROCEDURE GenericLoopLZ( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1870. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1871. BEGIN
  1872. WHILE (len > 0) DO
  1873. lval := ladr;
  1874. dval := dadr;
  1875. dval.val := op (lval.val);
  1876. INC( ladr, linc ); INC( dadr, dinc );
  1877. DEC( len );
  1878. END;
  1879. END GenericLoopLZ;
  1880. (*** monadic minus A -> -A ********************************************************************)
  1881. (** SHORTINT *)
  1882. PROCEDURE MinusLoopS( ladr, dadr, linc, dinc, len: LONGINT );
  1883. VAR lval: SHORTINT;
  1884. BEGIN
  1885. WHILE (len > 0) DO
  1886. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1887. DEC( len );
  1888. END;
  1889. END MinusLoopS;
  1890. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1891. BEGIN
  1892. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1893. RETURN RESULT
  1894. END "-";
  1895. (** INTEGER *)
  1896. PROCEDURE MinusLoopI( ladr, dadr, linc, dinc, len: LONGINT );
  1897. VAR lval: INTEGER;
  1898. BEGIN
  1899. WHILE (len > 0) DO
  1900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1901. DEC( len );
  1902. END;
  1903. END MinusLoopI;
  1904. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1905. BEGIN
  1906. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1907. RETURN RESULT
  1908. END "-";
  1909. (** LONGINT *)
  1910. PROCEDURE MinusLoopL( ladr, dadr, linc, dinc, len: LONGINT );
  1911. VAR lval: LONGINT;
  1912. BEGIN
  1913. WHILE (len > 0) DO
  1914. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1915. DEC( len );
  1916. END;
  1917. END MinusLoopL;
  1918. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1919. BEGIN
  1920. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1921. RETURN RESULT
  1922. END "-";
  1923. (** REAL *)
  1924. PROCEDURE MinusLoopR( ladr, dadr, linc, dinc, len: LONGINT );
  1925. VAR lval: REAL;
  1926. BEGIN
  1927. WHILE (len > 0) DO
  1928. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1929. DEC( len );
  1930. END;
  1931. END MinusLoopR;
  1932. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1933. BEGIN
  1934. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1935. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1936. RETURN RESULT
  1937. END "-";
  1938. (** LONGREAL *)
  1939. PROCEDURE MinusLoopX( ladr, dadr, linc, dinc, len: LONGINT );
  1940. VAR lval: LONGREAL;
  1941. BEGIN
  1942. WHILE (len > 0) DO
  1943. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1944. DEC( len );
  1945. END;
  1946. END MinusLoopX;
  1947. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1948. BEGIN
  1949. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1950. MinusLoopX );
  1951. RETURN RESULT
  1952. END "-";
  1953. (*** add array + array -> array ********************************************************************)
  1954. (** SHORTINT *)
  1955. PROCEDURE AddASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  1956. VAR lval, rval: SHORTINT;
  1957. BEGIN
  1958. WHILE (len > 0) DO
  1959. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1960. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1961. END;
  1962. END AddASASLoop;
  1963. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1964. BEGIN
  1965. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1966. SIZEOF( SHORTINT ), AddASASLoop );
  1967. RETURN RESULT
  1968. END "+";
  1969. (** INTEGER *)
  1970. PROCEDURE AddAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  1971. VAR lval, rval: INTEGER;
  1972. BEGIN
  1973. WHILE (len > 0) DO
  1974. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1975. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1976. END;
  1977. END AddAIAILoop;
  1978. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  1979. BEGIN
  1980. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1981. SIZEOF( INTEGER ), AddAIAILoop );
  1982. RETURN RESULT
  1983. END "+";
  1984. (** LONGINT *)
  1985. PROCEDURE AddALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  1986. VAR lval, rval: LONGINT;
  1987. BEGIN
  1988. WHILE (len > 0) DO
  1989. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1990. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1991. END;
  1992. END AddALALLoop;
  1993. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  1994. BEGIN
  1995. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1996. SIZEOF( LONGINT ), AddALALLoop );
  1997. RETURN RESULT
  1998. END "+";
  1999. (** REAL *)
  2000. PROCEDURE AddARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2001. VAR lval, rval: REAL;
  2002. BEGIN
  2003. WHILE (len > 0) DO
  2004. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2005. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2006. END;
  2007. END AddARARLoop;
  2008. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2009. BEGIN
  2010. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2011. loopAddARAR );
  2012. RETURN RESULT
  2013. END "+";
  2014. (** LONGREAL *)
  2015. PROCEDURE AddAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2016. VAR lval, rval: LONGREAL;
  2017. BEGIN
  2018. WHILE (len > 0) DO
  2019. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2020. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2021. END;
  2022. END AddAXAXLoop;
  2023. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2024. BEGIN
  2025. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2026. SIZEOF( LONGREAL ), loopAddAXAX );
  2027. RETURN RESULT
  2028. END "+";
  2029. (** COMPLEX *)
  2030. PROCEDURE AddAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2031. VAR lval, rval: COMPLEX;
  2032. BEGIN
  2033. WHILE (len > 0) DO
  2034. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2035. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2036. END;
  2037. END AddAZAZLoop;
  2038. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2039. BEGIN
  2040. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2041. SIZEOF( COMPLEX ), loopAddAZAZ );
  2042. RETURN RESULT
  2043. END "+";
  2044. (** LONGCOMPLEX *)
  2045. PROCEDURE AddALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2046. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2047. BEGIN
  2048. WHILE (len > 0) DO
  2049. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2050. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2051. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2052. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2053. DEC( len );
  2054. END;
  2055. END AddALZALZLoop;
  2056. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2057. BEGIN
  2058. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2059. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2060. RETURN RESULT
  2061. END "+";
  2062. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2063. (** SHORTINT *)
  2064. PROCEDURE AddASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2065. VAR lval, rval: SHORTINT;
  2066. BEGIN
  2067. SYSTEM.GET( radr, rval );
  2068. WHILE (len > 0) DO
  2069. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2070. INC( dadr, dinc ); DEC( len );
  2071. END;
  2072. END AddASSSLoop;
  2073. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2074. BEGIN
  2075. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2076. SIZEOF( SHORTINT ), AddASSSLoop );
  2077. RETURN RESULT
  2078. END "+";
  2079. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2080. BEGIN
  2081. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2082. SIZEOF( SHORTINT ), AddASSSLoop );
  2083. RETURN RESULT
  2084. END "+";
  2085. (** INTEGER *)
  2086. PROCEDURE AddAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2087. VAR lval, rval: INTEGER;
  2088. BEGIN
  2089. SYSTEM.GET( radr, rval );
  2090. WHILE (len > 0) DO
  2091. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2092. INC( dadr, dinc ); DEC( len );
  2093. END;
  2094. END AddAISILoop;
  2095. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2096. BEGIN
  2097. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2098. SIZEOF( INTEGER ), AddAISILoop );
  2099. RETURN RESULT
  2100. END "+";
  2101. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2102. BEGIN
  2103. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2104. SIZEOF( INTEGER ), AddAISILoop );
  2105. RETURN RESULT
  2106. END "+";
  2107. (** LONGINT *)
  2108. PROCEDURE AddALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2109. VAR lval, rval: LONGINT;
  2110. BEGIN
  2111. SYSTEM.GET( radr, rval );
  2112. WHILE (len > 0) DO
  2113. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2114. INC( dadr, dinc ); DEC( len );
  2115. END;
  2116. END AddALSLLoop;
  2117. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2118. BEGIN
  2119. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2120. SIZEOF( LONGINT ), AddALSLLoop );
  2121. RETURN RESULT
  2122. END "+";
  2123. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2124. BEGIN
  2125. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2126. SIZEOF( LONGINT ), AddALSLLoop );
  2127. RETURN RESULT
  2128. END "+";
  2129. (** REAL *)
  2130. PROCEDURE AddARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2131. VAR lval, rval: REAL;
  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 AddARSRLoop;
  2139. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2140. BEGIN
  2141. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2142. AddARSRLoop );
  2143. RETURN RESULT
  2144. END "+";
  2145. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2146. BEGIN
  2147. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2148. AddARSRLoop );
  2149. RETURN RESULT
  2150. END "+";
  2151. (** LONGREAL *)
  2152. PROCEDURE AddAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2153. VAR lval, rval: LONGREAL;
  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 AddAXSXLoop;
  2161. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2162. BEGIN
  2163. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2164. SIZEOF( LONGREAL ), AddAXSXLoop );
  2165. RETURN RESULT
  2166. END "+";
  2167. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2168. BEGIN
  2169. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2170. SIZEOF( LONGREAL ), AddAXSXLoop );
  2171. RETURN RESULT
  2172. END "+";
  2173. (** COMPLEX *)
  2174. PROCEDURE AddAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2175. VAR lval, rval: COMPLEX;
  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 AddAZSZLoop;
  2183. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2184. BEGIN
  2185. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2186. AddAZSZLoop );
  2187. RETURN RESULT
  2188. END "+";
  2189. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2190. BEGIN
  2191. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2192. AddAZSZLoop );
  2193. RETURN RESULT
  2194. END "+";
  2195. (** LONGCOMPLEX *)
  2196. PROCEDURE AddALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2197. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2198. BEGIN
  2199. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2200. WHILE (len > 0) DO
  2201. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2202. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2203. INC( ladr, linc );
  2204. INC( dadr, dinc ); DEC( len );
  2205. END;
  2206. END AddALZSLZLoop;
  2207. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2208. BEGIN
  2209. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2210. AddALZSLZLoop );
  2211. RETURN RESULT
  2212. END "+";
  2213. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2214. BEGIN
  2215. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2216. AddALZSLZLoop );
  2217. RETURN RESULT
  2218. END "+";
  2219. (*** subtraction array - array -> array ********************************************************************)
  2220. (** SHORTINT *)
  2221. PROCEDURE SubASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2222. VAR lval, rval: SHORTINT;
  2223. BEGIN
  2224. WHILE (len > 0) DO
  2225. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2226. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2227. END;
  2228. END SubASASLoop;
  2229. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2230. BEGIN
  2231. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2232. SIZEOF( SHORTINT ), SubASASLoop );
  2233. RETURN RESULT
  2234. END "-";
  2235. (** INTEGER *)
  2236. PROCEDURE SubAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2237. VAR lval, rval: INTEGER;
  2238. BEGIN
  2239. WHILE (len > 0) DO
  2240. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2241. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2242. END;
  2243. END SubAIAILoop;
  2244. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2245. BEGIN
  2246. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2247. SIZEOF( INTEGER ), SubAIAILoop );
  2248. RETURN RESULT
  2249. END "-";
  2250. (** LONGINT *)
  2251. PROCEDURE SubALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2252. VAR lval, rval: LONGINT;
  2253. BEGIN
  2254. WHILE (len > 0) DO
  2255. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2256. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2257. END;
  2258. END SubALALLoop;
  2259. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2260. BEGIN
  2261. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2262. SIZEOF( LONGINT ), SubALALLoop );
  2263. RETURN RESULT
  2264. END "-";
  2265. (** REAL *)
  2266. PROCEDURE SubARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2267. VAR lval, rval: REAL;
  2268. BEGIN
  2269. WHILE (len > 0) DO
  2270. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2271. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2272. END;
  2273. END SubARARLoop;
  2274. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2275. BEGIN
  2276. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2277. SubARARLoop );
  2278. RETURN RESULT
  2279. END "-";
  2280. (** LONGREAL *)
  2281. PROCEDURE SubAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2282. VAR lval, rval: LONGREAL;
  2283. BEGIN
  2284. WHILE (len > 0) DO
  2285. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2286. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2287. END;
  2288. END SubAXAXLoop;
  2289. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2290. BEGIN
  2291. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2292. SIZEOF( LONGREAL ), SubAXAXLoop );
  2293. RETURN RESULT
  2294. END "-";
  2295. (** COMPLEX *)
  2296. PROCEDURE SubAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2297. VAR lval, rval: COMPLEX;
  2298. BEGIN
  2299. WHILE (len > 0) DO
  2300. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2301. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2302. END;
  2303. END SubAZAZLoop;
  2304. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2305. BEGIN
  2306. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2307. SIZEOF( COMPLEX ), SubAZAZLoop );
  2308. RETURN RESULT
  2309. END "-";
  2310. (** LONGCOMPLEX *)
  2311. PROCEDURE SubALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2312. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2313. BEGIN
  2314. WHILE (len > 0) DO
  2315. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2316. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2317. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2318. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2319. DEC( len );
  2320. END;
  2321. END SubALZALZLoop;
  2322. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2323. BEGIN
  2324. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2325. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2326. RETURN RESULT
  2327. END "-";
  2328. (*** subtraction array-scalar -> array ********************************************************************)
  2329. (** SHORTINT *)
  2330. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2331. BEGIN
  2332. RESULT := left + (-right);
  2333. RETURN RESULT
  2334. END "-";
  2335. (** INTEGER *)
  2336. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2337. BEGIN
  2338. RESULT := left + (-right);
  2339. RETURN RESULT
  2340. END "-";
  2341. (** LONGINT *)
  2342. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2343. BEGIN
  2344. RESULT := left + (-right);
  2345. RETURN RESULT
  2346. END "-";
  2347. (** REAL *)
  2348. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2349. BEGIN
  2350. RESULT := left + (-right);
  2351. RETURN RESULT
  2352. END "-";
  2353. (** LONGREAL *)
  2354. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2355. BEGIN
  2356. RESULT := left + (-right);
  2357. RETURN RESULT
  2358. END "-";
  2359. (** COMPLEX *)
  2360. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2361. BEGIN
  2362. RESULT := left + (-right);
  2363. RETURN RESULT
  2364. END "-";
  2365. (** LONGCOMPLEX *)
  2366. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2367. BEGIN
  2368. RESULT := left + (-right);
  2369. RETURN RESULT
  2370. END "-";
  2371. (*** subtraction scalar-array -> array ********************************************************************)
  2372. (** SHORTINT *)
  2373. PROCEDURE SubSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2374. VAR lval, rval, dval: SHORTINT;
  2375. BEGIN
  2376. SYSTEM.GET( radr, rval );
  2377. WHILE (len > 0) DO
  2378. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2379. INC( dadr, dinc ); DEC( len );
  2380. END;
  2381. END SubSSASLoop;
  2382. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2383. BEGIN
  2384. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2385. SIZEOF( SHORTINT ), SubSSASLoop );
  2386. RETURN RESULT
  2387. END "-";
  2388. (** INTEGER *)
  2389. PROCEDURE SubSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2390. VAR lval, rval, dval: INTEGER;
  2391. BEGIN
  2392. SYSTEM.GET( radr, rval );
  2393. WHILE (len > 0) DO
  2394. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2395. INC( dadr, dinc ); DEC( len );
  2396. END;
  2397. END SubSIAILoop;
  2398. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2399. BEGIN
  2400. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2401. SIZEOF( INTEGER ), SubSIAILoop );
  2402. RETURN RESULT
  2403. END "-";
  2404. (** LONGINT *)
  2405. PROCEDURE SubSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2406. VAR lval, rval, dval: LONGINT;
  2407. BEGIN
  2408. SYSTEM.GET( radr, rval );
  2409. WHILE (len > 0) DO
  2410. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2411. INC( dadr, dinc ); DEC( len );
  2412. END;
  2413. END SubSLALLoop;
  2414. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2415. BEGIN
  2416. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2417. SIZEOF( LONGINT ), SubSLALLoop );
  2418. RETURN RESULT
  2419. END "-";
  2420. (** REAL *)
  2421. PROCEDURE SubSRARLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2422. VAR lval, rval, dval: REAL;
  2423. BEGIN
  2424. SYSTEM.GET( radr, rval );
  2425. WHILE (len > 0) DO
  2426. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2427. INC( dadr, dinc ); DEC( len );
  2428. END;
  2429. END SubSRARLoop;
  2430. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2431. BEGIN
  2432. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2433. SubSRARLoop );
  2434. RETURN RESULT
  2435. END "-";
  2436. (** LONGREAL *)
  2437. PROCEDURE SubSXAXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2438. VAR lval, rval, dval: LONGREAL;
  2439. BEGIN
  2440. SYSTEM.GET( radr, rval );
  2441. WHILE (len > 0) DO
  2442. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2443. INC( dadr, dinc ); DEC( len );
  2444. END;
  2445. END SubSXAXLoop;
  2446. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2447. BEGIN
  2448. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2449. SIZEOF( LONGREAL ), SubSXAXLoop );
  2450. RETURN RESULT
  2451. END "-";
  2452. (** COMPLEX *)
  2453. PROCEDURE SubSZAZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2454. VAR lval, rval, dval: COMPLEX;
  2455. BEGIN
  2456. SYSTEM.GET( radr, rval );
  2457. WHILE (len > 0) DO
  2458. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2459. INC( dadr, dinc ); DEC( len );
  2460. END;
  2461. END SubSZAZLoop;
  2462. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2463. BEGIN
  2464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2465. SIZEOF( COMPLEX ), SubSZAZLoop );
  2466. RETURN RESULT
  2467. END "-";
  2468. (** LONGCOMPLEX *)
  2469. PROCEDURE SubSLZALZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2470. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2471. BEGIN
  2472. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2473. WHILE (len > 0) DO
  2474. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2475. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2476. INC( ladr, linc );
  2477. INC( dadr, dinc ); DEC( len );
  2478. END;
  2479. END SubSLZALZLoop;
  2480. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2481. BEGIN
  2482. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2483. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2484. RETURN RESULT
  2485. END "-";
  2486. (*** element-wise multiply array x array -> array ********************************************************************)
  2487. (** SHORTINT *)
  2488. PROCEDURE EMulASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2489. VAR lval, rval: SHORTINT;
  2490. BEGIN
  2491. WHILE (len > 0) DO
  2492. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2493. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2494. END;
  2495. END EMulASASLoop;
  2496. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2497. BEGIN
  2498. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2499. SIZEOF( SHORTINT ), EMulASASLoop );
  2500. RETURN RESULT
  2501. END ".*";
  2502. (** INTEGER *)
  2503. PROCEDURE EMulAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2504. VAR lval, rval: INTEGER; dval: INTEGER;
  2505. BEGIN
  2506. WHILE (len > 0) DO
  2507. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2508. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2509. DEC( len );
  2510. END;
  2511. END EMulAIAILoop;
  2512. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2513. BEGIN
  2514. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2515. SIZEOF( INTEGER ), EMulAIAILoop );
  2516. RETURN RESULT
  2517. END ".*";
  2518. (** LONGINT *)
  2519. PROCEDURE EMulALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2520. VAR lval, rval: LONGINT;
  2521. BEGIN
  2522. WHILE (len > 0) DO
  2523. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2524. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2525. END;
  2526. END EMulALALLoop;
  2527. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2528. BEGIN
  2529. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2530. SIZEOF( LONGINT ), EMulALALLoop );
  2531. RETURN RESULT
  2532. END ".*";
  2533. (** REAL *)
  2534. PROCEDURE EMulARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2535. VAR lval, rval: REAL;
  2536. BEGIN
  2537. WHILE (len > 0) DO
  2538. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2539. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2540. END;
  2541. END EMulARARLoop;
  2542. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2543. BEGIN
  2544. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2545. EMulARARLoop );
  2546. RETURN RESULT
  2547. END ".*";
  2548. (** LONGREAL *)
  2549. PROCEDURE EMulAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2550. VAR lval, rval: LONGREAL;
  2551. BEGIN
  2552. WHILE (len > 0) DO
  2553. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2554. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2555. END;
  2556. END EMulAXAXLoop;
  2557. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2558. BEGIN
  2559. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2560. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2561. RETURN RESULT
  2562. END ".*";
  2563. (** COMPLEX *)
  2564. PROCEDURE EMulAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2565. VAR lval, rval: COMPLEX;
  2566. BEGIN
  2567. WHILE (len > 0) DO
  2568. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2569. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2570. END;
  2571. END EMulAZAZLoop;
  2572. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2573. BEGIN
  2574. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2575. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2576. RETURN RESULT
  2577. END ".*";
  2578. (** LONGCOMPLEX *)
  2579. PROCEDURE EMulALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2580. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2581. BEGIN
  2582. WHILE (len > 0) DO
  2583. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2584. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2585. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2586. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2587. DEC( len );
  2588. END;
  2589. END EMulALZALZLoop;
  2590. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2591. BEGIN
  2592. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2593. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2594. RETURN RESULT
  2595. END ".*";
  2596. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2597. (** SHORTINT *)
  2598. PROCEDURE EMulIncASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2599. VAR lval, rval,dval: SHORTINT;
  2600. BEGIN
  2601. WHILE (len > 0) DO
  2602. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2603. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2604. END;
  2605. END EMulIncASASLoop;
  2606. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2607. BEGIN
  2608. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2609. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2610. END ".*+";
  2611. (** INTEGER *)
  2612. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2613. VAR lval, rval,dval: INTEGER;
  2614. BEGIN
  2615. WHILE (len > 0) DO
  2616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2617. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2618. DEC( len );
  2619. END;
  2620. END EMulIncAIAILoop;
  2621. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2622. BEGIN
  2623. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2624. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2625. END ".*+";
  2626. (** LONGINT *)
  2627. PROCEDURE EMulIncALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2628. VAR lval, rval,dval: LONGINT;
  2629. BEGIN
  2630. WHILE (len > 0) DO
  2631. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2632. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2633. END;
  2634. END EMulIncALALLoop;
  2635. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2636. BEGIN
  2637. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2638. SIZEOF( LONGINT ), EMulIncALALLoop );
  2639. END ".*+";
  2640. (** REAL *)
  2641. PROCEDURE EMulIncARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2642. VAR lval, rval,dval: REAL;
  2643. BEGIN
  2644. WHILE (len > 0) DO
  2645. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2646. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2647. END;
  2648. END EMulIncARARLoop;
  2649. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2650. BEGIN
  2651. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2652. EMulIncARARLoop );
  2653. END ".*+";
  2654. (** LONGREAL *)
  2655. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2656. VAR lval, rval,dval: LONGREAL;
  2657. BEGIN
  2658. WHILE (len > 0) DO
  2659. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2660. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2661. END;
  2662. END EMulIncAXAXLoop;
  2663. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2664. BEGIN
  2665. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2666. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2667. END ".*+";
  2668. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2669. (** SHORTINT *)
  2670. PROCEDURE MulASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2671. VAR lval, rval: SHORTINT;
  2672. BEGIN
  2673. SYSTEM.GET( radr, rval );
  2674. WHILE (len > 0) DO
  2675. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2676. INC( dadr, dinc ); DEC( len );
  2677. END;
  2678. END MulASSSLoop;
  2679. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2680. BEGIN
  2681. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2682. SIZEOF( SHORTINT ), MulASSSLoop );
  2683. RETURN RESULT
  2684. END "*";
  2685. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2686. BEGIN
  2687. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2688. SIZEOF( SHORTINT ), MulASSSLoop );
  2689. RETURN RESULT
  2690. END "*";
  2691. (** INTEGER *)
  2692. PROCEDURE MulAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2693. VAR lval, rval: INTEGER;
  2694. BEGIN
  2695. SYSTEM.GET( radr, rval );
  2696. WHILE (len > 0) DO
  2697. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2698. INC( dadr, dinc ); DEC( len );
  2699. END;
  2700. END MulAISILoop;
  2701. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2702. BEGIN
  2703. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2704. SIZEOF( INTEGER ), MulAISILoop );
  2705. RETURN RESULT
  2706. END "*";
  2707. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2708. BEGIN
  2709. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2710. SIZEOF( INTEGER ), MulAISILoop );
  2711. RETURN RESULT
  2712. END "*";
  2713. (** LONGINT *)
  2714. PROCEDURE MulALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2715. VAR lval, rval: LONGINT;
  2716. BEGIN
  2717. SYSTEM.GET( radr, rval );
  2718. WHILE (len > 0) DO
  2719. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2720. INC( dadr, dinc ); DEC( len );
  2721. END;
  2722. END MulALSLLoop;
  2723. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2724. BEGIN
  2725. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2726. SIZEOF( LONGINT ), MulALSLLoop );
  2727. RETURN RESULT
  2728. END "*";
  2729. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2730. BEGIN
  2731. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2732. SIZEOF( LONGINT ), MulALSLLoop );
  2733. RETURN RESULT
  2734. END "*";
  2735. (** REAL *)
  2736. PROCEDURE MulARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2737. VAR lval, rval: REAL;
  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 MulARSRLoop;
  2745. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2746. BEGIN
  2747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2748. loopMulARSR );
  2749. RETURN RESULT
  2750. END "*";
  2751. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2752. BEGIN
  2753. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2754. loopMulARSR );
  2755. RETURN RESULT
  2756. END "*";
  2757. (** LONGREAL *)
  2758. PROCEDURE MulAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2759. VAR lval, rval: LONGREAL;
  2760. BEGIN
  2761. IF debug THEN
  2762. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2763. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2764. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2765. END;
  2766. SYSTEM.GET( radr, rval );
  2767. WHILE (len > 0) DO
  2768. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2769. INC( dadr, dinc ); DEC( len );
  2770. END;
  2771. END MulAXSXLoop;
  2772. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2773. BEGIN
  2774. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2775. SIZEOF( LONGREAL ), loopMulAXSX );
  2776. RETURN RESULT
  2777. END "*";
  2778. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2779. BEGIN
  2780. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2781. SIZEOF( LONGREAL ), loopMulAXSX );
  2782. RETURN RESULT
  2783. END "*";
  2784. (** COMPLEX *)
  2785. PROCEDURE MulAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2786. VAR lval, rval: COMPLEX;
  2787. BEGIN
  2788. SYSTEM.GET( radr, rval );
  2789. WHILE (len > 0) DO
  2790. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2791. INC( dadr, dinc ); DEC( len );
  2792. END;
  2793. END MulAZSZLoop;
  2794. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2795. BEGIN
  2796. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2797. loopMulAZSZ );
  2798. RETURN RESULT
  2799. END "*";
  2800. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2801. BEGIN
  2802. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2803. loopMulAZSZ );
  2804. RETURN RESULT
  2805. END "*";
  2806. (** LONGCOMPLEX *)
  2807. PROCEDURE MulALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2808. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2809. BEGIN
  2810. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2811. WHILE (len > 0) DO
  2812. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2813. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2814. INC( ladr, linc );
  2815. INC( dadr, dinc ); DEC( len );
  2816. END;
  2817. END MulALZSLZLoop;
  2818. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2819. BEGIN
  2820. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2821. loopMulALZSLZ );
  2822. RETURN RESULT
  2823. END "*";
  2824. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2825. BEGIN
  2826. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2827. loopMulALZSLZ );
  2828. RETURN RESULT
  2829. END "*";
  2830. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2831. (** SHORTINT *)
  2832. PROCEDURE IncMulASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2833. VAR lval, rval, dval: SHORTINT;
  2834. BEGIN
  2835. SYSTEM.GET( radr, rval );
  2836. WHILE (len > 0) DO
  2837. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2838. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2839. END;
  2840. END IncMulASSSLoop;
  2841. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2842. BEGIN
  2843. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2844. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2845. END "IncMul";
  2846. OPERATOR "IncMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2847. BEGIN
  2848. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2849. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2850. RETURN RESULT
  2851. END "IncMul";
  2852. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2853. BEGIN
  2854. RESULT := -RESULT;
  2855. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2856. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2857. RESULT := -RESULT;
  2858. RETURN RESULT
  2859. END "DecMul";
  2860. OPERATOR "DecMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2861. BEGIN
  2862. RESULT := -RESULT;
  2863. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2864. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2865. RESULT := -RESULT;
  2866. RETURN RESULT
  2867. END "DecMul";
  2868. (** INTEGER *)
  2869. PROCEDURE IncMulAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2870. VAR lval, rval, dval: INTEGER;
  2871. BEGIN
  2872. SYSTEM.GET( radr, rval );
  2873. WHILE (len > 0) DO
  2874. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2875. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2876. END;
  2877. END IncMulAISILoop;
  2878. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2879. BEGIN
  2880. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2881. SIZEOF( INTEGER ), IncMulAISILoop );
  2882. RETURN RESULT
  2883. END "IncMul";
  2884. OPERATOR "IncMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2885. BEGIN
  2886. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2887. SIZEOF( INTEGER ), IncMulAISILoop );
  2888. RETURN RESULT
  2889. END "IncMul";
  2890. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2891. BEGIN
  2892. RESULT := -RESULT;
  2893. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2894. SIZEOF( INTEGER ), IncMulAISILoop );
  2895. RESULT := -RESULT;
  2896. RETURN RESULT
  2897. END "DecMul";
  2898. OPERATOR "DecMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2899. BEGIN
  2900. RESULT := -RESULT;
  2901. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2902. SIZEOF( INTEGER ), IncMulAISILoop );
  2903. RESULT := -RESULT;
  2904. RETURN RESULT
  2905. END "DecMul";
  2906. (** LONGINT *)
  2907. PROCEDURE IncMulALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2908. VAR lval, rval, dval: LONGINT;
  2909. BEGIN
  2910. SYSTEM.GET( radr, rval );
  2911. WHILE (len > 0) DO
  2912. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2913. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2914. END;
  2915. END IncMulALSLLoop;
  2916. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2917. BEGIN
  2918. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2919. SIZEOF( LONGINT ), IncMulALSLLoop );
  2920. RETURN RESULT
  2921. END "IncMul";
  2922. OPERATOR "IncMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2923. BEGIN
  2924. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2925. SIZEOF( LONGINT ), IncMulALSLLoop );
  2926. RETURN RESULT
  2927. END "IncMul";
  2928. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2929. BEGIN
  2930. RESULT := -RESULT;
  2931. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2932. SIZEOF( LONGINT ), IncMulALSLLoop );
  2933. RESULT := -RESULT;
  2934. RETURN RESULT
  2935. END "DecMul";
  2936. OPERATOR "DecMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2937. BEGIN
  2938. RESULT := -RESULT;
  2939. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2940. SIZEOF( LONGINT ), IncMulALSLLoop );
  2941. RESULT := -RESULT;
  2942. RETURN RESULT
  2943. END "DecMul";
  2944. (** REAL *)
  2945. PROCEDURE IncMulARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2946. VAR lval, rval, dval: REAL;
  2947. BEGIN
  2948. SYSTEM.GET( radr, rval );
  2949. WHILE (len > 0) DO
  2950. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2951. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2952. END;
  2953. END IncMulARSRLoop;
  2954. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2955. BEGIN
  2956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2957. loopIncMulARSR );
  2958. RETURN RESULT
  2959. END "IncMul";
  2960. OPERATOR "IncMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2961. BEGIN
  2962. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2963. loopIncMulARSR );
  2964. RETURN RESULT
  2965. END "IncMul";
  2966. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2967. BEGIN
  2968. RESULT := -RESULT;
  2969. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2970. loopIncMulARSR );
  2971. RESULT := -RESULT;
  2972. RETURN RESULT
  2973. END "DecMul";
  2974. OPERATOR "DecMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2975. BEGIN
  2976. RESULT := -RESULT;
  2977. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2978. loopIncMulARSR );
  2979. RESULT := -RESULT;
  2980. RETURN RESULT
  2981. END "DecMul";
  2982. (** LONGREAL *)
  2983. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2984. VAR lval, rval, dval: LONGREAL;
  2985. BEGIN
  2986. IF debug THEN
  2987. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2988. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2989. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2990. END;
  2991. SYSTEM.GET( radr, rval );
  2992. WHILE (len > 0) DO
  2993. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2994. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2995. END;
  2996. END IncMulAXSXLoop;
  2997. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2998. BEGIN
  2999. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3000. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3001. RETURN RESULT
  3002. END "IncMul";
  3003. OPERATOR "IncMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3004. BEGIN
  3005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3006. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3007. RETURN RESULT
  3008. END "IncMul";
  3009. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3010. BEGIN
  3011. RESULT := -RESULT;
  3012. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3013. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3014. RESULT := -RESULT;
  3015. RETURN RESULT
  3016. END "DecMul";
  3017. OPERATOR "DecMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3018. BEGIN
  3019. RESULT := -RESULT;
  3020. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3021. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3022. RESULT := -RESULT;
  3023. RETURN RESULT
  3024. END "DecMul";
  3025. (*** element-wise division array / array -> array ********************************************************************)
  3026. (** SHORTINT *)
  3027. PROCEDURE EDivideASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3028. VAR lval, rval: SHORTINT; dval: REAL;
  3029. BEGIN
  3030. WHILE (len > 0) DO
  3031. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3032. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3033. DEC( len );
  3034. END;
  3035. END EDivideASASLoop;
  3036. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3037. BEGIN
  3038. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3039. EDivideASASLoop );
  3040. RETURN RESULT
  3041. END "./";
  3042. (** INTEGER *)
  3043. PROCEDURE EDivideAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3044. VAR lval, rval: INTEGER; dval: REAL;
  3045. BEGIN
  3046. WHILE (len > 0) DO
  3047. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3048. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3049. DEC( len );
  3050. END;
  3051. END EDivideAIAILoop;
  3052. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3053. BEGIN
  3054. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3055. EDivideAIAILoop );
  3056. RETURN RESULT
  3057. END "./";
  3058. (** LONGINT *)
  3059. PROCEDURE EDivideALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3060. VAR lval, rval: LONGINT; dval: REAL;
  3061. BEGIN
  3062. WHILE (len > 0) DO
  3063. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3064. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3065. DEC( len );
  3066. END;
  3067. END EDivideALALLoop;
  3068. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3069. BEGIN
  3070. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3071. EDivideALALLoop );
  3072. RETURN RESULT
  3073. END "./";
  3074. (** REAL *)
  3075. PROCEDURE EDivideARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3076. VAR lval, rval: REAL; dval: REAL;
  3077. BEGIN
  3078. WHILE (len > 0) DO
  3079. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3080. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3081. DEC( len );
  3082. END;
  3083. END EDivideARARLoop;
  3084. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3085. BEGIN
  3086. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3087. EDivideARARLoop );
  3088. RETURN RESULT
  3089. END "./";
  3090. (** LONGREAL *)
  3091. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3092. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3093. BEGIN
  3094. WHILE (len > 0) DO
  3095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3096. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3097. DEC( len );
  3098. END;
  3099. END EDivideAXAXLoop;
  3100. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3101. BEGIN
  3102. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3103. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3104. RETURN RESULT
  3105. END "./";
  3106. (** COMPLEX *)
  3107. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3108. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3109. BEGIN
  3110. WHILE (len > 0) DO
  3111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3112. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3113. DEC( len );
  3114. END;
  3115. END EDivideAZAZLoop;
  3116. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3117. BEGIN
  3118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3119. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3120. RETURN RESULT
  3121. END "./";
  3122. (** LONGCOMPLEX *)
  3123. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3124. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3125. BEGIN
  3126. WHILE (len > 0) DO
  3127. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3128. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3129. IF rvalIm # 0.0D0 THEN
  3130. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3131. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3132. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3133. ELSE
  3134. dvalRe := lvalRe/rvalRe;
  3135. dvalIm := lvalIm/rvalRe;
  3136. END;
  3137. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3138. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3139. DEC( len );
  3140. END;
  3141. END EDivideALZALZLoop;
  3142. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3143. BEGIN
  3144. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3145. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3146. RETURN RESULT
  3147. END "./";
  3148. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3149. (** SHORTINT *)
  3150. PROCEDURE DivideASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3151. VAR lval, rval: SHORTINT; dval: REAL;
  3152. BEGIN
  3153. SYSTEM.GET( radr, rval );
  3154. WHILE (len > 0) DO
  3155. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3156. INC( dadr, dinc ); DEC( len );
  3157. END;
  3158. END DivideASSSLoop;
  3159. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3160. BEGIN
  3161. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3162. DivideASSSLoop );
  3163. RETURN RESULT
  3164. END "/";
  3165. PROCEDURE DivideSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3166. VAR lval, rval: SHORTINT; dval: REAL;
  3167. BEGIN
  3168. SYSTEM.GET( radr, rval );
  3169. WHILE (len > 0) DO
  3170. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3171. INC( dadr, dinc ); DEC( len );
  3172. END;
  3173. END DivideSSASLoop;
  3174. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3175. BEGIN
  3176. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3177. DivideSSASLoop );
  3178. RETURN RESULT
  3179. END "/";
  3180. (** INTEGER *)
  3181. PROCEDURE DivideAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3182. VAR lval, rval: INTEGER; dval: REAL;
  3183. BEGIN
  3184. SYSTEM.GET( radr, rval );
  3185. WHILE (len > 0) DO
  3186. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3187. INC( dadr, dinc ); DEC( len );
  3188. END;
  3189. END DivideAISILoop;
  3190. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3191. BEGIN
  3192. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3193. DivideAISILoop );
  3194. RETURN RESULT
  3195. END "/";
  3196. PROCEDURE DivideSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3197. VAR lval, rval: INTEGER; dval: REAL;
  3198. BEGIN
  3199. SYSTEM.GET( radr, rval );
  3200. WHILE (len > 0) DO
  3201. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3202. INC( dadr, dinc ); DEC( len );
  3203. END;
  3204. END DivideSIAILoop;
  3205. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3206. BEGIN
  3207. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3208. DivideSIAILoop );
  3209. RETURN RESULT
  3210. END "/";
  3211. (** LONGINT *)
  3212. PROCEDURE DivideALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3213. VAR lval, rval: LONGINT; dval: REAL;
  3214. BEGIN
  3215. SYSTEM.GET( radr, rval );
  3216. WHILE (len > 0) DO
  3217. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3218. INC( dadr, dinc ); DEC( len );
  3219. END;
  3220. END DivideALSLLoop;
  3221. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3222. BEGIN
  3223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3224. DivideALSLLoop );
  3225. RETURN RESULT
  3226. END "/";
  3227. PROCEDURE DivideSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3228. VAR lval, rval: LONGINT; dval: REAL;
  3229. BEGIN
  3230. SYSTEM.GET( radr, rval );
  3231. WHILE (len > 0) DO
  3232. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3233. INC( dadr, dinc ); DEC( len );
  3234. END;
  3235. END DivideSLALLoop;
  3236. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3237. BEGIN
  3238. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3239. DivideSLALLoop );
  3240. RETURN RESULT
  3241. END "/";
  3242. (** REAL *)
  3243. PROCEDURE DivideARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3244. VAR lval, rval: REAL; dval: REAL;
  3245. BEGIN
  3246. SYSTEM.GET( radr, rval );
  3247. WHILE (len > 0) DO
  3248. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3249. INC( dadr, dinc ); DEC( len );
  3250. END;
  3251. END DivideARSRLoop;
  3252. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3253. BEGIN
  3254. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3255. DivideARSRLoop );
  3256. RETURN RESULT
  3257. END "/";
  3258. PROCEDURE DivideSRARLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3259. VAR lval, rval: REAL; dval: REAL;
  3260. BEGIN
  3261. SYSTEM.GET( radr, rval );
  3262. WHILE (len > 0) DO
  3263. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3264. INC( dadr, dinc ); DEC( len );
  3265. END;
  3266. END DivideSRARLoop;
  3267. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3268. BEGIN
  3269. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3270. DivideSRARLoop );
  3271. RETURN RESULT
  3272. END "/";
  3273. (** LONGREAL *)
  3274. PROCEDURE DivideAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3275. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3276. BEGIN
  3277. SYSTEM.GET( radr, rval );
  3278. WHILE (len > 0) DO
  3279. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3280. INC( dadr, dinc ); DEC( len );
  3281. END;
  3282. END DivideAXSXLoop;
  3283. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3284. BEGIN
  3285. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3286. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3287. RETURN RESULT
  3288. END "/";
  3289. PROCEDURE DivideSXAXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3290. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3291. BEGIN
  3292. SYSTEM.GET( radr, rval );
  3293. WHILE (len > 0) DO
  3294. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3295. INC( dadr, dinc ); DEC( len );
  3296. END;
  3297. END DivideSXAXLoop;
  3298. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3299. BEGIN
  3300. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3301. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3302. RETURN RESULT
  3303. END "/";
  3304. (** COMPLEX *)
  3305. PROCEDURE DivideAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3306. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3307. BEGIN
  3308. SYSTEM.GET( radr, rval );
  3309. WHILE (len > 0) DO
  3310. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3311. INC( dadr, dinc ); DEC( len );
  3312. END;
  3313. END DivideAZSZLoop;
  3314. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3315. BEGIN
  3316. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3317. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3318. RETURN RESULT
  3319. END "/";
  3320. PROCEDURE DivideSZAZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3321. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3322. BEGIN
  3323. SYSTEM.GET( radr, rval );
  3324. WHILE (len > 0) DO
  3325. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3326. INC( dadr, dinc ); DEC( len );
  3327. END;
  3328. END DivideSZAZLoop;
  3329. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3330. BEGIN
  3331. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3332. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3333. RETURN RESULT
  3334. END "/";
  3335. (** LONGCOMPLEX *)
  3336. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3337. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3338. BEGIN
  3339. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3340. IF rvalIm # 0.0D0 THEN
  3341. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3342. WHILE (len > 0) DO
  3343. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3344. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3345. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3346. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3347. INC( ladr, linc );
  3348. INC( dadr, dinc ); DEC( len );
  3349. END;
  3350. ELSE
  3351. WHILE (len > 0) DO
  3352. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3353. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3354. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3355. INC( ladr, linc );
  3356. INC( dadr, dinc ); DEC( len );
  3357. END;
  3358. END;
  3359. END DivideALZSLZLoop;
  3360. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3361. BEGIN
  3362. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3363. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3364. RETURN RESULT
  3365. END "/";
  3366. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3367. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3368. BEGIN
  3369. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3370. WHILE (len > 0) DO
  3371. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3372. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3373. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3374. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3375. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3376. INC( ladr, linc );
  3377. INC( dadr, dinc ); DEC( len );
  3378. END;
  3379. END DivideSLZALZLoop;
  3380. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3381. BEGIN
  3382. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3383. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3384. RETURN RESULT
  3385. END "/";
  3386. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3387. (** SHORTINT *)
  3388. PROCEDURE EDivASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3389. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3390. BEGIN
  3391. WHILE (len > 0) DO
  3392. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3393. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3394. DEC( len );
  3395. END;
  3396. END EDivASASLoop;
  3397. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3398. BEGIN
  3399. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3400. SIZEOF( SHORTINT ), EDivASASLoop );
  3401. RETURN RESULT
  3402. END "DIV";
  3403. (** INTEGER *)
  3404. PROCEDURE EDivAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3405. VAR lval, rval: INTEGER; dval: INTEGER;
  3406. BEGIN
  3407. WHILE (len > 0) DO
  3408. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3409. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3410. DEC( len );
  3411. END;
  3412. END EDivAIAILoop;
  3413. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3414. BEGIN
  3415. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3416. SIZEOF( INTEGER ), EDivAIAILoop );
  3417. RETURN RESULT
  3418. END "DIV";
  3419. (** LONGINT *)
  3420. PROCEDURE EDivALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3421. VAR lval, rval: LONGINT; dval: LONGINT;
  3422. BEGIN
  3423. WHILE (len > 0) DO
  3424. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3425. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3426. DEC( len );
  3427. END;
  3428. END EDivALALLoop;
  3429. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3430. BEGIN
  3431. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3432. SIZEOF( LONGINT ), EDivALALLoop );
  3433. RETURN RESULT
  3434. END "DIV";
  3435. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3436. (** SHORTINT *)
  3437. PROCEDURE DivASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3438. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3439. BEGIN
  3440. SYSTEM.GET( radr, rval );
  3441. WHILE (len > 0) DO
  3442. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3443. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3444. END;
  3445. END DivASSSLoop;
  3446. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3447. BEGIN
  3448. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3449. SIZEOF( SHORTINT ), DivASSSLoop );
  3450. RETURN RESULT
  3451. END "DIV";
  3452. PROCEDURE DivSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3453. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3454. BEGIN
  3455. SYSTEM.GET( radr, rval );
  3456. WHILE (len > 0) DO
  3457. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3458. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3459. END;
  3460. END DivSSASLoop;
  3461. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3462. BEGIN
  3463. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3464. SIZEOF( SHORTINT ), DivSSASLoop );
  3465. RETURN RESULT
  3466. END "DIV";
  3467. (** INTEGER *)
  3468. PROCEDURE DivAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3469. VAR lval, rval: INTEGER; dval: INTEGER;
  3470. BEGIN
  3471. SYSTEM.GET( radr, rval );
  3472. WHILE (len > 0) DO
  3473. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3474. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3475. END;
  3476. END DivAISILoop;
  3477. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3478. BEGIN
  3479. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3480. SIZEOF( INTEGER ), DivAISILoop );
  3481. RETURN RESULT
  3482. END "DIV";
  3483. PROCEDURE DivSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3484. VAR lval, rval: INTEGER; dval: INTEGER;
  3485. BEGIN
  3486. SYSTEM.GET( radr, rval );
  3487. WHILE (len > 0) DO
  3488. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3489. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3490. END;
  3491. END DivSIAILoop;
  3492. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3493. BEGIN
  3494. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3495. SIZEOF( INTEGER ), DivSIAILoop );
  3496. RETURN RESULT
  3497. END "DIV";
  3498. (** LONGINT *)
  3499. PROCEDURE DivALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3500. VAR lval, rval: LONGINT; dval: LONGINT;
  3501. BEGIN
  3502. SYSTEM.GET( radr, rval );
  3503. WHILE (len > 0) DO
  3504. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3505. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3506. END;
  3507. END DivALSLLoop;
  3508. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3509. BEGIN
  3510. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3511. SIZEOF( LONGINT ), DivALSLLoop );
  3512. RETURN RESULT
  3513. END "DIV";
  3514. PROCEDURE DivSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3515. VAR lval, rval: LONGINT; dval: LONGINT;
  3516. BEGIN
  3517. SYSTEM.GET( radr, rval );
  3518. WHILE (len > 0) DO
  3519. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3520. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3521. END;
  3522. END DivSLALLoop;
  3523. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3524. BEGIN
  3525. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3526. SIZEOF( LONGINT ), DivSLALLoop );
  3527. RETURN RESULT
  3528. END "DIV";
  3529. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3530. (** SHORTINT *)
  3531. PROCEDURE EModASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3532. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3533. BEGIN
  3534. WHILE (len > 0) DO
  3535. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3536. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3537. DEC( len );
  3538. END;
  3539. END EModASASLoop;
  3540. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3541. BEGIN
  3542. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3543. SIZEOF( SHORTINT ), EModASASLoop );
  3544. RETURN RESULT
  3545. END "MOD";
  3546. (** INTEGER *)
  3547. PROCEDURE EModAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3548. VAR lval, rval: INTEGER; dval: INTEGER;
  3549. BEGIN
  3550. WHILE (len > 0) DO
  3551. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3552. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3553. DEC( len );
  3554. END;
  3555. END EModAIAILoop;
  3556. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3557. BEGIN
  3558. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3559. SIZEOF( INTEGER ), EModAIAILoop );
  3560. RETURN RESULT
  3561. END "MOD";
  3562. (** LONGINT *)
  3563. PROCEDURE EModALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3564. VAR lval, rval: LONGINT; dval: LONGINT;
  3565. BEGIN
  3566. WHILE (len > 0) DO
  3567. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3568. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3569. DEC( len );
  3570. END;
  3571. END EModALALLoop;
  3572. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3573. BEGIN
  3574. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3575. SIZEOF( LONGINT ), EModALALLoop );
  3576. RETURN RESULT
  3577. END "MOD";
  3578. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3579. (** SHORTINT *)
  3580. PROCEDURE ModASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3581. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3582. BEGIN
  3583. SYSTEM.GET( radr, rval );
  3584. WHILE (len > 0) DO
  3585. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3586. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3587. END;
  3588. END ModASSSLoop;
  3589. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3590. BEGIN
  3591. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3592. SIZEOF( SHORTINT ), ModASSSLoop );
  3593. RETURN RESULT
  3594. END "MOD";
  3595. PROCEDURE ModSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3596. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3597. BEGIN
  3598. SYSTEM.GET( radr, rval );
  3599. WHILE (len > 0) DO
  3600. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3601. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3602. END;
  3603. END ModSSASLoop;
  3604. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3605. BEGIN
  3606. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3607. SIZEOF( SHORTINT ), ModSSASLoop );
  3608. RETURN RESULT
  3609. END "MOD";
  3610. (** INTEGER *)
  3611. PROCEDURE ModAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3612. VAR lval, rval: INTEGER; dval: INTEGER;
  3613. BEGIN
  3614. SYSTEM.GET( radr, rval );
  3615. WHILE (len > 0) DO
  3616. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3617. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3618. END;
  3619. END ModAISILoop;
  3620. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3621. BEGIN
  3622. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3623. SIZEOF( INTEGER ), ModAISILoop );
  3624. RETURN RESULT
  3625. END "MOD";
  3626. PROCEDURE ModSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3627. VAR lval, rval: INTEGER; dval: INTEGER;
  3628. BEGIN
  3629. SYSTEM.GET( radr, rval );
  3630. WHILE (len > 0) DO
  3631. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3632. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3633. END;
  3634. END ModSIAILoop;
  3635. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3636. BEGIN
  3637. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3638. SIZEOF( INTEGER ), ModSIAILoop );
  3639. RETURN RESULT
  3640. END "MOD";
  3641. (** LONGINT *)
  3642. PROCEDURE ModALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3643. VAR lval, rval: LONGINT; dval: LONGINT;
  3644. BEGIN
  3645. SYSTEM.GET( radr, rval );
  3646. WHILE (len > 0) DO
  3647. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3648. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3649. END;
  3650. END ModALSLLoop;
  3651. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3652. BEGIN
  3653. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3654. SIZEOF( LONGINT ), ModALSLLoop );
  3655. RETURN RESULT
  3656. END "MOD";
  3657. PROCEDURE ModSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3658. VAR lval, rval: LONGINT; dval: LONGINT;
  3659. BEGIN
  3660. SYSTEM.GET( radr, rval );
  3661. WHILE (len > 0) DO
  3662. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3663. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3664. END;
  3665. END ModSLALLoop;
  3666. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3667. BEGIN
  3668. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3669. SIZEOF( LONGINT ), ModSLALLoop );
  3670. RETURN RESULT
  3671. END "MOD";
  3672. (*** scalar product <array,array> -> scalar ********************************************************************)
  3673. (** SHORTINT *)
  3674. PROCEDURE SPASASLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3675. VAR lval, rval: SHORTINT; dval: LONGINT;
  3676. BEGIN
  3677. SYSTEM.GET( dadr, dval );
  3678. WHILE (len > 0) DO
  3679. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3680. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3681. END;
  3682. SYSTEM.PUT( dadr, dval );
  3683. END SPASASLoop;
  3684. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3685. VAR dest: LONGINT;
  3686. BEGIN
  3687. dest := 0;
  3688. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3689. RETURN dest;
  3690. END "+*";
  3691. (** INTEGER *)
  3692. PROCEDURE SPAIAILoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3693. VAR lval, rval: INTEGER; dval: LONGINT;
  3694. BEGIN
  3695. SYSTEM.GET( dadr, dval );
  3696. WHILE (len > 0) DO
  3697. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3698. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3699. END;
  3700. SYSTEM.PUT( dadr, dval );
  3701. END SPAIAILoop;
  3702. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3703. VAR dest: LONGINT;
  3704. BEGIN
  3705. dest := 0;
  3706. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3707. RETURN dest;
  3708. END "+*";
  3709. (** LONGINT *)
  3710. PROCEDURE SPALALLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3711. VAR lval, rval: LONGINT; dval: LONGINT;
  3712. BEGIN
  3713. SYSTEM.GET( dadr, dval );
  3714. WHILE (len > 0) DO
  3715. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3716. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3717. END;
  3718. SYSTEM.PUT( dadr, dval );
  3719. END SPALALLoop;
  3720. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3721. VAR dest: LONGINT;
  3722. BEGIN
  3723. dest := 0;
  3724. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3725. RETURN dest;
  3726. END "+*";
  3727. (** REAL *)
  3728. PROCEDURE SPARARLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3729. VAR lval, rval: REAL; dval: REAL;
  3730. BEGIN
  3731. SYSTEM.GET( dadr, dval );
  3732. WHILE (len > 0) DO
  3733. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3734. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3735. END;
  3736. SYSTEM.PUT( dadr, dval );
  3737. END SPARARLoop;
  3738. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3739. VAR dest: REAL;
  3740. BEGIN
  3741. dest := 0;
  3742. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3743. RETURN dest;
  3744. END "+*";
  3745. PROCEDURE SPAXAXLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3746. VAR lval, rval, dval: LONGREAL;
  3747. BEGIN
  3748. IF debug THEN
  3749. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3750. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3751. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3752. END;
  3753. SYSTEM.GET( dadr, dval );
  3754. WHILE (len > 0) DO
  3755. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3756. dval := dval + rval * lval; DEC( len );
  3757. END;
  3758. SYSTEM.PUT( dadr, dval );
  3759. END SPAXAXLoop;
  3760. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3761. VAR dest: LONGREAL;
  3762. BEGIN
  3763. dest := 0;
  3764. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3765. RETURN dest;
  3766. END "+*";
  3767. (** COMPLEX *)
  3768. PROCEDURE SPAZAZLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3769. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3770. BEGIN
  3771. SYSTEM.GET( dadr, dval );
  3772. WHILE (len > 0) DO
  3773. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3774. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3775. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3776. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3777. END;
  3778. SYSTEM.PUT( dadr, dval );
  3779. END SPAZAZLoop;
  3780. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3781. VAR dest: COMPLEX;
  3782. BEGIN
  3783. dest := 0;
  3784. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3785. RETURN dest;
  3786. END "+*";
  3787. (** COMPLEX *)
  3788. PROCEDURE SPALZALZLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3789. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3790. BEGIN
  3791. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3792. WHILE (len > 0) DO
  3793. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3794. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3795. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3796. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3797. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3798. END;
  3799. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3800. END SPALZALZLoop;
  3801. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3802. VAR dest: LONGCOMPLEX;
  3803. BEGIN
  3804. dest := 0;
  3805. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3806. RETURN dest;
  3807. END "+*";
  3808. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3809. (** BOOLEAN *)
  3810. PROCEDURE EEqlABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3811. VAR lval, rval: BOOLEAN;
  3812. BEGIN
  3813. WHILE (len > 0) DO
  3814. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3815. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3816. END;
  3817. END EEqlABABLoop;
  3818. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3819. BEGIN
  3820. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3821. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3822. RETURN RESULT
  3823. END ".=";
  3824. (** SHORTINT *)
  3825. PROCEDURE EEqlASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3826. VAR lval, rval: SHORTINT;
  3827. BEGIN
  3828. WHILE (len > 0) DO
  3829. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3830. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3831. END;
  3832. END EEqlASASLoop;
  3833. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3834. BEGIN
  3835. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3836. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3837. RETURN RESULT
  3838. END ".=";
  3839. (** INTEGER *)
  3840. PROCEDURE EEqlAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3841. VAR lval, rval: INTEGER;
  3842. BEGIN
  3843. WHILE (len > 0) DO
  3844. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3845. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3846. END;
  3847. END EEqlAIAILoop;
  3848. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3849. BEGIN
  3850. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3851. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3852. RETURN RESULT
  3853. END ".=";
  3854. (** LONGINT *)
  3855. PROCEDURE EEqlALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3856. VAR lval, rval: LONGINT;
  3857. BEGIN
  3858. WHILE (len > 0) DO
  3859. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3860. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3861. END;
  3862. END EEqlALALLoop;
  3863. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3864. BEGIN
  3865. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3866. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3867. RETURN RESULT
  3868. END ".=";
  3869. (** REAL *)
  3870. PROCEDURE EEqlARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3871. VAR lval, rval: REAL;
  3872. BEGIN
  3873. WHILE (len > 0) DO
  3874. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3875. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3876. END;
  3877. END EEqlARARLoop;
  3878. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3879. BEGIN
  3880. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3881. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3882. RETURN RESULT
  3883. END ".=";
  3884. (** LONGREAL *)
  3885. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3886. VAR lval, rval: LONGREAL;
  3887. BEGIN
  3888. WHILE (len > 0) DO
  3889. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3890. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3891. END;
  3892. END EEqlAXAXLoop;
  3893. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3894. BEGIN
  3895. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3896. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3897. RETURN RESULT
  3898. END ".=";
  3899. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3900. (** BOOLEAN *)
  3901. PROCEDURE EEqlABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3902. VAR lval, rval: BOOLEAN;
  3903. BEGIN
  3904. SYSTEM.GET( radr, rval );
  3905. WHILE (len > 0) DO
  3906. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3907. INC( dadr, dinc ); DEC( len );
  3908. END;
  3909. END EEqlABSBLoop;
  3910. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3911. BEGIN
  3912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3913. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3914. RETURN RESULT
  3915. END ".=";
  3916. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3917. BEGIN
  3918. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3919. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3920. RETURN RESULT
  3921. END ".=";
  3922. (** SHORTINT *)
  3923. PROCEDURE EEqlASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3924. VAR lval, rval: SHORTINT;
  3925. BEGIN
  3926. SYSTEM.GET( radr, rval );
  3927. WHILE (len > 0) DO
  3928. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3929. INC( dadr, dinc ); DEC( len );
  3930. END;
  3931. END EEqlASSSLoop;
  3932. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3933. BEGIN
  3934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3935. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3936. RETURN RESULT
  3937. END ".=";
  3938. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3939. BEGIN
  3940. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3941. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3942. RETURN RESULT
  3943. END ".=";
  3944. (** INTEGER *)
  3945. PROCEDURE EEqlAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3946. VAR lval, rval: INTEGER;
  3947. BEGIN
  3948. SYSTEM.GET( radr, rval );
  3949. WHILE (len > 0) DO
  3950. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3951. INC( dadr, dinc ); DEC( len );
  3952. END;
  3953. END EEqlAISILoop;
  3954. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3955. BEGIN
  3956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3957. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3958. RETURN RESULT
  3959. END ".=";
  3960. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3961. BEGIN
  3962. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3963. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3964. RETURN RESULT
  3965. END ".=";
  3966. (** LONGINT *)
  3967. PROCEDURE EEqlALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3968. VAR lval, rval: LONGINT;
  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 EEqlALSLLoop;
  3976. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3977. BEGIN
  3978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3979. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3980. RETURN RESULT
  3981. END ".=";
  3982. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  3983. BEGIN
  3984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3985. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3986. RETURN RESULT
  3987. END ".=";
  3988. (** REAL *)
  3989. PROCEDURE EEqlARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3990. VAR lval, rval: REAL;
  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 EEqlARSRLoop;
  3998. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  3999. BEGIN
  4000. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4001. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4002. RETURN RESULT
  4003. END ".=";
  4004. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4005. BEGIN
  4006. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4007. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4008. RETURN RESULT
  4009. END ".=";
  4010. (** LONGREAL *)
  4011. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4012. VAR lval, rval: LONGREAL;
  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 EEqlAXSXLoop;
  4020. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4021. BEGIN
  4022. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4023. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4024. RETURN RESULT
  4025. END ".=";
  4026. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4027. BEGIN
  4028. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4029. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4030. RETURN RESULT
  4031. END ".=";
  4032. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4033. (** BOOLEAN *)
  4034. PROCEDURE ENeqABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4035. VAR lval, rval: BOOLEAN;
  4036. BEGIN
  4037. WHILE (len > 0) DO
  4038. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4039. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4040. END;
  4041. END ENeqABABLoop;
  4042. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4043. BEGIN
  4044. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4045. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4046. RETURN RESULT
  4047. END ".#";
  4048. (** SHORTINT *)
  4049. PROCEDURE ENeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4050. VAR lval, rval: SHORTINT;
  4051. BEGIN
  4052. WHILE (len > 0) DO
  4053. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4054. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4055. END;
  4056. END ENeqASASLoop;
  4057. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4058. BEGIN
  4059. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4060. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4061. RETURN RESULT
  4062. END ".#";
  4063. (** INTEGER*)
  4064. PROCEDURE ENeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4065. VAR lval, rval: INTEGER;
  4066. BEGIN
  4067. WHILE (len > 0) DO
  4068. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4069. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4070. END;
  4071. END ENeqAIAILoop;
  4072. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4073. BEGIN
  4074. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4075. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4076. RETURN RESULT
  4077. END ".#";
  4078. (** LONGINT*)
  4079. PROCEDURE ENeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4080. VAR lval, rval: LONGINT;
  4081. BEGIN
  4082. WHILE (len > 0) DO
  4083. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4084. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4085. END;
  4086. END ENeqALALLoop;
  4087. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4088. BEGIN
  4089. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4090. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4091. RETURN RESULT
  4092. END ".#";
  4093. (** REAL *)
  4094. PROCEDURE ENeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4095. VAR lval, rval: REAL;
  4096. BEGIN
  4097. WHILE (len > 0) DO
  4098. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4099. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4100. END;
  4101. END ENeqARARLoop;
  4102. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4103. BEGIN
  4104. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4105. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4106. RETURN RESULT
  4107. END ".#";
  4108. (** LONGREAL *)
  4109. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4110. VAR lval, rval: LONGREAL;
  4111. BEGIN
  4112. WHILE (len > 0) DO
  4113. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4114. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4115. END;
  4116. END ENeqAXAXLoop;
  4117. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4118. BEGIN
  4119. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4120. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4121. RETURN RESULT
  4122. END ".#";
  4123. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4124. (** BOOLEAN *)
  4125. PROCEDURE ENeqABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4126. VAR lval, rval: BOOLEAN;
  4127. BEGIN
  4128. SYSTEM.GET( radr, rval );
  4129. WHILE (len > 0) DO
  4130. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4131. INC( dadr, dinc ); DEC( len );
  4132. END;
  4133. END ENeqABSBLoop;
  4134. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4135. BEGIN
  4136. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4137. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4138. RETURN RESULT
  4139. END ".#";
  4140. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4141. BEGIN
  4142. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4143. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4144. RETURN RESULT
  4145. END ".#";
  4146. (** SHORTINT *)
  4147. PROCEDURE ENeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4148. VAR lval, rval: SHORTINT;
  4149. BEGIN
  4150. SYSTEM.GET( radr, rval );
  4151. WHILE (len > 0) DO
  4152. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4153. INC( dadr, dinc ); DEC( len );
  4154. END;
  4155. END ENeqASSSLoop;
  4156. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4157. BEGIN
  4158. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4159. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4160. RETURN RESULT
  4161. END ".#";
  4162. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4163. BEGIN
  4164. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4165. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4166. RETURN RESULT
  4167. END ".#";
  4168. (** INTEGER *)
  4169. PROCEDURE ENeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4170. VAR lval, rval: INTEGER;
  4171. BEGIN
  4172. SYSTEM.GET( radr, rval );
  4173. WHILE (len > 0) DO
  4174. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4175. INC( dadr, dinc ); DEC( len );
  4176. END;
  4177. END ENeqAISILoop;
  4178. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4179. BEGIN
  4180. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4181. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4182. RETURN RESULT
  4183. END ".#";
  4184. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4185. BEGIN
  4186. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4187. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4188. RETURN RESULT
  4189. END ".#";
  4190. (** LONGINT *)
  4191. PROCEDURE ENeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4192. VAR lval, rval: LONGINT;
  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 ENeqALSLLoop;
  4200. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4201. BEGIN
  4202. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4203. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4204. RETURN RESULT
  4205. END ".#";
  4206. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4207. BEGIN
  4208. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4209. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4210. RETURN RESULT
  4211. END ".#";
  4212. (** REAL *)
  4213. PROCEDURE ENeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4214. VAR lval, rval: REAL;
  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 ENeqARSRLoop;
  4222. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4223. BEGIN
  4224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4225. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4226. RETURN RESULT
  4227. END ".#";
  4228. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4229. BEGIN
  4230. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4231. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4232. RETURN RESULT
  4233. END ".#";
  4234. (** LONGREAL *)
  4235. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4236. VAR lval, rval: LONGREAL;
  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 ENeqAXSXLoop;
  4244. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4245. BEGIN
  4246. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4247. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4248. RETURN RESULT
  4249. END ".#";
  4250. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4251. BEGIN
  4252. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4253. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4254. RETURN RESULT
  4255. END ".#";
  4256. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4257. (** SHORTINT *)
  4258. PROCEDURE EGtrASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4259. VAR lval, rval: SHORTINT;
  4260. BEGIN
  4261. WHILE (len > 0) DO
  4262. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4263. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4264. END;
  4265. END EGtrASASLoop;
  4266. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4267. BEGIN
  4268. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4269. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4270. RETURN RESULT
  4271. END ".>";
  4272. (** INTEGER *)
  4273. PROCEDURE EGtrAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4274. VAR lval, rval: INTEGER;
  4275. BEGIN
  4276. WHILE (len > 0) DO
  4277. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4278. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4279. END;
  4280. END EGtrAIAILoop;
  4281. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4282. BEGIN
  4283. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4284. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4285. RETURN RESULT
  4286. END ".>";
  4287. (** LONGINT *)
  4288. PROCEDURE EGtrALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4289. VAR lval, rval: LONGINT;
  4290. BEGIN
  4291. WHILE (len > 0) DO
  4292. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4293. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4294. END;
  4295. END EGtrALALLoop;
  4296. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4297. BEGIN
  4298. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4299. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4300. RETURN RESULT
  4301. END ".>";
  4302. (** REAL *)
  4303. PROCEDURE EGtrARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4304. VAR lval, rval: REAL;
  4305. BEGIN
  4306. WHILE (len > 0) DO
  4307. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4308. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4309. END;
  4310. END EGtrARARLoop;
  4311. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4312. BEGIN
  4313. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4314. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4315. RETURN RESULT
  4316. END ".>";
  4317. (** LONGREAL *)
  4318. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4319. VAR lval, rval: LONGREAL;
  4320. BEGIN
  4321. WHILE (len > 0) DO
  4322. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4323. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4324. END;
  4325. END EGtrAXAXLoop;
  4326. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4327. BEGIN
  4328. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4329. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4330. RETURN RESULT
  4331. END ".>";
  4332. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4333. (** SHORTINT *)
  4334. PROCEDURE EGtrASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4335. VAR lval, rval: SHORTINT;
  4336. BEGIN
  4337. SYSTEM.GET( radr, rval );
  4338. WHILE (len > 0) DO
  4339. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4340. INC( dadr, dinc ); DEC( len );
  4341. END;
  4342. END EGtrASSSLoop;
  4343. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4344. BEGIN
  4345. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4346. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4347. RETURN RESULT
  4348. END ".>";
  4349. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4350. BEGIN
  4351. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4352. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4353. RETURN RESULT
  4354. END ".<";
  4355. (** INTEGER *)
  4356. PROCEDURE EGtrAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4357. VAR lval, rval: INTEGER;
  4358. BEGIN
  4359. SYSTEM.GET( radr, rval );
  4360. WHILE (len > 0) DO
  4361. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4362. INC( dadr, dinc ); DEC( len );
  4363. END;
  4364. END EGtrAISILoop;
  4365. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4366. BEGIN
  4367. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4368. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4369. RETURN RESULT
  4370. END ".>";
  4371. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4372. BEGIN
  4373. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4374. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4375. RETURN RESULT
  4376. END ".<";
  4377. (** LONGINT *)
  4378. PROCEDURE EGtrALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4379. VAR lval, rval: LONGINT;
  4380. BEGIN
  4381. SYSTEM.GET( radr, rval );
  4382. WHILE (len > 0) DO
  4383. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4384. INC( dadr, dinc ); DEC( len );
  4385. END;
  4386. END EGtrALSLLoop;
  4387. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4388. BEGIN
  4389. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4390. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4391. RETURN RESULT
  4392. END ".>";
  4393. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4394. BEGIN
  4395. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4396. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4397. RETURN RESULT
  4398. END ".<";
  4399. (** REAL *)
  4400. PROCEDURE EGtrARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4401. VAR lval, rval: REAL;
  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 EGtrARSRLoop;
  4409. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4410. BEGIN
  4411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4412. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4413. RETURN RESULT
  4414. END ".>";
  4415. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4416. BEGIN
  4417. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4418. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4419. RETURN RESULT
  4420. END ".<";
  4421. (** LONGREAL *)
  4422. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4423. VAR lval, rval: LONGREAL;
  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 EGtrAXSXLoop;
  4431. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4432. BEGIN
  4433. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4434. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4435. RETURN RESULT
  4436. END ".>";
  4437. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4438. BEGIN
  4439. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4440. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4441. RETURN RESULT
  4442. END ".<";
  4443. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4444. (** SHORTINT *)
  4445. PROCEDURE EGeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4446. VAR lval, rval: SHORTINT;
  4447. BEGIN
  4448. WHILE (len > 0) DO
  4449. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4450. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4451. END;
  4452. END EGeqASASLoop;
  4453. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4454. BEGIN
  4455. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4456. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4457. RETURN RESULT
  4458. END ".>=";
  4459. (** INTEGER *)
  4460. PROCEDURE EGeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4461. VAR lval, rval: INTEGER;
  4462. BEGIN
  4463. WHILE (len > 0) DO
  4464. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4465. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4466. END;
  4467. END EGeqAIAILoop;
  4468. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4469. BEGIN
  4470. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4471. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4472. RETURN RESULT
  4473. END ".>=";
  4474. (** LONGINT *)
  4475. PROCEDURE EGeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4476. VAR lval, rval: LONGINT;
  4477. BEGIN
  4478. WHILE (len > 0) DO
  4479. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4480. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4481. END;
  4482. END EGeqALALLoop;
  4483. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4484. BEGIN
  4485. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4486. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4487. RETURN RESULT
  4488. END ".>=";
  4489. (** REAL *)
  4490. PROCEDURE EGeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4491. VAR lval, rval: REAL;
  4492. BEGIN
  4493. WHILE (len > 0) DO
  4494. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4495. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4496. END;
  4497. END EGeqARARLoop;
  4498. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4499. BEGIN
  4500. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4501. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4502. RETURN RESULT
  4503. END ".>=";
  4504. (** LONGREAL *)
  4505. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4506. VAR lval, rval: LONGREAL;
  4507. BEGIN
  4508. WHILE (len > 0) DO
  4509. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4510. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4511. END;
  4512. END EGeqAXAXLoop;
  4513. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4514. BEGIN
  4515. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4516. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4517. RETURN RESULT
  4518. END ".>=";
  4519. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4520. (** SHORTINT *)
  4521. PROCEDURE EGeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4522. VAR lval, rval: SHORTINT;
  4523. BEGIN
  4524. SYSTEM.GET( radr, rval );
  4525. WHILE (len > 0) DO
  4526. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4527. INC( dadr, dinc ); DEC( len );
  4528. END;
  4529. END EGeqASSSLoop;
  4530. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4531. BEGIN
  4532. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4533. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4534. RETURN RESULT
  4535. END ".>=";
  4536. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4537. BEGIN
  4538. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4539. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4540. RETURN RESULT
  4541. END ".<=";
  4542. (** INTEGER *)
  4543. PROCEDURE EGeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4544. VAR lval, rval: INTEGER;
  4545. BEGIN
  4546. SYSTEM.GET( radr, rval );
  4547. WHILE (len > 0) DO
  4548. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4549. INC( dadr, dinc ); DEC( len );
  4550. END;
  4551. END EGeqAISILoop;
  4552. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4553. BEGIN
  4554. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4555. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4556. RETURN RESULT
  4557. END ".>=";
  4558. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4559. BEGIN
  4560. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4561. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4562. RETURN RESULT
  4563. END ".<=";
  4564. (** LONGINT *)
  4565. PROCEDURE EGeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4566. VAR lval, rval: LONGINT;
  4567. BEGIN
  4568. SYSTEM.GET( radr, rval );
  4569. WHILE (len > 0) DO
  4570. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4571. INC( dadr, dinc ); DEC( len );
  4572. END;
  4573. END EGeqALSLLoop;
  4574. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4575. BEGIN
  4576. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4577. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4578. RETURN RESULT
  4579. END ".>=";
  4580. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4581. BEGIN
  4582. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4583. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4584. RETURN RESULT
  4585. END ".<=";
  4586. (** REAL *)
  4587. PROCEDURE EGeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4588. VAR lval, rval: REAL;
  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 EGeqARSRLoop;
  4596. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4597. BEGIN
  4598. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4599. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4600. RETURN RESULT
  4601. END ".>=";
  4602. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4603. BEGIN
  4604. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4605. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4606. RETURN RESULT
  4607. END ".<=";
  4608. (** LONGREAL *)
  4609. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4610. VAR lval, rval: LONGREAL;
  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 EGeqAXSXLoop;
  4618. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4619. BEGIN
  4620. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4621. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4622. RETURN RESULT
  4623. END ".>=";
  4624. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4625. BEGIN
  4626. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4627. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4628. RETURN RESULT
  4629. END ".<=";
  4630. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4631. (** SHORTINT *)
  4632. PROCEDURE ELssASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4633. VAR lval, rval: SHORTINT;
  4634. BEGIN
  4635. WHILE (len > 0) DO
  4636. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4637. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4638. END;
  4639. END ELssASASLoop;
  4640. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4641. BEGIN
  4642. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4643. SIZEOF( BOOLEAN ), ELssASASLoop );
  4644. RETURN RESULT
  4645. END ".<";
  4646. (** INTEGER *)
  4647. PROCEDURE ELssAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4648. VAR lval, rval: INTEGER;
  4649. BEGIN
  4650. WHILE (len > 0) DO
  4651. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4652. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4653. END;
  4654. END ELssAIAILoop;
  4655. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4656. BEGIN
  4657. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4658. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4659. RETURN RESULT
  4660. END ".<";
  4661. (** LONGINT*)
  4662. PROCEDURE ELssALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4663. VAR lval, rval: LONGINT;
  4664. BEGIN
  4665. WHILE (len > 0) DO
  4666. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4667. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4668. END;
  4669. END ELssALALLoop;
  4670. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4671. BEGIN
  4672. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4673. SIZEOF( BOOLEAN ), ELssALALLoop );
  4674. RETURN RESULT
  4675. END ".<";
  4676. (** REAL *)
  4677. PROCEDURE ELssARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4678. VAR lval, rval: REAL;
  4679. BEGIN
  4680. WHILE (len > 0) DO
  4681. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4682. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4683. END;
  4684. END ELssARARLoop;
  4685. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4686. BEGIN
  4687. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4688. SIZEOF( BOOLEAN ), ELssARARLoop );
  4689. RETURN RESULT
  4690. END ".<";
  4691. (** LONGREAL *)
  4692. PROCEDURE ELssAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4693. VAR lval, rval: LONGREAL;
  4694. BEGIN
  4695. WHILE (len > 0) DO
  4696. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4697. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4698. END;
  4699. END ELssAXAXLoop;
  4700. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4701. BEGIN
  4702. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4703. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4704. RETURN RESULT
  4705. END ".<";
  4706. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4707. (** SHORTINT *)
  4708. PROCEDURE ELssASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4709. VAR lval, rval: SHORTINT;
  4710. BEGIN
  4711. SYSTEM.GET( radr, rval );
  4712. WHILE (len > 0) DO
  4713. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4714. INC( dadr, dinc ); DEC( len );
  4715. END;
  4716. END ELssASSSLoop;
  4717. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4718. BEGIN
  4719. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4720. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4721. RETURN RESULT
  4722. END ".<";
  4723. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4724. BEGIN
  4725. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4726. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4727. RETURN RESULT
  4728. END ".>";
  4729. (** INTEGER *)
  4730. PROCEDURE ELssAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4731. VAR lval, rval: INTEGER;
  4732. BEGIN
  4733. SYSTEM.GET( radr, rval );
  4734. WHILE (len > 0) DO
  4735. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4736. INC( dadr, dinc ); DEC( len );
  4737. END;
  4738. END ELssAISILoop;
  4739. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4740. BEGIN
  4741. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4742. SIZEOF( BOOLEAN ), ELssAISILoop );
  4743. RETURN RESULT
  4744. END ".<";
  4745. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4746. BEGIN
  4747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4748. SIZEOF( BOOLEAN ), ELssAISILoop );
  4749. RETURN RESULT
  4750. END ".>";
  4751. (** LONGINT *)
  4752. PROCEDURE ELssALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4753. VAR lval, rval: LONGINT;
  4754. BEGIN
  4755. SYSTEM.GET( radr, rval );
  4756. WHILE (len > 0) DO
  4757. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4758. INC( dadr, dinc ); DEC( len );
  4759. END;
  4760. END ELssALSLLoop;
  4761. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4762. BEGIN
  4763. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4764. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4765. RETURN RESULT
  4766. END ".<";
  4767. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4768. BEGIN
  4769. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4770. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4771. RETURN RESULT
  4772. END ".>";
  4773. (** REAL *)
  4774. PROCEDURE ELssARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4775. VAR lval, rval: REAL;
  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 ELssARSRLoop;
  4783. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4784. BEGIN
  4785. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4786. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4787. RETURN RESULT
  4788. END ".<";
  4789. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4790. BEGIN
  4791. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4792. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4793. RETURN RESULT
  4794. END ".>";
  4795. (** LONGREAL *)
  4796. PROCEDURE ELssAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4797. VAR lval, rval: LONGREAL;
  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 ELssAXSXLoop;
  4805. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4806. BEGIN
  4807. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4808. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4809. RETURN RESULT
  4810. END ".<";
  4811. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4812. BEGIN
  4813. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4814. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4815. RETURN RESULT
  4816. END ".>";
  4817. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4818. (** SHORTINT *)
  4819. PROCEDURE ELeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4820. VAR lval, rval: SHORTINT;
  4821. BEGIN
  4822. WHILE (len > 0) DO
  4823. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4824. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4825. END;
  4826. END ELeqASASLoop;
  4827. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4828. BEGIN
  4829. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4830. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4831. RETURN RESULT
  4832. END ".<=";
  4833. (** INTEGER *)
  4834. PROCEDURE ELeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4835. VAR lval, rval: INTEGER;
  4836. BEGIN
  4837. WHILE (len > 0) DO
  4838. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4839. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4840. END;
  4841. END ELeqAIAILoop;
  4842. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4843. BEGIN
  4844. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4845. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4846. RETURN RESULT
  4847. END ".<=";
  4848. (** LONGINT *)
  4849. PROCEDURE ELeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4850. VAR lval, rval: LONGINT;
  4851. BEGIN
  4852. WHILE (len > 0) DO
  4853. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4854. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4855. END;
  4856. END ELeqALALLoop;
  4857. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4858. BEGIN
  4859. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4860. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4861. RETURN RESULT
  4862. END ".<=";
  4863. (** REAL *)
  4864. PROCEDURE ELeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4865. VAR lval, rval: REAL;
  4866. BEGIN
  4867. WHILE (len > 0) DO
  4868. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4869. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4870. END;
  4871. END ELeqARARLoop;
  4872. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4873. BEGIN
  4874. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4875. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4876. RETURN RESULT
  4877. END ".<=";
  4878. (** LONGREAL*)
  4879. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4880. VAR lval, rval: LONGREAL;
  4881. BEGIN
  4882. WHILE (len > 0) DO
  4883. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4884. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4885. END;
  4886. END ELeqAXAXLoop;
  4887. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4888. BEGIN
  4889. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4890. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4891. RETURN RESULT
  4892. END ".<=";
  4893. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4894. (** SHORTINT *)
  4895. PROCEDURE ELeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4896. VAR lval, rval: SHORTINT;
  4897. BEGIN
  4898. SYSTEM.GET( radr, rval );
  4899. WHILE (len > 0) DO
  4900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4901. INC( dadr, dinc ); DEC( len );
  4902. END;
  4903. END ELeqASSSLoop;
  4904. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4905. BEGIN
  4906. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4907. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4908. RETURN RESULT
  4909. END ".<=";
  4910. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4911. BEGIN
  4912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4913. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4914. RETURN RESULT
  4915. END ".>=";
  4916. (** INTEGER *)
  4917. PROCEDURE ELeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4918. VAR lval, rval: INTEGER;
  4919. BEGIN
  4920. SYSTEM.GET( radr, rval );
  4921. WHILE (len > 0) DO
  4922. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4923. INC( dadr, dinc ); DEC( len );
  4924. END;
  4925. END ELeqAISILoop;
  4926. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4927. BEGIN
  4928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4929. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4930. RETURN RESULT
  4931. END ".<=";
  4932. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4933. BEGIN
  4934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4935. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4936. RETURN RESULT
  4937. END ".>=";
  4938. (** LONGINT *)
  4939. PROCEDURE ELeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4940. VAR lval, rval: LONGINT;
  4941. BEGIN
  4942. SYSTEM.GET( radr, rval );
  4943. WHILE (len > 0) DO
  4944. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4945. INC( dadr, dinc ); DEC( len );
  4946. END;
  4947. END ELeqALSLLoop;
  4948. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4949. BEGIN
  4950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4951. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4952. RETURN RESULT
  4953. END ".<=";
  4954. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4955. BEGIN
  4956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4957. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4958. RETURN RESULT
  4959. END ".>=";
  4960. (** REAL *)
  4961. PROCEDURE ELeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4962. VAR lval, rval: REAL;
  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 ELeqARSRLoop;
  4970. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4971. BEGIN
  4972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4973. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4974. RETURN RESULT
  4975. END ".<=";
  4976. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4977. BEGIN
  4978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4979. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4980. RETURN RESULT
  4981. END ".>=";
  4982. (** LONGREAL *)
  4983. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4984. VAR lval, rval: LONGREAL;
  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 ELeqAXSXLoop;
  4992. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4993. BEGIN
  4994. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4995. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  4996. RETURN RESULT
  4997. END ".<=";
  4998. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4999. BEGIN
  5000. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5001. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5002. RETURN RESULT
  5003. END ".>=";
  5004. (*** elementwise or, elementwise and ********************************************************************)
  5005. (** array x array *)
  5006. PROCEDURE ElOrABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  5007. VAR lval, rval: BOOLEAN;
  5008. BEGIN
  5009. WHILE (len > 0) DO
  5010. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5011. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5012. END;
  5013. END ElOrABABLoop;
  5014. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5015. BEGIN
  5016. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5017. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5018. RETURN RESULT
  5019. END "OR";
  5020. PROCEDURE ElAndABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  5021. VAR lval, rval: BOOLEAN;
  5022. BEGIN
  5023. WHILE (len > 0) DO
  5024. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5025. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5026. END;
  5027. END ElAndABABLoop;
  5028. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5029. BEGIN
  5030. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5031. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5032. RETURN RESULT
  5033. END "&";
  5034. (** array x boolean *)
  5035. PROCEDURE ElOrABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5036. VAR lval, rval: BOOLEAN;
  5037. BEGIN
  5038. SYSTEM.GET( radr, rval );
  5039. WHILE (len > 0) DO
  5040. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5041. INC( dadr, dinc ); DEC( len );
  5042. END;
  5043. END ElOrABSBLoop;
  5044. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5045. BEGIN
  5046. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5047. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5048. RETURN RESULT
  5049. END "OR";
  5050. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5051. BEGIN
  5052. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5053. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5054. RETURN RESULT
  5055. END "OR";
  5056. PROCEDURE ElAndABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5057. VAR lval, rval: BOOLEAN;
  5058. BEGIN
  5059. SYSTEM.GET( radr, rval );
  5060. WHILE (len > 0) DO
  5061. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5062. INC( dadr, dinc ); DEC( len );
  5063. END;
  5064. END ElAndABSBLoop;
  5065. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5066. BEGIN
  5067. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5068. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5069. RETURN RESULT
  5070. END "&";
  5071. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5072. BEGIN
  5073. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5074. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5075. RETURN RESULT
  5076. END "&";
  5077. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5078. (** SHORTINT *)
  5079. PROCEDURE LssASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5080. VAR lval, rval: SHORTINT;
  5081. BEGIN
  5082. WHILE (len > 0) DO
  5083. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5084. IF rval <= lval THEN RETURN FALSE END;
  5085. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5086. END;
  5087. RETURN TRUE;
  5088. END LssASASLoop;
  5089. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5090. BEGIN
  5091. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5092. END "<";
  5093. PROCEDURE GeqASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5094. VAR lval, rval: SHORTINT;
  5095. BEGIN
  5096. WHILE (len > 0) DO
  5097. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5098. IF rval > lval THEN RETURN FALSE END;
  5099. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5100. END;
  5101. RETURN TRUE;
  5102. END GeqASASLoop;
  5103. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5104. BEGIN
  5105. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5106. END ">=";
  5107. (** INTEGER *)
  5108. PROCEDURE LssAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5109. VAR lval, rval: INTEGER;
  5110. BEGIN
  5111. WHILE (len > 0) DO
  5112. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5113. IF rval <= lval THEN RETURN FALSE END;
  5114. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5115. END;
  5116. RETURN TRUE;
  5117. END LssAIAILoop;
  5118. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5119. BEGIN
  5120. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5121. END "<";
  5122. PROCEDURE GeqAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5123. VAR lval, rval: INTEGER;
  5124. BEGIN
  5125. WHILE (len > 0) DO
  5126. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5127. IF rval > lval THEN RETURN FALSE END;
  5128. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5129. END;
  5130. RETURN TRUE;
  5131. END GeqAIAILoop;
  5132. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5133. BEGIN
  5134. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5135. END ">=";
  5136. (** LONGINT *)
  5137. PROCEDURE LssALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5138. VAR lval, rval: LONGINT;
  5139. BEGIN
  5140. WHILE (len > 0) DO
  5141. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5142. IF rval <= lval THEN RETURN FALSE END;
  5143. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5144. END;
  5145. RETURN TRUE;
  5146. END LssALALLoop;
  5147. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5148. BEGIN
  5149. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5150. END "<";
  5151. PROCEDURE GeqALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5152. VAR lval, rval: LONGINT;
  5153. BEGIN
  5154. WHILE (len > 0) DO
  5155. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5156. IF rval > lval THEN RETURN FALSE END;
  5157. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5158. END;
  5159. RETURN TRUE;
  5160. END GeqALALLoop;
  5161. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5162. BEGIN
  5163. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5164. END ">=";
  5165. (** REAL *)
  5166. PROCEDURE LssARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5167. VAR lval, rval: REAL;
  5168. BEGIN
  5169. WHILE (len > 0) DO
  5170. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5171. IF rval <= lval THEN RETURN FALSE END;
  5172. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5173. END;
  5174. RETURN TRUE;
  5175. END LssARARLoop;
  5176. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5177. BEGIN
  5178. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5179. END "<";
  5180. PROCEDURE GeqARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5181. VAR lval, rval: REAL;
  5182. BEGIN
  5183. WHILE (len > 0) DO
  5184. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5185. IF rval > lval THEN RETURN FALSE END;
  5186. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5187. END;
  5188. RETURN TRUE;
  5189. END GeqARARLoop;
  5190. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5191. BEGIN
  5192. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5193. END ">=";
  5194. (** LONGREAL *)
  5195. PROCEDURE LssAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5196. VAR lval, rval: LONGREAL;
  5197. BEGIN
  5198. WHILE (len > 0) DO
  5199. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5200. IF rval <= lval THEN RETURN FALSE END;
  5201. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5202. END;
  5203. RETURN TRUE;
  5204. END LssAXAXLoop;
  5205. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5206. BEGIN
  5207. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5208. END "<";
  5209. PROCEDURE GeqAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5210. VAR lval, rval: LONGREAL;
  5211. BEGIN
  5212. WHILE (len > 0) DO
  5213. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5214. IF rval > lval THEN RETURN FALSE END;
  5215. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5216. END;
  5217. RETURN TRUE;
  5218. END GeqAXAXLoop;
  5219. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5220. BEGIN
  5221. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5222. END ">=";
  5223. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5224. (** SHORTINT *)
  5225. PROCEDURE GtrASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5226. VAR lval, rval: SHORTINT;
  5227. BEGIN
  5228. WHILE (len > 0) DO
  5229. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5230. IF rval >= lval THEN RETURN FALSE END;
  5231. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5232. END;
  5233. RETURN TRUE;
  5234. END GtrASASLoop;
  5235. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5236. BEGIN
  5237. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5238. END ">";
  5239. PROCEDURE LeqASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5240. VAR lval, rval: SHORTINT;
  5241. BEGIN
  5242. WHILE (len > 0) DO
  5243. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5244. IF rval < lval THEN RETURN FALSE END;
  5245. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5246. END;
  5247. RETURN TRUE;
  5248. END LeqASASLoop;
  5249. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5250. BEGIN
  5251. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5252. END "<=";
  5253. (** INTEGER *)
  5254. PROCEDURE GtrAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5255. VAR lval, rval: INTEGER;
  5256. BEGIN
  5257. WHILE (len > 0) DO
  5258. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5259. IF rval >= lval THEN RETURN FALSE END;
  5260. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5261. END;
  5262. RETURN TRUE;
  5263. END GtrAIAILoop;
  5264. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5265. BEGIN
  5266. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5267. END ">";
  5268. PROCEDURE LeqAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5269. VAR lval, rval: INTEGER;
  5270. BEGIN
  5271. WHILE (len > 0) DO
  5272. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5273. IF rval < lval THEN RETURN FALSE END;
  5274. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5275. END;
  5276. RETURN TRUE;
  5277. END LeqAIAILoop;
  5278. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5279. BEGIN
  5280. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5281. END "<=";
  5282. (** LONGINT *)
  5283. PROCEDURE GtrALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5284. VAR lval, rval: LONGINT;
  5285. BEGIN
  5286. WHILE (len > 0) DO
  5287. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5288. IF rval >= lval THEN RETURN FALSE END;
  5289. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5290. END;
  5291. RETURN TRUE;
  5292. END GtrALALLoop;
  5293. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5294. BEGIN
  5295. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5296. END ">";
  5297. PROCEDURE LeqALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5298. VAR lval, rval: LONGINT;
  5299. BEGIN
  5300. WHILE (len > 0) DO
  5301. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5302. IF rval < lval THEN RETURN FALSE END;
  5303. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5304. END;
  5305. RETURN TRUE;
  5306. END LeqALALLoop;
  5307. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5308. BEGIN
  5309. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5310. END "<=";
  5311. (** REAL *)
  5312. PROCEDURE GtrARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5313. VAR lval, rval: REAL;
  5314. BEGIN
  5315. WHILE (len > 0) DO
  5316. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5317. IF rval >= lval THEN RETURN FALSE END;
  5318. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5319. END;
  5320. RETURN TRUE;
  5321. END GtrARARLoop;
  5322. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5323. BEGIN
  5324. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5325. END ">";
  5326. PROCEDURE LeqARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5327. VAR lval, rval: REAL;
  5328. BEGIN
  5329. WHILE (len > 0) DO
  5330. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5331. IF rval < lval THEN RETURN FALSE END;
  5332. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5333. END;
  5334. RETURN TRUE;
  5335. END LeqARARLoop;
  5336. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5337. BEGIN
  5338. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5339. END "<=";
  5340. (** LONGREAL *)
  5341. PROCEDURE GtrAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5342. VAR lval, rval: LONGREAL;
  5343. BEGIN
  5344. WHILE (len > 0) DO
  5345. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5346. IF rval >= lval THEN RETURN FALSE END;
  5347. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5348. END;
  5349. RETURN TRUE;
  5350. END GtrAXAXLoop;
  5351. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5352. BEGIN
  5353. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5354. END ">";
  5355. PROCEDURE LeqAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5356. VAR lval, rval: LONGREAL;
  5357. BEGIN
  5358. WHILE (len > 0) DO
  5359. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5360. IF rval < lval THEN RETURN FALSE END;
  5361. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5362. END;
  5363. RETURN TRUE;
  5364. END LeqAXAXLoop;
  5365. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5366. BEGIN
  5367. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5368. END "<=";
  5369. (*** equals: array x array -> boolean ********************************************************************)
  5370. (** BOOLEAN *)
  5371. PROCEDURE EqlABABLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5372. VAR lval, rval: BOOLEAN;
  5373. BEGIN
  5374. WHILE (len > 0) DO
  5375. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5376. IF rval # lval THEN RETURN FALSE END;
  5377. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5378. END;
  5379. RETURN TRUE;
  5380. END EqlABABLoop;
  5381. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5382. BEGIN
  5383. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5384. END "=";
  5385. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5386. BEGIN
  5387. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5388. END "#";
  5389. (** SHORTINT *)
  5390. PROCEDURE EqlASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5391. VAR lval, rval: SHORTINT;
  5392. BEGIN
  5393. WHILE (len > 0) DO
  5394. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5395. IF rval # lval THEN RETURN FALSE END;
  5396. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5397. END;
  5398. RETURN TRUE;
  5399. END EqlASASLoop;
  5400. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5401. BEGIN
  5402. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5403. END "=";
  5404. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5405. BEGIN
  5406. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5407. END "#";
  5408. (** INTEGER *)
  5409. PROCEDURE EqlAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5410. VAR lval, rval: INTEGER;
  5411. BEGIN
  5412. WHILE (len > 0) DO
  5413. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5414. IF rval # lval THEN RETURN FALSE END;
  5415. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5416. END;
  5417. RETURN TRUE;
  5418. END EqlAIAILoop;
  5419. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5420. BEGIN
  5421. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5422. END "=";
  5423. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5424. BEGIN
  5425. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5426. END "#";
  5427. (** LONGINT *)
  5428. PROCEDURE EqlALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5429. VAR lval, rval: LONGINT;
  5430. BEGIN
  5431. WHILE (len > 0) DO
  5432. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5433. IF rval # lval THEN RETURN FALSE END;
  5434. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5435. END;
  5436. RETURN TRUE;
  5437. END EqlALALLoop;
  5438. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5439. BEGIN
  5440. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5441. END "=";
  5442. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5443. BEGIN
  5444. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5445. END "#";
  5446. (** REAL *)
  5447. PROCEDURE EqlARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5448. VAR lval, rval: REAL;
  5449. BEGIN
  5450. WHILE (len > 0) DO
  5451. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5452. IF rval # lval THEN RETURN FALSE END;
  5453. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5454. END;
  5455. RETURN TRUE;
  5456. END EqlARARLoop;
  5457. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5458. BEGIN
  5459. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5460. END "=";
  5461. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5462. BEGIN
  5463. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5464. END "#";
  5465. (** LONGREAL *)
  5466. PROCEDURE EqlAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5467. VAR lval, rval: LONGREAL;
  5468. BEGIN
  5469. WHILE (len > 0) DO
  5470. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5471. IF rval # lval THEN RETURN FALSE END;
  5472. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5473. END;
  5474. RETURN TRUE;
  5475. END EqlAXAXLoop;
  5476. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5477. BEGIN
  5478. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5479. END "=";
  5480. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5481. BEGIN
  5482. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5483. END "#";
  5484. (** COMPLEX *)
  5485. PROCEDURE EqlAZAZLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5486. VAR lval, rval: COMPLEX;
  5487. BEGIN
  5488. WHILE (len > 0) DO
  5489. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5490. IF rval # lval THEN RETURN FALSE END;
  5491. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5492. END;
  5493. RETURN TRUE;
  5494. END EqlAZAZLoop;
  5495. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5496. BEGIN
  5497. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5498. END "=";
  5499. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5500. BEGIN
  5501. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5502. END "#";
  5503. (** LONGCOMPLEX *)
  5504. PROCEDURE EqlALZALZLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5505. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5506. BEGIN
  5507. WHILE (len > 0) DO
  5508. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5509. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5510. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5511. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5512. END;
  5513. RETURN TRUE;
  5514. END EqlALZALZLoop;
  5515. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5516. BEGIN
  5517. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5518. END "=";
  5519. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5520. BEGIN
  5521. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5522. END "#";
  5523. (*** equals: array x scalar -> boolean ********************************************************************)
  5524. (** BOOLEAN *)
  5525. PROCEDURE EqlABSBLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5526. VAR lval, rval: BOOLEAN;
  5527. BEGIN
  5528. SYSTEM.GET( radr, rval );
  5529. WHILE (len > 0) DO
  5530. SYSTEM.GET( ladr, lval );
  5531. IF lval # rval THEN RETURN FALSE END;
  5532. INC( ladr, linc ); DEC( len );
  5533. END;
  5534. RETURN TRUE;
  5535. END EqlABSBLoop;
  5536. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5537. right: BOOLEAN ): BOOLEAN;
  5538. BEGIN
  5539. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5540. END "=";
  5541. OPERATOR "="*( left: BOOLEAN;
  5542. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5543. BEGIN
  5544. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5545. END "=";
  5546. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5547. right: BOOLEAN ): BOOLEAN;
  5548. BEGIN
  5549. RETURN ~(left = right);
  5550. END "#";
  5551. OPERATOR "#"*( left: BOOLEAN;
  5552. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5553. BEGIN
  5554. RETURN ~( left = right );
  5555. END "#";
  5556. (** SHORTINT *)
  5557. PROCEDURE EqlASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5558. VAR lval, rval: SHORTINT;
  5559. BEGIN
  5560. SYSTEM.GET( radr, rval );
  5561. WHILE (len > 0) DO
  5562. SYSTEM.GET( ladr, lval );
  5563. IF lval # rval THEN RETURN FALSE END;
  5564. INC( ladr, linc ); DEC( len );
  5565. END;
  5566. RETURN TRUE;
  5567. END EqlASSSLoop;
  5568. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5569. BEGIN
  5570. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5571. END "=";
  5572. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5573. BEGIN
  5574. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5575. END "=";
  5576. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5577. BEGIN
  5578. RETURN ~( left= right );
  5579. END "#";
  5580. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5581. BEGIN
  5582. RETURN ~( left= right );
  5583. END "#";
  5584. (** INTEGER *)
  5585. PROCEDURE EqlAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5586. VAR lval, rval: INTEGER;
  5587. BEGIN
  5588. SYSTEM.GET( radr, rval );
  5589. WHILE (len > 0) DO
  5590. SYSTEM.GET( ladr, lval );
  5591. IF lval # rval THEN RETURN FALSE END;
  5592. INC( ladr, linc ); DEC( len );
  5593. END;
  5594. RETURN TRUE;
  5595. END EqlAISILoop;
  5596. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5597. BEGIN
  5598. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5599. END "=";
  5600. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5601. BEGIN
  5602. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5603. END "=";
  5604. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5605. BEGIN
  5606. RETURN ~( left = right );
  5607. END "#";
  5608. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5609. BEGIN
  5610. RETURN ~( left = right );
  5611. END "#";
  5612. (** LONGINT *)
  5613. PROCEDURE EqlALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5614. VAR lval, rval: LONGINT;
  5615. BEGIN
  5616. SYSTEM.GET( radr, rval );
  5617. WHILE (len > 0) DO
  5618. SYSTEM.GET( ladr, lval );
  5619. IF lval # rval THEN RETURN FALSE END;
  5620. INC( ladr, linc ); DEC( len );
  5621. END;
  5622. RETURN TRUE;
  5623. END EqlALSLLoop;
  5624. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5625. right: LONGINT ): BOOLEAN;
  5626. BEGIN
  5627. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5628. END "=";
  5629. OPERATOR "="*( left: LONGINT;
  5630. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5631. BEGIN
  5632. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5633. END "=";
  5634. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5635. right: LONGINT ): BOOLEAN;
  5636. BEGIN
  5637. RETURN ~(left = right);
  5638. END "#";
  5639. OPERATOR "#"*( left: LONGINT;
  5640. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5641. BEGIN
  5642. RETURN ~(left = right);
  5643. END "#";
  5644. (** REAL *)
  5645. PROCEDURE EqlARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5646. VAR lval, rval: REAL;
  5647. BEGIN
  5648. SYSTEM.GET( radr, rval );
  5649. WHILE (len > 0) DO
  5650. SYSTEM.GET( ladr, lval );
  5651. IF lval # rval THEN RETURN FALSE END;
  5652. INC( ladr, linc ); DEC( len );
  5653. END;
  5654. RETURN TRUE;
  5655. END EqlARSRLoop;
  5656. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5657. right: REAL ): BOOLEAN;
  5658. BEGIN
  5659. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5660. END "=";
  5661. OPERATOR "="*( left: REAL;
  5662. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5663. BEGIN
  5664. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5665. END "=";
  5666. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5667. right: REAL ): BOOLEAN;
  5668. BEGIN
  5669. RETURN ~( left = right );
  5670. END "#";
  5671. OPERATOR "#"*( left: REAL;
  5672. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5673. BEGIN
  5674. RETURN ~( left = right );
  5675. END "#";
  5676. (** LONGREAL *)
  5677. PROCEDURE EqlAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5678. VAR lval, rval: LONGREAL;
  5679. BEGIN
  5680. SYSTEM.GET( radr, rval );
  5681. WHILE (len > 0) DO
  5682. SYSTEM.GET( ladr, lval );
  5683. IF lval # rval THEN RETURN FALSE END;
  5684. INC( ladr, linc ); DEC( len );
  5685. END;
  5686. RETURN TRUE;
  5687. END EqlAXSXLoop;
  5688. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5689. right: LONGREAL ): BOOLEAN;
  5690. BEGIN
  5691. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5692. END "=";
  5693. OPERATOR "="*( left: LONGREAL;
  5694. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5695. BEGIN
  5696. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5697. END "=";
  5698. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5699. right: LONGREAL ): BOOLEAN;
  5700. BEGIN
  5701. RETURN ~( left = right );
  5702. END "#";
  5703. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5704. BEGIN
  5705. RETURN ~( left= right );
  5706. END "#";
  5707. (*** gtr : array x scalar -> boolean ********************************************************************)
  5708. (** SHORTINT *)
  5709. PROCEDURE GtrASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5710. VAR lval, rval: SHORTINT;
  5711. BEGIN
  5712. SYSTEM.GET( radr, rval );
  5713. WHILE (len > 0) DO
  5714. SYSTEM.GET( ladr, lval );
  5715. IF lval <= rval THEN RETURN FALSE END;
  5716. INC( ladr, linc ); DEC( len );
  5717. END;
  5718. RETURN TRUE;
  5719. END GtrASSSLoop;
  5720. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5721. BEGIN
  5722. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5723. END ">";
  5724. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5725. BEGIN
  5726. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5727. END "<";
  5728. (** INTEGER *)
  5729. PROCEDURE GtrAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5730. VAR lval, rval: INTEGER;
  5731. BEGIN
  5732. SYSTEM.GET( radr, rval );
  5733. WHILE (len > 0) DO
  5734. SYSTEM.GET( ladr, lval );
  5735. IF lval <= rval THEN RETURN FALSE END;
  5736. INC( ladr, linc ); DEC( len );
  5737. END;
  5738. RETURN TRUE;
  5739. END GtrAISILoop;
  5740. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5741. BEGIN
  5742. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5743. END ">";
  5744. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5745. BEGIN
  5746. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5747. END "<";
  5748. (** LONGINT *)
  5749. PROCEDURE GtrALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5750. VAR lval, rval: LONGINT;
  5751. BEGIN
  5752. SYSTEM.GET( radr, rval );
  5753. WHILE (len > 0) DO
  5754. SYSTEM.GET( ladr, lval );
  5755. IF lval <= rval THEN RETURN FALSE END;
  5756. INC( ladr, linc ); DEC( len );
  5757. END;
  5758. RETURN TRUE;
  5759. END GtrALSLLoop;
  5760. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5761. BEGIN
  5762. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5763. END ">";
  5764. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5765. BEGIN
  5766. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5767. END "<";
  5768. (** REAL *)
  5769. PROCEDURE GtrARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5770. VAR lval, rval: REAL;
  5771. BEGIN
  5772. SYSTEM.GET( radr, rval );
  5773. WHILE (len > 0) DO
  5774. SYSTEM.GET( ladr, lval );
  5775. IF lval <= rval THEN RETURN FALSE END;
  5776. INC( ladr, linc ); DEC( len );
  5777. END;
  5778. RETURN TRUE;
  5779. END GtrARSRLoop;
  5780. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5781. right: REAL ): BOOLEAN;
  5782. BEGIN
  5783. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5784. END ">";
  5785. OPERATOR "<"*( left: REAL;
  5786. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5787. BEGIN
  5788. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5789. END "<";
  5790. (** LONGREAL *)
  5791. PROCEDURE GtrAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5792. VAR lval, rval: LONGREAL;
  5793. BEGIN
  5794. SYSTEM.GET( radr, rval );
  5795. WHILE (len > 0) DO
  5796. SYSTEM.GET( ladr, lval );
  5797. IF lval <= rval THEN RETURN FALSE END;
  5798. INC( ladr, linc ); DEC( len );
  5799. END;
  5800. RETURN TRUE;
  5801. END GtrAXSXLoop;
  5802. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5803. right: LONGREAL ): BOOLEAN;
  5804. BEGIN
  5805. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5806. END ">";
  5807. OPERATOR "<"*( left: LONGREAL;
  5808. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5809. BEGIN
  5810. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5811. END "<";
  5812. (*** geq : array x scalar -> boolean ********************************************************************)
  5813. (** SHORTINT *)
  5814. PROCEDURE GeqASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5815. VAR lval, rval: SHORTINT;
  5816. BEGIN
  5817. SYSTEM.GET( radr, rval );
  5818. WHILE (len > 0) DO
  5819. SYSTEM.GET( ladr, lval );
  5820. IF lval < rval THEN RETURN FALSE END;
  5821. INC( ladr, linc ); DEC( len );
  5822. END;
  5823. RETURN TRUE;
  5824. END GeqASSSLoop;
  5825. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5826. right: SHORTINT ): BOOLEAN;
  5827. BEGIN
  5828. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5829. END ">=";
  5830. OPERATOR "<="*( left: SHORTINT;
  5831. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5832. BEGIN
  5833. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5834. END "<=";
  5835. (** INTEGER *)
  5836. PROCEDURE GeqAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5837. VAR lval, rval: INTEGER;
  5838. BEGIN
  5839. SYSTEM.GET( radr, rval );
  5840. WHILE (len > 0) DO
  5841. SYSTEM.GET( ladr, lval );
  5842. IF lval < rval THEN RETURN FALSE END;
  5843. INC( ladr, linc ); DEC( len );
  5844. END;
  5845. RETURN TRUE;
  5846. END GeqAISILoop;
  5847. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5848. BEGIN
  5849. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5850. END ">=";
  5851. OPERATOR "<="*( left: INTEGER;
  5852. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5853. BEGIN
  5854. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5855. END "<=";
  5856. (** LONGINT *)
  5857. PROCEDURE GeqALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5858. VAR lval, rval: LONGINT;
  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 GeqALSLLoop;
  5868. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5869. right: LONGINT ): BOOLEAN;
  5870. BEGIN
  5871. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5872. END ">=";
  5873. OPERATOR "<="*( left: LONGINT;
  5874. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5875. BEGIN
  5876. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5877. END "<=";
  5878. (** REAL *)
  5879. PROCEDURE GeqARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5880. VAR lval, rval: REAL;
  5881. BEGIN
  5882. SYSTEM.GET( radr, rval );
  5883. WHILE (len > 0) DO
  5884. SYSTEM.GET( ladr, lval );
  5885. IF lval < rval THEN RETURN FALSE END;
  5886. INC( ladr, linc ); DEC( len );
  5887. END;
  5888. RETURN TRUE;
  5889. END GeqARSRLoop;
  5890. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5891. right: REAL ): BOOLEAN;
  5892. BEGIN
  5893. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5894. END ">=";
  5895. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5896. BEGIN
  5897. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5898. END "<=";
  5899. (** LONGREAL *)
  5900. PROCEDURE GeqAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5901. VAR lval, rval: LONGREAL;
  5902. BEGIN
  5903. SYSTEM.GET( radr, rval );
  5904. WHILE (len > 0) DO
  5905. SYSTEM.GET( ladr, lval );
  5906. IF lval < rval THEN RETURN FALSE END;
  5907. INC( ladr, linc ); DEC( len );
  5908. END;
  5909. RETURN TRUE;
  5910. END GeqAXSXLoop;
  5911. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5912. BEGIN
  5913. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5914. END ">=";
  5915. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5916. BEGIN
  5917. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5918. END "<=";
  5919. (*** leq : array x scalar -> boolean ********************************************************************)
  5920. (** SHORTINT *)
  5921. PROCEDURE LeqASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5922. VAR lval, rval: SHORTINT;
  5923. BEGIN
  5924. SYSTEM.GET( radr, rval );
  5925. WHILE (len > 0) DO
  5926. SYSTEM.GET( ladr, lval );
  5927. IF lval > rval THEN RETURN FALSE END;
  5928. INC( ladr, linc ); DEC( len );
  5929. END;
  5930. RETURN TRUE;
  5931. END LeqASSSLoop;
  5932. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5933. BEGIN
  5934. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5935. END "<=";
  5936. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5937. BEGIN
  5938. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5939. END ">=";
  5940. (** INTEGER *)
  5941. PROCEDURE LeqAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5942. VAR lval, rval: INTEGER;
  5943. BEGIN
  5944. SYSTEM.GET( radr, rval );
  5945. WHILE (len > 0) DO
  5946. SYSTEM.GET( ladr, lval );
  5947. IF lval > rval THEN RETURN FALSE END;
  5948. INC( ladr, linc ); DEC( len );
  5949. END;
  5950. RETURN TRUE;
  5951. END LeqAISILoop;
  5952. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5953. BEGIN
  5954. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5955. END "<=";
  5956. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5957. BEGIN
  5958. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5959. END ">=";
  5960. (** LONGINT *)
  5961. PROCEDURE LeqALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5962. VAR lval, rval: LONGINT;
  5963. BEGIN
  5964. SYSTEM.GET( radr, rval );
  5965. WHILE (len > 0) DO
  5966. SYSTEM.GET( ladr, lval );
  5967. IF lval > rval THEN RETURN FALSE END;
  5968. INC( ladr, linc ); DEC( len );
  5969. END;
  5970. RETURN TRUE;
  5971. END LeqALSLLoop;
  5972. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5973. BEGIN
  5974. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  5975. END "<=";
  5976. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5977. BEGIN
  5978. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  5979. END ">=";
  5980. (** REAL *)
  5981. PROCEDURE LeqARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5982. VAR lval, rval: REAL;
  5983. BEGIN
  5984. SYSTEM.GET( radr, rval );
  5985. WHILE (len > 0) DO
  5986. SYSTEM.GET( ladr, lval );
  5987. IF lval > rval THEN RETURN FALSE END;
  5988. INC( ladr, linc ); DEC( len );
  5989. END;
  5990. RETURN TRUE;
  5991. END LeqARSRLoop;
  5992. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  5993. BEGIN
  5994. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  5995. END "<=";
  5996. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5997. BEGIN
  5998. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  5999. END ">=";
  6000. (** LONGREAL *)
  6001. PROCEDURE LeqAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6002. VAR lval, rval: LONGREAL;
  6003. BEGIN
  6004. SYSTEM.GET( radr, rval );
  6005. WHILE (len > 0) DO
  6006. SYSTEM.GET( ladr, lval );
  6007. IF lval > rval THEN RETURN FALSE END;
  6008. INC( ladr, linc ); DEC( len );
  6009. END;
  6010. RETURN TRUE;
  6011. END LeqAXSXLoop;
  6012. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6013. BEGIN
  6014. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6015. END "<=";
  6016. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6017. BEGIN
  6018. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6019. END ">=";
  6020. (*** lss: array x scalar -> boolean ********************************************************************)
  6021. (** SHORTINT *)
  6022. PROCEDURE LssASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6023. VAR lval, rval: SHORTINT;
  6024. BEGIN
  6025. SYSTEM.GET( radr, rval );
  6026. WHILE (len > 0) DO
  6027. SYSTEM.GET( ladr, lval );
  6028. IF lval >= rval THEN RETURN FALSE END;
  6029. INC( ladr, linc ); DEC( len );
  6030. END;
  6031. RETURN TRUE;
  6032. END LssASSSLoop;
  6033. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6034. BEGIN
  6035. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6036. END "<";
  6037. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6038. BEGIN
  6039. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6040. END ">";
  6041. (** INTEGER *)
  6042. PROCEDURE LssAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6043. VAR lval, rval: INTEGER;
  6044. BEGIN
  6045. SYSTEM.GET( radr, rval );
  6046. WHILE (len > 0) DO
  6047. SYSTEM.GET( ladr, lval );
  6048. IF lval >= rval THEN RETURN FALSE END;
  6049. INC( ladr, linc ); DEC( len );
  6050. END;
  6051. RETURN TRUE;
  6052. END LssAISILoop;
  6053. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6054. BEGIN
  6055. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6056. END "<";
  6057. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6058. BEGIN
  6059. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6060. END ">";
  6061. (** LONGINT *)
  6062. PROCEDURE LssALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6063. VAR lval, rval: LONGINT;
  6064. BEGIN
  6065. SYSTEM.GET( radr, rval );
  6066. WHILE (len > 0) DO
  6067. SYSTEM.GET( ladr, lval );
  6068. IF lval >= rval THEN RETURN FALSE END;
  6069. INC( ladr, linc ); DEC( len );
  6070. END;
  6071. RETURN TRUE;
  6072. END LssALSLLoop;
  6073. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6074. BEGIN
  6075. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6076. END "<";
  6077. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6078. BEGIN
  6079. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6080. END ">";
  6081. (** REAL *)
  6082. PROCEDURE LssARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6083. VAR lval, rval: REAL;
  6084. BEGIN
  6085. SYSTEM.GET( radr, rval );
  6086. WHILE (len > 0) DO
  6087. SYSTEM.GET( ladr, lval );
  6088. IF lval >= rval THEN RETURN FALSE END;
  6089. INC( ladr, linc ); DEC( len );
  6090. END;
  6091. RETURN TRUE;
  6092. END LssARSRLoop;
  6093. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6094. right: REAL ): BOOLEAN;
  6095. BEGIN
  6096. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6097. END "<";
  6098. OPERATOR ">"*( left: REAL;
  6099. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6100. BEGIN
  6101. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6102. END ">";
  6103. (** LONGREAL *)
  6104. PROCEDURE LssAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6105. VAR lval, rval: LONGREAL;
  6106. BEGIN
  6107. SYSTEM.GET( radr, rval );
  6108. WHILE (len > 0) DO
  6109. SYSTEM.GET( ladr, lval );
  6110. IF lval >= rval THEN RETURN FALSE END;
  6111. INC( ladr, linc ); DEC( len );
  6112. END;
  6113. RETURN TRUE;
  6114. END LssAXSXLoop;
  6115. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6116. right: LONGREAL ): BOOLEAN;
  6117. BEGIN
  6118. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6119. END "<";
  6120. OPERATOR ">"*( left: LONGREAL;
  6121. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6122. BEGIN
  6123. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6124. END ">";
  6125. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6126. PROCEDURE MaxAXSXLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6127. VAR lval, val: LONGREAL;
  6128. BEGIN
  6129. SYSTEM.GET( radr, val );
  6130. WHILE (len > 0) DO
  6131. SYSTEM.GET( ladr, lval );
  6132. INC( ladr, linc ); DEC( len );
  6133. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6134. INC(dadr,dinc);
  6135. END;
  6136. END MaxAXSXLoop;
  6137. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6138. TYPE Type = LONGREAL;
  6139. BEGIN
  6140. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6141. RETURN RESULT
  6142. END "MAX";
  6143. PROCEDURE MaxARSRLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6144. VAR lval, val: REAL;
  6145. BEGIN
  6146. SYSTEM.GET( radr, val );
  6147. WHILE (len > 0) DO
  6148. SYSTEM.GET( ladr, lval );
  6149. INC( ladr, linc ); DEC( len );
  6150. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6151. INC(dadr,dinc);
  6152. END;
  6153. END MaxARSRLoop;
  6154. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6155. TYPE Type = REAL;
  6156. BEGIN
  6157. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6158. RETURN RESULT
  6159. END "MAX";
  6160. PROCEDURE MaxALSLLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6161. VAR lval, val: LONGINT;
  6162. BEGIN
  6163. SYSTEM.GET( radr, val );
  6164. WHILE (len > 0) DO
  6165. SYSTEM.GET( ladr, lval );
  6166. INC( ladr, linc ); DEC( len );
  6167. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6168. INC(dadr,dinc);
  6169. END;
  6170. END MaxALSLLoop;
  6171. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6172. TYPE Type = LONGINT;
  6173. BEGIN
  6174. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6175. RETURN RESULT
  6176. END "MAX";
  6177. PROCEDURE MaxAISILoop( ladr, radr, dadr, linc, dinc, len: Address );
  6178. VAR lval, val: INTEGER;
  6179. BEGIN
  6180. SYSTEM.GET( radr, val );
  6181. WHILE (len > 0) DO
  6182. SYSTEM.GET( ladr, lval );
  6183. INC( ladr, linc ); DEC( len );
  6184. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6185. INC(dadr,dinc);
  6186. END;
  6187. END MaxAISILoop;
  6188. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6189. TYPE Type = INTEGER;
  6190. BEGIN
  6191. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6192. RETURN RESULT
  6193. END "MAX";
  6194. PROCEDURE MaxASSSLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6195. VAR lval, val: SHORTINT;
  6196. BEGIN
  6197. SYSTEM.GET( radr, val );
  6198. WHILE (len > 0) DO
  6199. SYSTEM.GET( ladr, lval );
  6200. INC( ladr, linc ); DEC( len );
  6201. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6202. INC(dadr,dinc);
  6203. END;
  6204. END MaxASSSLoop;
  6205. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6206. TYPE Type = SHORTINT;
  6207. BEGIN
  6208. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6209. RETURN RESULT
  6210. END "MAX";
  6211. PROCEDURE MinAXSXLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6212. VAR lval, val: LONGREAL;
  6213. BEGIN
  6214. SYSTEM.GET( radr, val );
  6215. WHILE (len > 0) DO
  6216. SYSTEM.GET( ladr, lval );
  6217. INC( ladr, linc ); DEC( len );
  6218. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6219. INC(dadr,dinc);
  6220. END;
  6221. END MinAXSXLoop;
  6222. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6223. TYPE Type = LONGREAL;
  6224. BEGIN
  6225. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6226. RETURN RESULT
  6227. END "MIN";
  6228. PROCEDURE MinARSRLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6229. VAR lval, val: REAL;
  6230. BEGIN
  6231. SYSTEM.GET( radr, val );
  6232. WHILE (len > 0) DO
  6233. SYSTEM.GET( ladr, lval );
  6234. INC( ladr, linc ); DEC( len );
  6235. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6236. INC(dadr,dinc);
  6237. END;
  6238. END MinARSRLoop;
  6239. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6240. TYPE Type = REAL;
  6241. BEGIN
  6242. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6243. RETURN RESULT
  6244. END "MIN";
  6245. PROCEDURE MinALSLLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6246. VAR lval, val: LONGINT;
  6247. BEGIN
  6248. SYSTEM.GET( radr, val );
  6249. WHILE (len > 0) DO
  6250. SYSTEM.GET( ladr, lval );
  6251. INC( ladr, linc ); DEC( len );
  6252. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6253. INC(dadr,dinc);
  6254. END;
  6255. END MinALSLLoop;
  6256. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6257. TYPE Type = LONGINT;
  6258. BEGIN
  6259. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6260. RETURN RESULT
  6261. END "MIN";
  6262. PROCEDURE MinAISILoop( ladr, radr, dadr, linc, dinc, len: Address );
  6263. VAR lval, val: INTEGER;
  6264. BEGIN
  6265. SYSTEM.GET( radr, val );
  6266. WHILE (len > 0) DO
  6267. SYSTEM.GET( ladr, lval );
  6268. INC( ladr, linc ); DEC( len );
  6269. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6270. INC(dadr,dinc);
  6271. END;
  6272. END MinAISILoop;
  6273. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6274. TYPE Type = INTEGER;
  6275. BEGIN
  6276. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6277. RETURN RESULT
  6278. END "MIN";
  6279. PROCEDURE MinASSSLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6280. VAR lval, val: SHORTINT;
  6281. BEGIN
  6282. SYSTEM.GET( radr, val );
  6283. WHILE (len > 0) DO
  6284. SYSTEM.GET( ladr, lval );
  6285. INC( ladr, linc ); DEC( len );
  6286. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6287. INC(dadr,dinc);
  6288. END;
  6289. END MinASSSLoop;
  6290. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6291. TYPE Type = SHORTINT;
  6292. BEGIN
  6293. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6294. RETURN RESULT
  6295. END "MIN";
  6296. (**** binary max/min operators array x array -> array ********************************************************************)
  6297. PROCEDURE MaxAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6298. VAR lval, rval: LONGREAL;
  6299. BEGIN
  6300. WHILE (len > 0) DO
  6301. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6302. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6303. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6304. INC(dadr,dinc);
  6305. END;
  6306. END MaxAXAXLoop;
  6307. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6308. BEGIN
  6309. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6310. RETURN RESULT
  6311. END "MAX";
  6312. PROCEDURE MaxARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6313. VAR lval, rval: REAL ;
  6314. BEGIN
  6315. WHILE (len > 0) DO
  6316. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6317. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6318. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6319. INC(dadr,dinc);
  6320. END;
  6321. END MaxARARLoop;
  6322. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6323. BEGIN
  6324. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6325. RETURN RESULT
  6326. END "MAX";
  6327. PROCEDURE MaxALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6328. VAR lval, rval: LONGINT;
  6329. BEGIN
  6330. WHILE (len > 0) DO
  6331. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6332. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6333. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6334. INC(dadr,dinc);
  6335. END;
  6336. END MaxALALLoop;
  6337. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6338. BEGIN
  6339. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6340. RETURN RESULT
  6341. END "MAX";
  6342. PROCEDURE MaxAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6343. VAR lval, rval: INTEGER;
  6344. BEGIN
  6345. WHILE (len > 0) DO
  6346. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6347. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6348. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6349. INC(dadr,dinc);
  6350. END;
  6351. END MaxAIAILoop;
  6352. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6353. BEGIN
  6354. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6355. RETURN RESULT
  6356. END "MAX";
  6357. PROCEDURE MaxASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6358. VAR lval, rval: SHORTINT;
  6359. BEGIN
  6360. WHILE (len > 0) DO
  6361. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6362. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6363. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6364. INC(dadr,dinc);
  6365. END;
  6366. END MaxASASLoop;
  6367. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6368. BEGIN
  6369. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6370. RETURN RESULT
  6371. END "MAX";
  6372. PROCEDURE MinAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6373. VAR lval, rval: LONGREAL;
  6374. BEGIN
  6375. WHILE (len > 0) DO
  6376. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6377. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6378. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6379. INC(dadr,dinc);
  6380. END;
  6381. END MinAXAXLoop;
  6382. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6383. BEGIN
  6384. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6385. RETURN RESULT
  6386. END "MIN";
  6387. PROCEDURE MinARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6388. VAR lval, rval: REAL ;
  6389. BEGIN
  6390. WHILE (len > 0) DO
  6391. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6392. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6393. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6394. INC(dadr,dinc);
  6395. END;
  6396. END MinARARLoop;
  6397. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6398. BEGIN
  6399. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6400. RETURN RESULT
  6401. END "MIN";
  6402. PROCEDURE MinALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6403. VAR lval, rval: LONGINT;
  6404. BEGIN
  6405. WHILE (len > 0) DO
  6406. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6407. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6408. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6409. INC(dadr,dinc);
  6410. END;
  6411. END MinALALLoop;
  6412. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6413. BEGIN
  6414. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6415. RETURN RESULT
  6416. END "MIN";
  6417. PROCEDURE MinAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6418. VAR lval, rval: INTEGER;
  6419. BEGIN
  6420. WHILE (len > 0) DO
  6421. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6422. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6423. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6424. INC(dadr,dinc);
  6425. END;
  6426. END MinAIAILoop;
  6427. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6428. BEGIN
  6429. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6430. RETURN RESULT
  6431. END "MIN";
  6432. PROCEDURE MinASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6433. VAR lval, rval: SHORTINT;
  6434. BEGIN
  6435. WHILE (len > 0) DO
  6436. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6437. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6438. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6439. INC(dadr,dinc);
  6440. END;
  6441. END MinASASLoop;
  6442. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6443. BEGIN
  6444. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6445. RETURN RESULT
  6446. END "MIN";
  6447. (**** unary operators array -> scalar ********************************************************************)
  6448. (*** min: array -> scalar ****************************************)
  6449. (** SHORTINT *)
  6450. PROCEDURE MinASLoop( ladr, dadr, linc, len: LONGINT );
  6451. VAR lval, dval: SHORTINT;
  6452. BEGIN
  6453. SYSTEM.GET( dadr, dval );
  6454. WHILE (len > 0) DO
  6455. SYSTEM.GET( ladr, lval );
  6456. IF lval < dval THEN dval := lval END;
  6457. INC( ladr, linc ); DEC( len );
  6458. END;
  6459. SYSTEM.PUT( dadr, dval );
  6460. END MinASLoop;
  6461. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6462. TYPE Type = SHORTINT;
  6463. VAR val: Type;
  6464. BEGIN
  6465. val := MAX( Type );
  6466. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6467. END "MIN";
  6468. (** INTEGER *)
  6469. PROCEDURE MinAILoop( ladr, dadr, linc, len: LONGINT );
  6470. VAR lval, dval: INTEGER;
  6471. BEGIN
  6472. SYSTEM.GET( dadr, dval );
  6473. WHILE (len > 0) DO
  6474. SYSTEM.GET( ladr, lval );
  6475. IF lval < dval THEN dval := lval END;
  6476. INC( ladr, linc ); DEC( len );
  6477. END;
  6478. SYSTEM.PUT( dadr, dval );
  6479. END MinAILoop;
  6480. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6481. TYPE Type = INTEGER;
  6482. VAR val: Type;
  6483. BEGIN
  6484. val := MAX( Type );
  6485. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6486. END "MIN";
  6487. (** LONGINT *)
  6488. PROCEDURE MinALLoop( ladr, dadr, linc, len: LONGINT );
  6489. VAR lval, dval: LONGINT;
  6490. BEGIN
  6491. SYSTEM.GET( dadr, dval );
  6492. WHILE (len > 0) DO
  6493. SYSTEM.GET( ladr, lval );
  6494. IF lval < dval THEN dval := lval END;
  6495. INC( ladr, linc ); DEC( len );
  6496. END;
  6497. SYSTEM.PUT( dadr, dval );
  6498. END MinALLoop;
  6499. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6500. TYPE Type = LONGINT;
  6501. VAR val: Type;
  6502. BEGIN
  6503. val := MAX( Type );
  6504. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6505. END "MIN";
  6506. (** REAL *)
  6507. PROCEDURE MinARLoop( ladr, dadr, linc, len: LONGINT );
  6508. VAR lval, dval: REAL;
  6509. BEGIN
  6510. SYSTEM.GET( dadr, dval );
  6511. WHILE (len > 0) DO
  6512. SYSTEM.GET( ladr, lval );
  6513. IF lval < dval THEN dval := lval END;
  6514. INC( ladr, linc ); DEC( len );
  6515. END;
  6516. SYSTEM.PUT( dadr, dval );
  6517. END MinARLoop;
  6518. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6519. TYPE Type = REAL;
  6520. VAR val: Type;
  6521. BEGIN
  6522. val := MAX( Type );
  6523. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6524. END "MIN";
  6525. (** LONGREAL *)
  6526. PROCEDURE MinAXLoop( ladr, dadr, linc, len: LONGINT );
  6527. VAR lval, dval: LONGREAL;
  6528. BEGIN
  6529. SYSTEM.GET( dadr, dval );
  6530. WHILE (len > 0) DO
  6531. SYSTEM.GET( ladr, lval );
  6532. IF lval < dval THEN dval := lval END;
  6533. INC( ladr, linc ); DEC( len );
  6534. END;
  6535. SYSTEM.PUT( dadr, dval );
  6536. END MinAXLoop;
  6537. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6538. TYPE Type = LONGREAL;
  6539. VAR val: Type;
  6540. BEGIN
  6541. val := MAX( Type );
  6542. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6543. END "MIN";
  6544. (*** max: array -> scalar ********************************************************************)
  6545. (** SHORTINT *)
  6546. PROCEDURE MaxASLoop( ladr, dadr, linc, len: LONGINT );
  6547. VAR lval, dval: SHORTINT;
  6548. BEGIN
  6549. SYSTEM.GET( dadr, dval );
  6550. WHILE (len > 0) DO
  6551. SYSTEM.GET( ladr, lval );
  6552. IF lval > dval THEN dval := lval END;
  6553. INC( ladr, linc ); DEC( len );
  6554. END;
  6555. SYSTEM.PUT( dadr, dval );
  6556. END MaxASLoop;
  6557. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6558. TYPE Type = SHORTINT;
  6559. VAR val: Type;
  6560. BEGIN
  6561. val := MIN( Type );
  6562. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6563. END "MAX";
  6564. (** INTEGER *)
  6565. PROCEDURE MaxAILoop( ladr, dadr, linc, len: LONGINT );
  6566. VAR lval, dval: INTEGER;
  6567. BEGIN
  6568. SYSTEM.GET( dadr, dval );
  6569. WHILE (len > 0) DO
  6570. SYSTEM.GET( ladr, lval );
  6571. IF lval > dval THEN dval := lval END;
  6572. INC( ladr, linc ); DEC( len );
  6573. END;
  6574. SYSTEM.PUT( dadr, dval );
  6575. END MaxAILoop;
  6576. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6577. TYPE Type = INTEGER;
  6578. VAR val: Type;
  6579. BEGIN
  6580. val := MIN( Type );
  6581. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6582. END "MAX";
  6583. (** LONGINT *)
  6584. PROCEDURE MaxALLoop( ladr, dadr, linc, len: LONGINT );
  6585. VAR lval, dval: LONGINT;
  6586. BEGIN
  6587. SYSTEM.GET( dadr, dval );
  6588. WHILE (len > 0) DO
  6589. SYSTEM.GET( ladr, lval );
  6590. IF lval > dval THEN dval := lval END;
  6591. INC( ladr, linc ); DEC( len );
  6592. END;
  6593. SYSTEM.PUT( dadr, dval );
  6594. END MaxALLoop;
  6595. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6596. TYPE Type = LONGINT;
  6597. VAR val: Type;
  6598. BEGIN
  6599. val := MIN( Type );
  6600. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6601. END "MAX";
  6602. (** REAL *)
  6603. PROCEDURE MaxARLoop( ladr, dadr, linc, len: LONGINT );
  6604. VAR lval, dval: REAL;
  6605. BEGIN
  6606. SYSTEM.GET( dadr, dval );
  6607. WHILE (len > 0) DO
  6608. SYSTEM.GET( ladr, lval );
  6609. IF lval > dval THEN dval := lval END;
  6610. INC( ladr, linc ); DEC( len );
  6611. END;
  6612. SYSTEM.PUT( dadr, dval );
  6613. END MaxARLoop;
  6614. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6615. TYPE Type = REAL;
  6616. VAR val: Type;
  6617. BEGIN
  6618. val := MIN( Type );
  6619. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6620. END "MAX";
  6621. (** LONGREAL *)
  6622. PROCEDURE MaxAXLoop( ladr, dadr, linc, len: LONGINT );
  6623. VAR lval, dval: LONGREAL;
  6624. BEGIN
  6625. SYSTEM.GET( dadr, dval );
  6626. WHILE (len > 0) DO
  6627. SYSTEM.GET( ladr, lval );
  6628. IF lval > dval THEN dval := lval END;
  6629. INC( ladr, linc ); DEC( len );
  6630. END;
  6631. SYSTEM.PUT( dadr, dval );
  6632. END MaxAXLoop;
  6633. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6634. TYPE Type = LONGREAL;
  6635. VAR val: Type;
  6636. BEGIN
  6637. val := MIN( Type );
  6638. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6639. END "MAX";
  6640. (*** LEN: array -> array **)
  6641. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6642. VAR src,dim,i: LONGINT;
  6643. BEGIN
  6644. src := SYSTEM.VAL(LONGINT,left);
  6645. dim := GetDim( src );
  6646. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6647. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6648. RETURN RESULT
  6649. END "LEN";
  6650. (*** SUM: array -> scalar ********************************************************************)
  6651. (** SHORTINT *)
  6652. PROCEDURE SumASLoop( ladr, dadr, linc, len: LONGINT );
  6653. VAR lval, dval: SHORTINT;
  6654. BEGIN
  6655. SYSTEM.GET( dadr, dval );
  6656. WHILE (len > 0) DO
  6657. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6658. END;
  6659. SYSTEM.PUT( dadr, dval );
  6660. END SumASLoop;
  6661. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6662. TYPE Type = SHORTINT;
  6663. VAR val: Type;
  6664. BEGIN
  6665. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6666. RETURN val;
  6667. END "SUM";
  6668. (** INTEGER *)
  6669. PROCEDURE SumAILoop( ladr, dadr, linc, len: LONGINT );
  6670. VAR lval, dval: INTEGER;
  6671. BEGIN
  6672. SYSTEM.GET( dadr, dval );
  6673. WHILE (len > 0) DO
  6674. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6675. END;
  6676. SYSTEM.PUT( dadr, dval );
  6677. END SumAILoop;
  6678. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6679. TYPE Type = INTEGER;
  6680. VAR val: Type;
  6681. BEGIN
  6682. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6683. RETURN val;
  6684. END "SUM";
  6685. (** LONGINT *)
  6686. PROCEDURE SumALLoop( ladr, dadr, linc, len: LONGINT );
  6687. VAR lval, dval: LONGINT;
  6688. BEGIN
  6689. SYSTEM.GET( dadr, dval );
  6690. WHILE (len > 0) DO
  6691. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6692. END;
  6693. SYSTEM.PUT( dadr, dval );
  6694. END SumALLoop;
  6695. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6696. TYPE Type = LONGINT;
  6697. VAR val: Type;
  6698. BEGIN
  6699. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6700. RETURN val;
  6701. END "SUM";
  6702. (** REAL *)
  6703. PROCEDURE SumARLoop( ladr, dadr, linc, len: LONGINT );
  6704. VAR lval, dval: REAL;
  6705. BEGIN
  6706. SYSTEM.GET( dadr, dval );
  6707. WHILE (len > 0) DO
  6708. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6709. END;
  6710. SYSTEM.PUT( dadr, dval );
  6711. END SumARLoop;
  6712. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6713. TYPE Type = REAL;
  6714. VAR val: Type;
  6715. BEGIN
  6716. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6717. RETURN val;
  6718. END "SUM";
  6719. (** LONGREAL *)
  6720. PROCEDURE SumAXLoop( ladr, dadr, linc, len: LONGINT );
  6721. VAR lval, dval: LONGREAL;
  6722. BEGIN
  6723. SYSTEM.GET( dadr, dval );
  6724. WHILE (len > 0) DO
  6725. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6726. END;
  6727. SYSTEM.PUT( dadr, dval );
  6728. END SumAXLoop;
  6729. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6730. TYPE Type = LONGREAL;
  6731. VAR val: Type;
  6732. BEGIN
  6733. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6734. RETURN val;
  6735. END "SUM";
  6736. (** COMPLEX *)
  6737. PROCEDURE SumAZLoop( ladr, dadr, linc, len: LONGINT );
  6738. VAR lval, dval: COMPLEX;
  6739. BEGIN
  6740. SYSTEM.GET( dadr, dval );
  6741. WHILE (len > 0) DO
  6742. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6743. END;
  6744. SYSTEM.PUT( dadr, dval );
  6745. END SumAZLoop;
  6746. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6747. TYPE Type = COMPLEX;
  6748. VAR val: Type;
  6749. BEGIN
  6750. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6751. RETURN val;
  6752. END "SUM";
  6753. (** LONGCOMPLEX *)
  6754. PROCEDURE SumALZLoop( ladr, dadr, linc, len: LONGINT );
  6755. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6756. BEGIN
  6757. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6758. WHILE (len > 0) DO
  6759. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6760. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6761. INC( ladr, linc ); DEC( len );
  6762. END;
  6763. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6764. END SumALZLoop;
  6765. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6766. TYPE Type = LONGCOMPLEX;
  6767. VAR val: Type;
  6768. BEGIN
  6769. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6770. RETURN val;
  6771. END "SUM";
  6772. (*** monadic ABS array -> array ********************************************************************)
  6773. (** SHORTINT *)
  6774. PROCEDURE AbsLoopS( ladr, dadr, linc, dinc, len: LONGINT );
  6775. VAR lval: SHORTINT;
  6776. BEGIN
  6777. WHILE (len > 0) DO
  6778. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6779. INC( dadr, dinc ); DEC( len );
  6780. END;
  6781. END AbsLoopS;
  6782. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6783. BEGIN
  6784. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6785. RETURN RESULT
  6786. END "ABS";
  6787. (** INTEGER *)
  6788. PROCEDURE AbsLoopI( ladr, dadr, linc, dinc, len: LONGINT );
  6789. VAR lval: INTEGER;
  6790. BEGIN
  6791. WHILE (len > 0) DO
  6792. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6793. INC( dadr, dinc ); DEC( len );
  6794. END;
  6795. END AbsLoopI;
  6796. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6797. BEGIN
  6798. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6799. RETURN RESULT
  6800. END "ABS";
  6801. (** LONGINT *)
  6802. PROCEDURE AbsLoopL( ladr, dadr, linc, dinc, len: LONGINT );
  6803. VAR lval: LONGINT;
  6804. BEGIN
  6805. WHILE (len > 0) DO
  6806. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6807. INC( dadr, dinc ); DEC( len );
  6808. END;
  6809. END AbsLoopL;
  6810. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6811. BEGIN
  6812. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6813. RETURN RESULT
  6814. END "ABS";
  6815. (** REAL *)
  6816. PROCEDURE AbsLoopR( ladr, dadr, linc, dinc, len: LONGINT );
  6817. VAR lval: REAL;
  6818. BEGIN
  6819. WHILE (len > 0) DO
  6820. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6821. INC( dadr, dinc ); DEC( len );
  6822. END;
  6823. END AbsLoopR;
  6824. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6825. BEGIN
  6826. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6827. RETURN RESULT
  6828. END "ABS";
  6829. (** LONGREAL *)
  6830. PROCEDURE AbsLoopX( ladr, dadr, linc, dinc, len: LONGINT );
  6831. VAR lval: LONGREAL;
  6832. BEGIN
  6833. WHILE (len > 0) DO
  6834. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6835. INC( dadr, dinc ); DEC( len );
  6836. END;
  6837. END AbsLoopX;
  6838. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6839. BEGIN
  6840. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6841. RETURN RESULT
  6842. END "ABS";
  6843. (** COMPLEX *)
  6844. PROCEDURE AbsLoopZ( ladr, dadr, linc, dinc, len: LONGINT );
  6845. VAR lval: COMPLEX;
  6846. BEGIN
  6847. WHILE (len > 0) DO
  6848. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6849. INC( dadr, dinc ); DEC( len );
  6850. END;
  6851. END AbsLoopZ;
  6852. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6853. BEGIN
  6854. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6855. RETURN RESULT
  6856. END "ABS";
  6857. (** LONGCOMPLEX *)
  6858. PROCEDURE AbsLoopLZ( ladr, dadr, linc, dinc, len: LONGINT );
  6859. VAR lvalRe, lvalIm: LONGREAL;
  6860. BEGIN
  6861. WHILE (len > 0) DO
  6862. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6863. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6864. INC( ladr, linc );
  6865. INC( dadr, dinc ); DEC( len );
  6866. END;
  6867. END AbsLoopLZ;
  6868. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6869. BEGIN
  6870. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6871. RETURN RESULT
  6872. END "ABS";
  6873. (*** assign number to array (initialisation) ********************************************************************)
  6874. (** BOOLEAN *)
  6875. PROCEDURE AssignSBABLoop( ladr, dadr, dinc, len: LONGINT );
  6876. VAR lval: BOOLEAN;
  6877. BEGIN
  6878. SYSTEM.GET( ladr, lval );
  6879. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6880. END AssignSBABLoop;
  6881. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6882. BEGIN
  6883. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6884. END ":=";
  6885. (** SHORTINT*)
  6886. PROCEDURE AssignSSASLoop( ladr, dadr, dinc, len: LONGINT );
  6887. VAR lval: SHORTINT;
  6888. BEGIN
  6889. SYSTEM.GET( ladr, lval );
  6890. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6891. END AssignSSASLoop;
  6892. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6893. BEGIN
  6894. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6895. END ":=";
  6896. (**INTEGER *)
  6897. PROCEDURE AssignSIAILoop( ladr, dadr, dinc, len: LONGINT );
  6898. VAR lval: INTEGER;
  6899. BEGIN
  6900. SYSTEM.GET( ladr, lval );
  6901. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6902. END AssignSIAILoop;
  6903. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6904. BEGIN
  6905. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6906. END ":=";
  6907. (** LONGINT *)
  6908. PROCEDURE AssignSLALLoop( ladr, dadr, dinc, len: LONGINT );
  6909. VAR lval: LONGINT;
  6910. BEGIN
  6911. SYSTEM.GET( ladr, lval );
  6912. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6913. END AssignSLALLoop;
  6914. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6915. BEGIN
  6916. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6917. END ":=";
  6918. (** REAL *)
  6919. PROCEDURE AssignSRARLoop( ladr, dadr, dinc, len: LONGINT );
  6920. VAR lval: REAL;
  6921. BEGIN
  6922. SYSTEM.GET( ladr, lval );
  6923. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6924. END AssignSRARLoop;
  6925. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6926. BEGIN
  6927. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6928. END ":=";
  6929. (** LONGREAL *)
  6930. PROCEDURE AssignSXAXLoop( ladr, dadr, dinc, len: LONGINT );
  6931. VAR lval: LONGREAL;
  6932. BEGIN
  6933. SYSTEM.GET( ladr, lval );
  6934. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6935. END AssignSXAXLoop;
  6936. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6937. BEGIN
  6938. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6939. END ":=";
  6940. (** COMPLEX *)
  6941. PROCEDURE AssignSZAZLoop( ladr, dadr, dinc, len: LONGINT );
  6942. VAR lval: COMPLEX;
  6943. BEGIN
  6944. SYSTEM.GET( ladr, lval );
  6945. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6946. END AssignSZAZLoop;
  6947. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6948. BEGIN
  6949. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6950. END ":=";
  6951. (** LONGCOMPLEX *)
  6952. PROCEDURE AssignSLZALZLoop( ladr, dadr, dinc, len: LONGINT );
  6953. VAR lvalRe, lvalIm: LONGREAL;
  6954. BEGIN
  6955. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6956. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6957. END AssignSLZALZLoop;
  6958. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6959. BEGIN
  6960. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6961. END ":=";
  6962. (*** matrix multipliation ********************************************************************)
  6963. PROCEDURE AllocateMatrix( dest: Address;
  6964. rows, cols, elementsize: LONGINT ): ANY;
  6965. VAR p: ANY;
  6966. BEGIN
  6967. (*
  6968. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  6969. *)
  6970. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  6971. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  6972. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6973. PutPtr( dest, p); RETURN p;
  6974. END AllocateMatrix;
  6975. PROCEDURE AllocateVector( dest: Address; l0, elementsize: LONGINT ): ANY;
  6976. VAR p: ANY;
  6977. BEGIN
  6978. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  6979. PutInc( dest, 0, elementsize ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6980. PutPtr( dest, p ); RETURN p;
  6981. END AllocateVector;
  6982. PROCEDURE ApplyMatMulLoop( dest, left, right: Address; Size: LONGINT;
  6983. loop: BinaryAASLoop;
  6984. fast: FastMatMul ); (* Size= element-size *)
  6985. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  6986. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  6987. BEGIN
  6988. (*
  6989. <- 1 ->
  6990. xxx xxxx -> xxxx
  6991. ^ xxx xxxx xxxx
  6992. 0 xxx xxxx xxxx
  6993. v xxx xxxx
  6994. xxx xxxx
  6995. Len(..,1): #columns ; Inc(..,1): inc in rows
  6996. Len(..,0): #rows ; Inc(..,0): inc between rows
  6997. *)
  6998. (* apply multiplication D = L * R *)
  6999. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7000. colsL := GetLen( left, 1 ); (* # left columns *)
  7001. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7002. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7003. (* check geometric restriction *)
  7004. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7005. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7006. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7007. IF RangeFlag IN GetFlags( dest ) THEN
  7008. Halt( GeometryMismatch, left, right, dest )
  7009. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7010. END;
  7011. END;
  7012. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7013. IF overlap THEN
  7014. destOld := dest; destNew := 0;
  7015. p := AllocateSame( destNew, destOld, Size );
  7016. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7017. dest := destNew;
  7018. END;
  7019. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7020. HALT( 9999 )
  7021. END;
  7022. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7023. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7024. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7025. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7026. (*
  7027. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7028. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7029. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7030. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7031. *)
  7032. IF rowsL = 0 THEN RETURN
  7033. ELSIF colsL=0 THEN RETURN
  7034. ELSIF colsR=0 THEN RETURN
  7035. ELSIF (fast = NIL ) OR
  7036. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7037. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7038. radri := radr; dadri := dadr; colsRi := colsR;
  7039. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7040. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7041. INC( dadri, incD ); DEC( colsRi );
  7042. END;
  7043. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7044. END;
  7045. END;
  7046. IF overlap THEN CopyContent( destOld, dest, Size );
  7047. END;
  7048. END ApplyMatMulLoop;
  7049. PROCEDURE ApplyMatVecMulLoop( dest, left, right: Address;
  7050. Size: LONGINT; loop: BinaryAASLoop;
  7051. fast: FastMatMul ); (* Size= element-size *)
  7052. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7053. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7054. BEGIN
  7055. (*
  7056. <- 0 ->
  7057. xxx T(xxx) -> T(xxxxx)
  7058. xxx
  7059. 1 xxx
  7060. xxx
  7061. xxx
  7062. Len(..,0): #columns ; Inc(..,0): inc in rows
  7063. Len(..,1): #rows ; Inc(..,1): inc between rows
  7064. *)
  7065. (* check geometric restriction *)
  7066. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7067. Halt( GeometryMismatch, left, right,0 );
  7068. END;
  7069. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7070. l2 := GetLen( left, 1 ); (* inner loop len *)
  7071. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7072. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7073. IF RangeFlag IN GetFlags( dest ) THEN
  7074. Halt( GeometryMismatch, left, right, dest );
  7075. ELSE p := AllocateVector( dest, l1, 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. (*
  7086. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7087. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7088. END;
  7089. *)
  7090. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7091. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7092. di0 := GetIncr( dest, 0 );
  7093. IF l1=0 THEN RETURN
  7094. ELSIF l2=0 THEN RETURN
  7095. ELSIF (fast = NIL ) OR
  7096. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7097. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7098. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7099. DEC( l1 );
  7100. END;
  7101. END;
  7102. IF overlap THEN CopyContent( destOld, dest, Size );
  7103. END;
  7104. END ApplyMatVecMulLoop;
  7105. PROCEDURE ApplyVecMatMulLoop( dest, left, right: Address;
  7106. Size: LONGINT; loop: BinaryAASLoop;
  7107. fast: FastMatMul ); (* Size= element-size *)
  7108. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7109. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7110. BEGIN
  7111. (*
  7112. <- 0 ->
  7113. xxx xxxx -> xxxx
  7114. xxxx
  7115. 1 xxxx
  7116. Len(..,0): #columns ; Inc(..,0): inc in rows
  7117. Len(..,1): #rows ; Inc(..,1): inc between rows
  7118. *)
  7119. (* check geometric restriction *)
  7120. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7121. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7122. l2 := GetLen( right, 0 ); (* inner loop len *)
  7123. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7124. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7125. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7126. ELSE p := AllocateVector( dest, l0, Size );
  7127. END;
  7128. END;
  7129. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7130. IF overlap THEN
  7131. destOld := dest; destNew := 0;
  7132. p := AllocateSame( destNew, destOld, Size );
  7133. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7134. dest := destNew;
  7135. END;
  7136. (*
  7137. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7138. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7139. END;
  7140. *)
  7141. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7142. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7143. di0 := GetIncr( dest, 0 );
  7144. IF l2=0 THEN RETURN
  7145. ELSIF l0=0 THEN RETURN
  7146. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7147. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7148. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7149. DEC( l0 );
  7150. END;
  7151. END;
  7152. IF overlap THEN CopyContent( destOld, dest, Size );
  7153. END;
  7154. END ApplyVecMatMulLoop;
  7155. (** SHORTINT *)
  7156. PROCEDURE MatMulASASLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7157. VAR lval, rval, dval: SHORTINT;
  7158. BEGIN
  7159. dval := 0;
  7160. WHILE (len > 0) DO
  7161. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7162. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7163. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7164. END;
  7165. SYSTEM.PUT( dadr, dval );
  7166. END MatMulASASLoop;
  7167. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7168. BEGIN
  7169. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7170. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7171. RETURN RESULT
  7172. END "*";
  7173. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7174. BEGIN
  7175. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7176. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7177. RETURN RESULT
  7178. END "*";
  7179. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7180. BEGIN
  7181. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7182. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7183. RETURN RESULT
  7184. END "*";
  7185. (** INTEGER *)
  7186. PROCEDURE MatMulAIAILoop( ladr, radr, dadr, linc, rinc, len: Address );
  7187. VAR lval, rval, dval: INTEGER;
  7188. BEGIN
  7189. dval := 0;
  7190. WHILE (len > 0) DO
  7191. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7192. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7193. END;
  7194. SYSTEM.PUT( dadr, dval );
  7195. END MatMulAIAILoop;
  7196. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7197. BEGIN
  7198. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7199. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7200. RETURN RESULT
  7201. END "*";
  7202. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7203. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7204. BEGIN
  7205. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7206. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7207. RETURN RESULT
  7208. END "*";
  7209. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7210. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7211. BEGIN
  7212. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7213. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7214. RETURN RESULT
  7215. END "*";
  7216. (** LONGINT *)
  7217. PROCEDURE MatMulALALLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7218. VAR lval, rval, dval: LONGINT;
  7219. BEGIN
  7220. dval := 0;
  7221. WHILE (len > 0) DO
  7222. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7223. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7224. END;
  7225. SYSTEM.PUT( dadr, dval );
  7226. END MatMulALALLoop;
  7227. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7228. BEGIN
  7229. (*
  7230. KernelLog.String("MatMulALAL");
  7231. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7232. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7233. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7234. KernelLog.Ln;
  7235. *)
  7236. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7237. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7238. RETURN RESULT
  7239. END "*";
  7240. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7241. BEGIN
  7242. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7243. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7244. RETURN RESULT
  7245. END "*";
  7246. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7247. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7248. BEGIN
  7249. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7250. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7251. RETURN RESULT
  7252. END "*";
  7253. (** REAL *)
  7254. PROCEDURE MatMulARARLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7255. VAR lval, rval, dval: REAL;
  7256. BEGIN
  7257. dval := 0;
  7258. WHILE (len > 0) DO
  7259. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7260. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7261. END;
  7262. SYSTEM.PUT( dadr, dval );
  7263. END MatMulARARLoop;
  7264. (*
  7265. Optimized for small matrices (Alexey Morozov)
  7266. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7267. *)
  7268. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7269. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7270. BEGIN
  7271. dadr := GetAdr(ADDRESSOF(RESULT));
  7272. ladr := GetAdr(ADDRESSOF(left));
  7273. radr := GetAdr(ADDRESSOF(right));
  7274. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7275. IF (ladr # dadr) & (radr # dadr) THEN
  7276. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7277. CASE SYSTEM.VAL(LONGINT,flags) OF
  7278. Mat2x2:
  7279. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7280. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7281. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7282. END;
  7283. END;
  7284. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7285. ELSE
  7286. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7287. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7288. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7289. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7290. END;
  7291. |Mat3x3:
  7292. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7293. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7294. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7295. END;
  7296. END;
  7297. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7298. ELSE
  7299. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7300. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7301. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7302. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7303. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7304. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7305. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7306. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7307. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7308. END;
  7309. |Mat4x4:
  7310. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7311. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7312. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7313. END;
  7314. END;
  7315. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7316. ELSE
  7317. 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];
  7318. 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];
  7319. 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];
  7320. 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];
  7321. 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];
  7322. 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];
  7323. 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];
  7324. 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];
  7325. 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];
  7326. 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];
  7327. 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];
  7328. 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];
  7329. 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];
  7330. 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];
  7331. 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];
  7332. 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];
  7333. END;
  7334. ELSE
  7335. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7336. loopMatMulARAR, matMulR );
  7337. END;
  7338. ELSE
  7339. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7340. loopMatMulARAR, matMulR );
  7341. END;
  7342. RETURN RESULT
  7343. END "*";
  7344. (*
  7345. Optimized for small arrays (Alexey Morozov)
  7346. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7347. *)
  7348. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7349. VAR
  7350. flags: SET; dadr, ladr, radr: LONGINT;
  7351. v0, v1, v2: REAL;
  7352. BEGIN
  7353. dadr := GetAdr(ADDRESSOF(RESULT));
  7354. ladr := GetAdr(ADDRESSOF(left));
  7355. radr := GetAdr(ADDRESSOF(right));
  7356. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7357. CASE SYSTEM.VAL(LONGINT,flags) OF
  7358. MatVec2x2:
  7359. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7360. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7361. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7362. END;
  7363. END;
  7364. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7365. ELSE
  7366. (* account possible overlapping *)
  7367. v0 := right[0];
  7368. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7369. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7370. END;
  7371. |MatVec3x3:
  7372. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7373. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7374. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7375. END;
  7376. END;
  7377. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7378. ELSE
  7379. (* account possible overlapping *)
  7380. v0 := right[0]; v1 := right[1];
  7381. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7382. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7383. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7384. END;
  7385. |MatVec4x4:
  7386. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7387. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7388. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7389. END;
  7390. END;
  7391. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7392. ELSE
  7393. (* account possible overlapping *)
  7394. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7395. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7396. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7397. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7398. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7399. END;
  7400. ELSE
  7401. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7402. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7403. END;
  7404. RETURN RESULT
  7405. END "*";
  7406. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7407. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7408. BEGIN
  7409. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7410. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7411. RETURN RESULT
  7412. END "*";
  7413. (** LONGREAL *)
  7414. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7415. VAR lval, rval, dval: LONGREAL;
  7416. BEGIN
  7417. dval := 0;
  7418. WHILE (len > 0) DO
  7419. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7420. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7421. END;
  7422. SYSTEM.PUT( dadr, dval );
  7423. END MatMulAXAXLoop;
  7424. (*
  7425. Optimized for small matrices (Alexey Morozov)
  7426. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7427. *)
  7428. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7429. VAR
  7430. flags: SET; dadr, ladr, radr: LONGINT;
  7431. BEGIN
  7432. dadr := GetAdr(ADDRESSOF(RESULT));
  7433. ladr := GetAdr(ADDRESSOF(left));
  7434. radr := GetAdr(ADDRESSOF(right));
  7435. IF (ladr # dadr) & (radr # dadr) THEN
  7436. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7437. CASE SYSTEM.VAL(LONGINT,flags) OF
  7438. Mat2x2:
  7439. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7440. IF dadr = 0 THEN NEW(RESULT,2,2);
  7441. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7442. END;
  7443. END;
  7444. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7445. ELSE
  7446. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7447. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7448. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7449. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7450. END;
  7451. |Mat3x3:
  7452. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7453. IF dadr = 0 THEN NEW(RESULT,3,3);
  7454. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7455. END;
  7456. END;
  7457. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7458. ELSE
  7459. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7460. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7461. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7462. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7463. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7464. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7465. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7466. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7467. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7468. END;
  7469. |Mat4x4:
  7470. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7471. IF dadr = 0 THEN NEW(RESULT,4,4);
  7472. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7473. END;
  7474. END;
  7475. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7476. ELSE
  7477. 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];
  7478. 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];
  7479. 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];
  7480. 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];
  7481. 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];
  7482. 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];
  7483. 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];
  7484. 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];
  7485. 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];
  7486. 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];
  7487. 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];
  7488. 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];
  7489. 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];
  7490. 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];
  7491. 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];
  7492. 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];
  7493. END;
  7494. ELSE
  7495. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7496. loopMatMulAXAX, matMulX );
  7497. END;
  7498. ELSE
  7499. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7500. loopMatMulAXAX, matMulX );
  7501. END;
  7502. RETURN RESULT
  7503. END "*";
  7504. (*
  7505. Optimized for small arrays (Alexey Morozov)
  7506. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7507. *)
  7508. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7509. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7510. VAR
  7511. flags: SET; dadr, ladr, radr: LONGINT;
  7512. v0, v1, v2: LONGREAL;
  7513. BEGIN
  7514. dadr := GetAdr(ADDRESSOF(RESULT));
  7515. ladr := GetAdr(ADDRESSOF(left));
  7516. radr := GetAdr(ADDRESSOF(right));
  7517. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7518. CASE SYSTEM.VAL(LONGINT,flags) OF
  7519. MatVec2x2:
  7520. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7521. IF dadr = 0 THEN NEW(RESULT,2);
  7522. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7523. END;
  7524. END;
  7525. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7526. ELSE
  7527. (* account possible overlapping *)
  7528. v0 := right[0];
  7529. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7530. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7531. END;
  7532. |MatVec3x3:
  7533. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7534. IF dadr = 0 THEN NEW(RESULT,3);
  7535. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7536. END;
  7537. END;
  7538. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7539. ELSE
  7540. (* account possible overlapping *)
  7541. v0 := right[0]; v1 := right[1];
  7542. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7543. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7544. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7545. END;
  7546. |MatVec4x4:
  7547. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7548. IF dadr = 0 THEN NEW(RESULT,4);
  7549. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7550. END;
  7551. END;
  7552. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7553. ELSE
  7554. (* account possible overlapping *)
  7555. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7556. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7557. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7558. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7559. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7560. END;
  7561. ELSE
  7562. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7563. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7564. END;
  7565. RETURN RESULT
  7566. END "*";
  7567. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7568. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7569. BEGIN
  7570. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7571. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7572. RETURN RESULT
  7573. END "*";
  7574. (** SHORTINT *)
  7575. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7576. VAR lval, rval, dval: SHORTINT;
  7577. BEGIN
  7578. SYSTEM.GET( dadr, dval );
  7579. WHILE (len > 0) DO
  7580. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7581. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7582. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7583. END;
  7584. SYSTEM.PUT( dadr, dval );
  7585. END MatMulIncASASLoop;
  7586. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7587. BEGIN
  7588. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7589. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7590. RETURN RESULT
  7591. END "@MulInc";
  7592. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7593. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7594. BEGIN
  7595. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7596. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7597. RETURN RESULT
  7598. END "@MulInc";
  7599. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7600. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7601. BEGIN
  7602. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7603. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7604. RETURN RESULT
  7605. END "@MulInc";
  7606. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7607. BEGIN
  7608. RESULT := -RESULT;
  7609. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7610. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7611. RESULT := -RESULT;
  7612. RETURN RESULT
  7613. END "@MulDec";
  7614. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7615. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7616. BEGIN
  7617. RESULT := -RESULT;
  7618. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7619. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7620. RESULT := -RESULT;
  7621. RETURN RESULT
  7622. END "@MulDec";
  7623. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7624. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7625. BEGIN
  7626. RESULT := -RESULT;
  7627. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7628. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7629. RESULT := -RESULT;
  7630. RETURN RESULT
  7631. END "@MulDec";
  7632. (** INTEGER *)
  7633. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr, linc, rinc, len: Address );
  7634. VAR lval, rval, dval: INTEGER;
  7635. BEGIN
  7636. SYSTEM.GET( dadr, dval );
  7637. WHILE (len > 0) DO
  7638. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7639. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7640. END;
  7641. SYSTEM.PUT( dadr, dval );
  7642. END MatMulIncAIAILoop;
  7643. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7644. BEGIN
  7645. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7646. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7647. RETURN RESULT
  7648. END "@MulInc";
  7649. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7650. BEGIN
  7651. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7652. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7653. RETURN RESULT
  7654. END "@MulInc";
  7655. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7656. BEGIN
  7657. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7658. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7659. RETURN RESULT
  7660. END "@MulInc";
  7661. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7662. BEGIN
  7663. RESULT := -RESULT;
  7664. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7665. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7666. RESULT := -RESULT;
  7667. RETURN RESULT
  7668. END "@MulDec";
  7669. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7670. BEGIN
  7671. RESULT := -RESULT;
  7672. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7673. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7674. RESULT := -RESULT;
  7675. RETURN RESULT
  7676. END "@MulDec";
  7677. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7678. BEGIN
  7679. RESULT := -RESULT;
  7680. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7681. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7682. RESULT := -RESULT;
  7683. RETURN RESULT
  7684. END "@MulDec";
  7685. (** LONGINT *)
  7686. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7687. VAR lval, rval, dval: LONGINT;
  7688. BEGIN
  7689. SYSTEM.GET( dadr, dval );
  7690. WHILE (len > 0) DO
  7691. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7692. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7693. END;
  7694. SYSTEM.PUT( dadr, dval );
  7695. END MatMulIncALALLoop;
  7696. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7697. BEGIN
  7698. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7699. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7700. RETURN RESULT
  7701. END "@MulInc";
  7702. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7703. BEGIN
  7704. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7705. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7706. RETURN RESULT
  7707. END "@MulInc";
  7708. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7709. BEGIN
  7710. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7711. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7712. RETURN RESULT
  7713. END "@MulInc";
  7714. OPERATOR "@MulDec"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7715. BEGIN
  7716. RESULT := -RESULT;
  7717. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7718. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7719. RESULT := -RESULT;
  7720. RETURN RESULT
  7721. END "@MulDec";
  7722. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7723. BEGIN
  7724. RESULT := -RESULT;
  7725. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7726. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7727. RESULT := -RESULT;
  7728. RETURN RESULT
  7729. END "@MulDec";
  7730. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7731. BEGIN
  7732. RESULT := -RESULT;
  7733. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7734. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7735. RESULT := -RESULT;
  7736. RETURN RESULT
  7737. END "@MulDec";
  7738. (** REAL *)
  7739. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7740. VAR lval, rval, dval: REAL;
  7741. BEGIN
  7742. SYSTEM.GET( dadr, dval );
  7743. WHILE (len > 0) DO
  7744. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7745. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7746. END;
  7747. SYSTEM.PUT( dadr, dval );
  7748. END MatMulIncARARLoop;
  7749. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7750. BEGIN
  7751. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7752. loopMatMulIncARAR, matMulIncR );
  7753. RETURN RESULT
  7754. END "@MulInc";
  7755. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7756. BEGIN
  7757. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7758. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7759. RETURN RESULT
  7760. END "@MulInc";
  7761. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7762. BEGIN
  7763. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7764. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7765. RETURN RESULT
  7766. END "@MulInc";
  7767. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7768. BEGIN
  7769. RESULT := -RESULT;
  7770. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7771. loopMatMulIncARAR, matMulIncR );
  7772. RESULT := -RESULT;
  7773. RETURN RESULT
  7774. END "@MulDec";
  7775. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7776. BEGIN
  7777. RESULT := -RESULT;
  7778. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7779. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7780. RESULT := -RESULT;
  7781. RETURN RESULT
  7782. END "@MulDec";
  7783. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7784. BEGIN
  7785. RESULT := -RESULT;
  7786. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7787. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7788. RESULT := -RESULT;
  7789. RETURN RESULT
  7790. END "@MulDec";
  7791. (** LONGREAL *)
  7792. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7793. VAR lval, rval, dval: LONGREAL;
  7794. BEGIN
  7795. SYSTEM.GET( dadr, dval );
  7796. WHILE (len > 0) DO
  7797. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7798. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7799. END;
  7800. SYSTEM.PUT( dadr, dval );
  7801. END MatMulIncAXAXLoop;
  7802. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7803. BEGIN
  7804. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7805. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7806. RETURN RESULT
  7807. END "@MulInc";
  7808. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7809. BEGIN
  7810. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7811. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7812. RETURN RESULT
  7813. END "@MulInc";
  7814. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7815. BEGIN
  7816. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7817. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7818. RETURN RESULT
  7819. END "@MulInc";
  7820. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7821. BEGIN
  7822. RESULT := -RESULT;
  7823. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7824. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7825. RESULT := -RESULT;
  7826. RETURN RESULT
  7827. END "@MulDec";
  7828. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7829. BEGIN
  7830. RESULT := -RESULT;
  7831. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7832. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7833. RESULT := -RESULT;
  7834. RETURN RESULT
  7835. END "@MulDec";
  7836. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7837. BEGIN
  7838. RESULT := -RESULT;
  7839. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7840. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7841. RESULT := -RESULT;
  7842. RETURN RESULT
  7843. END "@MulDec";
  7844. (*** Cross product ********************************************************************)
  7845. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7846. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7847. BEGIN
  7848. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7849. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7850. END;
  7851. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7852. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7853. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7854. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7855. RETURN RESULT
  7856. END "*";
  7857. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7858. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7859. BEGIN
  7860. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7861. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7862. END;
  7863. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7864. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7865. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7866. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7867. RETURN RESULT
  7868. END "*";
  7869. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7870. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7871. BEGIN
  7872. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7873. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7874. END;
  7875. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7876. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7877. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7878. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7879. RETURN RESULT
  7880. END "*";
  7881. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7882. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7883. BEGIN
  7884. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7885. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7886. END;
  7887. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7888. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7889. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7890. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7891. RETURN RESULT
  7892. END "*";
  7893. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7894. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7895. BEGIN
  7896. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7897. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7898. END;
  7899. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7900. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7901. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7902. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7903. RETURN RESULT
  7904. END "*";
  7905. (** Transpose ********************************************************************)
  7906. PROCEDURE Overlap( src1, src2: Address ): BOOLEAN;
  7907. VAR from1, from2, to1, to2: Address; dim: LONGINT;
  7908. BEGIN
  7909. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7910. dim := GetDim( src1 ) - 1;
  7911. WHILE (dim > 0) DO
  7912. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7913. END;
  7914. dim := GetDim( src2 ) - 1;
  7915. WHILE (dim > 0) DO
  7916. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7917. END;
  7918. IF from1 < from2 THEN RETURN to1 >= from2;
  7919. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7920. ELSE RETURN TRUE;
  7921. END;
  7922. END Overlap;
  7923. (*
  7924. PROCEDURE Overlap( src1, src2, dim: Address ): BOOLEAN;
  7925. VAR from1, from2, to1, to2: Address;
  7926. BEGIN
  7927. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7928. DEC( dim );
  7929. WHILE (dim > 0) DO
  7930. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  7931. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7932. END;
  7933. IF from1 < from2 THEN RETURN to1 >= from2;
  7934. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7935. ELSE RETURN TRUE;
  7936. END;
  7937. END Overlap;
  7938. *)
  7939. PROCEDURE AllocateTransposed( VAR dest: LONGINT; src: LONGINT;
  7940. elementsize: LONGINT ): ANY;
  7941. VAR ptr, data: ANY; Size: LONGINT;
  7942. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  7943. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  7944. VAR dim,max: LONGINT;
  7945. BEGIN
  7946. dim := GetDim( l );
  7947. IF dim # GetDim( r ) THEN RETURN FALSE END;
  7948. max := dim-1;
  7949. WHILE (dim > 0) DO
  7950. DEC( dim );
  7951. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  7952. END;
  7953. RETURN TRUE;
  7954. END TransposedShape;
  7955. PROCEDURE UseDescriptor;
  7956. VAR tag: LONGINT;
  7957. BEGIN
  7958. SYSTEM.GET( src - 4, tag );
  7959. Heaps.NewRec( ptr, tag, FALSE );
  7960. dest := SYSTEM.VAL( LONGINT, ptr );
  7961. END UseDescriptor;
  7962. PROCEDURE NewData;
  7963. VAR max,dim, len, size: LONGINT;
  7964. BEGIN
  7965. dim := GetDim( src ); size := elementsize;
  7966. PutDim( dest, dim );
  7967. PutSize( dest, elementsize );
  7968. max := dim-1;
  7969. WHILE (dim > 0) DO
  7970. DEC( dim );
  7971. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  7972. PutInc( dest, dim, size ); size := size * len;
  7973. END;
  7974. SYSTEM.NEW( data, size );
  7975. PutAdr( dest, data );
  7976. PutPtr( dest, data );
  7977. END NewData;
  7978. BEGIN
  7979. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  7980. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  7981. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  7982. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  7983. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  7984. END;
  7985. PutFlags(dest, {TensorFlag});
  7986. NewData(); RETURN ptr;
  7987. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  7988. (* check if re-allocation of descriptor is allowed *)
  7989. IF ~(TensorFlag IN GetFlags( dest )) &
  7990. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  7991. HALT( 100 );
  7992. END;
  7993. UseDescriptor();
  7994. PutFlags(dest, {TensorFlag});
  7995. NewData(); RETURN ptr;
  7996. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  7997. (* check if re-allocation of array data is allowed *)
  7998. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  7999. HALT( 100 );
  8000. END;
  8001. NewData();
  8002. RETURN data;
  8003. ELSE (* nothing to do *)
  8004. RETURN NIL;
  8005. END;
  8006. END AllocateTransposed;
  8007. PROCEDURE Transpose*( dest, left: Address; Size: LONGINT );
  8008. VAR len0, len1, linc0, linc1, dinc0, dinc1, ladr, dadr: LONGINT; p: ANY;
  8009. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8010. BEGIN
  8011. WHILE (len > 0) DO
  8012. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8013. DEC( len );
  8014. END;
  8015. END CopyLoop;
  8016. BEGIN
  8017. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8018. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8019. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8020. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8021. ELSE
  8022. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8023. p := AllocateTransposed(dest,left,Size);
  8024. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8025. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8026. dadr := SYSTEM.VAL( LONGINT, p ); linc0 := GetIncr( left, 0 );
  8027. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8028. WHILE (len0 > 0) DO
  8029. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8030. INC( dadr, dinc0 ); DEC( len0 );
  8031. END;
  8032. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8033. ladr := SYSTEM.VAL( LONGINT, p );
  8034. ELSE
  8035. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8036. END;
  8037. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8038. dadr := GetAdr( dest );
  8039. IF (Size = 4) & (transpose4 # NIL ) THEN
  8040. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8041. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8042. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8043. ELSE
  8044. WHILE (len0 > 0) DO
  8045. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8046. INC( dadr, dinc1 ); DEC( len0 );
  8047. END;
  8048. END;
  8049. END;
  8050. END Transpose;
  8051. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8052. BEGIN
  8053. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8054. RETURN RESULT
  8055. END "`";
  8056. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8057. BEGIN
  8058. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8059. RETURN RESULT
  8060. END "`";
  8061. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8062. BEGIN
  8063. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8064. RETURN RESULT
  8065. END "`";
  8066. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8067. BEGIN
  8068. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8069. RETURN RESULT
  8070. END "`";
  8071. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8072. BEGIN
  8073. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8074. RETURN RESULT
  8075. END "`";
  8076. PROCEDURE CheckTensorGeometry( left, right, dest: Address; ldim, rdim: LONGINT ): BOOLEAN;
  8077. VAR i: LONGINT;
  8078. BEGIN
  8079. FOR i := 0 TO rdim - 1 DO
  8080. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8081. END;
  8082. FOR i := 0 TO ldim - 1 DO
  8083. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8084. END;
  8085. RETURN TRUE;
  8086. END CheckTensorGeometry;
  8087. (*
  8088. PROCEDURE Zero(p: ANY; size: LONGINT);
  8089. VAR adr: LONGINT;
  8090. BEGIN
  8091. adr := SYSTEM.VAL(LONGINT,p);
  8092. WHILE(size>0) DO
  8093. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8094. END;
  8095. END Zero;
  8096. *)
  8097. PROCEDURE DoReshape*( VAR dest: LONGINT; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8098. VAR i, Size: LONGINT; ptr, data: ANY; new: LONGINT;
  8099. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8100. squeezingReshape: BOOLEAN;
  8101. PROCEDURE NewDescriptor;
  8102. BEGIN
  8103. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8104. END NewDescriptor;
  8105. (* Added by Alexey
  8106. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8107. *)
  8108. PROCEDURE SqueezingReshape(): BOOLEAN;
  8109. VAR
  8110. i, j, n: LONGINT;
  8111. BEGIN
  8112. IF oldDim > newDim THEN
  8113. i := 0; j := 0;
  8114. WHILE (i < oldDim) & (j < newDim) DO
  8115. n := GetLen(src,i);
  8116. IF n = shape[j] THEN INC(j); END;
  8117. INC(i);
  8118. END;
  8119. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8120. ELSE
  8121. squeezingReshape := FALSE;
  8122. END;
  8123. squeezingReshape := (i = oldDim) & (j = newDim);
  8124. RETURN squeezingReshape;
  8125. END SqueezingReshape;
  8126. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8127. PROCEDURE TargetContinuous(): BOOLEAN;
  8128. VAR
  8129. i, n: LONGINT;
  8130. continue: BOOLEAN;
  8131. BEGIN
  8132. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8133. continue := TRUE;
  8134. WHILE (i > 0) & continue DO
  8135. n := n * GetLen(dest,i);
  8136. DEC(i);
  8137. continue := GetIncr(dest,i) = n;
  8138. END;
  8139. (*TRACE(i,continue,Size,GetSize(dest));*)
  8140. (*tod obviously size is not what I expect it to be*)
  8141. IF (i = 0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8142. RETURN TRUE;
  8143. ELSE
  8144. RETURN FALSE;
  8145. END;
  8146. END TargetContinuous;
  8147. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8148. PROCEDURE PreservesContiguity(): BOOLEAN;
  8149. VAR
  8150. i, n: LONGINT;
  8151. continue: BOOLEAN;
  8152. BEGIN
  8153. i := oldDim-1; n := GetIncr(src,i);
  8154. continue := TRUE;
  8155. WHILE (i > 0) & continue DO
  8156. n := n * GetLen(src,i);
  8157. DEC(i);
  8158. continue := GetIncr(src,i) = n;
  8159. END;
  8160. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8161. RETURN TRUE;
  8162. ELSE Err("Not yet implemented!");
  8163. END;
  8164. END PreservesContiguity;
  8165. (* Added by Alexey *)
  8166. PROCEDURE NewDescriptorForSameData;
  8167. VAR len, size, i, j: LONGINT;
  8168. BEGIN
  8169. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8170. IF ~squeezingReshape THEN
  8171. size := Size;
  8172. FOR i := newDim - 1 TO 0 BY -1 DO
  8173. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8174. size := size * len;
  8175. END;
  8176. ELSE (* squeezing reshape *)
  8177. j := 0; len := shape[j];
  8178. FOR i := 0 TO oldDim-1 DO
  8179. IF GetLen(src,i) = len THEN
  8180. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8181. INC(j);
  8182. IF j < newDim THEN len := shape[j]; END;
  8183. END;
  8184. END;
  8185. END;
  8186. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8187. PutFlags(new,GetFlags(new)+{RangeFlag});
  8188. END;
  8189. PutAdr( new, GetAdr(src) );
  8190. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8191. PutSize( new, Size );
  8192. END NewDescriptorForSameData;
  8193. PROCEDURE NewData;
  8194. VAR len, size, i: LONGINT;
  8195. BEGIN
  8196. size := Size;
  8197. FOR i := newDim - 1 TO 0 BY -1 DO
  8198. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8199. size := size * len;
  8200. END;
  8201. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8202. PutAdr( new, data );
  8203. PutPtr( new, data ); PutDim( new, newDim );
  8204. PutSize( new, Size );
  8205. END NewData;
  8206. PROCEDURE CopyData;
  8207. VAR d, s, dadr: LONGINT;
  8208. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8209. VAR inc, len, i: LONGINT;
  8210. BEGIN
  8211. IF dim = d THEN
  8212. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8213. FOR i := 0 TO len - 1 DO
  8214. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8215. END;
  8216. ELSE
  8217. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8218. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8219. END;
  8220. END Loop;
  8221. BEGIN
  8222. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8223. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8224. s := s * GetLen( src, d ); DEC( d );
  8225. END;
  8226. IF d = -1 THEN (* special case: both continuous *)
  8227. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8228. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8229. END;
  8230. END CopyData;
  8231. PROCEDURE CopyDataBack;
  8232. VAR d, s: LONGINT; sadr: LONGINT;
  8233. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8234. VAR inc, len, i: LONGINT;
  8235. BEGIN
  8236. IF dim = d THEN
  8237. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8238. FOR i := 0 TO len - 1 DO
  8239. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8240. END;
  8241. ELSE
  8242. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8243. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8244. END;
  8245. END Loop;
  8246. BEGIN
  8247. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8248. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8249. s := s * GetLen( dest, d ); DEC( d );
  8250. END;
  8251. IF d = -1 THEN (* special case: both continuous *)
  8252. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8253. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8254. END;
  8255. END CopyDataBack;
  8256. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8257. BEGIN
  8258. ASSERT( GetDim( src ) = GetDim( dest ) );
  8259. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8260. END CopyDescriptor;
  8261. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8262. VAR i: LONGINT;
  8263. BEGIN
  8264. ASSERT(GetDim(dest) = newDim);
  8265. FOR i := 0 TO newDim - 1 DO
  8266. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8267. END;
  8268. RETURN FALSE;
  8269. END ShapeDiffers;
  8270. BEGIN
  8271. (*
  8272. cases
  8273. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8274. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8275. 3.) descriptor may not be reshaped: dest = RANGE
  8276. *)
  8277. (* first check invariants *)
  8278. oldDim := GetDim( src );
  8279. IF oldDim = 0 THEN oldSize := 0
  8280. ELSE
  8281. oldSize := 1;
  8282. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8283. END;
  8284. newDim := LEN( shape, 0 );
  8285. IF newDim = 0 THEN newSize := 0
  8286. ELSE
  8287. newSize := 1;
  8288. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8289. END;
  8290. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8291. Size := GetSize( src );
  8292. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8293. IF dest = src THEN (* added by Alexey *)
  8294. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8295. NewDescriptorForSameData;
  8296. dest := new;
  8297. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8298. (* create a copy of the original descriptor *)
  8299. ptr := GetArrayDesc(newDim); dest := SYSTEM.VAL(LONGINT,ptr); CopyDescriptor(src,dest);
  8300. ELSE
  8301. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8302. END;
  8303. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8304. NewDescriptor; NewData; CopyData; dest := new;
  8305. ELSIF TargetContinuous() THEN
  8306. NewDescriptor; new:=dest; CopyData;
  8307. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8308. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8309. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8310. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8311. END;
  8312. NewDescriptor; NewData; CopyData; dest := new;
  8313. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8314. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8315. NewDescriptor; NewData; CopyData; CopyDescriptor( new, dest );
  8316. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8317. NewDescriptor; NewData; CopyData; CopyDataBack;
  8318. ELSE (* same shape, just copy *)
  8319. CopyContent( src, dest, Size ); RETURN;
  8320. END;
  8321. END DoReshape;
  8322. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8323. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8324. PROCEDURE NewData;
  8325. VAR len, size, i: LONGINT;
  8326. BEGIN
  8327. size := elementSize;
  8328. FOR i := dim - 1 TO 0 BY -1 DO
  8329. len := a[i];
  8330. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8331. END;
  8332. IF tag = 0 THEN
  8333. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8334. PutAdr( dest, data );
  8335. ELSE
  8336. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8337. dest.adr := data;
  8338. INC(dest.adr, ArrDataArrayOffset);
  8339. END;
  8340. PutPtr( dest, data ); PutSize( dest, elementSize );
  8341. END NewData;
  8342. PROCEDURE ClearData;
  8343. (*! todo *)
  8344. END ClearData;
  8345. BEGIN
  8346. dim := LEN( a,0 );
  8347. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8348. IF dest # 0 THEN
  8349. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8350. END;
  8351. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8352. NewData;
  8353. ELSE
  8354. i := 0;
  8355. WHILE (i < dim) & same DO
  8356. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8357. INC( i );
  8358. END;
  8359. IF ~same THEN
  8360. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8361. NewData
  8362. ELSE ClearData
  8363. END;
  8364. END;
  8365. END AllocateTensorA;
  8366. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8367. BEGIN
  8368. AllocateTensorA(a,elementSize,tag,dest);
  8369. END AllocateArrayA;
  8370. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: LONGINT; tag: LONGINT );
  8371. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT; dest: Address;
  8372. PROCEDURE NewData;
  8373. VAR len, size, i: LONGINT;
  8374. BEGIN
  8375. size := Size;
  8376. FOR i := dim - 1 TO 0 BY -1 DO
  8377. len := a[i];
  8378. (*
  8379. KernelLog.Int(len,10); KernelLog.Ln;
  8380. *)
  8381. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8382. END;
  8383. IF tag = 0 THEN
  8384. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8385. PutAdr( dest, data );
  8386. ELSE
  8387. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8388. PutAdr( dest, data+ ArrDataArrayOffset );
  8389. END;
  8390. PutPtr( dest, data ); PutSize( dest, Size );
  8391. END NewData;
  8392. PROCEDURE ClearData;
  8393. (*! todo *)
  8394. END ClearData;
  8395. BEGIN
  8396. dim := LEN( a,0 );
  8397. dest := SYSTEM.VAL(Address,destA);
  8398. (*! check range flag! *)
  8399. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8400. IF dest # 0 THEN
  8401. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8402. END;
  8403. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8404. NewData;
  8405. ELSE
  8406. i := 0;
  8407. WHILE (i < dim) & same DO
  8408. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8409. INC( i );
  8410. END;
  8411. IF ~same THEN
  8412. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8413. NewData
  8414. ELSE ClearData
  8415. END;
  8416. END;
  8417. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8418. END AllocateTensorX;
  8419. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF LONGINT; src: Address );
  8420. VAR dim, i: LONGINT;
  8421. BEGIN
  8422. dim := GetDim( src );
  8423. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8424. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8425. END LenA;
  8426. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF LONGINT; src: Address );
  8427. VAR dim, i, len: LONGINT;
  8428. BEGIN
  8429. dim := GetDim( src ); len := LEN( dest, 0 );
  8430. IF len # dim THEN NEW( dest, dim ); END;
  8431. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8432. END IncrA;
  8433. PROCEDURE Len*(src: Address; d: LONGINT): LONGINT;
  8434. VAR dim: LONGINT;
  8435. BEGIN
  8436. dim := GetDim(src);
  8437. IF (d<0) OR (d>=dim) THEN HALT(100)
  8438. ELSE
  8439. RETURN GetLen(src,d);
  8440. END;
  8441. END Len;
  8442. PROCEDURE Incr*(src: Address; d: LONGINT): LONGINT;
  8443. VAR dim: LONGINT;
  8444. BEGIN
  8445. dim := GetDim(src);
  8446. IF (d<0) OR (d>=dim) THEN HALT(100)
  8447. ELSE
  8448. RETURN GetIncr(src,d);
  8449. END;
  8450. END Incr;
  8451. PROCEDURE AllocateTensor( VAR dest: LONGINT; left, right: Address;
  8452. Size: LONGINT ): ANY;
  8453. VAR ldim, rdim: LONGINT; ptr, data: ANY;
  8454. PROCEDURE NewData;
  8455. VAR len, size, i: LONGINT;
  8456. BEGIN
  8457. size := 1;
  8458. FOR i := 0 TO ldim - 1 DO
  8459. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8460. END;
  8461. FOR i := 0 TO rdim - 1 DO
  8462. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8463. END;
  8464. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8465. (*
  8466. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8467. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8468. *)
  8469. size := Size;
  8470. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8471. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8472. END;
  8473. PutAdr( dest, data );
  8474. PutPtr( dest, data );
  8475. END NewData;
  8476. BEGIN
  8477. ldim := GetDim( left ); rdim := GetDim( right );
  8478. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8479. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8480. NewData(); RETURN ptr;
  8481. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8482. IF ~(TensorFlag IN GetFlags( dest )) &
  8483. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8484. HALT( 100 );
  8485. END;
  8486. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8487. NewData(); RETURN ptr;
  8488. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8489. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8490. HALT( 100 );
  8491. END;
  8492. NewData(); RETURN data;
  8493. END;
  8494. RETURN NIL;
  8495. END AllocateTensor;
  8496. (* 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 *)
  8497. PROCEDURE FindPatternTensor( left, right: Address;
  8498. VAR rdim, len, linc, ri: LONGINT );
  8499. (* geometric precondition: lengths must coincide *)
  8500. VAR ldim: LONGINT;
  8501. BEGIN
  8502. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8503. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8504. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8505. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8506. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8507. END;
  8508. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8509. DEC( ldim );
  8510. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8511. (GetIncr( right, rdim ) = len * ri) DO
  8512. len := len * GetLen( left, ldim );
  8513. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8514. DEC( ldim );
  8515. END;
  8516. INC( ldim ); INC( rdim );
  8517. IF debug THEN
  8518. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8519. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8520. END;
  8521. END FindPatternTensor;
  8522. PROCEDURE ApplyTensorAAAOp( d, l, r: Address; elementSize: LONGINT;
  8523. Loop: BinaryASALoop );
  8524. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8525. origdest: LONGINT; left, right, dest: Address;
  8526. PROCEDURE Traverse( ladr, radr, dadr: Address; ldim, rdim: LONGINT );
  8527. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8528. BEGIN
  8529. IF (ldim < lDim) THEN
  8530. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8531. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8532. WHILE (len > 0) DO
  8533. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8534. INC( dadr, dinc ); DEC( len );
  8535. END;
  8536. ELSIF (rdim # loopd) THEN
  8537. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8538. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8539. WHILE (len > 0) DO
  8540. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8541. INC( dadr, dinc ); DEC( len );
  8542. END;
  8543. ELSE
  8544. (*
  8545. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8546. KernelLog.Int(GetAdr(dest),10);
  8547. KernelLog.Int(GetAdr(dest)+clen,10);
  8548. KernelLog.Ln;
  8549. *)
  8550. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8551. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8552. END;
  8553. END Traverse;
  8554. BEGIN
  8555. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8556. (* check array lengths *)
  8557. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8558. p := AllocateTensor( dest, left, right, elementSize );
  8559. (*
  8560. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8561. p := AllocateTensor( left, right, dest, elementSize )
  8562. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8563. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8564. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8565. END;
  8566. (*! to be done: treat overlapping memory *)
  8567. END;
  8568. *)
  8569. (* debugging *)
  8570. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8571. (* check pattern: longest piece that can be done with a loop *)
  8572. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8573. (* run through dimensions *)
  8574. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8575. SYSTEM.PUT( d, dest );
  8576. END ApplyTensorAAAOp;
  8577. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8578. BEGIN
  8579. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8580. SIZEOF( SHORTINT ), MulASSSLoop );
  8581. RETURN RESULT
  8582. END "**";
  8583. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8584. BEGIN
  8585. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8586. SIZEOF( INTEGER ), MulAISILoop );
  8587. RETURN RESULT
  8588. END "**";
  8589. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8590. BEGIN
  8591. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8592. SIZEOF( LONGINT ), MulALSLLoop );
  8593. RETURN RESULT
  8594. END "**";
  8595. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8596. BEGIN
  8597. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8598. loopMulARSR );
  8599. RETURN RESULT
  8600. END "**";
  8601. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8602. BEGIN
  8603. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8604. SIZEOF( LONGREAL ), loopMulAXSX );
  8605. RETURN RESULT
  8606. END "**";
  8607. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8608. BEGIN
  8609. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8610. loopMulAZSZ );
  8611. RETURN RESULT
  8612. END "**";
  8613. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8614. BEGIN
  8615. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8616. loopMulALZSLZ );
  8617. RETURN RESULT
  8618. END "**";
  8619. PROCEDURE InitOptimization;
  8620. VAR p: PROCEDURE;
  8621. BEGIN
  8622. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8623. IF p # NIL THEN
  8624. p;
  8625. ELSE
  8626. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8627. END;
  8628. END InitOptimization;
  8629. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8630. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: Address;
  8631. BEGIN
  8632. IF src = 0 THEN
  8633. HALT(100);
  8634. ELSE
  8635. srcDim := GetDim(src);
  8636. destDim := srcDim - prefixIndices - suffixIndices;
  8637. (*
  8638. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8639. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8640. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8641. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8642. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8643. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8644. *)
  8645. destPtr := GetArrayDesc(destDim);
  8646. dest := SYSTEM.VAL(LONGINT,destPtr);
  8647. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8648. PutAdr(dest,GetAdr(src));
  8649. PutPtr(dest,GetPtr(src));
  8650. PutFlags(dest,GetFlags(src));
  8651. PutSize(dest,GetSize(src));
  8652. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8653. srcDim := i + prefixIndices + prefixRanges;
  8654. destDim := i + prefixRanges;
  8655. len := GetLen(src,srcDim);
  8656. incr := GetIncr(src,srcDim);
  8657. PutLen(dest,destDim,len);
  8658. PutInc(dest,destDim,incr);
  8659. END;
  8660. (*
  8661. Report("copy descriptor src",src);
  8662. Report("copy descriptor dest",dest);
  8663. *)
  8664. END;
  8665. END CopyDescriptor;
  8666. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8667. VAR dest: ARRAY [?] OF basetype
  8668. CONST src: ARRAY [?] OF basetype
  8669. CONST shape: ARRAY [*] OF LONGINT
  8670. *)
  8671. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8672. BEGIN
  8673. DoReshape(SYSTEM.VAL(LONGINT,RESULT), SYSTEM.VAL(LONGINT,left), right);
  8674. RETURN RESULT
  8675. END Reshape;
  8676. (* OLIVIER *)
  8677. (** creates a degenerated range from an integer.
  8678. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8679. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8680. **)
  8681. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8682. BEGIN RETURN (integer .. integer BY 1)
  8683. END RangeFromInteger;
  8684. (* OLIVIER *)
  8685. (** create an array with the same data but with more dimensions
  8686. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8687. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8688. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8689. e.g.:
  8690. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8691. performs the following type transformation:
  8692. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8693. **)
  8694. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8695. VAR
  8696. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8697. sourceAddress, targetAddress: LONGINT;
  8698. targetArrayDescriptor: ANY;
  8699. BEGIN
  8700. sourceAddress := SYSTEM.VAL(LONGINT, sourceArray);
  8701. targetDimensionality := LEN(keptDimensions, 0);
  8702. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8703. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8704. targetAddress := SYSTEM.VAL(LONGINT, RESULT);
  8705. PutAdr(targetAddress, GetAdr(sourceAddress));
  8706. PutPtr(targetAddress, GetPtr(sourceAddress));
  8707. PutFlags(targetAddress, {TensorFlag});
  8708. PutSize(targetAddress, GetSize(sourceAddress));
  8709. (* set increments and lengths *)
  8710. sourceIndex := 0;
  8711. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8712. IF keptDimensions[targetIndex] THEN
  8713. (* reuse length and increment from source array *)
  8714. ASSERT(sourceIndex < DIM(sourceArray));
  8715. PutLen(targetAddress, targetIndex, GetLen(sourceAddress, sourceIndex));
  8716. PutInc(targetAddress, targetIndex, GetIncr(sourceAddress, sourceIndex));
  8717. INC(sourceIndex)
  8718. ELSE
  8719. (* set length = 1 and increment = 0 *)
  8720. PutLen(targetAddress, targetIndex, 1);
  8721. PutInc(targetAddress, targetIndex, 0);
  8722. END
  8723. END;
  8724. (* Report("expand dimensions: ", targetAddress); *)
  8725. RETURN RESULT
  8726. END ExpandDimensions;
  8727. (* index ranges *)
  8728. (* the length of a range, i.e. the number of indices that it stands for *)
  8729. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8730. VAR
  8731. temp, result: LONGINT;
  8732. BEGIN
  8733. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8734. (* invalid range *)
  8735. result := 0
  8736. ELSIF LAST(range) = MAX(LONGINT) THEN
  8737. (* open-ended range *)
  8738. result := MAX(LONGINT)
  8739. ELSE
  8740. temp := 1 + LAST(range) - FIRST(range);
  8741. result := temp DIV STEP(range);
  8742. IF (temp MOD STEP(range)) # 0 THEN
  8743. INC(result)
  8744. END
  8745. END;
  8746. RETURN result
  8747. END "LEN";
  8748. (* complex numbers *)
  8749. OPERATOR "+"*(CONST left, right: COMPLEX): COMPLEX;
  8750. VAR result: COMPLEX;
  8751. BEGIN
  8752. RE(result) := RE(left) + RE(right);
  8753. IM(result) := IM(left) + IM(right);
  8754. RETURN result
  8755. END "+";
  8756. OPERATOR "+"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8757. VAR result: LONGCOMPLEX;
  8758. BEGIN
  8759. RE(result) := RE(left) + RE(right);
  8760. IM(result) := IM(left) + IM(right);
  8761. RETURN result
  8762. END "+";
  8763. OPERATOR "-"*(CONST left, right: COMPLEX): COMPLEX;
  8764. VAR result: COMPLEX;
  8765. BEGIN
  8766. RE(result) := RE(left) - RE(right);
  8767. IM(result) := IM(left) - IM(right);
  8768. RETURN result
  8769. END "-";
  8770. OPERATOR "-"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8771. VAR result: LONGCOMPLEX;
  8772. BEGIN
  8773. RE(result) := RE(left) - RE(right);
  8774. IM(result) := IM(left) - IM(right);
  8775. RETURN result
  8776. END "-";
  8777. OPERATOR "*"*(CONST left, right: COMPLEX): COMPLEX;
  8778. VAR result: COMPLEX;
  8779. BEGIN
  8780. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8781. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8782. RETURN result
  8783. END "*";
  8784. OPERATOR "*"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8785. VAR result: LONGCOMPLEX;
  8786. BEGIN
  8787. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8788. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8789. RETURN result
  8790. END "*";
  8791. OPERATOR "/"*(CONST left, right: COMPLEX): COMPLEX;
  8792. VAR result: COMPLEX; iDivisor: REAL;
  8793. BEGIN
  8794. iDivisor := 1.0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8795. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8796. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8797. RETURN result
  8798. END "/";
  8799. OPERATOR "/"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8800. VAR result: LONGCOMPLEX; iDivisor: LONGREAL;
  8801. BEGIN
  8802. iDivisor := 1.0D0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8803. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8804. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8805. RETURN result
  8806. END "/";
  8807. OPERATOR "ABS"*(CONST arg: COMPLEX): REAL;
  8808. BEGIN RETURN Math.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8809. END "ABS";
  8810. OPERATOR "ABS"*(CONST arg: LONGCOMPLEX): LONGREAL;
  8811. BEGIN RETURN MathL.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8812. END "ABS";
  8813. OPERATOR "~"*(CONST left: COMPLEX): COMPLEX;
  8814. BEGIN
  8815. RETURN RE(left) - IM(left) * IMAG
  8816. END "~";
  8817. OPERATOR "~"*(CONST left: LONGCOMPLEX): LONGCOMPLEX;
  8818. BEGIN
  8819. RETURN RE(left) - IM(left) * IMAG
  8820. END "~";
  8821. OPERATOR "<="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8822. OPERATOR ">="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8823. OPERATOR "<"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8824. OPERATOR ">"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8825. OPERATOR "<="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8826. OPERATOR ">="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8827. OPERATOR "<"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8828. OPERATOR ">"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8829. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8830. BEGIN
  8831. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8832. RETURN RESULT;
  8833. END "ALL";
  8834. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8835. BEGIN
  8836. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8837. RETURN RESULT;
  8838. END "ALL";
  8839. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8840. BEGIN
  8841. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8842. RETURN RESULT;
  8843. END "ALL";
  8844. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8845. BEGIN
  8846. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8847. RETURN RESULT;
  8848. END "ALL";
  8849. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8850. BEGIN
  8851. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8852. RETURN RESULT;
  8853. END "ALL";
  8854. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8855. BEGIN
  8856. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8857. RETURN RESULT;
  8858. END "ALL";
  8859. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8860. BEGIN
  8861. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8862. RETURN RESULT;
  8863. END "ALL";
  8864. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8865. BEGIN
  8866. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8867. RETURN RESULT;
  8868. END "ALL";
  8869. BEGIN
  8870. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8871. END FoxArrayBase.
  8872. Compiler.Compile FoxArrayBase.Mod ~
  8873. SystemTools.ListModules