FoxArrayBase.Mod 346 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. CONST
  23. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  24. statistics= FALSE;
  25. conservative=TRUE;
  26. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  27. AddressSize=SIZEOF(ADDRESS);
  28. MathPtrOffset=0*AddressSize;
  29. MathAdrOffset=1*AddressSize;
  30. MathFlagsOffset=2*AddressSize;
  31. MathDimOffset=3*AddressSize;
  32. MathElementSizeOffset=4*AddressSize;
  33. MathLenOffset=5*AddressSize;
  34. MathIncrOffset=6*AddressSize;
  35. GeometryMismatch = 400;
  36. DimensionMismatch=401;
  37. AllocationForbidden=402;
  38. ArrayAlignment=8;
  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: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  75. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  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,UNTRACED} 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: ADDRESS);
  111. VAR
  112. temporary*: T0;
  113. alloc*: LONGINT; (* statistics *)
  114. allocTemp*: LONGINT; (* statistics *)
  115. (* procedures that might be replaced by ASM methods *)
  116. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  117. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  118. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  119. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  120. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  121. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  122. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  123. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  124. transpose4*: TransposeP; transpose8*: TransposeP;
  125. (* optimizations for small arrays (Alexey Morozov) *)
  126. matMulR2x2*: SmallMatMul;
  127. matMulR3x3*: SmallMatMul;
  128. matMulR4x4*: SmallMatMul;
  129. matVecMulR2x2*: SmallMatMul;
  130. matVecMulR3x3*: SmallMatMul;
  131. matVecMulR4x4*: SmallMatMul;
  132. matMulLR2x2*: SmallMatMul;
  133. matMulLR3x3*: SmallMatMul;
  134. matMulLR4x4*: SmallMatMul;
  135. matVecMulLR2x2*: SmallMatMul;
  136. matVecMulLR3x3*: SmallMatMul;
  137. matVecMulLR4x4*: SmallMatMul;
  138. (*
  139. TensorTypePool: ARRAY 32 OF TensorType;
  140. *)
  141. PROCEDURE SetDefaults*; (* set standard procedures *)
  142. BEGIN
  143. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  144. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  145. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  146. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  147. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  148. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  149. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  150. loopIncMulAXSX := IncMulAXSXLoop;
  151. loopMatMulIncARAR := MatMulIncARARLoop;
  152. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  153. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  154. loopMulAZSZ := MulAZSZLoop;
  155. loopMulALZSLZ := MulALZSLZLoop;
  156. END SetDefaults;
  157. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  158. BEGIN
  159. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  160. END Err;
  161. (* get increment of dimension dim *)
  162. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  163. BEGIN{UNCHECKED}
  164. RETURN base.lens[dim].inc
  165. END GetIncr;
  166. (* set increment of dimension dim *)
  167. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  168. BEGIN{UNCHECKED}
  169. base.lens[dim].inc := val
  170. END PutInc;
  171. (* get length of dimension dim *)
  172. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  173. BEGIN{UNCHECKED}
  174. RETURN base.lens[dim].len
  175. END GetLen;
  176. (* set length of dimension dim *)
  177. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  178. BEGIN{UNCHECKED}
  179. base.lens[dim].len := val
  180. END PutLen;
  181. (* get data address *)
  182. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  183. BEGIN
  184. RETURN base.adr;
  185. END GetAdr;
  186. (* set data address *)
  187. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  188. BEGIN
  189. base.adr := value
  190. END PutAdr;
  191. PROCEDURE Align(value: ADDRESS): ADDRESS;
  192. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  193. END Align;
  194. (* get data base pointer (GC protection) *)
  195. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  196. BEGIN
  197. RETURN base.ptr;
  198. END GetPtr;
  199. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  200. BEGIN
  201. dest := src;
  202. END SafePut;
  203. (* set data base pointer (GC protection) *)
  204. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  205. BEGIN
  206. SafePut(base.ptr,value);
  207. END PutPtr;
  208. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  209. BEGIN
  210. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  211. END GetSize;
  212. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  213. BEGIN
  214. base.elementSize := val
  215. END PutSize;
  216. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  217. VAR dim: SIZE;
  218. BEGIN
  219. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  220. END GetDim;
  221. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  222. BEGIN
  223. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  224. END GetFlags;
  225. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  226. BEGIN
  227. base.dim := dim
  228. END PutDim;
  229. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  230. BEGIN
  231. base.flags := flags
  232. END PutFlags;
  233. (* report geometry of array passed via address s *)
  234. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  235. VAR i: SIZE; dim: SIZE;
  236. PROCEDURE Set( s: SET );
  237. VAR i: SIZE; first: BOOLEAN;
  238. BEGIN
  239. KernelLog.String( "{" ); first := TRUE;
  240. FOR i := 31 TO 0 BY -1 DO
  241. IF i IN s THEN
  242. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  243. KernelLog.Int( i, 1 );
  244. END;
  245. END;
  246. KernelLog.String( "}" );
  247. END Set;
  248. BEGIN
  249. KernelLog.String( name );
  250. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  251. ELSE
  252. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  253. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  254. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  255. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  256. KernelLog.Ln; dim := GetDim( s );
  257. IF dim > 32 THEN dim := 0 END;
  258. FOR i := 0 TO dim - 1 DO
  259. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  260. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  261. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  262. END;
  263. (*
  264. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  265. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  266. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  267. *)
  268. END;
  269. END Report;
  270. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  271. VAR (* t: TensorType; *) ptr: Tensor;
  272. p0: T0;
  273. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  274. BEGIN
  275. CASE dim OF
  276. |0: NEW(p0); ptr := p0;
  277. |1:NEW(p1); ptr := p1;
  278. |2:NEW(p2); ptr := p2;
  279. |3:NEW(p3); ptr := p3;
  280. |4:NEW(p4); ptr := p4;
  281. |5:NEW(p5); ptr := p5;
  282. |6:NEW(p6); ptr := p6;
  283. |7:NEW(p7); ptr := p7;
  284. |8:NEW(p8); ptr := p8;
  285. ELSE
  286. HALT(200)
  287. END;
  288. ptr.dim := dim;
  289. ptr.flags := {TensorFlag};
  290. RETURN ptr;
  291. END GetArrayDesc;
  292. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  293. BEGIN
  294. IF d = NIL THEN
  295. d := GetArrayDesc(dim);
  296. ELSIF d.dim # dim THEN
  297. IF ~(TensorFlag IN d.flags) &
  298. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  299. HALT( 100 );
  300. END;
  301. d := GetArrayDesc(dim)
  302. (* ELSE keep as is *)
  303. END;
  304. END EnsureArrayDesc;
  305. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  306. VAR reason: ARRAY 64 OF CHAR;
  307. BEGIN
  308. IF left # 0 THEN Report( "Source operand ", left ) END;
  309. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  310. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  311. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  312. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  313. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  314. ELSE reason := "unknown";
  315. END;
  316. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  317. HALT( 400 );
  318. END Halt;
  319. (** patterns ********************************************************************)
  320. (* 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 *)
  321. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  322. BEGIN
  323. d := dim - 1; len := GetLen( left, d );
  324. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  325. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  326. linc := GetIncr( left, d ); DEC( d );
  327. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  328. len := len * GetLen( left, d ); DEC( d );
  329. END; (* find dimension where pattern does not work any more *)
  330. INC( d );
  331. IF debug THEN
  332. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  333. KernelLog.Ln;
  334. END;
  335. END FindPattern1;
  336. (* 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 *)
  337. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  338. VAR d, len, linc, ri: SIZE );
  339. (* geometric precondition: lengths must coincide *)
  340. BEGIN
  341. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  342. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  343. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  344. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  345. len := len * GetLen( left, d ); DEC( d );
  346. END;
  347. INC( d );
  348. IF debug THEN
  349. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  350. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  351. END;
  352. END FindPattern2;
  353. (* 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 *)
  354. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  355. VAR d, len, linc, ri, di: SIZE );
  356. (* geometric precondition: lengths must coincide *)
  357. BEGIN
  358. d := dim - 1; len := GetLen( left, d );
  359. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  360. END;
  361. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  362. DEC( d );
  363. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  364. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  365. len := len * GetLen( left, d ); DEC( d );
  366. END;
  367. INC( d );
  368. IF debug THEN
  369. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  370. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  371. END;
  372. END FindPattern3;
  373. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  374. VAR d, sl, sr: SIZE;
  375. BEGIN
  376. d := 0; sl := GetAdr( src );
  377. WHILE (d < dim) DO
  378. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  379. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  380. END;
  381. PutAdr( src, sl + sr );
  382. END Reverse;
  383. (* check if forward copy may be performed *)
  384. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  385. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  386. (* precondition: len(src,i)=len(dest,i) *)
  387. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  388. Sufficient (but not necessary) conditions:
  389. 1.) no overlap: src right < dest left or src left > dest right or
  390. 2.) same geometry and src left >= dest left
  391. same geometry if ginc(s)=ginc(d) with
  392. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  393. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  394. *)
  395. BEGIN
  396. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  397. dim := GetDim( src );
  398. WHILE (d < dim) DO
  399. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  400. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  401. END;
  402. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  403. ELSIF ((sr - sl) = (dr - dl)) THEN
  404. IF (sl = dl) THEN (* same memory region, both directions possible *)
  405. ELSIF (sl > dl) THEN
  406. EXCL( modes, down ) (* only copy up possible *)
  407. ELSE (*sl < dl*)
  408. EXCL( modes, up ) (* only copy down possible *)
  409. END;
  410. ELSE
  411. modes := modes - {down, up}; (* neither nor *)
  412. END;
  413. END CopyUpCompatible;
  414. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  415. Size: SIZE ): ANY;
  416. (* allocate a temporary block containing both descriptor and data *)
  417. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  418. BEGIN
  419. HALT(100);
  420. (*
  421. IF statistics THEN INC( allocTemp ) END;
  422. d := 0; len := Size; dim := GetDim( src );
  423. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  424. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  425. dest := SYSTEM.VAL( SIZE, p );
  426. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  427. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  428. FOR i := 0 TO dim - 1 DO
  429. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  430. len := len * GetLen( src, i );
  431. END;
  432. (* Report("allocdest",dest,dim); *)
  433. RETURN p;
  434. *)
  435. END AllocateTemp;
  436. (*** procedures to traverse arrays and apply operators *)
  437. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  438. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  439. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  440. origdest: ADDRESS; modes: SET;
  441. dest, left: ADDRESS; dim: SIZE;
  442. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  443. VAR len: SIZE; linc, dinc: SIZE;
  444. BEGIN
  445. IF dim = loopd THEN
  446. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  447. IF conservative THEN INC( glen, looplen ) END;
  448. ELSE
  449. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  450. dinc := GetIncr( dest, dim ); INC( dim );
  451. WHILE (len > 0) DO
  452. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  453. END;
  454. END;
  455. END Traverse;
  456. BEGIN
  457. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  458. origdest := 0; modes := {up, down};
  459. (* allocate destination, if necessary *)
  460. p := AllocateSame( dest, left, elementSize );
  461. IF p = NIL THEN
  462. CopyUpCompatible( dest, left, modes );
  463. IF up IN modes THEN (* nothing to be done *)
  464. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  465. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  466. END;
  467. END;
  468. (* allocate destination, if necessary *)
  469. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  470. ELSIF CheckGeometry( left, dest, dim )
  471. END; *)
  472. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  473. (* check pattern: longest piece that can be done with a loop *)
  474. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  475. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  476. IF up IN modes THEN (* nothing to be done *)
  477. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  478. ELSE CopyContent( origdest, dest, elementSize );
  479. END;
  480. SYSTEM.PUT( d, dest );
  481. IF d = p THEN (* new block *)
  482. Heaps.CheckAssignment(d,dest);
  483. END;
  484. END ApplyGenericUnaryAAOpS;
  485. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  486. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  487. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  488. origdest: SIZE; modes: SET;
  489. dest, left: ADDRESS; dim: SIZE;
  490. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  491. VAR len: SIZE; linc, dinc: SIZE;
  492. BEGIN
  493. IF dim = loopd THEN
  494. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  495. IF conservative THEN INC( glen, looplen ) END;
  496. ELSE
  497. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  498. dinc := GetIncr( dest, dim ); INC( dim );
  499. WHILE (len > 0) DO
  500. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  501. END;
  502. END;
  503. END Traverse;
  504. BEGIN
  505. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  506. origdest := 0; modes := {up, down};
  507. (* allocate destination, if necessary *)
  508. p := AllocateSame( dest, left, elementSize );
  509. IF p = NIL THEN
  510. CopyUpCompatible( dest, left, modes );
  511. IF up IN modes THEN (* nothing to be done *)
  512. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  513. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  514. END;
  515. END;
  516. (* allocate destination, if necessary *)
  517. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  518. ELSIF CheckGeometry( left, dest, dim )
  519. END; *)
  520. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  521. (* check pattern: longest piece that can be done with a loop *)
  522. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  523. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  524. IF up IN modes THEN (* nothing to be done *)
  525. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  526. ELSE CopyContent( origdest, dest, elementSize );
  527. END;
  528. SYSTEM.PUT( d, dest );
  529. IF d = p THEN (* new block *)
  530. Heaps.CheckAssignment(d,dest);
  531. END;
  532. END ApplyGenericUnaryAAOpI;
  533. (** apply unary operator to array: array SIZE -> array SIZE *)
  534. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  535. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  536. origdest: SIZE; modes: SET;
  537. dest, left: ADDRESS; dim: SIZE;
  538. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  539. VAR len: SIZE; linc, dinc: SIZE;
  540. BEGIN
  541. IF dim = loopd THEN
  542. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  543. IF conservative THEN INC( glen, looplen ) END;
  544. ELSE
  545. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  546. dinc := GetIncr( dest, dim ); INC( dim );
  547. WHILE (len > 0) DO
  548. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  549. END;
  550. END;
  551. END Traverse;
  552. BEGIN
  553. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  554. origdest := 0; modes := {up, down};
  555. (* allocate destination, if necessary *)
  556. p := AllocateSame( dest, left, elementSize );
  557. IF p = NIL THEN
  558. CopyUpCompatible( dest, left, modes );
  559. IF up IN modes THEN (* nothing to be done *)
  560. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  561. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  562. END;
  563. END;
  564. (* allocate destination, if necessary *)
  565. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  566. ELSIF CheckGeometry( left, dest, dim )
  567. END; *)
  568. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  569. (* check pattern: longest piece that can be done with a loop *)
  570. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  571. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  572. IF up IN modes THEN (* nothing to be done *)
  573. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  574. ELSE CopyContent( origdest, dest, elementSize );
  575. END;
  576. SYSTEM.PUT( d, dest );
  577. IF d = p THEN (* new block *)
  578. Heaps.CheckAssignment(d,dest);
  579. END;
  580. END ApplyGenericUnaryAAOpL;
  581. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  582. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  583. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  584. origdest: SIZE; modes: SET;
  585. VAR dest, left: ADDRESS; dim: SIZE;
  586. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  587. VAR len: SIZE; linc, dinc: SIZE;
  588. BEGIN
  589. IF dim = loopd THEN
  590. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  591. IF conservative THEN INC( glen, looplen ) END;
  592. ELSE
  593. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  594. dinc := GetIncr( dest, dim ); INC( dim );
  595. WHILE (len > 0) DO
  596. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  597. DEC( len );
  598. END;
  599. END;
  600. END Traverse;
  601. BEGIN
  602. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  603. origdest := 0; modes := {up, down};
  604. (* allocate destination, if necessary *)
  605. p := AllocateSame( dest, left, elementSize );
  606. IF p = NIL THEN
  607. CopyUpCompatible( dest, left, modes );
  608. IF up IN modes THEN (* nothing to be done *)
  609. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  610. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  611. END;
  612. END;
  613. (*
  614. (* allocate destination, if necessary *)
  615. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  616. ELSIF CheckGeometry( left, dest, dim )
  617. END;
  618. *)
  619. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  620. (* check pattern: longest piece that can be done with a loop *)
  621. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  622. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  623. IF up IN modes THEN (* nothing to be done *)
  624. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  625. ELSE CopyContent( origdest, dest, elementSize );
  626. END;
  627. SYSTEM.PUT( d, dest );
  628. IF d = p THEN (* new block *)
  629. Heaps.CheckAssignment(d,dest);
  630. END;
  631. END ApplyGenericUnaryAAOpH;
  632. (** apply unary operator to array: array REAL -> array REAL *)
  633. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  634. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  635. origdest: SIZE; modes: SET;
  636. dest, left: ADDRESS; dim: SIZE;
  637. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  638. VAR len: SIZE; linc, dinc: SIZE;
  639. BEGIN
  640. IF dim = loopd THEN
  641. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  642. IF conservative THEN INC( glen, looplen ) END;
  643. ELSE
  644. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  645. dinc := GetIncr( dest, dim ); INC( dim );
  646. WHILE (len > 0) DO
  647. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  648. END;
  649. END;
  650. END Traverse;
  651. BEGIN
  652. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  653. origdest := 0; modes := {up, down};
  654. (* allocate destination, if necessary *)
  655. p := AllocateSame( dest, left, elementSize );
  656. IF p = NIL THEN
  657. CopyUpCompatible( dest, left, modes );
  658. IF up IN modes THEN (* nothing to be done *)
  659. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  660. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  661. END;
  662. END;
  663. (* allocate destination, if necessary *)
  664. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  665. ELSIF CheckGeometry( left, dest, dim )
  666. END; *)
  667. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  668. (* check pattern: longest piece that can be done with a loop *)
  669. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  670. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  671. IF up IN modes THEN (* nothing to be done *)
  672. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  673. ELSE CopyContent( origdest, dest, elementSize );
  674. END;
  675. SYSTEM.PUT( d, dest );
  676. IF d = p THEN (* new block *)
  677. Heaps.CheckAssignment(d,dest);
  678. END;
  679. END ApplyGenericUnaryAAOpR;
  680. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  681. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  682. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  683. origdest: SIZE; modes: SET;
  684. dest, left: ADDRESS; dim: SIZE;
  685. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  686. VAR len: SIZE; linc, dinc: SIZE;
  687. BEGIN
  688. IF dim = loopd THEN
  689. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  690. IF conservative THEN INC( glen, looplen ) END;
  691. ELSE
  692. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  693. dinc := GetIncr( dest, dim ); INC( dim );
  694. WHILE (len > 0) DO
  695. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  696. DEC( len );
  697. END;
  698. END;
  699. END Traverse;
  700. BEGIN
  701. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  702. origdest := 0; modes := {up, down};
  703. (* allocate destination, if necessary *)
  704. p := AllocateSame( dest, left, elementSize );
  705. IF p = NIL THEN
  706. CopyUpCompatible( dest, left, modes );
  707. IF up IN modes THEN (* nothing to be done *)
  708. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  709. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  710. END;
  711. END;
  712. (*
  713. (* allocate destination, if necessary *)
  714. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  715. ELSIF CheckGeometry( left, dest, dim )
  716. END;
  717. *)
  718. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  719. (* check pattern: longest piece that can be done with a loop *)
  720. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  721. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  722. IF up IN modes THEN (* nothing to be done *)
  723. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  724. ELSE CopyContent( origdest, dest, elementSize );
  725. END;
  726. SYSTEM.PUT( d, dest );
  727. IF d = p THEN (* new block *)
  728. Heaps.CheckAssignment(d,dest);
  729. END;
  730. END ApplyGenericUnaryAAOpX;
  731. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  732. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  733. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  734. origdest: SIZE; modes: SET;
  735. dest, left: ADDRESS; dim: SIZE;
  736. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  737. VAR len: SIZE; linc, dinc: SIZE;
  738. BEGIN
  739. IF dim = loopd THEN
  740. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  741. IF conservative THEN INC( glen, looplen ) END;
  742. ELSE
  743. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  744. dinc := GetIncr( dest, dim ); INC( dim );
  745. WHILE (len > 0) DO
  746. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  747. DEC( len );
  748. END;
  749. END;
  750. END Traverse;
  751. BEGIN
  752. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  753. origdest := 0; modes := {up, down};
  754. (* allocate destination, if necessary *)
  755. p := AllocateSame( dest, left, elementSize );
  756. IF p = NIL THEN
  757. CopyUpCompatible( dest, left, modes );
  758. IF up IN modes THEN (* nothing to be done *)
  759. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  760. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  761. END;
  762. END;
  763. (*
  764. (* allocate destination, if necessary *)
  765. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  766. ELSIF CheckGeometry( left, dest, dim )
  767. END;
  768. *)
  769. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  770. (* check pattern: longest piece that can be done with a loop *)
  771. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  772. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  773. IF up IN modes THEN (* nothing to be done *)
  774. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  775. ELSE CopyContent( origdest, dest, elementSize );
  776. END;
  777. SYSTEM.PUT( d, dest );
  778. IF d = p THEN (* new block *)
  779. Heaps.CheckAssignment(d,dest);
  780. END;
  781. END ApplyGenericUnaryAAOpZ;
  782. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  783. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  784. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  785. origdest: SIZE; modes: SET;
  786. dest, left: ADDRESS; dim: SIZE;
  787. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  788. VAR len: SIZE; linc, dinc: SIZE;
  789. BEGIN
  790. IF dim = loopd THEN
  791. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  792. IF conservative THEN INC( glen, looplen ) END;
  793. ELSE
  794. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  795. dinc := GetIncr( dest, dim ); INC( dim );
  796. WHILE (len > 0) DO
  797. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  798. DEC( len );
  799. END;
  800. END;
  801. END Traverse;
  802. BEGIN
  803. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  804. origdest := 0; modes := {up, down};
  805. (* allocate destination, if necessary *)
  806. p := AllocateSame( dest, left, elementSize );
  807. IF p = NIL THEN
  808. CopyUpCompatible( dest, left, modes );
  809. IF up IN modes THEN (* nothing to be done *)
  810. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  811. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  812. END;
  813. END;
  814. (*
  815. (* allocate destination, if necessary *)
  816. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  817. ELSIF CheckGeometry( left, dest, dim )
  818. END;
  819. *)
  820. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  821. (* check pattern: longest piece that can be done with a loop *)
  822. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  823. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  824. IF up IN modes THEN (* nothing to be done *)
  825. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  826. ELSE CopyContent( origdest, dest, elementSize );
  827. END;
  828. SYSTEM.PUT( d, dest );
  829. IF d = p THEN (* new block *)
  830. Heaps.CheckAssignment(d,dest);
  831. END;
  832. END ApplyGenericUnaryAAOpLZ;
  833. (** apply unary operator to array: array -> array *)
  834. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  835. Loop: UnaryAALoop );
  836. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  837. origdest: SIZE; modes: SET;
  838. dest, left: ADDRESS; dim: SIZE;
  839. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  840. VAR len: SIZE; linc, dinc: SIZE;
  841. BEGIN
  842. IF dim = loopd THEN
  843. Loop( ladr, dadr, loopli, loopdi, looplen );
  844. IF conservative THEN INC( glen, looplen ) END;
  845. ELSE
  846. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  847. dinc := GetIncr( dest, dim ); INC( dim );
  848. WHILE (len > 0) DO
  849. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  850. DEC( len );
  851. END;
  852. END;
  853. END Traverse;
  854. BEGIN
  855. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  856. origdest := 0; modes := {up, down};
  857. (* allocate destination, if necessary *)
  858. p := AllocateSame( dest, left, elementSize );
  859. IF p = NIL THEN
  860. CopyUpCompatible( dest, left, modes );
  861. IF up IN modes THEN (* nothing to be done *)
  862. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  863. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  864. END;
  865. END;
  866. (*
  867. (* allocate destination, if necessary *)
  868. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  869. ELSIF CheckGeometry( left, dest, dim )
  870. END;
  871. *)
  872. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  873. (* check pattern: longest piece that can be done with a loop *)
  874. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  875. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  876. IF up IN modes THEN (* nothing to be done *)
  877. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  878. ELSE CopyContent( origdest, dest, elementSize );
  879. END;
  880. SYSTEM.PUT( d, dest );
  881. IF d = p THEN (* new block *)
  882. Heaps.CheckAssignment(d,dest);
  883. END;
  884. END ApplyUnaryAAOp;
  885. (** apply unary operator to array: array -> scalar *)
  886. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  887. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  888. VAR left: ADDRESS; dim: SIZE;
  889. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  890. VAR len: SIZE; linc: SIZE;
  891. BEGIN
  892. IF dim = loopd THEN
  893. Loop( ladr, dest, loopli, looplen );
  894. IF conservative THEN INC( glen, looplen ) END;
  895. ELSE
  896. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  897. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  898. END;
  899. END Traverse;
  900. BEGIN
  901. SYSTEM.GET( l, left ); dim := GetDim( left );
  902. IF debug THEN Report( "AS: left", left ); END;
  903. (* check pattern: longest piece that can be done with a loop *)
  904. IF conservative THEN glen := 0 END;
  905. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  906. IF conservative THEN
  907. looplen := 1;
  908. WHILE (dim > 0) DO
  909. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  910. END;
  911. ASSERT( looplen = glen );
  912. END;
  913. END ApplyUnaryASOp;
  914. (** apply unary operator to array: scalar -> array *)
  915. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  916. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  917. VAR dest: ADDRESS; dim: SIZE;
  918. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  919. VAR len: SIZE; dinc: SIZE;
  920. BEGIN
  921. IF dim = loopd THEN
  922. Loop( right, dadr, loopdi, looplen );
  923. IF conservative THEN INC( glen, looplen ) END;
  924. ELSE
  925. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  926. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  927. END;
  928. END Traverse;
  929. BEGIN
  930. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  931. IF debug THEN Report( "AS: dest", dest ); END;
  932. (* check pattern: longest piece that can be done with a loop *)
  933. IF conservative THEN glen := 0 END;
  934. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  935. IF conservative THEN
  936. looplen := 1;
  937. WHILE (dim > 0) DO
  938. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  939. END;
  940. ASSERT( looplen = glen );
  941. END;
  942. END ApplyUnarySAOp;
  943. (** apply binary operator : array x array -> array *)
  944. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  945. Loop: BinaryAAALoop );
  946. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  947. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  948. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  949. VAR len: SIZE; linc, rinc, dinc: SIZE;
  950. BEGIN
  951. IF dim = loopd THEN
  952. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  953. IF conservative THEN INC( glen, looplen ) END;
  954. ELSE
  955. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  956. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  957. WHILE (len > 0) DO
  958. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  959. INC( dadr, dinc ); DEC( len );
  960. END;
  961. END;
  962. END Traverse;
  963. BEGIN
  964. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  965. (* allocate destination, if necessary *)
  966. IF ~SameShape( left, right ) THEN
  967. Halt( GeometryMismatch, left, right, 0 )
  968. END;
  969. origdest := 0; modes := {up, down};
  970. p := AllocateSame( dest, left, elementSize );
  971. IF p = NIL THEN
  972. CopyUpCompatible( dest, left, modes );
  973. CopyUpCompatible( dest, right, modes );
  974. IF up IN modes THEN (* nothing to be done *)
  975. ELSIF down IN modes THEN
  976. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  977. ELSE
  978. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  979. END;
  980. END;
  981. (* debugging *)
  982. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  983. (* check pattern: longest piece that can be done with a loop *)
  984. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  985. (* run through dimensions *)
  986. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  987. IF up IN modes THEN (* nothing to be done *)
  988. ELSIF down IN modes THEN
  989. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  990. ELSE CopyContent( origdest, dest, elementSize );
  991. END;
  992. SYSTEM.PUT( d, dest );
  993. IF d = p THEN (* new block *)
  994. Heaps.CheckAssignment(d,dest);
  995. END;
  996. END ApplyBinaryAAAOp;
  997. (** apply binary operator: array x scalar -> array *)
  998. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  999. elementSize: SIZE;
  1000. Loop: BinaryASALoop );
  1001. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1002. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1003. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1004. VAR len: SIZE; linc, dinc: SIZE;
  1005. BEGIN
  1006. IF dim = loopd THEN
  1007. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1008. IF conservative THEN INC( glen, looplen ) END;
  1009. ELSE
  1010. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1011. dinc := GetIncr( dest, dim ); INC( dim );
  1012. WHILE (len > 0) DO
  1013. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1014. DEC( len );
  1015. END;
  1016. END;
  1017. END Traverse;
  1018. BEGIN
  1019. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1020. (* allocate destination, if necessary *)
  1021. origdest := 0; modes := {up, down};
  1022. p := AllocateSame( dest, left, elementSize );
  1023. IF p = NIL THEN
  1024. CopyUpCompatible( dest, left, modes );
  1025. IF up IN modes THEN (* nothing to be done *)
  1026. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1027. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1028. END;
  1029. END;
  1030. (* debugging *)
  1031. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1032. (* check pattern: longest piece that can be done with a loop *)
  1033. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1034. (* run through dimensions *)
  1035. IF conservative THEN glen := 0 END;
  1036. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1037. IF conservative THEN
  1038. looplen := 1;
  1039. WHILE (dim > 0) DO
  1040. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1041. END;
  1042. ASSERT( looplen = glen );
  1043. END;
  1044. IF up IN modes THEN (* nothing to be done *)
  1045. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1046. ELSE CopyContent( origdest, dest, elementSize );
  1047. END;
  1048. SYSTEM.PUT( d, dest );
  1049. IF d = p THEN (* new block *)
  1050. Heaps.CheckAssignment(d,dest);
  1051. END;
  1052. END ApplyBinaryASAOp;
  1053. (** apply binary operator: array x array -> scalar *)
  1054. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1055. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1056. left, right: ADDRESS; dim: SIZE;
  1057. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1058. VAR len: SIZE; linc, rinc: SIZE;
  1059. BEGIN
  1060. IF dim = loopd THEN
  1061. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1062. IF conservative THEN INC( glen, looplen ) END;
  1063. ELSE
  1064. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1065. rinc := GetIncr( right, dim ); INC( dim );
  1066. WHILE (len > 0) DO
  1067. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1068. DEC( len );
  1069. END;
  1070. END;
  1071. END Traverse;
  1072. BEGIN
  1073. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1074. (* check array lengths *)
  1075. IF ~SameShape( left, right ) THEN
  1076. Halt( GeometryMismatch, left, right, 0 )
  1077. END;
  1078. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1079. (* check pattern: longest piece that can be done with a loop *)
  1080. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1081. (* run through dimensions *)
  1082. IF conservative THEN glen := 0 END;
  1083. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1084. IF conservative THEN
  1085. looplen := 1;
  1086. WHILE (dim > 0) DO
  1087. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1088. END;
  1089. ASSERT( looplen = glen );
  1090. END;
  1091. END ApplyBinaryAASOp;
  1092. (** special binary operator: array x array -> boolean *)
  1093. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1094. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1095. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1096. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1097. VAR len: SIZE; linc, rinc: SIZE;
  1098. BEGIN
  1099. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1100. ELSE
  1101. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1102. rinc := GetIncr( right, dim ); INC( dim );
  1103. WHILE (len > 0) DO
  1104. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1105. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1106. END;
  1107. RETURN TRUE;
  1108. END;
  1109. END Traverse;
  1110. BEGIN
  1111. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1112. (* check array lengths *)
  1113. IF ~SameShape( left, right ) THEN
  1114. RETURN geometryMismatchDefault
  1115. END;
  1116. (* is destination already allocated? (might be a temporary result) *)
  1117. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1118. (* check pattern: longest piece that can be done with a loop *)
  1119. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1120. (* run through dimensions *)
  1121. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1122. END ApplyBinaryAABOp;
  1123. (** special binary operator: array x scalar -> boolean *)
  1124. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1125. Loop: BinaryASBLoop ): BOOLEAN;
  1126. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1127. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1128. VAR len: SIZE; linc: SIZE;
  1129. BEGIN
  1130. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1131. ELSE
  1132. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1133. WHILE (len > 0) DO
  1134. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1135. INC( ladr, linc ); DEC( len );
  1136. END;
  1137. RETURN TRUE;
  1138. END;
  1139. END Traverse;
  1140. BEGIN
  1141. SYSTEM.GET( l, left ); dim := GetDim( left );
  1142. IF debug THEN Report( "AAB:left", left ); END;
  1143. (* check pattern: longest piece that can be done with a loop *)
  1144. FindPattern1( left, dim, loopd, looplen, loopli );
  1145. (* run through dimensions *)
  1146. RETURN Traverse( 0, GetAdr( left ) );
  1147. END ApplyBinaryASBOp;
  1148. (**** operators *)
  1149. (*** copy *)
  1150. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  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. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1161. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1162. DEC EBX ; DEC(EBX)
  1163. JMP start
  1164. end:
  1165. END Copy4;
  1166. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1167. CODE {SYSTEM.i386}
  1168. MOV ECX, [EBP+ladr] ; ECX := ladr
  1169. MOV EDX, [EBP+dadr] ; EDX := dadr
  1170. MOV EBX, [EBP+len] ; EBX := len
  1171. start:
  1172. CMP EBX, 0 ;
  1173. JLE end ; WHILE EBX > 0 DO
  1174. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1175. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1176. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1177. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1178. DEC EBX ; DEC(EBX)
  1179. JMP start
  1180. end:
  1181. END Copy2;
  1182. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1183. CODE {SYSTEM.i386}
  1184. MOV ECX, [EBP+ladr] ; ECX := ladr
  1185. MOV EDX, [EBP+dadr] ; EDX := dadr
  1186. MOV EBX, [EBP+len] ; EBX := len
  1187. start:
  1188. CMP EBX, 0 ;
  1189. JLE end ; WHILE EBX > 0 DO
  1190. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1191. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1192. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1193. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1194. DEC EBX ; DEC(EBX)
  1195. JMP start
  1196. end:
  1197. END Copy1;
  1198. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1199. CODE {SYSTEM.i386}
  1200. MOV ECX, [EBP+ladr] ; ECX := ladr
  1201. MOV EDX, [EBP+dadr] ; EDX := dadr
  1202. MOV EBX, [EBP+len] ; EBX := len
  1203. start:
  1204. CMP EBX, 0 ;
  1205. JLE end ; WHILE EBX > 0 DO
  1206. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1207. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1208. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1209. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1210. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1211. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1212. DEC EBX ; DEC(EBX)
  1213. JMP start
  1214. end:
  1215. END Copy8;
  1216. PROCEDURE -MoveB*( srcadr, destadr, len: SIZE );
  1217. (** Correct move if overlap, might be important for some array operations,
  1218. do not use SYSTEM.MOVE. *)
  1219. CODE {SYSTEM.i386}
  1220. MOV ECX, [ESP] ; len
  1221. MOV EDI, [ESP+4] ; destadr
  1222. MOV ESI, [ESP+8] ; srcadr
  1223. CMP ESI, EDI
  1224. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1225. MOV EAX, ESI
  1226. ADD EAX, ECX
  1227. CMP EAX, EDI
  1228. JBE moveup ; no overlap, no problem, move up
  1229. MOV ESI, EAX
  1230. ADD EDI, ECX
  1231. DEC ESI
  1232. DEC EDI
  1233. STD ; move down since overlap occured
  1234. REP
  1235. MOVSB
  1236. JMP done
  1237. moveup:
  1238. CLD
  1239. MOV BL, CL
  1240. SHR ECX, 2
  1241. AND BL, 00000003H ; rest to move after 4 byte move
  1242. REP
  1243. MOVSD ; move 4 bytes each step
  1244. MOV CL, BL
  1245. REP
  1246. MOVSB ; move rest in one byte steps
  1247. done:
  1248. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1249. END MoveB;
  1250. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1251. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1252. origdest: ADDRESS; modes: SET; dim: SIZE;
  1253. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1254. BEGIN
  1255. IF (dinc = elementSize) & (linc = elementSize) THEN
  1256. MoveB( ladr, dadr, len * elementSize );
  1257. (*
  1258. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1259. *)
  1260. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1261. len := len * elementSize;
  1262. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1263. ELSIF elementSize = 1 THEN
  1264. Copy1( ladr, dadr, linc, dinc, len );
  1265. (*
  1266. WHILE (len > 0) DO
  1267. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1268. END;
  1269. *)
  1270. ELSIF elementSize = 2 THEN
  1271. Copy2( ladr, dadr, linc, dinc, len );
  1272. (*
  1273. WHILE (len > 0) DO
  1274. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1275. END;
  1276. *)
  1277. ELSIF elementSize = 4 THEN
  1278. Copy4( ladr, dadr, linc, dinc, len );
  1279. (*
  1280. WHILE (len > 0) DO
  1281. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1282. END;
  1283. *)
  1284. ELSIF elementSize = 8 THEN
  1285. Copy8( ladr, dadr, linc, dinc, len );
  1286. (*
  1287. WHILE (len > 0) DO
  1288. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1289. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1290. INC( dadr, dinc );
  1291. END;
  1292. *)
  1293. ELSE (* SYSTEM.MOVE is expensive ! *)
  1294. WHILE (len > 0) DO
  1295. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1296. INC( dadr, dinc );
  1297. END;
  1298. END;
  1299. END Loop;
  1300. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1301. VAR len: SIZE; linc, dinc: SIZE;
  1302. BEGIN
  1303. IF dim = loopd THEN
  1304. Loop( ladr, dadr, loopli, loopdi, looplen );
  1305. IF conservative THEN INC( glen, looplen ) END;
  1306. ELSE
  1307. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1308. dinc := GetIncr( dest, dim ); INC( dim );
  1309. WHILE (len > 0) DO
  1310. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1311. DEC( len );
  1312. END;
  1313. END;
  1314. END Traverse;
  1315. BEGIN
  1316. dim := GetDim( src );
  1317. origdest := 0; modes := {up, down}; (* copy modes *)
  1318. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1319. CopyUpCompatible( dest, src, modes );
  1320. IF up IN modes THEN (* nothing to be done *)
  1321. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1322. Reverse( src, dim ); Reverse( dest, dim )
  1323. ELSE (* can only copy via double buffer *)
  1324. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1325. END;
  1326. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1327. END;
  1328. (* check pattern: longest piece that can be done with a loop *)
  1329. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1330. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1331. IF up IN modes THEN (* nothing to be done *)
  1332. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1333. ELSE CopyContent( origdest, dest, elementSize );
  1334. END;
  1335. END CopyContent;
  1336. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  1337. VAR ptr, data: ANY; Size: SIZE;
  1338. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1339. PROCEDURE NewData;
  1340. VAR dim, len, size: SIZE;
  1341. BEGIN
  1342. dim := GetDim( src ); size := elementsize;
  1343. PutDim( dest, dim );
  1344. PutSize( dest, elementsize );
  1345. WHILE (dim > 0) DO
  1346. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1347. PutInc( dest, dim, size ); size := size * len;
  1348. END;
  1349. SYSTEM.NEW( data, size + ArrayAlignment);
  1350. PutAdr( dest, Align(data));
  1351. PutPtr( dest, data );
  1352. END NewData;
  1353. BEGIN
  1354. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1355. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1356. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1357. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1358. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1359. PutFlags(dest, {TensorFlag});
  1360. NewData(); RETURN ptr;
  1361. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1362. (* check if re-allocation of descriptor is allowed *)
  1363. IF ~(TensorFlag IN GetFlags( dest )) &
  1364. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1365. HALT( 100 );
  1366. END;
  1367. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1368. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1369. PutFlags(dest, {TensorFlag});
  1370. NewData();
  1371. RETURN ptr;
  1372. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1373. (* check if re-allocation of array data is allowed *)
  1374. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1375. HALT( 100 );
  1376. END;
  1377. NewData();
  1378. RETURN data;
  1379. ELSE (* nothing to do *)
  1380. RETURN NIL;
  1381. END;
  1382. END AllocateSame;
  1383. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1384. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1385. BEGIN
  1386. dim := GetDim(src);
  1387. p := GetArrayDesc(dim);
  1388. adr := p;
  1389. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1390. PutAdr( src, 0 );
  1391. PutPtr( src, NIL );
  1392. PutFlags( src, {} );
  1393. RETURN p;
  1394. END TempDescCopy;
  1395. (* used when arrays are passed by value *)
  1396. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: SIZE );
  1397. VAR p: ANY;
  1398. BEGIN
  1399. ASSERT( src = dest );
  1400. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1401. CopyArray( dest, p, elementsize );
  1402. END CopyArraySelf;
  1403. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1404. VAR p: ANY; srcdim, destdim: SIZE;
  1405. BEGIN
  1406. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1407. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1408. srcdim := GetDim(src);
  1409. destdim := GetDim(dest);
  1410. (*
  1411. Debugging.Stack("copy array");
  1412. *)
  1413. Report( "copy array source", src ); Report( "copy array des", dest );
  1414. HALT(100);
  1415. ELSIF src = dest THEN (* self copy *)
  1416. CopyArraySelf( dest, src, elementsize );
  1417. ELSE
  1418. p := AllocateSame( dest, src, elementsize );
  1419. CopyContent( dest, src, elementsize )
  1420. END;
  1421. END CopyArray;
  1422. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1423. BEGIN
  1424. dest := 0; CopyTensor( dest, src, elementsize );
  1425. END CopyTensorSelf;
  1426. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1427. elementsize: SIZE );
  1428. VAR p: ANY;
  1429. BEGIN
  1430. (* Report("dest",dest); Report("src",src); *)
  1431. IF (src = NIL) THEN dest := NIL
  1432. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1433. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1434. CopyContent( dest, src, elementsize );
  1435. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1436. ELSE CopyContent( dest, src, elementsize )
  1437. END;
  1438. END CopyTensor;
  1439. (* copy descriptor of src to that of dest. If not existent then create.*)
  1440. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS): ANY;
  1441. VAR ptr: ANY; flags: SET;
  1442. PROCEDURE CopyDescriptor;
  1443. BEGIN
  1444. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1445. PutPtr(dest, GetPtr(src)); (* GC! *)
  1446. END CopyDescriptor;
  1447. BEGIN
  1448. (*
  1449. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1450. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1451. *)
  1452. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1453. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1454. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1455. CopyDescriptor();
  1456. PutFlags(dest, {TensorFlag});
  1457. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1458. flags := GetFlags(dest);
  1459. (* check if re-allocation of descriptor is allowed *)
  1460. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1461. Halt(DimensionMismatch,src,0,dest);
  1462. END;
  1463. (* create a new descriptor!!! (added by Alexey) *)
  1464. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1465. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1466. CopyDescriptor();
  1467. PutFlags(dest, flags);
  1468. ELSE
  1469. flags := GetFlags(dest);
  1470. (* check if re-allocation of array data is allowed *)
  1471. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1472. Halt(AllocationForbidden,src,0,dest);
  1473. END;
  1474. CopyDescriptor();
  1475. PutFlags(dest, flags);
  1476. END;
  1477. RETURN ptr;
  1478. END ShallowCopy;
  1479. (*
  1480. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1481. BEGIN
  1482. IF debug THEN
  1483. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1484. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1485. END;
  1486. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1487. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1488. END DescriptorCopy;
  1489. *)
  1490. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1491. VAR p: ANY; s,d: ADDRESS;
  1492. BEGIN
  1493. s := SYSTEM.VAL(ADDRESS,src);
  1494. d := SYSTEM.VAL(ADDRESS,dest);
  1495. p := ShallowCopy(d,s);
  1496. SYSTEM.PUT(ADDRESSOF(dest),d);
  1497. IF p = d THEN
  1498. Heaps.CheckAssignment(ADDRESS OF dest, p);
  1499. END;
  1500. END ZeroCopy;
  1501. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1502. BEGIN
  1503. ZeroCopy(src, RESULT);
  1504. RETURN RESULT
  1505. END "ALIAS";
  1506. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1507. VAR dim: SIZE;
  1508. BEGIN
  1509. dim := GetDim( l );
  1510. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1511. WHILE (dim > 0) DO
  1512. DEC( dim );
  1513. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1514. END;
  1515. RETURN TRUE;
  1516. END SameShape;
  1517. (*
  1518. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1519. (*
  1520. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1521. check if deep copy can be avoided and if so then do a shallow copy
  1522. *)
  1523. BEGIN
  1524. ASSERT( dest # 0 ); (* impossible *)
  1525. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1526. HALT( 100 );
  1527. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1528. (* must copy (and allocate) *)
  1529. CopyArray( dest, src, elementsize );
  1530. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1531. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1532. ELSE CopyContent( dest, src, elementsize )
  1533. END;
  1534. ELSE DescriptorCopy( src, dest )
  1535. END;
  1536. END ZeroCopyArray;
  1537. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1538. (*
  1539. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1540. check if deep copy can be avoided and if so then do a shallow copy
  1541. *)
  1542. BEGIN
  1543. IF debug THEN
  1544. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1545. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1546. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1547. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1548. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1549. END;
  1550. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1551. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1552. ELSE
  1553. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1554. END;
  1555. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1556. (* must copy (and allocate) *)
  1557. CopyTensor( dest, src, elementsize );
  1558. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1559. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1560. ELSE
  1561. HALT( 100 ); (* copy forbidden *)
  1562. END;
  1563. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1564. DescriptorCopy( src, dest );
  1565. ELSE
  1566. HALT( 100 ); (* different shapes: not allowed *)
  1567. END;
  1568. END ZeroCopyTensor;
  1569. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1570. VAR i: LONGINT;
  1571. BEGIN
  1572. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1573. CopyContent( dest, left, elementSize )
  1574. ELSE
  1575. IF debug THEN
  1576. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1577. KernelLog.Ln;
  1578. END;
  1579. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1580. FOR i := 0 TO dim - 1 DO
  1581. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1582. END;
  1583. END;
  1584. END ZeroCopy;
  1585. *)
  1586. (*** conversions ****)
  1587. (** SHORTINT -> INTEGER *)
  1588. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1589. BEGIN
  1590. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1591. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1592. DEC( len );
  1593. END;
  1594. END ConvertASAILoop;
  1595. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1596. BEGIN
  1597. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1598. RETURN RESULT
  1599. END "@Convert";
  1600. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1601. BEGIN
  1602. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1603. RETURN RESULT
  1604. END "LONG";
  1605. (** SHORTINT -> LONGINT *)
  1606. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1607. BEGIN
  1608. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1609. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1610. DEC( len );
  1611. END;
  1612. END ConvertLoopSL;
  1613. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1614. BEGIN
  1615. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1616. RETURN RESULT
  1617. END "@Convert";
  1618. (** SHORTINT -> REAL *)
  1619. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1620. VAR lval: SHORTINT; dval: REAL;
  1621. BEGIN
  1622. WHILE (len > 0) DO
  1623. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1624. INC( dadr, dinc ); DEC( len );
  1625. END;
  1626. END ConvertLoopSR;
  1627. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1628. BEGIN
  1629. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1630. RETURN RESULT
  1631. END "@Convert";
  1632. (** SHORTINT -> LONGREAL *)
  1633. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1634. VAR lval: SHORTINT; dval: LONGREAL;
  1635. BEGIN
  1636. WHILE (len > 0) DO
  1637. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1638. INC( dadr, dinc ); DEC( len );
  1639. END;
  1640. END ConvertLoopSX;
  1641. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1642. BEGIN
  1643. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1644. RETURN RESULT
  1645. END "@Convert";
  1646. (** INTEGER -> SHORTINT (SHORT) *)
  1647. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1648. VAR lval: INTEGER; dval: SHORTINT;
  1649. BEGIN
  1650. WHILE (len > 0) DO
  1651. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1652. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1653. END;
  1654. END ConvertLoopIS;
  1655. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1656. BEGIN
  1657. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1658. RETURN RESULT
  1659. END "@Convert";
  1660. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1661. BEGIN
  1662. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1663. RETURN RESULT
  1664. END "SHORT";
  1665. (** INTEGER -> LONGINT *)
  1666. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1667. BEGIN
  1668. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1669. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1670. DEC( len );
  1671. END;
  1672. END ConvertLoopIL;
  1673. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1674. BEGIN
  1675. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1676. RETURN RESULT
  1677. END "@Convert";
  1678. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1679. BEGIN
  1680. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1681. RETURN RESULT
  1682. END "LONG";
  1683. (** INTEGER -> REAL *)
  1684. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1685. VAR lval: INTEGER; dval: REAL;
  1686. BEGIN
  1687. WHILE (len > 0) DO
  1688. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1689. INC( dadr, dinc ); DEC( len );
  1690. END;
  1691. END ConvertLoopIR;
  1692. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1693. BEGIN
  1694. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1695. RETURN RESULT
  1696. END "@Convert";
  1697. (** INTEGER -> LONGREAL *)
  1698. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1699. VAR lval: INTEGER; dval: LONGREAL;
  1700. BEGIN
  1701. WHILE (len > 0) DO
  1702. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1703. INC( dadr, dinc ); DEC( len );
  1704. END;
  1705. END ConvertLoopIX;
  1706. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1707. BEGIN
  1708. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1709. RETURN RESULT
  1710. END "@Convert";
  1711. (** LONGINT -> INTEGER (SHORT) *)
  1712. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1713. VAR lval: LONGINT; dval: INTEGER;
  1714. BEGIN
  1715. WHILE (len > 0) DO
  1716. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1717. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1718. END;
  1719. END ConvertLoopLI;
  1720. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1721. BEGIN
  1722. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1723. RETURN RESULT
  1724. END "@Convert";
  1725. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1726. BEGIN
  1727. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1728. RETURN RESULT
  1729. END "SHORT";
  1730. (** LONGINT -> REAL *)
  1731. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1732. VAR lval: LONGINT; dval: REAL;
  1733. BEGIN
  1734. WHILE (len > 0) DO
  1735. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1736. INC( dadr, dinc ); DEC( len );
  1737. END;
  1738. END ConvertLoopLR;
  1739. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1740. BEGIN
  1741. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1742. RETURN RESULT
  1743. END "@Convert";
  1744. (** LONGINT -> LONGREAL *)
  1745. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1746. VAR lval: LONGINT; dval: LONGREAL;
  1747. BEGIN
  1748. WHILE (len > 0) DO
  1749. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1750. INC( dadr, dinc ); DEC( len );
  1751. END;
  1752. END ConvertLoopLX;
  1753. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1754. BEGIN
  1755. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1756. RETURN RESULT
  1757. END "@Convert";
  1758. (** REAL -> LONGINT (ENTIER) *)
  1759. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1760. VAR lval: REAL; dval: LONGINT;
  1761. BEGIN
  1762. WHILE (len > 0) DO
  1763. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1764. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1765. END;
  1766. END ConvertLoopRL;
  1767. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1768. BEGIN
  1769. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1770. RETURN RESULT
  1771. END "@Convert";
  1772. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1773. BEGIN
  1774. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1775. RETURN RESULT
  1776. END "ENTIER";
  1777. (** REAL -> LONGREAL *)
  1778. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1779. VAR lval: REAL; dval: LONGREAL;
  1780. BEGIN
  1781. WHILE (len > 0) DO
  1782. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1783. INC( dadr, dinc ); DEC( len );
  1784. END;
  1785. END ConvertLoopRX;
  1786. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1787. BEGIN
  1788. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1789. RETURN RESULT
  1790. END "@Convert";
  1791. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1792. BEGIN
  1793. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1794. RETURN RESULT
  1795. END "LONG";
  1796. (** LONGREAL -> REAL (SHORT) *)
  1797. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1798. VAR lval: LONGREAL; dval: REAL;
  1799. BEGIN
  1800. WHILE (len > 0) DO
  1801. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1802. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1803. END;
  1804. END ConvertLoopXR;
  1805. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1806. BEGIN
  1807. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1808. RETURN RESULT
  1809. END "@Convert";
  1810. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1811. BEGIN
  1812. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1813. RETURN RESULT
  1814. END "SHORT";
  1815. (** LONGREAL -> LONGINT (ENTIER) *)
  1816. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1817. VAR lval: LONGREAL; dval: LONGINT;
  1818. BEGIN
  1819. WHILE (len > 0) DO
  1820. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1821. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1822. END;
  1823. END ConvertLoopXL;
  1824. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1825. BEGIN
  1826. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1827. RETURN RESULT
  1828. END "@Convert";
  1829. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1830. BEGIN
  1831. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1832. RETURN RESULT
  1833. END "ENTIER";
  1834. (*** monadic not A -> ~A ********************************************************************)
  1835. (** BOOLEAN *)
  1836. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1837. VAR lval: BOOLEAN;
  1838. BEGIN
  1839. WHILE (len > 0) DO
  1840. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1841. DEC( len );
  1842. END;
  1843. END NotLoopAB;
  1844. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1845. BEGIN
  1846. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1847. RETURN RESULT
  1848. END "~";
  1849. (*** monadic generic (A) -> -A ********************************************************************)
  1850. (** SHORTINT *)
  1851. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1852. VAR lval: SHORTINT;
  1853. BEGIN
  1854. WHILE (len > 0) DO
  1855. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1856. DEC( len );
  1857. END;
  1858. END GenericLoopS;
  1859. (** INTEGER *)
  1860. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1861. VAR lval: INTEGER;
  1862. BEGIN
  1863. WHILE (len > 0) DO
  1864. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1865. DEC( len );
  1866. END;
  1867. END GenericLoopI;
  1868. (** LONGINT *)
  1869. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1870. VAR lval: LONGINT;
  1871. BEGIN
  1872. WHILE (len > 0) DO
  1873. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1874. DEC( len );
  1875. END;
  1876. END GenericLoopL;
  1877. (** HUGEINT *)
  1878. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1879. VAR lval: HUGEINT;
  1880. BEGIN
  1881. WHILE (len > 0) DO
  1882. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1883. DEC( len );
  1884. END;
  1885. END GenericLoopH;
  1886. (** REAL *)
  1887. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1888. VAR lval: REAL;
  1889. BEGIN
  1890. WHILE (len > 0) DO
  1891. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1892. DEC( len );
  1893. END;
  1894. END GenericLoopR;
  1895. (** LONGREAL *)
  1896. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1897. VAR lval: LONGREAL;
  1898. BEGIN
  1899. WHILE (len > 0) DO
  1900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1901. DEC( len );
  1902. END;
  1903. END GenericLoopX;
  1904. (** COMPLEX *)
  1905. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1906. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1907. BEGIN
  1908. WHILE (len > 0) DO
  1909. lval := ladr;
  1910. dval := dadr;
  1911. dval.val := op(lval.val);
  1912. INC( ladr, linc ); INC( dadr, dinc );
  1913. DEC( len );
  1914. END;
  1915. END GenericLoopZ;
  1916. (** LONGCOMPLEX *)
  1917. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1918. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1919. BEGIN
  1920. WHILE (len > 0) DO
  1921. lval := ladr;
  1922. dval := dadr;
  1923. dval.val := op (lval.val);
  1924. INC( ladr, linc ); INC( dadr, dinc );
  1925. DEC( len );
  1926. END;
  1927. END GenericLoopLZ;
  1928. (*** monadic minus A -> -A ********************************************************************)
  1929. (** SHORTINT *)
  1930. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1931. VAR lval: SHORTINT;
  1932. BEGIN
  1933. WHILE (len > 0) DO
  1934. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1935. DEC( len );
  1936. END;
  1937. END MinusLoopS;
  1938. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1939. BEGIN
  1940. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1941. RETURN RESULT
  1942. END "-";
  1943. (** INTEGER *)
  1944. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1945. VAR lval: INTEGER;
  1946. BEGIN
  1947. WHILE (len > 0) DO
  1948. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1949. DEC( len );
  1950. END;
  1951. END MinusLoopI;
  1952. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1953. BEGIN
  1954. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1955. RETURN RESULT
  1956. END "-";
  1957. (** LONGINT *)
  1958. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1959. VAR lval: LONGINT;
  1960. BEGIN
  1961. WHILE (len > 0) DO
  1962. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1963. DEC( len );
  1964. END;
  1965. END MinusLoopL;
  1966. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1967. BEGIN
  1968. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1969. RETURN RESULT
  1970. END "-";
  1971. (** REAL *)
  1972. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1973. VAR lval: REAL;
  1974. BEGIN
  1975. WHILE (len > 0) DO
  1976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1977. DEC( len );
  1978. END;
  1979. END MinusLoopR;
  1980. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1981. BEGIN
  1982. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1983. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1984. RETURN RESULT
  1985. END "-";
  1986. (** LONGREAL *)
  1987. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1988. VAR lval: LONGREAL;
  1989. BEGIN
  1990. WHILE (len > 0) DO
  1991. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1992. DEC( len );
  1993. END;
  1994. END MinusLoopX;
  1995. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1996. BEGIN
  1997. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1998. MinusLoopX );
  1999. RETURN RESULT
  2000. END "-";
  2001. (*** add array + array -> array ********************************************************************)
  2002. (** SHORTINT *)
  2003. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2004. VAR lval, rval: SHORTINT;
  2005. BEGIN
  2006. WHILE (len > 0) DO
  2007. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2008. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2009. END;
  2010. END AddASASLoop;
  2011. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2012. BEGIN
  2013. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2014. SIZEOF( SHORTINT ), AddASASLoop );
  2015. RETURN RESULT
  2016. END "+";
  2017. (** INTEGER *)
  2018. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2019. VAR lval, rval: INTEGER;
  2020. BEGIN
  2021. WHILE (len > 0) DO
  2022. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2023. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2024. END;
  2025. END AddAIAILoop;
  2026. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2027. BEGIN
  2028. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2029. SIZEOF( INTEGER ), AddAIAILoop );
  2030. RETURN RESULT
  2031. END "+";
  2032. (** LONGINT *)
  2033. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2034. VAR lval, rval: LONGINT;
  2035. BEGIN
  2036. WHILE (len > 0) DO
  2037. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2038. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2039. END;
  2040. END AddALALLoop;
  2041. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2042. BEGIN
  2043. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2044. SIZEOF( LONGINT ), AddALALLoop );
  2045. RETURN RESULT
  2046. END "+";
  2047. (** REAL *)
  2048. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2049. VAR lval, rval: REAL;
  2050. BEGIN
  2051. WHILE (len > 0) DO
  2052. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2053. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2054. END;
  2055. END AddARARLoop;
  2056. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2057. BEGIN
  2058. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2059. loopAddARAR );
  2060. RETURN RESULT
  2061. END "+";
  2062. (** LONGREAL *)
  2063. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2064. VAR lval, rval: LONGREAL;
  2065. BEGIN
  2066. WHILE (len > 0) DO
  2067. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2068. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2069. END;
  2070. END AddAXAXLoop;
  2071. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2072. BEGIN
  2073. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2074. SIZEOF( LONGREAL ), loopAddAXAX );
  2075. RETURN RESULT
  2076. END "+";
  2077. (** COMPLEX *)
  2078. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2079. VAR lval, rval: COMPLEX;
  2080. BEGIN
  2081. WHILE (len > 0) DO
  2082. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2083. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2084. END;
  2085. END AddAZAZLoop;
  2086. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2087. BEGIN
  2088. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2089. SIZEOF( COMPLEX ), loopAddAZAZ );
  2090. RETURN RESULT
  2091. END "+";
  2092. (** LONGCOMPLEX *)
  2093. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2094. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2095. BEGIN
  2096. WHILE (len > 0) DO
  2097. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2098. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2099. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2100. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2101. DEC( len );
  2102. END;
  2103. END AddALZALZLoop;
  2104. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2105. BEGIN
  2106. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2107. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2108. RETURN RESULT
  2109. END "+";
  2110. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2111. (** SHORTINT *)
  2112. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2113. VAR lval, rval: SHORTINT;
  2114. BEGIN
  2115. SYSTEM.GET( radr, rval );
  2116. WHILE (len > 0) DO
  2117. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2118. INC( dadr, dinc ); DEC( len );
  2119. END;
  2120. END AddASSSLoop;
  2121. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2122. BEGIN
  2123. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2124. SIZEOF( SHORTINT ), AddASSSLoop );
  2125. RETURN RESULT
  2126. END "+";
  2127. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2128. BEGIN
  2129. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2130. SIZEOF( SHORTINT ), AddASSSLoop );
  2131. RETURN RESULT
  2132. END "+";
  2133. (** INTEGER *)
  2134. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2135. VAR lval, rval: INTEGER;
  2136. BEGIN
  2137. SYSTEM.GET( radr, rval );
  2138. WHILE (len > 0) DO
  2139. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2140. INC( dadr, dinc ); DEC( len );
  2141. END;
  2142. END AddAISILoop;
  2143. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2144. BEGIN
  2145. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2146. SIZEOF( INTEGER ), AddAISILoop );
  2147. RETURN RESULT
  2148. END "+";
  2149. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2150. BEGIN
  2151. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2152. SIZEOF( INTEGER ), AddAISILoop );
  2153. RETURN RESULT
  2154. END "+";
  2155. (** LONGINT *)
  2156. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2157. VAR lval, rval: LONGINT;
  2158. BEGIN
  2159. SYSTEM.GET( radr, rval );
  2160. WHILE (len > 0) DO
  2161. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2162. INC( dadr, dinc ); DEC( len );
  2163. END;
  2164. END AddALSLLoop;
  2165. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2166. BEGIN
  2167. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2168. SIZEOF( LONGINT ), AddALSLLoop );
  2169. RETURN RESULT
  2170. END "+";
  2171. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2172. BEGIN
  2173. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2174. SIZEOF( LONGINT ), AddALSLLoop );
  2175. RETURN RESULT
  2176. END "+";
  2177. (** REAL *)
  2178. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2179. VAR lval, rval: REAL;
  2180. BEGIN
  2181. SYSTEM.GET( radr, rval );
  2182. WHILE (len > 0) DO
  2183. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2184. INC( dadr, dinc ); DEC( len );
  2185. END;
  2186. END AddARSRLoop;
  2187. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2188. BEGIN
  2189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2190. AddARSRLoop );
  2191. RETURN RESULT
  2192. END "+";
  2193. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2194. BEGIN
  2195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2196. AddARSRLoop );
  2197. RETURN RESULT
  2198. END "+";
  2199. (** LONGREAL *)
  2200. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2201. VAR lval, rval: LONGREAL;
  2202. BEGIN
  2203. SYSTEM.GET( radr, rval );
  2204. WHILE (len > 0) DO
  2205. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2206. INC( dadr, dinc ); DEC( len );
  2207. END;
  2208. END AddAXSXLoop;
  2209. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2210. BEGIN
  2211. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2212. SIZEOF( LONGREAL ), AddAXSXLoop );
  2213. RETURN RESULT
  2214. END "+";
  2215. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2216. BEGIN
  2217. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2218. SIZEOF( LONGREAL ), AddAXSXLoop );
  2219. RETURN RESULT
  2220. END "+";
  2221. (** COMPLEX *)
  2222. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2223. VAR lval, rval: COMPLEX;
  2224. BEGIN
  2225. SYSTEM.GET( radr, rval );
  2226. WHILE (len > 0) DO
  2227. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2228. INC( dadr, dinc ); DEC( len );
  2229. END;
  2230. END AddAZSZLoop;
  2231. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2232. BEGIN
  2233. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2234. AddAZSZLoop );
  2235. RETURN RESULT
  2236. END "+";
  2237. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2238. BEGIN
  2239. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2240. AddAZSZLoop );
  2241. RETURN RESULT
  2242. END "+";
  2243. (** LONGCOMPLEX *)
  2244. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2245. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2246. BEGIN
  2247. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2248. WHILE (len > 0) DO
  2249. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2250. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2251. INC( ladr, linc );
  2252. INC( dadr, dinc ); DEC( len );
  2253. END;
  2254. END AddALZSLZLoop;
  2255. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2256. BEGIN
  2257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2258. AddALZSLZLoop );
  2259. RETURN RESULT
  2260. END "+";
  2261. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2262. BEGIN
  2263. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2264. AddALZSLZLoop );
  2265. RETURN RESULT
  2266. END "+";
  2267. (*** subtraction array - array -> array ********************************************************************)
  2268. (** SHORTINT *)
  2269. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2270. VAR lval, rval: SHORTINT;
  2271. BEGIN
  2272. WHILE (len > 0) DO
  2273. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2274. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2275. END;
  2276. END SubASASLoop;
  2277. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2278. BEGIN
  2279. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2280. SIZEOF( SHORTINT ), SubASASLoop );
  2281. RETURN RESULT
  2282. END "-";
  2283. (** INTEGER *)
  2284. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2285. VAR lval, rval: INTEGER;
  2286. BEGIN
  2287. WHILE (len > 0) DO
  2288. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2289. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2290. END;
  2291. END SubAIAILoop;
  2292. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2293. BEGIN
  2294. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2295. SIZEOF( INTEGER ), SubAIAILoop );
  2296. RETURN RESULT
  2297. END "-";
  2298. (** LONGINT *)
  2299. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2300. VAR lval, rval: LONGINT;
  2301. BEGIN
  2302. WHILE (len > 0) DO
  2303. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2304. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2305. END;
  2306. END SubALALLoop;
  2307. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2308. BEGIN
  2309. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2310. SIZEOF( LONGINT ), SubALALLoop );
  2311. RETURN RESULT
  2312. END "-";
  2313. (** REAL *)
  2314. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2315. VAR lval, rval: REAL;
  2316. BEGIN
  2317. WHILE (len > 0) DO
  2318. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2319. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2320. END;
  2321. END SubARARLoop;
  2322. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2323. BEGIN
  2324. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2325. SubARARLoop );
  2326. RETURN RESULT
  2327. END "-";
  2328. (** LONGREAL *)
  2329. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2330. VAR lval, rval: LONGREAL;
  2331. BEGIN
  2332. WHILE (len > 0) DO
  2333. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2334. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2335. END;
  2336. END SubAXAXLoop;
  2337. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2338. BEGIN
  2339. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2340. SIZEOF( LONGREAL ), SubAXAXLoop );
  2341. RETURN RESULT
  2342. END "-";
  2343. (** COMPLEX *)
  2344. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2345. VAR lval, rval: COMPLEX;
  2346. BEGIN
  2347. WHILE (len > 0) DO
  2348. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2349. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2350. END;
  2351. END SubAZAZLoop;
  2352. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2353. BEGIN
  2354. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2355. SIZEOF( COMPLEX ), SubAZAZLoop );
  2356. RETURN RESULT
  2357. END "-";
  2358. (** LONGCOMPLEX *)
  2359. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2360. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2361. BEGIN
  2362. WHILE (len > 0) DO
  2363. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2364. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2365. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2366. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2367. DEC( len );
  2368. END;
  2369. END SubALZALZLoop;
  2370. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2371. BEGIN
  2372. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2373. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2374. RETURN RESULT
  2375. END "-";
  2376. (*** subtraction array-scalar -> array ********************************************************************)
  2377. (** SHORTINT *)
  2378. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2379. BEGIN
  2380. RESULT := left + (-right);
  2381. RETURN RESULT
  2382. END "-";
  2383. (** INTEGER *)
  2384. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2385. BEGIN
  2386. RESULT := left + (-right);
  2387. RETURN RESULT
  2388. END "-";
  2389. (** LONGINT *)
  2390. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2391. BEGIN
  2392. RESULT := left + (-right);
  2393. RETURN RESULT
  2394. END "-";
  2395. (** REAL *)
  2396. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2397. BEGIN
  2398. RESULT := left + (-right);
  2399. RETURN RESULT
  2400. END "-";
  2401. (** LONGREAL *)
  2402. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2403. BEGIN
  2404. RESULT := left + (-right);
  2405. RETURN RESULT
  2406. END "-";
  2407. (** COMPLEX *)
  2408. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2409. BEGIN
  2410. RESULT := left + (-right);
  2411. RETURN RESULT
  2412. END "-";
  2413. (** LONGCOMPLEX *)
  2414. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2415. BEGIN
  2416. RESULT := left + (-right);
  2417. RETURN RESULT
  2418. END "-";
  2419. (*** subtraction scalar-array -> array ********************************************************************)
  2420. (** SHORTINT *)
  2421. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2422. VAR lval, rval, dval: SHORTINT;
  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 SubSSASLoop;
  2430. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2431. BEGIN
  2432. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2433. SIZEOF( SHORTINT ), SubSSASLoop );
  2434. RETURN RESULT
  2435. END "-";
  2436. (** INTEGER *)
  2437. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2438. VAR lval, rval, dval: INTEGER;
  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 SubSIAILoop;
  2446. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2447. BEGIN
  2448. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2449. SIZEOF( INTEGER ), SubSIAILoop );
  2450. RETURN RESULT
  2451. END "-";
  2452. (** LONGINT *)
  2453. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2454. VAR lval, rval, dval: LONGINT;
  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 SubSLALLoop;
  2462. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2463. BEGIN
  2464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2465. SIZEOF( LONGINT ), SubSLALLoop );
  2466. RETURN RESULT
  2467. END "-";
  2468. (** REAL *)
  2469. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2470. VAR lval, rval, dval: REAL;
  2471. BEGIN
  2472. SYSTEM.GET( radr, rval );
  2473. WHILE (len > 0) DO
  2474. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2475. INC( dadr, dinc ); DEC( len );
  2476. END;
  2477. END SubSRARLoop;
  2478. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2479. BEGIN
  2480. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2481. SubSRARLoop );
  2482. RETURN RESULT
  2483. END "-";
  2484. (** LONGREAL *)
  2485. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2486. VAR lval, rval, dval: LONGREAL;
  2487. BEGIN
  2488. SYSTEM.GET( radr, rval );
  2489. WHILE (len > 0) DO
  2490. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2491. INC( dadr, dinc ); DEC( len );
  2492. END;
  2493. END SubSXAXLoop;
  2494. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2495. BEGIN
  2496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2497. SIZEOF( LONGREAL ), SubSXAXLoop );
  2498. RETURN RESULT
  2499. END "-";
  2500. (** COMPLEX *)
  2501. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2502. VAR lval, rval, dval: COMPLEX;
  2503. BEGIN
  2504. SYSTEM.GET( radr, rval );
  2505. WHILE (len > 0) DO
  2506. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2507. INC( dadr, dinc ); DEC( len );
  2508. END;
  2509. END SubSZAZLoop;
  2510. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2511. BEGIN
  2512. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2513. SIZEOF( COMPLEX ), SubSZAZLoop );
  2514. RETURN RESULT
  2515. END "-";
  2516. (** LONGCOMPLEX *)
  2517. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2518. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2519. BEGIN
  2520. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2521. WHILE (len > 0) DO
  2522. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2523. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2524. INC( ladr, linc );
  2525. INC( dadr, dinc ); DEC( len );
  2526. END;
  2527. END SubSLZALZLoop;
  2528. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2529. BEGIN
  2530. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2531. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2532. RETURN RESULT
  2533. END "-";
  2534. (*** element-wise multiply array x array -> array ********************************************************************)
  2535. (** SHORTINT *)
  2536. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2537. VAR lval, rval: SHORTINT;
  2538. BEGIN
  2539. WHILE (len > 0) DO
  2540. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2541. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2542. END;
  2543. END EMulASASLoop;
  2544. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2545. BEGIN
  2546. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2547. SIZEOF( SHORTINT ), EMulASASLoop );
  2548. RETURN RESULT
  2549. END ".*";
  2550. (** INTEGER *)
  2551. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2552. VAR lval, rval: INTEGER; dval: INTEGER;
  2553. BEGIN
  2554. WHILE (len > 0) DO
  2555. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2556. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2557. DEC( len );
  2558. END;
  2559. END EMulAIAILoop;
  2560. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2561. BEGIN
  2562. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2563. SIZEOF( INTEGER ), EMulAIAILoop );
  2564. RETURN RESULT
  2565. END ".*";
  2566. (** LONGINT *)
  2567. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2568. VAR lval, rval: LONGINT;
  2569. BEGIN
  2570. WHILE (len > 0) DO
  2571. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2572. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2573. END;
  2574. END EMulALALLoop;
  2575. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2576. BEGIN
  2577. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2578. SIZEOF( LONGINT ), EMulALALLoop );
  2579. RETURN RESULT
  2580. END ".*";
  2581. (** REAL *)
  2582. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2583. VAR lval, rval: REAL;
  2584. BEGIN
  2585. WHILE (len > 0) DO
  2586. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2587. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2588. END;
  2589. END EMulARARLoop;
  2590. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2591. BEGIN
  2592. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2593. EMulARARLoop );
  2594. RETURN RESULT
  2595. END ".*";
  2596. (** LONGREAL *)
  2597. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2598. VAR lval, rval: LONGREAL;
  2599. BEGIN
  2600. WHILE (len > 0) DO
  2601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2602. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2603. END;
  2604. END EMulAXAXLoop;
  2605. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2606. BEGIN
  2607. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2608. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2609. RETURN RESULT
  2610. END ".*";
  2611. (** COMPLEX *)
  2612. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2613. VAR lval, rval: COMPLEX;
  2614. BEGIN
  2615. WHILE (len > 0) DO
  2616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2617. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2618. END;
  2619. END EMulAZAZLoop;
  2620. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2621. BEGIN
  2622. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2623. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2624. RETURN RESULT
  2625. END ".*";
  2626. (** LONGCOMPLEX *)
  2627. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2628. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2629. BEGIN
  2630. WHILE (len > 0) DO
  2631. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2632. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2633. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2634. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2635. DEC( len );
  2636. END;
  2637. END EMulALZALZLoop;
  2638. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2639. BEGIN
  2640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2641. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2642. RETURN RESULT
  2643. END ".*";
  2644. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2645. (** SHORTINT *)
  2646. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2647. VAR lval, rval,dval: SHORTINT;
  2648. BEGIN
  2649. WHILE (len > 0) DO
  2650. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2651. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2652. END;
  2653. END EMulIncASASLoop;
  2654. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2655. BEGIN
  2656. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2657. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2658. END ".*+";
  2659. (** INTEGER *)
  2660. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2661. VAR lval, rval,dval: INTEGER;
  2662. BEGIN
  2663. WHILE (len > 0) DO
  2664. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2665. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2666. DEC( len );
  2667. END;
  2668. END EMulIncAIAILoop;
  2669. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2670. BEGIN
  2671. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2672. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2673. END ".*+";
  2674. (** LONGINT *)
  2675. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2676. VAR lval, rval,dval: LONGINT;
  2677. BEGIN
  2678. WHILE (len > 0) DO
  2679. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2680. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2681. END;
  2682. END EMulIncALALLoop;
  2683. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2684. BEGIN
  2685. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2686. SIZEOF( LONGINT ), EMulIncALALLoop );
  2687. END ".*+";
  2688. (** REAL *)
  2689. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2690. VAR lval, rval,dval: REAL;
  2691. BEGIN
  2692. WHILE (len > 0) DO
  2693. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2694. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2695. END;
  2696. END EMulIncARARLoop;
  2697. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2698. BEGIN
  2699. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2700. EMulIncARARLoop );
  2701. END ".*+";
  2702. (** LONGREAL *)
  2703. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2704. VAR lval, rval,dval: LONGREAL;
  2705. BEGIN
  2706. WHILE (len > 0) DO
  2707. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2708. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2709. END;
  2710. END EMulIncAXAXLoop;
  2711. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2712. BEGIN
  2713. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2714. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2715. END ".*+";
  2716. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2717. (** SHORTINT *)
  2718. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2719. VAR lval, rval: SHORTINT;
  2720. BEGIN
  2721. SYSTEM.GET( radr, rval );
  2722. WHILE (len > 0) DO
  2723. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2724. INC( dadr, dinc ); DEC( len );
  2725. END;
  2726. END MulASSSLoop;
  2727. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2728. BEGIN
  2729. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2730. SIZEOF( SHORTINT ), MulASSSLoop );
  2731. RETURN RESULT
  2732. END "*";
  2733. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2734. BEGIN
  2735. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2736. SIZEOF( SHORTINT ), MulASSSLoop );
  2737. RETURN RESULT
  2738. END "*";
  2739. (** INTEGER *)
  2740. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2741. VAR lval, rval: INTEGER;
  2742. BEGIN
  2743. SYSTEM.GET( radr, rval );
  2744. WHILE (len > 0) DO
  2745. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2746. INC( dadr, dinc ); DEC( len );
  2747. END;
  2748. END MulAISILoop;
  2749. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2750. BEGIN
  2751. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2752. SIZEOF( INTEGER ), MulAISILoop );
  2753. RETURN RESULT
  2754. END "*";
  2755. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2756. BEGIN
  2757. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2758. SIZEOF( INTEGER ), MulAISILoop );
  2759. RETURN RESULT
  2760. END "*";
  2761. (** LONGINT *)
  2762. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2763. VAR lval, rval: LONGINT;
  2764. BEGIN
  2765. SYSTEM.GET( radr, rval );
  2766. WHILE (len > 0) DO
  2767. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2768. INC( dadr, dinc ); DEC( len );
  2769. END;
  2770. END MulALSLLoop;
  2771. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2772. BEGIN
  2773. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2774. SIZEOF( LONGINT ), MulALSLLoop );
  2775. RETURN RESULT
  2776. END "*";
  2777. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2778. BEGIN
  2779. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2780. SIZEOF( LONGINT ), MulALSLLoop );
  2781. RETURN RESULT
  2782. END "*";
  2783. (** REAL *)
  2784. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2785. VAR lval, rval: REAL;
  2786. BEGIN
  2787. SYSTEM.GET( radr, rval );
  2788. WHILE (len > 0) DO
  2789. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2790. INC( dadr, dinc ); DEC( len );
  2791. END;
  2792. END MulARSRLoop;
  2793. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2794. BEGIN
  2795. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2796. loopMulARSR );
  2797. RETURN RESULT
  2798. END "*";
  2799. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2800. BEGIN
  2801. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2802. loopMulARSR );
  2803. RETURN RESULT
  2804. END "*";
  2805. (** LONGREAL *)
  2806. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2807. VAR lval, rval: LONGREAL;
  2808. BEGIN
  2809. IF debug THEN
  2810. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2811. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2812. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2813. END;
  2814. SYSTEM.GET( radr, rval );
  2815. WHILE (len > 0) DO
  2816. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2817. INC( dadr, dinc ); DEC( len );
  2818. END;
  2819. END MulAXSXLoop;
  2820. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2821. BEGIN
  2822. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2823. SIZEOF( LONGREAL ), loopMulAXSX );
  2824. RETURN RESULT
  2825. END "*";
  2826. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2827. BEGIN
  2828. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2829. SIZEOF( LONGREAL ), loopMulAXSX );
  2830. RETURN RESULT
  2831. END "*";
  2832. (** COMPLEX *)
  2833. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2834. VAR lval, rval: COMPLEX;
  2835. BEGIN
  2836. SYSTEM.GET( radr, rval );
  2837. WHILE (len > 0) DO
  2838. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2839. INC( dadr, dinc ); DEC( len );
  2840. END;
  2841. END MulAZSZLoop;
  2842. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2843. BEGIN
  2844. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2845. loopMulAZSZ );
  2846. RETURN RESULT
  2847. END "*";
  2848. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2849. BEGIN
  2850. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2851. loopMulAZSZ );
  2852. RETURN RESULT
  2853. END "*";
  2854. (** LONGCOMPLEX *)
  2855. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2856. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2857. BEGIN
  2858. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2859. WHILE (len > 0) DO
  2860. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2861. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2862. INC( ladr, linc );
  2863. INC( dadr, dinc ); DEC( len );
  2864. END;
  2865. END MulALZSLZLoop;
  2866. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2867. BEGIN
  2868. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2869. loopMulALZSLZ );
  2870. RETURN RESULT
  2871. END "*";
  2872. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2873. BEGIN
  2874. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2875. loopMulALZSLZ );
  2876. RETURN RESULT
  2877. END "*";
  2878. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2879. (** SHORTINT *)
  2880. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2881. VAR lval, rval, dval: SHORTINT;
  2882. BEGIN
  2883. SYSTEM.GET( radr, rval );
  2884. WHILE (len > 0) DO
  2885. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2886. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2887. END;
  2888. END IncMulASSSLoop;
  2889. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2890. BEGIN
  2891. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2892. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2893. END "INCMUL";
  2894. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2895. BEGIN
  2896. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2897. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2898. RETURN RESULT
  2899. END "INCMUL";
  2900. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2901. BEGIN
  2902. RESULT := -RESULT;
  2903. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2904. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2905. RESULT := -RESULT;
  2906. RETURN RESULT
  2907. END "DECMUL";
  2908. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2909. BEGIN
  2910. RESULT := -RESULT;
  2911. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2912. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2913. RESULT := -RESULT;
  2914. RETURN RESULT
  2915. END "DECMUL";
  2916. (** INTEGER *)
  2917. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2918. VAR lval, rval, dval: INTEGER;
  2919. BEGIN
  2920. SYSTEM.GET( radr, rval );
  2921. WHILE (len > 0) DO
  2922. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2923. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2924. END;
  2925. END IncMulAISILoop;
  2926. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2927. BEGIN
  2928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2929. SIZEOF( INTEGER ), IncMulAISILoop );
  2930. RETURN RESULT
  2931. END "INCMUL";
  2932. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2933. BEGIN
  2934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2935. SIZEOF( INTEGER ), IncMulAISILoop );
  2936. RETURN RESULT
  2937. END "INCMUL";
  2938. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2939. BEGIN
  2940. RESULT := -RESULT;
  2941. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2942. SIZEOF( INTEGER ), IncMulAISILoop );
  2943. RESULT := -RESULT;
  2944. RETURN RESULT
  2945. END "DECMUL";
  2946. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2947. BEGIN
  2948. RESULT := -RESULT;
  2949. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2950. SIZEOF( INTEGER ), IncMulAISILoop );
  2951. RESULT := -RESULT;
  2952. RETURN RESULT
  2953. END "DECMUL";
  2954. (** LONGINT *)
  2955. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2956. VAR lval, rval, dval: LONGINT;
  2957. BEGIN
  2958. SYSTEM.GET( radr, rval );
  2959. WHILE (len > 0) DO
  2960. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2961. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2962. END;
  2963. END IncMulALSLLoop;
  2964. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2965. BEGIN
  2966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2967. SIZEOF( LONGINT ), IncMulALSLLoop );
  2968. RETURN RESULT
  2969. END "INCMUL";
  2970. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2971. BEGIN
  2972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2973. SIZEOF( LONGINT ), IncMulALSLLoop );
  2974. RETURN RESULT
  2975. END "INCMUL";
  2976. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2977. BEGIN
  2978. RESULT := -RESULT;
  2979. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2980. SIZEOF( LONGINT ), IncMulALSLLoop );
  2981. RESULT := -RESULT;
  2982. RETURN RESULT
  2983. END "DECMUL";
  2984. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2985. BEGIN
  2986. RESULT := -RESULT;
  2987. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2988. SIZEOF( LONGINT ), IncMulALSLLoop );
  2989. RESULT := -RESULT;
  2990. RETURN RESULT
  2991. END "DECMUL";
  2992. (** REAL *)
  2993. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2994. VAR lval, rval, dval: REAL;
  2995. BEGIN
  2996. SYSTEM.GET( radr, rval );
  2997. WHILE (len > 0) DO
  2998. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2999. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3000. END;
  3001. END IncMulARSRLoop;
  3002. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3003. BEGIN
  3004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3005. loopIncMulARSR );
  3006. RETURN RESULT
  3007. END "INCMUL";
  3008. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3009. BEGIN
  3010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3011. loopIncMulARSR );
  3012. RETURN RESULT
  3013. END "INCMUL";
  3014. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3015. BEGIN
  3016. RESULT := -RESULT;
  3017. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3018. loopIncMulARSR );
  3019. RESULT := -RESULT;
  3020. RETURN RESULT
  3021. END "DECMUL";
  3022. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3023. BEGIN
  3024. RESULT := -RESULT;
  3025. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3026. loopIncMulARSR );
  3027. RESULT := -RESULT;
  3028. RETURN RESULT
  3029. END "DECMUL";
  3030. (** LONGREAL *)
  3031. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3032. VAR lval, rval, dval: LONGREAL;
  3033. BEGIN
  3034. IF debug THEN
  3035. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3036. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3037. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3038. END;
  3039. SYSTEM.GET( radr, rval );
  3040. WHILE (len > 0) DO
  3041. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3042. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3043. END;
  3044. END IncMulAXSXLoop;
  3045. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3046. BEGIN
  3047. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3048. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3049. RETURN RESULT
  3050. END "INCMUL";
  3051. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3052. BEGIN
  3053. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3054. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3055. RETURN RESULT
  3056. END "INCMUL";
  3057. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3058. BEGIN
  3059. RESULT := -RESULT;
  3060. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3061. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3062. RESULT := -RESULT;
  3063. RETURN RESULT
  3064. END "DECMUL";
  3065. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3066. BEGIN
  3067. RESULT := -RESULT;
  3068. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3069. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3070. RESULT := -RESULT;
  3071. RETURN RESULT
  3072. END "DECMUL";
  3073. (*** element-wise division array / array -> array ********************************************************************)
  3074. (** SHORTINT *)
  3075. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3076. VAR lval, rval: SHORTINT; 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 EDivideASASLoop;
  3084. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3085. BEGIN
  3086. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3087. EDivideASASLoop );
  3088. RETURN RESULT
  3089. END "./";
  3090. (** INTEGER *)
  3091. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3092. VAR lval, rval: INTEGER; dval: REAL;
  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 EDivideAIAILoop;
  3100. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3101. BEGIN
  3102. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3103. EDivideAIAILoop );
  3104. RETURN RESULT
  3105. END "./";
  3106. (** LONGINT *)
  3107. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3108. VAR lval, rval: LONGINT; dval: REAL;
  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 EDivideALALLoop;
  3116. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3117. BEGIN
  3118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3119. EDivideALALLoop );
  3120. RETURN RESULT
  3121. END "./";
  3122. (** REAL *)
  3123. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3124. VAR lval, rval: REAL; dval: REAL;
  3125. BEGIN
  3126. WHILE (len > 0) DO
  3127. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3128. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3129. DEC( len );
  3130. END;
  3131. END EDivideARARLoop;
  3132. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3133. BEGIN
  3134. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3135. EDivideARARLoop );
  3136. RETURN RESULT
  3137. END "./";
  3138. (** LONGREAL *)
  3139. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3140. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3141. BEGIN
  3142. WHILE (len > 0) DO
  3143. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3144. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3145. DEC( len );
  3146. END;
  3147. END EDivideAXAXLoop;
  3148. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3149. BEGIN
  3150. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3151. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3152. RETURN RESULT
  3153. END "./";
  3154. (** COMPLEX *)
  3155. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3156. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3157. BEGIN
  3158. WHILE (len > 0) DO
  3159. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3160. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3161. DEC( len );
  3162. END;
  3163. END EDivideAZAZLoop;
  3164. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3165. BEGIN
  3166. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3167. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3168. RETURN RESULT
  3169. END "./";
  3170. (** LONGCOMPLEX *)
  3171. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3172. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3173. BEGIN
  3174. WHILE (len > 0) DO
  3175. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3176. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3177. IF rvalIm # 0.0D0 THEN
  3178. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3179. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3180. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3181. ELSE
  3182. dvalRe := lvalRe/rvalRe;
  3183. dvalIm := lvalIm/rvalRe;
  3184. END;
  3185. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3186. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3187. DEC( len );
  3188. END;
  3189. END EDivideALZALZLoop;
  3190. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3191. BEGIN
  3192. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3193. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3194. RETURN RESULT
  3195. END "./";
  3196. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3197. (** SHORTINT *)
  3198. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3199. VAR lval, rval: SHORTINT; dval: REAL;
  3200. BEGIN
  3201. SYSTEM.GET( radr, rval );
  3202. WHILE (len > 0) DO
  3203. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3204. INC( dadr, dinc ); DEC( len );
  3205. END;
  3206. END DivideASSSLoop;
  3207. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3208. BEGIN
  3209. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3210. DivideASSSLoop );
  3211. RETURN RESULT
  3212. END "/";
  3213. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3214. VAR lval, rval: SHORTINT; dval: REAL;
  3215. BEGIN
  3216. SYSTEM.GET( radr, rval );
  3217. WHILE (len > 0) DO
  3218. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3219. INC( dadr, dinc ); DEC( len );
  3220. END;
  3221. END DivideSSASLoop;
  3222. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3223. BEGIN
  3224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3225. DivideSSASLoop );
  3226. RETURN RESULT
  3227. END "/";
  3228. (** INTEGER *)
  3229. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3230. VAR lval, rval: INTEGER; dval: REAL;
  3231. BEGIN
  3232. SYSTEM.GET( radr, rval );
  3233. WHILE (len > 0) DO
  3234. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3235. INC( dadr, dinc ); DEC( len );
  3236. END;
  3237. END DivideAISILoop;
  3238. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3239. BEGIN
  3240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3241. DivideAISILoop );
  3242. RETURN RESULT
  3243. END "/";
  3244. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3245. VAR lval, rval: INTEGER; dval: REAL;
  3246. BEGIN
  3247. SYSTEM.GET( radr, rval );
  3248. WHILE (len > 0) DO
  3249. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3250. INC( dadr, dinc ); DEC( len );
  3251. END;
  3252. END DivideSIAILoop;
  3253. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3254. BEGIN
  3255. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3256. DivideSIAILoop );
  3257. RETURN RESULT
  3258. END "/";
  3259. (** LONGINT *)
  3260. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3261. VAR lval, rval: LONGINT; dval: REAL;
  3262. BEGIN
  3263. SYSTEM.GET( radr, rval );
  3264. WHILE (len > 0) DO
  3265. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3266. INC( dadr, dinc ); DEC( len );
  3267. END;
  3268. END DivideALSLLoop;
  3269. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3270. BEGIN
  3271. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3272. DivideALSLLoop );
  3273. RETURN RESULT
  3274. END "/";
  3275. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3276. VAR lval, rval: LONGINT; dval: REAL;
  3277. BEGIN
  3278. SYSTEM.GET( radr, rval );
  3279. WHILE (len > 0) DO
  3280. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3281. INC( dadr, dinc ); DEC( len );
  3282. END;
  3283. END DivideSLALLoop;
  3284. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3285. BEGIN
  3286. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3287. DivideSLALLoop );
  3288. RETURN RESULT
  3289. END "/";
  3290. (** REAL *)
  3291. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3292. VAR lval, rval: REAL; dval: REAL;
  3293. BEGIN
  3294. SYSTEM.GET( radr, rval );
  3295. WHILE (len > 0) DO
  3296. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3297. INC( dadr, dinc ); DEC( len );
  3298. END;
  3299. END DivideARSRLoop;
  3300. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3301. BEGIN
  3302. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3303. DivideARSRLoop );
  3304. RETURN RESULT
  3305. END "/";
  3306. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3307. VAR lval, rval: REAL; dval: REAL;
  3308. BEGIN
  3309. SYSTEM.GET( radr, rval );
  3310. WHILE (len > 0) DO
  3311. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3312. INC( dadr, dinc ); DEC( len );
  3313. END;
  3314. END DivideSRARLoop;
  3315. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3316. BEGIN
  3317. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3318. DivideSRARLoop );
  3319. RETURN RESULT
  3320. END "/";
  3321. (** LONGREAL *)
  3322. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3323. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3324. BEGIN
  3325. SYSTEM.GET( radr, rval );
  3326. WHILE (len > 0) DO
  3327. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3328. INC( dadr, dinc ); DEC( len );
  3329. END;
  3330. END DivideAXSXLoop;
  3331. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3332. BEGIN
  3333. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3334. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3335. RETURN RESULT
  3336. END "/";
  3337. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3338. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3339. BEGIN
  3340. SYSTEM.GET( radr, rval );
  3341. WHILE (len > 0) DO
  3342. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3343. INC( dadr, dinc ); DEC( len );
  3344. END;
  3345. END DivideSXAXLoop;
  3346. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3347. BEGIN
  3348. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3349. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3350. RETURN RESULT
  3351. END "/";
  3352. (** COMPLEX *)
  3353. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3354. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3355. BEGIN
  3356. SYSTEM.GET( radr, rval );
  3357. WHILE (len > 0) DO
  3358. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3359. INC( dadr, dinc ); DEC( len );
  3360. END;
  3361. END DivideAZSZLoop;
  3362. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3363. BEGIN
  3364. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3365. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3366. RETURN RESULT
  3367. END "/";
  3368. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3369. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3370. BEGIN
  3371. SYSTEM.GET( radr, rval );
  3372. WHILE (len > 0) DO
  3373. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3374. INC( dadr, dinc ); DEC( len );
  3375. END;
  3376. END DivideSZAZLoop;
  3377. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3378. BEGIN
  3379. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3380. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3381. RETURN RESULT
  3382. END "/";
  3383. (** LONGCOMPLEX *)
  3384. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3385. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3386. BEGIN
  3387. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3388. IF rvalIm # 0.0D0 THEN
  3389. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3390. WHILE (len > 0) DO
  3391. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3392. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3393. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3394. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3395. INC( ladr, linc );
  3396. INC( dadr, dinc ); DEC( len );
  3397. END;
  3398. ELSE
  3399. WHILE (len > 0) DO
  3400. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3401. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3402. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3403. INC( ladr, linc );
  3404. INC( dadr, dinc ); DEC( len );
  3405. END;
  3406. END;
  3407. END DivideALZSLZLoop;
  3408. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3409. BEGIN
  3410. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3411. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3412. RETURN RESULT
  3413. END "/";
  3414. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3415. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3416. BEGIN
  3417. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3418. WHILE (len > 0) DO
  3419. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3420. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3421. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3422. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3423. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3424. INC( ladr, linc );
  3425. INC( dadr, dinc ); DEC( len );
  3426. END;
  3427. END DivideSLZALZLoop;
  3428. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3429. BEGIN
  3430. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3431. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3432. RETURN RESULT
  3433. END "/";
  3434. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3435. (** SHORTINT *)
  3436. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3437. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3438. BEGIN
  3439. WHILE (len > 0) DO
  3440. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3441. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3442. DEC( len );
  3443. END;
  3444. END EDivASASLoop;
  3445. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3446. BEGIN
  3447. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3448. SIZEOF( SHORTINT ), EDivASASLoop );
  3449. RETURN RESULT
  3450. END "DIV";
  3451. (** INTEGER *)
  3452. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3453. VAR lval, rval: INTEGER; dval: INTEGER;
  3454. BEGIN
  3455. WHILE (len > 0) DO
  3456. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3457. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3458. DEC( len );
  3459. END;
  3460. END EDivAIAILoop;
  3461. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3462. BEGIN
  3463. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3464. SIZEOF( INTEGER ), EDivAIAILoop );
  3465. RETURN RESULT
  3466. END "DIV";
  3467. (** LONGINT *)
  3468. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3469. VAR lval, rval: LONGINT; dval: LONGINT;
  3470. BEGIN
  3471. WHILE (len > 0) DO
  3472. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3473. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3474. DEC( len );
  3475. END;
  3476. END EDivALALLoop;
  3477. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3478. BEGIN
  3479. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3480. SIZEOF( LONGINT ), EDivALALLoop );
  3481. RETURN RESULT
  3482. END "DIV";
  3483. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3484. (** SHORTINT *)
  3485. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3486. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3487. BEGIN
  3488. SYSTEM.GET( radr, rval );
  3489. WHILE (len > 0) DO
  3490. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3491. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3492. END;
  3493. END DivASSSLoop;
  3494. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3495. BEGIN
  3496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3497. SIZEOF( SHORTINT ), DivASSSLoop );
  3498. RETURN RESULT
  3499. END "DIV";
  3500. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3501. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3502. BEGIN
  3503. SYSTEM.GET( radr, rval );
  3504. WHILE (len > 0) DO
  3505. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3506. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3507. END;
  3508. END DivSSASLoop;
  3509. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3510. BEGIN
  3511. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3512. SIZEOF( SHORTINT ), DivSSASLoop );
  3513. RETURN RESULT
  3514. END "DIV";
  3515. (** INTEGER *)
  3516. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3517. VAR lval, rval: INTEGER; dval: INTEGER;
  3518. BEGIN
  3519. SYSTEM.GET( radr, rval );
  3520. WHILE (len > 0) DO
  3521. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3522. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3523. END;
  3524. END DivAISILoop;
  3525. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3526. BEGIN
  3527. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3528. SIZEOF( INTEGER ), DivAISILoop );
  3529. RETURN RESULT
  3530. END "DIV";
  3531. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3532. VAR lval, rval: INTEGER; dval: INTEGER;
  3533. BEGIN
  3534. SYSTEM.GET( radr, rval );
  3535. WHILE (len > 0) DO
  3536. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3537. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3538. END;
  3539. END DivSIAILoop;
  3540. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3541. BEGIN
  3542. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3543. SIZEOF( INTEGER ), DivSIAILoop );
  3544. RETURN RESULT
  3545. END "DIV";
  3546. (** LONGINT *)
  3547. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3548. VAR lval, rval: LONGINT; dval: LONGINT;
  3549. BEGIN
  3550. SYSTEM.GET( radr, rval );
  3551. WHILE (len > 0) DO
  3552. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3553. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3554. END;
  3555. END DivALSLLoop;
  3556. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3557. BEGIN
  3558. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3559. SIZEOF( LONGINT ), DivALSLLoop );
  3560. RETURN RESULT
  3561. END "DIV";
  3562. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3563. VAR lval, rval: LONGINT; dval: LONGINT;
  3564. BEGIN
  3565. SYSTEM.GET( radr, rval );
  3566. WHILE (len > 0) DO
  3567. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3568. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3569. END;
  3570. END DivSLALLoop;
  3571. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3572. BEGIN
  3573. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3574. SIZEOF( LONGINT ), DivSLALLoop );
  3575. RETURN RESULT
  3576. END "DIV";
  3577. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3578. (** SHORTINT *)
  3579. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3580. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3581. BEGIN
  3582. WHILE (len > 0) DO
  3583. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3584. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3585. DEC( len );
  3586. END;
  3587. END EModASASLoop;
  3588. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3589. BEGIN
  3590. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3591. SIZEOF( SHORTINT ), EModASASLoop );
  3592. RETURN RESULT
  3593. END "MOD";
  3594. (** INTEGER *)
  3595. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3596. VAR lval, rval: INTEGER; dval: INTEGER;
  3597. BEGIN
  3598. WHILE (len > 0) DO
  3599. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3600. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3601. DEC( len );
  3602. END;
  3603. END EModAIAILoop;
  3604. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3605. BEGIN
  3606. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3607. SIZEOF( INTEGER ), EModAIAILoop );
  3608. RETURN RESULT
  3609. END "MOD";
  3610. (** LONGINT *)
  3611. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3612. VAR lval, rval: LONGINT; dval: LONGINT;
  3613. BEGIN
  3614. WHILE (len > 0) DO
  3615. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3616. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3617. DEC( len );
  3618. END;
  3619. END EModALALLoop;
  3620. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3621. BEGIN
  3622. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3623. SIZEOF( LONGINT ), EModALALLoop );
  3624. RETURN RESULT
  3625. END "MOD";
  3626. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3627. (** SHORTINT *)
  3628. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3629. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3630. BEGIN
  3631. SYSTEM.GET( radr, rval );
  3632. WHILE (len > 0) DO
  3633. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3634. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3635. END;
  3636. END ModASSSLoop;
  3637. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3638. BEGIN
  3639. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3640. SIZEOF( SHORTINT ), ModASSSLoop );
  3641. RETURN RESULT
  3642. END "MOD";
  3643. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3644. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3645. BEGIN
  3646. SYSTEM.GET( radr, rval );
  3647. WHILE (len > 0) DO
  3648. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3649. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3650. END;
  3651. END ModSSASLoop;
  3652. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3653. BEGIN
  3654. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3655. SIZEOF( SHORTINT ), ModSSASLoop );
  3656. RETURN RESULT
  3657. END "MOD";
  3658. (** INTEGER *)
  3659. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3660. VAR lval, rval: INTEGER; dval: INTEGER;
  3661. BEGIN
  3662. SYSTEM.GET( radr, rval );
  3663. WHILE (len > 0) DO
  3664. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3665. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3666. END;
  3667. END ModAISILoop;
  3668. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3669. BEGIN
  3670. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3671. SIZEOF( INTEGER ), ModAISILoop );
  3672. RETURN RESULT
  3673. END "MOD";
  3674. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3675. VAR lval, rval: INTEGER; dval: INTEGER;
  3676. BEGIN
  3677. SYSTEM.GET( radr, rval );
  3678. WHILE (len > 0) DO
  3679. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3680. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3681. END;
  3682. END ModSIAILoop;
  3683. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3684. BEGIN
  3685. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3686. SIZEOF( INTEGER ), ModSIAILoop );
  3687. RETURN RESULT
  3688. END "MOD";
  3689. (** LONGINT *)
  3690. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3691. VAR lval, rval: LONGINT; dval: LONGINT;
  3692. BEGIN
  3693. SYSTEM.GET( radr, rval );
  3694. WHILE (len > 0) DO
  3695. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3696. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3697. END;
  3698. END ModALSLLoop;
  3699. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3700. BEGIN
  3701. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3702. SIZEOF( LONGINT ), ModALSLLoop );
  3703. RETURN RESULT
  3704. END "MOD";
  3705. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3706. VAR lval, rval: LONGINT; dval: LONGINT;
  3707. BEGIN
  3708. SYSTEM.GET( radr, rval );
  3709. WHILE (len > 0) DO
  3710. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3711. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3712. END;
  3713. END ModSLALLoop;
  3714. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3715. BEGIN
  3716. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3717. SIZEOF( LONGINT ), ModSLALLoop );
  3718. RETURN RESULT
  3719. END "MOD";
  3720. (*** scalar product <array,array> -> scalar ********************************************************************)
  3721. (** SHORTINT *)
  3722. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3723. VAR lval, rval: SHORTINT; dval: LONGINT;
  3724. BEGIN
  3725. SYSTEM.GET( dadr, dval );
  3726. WHILE (len > 0) DO
  3727. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3728. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3729. END;
  3730. SYSTEM.PUT( dadr, dval );
  3731. END SPASASLoop;
  3732. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3733. VAR dest: LONGINT;
  3734. BEGIN
  3735. dest := 0;
  3736. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3737. RETURN dest;
  3738. END "+*";
  3739. (** INTEGER *)
  3740. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3741. VAR lval, rval: INTEGER; dval: LONGINT;
  3742. BEGIN
  3743. SYSTEM.GET( dadr, dval );
  3744. WHILE (len > 0) DO
  3745. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3746. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3747. END;
  3748. SYSTEM.PUT( dadr, dval );
  3749. END SPAIAILoop;
  3750. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3751. VAR dest: LONGINT;
  3752. BEGIN
  3753. dest := 0;
  3754. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3755. RETURN dest;
  3756. END "+*";
  3757. (** LONGINT *)
  3758. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3759. VAR lval, rval: LONGINT; dval: LONGINT;
  3760. BEGIN
  3761. SYSTEM.GET( dadr, dval );
  3762. WHILE (len > 0) DO
  3763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3764. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3765. END;
  3766. SYSTEM.PUT( dadr, dval );
  3767. END SPALALLoop;
  3768. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3769. VAR dest: LONGINT;
  3770. BEGIN
  3771. dest := 0;
  3772. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3773. RETURN dest;
  3774. END "+*";
  3775. (** REAL *)
  3776. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3777. VAR lval, rval: REAL; dval: REAL;
  3778. BEGIN
  3779. SYSTEM.GET( dadr, dval );
  3780. WHILE (len > 0) DO
  3781. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3782. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3783. END;
  3784. SYSTEM.PUT( dadr, dval );
  3785. END SPARARLoop;
  3786. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3787. VAR dest: REAL;
  3788. BEGIN
  3789. dest := 0;
  3790. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3791. RETURN dest;
  3792. END "+*";
  3793. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3794. VAR lval, rval, dval: LONGREAL;
  3795. BEGIN
  3796. IF debug THEN
  3797. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3798. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3799. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3800. END;
  3801. SYSTEM.GET( dadr, dval );
  3802. WHILE (len > 0) DO
  3803. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3804. dval := dval + rval * lval; DEC( len );
  3805. END;
  3806. SYSTEM.PUT( dadr, dval );
  3807. END SPAXAXLoop;
  3808. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3809. VAR dest: LONGREAL;
  3810. BEGIN
  3811. dest := 0;
  3812. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3813. RETURN dest;
  3814. END "+*";
  3815. (** COMPLEX *)
  3816. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3817. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3818. BEGIN
  3819. SYSTEM.GET( dadr, dval );
  3820. WHILE (len > 0) DO
  3821. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3822. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3823. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3824. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3825. END;
  3826. SYSTEM.PUT( dadr, dval );
  3827. END SPAZAZLoop;
  3828. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3829. VAR dest: COMPLEX;
  3830. BEGIN
  3831. dest := 0;
  3832. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3833. RETURN dest;
  3834. END "+*";
  3835. (** COMPLEX *)
  3836. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3837. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3838. BEGIN
  3839. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3840. WHILE (len > 0) DO
  3841. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3842. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3843. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3844. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3845. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3846. END;
  3847. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3848. END SPALZALZLoop;
  3849. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3850. VAR dest: LONGCOMPLEX;
  3851. BEGIN
  3852. dest := 0;
  3853. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3854. RETURN dest;
  3855. END "+*";
  3856. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3857. (** BOOLEAN *)
  3858. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3859. VAR lval, rval: BOOLEAN;
  3860. BEGIN
  3861. WHILE (len > 0) DO
  3862. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3863. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3864. END;
  3865. END EEqlABABLoop;
  3866. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3867. BEGIN
  3868. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3869. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3870. RETURN RESULT
  3871. END ".=";
  3872. (** SHORTINT *)
  3873. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3874. VAR lval, rval: SHORTINT;
  3875. BEGIN
  3876. WHILE (len > 0) DO
  3877. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3878. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3879. END;
  3880. END EEqlASASLoop;
  3881. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3882. BEGIN
  3883. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3884. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3885. RETURN RESULT
  3886. END ".=";
  3887. (** INTEGER *)
  3888. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3889. VAR lval, rval: INTEGER;
  3890. BEGIN
  3891. WHILE (len > 0) DO
  3892. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3893. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3894. END;
  3895. END EEqlAIAILoop;
  3896. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3897. BEGIN
  3898. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3899. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3900. RETURN RESULT
  3901. END ".=";
  3902. (** LONGINT *)
  3903. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3904. VAR lval, rval: LONGINT;
  3905. BEGIN
  3906. WHILE (len > 0) DO
  3907. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3908. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3909. END;
  3910. END EEqlALALLoop;
  3911. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3912. BEGIN
  3913. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3914. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3915. RETURN RESULT
  3916. END ".=";
  3917. (** REAL *)
  3918. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3919. VAR lval, rval: REAL;
  3920. BEGIN
  3921. WHILE (len > 0) DO
  3922. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3923. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3924. END;
  3925. END EEqlARARLoop;
  3926. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3927. BEGIN
  3928. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3929. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3930. RETURN RESULT
  3931. END ".=";
  3932. (** LONGREAL *)
  3933. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3934. VAR lval, rval: LONGREAL;
  3935. BEGIN
  3936. WHILE (len > 0) DO
  3937. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3938. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3939. END;
  3940. END EEqlAXAXLoop;
  3941. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3942. BEGIN
  3943. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3944. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3945. RETURN RESULT
  3946. END ".=";
  3947. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3948. (** BOOLEAN *)
  3949. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3950. VAR lval, rval: BOOLEAN;
  3951. BEGIN
  3952. SYSTEM.GET( radr, rval );
  3953. WHILE (len > 0) DO
  3954. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3955. INC( dadr, dinc ); DEC( len );
  3956. END;
  3957. END EEqlABSBLoop;
  3958. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3959. BEGIN
  3960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3961. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3962. RETURN RESULT
  3963. END ".=";
  3964. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3965. BEGIN
  3966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3967. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3968. RETURN RESULT
  3969. END ".=";
  3970. (** SHORTINT *)
  3971. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3972. VAR lval, rval: SHORTINT;
  3973. BEGIN
  3974. SYSTEM.GET( radr, rval );
  3975. WHILE (len > 0) DO
  3976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3977. INC( dadr, dinc ); DEC( len );
  3978. END;
  3979. END EEqlASSSLoop;
  3980. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3981. BEGIN
  3982. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3983. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3984. RETURN RESULT
  3985. END ".=";
  3986. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3987. BEGIN
  3988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3989. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3990. RETURN RESULT
  3991. END ".=";
  3992. (** INTEGER *)
  3993. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3994. VAR lval, rval: INTEGER;
  3995. BEGIN
  3996. SYSTEM.GET( radr, rval );
  3997. WHILE (len > 0) DO
  3998. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3999. INC( dadr, dinc ); DEC( len );
  4000. END;
  4001. END EEqlAISILoop;
  4002. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4003. BEGIN
  4004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4005. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4006. RETURN RESULT
  4007. END ".=";
  4008. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4009. BEGIN
  4010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4011. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4012. RETURN RESULT
  4013. END ".=";
  4014. (** LONGINT *)
  4015. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4016. VAR lval, rval: LONGINT;
  4017. BEGIN
  4018. SYSTEM.GET( radr, rval );
  4019. WHILE (len > 0) DO
  4020. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4021. INC( dadr, dinc ); DEC( len );
  4022. END;
  4023. END EEqlALSLLoop;
  4024. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4025. BEGIN
  4026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4027. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4028. RETURN RESULT
  4029. END ".=";
  4030. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4031. BEGIN
  4032. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4033. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4034. RETURN RESULT
  4035. END ".=";
  4036. (** REAL *)
  4037. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4038. VAR lval, rval: REAL;
  4039. BEGIN
  4040. SYSTEM.GET( radr, rval );
  4041. WHILE (len > 0) DO
  4042. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4043. INC( dadr, dinc ); DEC( len );
  4044. END;
  4045. END EEqlARSRLoop;
  4046. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4047. BEGIN
  4048. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4049. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4050. RETURN RESULT
  4051. END ".=";
  4052. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4053. BEGIN
  4054. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4055. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4056. RETURN RESULT
  4057. END ".=";
  4058. (** LONGREAL *)
  4059. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4060. VAR lval, rval: LONGREAL;
  4061. BEGIN
  4062. SYSTEM.GET( radr, rval );
  4063. WHILE (len > 0) DO
  4064. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4065. INC( dadr, dinc ); DEC( len );
  4066. END;
  4067. END EEqlAXSXLoop;
  4068. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4069. BEGIN
  4070. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4071. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4072. RETURN RESULT
  4073. END ".=";
  4074. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4075. BEGIN
  4076. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4077. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4078. RETURN RESULT
  4079. END ".=";
  4080. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4081. (** BOOLEAN *)
  4082. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4083. VAR lval, rval: BOOLEAN;
  4084. BEGIN
  4085. WHILE (len > 0) DO
  4086. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4087. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4088. END;
  4089. END ENeqABABLoop;
  4090. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4091. BEGIN
  4092. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4093. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4094. RETURN RESULT
  4095. END ".#";
  4096. (** SHORTINT *)
  4097. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4098. VAR lval, rval: SHORTINT;
  4099. BEGIN
  4100. WHILE (len > 0) DO
  4101. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4102. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4103. END;
  4104. END ENeqASASLoop;
  4105. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4106. BEGIN
  4107. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4108. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4109. RETURN RESULT
  4110. END ".#";
  4111. (** INTEGER*)
  4112. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4113. VAR lval, rval: INTEGER;
  4114. BEGIN
  4115. WHILE (len > 0) DO
  4116. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4117. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4118. END;
  4119. END ENeqAIAILoop;
  4120. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4121. BEGIN
  4122. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4123. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4124. RETURN RESULT
  4125. END ".#";
  4126. (** LONGINT*)
  4127. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4128. VAR lval, rval: LONGINT;
  4129. BEGIN
  4130. WHILE (len > 0) DO
  4131. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4132. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4133. END;
  4134. END ENeqALALLoop;
  4135. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4136. BEGIN
  4137. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4138. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4139. RETURN RESULT
  4140. END ".#";
  4141. (** REAL *)
  4142. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4143. VAR lval, rval: REAL;
  4144. BEGIN
  4145. WHILE (len > 0) DO
  4146. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4147. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4148. END;
  4149. END ENeqARARLoop;
  4150. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4151. BEGIN
  4152. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4153. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4154. RETURN RESULT
  4155. END ".#";
  4156. (** LONGREAL *)
  4157. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4158. VAR lval, rval: LONGREAL;
  4159. BEGIN
  4160. WHILE (len > 0) DO
  4161. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4162. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4163. END;
  4164. END ENeqAXAXLoop;
  4165. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4166. BEGIN
  4167. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4168. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4169. RETURN RESULT
  4170. END ".#";
  4171. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4172. (** BOOLEAN *)
  4173. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4174. VAR lval, rval: BOOLEAN;
  4175. BEGIN
  4176. SYSTEM.GET( radr, rval );
  4177. WHILE (len > 0) DO
  4178. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4179. INC( dadr, dinc ); DEC( len );
  4180. END;
  4181. END ENeqABSBLoop;
  4182. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4183. BEGIN
  4184. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4185. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4186. RETURN RESULT
  4187. END ".#";
  4188. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4189. BEGIN
  4190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4191. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4192. RETURN RESULT
  4193. END ".#";
  4194. (** SHORTINT *)
  4195. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4196. VAR lval, rval: SHORTINT;
  4197. BEGIN
  4198. SYSTEM.GET( radr, rval );
  4199. WHILE (len > 0) DO
  4200. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4201. INC( dadr, dinc ); DEC( len );
  4202. END;
  4203. END ENeqASSSLoop;
  4204. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4205. BEGIN
  4206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4207. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4208. RETURN RESULT
  4209. END ".#";
  4210. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4211. BEGIN
  4212. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4213. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4214. RETURN RESULT
  4215. END ".#";
  4216. (** INTEGER *)
  4217. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4218. VAR lval, rval: INTEGER;
  4219. BEGIN
  4220. SYSTEM.GET( radr, rval );
  4221. WHILE (len > 0) DO
  4222. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4223. INC( dadr, dinc ); DEC( len );
  4224. END;
  4225. END ENeqAISILoop;
  4226. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4227. BEGIN
  4228. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4229. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4230. RETURN RESULT
  4231. END ".#";
  4232. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4233. BEGIN
  4234. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4235. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4236. RETURN RESULT
  4237. END ".#";
  4238. (** LONGINT *)
  4239. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4240. VAR lval, rval: LONGINT;
  4241. BEGIN
  4242. SYSTEM.GET( radr, rval );
  4243. WHILE (len > 0) DO
  4244. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4245. INC( dadr, dinc ); DEC( len );
  4246. END;
  4247. END ENeqALSLLoop;
  4248. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4249. BEGIN
  4250. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4251. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4252. RETURN RESULT
  4253. END ".#";
  4254. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4255. BEGIN
  4256. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4257. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4258. RETURN RESULT
  4259. END ".#";
  4260. (** REAL *)
  4261. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4262. VAR lval, rval: REAL;
  4263. BEGIN
  4264. SYSTEM.GET( radr, rval );
  4265. WHILE (len > 0) DO
  4266. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4267. INC( dadr, dinc ); DEC( len );
  4268. END;
  4269. END ENeqARSRLoop;
  4270. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4271. BEGIN
  4272. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4273. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4274. RETURN RESULT
  4275. END ".#";
  4276. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4277. BEGIN
  4278. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4279. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4280. RETURN RESULT
  4281. END ".#";
  4282. (** LONGREAL *)
  4283. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4284. VAR lval, rval: LONGREAL;
  4285. BEGIN
  4286. SYSTEM.GET( radr, rval );
  4287. WHILE (len > 0) DO
  4288. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4289. INC( dadr, dinc ); DEC( len );
  4290. END;
  4291. END ENeqAXSXLoop;
  4292. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4293. BEGIN
  4294. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4295. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4296. RETURN RESULT
  4297. END ".#";
  4298. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4299. BEGIN
  4300. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4301. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4302. RETURN RESULT
  4303. END ".#";
  4304. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4305. (** SHORTINT *)
  4306. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4307. VAR lval, rval: SHORTINT;
  4308. BEGIN
  4309. WHILE (len > 0) DO
  4310. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4311. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4312. END;
  4313. END EGtrASASLoop;
  4314. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4315. BEGIN
  4316. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4317. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4318. RETURN RESULT
  4319. END ".>";
  4320. (** INTEGER *)
  4321. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4322. VAR lval, rval: INTEGER;
  4323. BEGIN
  4324. WHILE (len > 0) DO
  4325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4326. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4327. END;
  4328. END EGtrAIAILoop;
  4329. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4330. BEGIN
  4331. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4332. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4333. RETURN RESULT
  4334. END ".>";
  4335. (** LONGINT *)
  4336. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4337. VAR lval, rval: LONGINT;
  4338. BEGIN
  4339. WHILE (len > 0) DO
  4340. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4341. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4342. END;
  4343. END EGtrALALLoop;
  4344. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4345. BEGIN
  4346. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4347. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4348. RETURN RESULT
  4349. END ".>";
  4350. (** REAL *)
  4351. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4352. VAR lval, rval: REAL;
  4353. BEGIN
  4354. WHILE (len > 0) DO
  4355. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4356. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4357. END;
  4358. END EGtrARARLoop;
  4359. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4360. BEGIN
  4361. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4362. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4363. RETURN RESULT
  4364. END ".>";
  4365. (** LONGREAL *)
  4366. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4367. VAR lval, rval: LONGREAL;
  4368. BEGIN
  4369. WHILE (len > 0) DO
  4370. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4371. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4372. END;
  4373. END EGtrAXAXLoop;
  4374. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4375. BEGIN
  4376. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4377. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4378. RETURN RESULT
  4379. END ".>";
  4380. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4381. (** SHORTINT *)
  4382. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4383. VAR lval, rval: SHORTINT;
  4384. BEGIN
  4385. SYSTEM.GET( radr, rval );
  4386. WHILE (len > 0) DO
  4387. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4388. INC( dadr, dinc ); DEC( len );
  4389. END;
  4390. END EGtrASSSLoop;
  4391. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4392. BEGIN
  4393. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4394. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4395. RETURN RESULT
  4396. END ".>";
  4397. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4398. BEGIN
  4399. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4400. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4401. RETURN RESULT
  4402. END ".<";
  4403. (** INTEGER *)
  4404. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4405. VAR lval, rval: INTEGER;
  4406. BEGIN
  4407. SYSTEM.GET( radr, rval );
  4408. WHILE (len > 0) DO
  4409. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4410. INC( dadr, dinc ); DEC( len );
  4411. END;
  4412. END EGtrAISILoop;
  4413. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4414. BEGIN
  4415. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4416. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4417. RETURN RESULT
  4418. END ".>";
  4419. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4420. BEGIN
  4421. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4422. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4423. RETURN RESULT
  4424. END ".<";
  4425. (** LONGINT *)
  4426. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4427. VAR lval, rval: LONGINT;
  4428. BEGIN
  4429. SYSTEM.GET( radr, rval );
  4430. WHILE (len > 0) DO
  4431. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4432. INC( dadr, dinc ); DEC( len );
  4433. END;
  4434. END EGtrALSLLoop;
  4435. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4436. BEGIN
  4437. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4438. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4439. RETURN RESULT
  4440. END ".>";
  4441. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4442. BEGIN
  4443. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4444. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4445. RETURN RESULT
  4446. END ".<";
  4447. (** REAL *)
  4448. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4449. VAR lval, rval: REAL;
  4450. BEGIN
  4451. SYSTEM.GET( radr, rval );
  4452. WHILE (len > 0) DO
  4453. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4454. INC( dadr, dinc ); DEC( len );
  4455. END;
  4456. END EGtrARSRLoop;
  4457. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4458. BEGIN
  4459. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4460. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4461. RETURN RESULT
  4462. END ".>";
  4463. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4464. BEGIN
  4465. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4466. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4467. RETURN RESULT
  4468. END ".<";
  4469. (** LONGREAL *)
  4470. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4471. VAR lval, rval: LONGREAL;
  4472. BEGIN
  4473. SYSTEM.GET( radr, rval );
  4474. WHILE (len > 0) DO
  4475. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4476. INC( dadr, dinc ); DEC( len );
  4477. END;
  4478. END EGtrAXSXLoop;
  4479. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4480. BEGIN
  4481. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4482. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4483. RETURN RESULT
  4484. END ".>";
  4485. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4486. BEGIN
  4487. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4488. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4489. RETURN RESULT
  4490. END ".<";
  4491. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4492. (** SHORTINT *)
  4493. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4494. VAR lval, rval: SHORTINT;
  4495. BEGIN
  4496. WHILE (len > 0) DO
  4497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4498. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4499. END;
  4500. END EGeqASASLoop;
  4501. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4502. BEGIN
  4503. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4504. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4505. RETURN RESULT
  4506. END ".>=";
  4507. (** INTEGER *)
  4508. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4509. VAR lval, rval: INTEGER;
  4510. BEGIN
  4511. WHILE (len > 0) DO
  4512. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4513. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4514. END;
  4515. END EGeqAIAILoop;
  4516. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4517. BEGIN
  4518. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4519. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4520. RETURN RESULT
  4521. END ".>=";
  4522. (** LONGINT *)
  4523. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4524. VAR lval, rval: LONGINT;
  4525. BEGIN
  4526. WHILE (len > 0) DO
  4527. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4528. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4529. END;
  4530. END EGeqALALLoop;
  4531. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4532. BEGIN
  4533. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4534. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4535. RETURN RESULT
  4536. END ".>=";
  4537. (** REAL *)
  4538. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4539. VAR lval, rval: REAL;
  4540. BEGIN
  4541. WHILE (len > 0) DO
  4542. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4543. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4544. END;
  4545. END EGeqARARLoop;
  4546. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4547. BEGIN
  4548. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4549. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4550. RETURN RESULT
  4551. END ".>=";
  4552. (** LONGREAL *)
  4553. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4554. VAR lval, rval: LONGREAL;
  4555. BEGIN
  4556. WHILE (len > 0) DO
  4557. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4558. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4559. END;
  4560. END EGeqAXAXLoop;
  4561. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4562. BEGIN
  4563. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4564. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4565. RETURN RESULT
  4566. END ".>=";
  4567. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4568. (** SHORTINT *)
  4569. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4570. VAR lval, rval: SHORTINT;
  4571. BEGIN
  4572. SYSTEM.GET( radr, rval );
  4573. WHILE (len > 0) DO
  4574. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4575. INC( dadr, dinc ); DEC( len );
  4576. END;
  4577. END EGeqASSSLoop;
  4578. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4579. BEGIN
  4580. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4581. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4582. RETURN RESULT
  4583. END ".>=";
  4584. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4585. BEGIN
  4586. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4587. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4588. RETURN RESULT
  4589. END ".<=";
  4590. (** INTEGER *)
  4591. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4592. VAR lval, rval: INTEGER;
  4593. BEGIN
  4594. SYSTEM.GET( radr, rval );
  4595. WHILE (len > 0) DO
  4596. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4597. INC( dadr, dinc ); DEC( len );
  4598. END;
  4599. END EGeqAISILoop;
  4600. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4601. BEGIN
  4602. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4603. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4604. RETURN RESULT
  4605. END ".>=";
  4606. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4607. BEGIN
  4608. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4609. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4610. RETURN RESULT
  4611. END ".<=";
  4612. (** LONGINT *)
  4613. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4614. VAR lval, rval: LONGINT;
  4615. BEGIN
  4616. SYSTEM.GET( radr, rval );
  4617. WHILE (len > 0) DO
  4618. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4619. INC( dadr, dinc ); DEC( len );
  4620. END;
  4621. END EGeqALSLLoop;
  4622. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4623. BEGIN
  4624. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4625. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4626. RETURN RESULT
  4627. END ".>=";
  4628. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4629. BEGIN
  4630. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4631. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4632. RETURN RESULT
  4633. END ".<=";
  4634. (** REAL *)
  4635. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4636. VAR lval, rval: REAL;
  4637. BEGIN
  4638. SYSTEM.GET( radr, rval );
  4639. WHILE (len > 0) DO
  4640. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4641. INC( dadr, dinc ); DEC( len );
  4642. END;
  4643. END EGeqARSRLoop;
  4644. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4645. BEGIN
  4646. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4647. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4648. RETURN RESULT
  4649. END ".>=";
  4650. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4651. BEGIN
  4652. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4653. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4654. RETURN RESULT
  4655. END ".<=";
  4656. (** LONGREAL *)
  4657. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4658. VAR lval, rval: LONGREAL;
  4659. BEGIN
  4660. SYSTEM.GET( radr, rval );
  4661. WHILE (len > 0) DO
  4662. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4663. INC( dadr, dinc ); DEC( len );
  4664. END;
  4665. END EGeqAXSXLoop;
  4666. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4667. BEGIN
  4668. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4669. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4670. RETURN RESULT
  4671. END ".>=";
  4672. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4673. BEGIN
  4674. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4675. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4676. RETURN RESULT
  4677. END ".<=";
  4678. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4679. (** SHORTINT *)
  4680. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4681. VAR lval, rval: SHORTINT;
  4682. BEGIN
  4683. WHILE (len > 0) DO
  4684. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4685. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4686. END;
  4687. END ELssASASLoop;
  4688. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4689. BEGIN
  4690. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4691. SIZEOF( BOOLEAN ), ELssASASLoop );
  4692. RETURN RESULT
  4693. END ".<";
  4694. (** INTEGER *)
  4695. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4696. VAR lval, rval: INTEGER;
  4697. BEGIN
  4698. WHILE (len > 0) DO
  4699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4700. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4701. END;
  4702. END ELssAIAILoop;
  4703. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4704. BEGIN
  4705. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4706. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4707. RETURN RESULT
  4708. END ".<";
  4709. (** LONGINT*)
  4710. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4711. VAR lval, rval: LONGINT;
  4712. BEGIN
  4713. WHILE (len > 0) DO
  4714. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4715. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4716. END;
  4717. END ELssALALLoop;
  4718. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4719. BEGIN
  4720. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4721. SIZEOF( BOOLEAN ), ELssALALLoop );
  4722. RETURN RESULT
  4723. END ".<";
  4724. (** REAL *)
  4725. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4726. VAR lval, rval: REAL;
  4727. BEGIN
  4728. WHILE (len > 0) DO
  4729. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4730. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4731. END;
  4732. END ELssARARLoop;
  4733. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4734. BEGIN
  4735. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4736. SIZEOF( BOOLEAN ), ELssARARLoop );
  4737. RETURN RESULT
  4738. END ".<";
  4739. (** LONGREAL *)
  4740. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4741. VAR lval, rval: LONGREAL;
  4742. BEGIN
  4743. WHILE (len > 0) DO
  4744. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4745. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4746. END;
  4747. END ELssAXAXLoop;
  4748. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4749. BEGIN
  4750. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4751. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4752. RETURN RESULT
  4753. END ".<";
  4754. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4755. (** SHORTINT *)
  4756. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4757. VAR lval, rval: SHORTINT;
  4758. BEGIN
  4759. SYSTEM.GET( radr, rval );
  4760. WHILE (len > 0) DO
  4761. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4762. INC( dadr, dinc ); DEC( len );
  4763. END;
  4764. END ELssASSSLoop;
  4765. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4766. BEGIN
  4767. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4768. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4769. RETURN RESULT
  4770. END ".<";
  4771. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4772. BEGIN
  4773. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4774. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4775. RETURN RESULT
  4776. END ".>";
  4777. (** INTEGER *)
  4778. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4779. VAR lval, rval: INTEGER;
  4780. BEGIN
  4781. SYSTEM.GET( radr, rval );
  4782. WHILE (len > 0) DO
  4783. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4784. INC( dadr, dinc ); DEC( len );
  4785. END;
  4786. END ELssAISILoop;
  4787. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4788. BEGIN
  4789. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4790. SIZEOF( BOOLEAN ), ELssAISILoop );
  4791. RETURN RESULT
  4792. END ".<";
  4793. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4794. BEGIN
  4795. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4796. SIZEOF( BOOLEAN ), ELssAISILoop );
  4797. RETURN RESULT
  4798. END ".>";
  4799. (** LONGINT *)
  4800. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4801. VAR lval, rval: LONGINT;
  4802. BEGIN
  4803. SYSTEM.GET( radr, rval );
  4804. WHILE (len > 0) DO
  4805. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4806. INC( dadr, dinc ); DEC( len );
  4807. END;
  4808. END ELssALSLLoop;
  4809. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4810. BEGIN
  4811. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4812. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4813. RETURN RESULT
  4814. END ".<";
  4815. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4816. BEGIN
  4817. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4818. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4819. RETURN RESULT
  4820. END ".>";
  4821. (** REAL *)
  4822. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4823. VAR lval, rval: REAL;
  4824. BEGIN
  4825. SYSTEM.GET( radr, rval );
  4826. WHILE (len > 0) DO
  4827. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4828. INC( dadr, dinc ); DEC( len );
  4829. END;
  4830. END ELssARSRLoop;
  4831. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4832. BEGIN
  4833. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4834. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4835. RETURN RESULT
  4836. END ".<";
  4837. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4838. BEGIN
  4839. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4840. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4841. RETURN RESULT
  4842. END ".>";
  4843. (** LONGREAL *)
  4844. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4845. VAR lval, rval: LONGREAL;
  4846. BEGIN
  4847. SYSTEM.GET( radr, rval );
  4848. WHILE (len > 0) DO
  4849. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4850. INC( dadr, dinc ); DEC( len );
  4851. END;
  4852. END ELssAXSXLoop;
  4853. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4854. BEGIN
  4855. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4856. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4857. RETURN RESULT
  4858. END ".<";
  4859. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4860. BEGIN
  4861. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4862. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4863. RETURN RESULT
  4864. END ".>";
  4865. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4866. (** SHORTINT *)
  4867. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4868. VAR lval, rval: SHORTINT;
  4869. BEGIN
  4870. WHILE (len > 0) DO
  4871. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4872. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4873. END;
  4874. END ELeqASASLoop;
  4875. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4876. BEGIN
  4877. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4878. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4879. RETURN RESULT
  4880. END ".<=";
  4881. (** INTEGER *)
  4882. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4883. VAR lval, rval: INTEGER;
  4884. BEGIN
  4885. WHILE (len > 0) DO
  4886. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4887. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4888. END;
  4889. END ELeqAIAILoop;
  4890. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4891. BEGIN
  4892. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4893. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4894. RETURN RESULT
  4895. END ".<=";
  4896. (** LONGINT *)
  4897. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4898. VAR lval, rval: LONGINT;
  4899. BEGIN
  4900. WHILE (len > 0) DO
  4901. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4902. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4903. END;
  4904. END ELeqALALLoop;
  4905. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4906. BEGIN
  4907. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4908. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4909. RETURN RESULT
  4910. END ".<=";
  4911. (** REAL *)
  4912. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4913. VAR lval, rval: REAL;
  4914. BEGIN
  4915. WHILE (len > 0) DO
  4916. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4917. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4918. END;
  4919. END ELeqARARLoop;
  4920. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4921. BEGIN
  4922. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4923. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4924. RETURN RESULT
  4925. END ".<=";
  4926. (** LONGREAL*)
  4927. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4928. VAR lval, rval: LONGREAL;
  4929. BEGIN
  4930. WHILE (len > 0) DO
  4931. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4932. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4933. END;
  4934. END ELeqAXAXLoop;
  4935. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4936. BEGIN
  4937. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4938. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4939. RETURN RESULT
  4940. END ".<=";
  4941. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4942. (** SHORTINT *)
  4943. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4944. VAR lval, rval: SHORTINT;
  4945. BEGIN
  4946. SYSTEM.GET( radr, rval );
  4947. WHILE (len > 0) DO
  4948. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4949. INC( dadr, dinc ); DEC( len );
  4950. END;
  4951. END ELeqASSSLoop;
  4952. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4953. BEGIN
  4954. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4955. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4956. RETURN RESULT
  4957. END ".<=";
  4958. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4959. BEGIN
  4960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4961. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4962. RETURN RESULT
  4963. END ".>=";
  4964. (** INTEGER *)
  4965. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4966. VAR lval, rval: INTEGER;
  4967. BEGIN
  4968. SYSTEM.GET( radr, rval );
  4969. WHILE (len > 0) DO
  4970. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4971. INC( dadr, dinc ); DEC( len );
  4972. END;
  4973. END ELeqAISILoop;
  4974. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4975. BEGIN
  4976. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4977. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4978. RETURN RESULT
  4979. END ".<=";
  4980. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4981. BEGIN
  4982. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4983. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4984. RETURN RESULT
  4985. END ".>=";
  4986. (** LONGINT *)
  4987. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4988. VAR lval, rval: LONGINT;
  4989. BEGIN
  4990. SYSTEM.GET( radr, rval );
  4991. WHILE (len > 0) DO
  4992. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4993. INC( dadr, dinc ); DEC( len );
  4994. END;
  4995. END ELeqALSLLoop;
  4996. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4997. BEGIN
  4998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4999. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5000. RETURN RESULT
  5001. END ".<=";
  5002. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5003. BEGIN
  5004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5005. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5006. RETURN RESULT
  5007. END ".>=";
  5008. (** REAL *)
  5009. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5010. VAR lval, rval: REAL;
  5011. BEGIN
  5012. SYSTEM.GET( radr, rval );
  5013. WHILE (len > 0) DO
  5014. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5015. INC( dadr, dinc ); DEC( len );
  5016. END;
  5017. END ELeqARSRLoop;
  5018. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5019. BEGIN
  5020. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5021. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5022. RETURN RESULT
  5023. END ".<=";
  5024. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5025. BEGIN
  5026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5027. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5028. RETURN RESULT
  5029. END ".>=";
  5030. (** LONGREAL *)
  5031. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5032. VAR lval, rval: LONGREAL;
  5033. BEGIN
  5034. SYSTEM.GET( radr, rval );
  5035. WHILE (len > 0) DO
  5036. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5037. INC( dadr, dinc ); DEC( len );
  5038. END;
  5039. END ELeqAXSXLoop;
  5040. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5041. BEGIN
  5042. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5043. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5044. RETURN RESULT
  5045. END ".<=";
  5046. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5047. BEGIN
  5048. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5049. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5050. RETURN RESULT
  5051. END ".>=";
  5052. (*** elementwise or, elementwise and ********************************************************************)
  5053. (** array x array *)
  5054. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5055. VAR lval, rval: BOOLEAN;
  5056. BEGIN
  5057. WHILE (len > 0) DO
  5058. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5059. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5060. END;
  5061. END ElOrABABLoop;
  5062. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5063. BEGIN
  5064. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5065. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5066. RETURN RESULT
  5067. END "OR";
  5068. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5069. VAR lval, rval: BOOLEAN;
  5070. BEGIN
  5071. WHILE (len > 0) DO
  5072. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5073. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5074. END;
  5075. END ElAndABABLoop;
  5076. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5077. BEGIN
  5078. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5079. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5080. RETURN RESULT
  5081. END "&";
  5082. (** array x boolean *)
  5083. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5084. VAR lval, rval: BOOLEAN;
  5085. BEGIN
  5086. SYSTEM.GET( radr, rval );
  5087. WHILE (len > 0) DO
  5088. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5089. INC( dadr, dinc ); DEC( len );
  5090. END;
  5091. END ElOrABSBLoop;
  5092. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5093. BEGIN
  5094. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5095. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5096. RETURN RESULT
  5097. END "OR";
  5098. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5099. BEGIN
  5100. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5101. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5102. RETURN RESULT
  5103. END "OR";
  5104. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5105. VAR lval, rval: BOOLEAN;
  5106. BEGIN
  5107. SYSTEM.GET( radr, rval );
  5108. WHILE (len > 0) DO
  5109. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5110. INC( dadr, dinc ); DEC( len );
  5111. END;
  5112. END ElAndABSBLoop;
  5113. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5114. BEGIN
  5115. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5116. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5117. RETURN RESULT
  5118. END "&";
  5119. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5120. BEGIN
  5121. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5122. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5123. RETURN RESULT
  5124. END "&";
  5125. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5126. (** SHORTINT *)
  5127. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5128. VAR lval, rval: SHORTINT;
  5129. BEGIN
  5130. WHILE (len > 0) DO
  5131. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5132. IF rval <= lval THEN RETURN FALSE END;
  5133. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5134. END;
  5135. RETURN TRUE;
  5136. END LssASASLoop;
  5137. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5138. BEGIN
  5139. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5140. END "<";
  5141. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5142. VAR lval, rval: SHORTINT;
  5143. BEGIN
  5144. WHILE (len > 0) DO
  5145. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5146. IF rval > lval THEN RETURN FALSE END;
  5147. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5148. END;
  5149. RETURN TRUE;
  5150. END GeqASASLoop;
  5151. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5152. BEGIN
  5153. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5154. END ">=";
  5155. (** INTEGER *)
  5156. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5157. VAR lval, rval: INTEGER;
  5158. BEGIN
  5159. WHILE (len > 0) DO
  5160. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5161. IF rval <= lval THEN RETURN FALSE END;
  5162. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5163. END;
  5164. RETURN TRUE;
  5165. END LssAIAILoop;
  5166. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5167. BEGIN
  5168. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5169. END "<";
  5170. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5171. VAR lval, rval: INTEGER;
  5172. BEGIN
  5173. WHILE (len > 0) DO
  5174. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5175. IF rval > lval THEN RETURN FALSE END;
  5176. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5177. END;
  5178. RETURN TRUE;
  5179. END GeqAIAILoop;
  5180. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5181. BEGIN
  5182. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5183. END ">=";
  5184. (** LONGINT *)
  5185. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5186. VAR lval, rval: LONGINT;
  5187. BEGIN
  5188. WHILE (len > 0) DO
  5189. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5190. IF rval <= lval THEN RETURN FALSE END;
  5191. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5192. END;
  5193. RETURN TRUE;
  5194. END LssALALLoop;
  5195. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5196. BEGIN
  5197. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5198. END "<";
  5199. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5200. VAR lval, rval: LONGINT;
  5201. BEGIN
  5202. WHILE (len > 0) DO
  5203. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5204. IF rval > lval THEN RETURN FALSE END;
  5205. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5206. END;
  5207. RETURN TRUE;
  5208. END GeqALALLoop;
  5209. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5210. BEGIN
  5211. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5212. END ">=";
  5213. (** SIZE *)
  5214. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5215. VAR lval, rval: LONGINT;
  5216. BEGIN
  5217. WHILE (len > 0) DO
  5218. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5219. IF rval <= lval THEN RETURN FALSE END;
  5220. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5221. END;
  5222. RETURN TRUE;
  5223. END LssAZAZLoop;
  5224. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5225. BEGIN
  5226. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZAZLoop , FALSE);
  5227. END "<";
  5228. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5229. VAR lval, rval: SIZE;
  5230. BEGIN
  5231. WHILE (len > 0) DO
  5232. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5233. IF rval > lval THEN RETURN FALSE END;
  5234. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5235. END;
  5236. RETURN TRUE;
  5237. END GeqAZAZLoop;
  5238. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5239. BEGIN
  5240. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZAZLoop , FALSE);
  5241. END ">=";
  5242. (** REAL *)
  5243. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5244. VAR lval, rval: REAL;
  5245. BEGIN
  5246. WHILE (len > 0) DO
  5247. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5248. IF rval <= lval THEN RETURN FALSE END;
  5249. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5250. END;
  5251. RETURN TRUE;
  5252. END LssARARLoop;
  5253. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5254. BEGIN
  5255. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5256. END "<";
  5257. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5258. VAR lval, rval: REAL;
  5259. BEGIN
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5262. IF rval > lval THEN RETURN FALSE END;
  5263. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5264. END;
  5265. RETURN TRUE;
  5266. END GeqARARLoop;
  5267. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5268. BEGIN
  5269. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5270. END ">=";
  5271. (** LONGREAL *)
  5272. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5273. VAR lval, rval: LONGREAL;
  5274. BEGIN
  5275. WHILE (len > 0) DO
  5276. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5277. IF rval <= lval THEN RETURN FALSE END;
  5278. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5279. END;
  5280. RETURN TRUE;
  5281. END LssAXAXLoop;
  5282. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5283. BEGIN
  5284. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5285. END "<";
  5286. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5287. VAR lval, rval: LONGREAL;
  5288. BEGIN
  5289. WHILE (len > 0) DO
  5290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5291. IF rval > lval THEN RETURN FALSE END;
  5292. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5293. END;
  5294. RETURN TRUE;
  5295. END GeqAXAXLoop;
  5296. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5297. BEGIN
  5298. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5299. END ">=";
  5300. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5301. (** SHORTINT *)
  5302. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5303. VAR lval, rval: SHORTINT;
  5304. BEGIN
  5305. WHILE (len > 0) DO
  5306. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5307. IF rval >= lval THEN RETURN FALSE END;
  5308. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5309. END;
  5310. RETURN TRUE;
  5311. END GtrASASLoop;
  5312. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5313. BEGIN
  5314. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5315. END ">";
  5316. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5317. VAR lval, rval: SHORTINT;
  5318. BEGIN
  5319. WHILE (len > 0) DO
  5320. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5321. IF rval < lval THEN RETURN FALSE END;
  5322. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5323. END;
  5324. RETURN TRUE;
  5325. END LeqASASLoop;
  5326. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5327. BEGIN
  5328. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5329. END "<=";
  5330. (** INTEGER *)
  5331. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5332. VAR lval, rval: INTEGER;
  5333. BEGIN
  5334. WHILE (len > 0) DO
  5335. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5336. IF rval >= lval THEN RETURN FALSE END;
  5337. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5338. END;
  5339. RETURN TRUE;
  5340. END GtrAIAILoop;
  5341. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5342. BEGIN
  5343. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5344. END ">";
  5345. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5346. VAR lval, rval: INTEGER;
  5347. BEGIN
  5348. WHILE (len > 0) DO
  5349. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5350. IF rval < lval THEN RETURN FALSE END;
  5351. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5352. END;
  5353. RETURN TRUE;
  5354. END LeqAIAILoop;
  5355. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5356. BEGIN
  5357. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5358. END "<=";
  5359. (** LONGINT *)
  5360. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5361. VAR lval, rval: LONGINT;
  5362. BEGIN
  5363. WHILE (len > 0) DO
  5364. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5365. IF rval >= lval THEN RETURN FALSE END;
  5366. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5367. END;
  5368. RETURN TRUE;
  5369. END GtrALALLoop;
  5370. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5371. BEGIN
  5372. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5373. END ">";
  5374. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5375. VAR lval, rval: LONGINT;
  5376. BEGIN
  5377. WHILE (len > 0) DO
  5378. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5379. IF rval < lval THEN RETURN FALSE END;
  5380. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5381. END;
  5382. RETURN TRUE;
  5383. END LeqALALLoop;
  5384. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5385. BEGIN
  5386. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5387. END "<=";
  5388. (** SIZE *)
  5389. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5390. VAR lval, rval: SIZE;
  5391. BEGIN
  5392. WHILE (len > 0) DO
  5393. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5394. IF rval >= lval THEN RETURN FALSE END;
  5395. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5396. END;
  5397. RETURN TRUE;
  5398. END GtrAZAZLoop;
  5399. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5400. BEGIN
  5401. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZAZLoop , FALSE);
  5402. END ">";
  5403. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5404. VAR lval, rval: SIZE;
  5405. BEGIN
  5406. WHILE (len > 0) DO
  5407. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5408. IF rval < lval THEN RETURN FALSE END;
  5409. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5410. END;
  5411. RETURN TRUE;
  5412. END LeqAZAZLoop;
  5413. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5414. BEGIN
  5415. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZAZLoop , FALSE);
  5416. END "<=";
  5417. (** SIZE *)
  5418. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5419. VAR lval, rval: REAL;
  5420. BEGIN
  5421. WHILE (len > 0) DO
  5422. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5423. IF rval >= lval THEN RETURN FALSE END;
  5424. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5425. END;
  5426. RETURN TRUE;
  5427. END GtrARARLoop;
  5428. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5429. BEGIN
  5430. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5431. END ">";
  5432. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5433. VAR lval, rval: REAL;
  5434. BEGIN
  5435. WHILE (len > 0) DO
  5436. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5437. IF rval < lval THEN RETURN FALSE END;
  5438. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5439. END;
  5440. RETURN TRUE;
  5441. END LeqARARLoop;
  5442. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5443. BEGIN
  5444. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5445. END "<=";
  5446. (** LONGREAL *)
  5447. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5448. VAR lval, rval: LONGREAL;
  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 GtrAXAXLoop;
  5457. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5458. BEGIN
  5459. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5460. END ">";
  5461. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5462. VAR lval, rval: LONGREAL;
  5463. BEGIN
  5464. WHILE (len > 0) DO
  5465. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5466. IF rval < lval THEN RETURN FALSE END;
  5467. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5468. END;
  5469. RETURN TRUE;
  5470. END LeqAXAXLoop;
  5471. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5472. BEGIN
  5473. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5474. END "<=";
  5475. (*** equals: array x array -> boolean ********************************************************************)
  5476. (** BOOLEAN *)
  5477. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5478. VAR lval, rval: BOOLEAN;
  5479. BEGIN
  5480. WHILE (len > 0) DO
  5481. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5482. IF rval # lval THEN RETURN FALSE END;
  5483. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5484. END;
  5485. RETURN TRUE;
  5486. END EqlABABLoop;
  5487. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5488. BEGIN
  5489. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5490. END "=";
  5491. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5492. BEGIN
  5493. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5494. END "#";
  5495. (** SHORTINT *)
  5496. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5497. VAR lval, rval: SHORTINT;
  5498. BEGIN
  5499. WHILE (len > 0) DO
  5500. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5501. IF rval # lval THEN RETURN FALSE END;
  5502. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5503. END;
  5504. RETURN TRUE;
  5505. END EqlASASLoop;
  5506. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5507. BEGIN
  5508. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5509. END "=";
  5510. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5511. BEGIN
  5512. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5513. END "#";
  5514. (** INTEGER *)
  5515. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5516. VAR lval, rval: INTEGER;
  5517. BEGIN
  5518. WHILE (len > 0) DO
  5519. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5520. IF rval # lval THEN RETURN FALSE END;
  5521. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5522. END;
  5523. RETURN TRUE;
  5524. END EqlAIAILoop;
  5525. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5526. BEGIN
  5527. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5528. END "=";
  5529. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5530. BEGIN
  5531. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5532. END "#";
  5533. (** LONGINT *)
  5534. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5535. VAR lval, rval: LONGINT;
  5536. BEGIN
  5537. WHILE (len > 0) DO
  5538. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5539. IF rval # lval THEN RETURN FALSE END;
  5540. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5541. END;
  5542. RETURN TRUE;
  5543. END EqlALALLoop;
  5544. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5545. BEGIN
  5546. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5547. END "=";
  5548. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5549. BEGIN
  5550. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5551. END "#";
  5552. (** SIZE *)
  5553. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5554. VAR lval, rval: SIZE;
  5555. BEGIN
  5556. WHILE (len > 0) DO
  5557. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5558. IF rval # lval THEN RETURN FALSE END;
  5559. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5560. END;
  5561. RETURN TRUE;
  5562. END EqlAZAZLoop;
  5563. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5564. BEGIN
  5565. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5566. END "=";
  5567. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5568. BEGIN
  5569. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5570. END "#";
  5571. (** REAL *)
  5572. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5573. VAR lval, rval: REAL;
  5574. BEGIN
  5575. WHILE (len > 0) DO
  5576. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5577. IF rval # lval THEN RETURN FALSE END;
  5578. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5579. END;
  5580. RETURN TRUE;
  5581. END EqlARARLoop;
  5582. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5583. BEGIN
  5584. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5585. END "=";
  5586. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5587. BEGIN
  5588. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5589. END "#";
  5590. (** LONGREAL *)
  5591. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5592. VAR lval, rval: LONGREAL;
  5593. BEGIN
  5594. WHILE (len > 0) DO
  5595. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5596. IF rval # lval THEN RETURN FALSE END;
  5597. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5598. END;
  5599. RETURN TRUE;
  5600. END EqlAXAXLoop;
  5601. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5602. BEGIN
  5603. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5604. END "=";
  5605. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5606. BEGIN
  5607. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5608. END "#";
  5609. (** COMPLEX *)
  5610. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5611. VAR lval, rval: COMPLEX;
  5612. BEGIN
  5613. WHILE (len > 0) DO
  5614. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5615. IF rval # lval THEN RETURN FALSE END;
  5616. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5617. END;
  5618. RETURN TRUE;
  5619. END EqlACACLoop;
  5620. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5621. BEGIN
  5622. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5623. END "=";
  5624. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5625. BEGIN
  5626. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5627. END "#";
  5628. (** LONGCOMPLEX *)
  5629. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5630. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5631. BEGIN
  5632. WHILE (len > 0) DO
  5633. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5634. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5635. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5636. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5637. END;
  5638. RETURN TRUE;
  5639. END EqlALZALZLoop;
  5640. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5641. BEGIN
  5642. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5643. END "=";
  5644. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5645. BEGIN
  5646. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5647. END "#";
  5648. (*** equals: array x scalar -> boolean ********************************************************************)
  5649. (** BOOLEAN *)
  5650. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5651. VAR lval, rval: BOOLEAN;
  5652. BEGIN
  5653. SYSTEM.GET( radr, rval );
  5654. WHILE (len > 0) DO
  5655. SYSTEM.GET( ladr, lval );
  5656. IF lval # rval THEN RETURN FALSE END;
  5657. INC( ladr, linc ); DEC( len );
  5658. END;
  5659. RETURN TRUE;
  5660. END EqlABSBLoop;
  5661. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5662. right: BOOLEAN ): BOOLEAN;
  5663. BEGIN
  5664. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5665. END "=";
  5666. OPERATOR "="*( left: BOOLEAN;
  5667. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5668. BEGIN
  5669. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5670. END "=";
  5671. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5672. right: BOOLEAN ): BOOLEAN;
  5673. BEGIN
  5674. RETURN ~(left = right);
  5675. END "#";
  5676. OPERATOR "#"*( left: BOOLEAN;
  5677. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5678. BEGIN
  5679. RETURN ~( left = right );
  5680. END "#";
  5681. (** SHORTINT *)
  5682. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5683. VAR lval, rval: SHORTINT;
  5684. BEGIN
  5685. SYSTEM.GET( radr, rval );
  5686. WHILE (len > 0) DO
  5687. SYSTEM.GET( ladr, lval );
  5688. IF lval # rval THEN RETURN FALSE END;
  5689. INC( ladr, linc ); DEC( len );
  5690. END;
  5691. RETURN TRUE;
  5692. END EqlASSSLoop;
  5693. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5694. BEGIN
  5695. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5696. END "=";
  5697. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5698. BEGIN
  5699. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5700. END "=";
  5701. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5702. BEGIN
  5703. RETURN ~( left= right );
  5704. END "#";
  5705. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5706. BEGIN
  5707. RETURN ~( left= right );
  5708. END "#";
  5709. (** INTEGER *)
  5710. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5711. VAR lval, rval: INTEGER;
  5712. BEGIN
  5713. SYSTEM.GET( radr, rval );
  5714. WHILE (len > 0) DO
  5715. SYSTEM.GET( ladr, lval );
  5716. IF lval # rval THEN RETURN FALSE END;
  5717. INC( ladr, linc ); DEC( len );
  5718. END;
  5719. RETURN TRUE;
  5720. END EqlAISILoop;
  5721. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5722. BEGIN
  5723. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5724. END "=";
  5725. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5726. BEGIN
  5727. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5728. END "=";
  5729. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5730. BEGIN
  5731. RETURN ~( left = right );
  5732. END "#";
  5733. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5734. BEGIN
  5735. RETURN ~( left = right );
  5736. END "#";
  5737. (** LONGINT *)
  5738. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5739. VAR lval, rval: LONGINT;
  5740. BEGIN
  5741. SYSTEM.GET( radr, rval );
  5742. WHILE (len > 0) DO
  5743. SYSTEM.GET( ladr, lval );
  5744. IF lval # rval THEN RETURN FALSE END;
  5745. INC( ladr, linc ); DEC( len );
  5746. END;
  5747. RETURN TRUE;
  5748. END EqlALSLLoop;
  5749. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5750. right: LONGINT ): BOOLEAN;
  5751. BEGIN
  5752. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5753. END "=";
  5754. OPERATOR "="*( left: LONGINT;
  5755. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5756. BEGIN
  5757. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5758. END "=";
  5759. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5760. right: LONGINT ): BOOLEAN;
  5761. BEGIN
  5762. RETURN ~(left = right);
  5763. END "#";
  5764. OPERATOR "#"*( left: LONGINT;
  5765. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5766. BEGIN
  5767. RETURN ~(left = right);
  5768. END "#";
  5769. (** SIZE *)
  5770. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5771. VAR lval, rval: SIZE;
  5772. BEGIN
  5773. SYSTEM.GET( radr, rval );
  5774. WHILE (len > 0) DO
  5775. SYSTEM.GET( ladr, lval );
  5776. IF lval # rval THEN RETURN FALSE END;
  5777. INC( ladr, linc ); DEC( len );
  5778. END;
  5779. RETURN TRUE;
  5780. END EqlAZSZLoop;
  5781. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5782. right: SIZE ): BOOLEAN;
  5783. BEGIN
  5784. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZSZLoop );
  5785. END "=";
  5786. OPERATOR "="*( left: SIZE;
  5787. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5788. BEGIN
  5789. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5790. END "=";
  5791. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5792. right: SIZE ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ~(left = right);
  5795. END "#";
  5796. OPERATOR "#"*( left: SIZE;
  5797. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5798. BEGIN
  5799. RETURN ~(left = right);
  5800. END "#";
  5801. (** REAL *)
  5802. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5803. VAR lval, rval: REAL;
  5804. BEGIN
  5805. SYSTEM.GET( radr, rval );
  5806. WHILE (len > 0) DO
  5807. SYSTEM.GET( ladr, lval );
  5808. IF lval # rval THEN RETURN FALSE END;
  5809. INC( ladr, linc ); DEC( len );
  5810. END;
  5811. RETURN TRUE;
  5812. END EqlARSRLoop;
  5813. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5814. right: REAL ): BOOLEAN;
  5815. BEGIN
  5816. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5817. END "=";
  5818. OPERATOR "="*( left: REAL;
  5819. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5820. BEGIN
  5821. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5822. END "=";
  5823. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5824. right: REAL ): BOOLEAN;
  5825. BEGIN
  5826. RETURN ~( left = right );
  5827. END "#";
  5828. OPERATOR "#"*( left: REAL;
  5829. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ~( left = right );
  5832. END "#";
  5833. (** LONGREAL *)
  5834. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5835. VAR lval, rval: LONGREAL;
  5836. BEGIN
  5837. SYSTEM.GET( radr, rval );
  5838. WHILE (len > 0) DO
  5839. SYSTEM.GET( ladr, lval );
  5840. IF lval # rval THEN RETURN FALSE END;
  5841. INC( ladr, linc ); DEC( len );
  5842. END;
  5843. RETURN TRUE;
  5844. END EqlAXSXLoop;
  5845. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5846. right: LONGREAL ): BOOLEAN;
  5847. BEGIN
  5848. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5849. END "=";
  5850. OPERATOR "="*( left: LONGREAL;
  5851. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5852. BEGIN
  5853. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5854. END "=";
  5855. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5856. right: LONGREAL ): BOOLEAN;
  5857. BEGIN
  5858. RETURN ~( left = right );
  5859. END "#";
  5860. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5861. BEGIN
  5862. RETURN ~( left= right );
  5863. END "#";
  5864. (*** gtr : array x scalar -> boolean ********************************************************************)
  5865. (** SHORTINT *)
  5866. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5867. VAR lval, rval: SHORTINT;
  5868. BEGIN
  5869. SYSTEM.GET( radr, rval );
  5870. WHILE (len > 0) DO
  5871. SYSTEM.GET( ladr, lval );
  5872. IF lval <= rval THEN RETURN FALSE END;
  5873. INC( ladr, linc ); DEC( len );
  5874. END;
  5875. RETURN TRUE;
  5876. END GtrASSSLoop;
  5877. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5878. BEGIN
  5879. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5880. END ">";
  5881. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5882. BEGIN
  5883. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5884. END "<";
  5885. (** INTEGER *)
  5886. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5887. VAR lval, rval: INTEGER;
  5888. BEGIN
  5889. SYSTEM.GET( radr, rval );
  5890. WHILE (len > 0) DO
  5891. SYSTEM.GET( ladr, lval );
  5892. IF lval <= rval THEN RETURN FALSE END;
  5893. INC( ladr, linc ); DEC( len );
  5894. END;
  5895. RETURN TRUE;
  5896. END GtrAISILoop;
  5897. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5898. BEGIN
  5899. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5900. END ">";
  5901. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5902. BEGIN
  5903. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5904. END "<";
  5905. (** LONGINT *)
  5906. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5907. VAR lval, rval: LONGINT;
  5908. BEGIN
  5909. SYSTEM.GET( radr, rval );
  5910. WHILE (len > 0) DO
  5911. SYSTEM.GET( ladr, lval );
  5912. IF lval <= rval THEN RETURN FALSE END;
  5913. INC( ladr, linc ); DEC( len );
  5914. END;
  5915. RETURN TRUE;
  5916. END GtrALSLLoop;
  5917. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5918. BEGIN
  5919. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5920. END ">";
  5921. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5922. BEGIN
  5923. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5924. END "<";
  5925. (** SIZE *)
  5926. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5927. VAR lval, rval: SIZE;
  5928. BEGIN
  5929. SYSTEM.GET( radr, rval );
  5930. WHILE (len > 0) DO
  5931. SYSTEM.GET( ladr, lval );
  5932. IF lval <= rval THEN RETURN FALSE END;
  5933. INC( ladr, linc ); DEC( len );
  5934. END;
  5935. RETURN TRUE;
  5936. END GtrAZSZLoop;
  5937. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  5938. BEGIN
  5939. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZSZLoop );
  5940. END ">";
  5941. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5942. BEGIN
  5943. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAZSZLoop );
  5944. END "<";
  5945. (** REAL *)
  5946. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5947. VAR lval, rval: REAL;
  5948. BEGIN
  5949. SYSTEM.GET( radr, rval );
  5950. WHILE (len > 0) DO
  5951. SYSTEM.GET( ladr, lval );
  5952. IF lval <= rval THEN RETURN FALSE END;
  5953. INC( ladr, linc ); DEC( len );
  5954. END;
  5955. RETURN TRUE;
  5956. END GtrARSRLoop;
  5957. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5958. right: REAL ): BOOLEAN;
  5959. BEGIN
  5960. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5961. END ">";
  5962. OPERATOR "<"*( left: REAL;
  5963. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5964. BEGIN
  5965. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5966. END "<";
  5967. (** LONGREAL *)
  5968. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5969. VAR lval, rval: LONGREAL;
  5970. BEGIN
  5971. SYSTEM.GET( radr, rval );
  5972. WHILE (len > 0) DO
  5973. SYSTEM.GET( ladr, lval );
  5974. IF lval <= rval THEN RETURN FALSE END;
  5975. INC( ladr, linc ); DEC( len );
  5976. END;
  5977. RETURN TRUE;
  5978. END GtrAXSXLoop;
  5979. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5980. right: LONGREAL ): BOOLEAN;
  5981. BEGIN
  5982. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5983. END ">";
  5984. OPERATOR "<"*( left: LONGREAL;
  5985. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5986. BEGIN
  5987. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5988. END "<";
  5989. (*** geq : array x scalar -> boolean ********************************************************************)
  5990. (** SHORTINT *)
  5991. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5992. VAR lval, rval: SHORTINT;
  5993. BEGIN
  5994. SYSTEM.GET( radr, rval );
  5995. WHILE (len > 0) DO
  5996. SYSTEM.GET( ladr, lval );
  5997. IF lval < rval THEN RETURN FALSE END;
  5998. INC( ladr, linc ); DEC( len );
  5999. END;
  6000. RETURN TRUE;
  6001. END GeqASSSLoop;
  6002. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6003. right: SHORTINT ): BOOLEAN;
  6004. BEGIN
  6005. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  6006. END ">=";
  6007. OPERATOR "<="*( left: SHORTINT;
  6008. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6009. BEGIN
  6010. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  6011. END "<=";
  6012. (** INTEGER *)
  6013. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6014. VAR lval, rval: INTEGER;
  6015. BEGIN
  6016. SYSTEM.GET( radr, rval );
  6017. WHILE (len > 0) DO
  6018. SYSTEM.GET( ladr, lval );
  6019. IF lval < rval THEN RETURN FALSE END;
  6020. INC( ladr, linc ); DEC( len );
  6021. END;
  6022. RETURN TRUE;
  6023. END GeqAISILoop;
  6024. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6025. BEGIN
  6026. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  6027. END ">=";
  6028. OPERATOR "<="*( left: INTEGER;
  6029. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6030. BEGIN
  6031. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  6032. END "<=";
  6033. (** LONGINT *)
  6034. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6035. VAR lval, rval: LONGINT;
  6036. BEGIN
  6037. SYSTEM.GET( radr, rval );
  6038. WHILE (len > 0) DO
  6039. SYSTEM.GET( ladr, lval );
  6040. IF lval < rval THEN RETURN FALSE END;
  6041. INC( ladr, linc ); DEC( len );
  6042. END;
  6043. RETURN TRUE;
  6044. END GeqALSLLoop;
  6045. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6046. right: LONGINT ): BOOLEAN;
  6047. BEGIN
  6048. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  6049. END ">=";
  6050. OPERATOR "<="*( left: LONGINT;
  6051. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6052. BEGIN
  6053. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  6054. END "<=";
  6055. (** SIZE *)
  6056. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6057. VAR lval, rval: SIZE;
  6058. BEGIN
  6059. SYSTEM.GET( radr, rval );
  6060. WHILE (len > 0) DO
  6061. SYSTEM.GET( ladr, lval );
  6062. IF lval < rval THEN RETURN FALSE END;
  6063. INC( ladr, linc ); DEC( len );
  6064. END;
  6065. RETURN TRUE;
  6066. END GeqAZSZLoop;
  6067. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6068. right: SIZE ): BOOLEAN;
  6069. BEGIN
  6070. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZSZLoop );
  6071. END ">=";
  6072. OPERATOR "<="*( left:SIZE;
  6073. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6074. BEGIN
  6075. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAZSZLoop );
  6076. END "<=";
  6077. (** REAL *)
  6078. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6079. VAR lval, rval: REAL;
  6080. BEGIN
  6081. SYSTEM.GET( radr, rval );
  6082. WHILE (len > 0) DO
  6083. SYSTEM.GET( ladr, lval );
  6084. IF lval < rval THEN RETURN FALSE END;
  6085. INC( ladr, linc ); DEC( len );
  6086. END;
  6087. RETURN TRUE;
  6088. END GeqARSRLoop;
  6089. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6090. right: REAL ): BOOLEAN;
  6091. BEGIN
  6092. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  6093. END ">=";
  6094. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6095. BEGIN
  6096. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  6097. END "<=";
  6098. (** LONGREAL *)
  6099. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6100. VAR lval, rval: LONGREAL;
  6101. BEGIN
  6102. SYSTEM.GET( radr, rval );
  6103. WHILE (len > 0) DO
  6104. SYSTEM.GET( ladr, lval );
  6105. IF lval < rval THEN RETURN FALSE END;
  6106. INC( ladr, linc ); DEC( len );
  6107. END;
  6108. RETURN TRUE;
  6109. END GeqAXSXLoop;
  6110. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6111. BEGIN
  6112. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  6113. END ">=";
  6114. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6115. BEGIN
  6116. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  6117. END "<=";
  6118. (*** leq : array x scalar -> boolean ********************************************************************)
  6119. (** SHORTINT *)
  6120. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6121. VAR lval, rval: SHORTINT;
  6122. BEGIN
  6123. SYSTEM.GET( radr, rval );
  6124. WHILE (len > 0) DO
  6125. SYSTEM.GET( ladr, lval );
  6126. IF lval > rval THEN RETURN FALSE END;
  6127. INC( ladr, linc ); DEC( len );
  6128. END;
  6129. RETURN TRUE;
  6130. END LeqASSSLoop;
  6131. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6132. BEGIN
  6133. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6134. END "<=";
  6135. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6136. BEGIN
  6137. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6138. END ">=";
  6139. (** INTEGER *)
  6140. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6141. VAR lval, rval: INTEGER;
  6142. BEGIN
  6143. SYSTEM.GET( radr, rval );
  6144. WHILE (len > 0) DO
  6145. SYSTEM.GET( ladr, lval );
  6146. IF lval > rval THEN RETURN FALSE END;
  6147. INC( ladr, linc ); DEC( len );
  6148. END;
  6149. RETURN TRUE;
  6150. END LeqAISILoop;
  6151. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6152. BEGIN
  6153. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6154. END "<=";
  6155. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6156. BEGIN
  6157. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6158. END ">=";
  6159. (** LONGINT *)
  6160. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6161. VAR lval, rval: LONGINT;
  6162. BEGIN
  6163. SYSTEM.GET( radr, rval );
  6164. WHILE (len > 0) DO
  6165. SYSTEM.GET( ladr, lval );
  6166. IF lval > rval THEN RETURN FALSE END;
  6167. INC( ladr, linc ); DEC( len );
  6168. END;
  6169. RETURN TRUE;
  6170. END LeqALSLLoop;
  6171. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6172. BEGIN
  6173. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6174. END "<=";
  6175. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6176. BEGIN
  6177. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6178. END ">=";
  6179. (** SIZE *)
  6180. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6181. VAR lval, rval: SIZE;
  6182. BEGIN
  6183. SYSTEM.GET( radr, rval );
  6184. WHILE (len > 0) DO
  6185. SYSTEM.GET( ladr, lval );
  6186. IF lval > rval THEN RETURN FALSE END;
  6187. INC( ladr, linc ); DEC( len );
  6188. END;
  6189. RETURN TRUE;
  6190. END LeqAZSZLoop;
  6191. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6192. BEGIN
  6193. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZSZLoop );
  6194. END "<=";
  6195. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6196. BEGIN
  6197. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAZSZLoop );
  6198. END ">=";
  6199. (** REAL *)
  6200. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6201. VAR lval, rval: REAL;
  6202. BEGIN
  6203. SYSTEM.GET( radr, rval );
  6204. WHILE (len > 0) DO
  6205. SYSTEM.GET( ladr, lval );
  6206. IF lval > rval THEN RETURN FALSE END;
  6207. INC( ladr, linc ); DEC( len );
  6208. END;
  6209. RETURN TRUE;
  6210. END LeqARSRLoop;
  6211. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6212. BEGIN
  6213. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6214. END "<=";
  6215. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6216. BEGIN
  6217. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6218. END ">=";
  6219. (** LONGREAL *)
  6220. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6221. VAR lval, rval: LONGREAL;
  6222. BEGIN
  6223. SYSTEM.GET( radr, rval );
  6224. WHILE (len > 0) DO
  6225. SYSTEM.GET( ladr, lval );
  6226. IF lval > rval THEN RETURN FALSE END;
  6227. INC( ladr, linc ); DEC( len );
  6228. END;
  6229. RETURN TRUE;
  6230. END LeqAXSXLoop;
  6231. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6232. BEGIN
  6233. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6234. END "<=";
  6235. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6236. BEGIN
  6237. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6238. END ">=";
  6239. (*** lss: array x scalar -> boolean ********************************************************************)
  6240. (** SHORTINT *)
  6241. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6242. VAR lval, rval: SHORTINT;
  6243. BEGIN
  6244. SYSTEM.GET( radr, rval );
  6245. WHILE (len > 0) DO
  6246. SYSTEM.GET( ladr, lval );
  6247. IF lval >= rval THEN RETURN FALSE END;
  6248. INC( ladr, linc ); DEC( len );
  6249. END;
  6250. RETURN TRUE;
  6251. END LssASSSLoop;
  6252. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6253. BEGIN
  6254. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6255. END "<";
  6256. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6257. BEGIN
  6258. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6259. END ">";
  6260. (** INTEGER *)
  6261. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6262. VAR lval, rval: INTEGER;
  6263. BEGIN
  6264. SYSTEM.GET( radr, rval );
  6265. WHILE (len > 0) DO
  6266. SYSTEM.GET( ladr, lval );
  6267. IF lval >= rval THEN RETURN FALSE END;
  6268. INC( ladr, linc ); DEC( len );
  6269. END;
  6270. RETURN TRUE;
  6271. END LssAISILoop;
  6272. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6273. BEGIN
  6274. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6275. END "<";
  6276. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6277. BEGIN
  6278. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6279. END ">";
  6280. (** LONGINT *)
  6281. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6282. VAR lval, rval: LONGINT;
  6283. BEGIN
  6284. SYSTEM.GET( radr, rval );
  6285. WHILE (len > 0) DO
  6286. SYSTEM.GET( ladr, lval );
  6287. IF lval >= rval THEN RETURN FALSE END;
  6288. INC( ladr, linc ); DEC( len );
  6289. END;
  6290. RETURN TRUE;
  6291. END LssALSLLoop;
  6292. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6293. BEGIN
  6294. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6295. END "<";
  6296. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6297. BEGIN
  6298. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6299. END ">";
  6300. (** SIZE *)
  6301. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6302. VAR lval, rval: SIZE;
  6303. BEGIN
  6304. SYSTEM.GET( radr, rval );
  6305. WHILE (len > 0) DO
  6306. SYSTEM.GET( ladr, lval );
  6307. IF lval >= rval THEN RETURN FALSE END;
  6308. INC( ladr, linc ); DEC( len );
  6309. END;
  6310. RETURN TRUE;
  6311. END LssAZSZLoop;
  6312. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6313. BEGIN
  6314. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZSZLoop );
  6315. END "<";
  6316. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6317. BEGIN
  6318. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAZSZLoop );
  6319. END ">";
  6320. (** REAL *)
  6321. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6322. VAR lval, rval: REAL;
  6323. BEGIN
  6324. SYSTEM.GET( radr, rval );
  6325. WHILE (len > 0) DO
  6326. SYSTEM.GET( ladr, lval );
  6327. IF lval >= rval THEN RETURN FALSE END;
  6328. INC( ladr, linc ); DEC( len );
  6329. END;
  6330. RETURN TRUE;
  6331. END LssARSRLoop;
  6332. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6333. right: REAL ): BOOLEAN;
  6334. BEGIN
  6335. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6336. END "<";
  6337. OPERATOR ">"*( left: REAL;
  6338. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6339. BEGIN
  6340. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6341. END ">";
  6342. (** LONGREAL *)
  6343. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6344. VAR lval, rval: LONGREAL;
  6345. BEGIN
  6346. SYSTEM.GET( radr, rval );
  6347. WHILE (len > 0) DO
  6348. SYSTEM.GET( ladr, lval );
  6349. IF lval >= rval THEN RETURN FALSE END;
  6350. INC( ladr, linc ); DEC( len );
  6351. END;
  6352. RETURN TRUE;
  6353. END LssAXSXLoop;
  6354. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6355. right: LONGREAL ): BOOLEAN;
  6356. BEGIN
  6357. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6358. END "<";
  6359. OPERATOR ">"*( left: LONGREAL;
  6360. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6361. BEGIN
  6362. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6363. END ">";
  6364. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6365. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6366. VAR lval, val: LONGREAL;
  6367. BEGIN
  6368. SYSTEM.GET( radr, val );
  6369. WHILE (len > 0) DO
  6370. SYSTEM.GET( ladr, lval );
  6371. INC( ladr, linc ); DEC( len );
  6372. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6373. INC(dadr,dinc);
  6374. END;
  6375. END MaxAXSXLoop;
  6376. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6377. TYPE Type = LONGREAL;
  6378. BEGIN
  6379. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6380. RETURN RESULT
  6381. END "MAX";
  6382. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6383. VAR lval, val: REAL;
  6384. BEGIN
  6385. SYSTEM.GET( radr, val );
  6386. WHILE (len > 0) DO
  6387. SYSTEM.GET( ladr, lval );
  6388. INC( ladr, linc ); DEC( len );
  6389. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6390. INC(dadr,dinc);
  6391. END;
  6392. END MaxARSRLoop;
  6393. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6394. TYPE Type = REAL;
  6395. BEGIN
  6396. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6397. RETURN RESULT
  6398. END "MAX";
  6399. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6400. VAR lval, val: LONGINT;
  6401. BEGIN
  6402. SYSTEM.GET( radr, val );
  6403. WHILE (len > 0) DO
  6404. SYSTEM.GET( ladr, lval );
  6405. INC( ladr, linc ); DEC( len );
  6406. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6407. INC(dadr,dinc);
  6408. END;
  6409. END MaxALSLLoop;
  6410. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6411. TYPE Type = LONGINT;
  6412. BEGIN
  6413. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6414. RETURN RESULT
  6415. END "MAX";
  6416. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6417. VAR lval, val: INTEGER;
  6418. BEGIN
  6419. SYSTEM.GET( radr, val );
  6420. WHILE (len > 0) DO
  6421. SYSTEM.GET( ladr, lval );
  6422. INC( ladr, linc ); DEC( len );
  6423. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6424. INC(dadr,dinc);
  6425. END;
  6426. END MaxAISILoop;
  6427. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6428. TYPE Type = INTEGER;
  6429. BEGIN
  6430. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6431. RETURN RESULT
  6432. END "MAX";
  6433. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6434. VAR lval, val: SHORTINT;
  6435. BEGIN
  6436. SYSTEM.GET( radr, val );
  6437. WHILE (len > 0) DO
  6438. SYSTEM.GET( ladr, lval );
  6439. INC( ladr, linc ); DEC( len );
  6440. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6441. INC(dadr,dinc);
  6442. END;
  6443. END MaxASSSLoop;
  6444. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6445. TYPE Type = SHORTINT;
  6446. BEGIN
  6447. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6448. RETURN RESULT
  6449. END "MAX";
  6450. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6451. VAR lval, val: LONGREAL;
  6452. BEGIN
  6453. SYSTEM.GET( radr, val );
  6454. WHILE (len > 0) DO
  6455. SYSTEM.GET( ladr, lval );
  6456. INC( ladr, linc ); DEC( len );
  6457. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6458. INC(dadr,dinc);
  6459. END;
  6460. END MinAXSXLoop;
  6461. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6462. TYPE Type = LONGREAL;
  6463. BEGIN
  6464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6465. RETURN RESULT
  6466. END "MIN";
  6467. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6468. VAR lval, val: REAL;
  6469. BEGIN
  6470. SYSTEM.GET( radr, val );
  6471. WHILE (len > 0) DO
  6472. SYSTEM.GET( ladr, lval );
  6473. INC( ladr, linc ); DEC( len );
  6474. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6475. INC(dadr,dinc);
  6476. END;
  6477. END MinARSRLoop;
  6478. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6479. TYPE Type = REAL;
  6480. BEGIN
  6481. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6482. RETURN RESULT
  6483. END "MIN";
  6484. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6485. VAR lval, val: LONGINT;
  6486. BEGIN
  6487. SYSTEM.GET( radr, val );
  6488. WHILE (len > 0) DO
  6489. SYSTEM.GET( ladr, lval );
  6490. INC( ladr, linc ); DEC( len );
  6491. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6492. INC(dadr,dinc);
  6493. END;
  6494. END MinALSLLoop;
  6495. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6496. TYPE Type = LONGINT;
  6497. BEGIN
  6498. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6499. RETURN RESULT
  6500. END "MIN";
  6501. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6502. VAR lval, val: INTEGER;
  6503. BEGIN
  6504. SYSTEM.GET( radr, val );
  6505. WHILE (len > 0) DO
  6506. SYSTEM.GET( ladr, lval );
  6507. INC( ladr, linc ); DEC( len );
  6508. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6509. INC(dadr,dinc);
  6510. END;
  6511. END MinAISILoop;
  6512. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6513. TYPE Type = INTEGER;
  6514. BEGIN
  6515. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6516. RETURN RESULT
  6517. END "MIN";
  6518. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6519. VAR lval, val: SHORTINT;
  6520. BEGIN
  6521. SYSTEM.GET( radr, val );
  6522. WHILE (len > 0) DO
  6523. SYSTEM.GET( ladr, lval );
  6524. INC( ladr, linc ); DEC( len );
  6525. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6526. INC(dadr,dinc);
  6527. END;
  6528. END MinASSSLoop;
  6529. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6530. TYPE Type = SHORTINT;
  6531. BEGIN
  6532. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6533. RETURN RESULT
  6534. END "MIN";
  6535. (**** binary max/min operators array x array -> array ********************************************************************)
  6536. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6537. VAR lval, rval: LONGREAL;
  6538. BEGIN
  6539. WHILE (len > 0) DO
  6540. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6541. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6542. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6543. INC(dadr,dinc);
  6544. END;
  6545. END MaxAXAXLoop;
  6546. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6547. BEGIN
  6548. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6549. RETURN RESULT
  6550. END "MAX";
  6551. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6552. VAR lval, rval: REAL ;
  6553. BEGIN
  6554. WHILE (len > 0) DO
  6555. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6556. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6557. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6558. INC(dadr,dinc);
  6559. END;
  6560. END MaxARARLoop;
  6561. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6562. BEGIN
  6563. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6564. RETURN RESULT
  6565. END "MAX";
  6566. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6567. VAR lval, rval: LONGINT;
  6568. BEGIN
  6569. WHILE (len > 0) DO
  6570. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6571. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6572. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6573. INC(dadr,dinc);
  6574. END;
  6575. END MaxALALLoop;
  6576. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6577. BEGIN
  6578. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6579. RETURN RESULT
  6580. END "MAX";
  6581. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6582. VAR lval, rval: INTEGER;
  6583. BEGIN
  6584. WHILE (len > 0) DO
  6585. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6586. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6587. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6588. INC(dadr,dinc);
  6589. END;
  6590. END MaxAIAILoop;
  6591. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6592. BEGIN
  6593. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6594. RETURN RESULT
  6595. END "MAX";
  6596. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6597. VAR lval, rval: SHORTINT;
  6598. BEGIN
  6599. WHILE (len > 0) DO
  6600. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6601. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6602. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6603. INC(dadr,dinc);
  6604. END;
  6605. END MaxASASLoop;
  6606. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6607. BEGIN
  6608. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6609. RETURN RESULT
  6610. END "MAX";
  6611. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6612. VAR lval, rval: LONGREAL;
  6613. BEGIN
  6614. WHILE (len > 0) DO
  6615. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6616. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6617. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6618. INC(dadr,dinc);
  6619. END;
  6620. END MinAXAXLoop;
  6621. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6622. BEGIN
  6623. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6624. RETURN RESULT
  6625. END "MIN";
  6626. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6627. VAR lval, rval: REAL ;
  6628. BEGIN
  6629. WHILE (len > 0) DO
  6630. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6631. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6632. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6633. INC(dadr,dinc);
  6634. END;
  6635. END MinARARLoop;
  6636. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6637. BEGIN
  6638. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6639. RETURN RESULT
  6640. END "MIN";
  6641. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6642. VAR lval, rval: LONGINT;
  6643. BEGIN
  6644. WHILE (len > 0) DO
  6645. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6646. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6647. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6648. INC(dadr,dinc);
  6649. END;
  6650. END MinALALLoop;
  6651. *)
  6652. TYPE
  6653. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6654. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6655. BEGIN
  6656. WHILE (len > 0) DO
  6657. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6658. ladr := ladr + linc;
  6659. radr := radr + rinc;
  6660. dadr := dadr + dinc;
  6661. DEC(len);
  6662. END;
  6663. END MinALALLoop;
  6664. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6665. BEGIN
  6666. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6667. RETURN RESULT
  6668. END "MIN";
  6669. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6670. VAR lval, rval: INTEGER;
  6671. BEGIN
  6672. WHILE (len > 0) DO
  6673. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6674. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6675. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6676. INC(dadr,dinc);
  6677. END;
  6678. END MinAIAILoop;
  6679. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6680. BEGIN
  6681. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6682. RETURN RESULT
  6683. END "MIN";
  6684. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6685. VAR lval, rval: SHORTINT;
  6686. BEGIN
  6687. WHILE (len > 0) DO
  6688. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6689. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6690. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6691. INC(dadr,dinc);
  6692. END;
  6693. END MinASASLoop;
  6694. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6695. BEGIN
  6696. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6697. RETURN RESULT
  6698. END "MIN";
  6699. (**** unary operators array -> scalar ********************************************************************)
  6700. (*** min: array -> scalar ****************************************)
  6701. (** SHORTINT *)
  6702. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6703. VAR lval, dval: SHORTINT;
  6704. BEGIN
  6705. SYSTEM.GET( dadr, dval );
  6706. WHILE (len > 0) DO
  6707. SYSTEM.GET( ladr, lval );
  6708. IF lval < dval THEN dval := lval END;
  6709. INC( ladr, linc ); DEC( len );
  6710. END;
  6711. SYSTEM.PUT( dadr, dval );
  6712. END MinASLoop;
  6713. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6714. TYPE Type = SHORTINT;
  6715. VAR val: Type;
  6716. BEGIN
  6717. val := MAX( Type );
  6718. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6719. END "MIN";
  6720. (** INTEGER *)
  6721. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6722. VAR lval, dval: INTEGER;
  6723. BEGIN
  6724. SYSTEM.GET( dadr, dval );
  6725. WHILE (len > 0) DO
  6726. SYSTEM.GET( ladr, lval );
  6727. IF lval < dval THEN dval := lval END;
  6728. INC( ladr, linc ); DEC( len );
  6729. END;
  6730. SYSTEM.PUT( dadr, dval );
  6731. END MinAILoop;
  6732. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6733. TYPE Type = INTEGER;
  6734. VAR val: Type;
  6735. BEGIN
  6736. val := MAX( Type );
  6737. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6738. END "MIN";
  6739. (** LONGINT *)
  6740. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6741. VAR lval, dval: LONGINT;
  6742. BEGIN
  6743. SYSTEM.GET( dadr, dval );
  6744. WHILE (len > 0) DO
  6745. SYSTEM.GET( ladr, lval );
  6746. IF lval < dval THEN dval := lval END;
  6747. INC( ladr, linc ); DEC( len );
  6748. END;
  6749. SYSTEM.PUT( dadr, dval );
  6750. END MinALLoop;
  6751. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6752. TYPE Type = LONGINT;
  6753. VAR val: Type;
  6754. BEGIN
  6755. val := MAX( Type );
  6756. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6757. END "MIN";
  6758. (** SIZE *)
  6759. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6760. VAR lval, dval: SIZE;
  6761. BEGIN
  6762. SYSTEM.GET( dadr, dval );
  6763. WHILE (len > 0) DO
  6764. SYSTEM.GET( ladr, lval );
  6765. IF lval < dval THEN dval := lval END;
  6766. INC( ladr, linc ); DEC( len );
  6767. END;
  6768. SYSTEM.PUT( dadr, dval );
  6769. END MinAZLoop;
  6770. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6771. TYPE Type = SIZE;
  6772. VAR val: Type;
  6773. BEGIN
  6774. val := MAX( Type );
  6775. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAZLoop ); RETURN val;
  6776. END "MIN";
  6777. (** REAL *)
  6778. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6779. VAR lval, dval: REAL;
  6780. BEGIN
  6781. SYSTEM.GET( dadr, dval );
  6782. WHILE (len > 0) DO
  6783. SYSTEM.GET( ladr, lval );
  6784. IF lval < dval THEN dval := lval END;
  6785. INC( ladr, linc ); DEC( len );
  6786. END;
  6787. SYSTEM.PUT( dadr, dval );
  6788. END MinARLoop;
  6789. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6790. TYPE Type = REAL;
  6791. VAR val: Type;
  6792. BEGIN
  6793. val := MAX( Type );
  6794. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6795. END "MIN";
  6796. (** LONGREAL *)
  6797. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6798. VAR lval, dval: LONGREAL;
  6799. BEGIN
  6800. SYSTEM.GET( dadr, dval );
  6801. WHILE (len > 0) DO
  6802. SYSTEM.GET( ladr, lval );
  6803. IF lval < dval THEN dval := lval END;
  6804. INC( ladr, linc ); DEC( len );
  6805. END;
  6806. SYSTEM.PUT( dadr, dval );
  6807. END MinAXLoop;
  6808. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6809. TYPE Type = LONGREAL;
  6810. VAR val: Type;
  6811. BEGIN
  6812. val := MAX( Type );
  6813. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6814. END "MIN";
  6815. (*** max: array -> scalar ********************************************************************)
  6816. (** SHORTINT *)
  6817. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6818. VAR lval, dval: SHORTINT;
  6819. BEGIN
  6820. SYSTEM.GET( dadr, dval );
  6821. WHILE (len > 0) DO
  6822. SYSTEM.GET( ladr, lval );
  6823. IF lval > dval THEN dval := lval END;
  6824. INC( ladr, linc ); DEC( len );
  6825. END;
  6826. SYSTEM.PUT( dadr, dval );
  6827. END MaxASLoop;
  6828. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6829. TYPE Type = SHORTINT;
  6830. VAR val: Type;
  6831. BEGIN
  6832. val := MIN( Type );
  6833. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6834. END "MAX";
  6835. (** INTEGER *)
  6836. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6837. VAR lval, dval: INTEGER;
  6838. BEGIN
  6839. SYSTEM.GET( dadr, dval );
  6840. WHILE (len > 0) DO
  6841. SYSTEM.GET( ladr, lval );
  6842. IF lval > dval THEN dval := lval END;
  6843. INC( ladr, linc ); DEC( len );
  6844. END;
  6845. SYSTEM.PUT( dadr, dval );
  6846. END MaxAILoop;
  6847. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6848. TYPE Type = INTEGER;
  6849. VAR val: Type;
  6850. BEGIN
  6851. val := MIN( Type );
  6852. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6853. END "MAX";
  6854. (** LONGINT *)
  6855. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6856. VAR lval, dval: LONGINT;
  6857. BEGIN
  6858. SYSTEM.GET( dadr, dval );
  6859. WHILE (len > 0) DO
  6860. SYSTEM.GET( ladr, lval );
  6861. IF lval > dval THEN dval := lval END;
  6862. INC( ladr, linc ); DEC( len );
  6863. END;
  6864. SYSTEM.PUT( dadr, dval );
  6865. END MaxALLoop;
  6866. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6867. TYPE Type = LONGINT;
  6868. VAR val: Type;
  6869. BEGIN
  6870. val := MIN( Type );
  6871. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6872. END "MAX";
  6873. (** REAL *)
  6874. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6875. VAR lval, dval: REAL;
  6876. BEGIN
  6877. SYSTEM.GET( dadr, dval );
  6878. WHILE (len > 0) DO
  6879. SYSTEM.GET( ladr, lval );
  6880. IF lval > dval THEN dval := lval END;
  6881. INC( ladr, linc ); DEC( len );
  6882. END;
  6883. SYSTEM.PUT( dadr, dval );
  6884. END MaxARLoop;
  6885. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6886. TYPE Type = REAL;
  6887. VAR val: Type;
  6888. BEGIN
  6889. val := MIN( Type );
  6890. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6891. END "MAX";
  6892. (** LONGREAL *)
  6893. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6894. VAR lval, dval: LONGREAL;
  6895. BEGIN
  6896. SYSTEM.GET( dadr, dval );
  6897. WHILE (len > 0) DO
  6898. SYSTEM.GET( ladr, lval );
  6899. IF lval > dval THEN dval := lval END;
  6900. INC( ladr, linc ); DEC( len );
  6901. END;
  6902. SYSTEM.PUT( dadr, dval );
  6903. END MaxAXLoop;
  6904. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6905. TYPE Type = LONGREAL;
  6906. VAR val: Type;
  6907. BEGIN
  6908. val := MIN( Type );
  6909. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6910. END "MAX";
  6911. (*** LEN: array -> array **)
  6912. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  6913. VAR src: ADDRESS; dim,i: SIZE;
  6914. BEGIN
  6915. src := SYSTEM.VAL(ADDRESS,left);
  6916. dim := GetDim( src );
  6917. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6918. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6919. RETURN RESULT
  6920. END "LEN";
  6921. (*** SUM: array -> scalar ********************************************************************)
  6922. (** SHORTINT *)
  6923. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6924. VAR lval, dval: SHORTINT;
  6925. BEGIN
  6926. SYSTEM.GET( dadr, dval );
  6927. WHILE (len > 0) DO
  6928. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6929. END;
  6930. SYSTEM.PUT( dadr, dval );
  6931. END SumASLoop;
  6932. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6933. TYPE Type = SHORTINT;
  6934. VAR val: Type;
  6935. BEGIN
  6936. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6937. RETURN val;
  6938. END "SUM";
  6939. (** INTEGER *)
  6940. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6941. VAR lval, dval: INTEGER;
  6942. BEGIN
  6943. SYSTEM.GET( dadr, dval );
  6944. WHILE (len > 0) DO
  6945. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6946. END;
  6947. SYSTEM.PUT( dadr, dval );
  6948. END SumAILoop;
  6949. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6950. TYPE Type = INTEGER;
  6951. VAR val: Type;
  6952. BEGIN
  6953. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6954. RETURN val;
  6955. END "SUM";
  6956. (** LONGINT *)
  6957. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6958. VAR lval, dval: LONGINT;
  6959. BEGIN
  6960. SYSTEM.GET( dadr, dval );
  6961. WHILE (len > 0) DO
  6962. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6963. END;
  6964. SYSTEM.PUT( dadr, dval );
  6965. END SumALLoop;
  6966. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6967. TYPE Type = LONGINT;
  6968. VAR val: Type;
  6969. BEGIN
  6970. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6971. RETURN val;
  6972. END "SUM";
  6973. (** REAL *)
  6974. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6975. VAR lval, dval: REAL;
  6976. BEGIN
  6977. SYSTEM.GET( dadr, dval );
  6978. WHILE (len > 0) DO
  6979. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6980. END;
  6981. SYSTEM.PUT( dadr, dval );
  6982. END SumARLoop;
  6983. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6984. TYPE Type = REAL;
  6985. VAR val: Type;
  6986. BEGIN
  6987. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6988. RETURN val;
  6989. END "SUM";
  6990. (** LONGREAL *)
  6991. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6992. VAR lval, dval: LONGREAL;
  6993. BEGIN
  6994. SYSTEM.GET( dadr, dval );
  6995. WHILE (len > 0) DO
  6996. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6997. END;
  6998. SYSTEM.PUT( dadr, dval );
  6999. END SumAXLoop;
  7000. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7001. TYPE Type = LONGREAL;
  7002. VAR val: Type;
  7003. BEGIN
  7004. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  7005. RETURN val;
  7006. END "SUM";
  7007. (** COMPLEX *)
  7008. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7009. VAR lval, dval: COMPLEX;
  7010. BEGIN
  7011. SYSTEM.GET( dadr, dval );
  7012. WHILE (len > 0) DO
  7013. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7014. END;
  7015. SYSTEM.PUT( dadr, dval );
  7016. END SumAZLoop;
  7017. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7018. TYPE Type = COMPLEX;
  7019. VAR val: Type;
  7020. BEGIN
  7021. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  7022. RETURN val;
  7023. END "SUM";
  7024. (** LONGCOMPLEX *)
  7025. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7026. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7027. BEGIN
  7028. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7029. WHILE (len > 0) DO
  7030. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7031. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7032. INC( ladr, linc ); DEC( len );
  7033. END;
  7034. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7035. END SumALZLoop;
  7036. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7037. TYPE Type = LONGCOMPLEX;
  7038. VAR val: Type;
  7039. BEGIN
  7040. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  7041. RETURN val;
  7042. END "SUM";
  7043. (*** monadic ABS array -> array ********************************************************************)
  7044. (** SHORTINT *)
  7045. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7046. VAR lval: SHORTINT;
  7047. BEGIN
  7048. WHILE (len > 0) DO
  7049. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7050. INC( dadr, dinc ); DEC( len );
  7051. END;
  7052. END AbsLoopS;
  7053. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  7054. BEGIN
  7055. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  7056. RETURN RESULT
  7057. END "ABS";
  7058. (** INTEGER *)
  7059. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7060. VAR lval: INTEGER;
  7061. BEGIN
  7062. WHILE (len > 0) DO
  7063. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7064. INC( dadr, dinc ); DEC( len );
  7065. END;
  7066. END AbsLoopI;
  7067. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  7068. BEGIN
  7069. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  7070. RETURN RESULT
  7071. END "ABS";
  7072. (** LONGINT *)
  7073. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7074. VAR lval: LONGINT;
  7075. BEGIN
  7076. WHILE (len > 0) DO
  7077. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7078. INC( dadr, dinc ); DEC( len );
  7079. END;
  7080. END AbsLoopL;
  7081. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  7082. BEGIN
  7083. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  7084. RETURN RESULT
  7085. END "ABS";
  7086. (** REAL *)
  7087. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7088. VAR lval: REAL;
  7089. BEGIN
  7090. WHILE (len > 0) DO
  7091. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7092. INC( dadr, dinc ); DEC( len );
  7093. END;
  7094. END AbsLoopR;
  7095. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  7096. BEGIN
  7097. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  7098. RETURN RESULT
  7099. END "ABS";
  7100. (** LONGREAL *)
  7101. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7102. VAR lval: LONGREAL;
  7103. BEGIN
  7104. WHILE (len > 0) DO
  7105. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7106. INC( dadr, dinc ); DEC( len );
  7107. END;
  7108. END AbsLoopX;
  7109. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  7110. BEGIN
  7111. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  7112. RETURN RESULT
  7113. END "ABS";
  7114. (** COMPLEX *)
  7115. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7116. VAR lval: COMPLEX;
  7117. BEGIN
  7118. WHILE (len > 0) DO
  7119. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7120. INC( dadr, dinc ); DEC( len );
  7121. END;
  7122. END AbsLoopZ;
  7123. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  7124. BEGIN
  7125. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  7126. RETURN RESULT
  7127. END "ABS";
  7128. (** LONGCOMPLEX *)
  7129. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7130. VAR lvalRe, lvalIm: LONGREAL;
  7131. BEGIN
  7132. WHILE (len > 0) DO
  7133. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7134. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7135. INC( ladr, linc );
  7136. INC( dadr, dinc ); DEC( len );
  7137. END;
  7138. END AbsLoopLZ;
  7139. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  7140. BEGIN
  7141. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  7142. RETURN RESULT
  7143. END "ABS";
  7144. (*** assign number to array (initialisation) ********************************************************************)
  7145. (** BOOLEAN *)
  7146. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7147. VAR lval: BOOLEAN;
  7148. BEGIN
  7149. SYSTEM.GET( ladr, lval );
  7150. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7151. END AssignSBABLoop;
  7152. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  7153. BEGIN
  7154. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  7155. END ":=";
  7156. (** SHORTINT*)
  7157. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7158. VAR lval: SHORTINT;
  7159. BEGIN
  7160. SYSTEM.GET( ladr, lval );
  7161. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7162. END AssignSSASLoop;
  7163. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  7164. BEGIN
  7165. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  7166. END ":=";
  7167. (**INTEGER *)
  7168. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7169. VAR lval: INTEGER;
  7170. BEGIN
  7171. SYSTEM.GET( ladr, lval );
  7172. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7173. END AssignSIAILoop;
  7174. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  7175. BEGIN
  7176. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  7177. END ":=";
  7178. (** LONGINT *)
  7179. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7180. VAR lval: LONGINT;
  7181. BEGIN
  7182. SYSTEM.GET( ladr, lval );
  7183. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7184. END AssignSLALLoop;
  7185. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  7186. BEGIN
  7187. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  7188. END ":=";
  7189. (** REAL *)
  7190. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7191. VAR lval: REAL;
  7192. BEGIN
  7193. SYSTEM.GET( ladr, lval );
  7194. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7195. END AssignSRARLoop;
  7196. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  7197. BEGIN
  7198. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  7199. END ":=";
  7200. (** LONGREAL *)
  7201. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7202. VAR lval: LONGREAL;
  7203. BEGIN
  7204. SYSTEM.GET( ladr, lval );
  7205. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7206. END AssignSXAXLoop;
  7207. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7208. BEGIN
  7209. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7210. END ":=";
  7211. (** COMPLEX *)
  7212. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7213. VAR lval: COMPLEX;
  7214. BEGIN
  7215. SYSTEM.GET( ladr, lval );
  7216. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7217. END AssignSZAZLoop;
  7218. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7219. BEGIN
  7220. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7221. END ":=";
  7222. (** LONGCOMPLEX *)
  7223. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7224. VAR lvalRe, lvalIm: LONGREAL;
  7225. BEGIN
  7226. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7227. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7228. END AssignSLZALZLoop;
  7229. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7230. BEGIN
  7231. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7232. END ":=";
  7233. (*** matrix multipliation ********************************************************************)
  7234. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7235. rows, cols, elementsize: SIZE ): ANY;
  7236. VAR p: ANY;
  7237. BEGIN
  7238. (*
  7239. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7240. *)
  7241. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7242. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7243. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7244. PutPtr( dest, p); RETURN p;
  7245. END AllocateMatrix;
  7246. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7247. VAR p: ANY;
  7248. BEGIN
  7249. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7250. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7251. PutPtr( dest, p ); RETURN p;
  7252. END AllocateVector;
  7253. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7254. loop: BinaryAASLoop;
  7255. fast: FastMatMul ); (* Size= element-size *)
  7256. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7257. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7258. BEGIN
  7259. (*
  7260. <- 1 ->
  7261. xxx xxxx -> xxxx
  7262. ^ xxx xxxx xxxx
  7263. 0 xxx xxxx xxxx
  7264. v xxx xxxx
  7265. xxx xxxx
  7266. Len(..,1): #columns ; Inc(..,1): inc in rows
  7267. Len(..,0): #rows ; Inc(..,0): inc between rows
  7268. *)
  7269. (* apply multiplication D = L * R *)
  7270. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7271. colsL := GetLen( left, 1 ); (* # left columns *)
  7272. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7273. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7274. (* check geometric restriction *)
  7275. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7276. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7277. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7278. IF RangeFlag IN GetFlags( dest ) THEN
  7279. Halt( GeometryMismatch, left, right, dest )
  7280. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7281. END;
  7282. END;
  7283. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7284. IF overlap THEN
  7285. destOld := dest; destNew := 0;
  7286. p := AllocateSame( destNew, destOld, Size );
  7287. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7288. dest := destNew;
  7289. END;
  7290. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7291. HALT( 9999 )
  7292. END;
  7293. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7294. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7295. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7296. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7297. (*
  7298. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7299. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7300. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7301. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7302. *)
  7303. IF rowsL = 0 THEN RETURN
  7304. ELSIF colsL=0 THEN RETURN
  7305. ELSIF colsR=0 THEN RETURN
  7306. ELSIF (fast = NIL ) OR
  7307. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7308. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7309. radri := radr; dadri := dadr; colsRi := colsR;
  7310. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7311. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7312. INC( dadri, incD ); DEC( colsRi );
  7313. END;
  7314. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7315. END;
  7316. END;
  7317. IF overlap THEN CopyContent( destOld, dest, Size );
  7318. END;
  7319. END ApplyMatMulLoop;
  7320. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7321. Size: SIZE; loop: BinaryAASLoop;
  7322. fast: FastMatMul ); (* Size= element-size *)
  7323. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7324. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7325. BEGIN
  7326. (*
  7327. <- 0 ->
  7328. xxx T(xxx) -> T(xxxxx)
  7329. xxx
  7330. 1 xxx
  7331. xxx
  7332. xxx
  7333. Len(..,0): #columns ; Inc(..,0): inc in rows
  7334. Len(..,1): #rows ; Inc(..,1): inc between rows
  7335. *)
  7336. (* check geometric restriction *)
  7337. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7338. Halt( GeometryMismatch, left, right,0 );
  7339. END;
  7340. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7341. l2 := GetLen( left, 1 ); (* inner loop len *)
  7342. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7343. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7344. IF RangeFlag IN GetFlags( dest ) THEN
  7345. Halt( GeometryMismatch, left, right, dest );
  7346. ELSE p := AllocateVector( dest, l1, Size );
  7347. END;
  7348. END;
  7349. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7350. IF overlap THEN
  7351. destOld := dest; destNew := 0;
  7352. p := AllocateSame( destNew, destOld, Size );
  7353. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7354. dest := destNew;
  7355. END;
  7356. (*
  7357. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7358. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7359. END;
  7360. *)
  7361. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7362. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7363. di0 := GetIncr( dest, 0 );
  7364. IF l1=0 THEN RETURN
  7365. ELSIF l2=0 THEN RETURN
  7366. ELSIF (fast = NIL ) OR
  7367. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7368. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7369. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7370. DEC( l1 );
  7371. END;
  7372. END;
  7373. IF overlap THEN CopyContent( destOld, dest, Size );
  7374. END;
  7375. END ApplyMatVecMulLoop;
  7376. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7377. Size: SIZE; loop: BinaryAASLoop;
  7378. fast: FastMatMul ); (* Size= element-size *)
  7379. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7380. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7381. BEGIN
  7382. (*
  7383. <- 0 ->
  7384. xxx xxxx -> xxxx
  7385. xxxx
  7386. 1 xxxx
  7387. Len(..,0): #columns ; Inc(..,0): inc in rows
  7388. Len(..,1): #rows ; Inc(..,1): inc between rows
  7389. *)
  7390. (* check geometric restriction *)
  7391. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7392. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7393. l2 := GetLen( right, 0 ); (* inner loop len *)
  7394. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7395. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7396. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7397. ELSE p := AllocateVector( dest, l0, Size );
  7398. END;
  7399. END;
  7400. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7401. IF overlap THEN
  7402. destOld := dest; destNew := 0;
  7403. p := AllocateSame( destNew, destOld, Size );
  7404. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7405. dest := destNew;
  7406. END;
  7407. (*
  7408. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7409. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7410. END;
  7411. *)
  7412. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7413. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7414. di0 := GetIncr( dest, 0 );
  7415. IF l2=0 THEN RETURN
  7416. ELSIF l0=0 THEN RETURN
  7417. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7418. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7419. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7420. DEC( l0 );
  7421. END;
  7422. END;
  7423. IF overlap THEN CopyContent( destOld, dest, Size );
  7424. END;
  7425. END ApplyVecMatMulLoop;
  7426. (** SHORTINT *)
  7427. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7428. VAR lval, rval, dval: SHORTINT;
  7429. BEGIN
  7430. dval := 0;
  7431. WHILE (len > 0) DO
  7432. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7433. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7434. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7435. END;
  7436. SYSTEM.PUT( dadr, dval );
  7437. END MatMulASASLoop;
  7438. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7439. BEGIN
  7440. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7441. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7442. RETURN RESULT
  7443. END "*";
  7444. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7445. BEGIN
  7446. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7447. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7448. RETURN RESULT
  7449. END "*";
  7450. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7451. BEGIN
  7452. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7453. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7454. RETURN RESULT
  7455. END "*";
  7456. (** INTEGER *)
  7457. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7458. VAR lval, rval, dval: INTEGER;
  7459. BEGIN
  7460. dval := 0;
  7461. WHILE (len > 0) DO
  7462. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7463. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7464. END;
  7465. SYSTEM.PUT( dadr, dval );
  7466. END MatMulAIAILoop;
  7467. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7468. BEGIN
  7469. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7470. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7471. RETURN RESULT
  7472. END "*";
  7473. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7474. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7475. BEGIN
  7476. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7477. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7478. RETURN RESULT
  7479. END "*";
  7480. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7481. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7482. BEGIN
  7483. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7484. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7485. RETURN RESULT
  7486. END "*";
  7487. (** LONGINT *)
  7488. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7489. VAR lval, rval, dval: LONGINT;
  7490. BEGIN
  7491. dval := 0;
  7492. WHILE (len > 0) DO
  7493. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7494. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7495. END;
  7496. SYSTEM.PUT( dadr, dval );
  7497. END MatMulALALLoop;
  7498. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7499. BEGIN
  7500. (*
  7501. KernelLog.String("MatMulALAL");
  7502. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7503. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7504. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7505. KernelLog.Ln;
  7506. *)
  7507. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7508. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7509. RETURN RESULT
  7510. END "*";
  7511. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7512. BEGIN
  7513. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7514. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7515. RETURN RESULT
  7516. END "*";
  7517. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7518. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7519. BEGIN
  7520. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7521. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7522. RETURN RESULT
  7523. END "*";
  7524. (** REAL *)
  7525. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7526. VAR lval, rval, dval: REAL;
  7527. BEGIN
  7528. dval := 0;
  7529. WHILE (len > 0) DO
  7530. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7531. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7532. END;
  7533. SYSTEM.PUT( dadr, dval );
  7534. END MatMulARARLoop;
  7535. (*
  7536. Optimized for small matrices (Alexey Morozov)
  7537. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7538. *)
  7539. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7540. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7541. BEGIN
  7542. dadr := GetAdr(ADDRESSOF(RESULT));
  7543. ladr := GetAdr(ADDRESSOF(left));
  7544. radr := GetAdr(ADDRESSOF(right));
  7545. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7546. IF (ladr # dadr) & (radr # dadr) THEN
  7547. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7548. CASE SYSTEM.VAL(LONGINT,flags) OF
  7549. Mat2x2:
  7550. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7551. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7552. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7553. END;
  7554. END;
  7555. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7556. ELSE
  7557. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7558. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7559. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7560. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7561. END;
  7562. |Mat3x3:
  7563. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7564. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7565. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7566. END;
  7567. END;
  7568. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7569. ELSE
  7570. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7571. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7572. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7573. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7574. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7575. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7576. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7577. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7578. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7579. END;
  7580. |Mat4x4:
  7581. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7582. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7583. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7584. END;
  7585. END;
  7586. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7587. ELSE
  7588. 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];
  7589. 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];
  7590. 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];
  7591. 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];
  7592. 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];
  7593. 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];
  7594. 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];
  7595. 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];
  7596. 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];
  7597. 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];
  7598. 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];
  7599. 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];
  7600. 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];
  7601. 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];
  7602. 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];
  7603. 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];
  7604. END;
  7605. ELSE
  7606. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7607. loopMatMulARAR, matMulR );
  7608. END;
  7609. ELSE
  7610. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7611. loopMatMulARAR, matMulR );
  7612. END;
  7613. RETURN RESULT
  7614. END "*";
  7615. (*
  7616. Optimized for small arrays (Alexey Morozov)
  7617. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7618. *)
  7619. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7620. VAR
  7621. flags: SET; dadr, ladr, radr: ADDRESS;
  7622. v0, v1, v2: REAL;
  7623. BEGIN
  7624. dadr := GetAdr(ADDRESSOF(RESULT));
  7625. ladr := GetAdr(ADDRESSOF(left));
  7626. radr := GetAdr(ADDRESSOF(right));
  7627. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7628. CASE SYSTEM.VAL(LONGINT,flags) OF
  7629. MatVec2x2:
  7630. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7631. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7632. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7633. END;
  7634. END;
  7635. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7636. ELSE
  7637. (* account possible overlapping *)
  7638. v0 := right[0];
  7639. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7640. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7641. END;
  7642. |MatVec3x3:
  7643. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7644. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7645. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7646. END;
  7647. END;
  7648. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7649. ELSE
  7650. (* account possible overlapping *)
  7651. v0 := right[0]; v1 := right[1];
  7652. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7653. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7654. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7655. END;
  7656. |MatVec4x4:
  7657. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7658. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7659. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7660. END;
  7661. END;
  7662. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7663. ELSE
  7664. (* account possible overlapping *)
  7665. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7666. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7667. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7668. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7669. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7670. END;
  7671. ELSE
  7672. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7673. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7674. END;
  7675. RETURN RESULT
  7676. END "*";
  7677. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7678. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7679. BEGIN
  7680. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7681. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7682. RETURN RESULT
  7683. END "*";
  7684. (** LONGREAL *)
  7685. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7686. VAR lval, rval, dval: LONGREAL;
  7687. BEGIN
  7688. dval := 0;
  7689. WHILE (len > 0) DO
  7690. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7691. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7692. END;
  7693. SYSTEM.PUT( dadr, dval );
  7694. END MatMulAXAXLoop;
  7695. (*
  7696. Optimized for small matrices (Alexey Morozov)
  7697. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7698. *)
  7699. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7700. VAR
  7701. flags: SET; dadr, ladr, radr: ADDRESS;
  7702. BEGIN
  7703. dadr := GetAdr(ADDRESSOF(RESULT));
  7704. ladr := GetAdr(ADDRESSOF(left));
  7705. radr := GetAdr(ADDRESSOF(right));
  7706. IF (ladr # dadr) & (radr # dadr) THEN
  7707. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7708. CASE SYSTEM.VAL(LONGINT,flags) OF
  7709. Mat2x2:
  7710. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7711. IF dadr = 0 THEN NEW(RESULT,2,2);
  7712. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7713. END;
  7714. END;
  7715. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7716. ELSE
  7717. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7718. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7719. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7720. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7721. END;
  7722. |Mat3x3:
  7723. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7724. IF dadr = 0 THEN NEW(RESULT,3,3);
  7725. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7726. END;
  7727. END;
  7728. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7729. ELSE
  7730. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7731. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7732. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7733. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7734. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7735. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7736. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7737. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7738. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7739. END;
  7740. |Mat4x4:
  7741. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7742. IF dadr = 0 THEN NEW(RESULT,4,4);
  7743. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7744. END;
  7745. END;
  7746. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7747. ELSE
  7748. 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];
  7749. 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];
  7750. 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];
  7751. 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];
  7752. 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];
  7753. 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];
  7754. 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];
  7755. 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];
  7756. 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];
  7757. 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];
  7758. 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];
  7759. 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];
  7760. 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];
  7761. 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];
  7762. 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];
  7763. 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];
  7764. END;
  7765. ELSE
  7766. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7767. loopMatMulAXAX, matMulX );
  7768. END;
  7769. ELSE
  7770. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7771. loopMatMulAXAX, matMulX );
  7772. END;
  7773. RETURN RESULT
  7774. END "*";
  7775. (*
  7776. Optimized for small arrays (Alexey Morozov)
  7777. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7778. *)
  7779. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7780. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7781. VAR
  7782. flags: SET; dadr, ladr, radr: ADDRESS;
  7783. v0, v1, v2: LONGREAL;
  7784. BEGIN
  7785. dadr := GetAdr(ADDRESSOF(RESULT));
  7786. ladr := GetAdr(ADDRESSOF(left));
  7787. radr := GetAdr(ADDRESSOF(right));
  7788. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7789. CASE SYSTEM.VAL(LONGINT,flags) OF
  7790. MatVec2x2:
  7791. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7792. IF dadr = 0 THEN NEW(RESULT,2);
  7793. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7794. END;
  7795. END;
  7796. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7797. ELSE
  7798. (* account possible overlapping *)
  7799. v0 := right[0];
  7800. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7801. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7802. END;
  7803. |MatVec3x3:
  7804. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7805. IF dadr = 0 THEN NEW(RESULT,3);
  7806. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7807. END;
  7808. END;
  7809. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7810. ELSE
  7811. (* account possible overlapping *)
  7812. v0 := right[0]; v1 := right[1];
  7813. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7814. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7815. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7816. END;
  7817. |MatVec4x4:
  7818. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7819. IF dadr = 0 THEN NEW(RESULT,4);
  7820. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7821. END;
  7822. END;
  7823. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7824. ELSE
  7825. (* account possible overlapping *)
  7826. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7827. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7828. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7829. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7830. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7831. END;
  7832. ELSE
  7833. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7834. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7835. END;
  7836. RETURN RESULT
  7837. END "*";
  7838. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7839. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7840. BEGIN
  7841. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7842. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7843. RETURN RESULT
  7844. END "*";
  7845. (** SHORTINT *)
  7846. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7847. VAR lval, rval, dval: SHORTINT;
  7848. BEGIN
  7849. SYSTEM.GET( dadr, dval );
  7850. WHILE (len > 0) DO
  7851. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7852. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7853. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7854. END;
  7855. SYSTEM.PUT( dadr, dval );
  7856. END MatMulIncASASLoop;
  7857. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7858. BEGIN
  7859. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7860. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7861. RETURN RESULT
  7862. END "INCMUL";
  7863. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7864. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7865. BEGIN
  7866. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7867. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7868. RETURN RESULT
  7869. END "INCMUL";
  7870. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7871. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7872. BEGIN
  7873. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7874. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7875. RETURN RESULT
  7876. END "INCMUL";
  7877. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7878. BEGIN
  7879. RESULT := -RESULT;
  7880. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7881. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7882. RESULT := -RESULT;
  7883. RETURN RESULT
  7884. END "DECMUL";
  7885. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7886. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7887. BEGIN
  7888. RESULT := -RESULT;
  7889. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7890. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7891. RESULT := -RESULT;
  7892. RETURN RESULT
  7893. END "DECMUL";
  7894. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7895. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7896. BEGIN
  7897. RESULT := -RESULT;
  7898. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7899. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7900. RESULT := -RESULT;
  7901. RETURN RESULT
  7902. END "DECMUL";
  7903. (** INTEGER *)
  7904. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7905. VAR lval, rval, dval: INTEGER;
  7906. BEGIN
  7907. SYSTEM.GET( dadr, dval );
  7908. WHILE (len > 0) DO
  7909. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7910. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7911. END;
  7912. SYSTEM.PUT( dadr, dval );
  7913. END MatMulIncAIAILoop;
  7914. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7915. BEGIN
  7916. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7917. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7918. RETURN RESULT
  7919. END "INCMUL";
  7920. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7921. BEGIN
  7922. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7923. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7924. RETURN RESULT
  7925. END "INCMUL";
  7926. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7927. BEGIN
  7928. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7929. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7930. RETURN RESULT
  7931. END "INCMUL";
  7932. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7933. BEGIN
  7934. RESULT := -RESULT;
  7935. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7936. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7937. RESULT := -RESULT;
  7938. RETURN RESULT
  7939. END "DECMUL";
  7940. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7941. BEGIN
  7942. RESULT := -RESULT;
  7943. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7944. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7945. RESULT := -RESULT;
  7946. RETURN RESULT
  7947. END "DECMUL";
  7948. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7949. BEGIN
  7950. RESULT := -RESULT;
  7951. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7952. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7953. RESULT := -RESULT;
  7954. RETURN RESULT
  7955. END "DECMUL";
  7956. (** LONGINT *)
  7957. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7958. VAR lval, rval, dval: LONGINT;
  7959. BEGIN
  7960. SYSTEM.GET( dadr, dval );
  7961. WHILE (len > 0) DO
  7962. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7963. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7964. END;
  7965. SYSTEM.PUT( dadr, dval );
  7966. END MatMulIncALALLoop;
  7967. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7968. BEGIN
  7969. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7970. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7971. RETURN RESULT
  7972. END "INCMUL";
  7973. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7974. BEGIN
  7975. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7976. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7977. RETURN RESULT
  7978. END "INCMUL";
  7979. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7980. BEGIN
  7981. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7982. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7983. RETURN RESULT
  7984. END "INCMUL";
  7985. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7986. BEGIN
  7987. RESULT := -RESULT;
  7988. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7989. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7990. RESULT := -RESULT;
  7991. RETURN RESULT
  7992. END "DECMUL";
  7993. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7994. BEGIN
  7995. RESULT := -RESULT;
  7996. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7997. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7998. RESULT := -RESULT;
  7999. RETURN RESULT
  8000. END "DECMUL";
  8001. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8002. BEGIN
  8003. RESULT := -RESULT;
  8004. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8005. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8006. RESULT := -RESULT;
  8007. RETURN RESULT
  8008. END "DECMUL";
  8009. (** REAL *)
  8010. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8011. VAR lval, rval, dval: REAL;
  8012. BEGIN
  8013. SYSTEM.GET( dadr, dval );
  8014. WHILE (len > 0) DO
  8015. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8016. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8017. END;
  8018. SYSTEM.PUT( dadr, dval );
  8019. END MatMulIncARARLoop;
  8020. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8021. BEGIN
  8022. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8023. loopMatMulIncARAR, matMulIncR );
  8024. RETURN RESULT
  8025. END "INCMUL";
  8026. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8027. BEGIN
  8028. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8029. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8030. RETURN RESULT
  8031. END "INCMUL";
  8032. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8033. BEGIN
  8034. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8035. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8036. RETURN RESULT
  8037. END "INCMUL";
  8038. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8039. BEGIN
  8040. RESULT := -RESULT;
  8041. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8042. loopMatMulIncARAR, matMulIncR );
  8043. RESULT := -RESULT;
  8044. RETURN RESULT
  8045. END "DECMUL";
  8046. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8047. BEGIN
  8048. RESULT := -RESULT;
  8049. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8050. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8051. RESULT := -RESULT;
  8052. RETURN RESULT
  8053. END "DECMUL";
  8054. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8055. BEGIN
  8056. RESULT := -RESULT;
  8057. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8058. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8059. RESULT := -RESULT;
  8060. RETURN RESULT
  8061. END "DECMUL";
  8062. (** LONGREAL *)
  8063. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8064. VAR lval, rval, dval: LONGREAL;
  8065. BEGIN
  8066. SYSTEM.GET( dadr, dval );
  8067. WHILE (len > 0) DO
  8068. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8069. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8070. END;
  8071. SYSTEM.PUT( dadr, dval );
  8072. END MatMulIncAXAXLoop;
  8073. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8074. BEGIN
  8075. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8076. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8077. RETURN RESULT
  8078. END "INCMUL";
  8079. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8080. BEGIN
  8081. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8082. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8083. RETURN RESULT
  8084. END "INCMUL";
  8085. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8086. BEGIN
  8087. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8088. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8089. RETURN RESULT
  8090. END "INCMUL";
  8091. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8092. BEGIN
  8093. RESULT := -RESULT;
  8094. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8095. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8096. RESULT := -RESULT;
  8097. RETURN RESULT
  8098. END "DECMUL";
  8099. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8100. BEGIN
  8101. RESULT := -RESULT;
  8102. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8103. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8104. RESULT := -RESULT;
  8105. RETURN RESULT
  8106. END "DECMUL";
  8107. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8108. BEGIN
  8109. RESULT := -RESULT;
  8110. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8111. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8112. RESULT := -RESULT;
  8113. RETURN RESULT
  8114. END "DECMUL";
  8115. (*** Cross product ********************************************************************)
  8116. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8117. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8118. BEGIN
  8119. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8120. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8121. END;
  8122. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8123. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8124. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8125. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8126. RETURN RESULT
  8127. END "*";
  8128. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8129. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8130. BEGIN
  8131. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8132. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8133. END;
  8134. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8135. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8136. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8137. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8138. RETURN RESULT
  8139. END "*";
  8140. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8141. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8142. BEGIN
  8143. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8144. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8145. END;
  8146. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8147. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8148. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8149. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8150. RETURN RESULT
  8151. END "*";
  8152. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8153. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8154. BEGIN
  8155. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8156. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8157. END;
  8158. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8159. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8160. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8161. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8162. RETURN RESULT
  8163. END "*";
  8164. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8165. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8166. BEGIN
  8167. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8168. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8169. END;
  8170. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8171. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8172. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8173. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8174. RETURN RESULT
  8175. END "*";
  8176. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  8177. VAR tensor: Tensor;
  8178. BEGIN
  8179. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8180. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8181. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8182. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8183. ELSE HALT(200);
  8184. END;
  8185. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8186. loopMatMulAXAX, matMulX );
  8187. RETURN RESULT
  8188. END "*";
  8189. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  8190. BEGIN
  8191. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8192. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8193. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8194. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8195. ELSE HALT(200);
  8196. END;
  8197. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8198. loopMatMulARAR, matMulR );
  8199. RETURN RESULT
  8200. END "*";
  8201. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  8202. BEGIN
  8203. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8204. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8205. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8206. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8207. ELSE HALT(200);
  8208. END;
  8209. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8210. MatMulALALLoop, NIL );
  8211. RETURN RESULT
  8212. END "*";
  8213. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8214. BEGIN
  8215. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8216. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8217. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8218. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8219. ELSE HALT(200);
  8220. END;
  8221. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8222. MatMulAIAILoop,NIL );
  8223. RETURN RESULT
  8224. END "*";
  8225. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8226. BEGIN
  8227. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8228. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8229. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8230. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8231. ELSE HALT(200);
  8232. END;
  8233. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8234. MatMulASASLoop, NIL );
  8235. RETURN RESULT
  8236. END "*";
  8237. (** Transpose ********************************************************************)
  8238. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8239. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8240. BEGIN
  8241. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8242. dim := GetDim( src1 ) - 1;
  8243. WHILE (dim > 0) DO
  8244. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8245. END;
  8246. dim := GetDim( src2 ) - 1;
  8247. WHILE (dim > 0) DO
  8248. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8249. END;
  8250. IF from1 < from2 THEN RETURN to1 >= from2;
  8251. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8252. ELSE RETURN TRUE;
  8253. END;
  8254. END Overlap;
  8255. (*
  8256. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8257. VAR from1, from2, to1, to2: ADDRESS;
  8258. BEGIN
  8259. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8260. DEC( dim );
  8261. WHILE (dim > 0) DO
  8262. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8263. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8264. END;
  8265. IF from1 < from2 THEN RETURN to1 >= from2;
  8266. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8267. ELSE RETURN TRUE;
  8268. END;
  8269. END Overlap;
  8270. *)
  8271. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8272. VAR ptr, data: ANY; Size: SIZE;
  8273. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8274. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8275. VAR dim,max: SIZE;
  8276. BEGIN
  8277. dim := GetDim( l );
  8278. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8279. max := dim-1;
  8280. WHILE (dim > 0) DO
  8281. DEC( dim );
  8282. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8283. END;
  8284. RETURN TRUE;
  8285. END TransposedShape;
  8286. PROCEDURE NewData;
  8287. VAR max,dim, len, size: SIZE;
  8288. BEGIN
  8289. dim := GetDim( src ); size := elementsize;
  8290. PutDim( dest, dim );
  8291. PutSize( dest, elementsize );
  8292. max := dim-1;
  8293. WHILE (dim > 0) DO
  8294. DEC( dim );
  8295. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8296. PutInc( dest, dim, size ); size := size * len;
  8297. END;
  8298. SYSTEM.NEW( data, size + ArrayAlignment);
  8299. PutAdr( dest, Align(data) );
  8300. PutPtr( dest, data );
  8301. END NewData;
  8302. BEGIN
  8303. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8304. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8305. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8306. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8307. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8308. PutFlags(dest, {TensorFlag});
  8309. NewData();
  8310. RETURN ptr;
  8311. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8312. (* check if re-allocation of descriptor is allowed *)
  8313. IF ~(TensorFlag IN GetFlags( dest )) &
  8314. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8315. HALT( 100 );
  8316. END;
  8317. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8318. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8319. PutFlags(dest, {TensorFlag});
  8320. NewData(); RETURN ptr;
  8321. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8322. (* check if re-allocation of array data is allowed *)
  8323. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8324. HALT( 100 );
  8325. END;
  8326. NewData();
  8327. RETURN data;
  8328. ELSE (* nothing to do *)
  8329. RETURN NIL;
  8330. END;
  8331. END AllocateTransposed;
  8332. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8333. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8334. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8335. BEGIN
  8336. WHILE (len > 0) DO
  8337. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8338. DEC( len );
  8339. END;
  8340. END CopyLoop;
  8341. BEGIN
  8342. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8343. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8344. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8345. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8346. ELSE
  8347. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8348. p := AllocateTransposed(dest,left,Size);
  8349. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8350. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8351. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8352. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8353. WHILE (len0 > 0) DO
  8354. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8355. INC( dadr, dinc0 ); DEC( len0 );
  8356. END;
  8357. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8358. ladr := p;
  8359. ELSE
  8360. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8361. END;
  8362. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8363. dadr := GetAdr( dest );
  8364. IF (Size = 4) & (transpose4 # NIL ) THEN
  8365. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8366. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8367. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8368. ELSE
  8369. WHILE (len0 > 0) DO
  8370. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8371. INC( dadr, dinc1 ); DEC( len0 );
  8372. END;
  8373. END;
  8374. END;
  8375. END Transpose;
  8376. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8377. BEGIN
  8378. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8379. RETURN RESULT
  8380. END "`";
  8381. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8382. BEGIN
  8383. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8384. RETURN RESULT
  8385. END "`";
  8386. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8387. BEGIN
  8388. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8389. RETURN RESULT
  8390. END "`";
  8391. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8392. BEGIN
  8393. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8394. RETURN RESULT
  8395. END "`";
  8396. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8397. BEGIN
  8398. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8399. RETURN RESULT
  8400. END "`";
  8401. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8402. VAR i: SIZE;
  8403. BEGIN
  8404. FOR i := 0 TO rdim - 1 DO
  8405. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8406. END;
  8407. FOR i := 0 TO ldim - 1 DO
  8408. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8409. END;
  8410. RETURN TRUE;
  8411. END CheckTensorGeometry;
  8412. (*
  8413. PROCEDURE Zero(p: ANY; size: LONGINT);
  8414. VAR adr: LONGINT;
  8415. BEGIN
  8416. adr := SYSTEM.VAL(LONGINT,p);
  8417. WHILE(size>0) DO
  8418. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8419. END;
  8420. END Zero;
  8421. *)
  8422. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8423. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8424. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8425. squeezingReshape: BOOLEAN;
  8426. PROCEDURE CheckAlloc;
  8427. BEGIN
  8428. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8429. END CheckAlloc;
  8430. PROCEDURE NewDescriptor;
  8431. BEGIN
  8432. CheckAlloc;
  8433. ptr := GetArrayDesc( newDim ); new := ptr;
  8434. END NewDescriptor;
  8435. (* Added by Alexey
  8436. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8437. *)
  8438. PROCEDURE SqueezingReshape(): BOOLEAN;
  8439. VAR
  8440. i, j, n: SIZE;
  8441. BEGIN
  8442. IF oldDim > newDim THEN
  8443. i := 0; j := 0;
  8444. WHILE (i < oldDim) & (j < newDim) DO
  8445. n := GetLen(src,i);
  8446. IF n = shape[j] THEN INC(j); END;
  8447. INC(i);
  8448. END;
  8449. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8450. ELSE
  8451. squeezingReshape := FALSE;
  8452. END;
  8453. squeezingReshape := (i = oldDim) & (j = newDim);
  8454. RETURN squeezingReshape;
  8455. END SqueezingReshape;
  8456. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8457. PROCEDURE TargetContinuous(): BOOLEAN;
  8458. VAR
  8459. i, n: SIZE;
  8460. continue: BOOLEAN;
  8461. BEGIN
  8462. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8463. continue := TRUE;
  8464. WHILE (i > 0) & continue DO
  8465. n := n * GetLen(dest,i);
  8466. DEC(i);
  8467. continue := GetIncr(dest,i) = n;
  8468. END;
  8469. (*TRACE(i,continue,Size,GetSize(dest));*)
  8470. (*tod obviously size is not what I expect it to be*)
  8471. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8472. RETURN TRUE;
  8473. ELSE
  8474. RETURN FALSE;
  8475. END;
  8476. END TargetContinuous;
  8477. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8478. PROCEDURE PreservesContiguity(): BOOLEAN;
  8479. VAR
  8480. i, n: SIZE;
  8481. continue: BOOLEAN;
  8482. BEGIN
  8483. i := oldDim-1; n := GetIncr(src,i);
  8484. continue := TRUE;
  8485. WHILE (i > 0) & continue DO
  8486. n := n * GetLen(src,i);
  8487. DEC(i);
  8488. continue := GetIncr(src,i) = n;
  8489. END;
  8490. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8491. RETURN TRUE;
  8492. ELSE Err("Not yet implemented!");
  8493. END;
  8494. END PreservesContiguity;
  8495. (* Added by Alexey *)
  8496. PROCEDURE NewDescriptorForSameData;
  8497. VAR len, size, i, j: SIZE;
  8498. BEGIN
  8499. CheckAlloc();
  8500. ptr := GetArrayDesc( newDim ); new := ptr;
  8501. IF ~squeezingReshape THEN
  8502. size := Size;
  8503. FOR i := newDim - 1 TO 0 BY -1 DO
  8504. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8505. size := size * len;
  8506. END;
  8507. ELSE (* squeezing reshape *)
  8508. j := 0; len := shape[j];
  8509. FOR i := 0 TO oldDim-1 DO
  8510. IF GetLen(src,i) = len THEN
  8511. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8512. INC(j);
  8513. IF j < newDim THEN len := shape[j]; END;
  8514. END;
  8515. END;
  8516. END;
  8517. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8518. PutFlags(new,GetFlags(new)+{RangeFlag});
  8519. END;
  8520. PutAdr( new, GetAdr(src) );
  8521. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8522. PutSize( new, Size );
  8523. END NewDescriptorForSameData;
  8524. PROCEDURE NewData;
  8525. VAR len, size, i: SIZE;
  8526. BEGIN
  8527. size := Size;
  8528. FOR i := newDim - 1 TO 0 BY -1 DO
  8529. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8530. size := size * len;
  8531. END;
  8532. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8533. PutAdr( new, Align(data) );
  8534. PutPtr( new, data ); PutDim( new, newDim );
  8535. PutSize( new, Size );
  8536. END NewData;
  8537. PROCEDURE CopyData;
  8538. VAR d, s: SIZE; dadr: ADDRESS;
  8539. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8540. VAR inc, len, i: SIZE;
  8541. BEGIN
  8542. IF dim = d THEN
  8543. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8544. FOR i := 0 TO len - 1 DO
  8545. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8546. END;
  8547. ELSE
  8548. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8549. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8550. END;
  8551. END Loop;
  8552. BEGIN
  8553. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8554. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8555. s := s * GetLen( src, d ); DEC( d );
  8556. END;
  8557. IF d = -1 THEN (* special case: both continuous *)
  8558. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8559. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8560. END;
  8561. END CopyData;
  8562. PROCEDURE CopyDataBack;
  8563. VAR d, s: SIZE; sadr: ADDRESS;
  8564. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8565. VAR inc, len, i: SIZE;
  8566. BEGIN
  8567. IF dim = d THEN
  8568. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8569. FOR i := 0 TO len - 1 DO
  8570. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8571. END;
  8572. ELSE
  8573. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8574. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8575. END;
  8576. END Loop;
  8577. BEGIN
  8578. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8579. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8580. s := s * GetLen( dest, d ); DEC( d );
  8581. END;
  8582. IF d = -1 THEN (* special case: both continuous *)
  8583. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8584. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8585. END;
  8586. END CopyDataBack;
  8587. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8588. BEGIN
  8589. ASSERT( GetDim( src ) = GetDim( dest ) );
  8590. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8591. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8592. END CopyDescriptor;
  8593. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8594. VAR i: SIZE;
  8595. BEGIN
  8596. ASSERT(GetDim(dest) = newDim);
  8597. FOR i := 0 TO newDim - 1 DO
  8598. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8599. END;
  8600. RETURN FALSE;
  8601. END ShapeDiffers;
  8602. BEGIN
  8603. (*
  8604. cases
  8605. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8606. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8607. 3.) descriptor may not be reshaped: dest = RANGE
  8608. *)
  8609. (* first check invariants *)
  8610. oldDim := GetDim( src );
  8611. IF oldDim = 0 THEN oldSize := 0
  8612. ELSE
  8613. oldSize := 1;
  8614. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8615. END;
  8616. newDim := LEN( shape, 0 );
  8617. IF newDim = 0 THEN newSize := 0
  8618. ELSE
  8619. newSize := 1;
  8620. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8621. END;
  8622. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8623. Size := GetSize( src );
  8624. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8625. IF dest = src THEN (* added by Alexey *)
  8626. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8627. NewDescriptorForSameData;
  8628. dest := new;
  8629. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8630. (* create a copy of the original descriptor *)
  8631. CheckAlloc();
  8632. ptr := GetArrayDesc(newDim); dest := ptr;
  8633. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8634. CopyDescriptor(src,dest);
  8635. ELSE
  8636. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8637. END;
  8638. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8639. NewDescriptor; NewData; CopyData; dest := new;
  8640. ELSIF (dest = temporary) THEN
  8641. NewDescriptorForSameData;
  8642. dest := new;
  8643. ELSIF TargetContinuous() THEN
  8644. NewDescriptor; new:=dest; CopyData;
  8645. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8646. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8647. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8648. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8649. END;
  8650. NewDescriptor; NewData; CopyData;
  8651. dest := new;
  8652. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8653. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8654. (*
  8655. NewDescriptor; *)
  8656. new := dest;
  8657. NewData; CopyData;
  8658. new := NIL;
  8659. (*CopyDescriptor( new, dest );*)
  8660. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8661. NewDescriptor; NewData; CopyData; CopyDataBack;
  8662. ELSE (* same shape, just copy *)
  8663. CopyContent( src, dest, Size ); RETURN;
  8664. END;
  8665. IF dest = new THEN (* new block *)
  8666. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  8667. END;
  8668. END DoReshape;
  8669. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8670. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8671. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8672. PROCEDURE NewData;
  8673. VAR len, size, i: SIZE;
  8674. BEGIN
  8675. size := elementSize;
  8676. FOR i := dim - 1 TO 0 BY -1 DO
  8677. len := a[i];
  8678. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8679. END;
  8680. IF tag = 0 THEN
  8681. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8682. dest.adr := Align(data);
  8683. ELSE
  8684. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8685. dest.adr := data + ArrDataArrayOffset;
  8686. END;
  8687. SafePut(dest.ptr, data);
  8688. (*dest.ptr := data;*)
  8689. PutSize( dest, elementSize );
  8690. END NewData;
  8691. PROCEDURE ClearData;
  8692. (*! todo *)
  8693. END ClearData;
  8694. BEGIN
  8695. dim := LEN( a,0 );
  8696. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8697. IF dest # 0 THEN
  8698. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8699. END;
  8700. descr := GetArrayDesc( LEN( a,0 ) );
  8701. dest := descr;
  8702. NewData;
  8703. Heaps.SetPC(data);
  8704. ELSE
  8705. i := 0;
  8706. same := TRUE;
  8707. WHILE (i < dim) & same DO
  8708. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8709. INC( i );
  8710. END;
  8711. IF ~same THEN
  8712. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8713. NewData;
  8714. Heaps.SetPC(data);
  8715. ELSE ClearData
  8716. END;
  8717. END;
  8718. END AllocateTensorA;
  8719. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8720. BEGIN
  8721. AllocateTensorA(a,elementSize,tag,dest);
  8722. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8723. END AllocateArrayA;
  8724. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8725. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  8726. PROCEDURE NewData;
  8727. VAR len, size: SIZE; i: SIZE;
  8728. BEGIN
  8729. size := Size;
  8730. FOR i := dim - 1 TO 0 BY -1 DO
  8731. len := a[i];
  8732. (*
  8733. KernelLog.Int(len,10); KernelLog.Ln;
  8734. *)
  8735. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8736. END;
  8737. IF tag = 0 THEN
  8738. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8739. PutAdr( dest, Align(data) );
  8740. ELSE
  8741. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8742. PutAdr( dest, data+ ArrDataArrayOffset );
  8743. END;
  8744. PutPtr( dest, data ); PutSize( dest, Size );
  8745. END NewData;
  8746. PROCEDURE ClearData;
  8747. (*! todo *)
  8748. END ClearData;
  8749. BEGIN
  8750. dim := LEN( a,0 );
  8751. dest := SYSTEM.VAL(ADDRESS,destA);
  8752. (*! check range flag! *)
  8753. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8754. IF dest # 0 THEN
  8755. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8756. END;
  8757. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8758. NewData;
  8759. ELSE
  8760. i := 0;
  8761. WHILE (i < dim) & same DO
  8762. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8763. INC( i );
  8764. END;
  8765. IF ~same THEN
  8766. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8767. NewData
  8768. ELSE ClearData
  8769. END;
  8770. END;
  8771. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8772. IF dest = descr THEN (* new block *)
  8773. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  8774. END;
  8775. END AllocateTensorX;
  8776. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8777. VAR dim, i: SIZE;
  8778. BEGIN
  8779. dim := GetDim( src );
  8780. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8781. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8782. END LenA;
  8783. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8784. VAR dim, len: SIZE; i: SIZE;
  8785. BEGIN
  8786. dim := GetDim( src ); len := LEN( dest, 0 );
  8787. IF len # dim THEN NEW( dest, dim ); END;
  8788. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8789. END IncrA;
  8790. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8791. VAR dim: SIZE;
  8792. BEGIN
  8793. dim := GetDim(src);
  8794. IF (d<0) OR (d>=dim) THEN HALT(100)
  8795. ELSE
  8796. RETURN GetLen(src,d);
  8797. END;
  8798. END Len;
  8799. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8800. VAR dim: SIZE;
  8801. BEGIN
  8802. dim := GetDim(src);
  8803. IF (d<0) OR (d>=dim) THEN HALT(100)
  8804. ELSE
  8805. RETURN GetIncr(src,d);
  8806. END;
  8807. END Incr;
  8808. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8809. Size: SIZE ): ANY;
  8810. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8811. PROCEDURE NewData;
  8812. VAR len, size, i: SIZE;
  8813. BEGIN
  8814. size := 1;
  8815. FOR i := 0 TO ldim - 1 DO
  8816. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8817. END;
  8818. FOR i := 0 TO rdim - 1 DO
  8819. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8820. END;
  8821. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8822. (*
  8823. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8824. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8825. *)
  8826. size := Size;
  8827. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8828. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8829. END;
  8830. PutAdr( dest, Align(data) );
  8831. PutPtr( dest, data );
  8832. END NewData;
  8833. BEGIN
  8834. ldim := GetDim( left ); rdim := GetDim( right );
  8835. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8836. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8837. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8838. NewData(); RETURN ptr;
  8839. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8840. IF ~(TensorFlag IN GetFlags( dest )) &
  8841. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8842. HALT( 100 );
  8843. END;
  8844. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8845. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8846. NewData(); RETURN ptr;
  8847. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8848. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8849. HALT( 100 );
  8850. END;
  8851. NewData(); RETURN data;
  8852. END;
  8853. RETURN NIL;
  8854. END AllocateTensor;
  8855. (* 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 *)
  8856. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8857. VAR rdim, len, linc, ri: SIZE );
  8858. (* geometric precondition: lengths must coincide *)
  8859. VAR ldim: SIZE;
  8860. BEGIN
  8861. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8862. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8863. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8864. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8865. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8866. END;
  8867. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8868. DEC( ldim );
  8869. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8870. (GetIncr( right, rdim ) = len * ri) DO
  8871. len := len * GetLen( left, ldim );
  8872. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8873. DEC( ldim );
  8874. END;
  8875. INC( ldim ); INC( rdim );
  8876. IF debug THEN
  8877. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8878. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8879. END;
  8880. END FindPatternTensor;
  8881. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  8882. Loop: BinaryASALoop );
  8883. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  8884. origdest: ADDRESS; left, right, dest: ADDRESS;
  8885. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  8886. VAR len: SIZE; linc, rinc, dinc: SIZE;
  8887. BEGIN
  8888. IF (ldim < lDim) THEN
  8889. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8890. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8891. WHILE (len > 0) DO
  8892. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8893. INC( dadr, dinc ); DEC( len );
  8894. END;
  8895. ELSIF (rdim # loopd) THEN
  8896. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8897. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8898. WHILE (len > 0) DO
  8899. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8900. INC( dadr, dinc ); DEC( len );
  8901. END;
  8902. ELSE
  8903. (*
  8904. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8905. KernelLog.Int(GetAdr(dest),10);
  8906. KernelLog.Int(GetAdr(dest)+clen,10);
  8907. KernelLog.Ln;
  8908. *)
  8909. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8910. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8911. END;
  8912. END Traverse;
  8913. BEGIN
  8914. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8915. (* check array lengths *)
  8916. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8917. p := AllocateTensor( dest, left, right, elementSize );
  8918. (*
  8919. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8920. p := AllocateTensor( left, right, dest, elementSize )
  8921. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8922. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8923. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8924. END;
  8925. (*! to be done: treat overlapping memory *)
  8926. END;
  8927. *)
  8928. (* debugging *)
  8929. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8930. (* check pattern: longest piece that can be done with a loop *)
  8931. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8932. (* run through dimensions *)
  8933. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8934. SYSTEM.PUT( d, dest );
  8935. IF p = dest THEN
  8936. Heaps.CheckAssignment(d,dest);
  8937. END;
  8938. END ApplyTensorAAAOp;
  8939. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8940. BEGIN
  8941. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8942. SIZEOF( SHORTINT ), MulASSSLoop );
  8943. RETURN RESULT
  8944. END "**";
  8945. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8946. BEGIN
  8947. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8948. SIZEOF( INTEGER ), MulAISILoop );
  8949. RETURN RESULT
  8950. END "**";
  8951. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8952. BEGIN
  8953. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8954. SIZEOF( LONGINT ), MulALSLLoop );
  8955. RETURN RESULT
  8956. END "**";
  8957. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8958. BEGIN
  8959. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8960. loopMulARSR );
  8961. RETURN RESULT
  8962. END "**";
  8963. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8964. BEGIN
  8965. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8966. SIZEOF( LONGREAL ), loopMulAXSX );
  8967. RETURN RESULT
  8968. END "**";
  8969. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8970. BEGIN
  8971. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8972. loopMulAZSZ );
  8973. RETURN RESULT
  8974. END "**";
  8975. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8976. BEGIN
  8977. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8978. loopMulALZSLZ );
  8979. RETURN RESULT
  8980. END "**";
  8981. PROCEDURE InitOptimization;
  8982. VAR p: PROCEDURE;
  8983. BEGIN
  8984. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8985. IF p # NIL THEN
  8986. p;
  8987. ELSE
  8988. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8989. END;
  8990. END InitOptimization;
  8991. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  8992. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  8993. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  8994. BEGIN
  8995. IF src = 0 THEN
  8996. HALT(100);
  8997. ELSE
  8998. srcDim := GetDim(src);
  8999. destDim := srcDim - prefixIndices - suffixIndices;
  9000. (*
  9001. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9002. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9003. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9004. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9005. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9006. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9007. *)
  9008. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  9009. dest := SYSTEM.VAL(ADDRESS,destPtr);
  9010. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9011. PutAdr(dest,GetAdr(src));
  9012. PutPtr(dest,GetPtr(src));
  9013. PutFlags(dest,GetFlags(src));
  9014. PutSize(dest,GetSize(src));
  9015. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9016. srcDim := i + prefixIndices + prefixRanges;
  9017. destDim := i + prefixRanges;
  9018. len := GetLen(src,srcDim);
  9019. incr := GetIncr(src,srcDim);
  9020. PutLen(dest,destDim,len);
  9021. PutInc(dest,destDim,incr);
  9022. END;
  9023. (*
  9024. Report("copy descriptor src",src);
  9025. Report("copy descriptor dest",dest);
  9026. *)
  9027. END;
  9028. END CopyDescriptor;
  9029. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9030. VAR dest: ARRAY [?] OF basetype
  9031. CONST src: ARRAY [?] OF basetype
  9032. CONST shape: ARRAY [*] OF LONGINT
  9033. *)
  9034. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  9035. BEGIN
  9036. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  9037. RETURN RESULT
  9038. END Reshape;
  9039. (* OLIVIER *)
  9040. (** creates a degenerated range from an integer.
  9041. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9042. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9043. **)
  9044. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9045. BEGIN RETURN (integer .. integer BY 1)
  9046. END RangeFromInteger;
  9047. (* OLIVIER *)
  9048. (** create an array with the same data but with more dimensions
  9049. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9050. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9051. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9052. e.g.:
  9053. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9054. performs the following type transformation:
  9055. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9056. **)
  9057. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9058. VAR
  9059. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9060. sourceADDRESS, targetADDRESS: ADDRESS;
  9061. targetArrayDescriptor: ANY;
  9062. BEGIN
  9063. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9064. targetDimensionality := LEN(keptDimensions, 0);
  9065. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9066. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9067. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9068. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9069. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9070. PutFlags(targetADDRESS, {TensorFlag});
  9071. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9072. (* set increments and lengths *)
  9073. sourceIndex := 0;
  9074. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9075. IF keptDimensions[targetIndex] THEN
  9076. (* reuse length and increment from source array *)
  9077. ASSERT(sourceIndex < DIM(sourceArray));
  9078. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9079. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9080. INC(sourceIndex)
  9081. ELSE
  9082. (* set length = 1 and increment = 0 *)
  9083. PutLen(targetADDRESS, targetIndex, 1);
  9084. PutInc(targetADDRESS, targetIndex, 0);
  9085. END
  9086. END;
  9087. (* Report("expand dimensions: ", targetADDRESS); *)
  9088. RETURN RESULT
  9089. END ExpandDimensions;
  9090. (* index ranges *)
  9091. (* the length of a range, i.e. the number of indices that it stands for *)
  9092. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9093. VAR
  9094. temp, result: SIZE;
  9095. BEGIN
  9096. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9097. (* invalid range *)
  9098. result := 0
  9099. ELSIF LAST(range) = MAX(LONGINT) THEN
  9100. (* open-ended range *)
  9101. result := MAX(LONGINT)
  9102. ELSE
  9103. temp := 1 + LAST(range) - FIRST(range);
  9104. result := temp DIV STEP(range);
  9105. IF (temp MOD STEP(range)) # 0 THEN
  9106. INC(result)
  9107. END
  9108. END;
  9109. RETURN result
  9110. END "LEN";
  9111. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  9112. BEGIN
  9113. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  9114. RETURN RESULT;
  9115. END "ALL";
  9116. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  9117. BEGIN
  9118. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  9119. RETURN RESULT;
  9120. END "ALL";
  9121. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  9122. BEGIN
  9123. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  9124. RETURN RESULT;
  9125. END "ALL";
  9126. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  9127. BEGIN
  9128. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  9129. RETURN RESULT;
  9130. END "ALL";
  9131. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  9132. BEGIN
  9133. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  9134. RETURN RESULT;
  9135. END "ALL";
  9136. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  9137. BEGIN
  9138. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  9139. RETURN RESULT;
  9140. END "ALL";
  9141. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  9142. BEGIN
  9143. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  9144. RETURN RESULT;
  9145. END "ALL";
  9146. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9147. BEGIN
  9148. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9149. RETURN RESULT;
  9150. END "ALL";
  9151. BEGIN
  9152. alloc := 0; NEW(temporary);
  9153. PutFlags(temporary,{TensorFlag});
  9154. PutDim(temporary, 0);
  9155. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9156. END FoxArrayBase.
  9157. Compiler.Compile FoxArrayBase.Mod ~
  9158. SystemTools.ListModules