FoxArrayBase.Mod 346 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492
  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. LenType = LONGINT; (* should be SIZE but for legacy reasons we have to use this *)
  23. CONST
  24. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  25. statistics= FALSE;
  26. conservative=TRUE;
  27. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(ADDRESS);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. ArrayAlignment=8;
  40. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  41. down = 0; up = 1; (* memory copy modes *)
  42. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  43. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  44. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  45. Size2Flag = 4; (* size = 2 *)
  46. Size3Flag = 5; (* size = 3 *)
  47. Size4Flag = 6; (* size = 4 *)
  48. Size5Flag = 7; (* size = 5 *)
  49. Size6Flag = 8; (* size = 6 *)
  50. Size7Flag = 9; (* size = 7 *)
  51. Size8Flag = 10; (* size = 8 *)
  52. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  53. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  54. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  55. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  56. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  57. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  58. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  59. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  60. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  61. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  62. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  63. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  64. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  65. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  66. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  67. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  68. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  69. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  70. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  71. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  72. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  73. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  74. TYPE
  75. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  76. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  77. LenInc* = RECORD
  78. len*: SIZE;
  79. inc*: SIZE
  80. END;
  81. ArrayDescriptor*= RECORD
  82. ptr*: ANY;
  83. adr*: ADDRESS;
  84. flags*: SET;
  85. dim*: SIZE;
  86. elementSize*: SIZE;
  87. END;
  88. Tensor = POINTER TO ArrayDescriptor;
  89. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  90. lens*: ARRAY 8 OF LenInc;
  91. END;
  92. A0 = RECORD(ArrayDescriptor) END;
  93. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  94. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  95. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  96. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  97. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  98. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  99. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  100. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  101. T0 = POINTER TO A0;
  102. T1 = POINTER TO A1;
  103. T2 = POINTER TO A2;
  104. T3 = POINTER TO A3;
  105. T4 = POINTER TO A4;
  106. T5 = POINTER TO A5;
  107. T6 = POINTER TO A6;
  108. T7 = POINTER TO A7;
  109. T8 = POINTER TO A8;
  110. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  111. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  112. VAR
  113. temporary*: T0;
  114. alloc*: LONGINT; (* statistics *)
  115. allocTemp*: LONGINT; (* statistics *)
  116. (* procedures that might be replaced by ASM methods *)
  117. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  118. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  119. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  120. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  121. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  122. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  123. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  124. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  125. transpose4*: TransposeP; transpose8*: TransposeP;
  126. (* optimizations for small arrays (Alexey Morozov) *)
  127. matMulR2x2*: SmallMatMul;
  128. matMulR3x3*: SmallMatMul;
  129. matMulR4x4*: SmallMatMul;
  130. matVecMulR2x2*: SmallMatMul;
  131. matVecMulR3x3*: SmallMatMul;
  132. matVecMulR4x4*: SmallMatMul;
  133. matMulLR2x2*: SmallMatMul;
  134. matMulLR3x3*: SmallMatMul;
  135. matMulLR4x4*: SmallMatMul;
  136. matVecMulLR2x2*: SmallMatMul;
  137. matVecMulLR3x3*: SmallMatMul;
  138. matVecMulLR4x4*: SmallMatMul;
  139. (*
  140. TensorTypePool: ARRAY 32 OF TensorType;
  141. *)
  142. PROCEDURE SetDefaults*; (* set standard procedures *)
  143. BEGIN
  144. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  145. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  146. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  147. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  148. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  149. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  150. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  151. loopIncMulAXSX := IncMulAXSXLoop;
  152. loopMatMulIncARAR := MatMulIncARARLoop;
  153. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  154. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  155. loopMulAZSZ := MulAZSZLoop;
  156. loopMulALZSLZ := MulALZSLZLoop;
  157. END SetDefaults;
  158. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  159. BEGIN
  160. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  161. END Err;
  162. (* get increment of dimension dim *)
  163. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  164. BEGIN{UNCHECKED}
  165. RETURN base.lens[dim].inc
  166. END GetIncr;
  167. (* set increment of dimension dim *)
  168. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  169. BEGIN{UNCHECKED}
  170. base.lens[dim].inc := val
  171. END PutInc;
  172. (* get length of dimension dim *)
  173. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  174. BEGIN{UNCHECKED}
  175. RETURN base.lens[dim].len
  176. END GetLen;
  177. (* set length of dimension dim *)
  178. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  179. BEGIN{UNCHECKED}
  180. base.lens[dim].len := val
  181. END PutLen;
  182. (* get data address *)
  183. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  184. BEGIN
  185. RETURN base.adr;
  186. END GetAdr;
  187. (* set data address *)
  188. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  189. BEGIN
  190. base.adr := value
  191. END PutAdr;
  192. PROCEDURE Align(value: ADDRESS): ADDRESS;
  193. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  194. END Align;
  195. (* get data base pointer (GC protection) *)
  196. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  197. BEGIN
  198. RETURN base.ptr;
  199. END GetPtr;
  200. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  201. BEGIN
  202. dest := src;
  203. END SafePut;
  204. (* set data base pointer (GC protection) *)
  205. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  206. BEGIN
  207. SafePut(base.ptr,value);
  208. END PutPtr;
  209. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  210. BEGIN
  211. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  212. END GetSize;
  213. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  214. BEGIN
  215. base.elementSize := val
  216. END PutSize;
  217. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  218. VAR dim: SIZE;
  219. BEGIN
  220. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  221. END GetDim;
  222. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  223. BEGIN
  224. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  225. END GetFlags;
  226. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  227. BEGIN
  228. base.dim := dim
  229. END PutDim;
  230. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  231. BEGIN
  232. base.flags := flags
  233. END PutFlags;
  234. (* report geometry of array passed via address s *)
  235. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  236. VAR i: SIZE; dim: SIZE;
  237. PROCEDURE Set( s: SET );
  238. VAR i: SIZE; first: BOOLEAN;
  239. BEGIN
  240. KernelLog.String( "{" ); first := TRUE;
  241. FOR i := 31 TO 0 BY -1 DO
  242. IF i IN s THEN
  243. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  244. KernelLog.Int( i, 1 );
  245. END;
  246. END;
  247. KernelLog.String( "}" );
  248. END Set;
  249. BEGIN
  250. KernelLog.String( name );
  251. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  252. ELSE
  253. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  254. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  255. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  256. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  257. KernelLog.Ln; dim := GetDim( s );
  258. IF dim > 32 THEN dim := 0 END;
  259. FOR i := 0 TO dim - 1 DO
  260. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  261. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  262. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  263. END;
  264. (*
  265. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  266. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  267. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  268. *)
  269. END;
  270. END Report;
  271. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  272. VAR (* t: TensorType; *) ptr: Tensor;
  273. p0: T0;
  274. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  275. BEGIN
  276. CASE dim OF
  277. |0: NEW(p0); ptr := p0;
  278. |1:NEW(p1); ptr := p1;
  279. |2:NEW(p2); ptr := p2;
  280. |3:NEW(p3); ptr := p3;
  281. |4:NEW(p4); ptr := p4;
  282. |5:NEW(p5); ptr := p5;
  283. |6:NEW(p6); ptr := p6;
  284. |7:NEW(p7); ptr := p7;
  285. |8:NEW(p8); ptr := p8;
  286. ELSE
  287. HALT(200)
  288. END;
  289. ptr.dim := dim;
  290. ptr.flags := {TensorFlag};
  291. RETURN ptr;
  292. END GetArrayDesc;
  293. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  294. BEGIN
  295. IF d = NIL THEN
  296. d := GetArrayDesc(dim);
  297. ELSIF d.dim # dim THEN
  298. IF ~(TensorFlag IN d.flags) &
  299. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  300. HALT( 100 );
  301. END;
  302. d := GetArrayDesc(dim)
  303. (* ELSE keep as is *)
  304. END;
  305. END EnsureArrayDesc;
  306. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  307. VAR reason: ARRAY 64 OF CHAR;
  308. BEGIN
  309. IF left # 0 THEN Report( "Source operand ", left ) END;
  310. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  311. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  312. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  313. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  314. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  315. ELSE reason := "unknown";
  316. END;
  317. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  318. HALT( 400 );
  319. END Halt;
  320. (** patterns ********************************************************************)
  321. (* 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 *)
  322. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  323. BEGIN
  324. d := dim - 1; len := GetLen( left, d );
  325. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  326. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  327. linc := GetIncr( left, d ); DEC( d );
  328. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  329. len := len * GetLen( left, d ); DEC( d );
  330. END; (* find dimension where pattern does not work any more *)
  331. INC( d );
  332. IF debug THEN
  333. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  334. KernelLog.Ln;
  335. END;
  336. END FindPattern1;
  337. (* 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 *)
  338. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  339. VAR d, len, linc, ri: SIZE );
  340. (* geometric precondition: lengths must coincide *)
  341. BEGIN
  342. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  343. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  344. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  345. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  346. len := len * GetLen( left, d ); DEC( d );
  347. END;
  348. INC( d );
  349. IF debug THEN
  350. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  351. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  352. END;
  353. END FindPattern2;
  354. (* 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 *)
  355. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  356. VAR d, len, linc, ri, di: SIZE );
  357. (* geometric precondition: lengths must coincide *)
  358. BEGIN
  359. d := dim - 1; len := GetLen( left, d );
  360. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  361. END;
  362. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  363. DEC( d );
  364. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  365. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  366. len := len * GetLen( left, d ); DEC( d );
  367. END;
  368. INC( d );
  369. IF debug THEN
  370. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  371. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  372. END;
  373. END FindPattern3;
  374. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  375. VAR d, sl, sr: SIZE;
  376. BEGIN
  377. d := 0; sl := GetAdr( src );
  378. WHILE (d < dim) DO
  379. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  380. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  381. END;
  382. PutAdr( src, sl + sr );
  383. END Reverse;
  384. (* check if forward copy may be performed *)
  385. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  386. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  387. (* precondition: len(src,i)=len(dest,i) *)
  388. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  389. Sufficient (but not necessary) conditions:
  390. 1.) no overlap: src right < dest left or src left > dest right or
  391. 2.) same geometry and src left >= dest left
  392. same geometry if ginc(s)=ginc(d) with
  393. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  394. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  395. *)
  396. BEGIN
  397. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  398. dim := GetDim( src );
  399. WHILE (d < dim) DO
  400. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  401. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  402. END;
  403. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  404. ELSIF ((sr - sl) = (dr - dl)) THEN
  405. IF (sl = dl) THEN (* same memory region, both directions possible *)
  406. ELSIF (sl > dl) THEN
  407. EXCL( modes, down ) (* only copy up possible *)
  408. ELSE (*sl < dl*)
  409. EXCL( modes, up ) (* only copy down possible *)
  410. END;
  411. ELSE
  412. modes := modes - {down, up}; (* neither nor *)
  413. END;
  414. END CopyUpCompatible;
  415. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  416. Size: SIZE ): ANY;
  417. (* allocate a temporary block containing both descriptor and data *)
  418. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  419. BEGIN
  420. HALT(100);
  421. (*
  422. IF statistics THEN INC( allocTemp ) END;
  423. d := 0; len := Size; dim := GetDim( src );
  424. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  425. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  426. dest := SYSTEM.VAL( SIZE, p );
  427. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  428. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  429. FOR i := 0 TO dim - 1 DO
  430. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  431. len := len * GetLen( src, i );
  432. END;
  433. (* Report("allocdest",dest,dim); *)
  434. RETURN p;
  435. *)
  436. END AllocateTemp;
  437. (*** procedures to traverse arrays and apply operators *)
  438. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  439. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  440. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  441. origdest: ADDRESS; modes: SET;
  442. dest, left: ADDRESS; dim: SIZE;
  443. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  444. VAR len: SIZE; linc, dinc: SIZE;
  445. BEGIN
  446. IF dim = loopd THEN
  447. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  448. IF conservative THEN INC( glen, looplen ) END;
  449. ELSE
  450. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  451. dinc := GetIncr( dest, dim ); INC( dim );
  452. WHILE (len > 0) DO
  453. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  454. END;
  455. END;
  456. END Traverse;
  457. BEGIN
  458. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  459. origdest := 0; modes := {up, down};
  460. (* allocate destination, if necessary *)
  461. p := AllocateSame( dest, left, elementSize );
  462. IF p = NIL THEN
  463. CopyUpCompatible( dest, left, modes );
  464. IF up IN modes THEN (* nothing to be done *)
  465. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  466. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  467. END;
  468. END;
  469. (* allocate destination, if necessary *)
  470. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  471. ELSIF CheckGeometry( left, dest, dim )
  472. END; *)
  473. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  474. (* check pattern: longest piece that can be done with a loop *)
  475. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  476. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  477. IF up IN modes THEN (* nothing to be done *)
  478. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  479. ELSE CopyContent( origdest, dest, elementSize );
  480. END;
  481. SYSTEM.PUT( d, dest );
  482. IF d = p THEN (* new block *)
  483. Heaps.CheckAssignment(d,dest);
  484. END;
  485. END ApplyGenericUnaryAAOpS;
  486. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  487. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  488. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  489. origdest: SIZE; modes: SET;
  490. dest, left: ADDRESS; dim: SIZE;
  491. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  492. VAR len: SIZE; linc, dinc: SIZE;
  493. BEGIN
  494. IF dim = loopd THEN
  495. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  496. IF conservative THEN INC( glen, looplen ) END;
  497. ELSE
  498. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  499. dinc := GetIncr( dest, dim ); INC( dim );
  500. WHILE (len > 0) DO
  501. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  502. END;
  503. END;
  504. END Traverse;
  505. BEGIN
  506. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  507. origdest := 0; modes := {up, down};
  508. (* allocate destination, if necessary *)
  509. p := AllocateSame( dest, left, elementSize );
  510. IF p = NIL THEN
  511. CopyUpCompatible( dest, left, modes );
  512. IF up IN modes THEN (* nothing to be done *)
  513. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  514. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  515. END;
  516. END;
  517. (* allocate destination, if necessary *)
  518. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  519. ELSIF CheckGeometry( left, dest, dim )
  520. END; *)
  521. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  522. (* check pattern: longest piece that can be done with a loop *)
  523. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  524. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  525. IF up IN modes THEN (* nothing to be done *)
  526. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  527. ELSE CopyContent( origdest, dest, elementSize );
  528. END;
  529. SYSTEM.PUT( d, dest );
  530. IF d = p THEN (* new block *)
  531. Heaps.CheckAssignment(d,dest);
  532. END;
  533. END ApplyGenericUnaryAAOpI;
  534. (** apply unary operator to array: array SIZE -> array SIZE *)
  535. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  536. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  537. origdest: SIZE; modes: SET;
  538. dest, left: ADDRESS; dim: SIZE;
  539. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  540. VAR len: SIZE; linc, dinc: SIZE;
  541. BEGIN
  542. IF dim = loopd THEN
  543. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  544. IF conservative THEN INC( glen, looplen ) END;
  545. ELSE
  546. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  547. dinc := GetIncr( dest, dim ); INC( dim );
  548. WHILE (len > 0) DO
  549. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  550. END;
  551. END;
  552. END Traverse;
  553. BEGIN
  554. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  555. origdest := 0; modes := {up, down};
  556. (* allocate destination, if necessary *)
  557. p := AllocateSame( dest, left, elementSize );
  558. IF p = NIL THEN
  559. CopyUpCompatible( dest, left, modes );
  560. IF up IN modes THEN (* nothing to be done *)
  561. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  562. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  563. END;
  564. END;
  565. (* allocate destination, if necessary *)
  566. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  567. ELSIF CheckGeometry( left, dest, dim )
  568. END; *)
  569. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  570. (* check pattern: longest piece that can be done with a loop *)
  571. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  572. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  573. IF up IN modes THEN (* nothing to be done *)
  574. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  575. ELSE CopyContent( origdest, dest, elementSize );
  576. END;
  577. SYSTEM.PUT( d, dest );
  578. IF d = p THEN (* new block *)
  579. Heaps.CheckAssignment(d,dest);
  580. END;
  581. END ApplyGenericUnaryAAOpL;
  582. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  583. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  584. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  585. origdest: SIZE; modes: SET;
  586. VAR dest, left: ADDRESS; dim: SIZE;
  587. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  588. VAR len: SIZE; linc, dinc: SIZE;
  589. BEGIN
  590. IF dim = loopd THEN
  591. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  592. IF conservative THEN INC( glen, looplen ) END;
  593. ELSE
  594. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  595. dinc := GetIncr( dest, dim ); INC( dim );
  596. WHILE (len > 0) DO
  597. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  598. DEC( len );
  599. END;
  600. END;
  601. END Traverse;
  602. BEGIN
  603. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  604. origdest := 0; modes := {up, down};
  605. (* allocate destination, if necessary *)
  606. p := AllocateSame( dest, left, elementSize );
  607. IF p = NIL THEN
  608. CopyUpCompatible( dest, left, modes );
  609. IF up IN modes THEN (* nothing to be done *)
  610. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  611. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  612. END;
  613. END;
  614. (*
  615. (* allocate destination, if necessary *)
  616. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  617. ELSIF CheckGeometry( left, dest, dim )
  618. END;
  619. *)
  620. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  621. (* check pattern: longest piece that can be done with a loop *)
  622. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  623. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  624. IF up IN modes THEN (* nothing to be done *)
  625. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  626. ELSE CopyContent( origdest, dest, elementSize );
  627. END;
  628. SYSTEM.PUT( d, dest );
  629. IF d = p THEN (* new block *)
  630. Heaps.CheckAssignment(d,dest);
  631. END;
  632. END ApplyGenericUnaryAAOpH;
  633. (** apply unary operator to array: array REAL -> array REAL *)
  634. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  635. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  636. origdest: SIZE; modes: SET;
  637. dest, left: ADDRESS; dim: SIZE;
  638. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  639. VAR len: SIZE; linc, dinc: SIZE;
  640. BEGIN
  641. IF dim = loopd THEN
  642. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  643. IF conservative THEN INC( glen, looplen ) END;
  644. ELSE
  645. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  646. dinc := GetIncr( dest, dim ); INC( dim );
  647. WHILE (len > 0) DO
  648. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  649. END;
  650. END;
  651. END Traverse;
  652. BEGIN
  653. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  654. origdest := 0; modes := {up, down};
  655. (* allocate destination, if necessary *)
  656. p := AllocateSame( dest, left, elementSize );
  657. IF p = NIL THEN
  658. CopyUpCompatible( dest, left, modes );
  659. IF up IN modes THEN (* nothing to be done *)
  660. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  661. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  662. END;
  663. END;
  664. (* allocate destination, if necessary *)
  665. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  666. ELSIF CheckGeometry( left, dest, dim )
  667. END; *)
  668. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  669. (* check pattern: longest piece that can be done with a loop *)
  670. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  671. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  672. IF up IN modes THEN (* nothing to be done *)
  673. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  674. ELSE CopyContent( origdest, dest, elementSize );
  675. END;
  676. SYSTEM.PUT( d, dest );
  677. IF d = p THEN (* new block *)
  678. Heaps.CheckAssignment(d,dest);
  679. END;
  680. END ApplyGenericUnaryAAOpR;
  681. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  682. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  683. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  684. origdest: SIZE; modes: SET;
  685. dest, left: ADDRESS; dim: SIZE;
  686. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  687. VAR len: SIZE; linc, dinc: SIZE;
  688. BEGIN
  689. IF dim = loopd THEN
  690. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  691. IF conservative THEN INC( glen, looplen ) END;
  692. ELSE
  693. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  694. dinc := GetIncr( dest, dim ); INC( dim );
  695. WHILE (len > 0) DO
  696. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  697. DEC( len );
  698. END;
  699. END;
  700. END Traverse;
  701. BEGIN
  702. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  703. origdest := 0; modes := {up, down};
  704. (* allocate destination, if necessary *)
  705. p := AllocateSame( dest, left, elementSize );
  706. IF p = NIL THEN
  707. CopyUpCompatible( dest, left, modes );
  708. IF up IN modes THEN (* nothing to be done *)
  709. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  710. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  711. END;
  712. END;
  713. (*
  714. (* allocate destination, if necessary *)
  715. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  716. ELSIF CheckGeometry( left, dest, dim )
  717. END;
  718. *)
  719. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  720. (* check pattern: longest piece that can be done with a loop *)
  721. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  722. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  723. IF up IN modes THEN (* nothing to be done *)
  724. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  725. ELSE CopyContent( origdest, dest, elementSize );
  726. END;
  727. SYSTEM.PUT( d, dest );
  728. IF d = p THEN (* new block *)
  729. Heaps.CheckAssignment(d,dest);
  730. END;
  731. END ApplyGenericUnaryAAOpX;
  732. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  733. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  734. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  735. origdest: SIZE; modes: SET;
  736. dest, left: ADDRESS; dim: SIZE;
  737. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  738. VAR len: SIZE; linc, dinc: SIZE;
  739. BEGIN
  740. IF dim = loopd THEN
  741. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  742. IF conservative THEN INC( glen, looplen ) END;
  743. ELSE
  744. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  745. dinc := GetIncr( dest, dim ); INC( dim );
  746. WHILE (len > 0) DO
  747. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  748. DEC( len );
  749. END;
  750. END;
  751. END Traverse;
  752. BEGIN
  753. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  754. origdest := 0; modes := {up, down};
  755. (* allocate destination, if necessary *)
  756. p := AllocateSame( dest, left, elementSize );
  757. IF p = NIL THEN
  758. CopyUpCompatible( dest, left, modes );
  759. IF up IN modes THEN (* nothing to be done *)
  760. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  761. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  762. END;
  763. END;
  764. (*
  765. (* allocate destination, if necessary *)
  766. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  767. ELSIF CheckGeometry( left, dest, dim )
  768. END;
  769. *)
  770. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  771. (* check pattern: longest piece that can be done with a loop *)
  772. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  773. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  774. IF up IN modes THEN (* nothing to be done *)
  775. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  776. ELSE CopyContent( origdest, dest, elementSize );
  777. END;
  778. SYSTEM.PUT( d, dest );
  779. IF d = p THEN (* new block *)
  780. Heaps.CheckAssignment(d,dest);
  781. END;
  782. END ApplyGenericUnaryAAOpZ;
  783. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  784. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  785. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  786. origdest: SIZE; modes: SET;
  787. dest, left: ADDRESS; dim: SIZE;
  788. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  789. VAR len: SIZE; linc, dinc: SIZE;
  790. BEGIN
  791. IF dim = loopd THEN
  792. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  793. IF conservative THEN INC( glen, looplen ) END;
  794. ELSE
  795. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  796. dinc := GetIncr( dest, dim ); INC( dim );
  797. WHILE (len > 0) DO
  798. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  799. DEC( len );
  800. END;
  801. END;
  802. END Traverse;
  803. BEGIN
  804. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  805. origdest := 0; modes := {up, down};
  806. (* allocate destination, if necessary *)
  807. p := AllocateSame( dest, left, elementSize );
  808. IF p = NIL THEN
  809. CopyUpCompatible( dest, left, modes );
  810. IF up IN modes THEN (* nothing to be done *)
  811. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  812. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  813. END;
  814. END;
  815. (*
  816. (* allocate destination, if necessary *)
  817. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  818. ELSIF CheckGeometry( left, dest, dim )
  819. END;
  820. *)
  821. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  822. (* check pattern: longest piece that can be done with a loop *)
  823. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  824. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  825. IF up IN modes THEN (* nothing to be done *)
  826. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  827. ELSE CopyContent( origdest, dest, elementSize );
  828. END;
  829. SYSTEM.PUT( d, dest );
  830. IF d = p THEN (* new block *)
  831. Heaps.CheckAssignment(d,dest);
  832. END;
  833. END ApplyGenericUnaryAAOpLZ;
  834. (** apply unary operator to array: array -> array *)
  835. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  836. Loop: UnaryAALoop );
  837. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  838. origdest: SIZE; modes: SET;
  839. dest, left: ADDRESS; dim: SIZE;
  840. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  841. VAR len: SIZE; linc, dinc: SIZE;
  842. BEGIN
  843. IF dim = loopd THEN
  844. Loop( ladr, dadr, loopli, loopdi, looplen );
  845. IF conservative THEN INC( glen, looplen ) END;
  846. ELSE
  847. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  848. dinc := GetIncr( dest, dim ); INC( dim );
  849. WHILE (len > 0) DO
  850. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  851. DEC( len );
  852. END;
  853. END;
  854. END Traverse;
  855. BEGIN
  856. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  857. origdest := 0; modes := {up, down};
  858. (* allocate destination, if necessary *)
  859. p := AllocateSame( dest, left, elementSize );
  860. IF p = NIL THEN
  861. CopyUpCompatible( dest, left, modes );
  862. IF up IN modes THEN (* nothing to be done *)
  863. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  864. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  865. END;
  866. END;
  867. (*
  868. (* allocate destination, if necessary *)
  869. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  870. ELSIF CheckGeometry( left, dest, dim )
  871. END;
  872. *)
  873. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  874. (* check pattern: longest piece that can be done with a loop *)
  875. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  876. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  877. IF up IN modes THEN (* nothing to be done *)
  878. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  879. ELSE CopyContent( origdest, dest, elementSize );
  880. END;
  881. SYSTEM.PUT( d, dest );
  882. IF d = p THEN (* new block *)
  883. Heaps.CheckAssignment(d,dest);
  884. END;
  885. END ApplyUnaryAAOp;
  886. (** apply unary operator to array: array -> scalar *)
  887. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  888. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  889. VAR left: ADDRESS; dim: SIZE;
  890. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  891. VAR len: SIZE; linc: SIZE;
  892. BEGIN
  893. IF dim = loopd THEN
  894. Loop( ladr, dest, loopli, looplen );
  895. IF conservative THEN INC( glen, looplen ) END;
  896. ELSE
  897. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  898. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  899. END;
  900. END Traverse;
  901. BEGIN
  902. SYSTEM.GET( l, left ); dim := GetDim( left );
  903. IF debug THEN Report( "AS: left", left ); END;
  904. (* check pattern: longest piece that can be done with a loop *)
  905. IF conservative THEN glen := 0 END;
  906. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  907. IF conservative THEN
  908. looplen := 1;
  909. WHILE (dim > 0) DO
  910. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  911. END;
  912. ASSERT( looplen = glen );
  913. END;
  914. END ApplyUnaryASOp;
  915. (** apply unary operator to array: scalar -> array *)
  916. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  917. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  918. VAR dest: ADDRESS; dim: SIZE;
  919. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  920. VAR len: SIZE; dinc: SIZE;
  921. BEGIN
  922. IF dim = loopd THEN
  923. Loop( right, dadr, loopdi, looplen );
  924. IF conservative THEN INC( glen, looplen ) END;
  925. ELSE
  926. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  927. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  928. END;
  929. END Traverse;
  930. BEGIN
  931. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  932. IF debug THEN Report( "AS: dest", dest ); END;
  933. (* check pattern: longest piece that can be done with a loop *)
  934. IF conservative THEN glen := 0 END;
  935. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  936. IF conservative THEN
  937. looplen := 1;
  938. WHILE (dim > 0) DO
  939. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  940. END;
  941. ASSERT( looplen = glen );
  942. END;
  943. END ApplyUnarySAOp;
  944. (** apply binary operator : array x array -> array *)
  945. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  946. Loop: BinaryAAALoop );
  947. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  948. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  949. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  950. VAR len: SIZE; linc, rinc, dinc: SIZE;
  951. BEGIN
  952. IF dim = loopd THEN
  953. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  954. IF conservative THEN INC( glen, looplen ) END;
  955. ELSE
  956. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  957. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  958. WHILE (len > 0) DO
  959. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  960. INC( dadr, dinc ); DEC( len );
  961. END;
  962. END;
  963. END Traverse;
  964. BEGIN
  965. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  966. (* allocate destination, if necessary *)
  967. IF ~SameShape( left, right ) THEN
  968. Halt( GeometryMismatch, left, right, 0 )
  969. END;
  970. origdest := 0; modes := {up, down};
  971. p := AllocateSame( dest, left, elementSize );
  972. IF p = NIL THEN
  973. CopyUpCompatible( dest, left, modes );
  974. CopyUpCompatible( dest, right, modes );
  975. IF up IN modes THEN (* nothing to be done *)
  976. ELSIF down IN modes THEN
  977. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  978. ELSE
  979. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  980. END;
  981. END;
  982. (* debugging *)
  983. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  984. (* check pattern: longest piece that can be done with a loop *)
  985. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  986. (* run through dimensions *)
  987. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  988. IF up IN modes THEN (* nothing to be done *)
  989. ELSIF down IN modes THEN
  990. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  991. ELSE CopyContent( origdest, dest, elementSize );
  992. END;
  993. SYSTEM.PUT( d, dest );
  994. IF d = p THEN (* new block *)
  995. Heaps.CheckAssignment(d,dest);
  996. END;
  997. END ApplyBinaryAAAOp;
  998. (** apply binary operator: array x scalar -> array *)
  999. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  1000. elementSize: SIZE;
  1001. Loop: BinaryASALoop );
  1002. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1003. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1004. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1005. VAR len: SIZE; linc, dinc: SIZE;
  1006. BEGIN
  1007. IF dim = loopd THEN
  1008. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1009. IF conservative THEN INC( glen, looplen ) END;
  1010. ELSE
  1011. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1012. dinc := GetIncr( dest, dim ); INC( dim );
  1013. WHILE (len > 0) DO
  1014. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1015. DEC( len );
  1016. END;
  1017. END;
  1018. END Traverse;
  1019. BEGIN
  1020. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1021. (* allocate destination, if necessary *)
  1022. origdest := 0; modes := {up, down};
  1023. p := AllocateSame( dest, left, elementSize );
  1024. IF p = NIL THEN
  1025. CopyUpCompatible( dest, left, modes );
  1026. IF up IN modes THEN (* nothing to be done *)
  1027. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1028. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1029. END;
  1030. END;
  1031. (* debugging *)
  1032. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1033. (* check pattern: longest piece that can be done with a loop *)
  1034. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1035. (* run through dimensions *)
  1036. IF conservative THEN glen := 0 END;
  1037. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1038. IF conservative THEN
  1039. looplen := 1;
  1040. WHILE (dim > 0) DO
  1041. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1042. END;
  1043. ASSERT( looplen = glen );
  1044. END;
  1045. IF up IN modes THEN (* nothing to be done *)
  1046. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1047. ELSE CopyContent( origdest, dest, elementSize );
  1048. END;
  1049. SYSTEM.PUT( d, dest );
  1050. IF d = p THEN (* new block *)
  1051. Heaps.CheckAssignment(d,dest);
  1052. END;
  1053. END ApplyBinaryASAOp;
  1054. (** apply binary operator: array x array -> scalar *)
  1055. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1056. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1057. left, right: ADDRESS; dim: SIZE;
  1058. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1059. VAR len: SIZE; linc, rinc: SIZE;
  1060. BEGIN
  1061. IF dim = loopd THEN
  1062. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1063. IF conservative THEN INC( glen, looplen ) END;
  1064. ELSE
  1065. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1066. rinc := GetIncr( right, dim ); INC( dim );
  1067. WHILE (len > 0) DO
  1068. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1069. DEC( len );
  1070. END;
  1071. END;
  1072. END Traverse;
  1073. BEGIN
  1074. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1075. (* check array lengths *)
  1076. IF ~SameShape( left, right ) THEN
  1077. Halt( GeometryMismatch, left, right, 0 )
  1078. END;
  1079. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1080. (* check pattern: longest piece that can be done with a loop *)
  1081. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1082. (* run through dimensions *)
  1083. IF conservative THEN glen := 0 END;
  1084. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1085. IF conservative THEN
  1086. looplen := 1;
  1087. WHILE (dim > 0) DO
  1088. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1089. END;
  1090. ASSERT( looplen = glen );
  1091. END;
  1092. END ApplyBinaryAASOp;
  1093. (** special binary operator: array x array -> boolean *)
  1094. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1095. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1096. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1097. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1098. VAR len: SIZE; linc, rinc: SIZE;
  1099. BEGIN
  1100. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1101. ELSE
  1102. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1103. rinc := GetIncr( right, dim ); INC( dim );
  1104. WHILE (len > 0) DO
  1105. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1106. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1107. END;
  1108. RETURN TRUE;
  1109. END;
  1110. END Traverse;
  1111. BEGIN
  1112. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1113. (* check array lengths *)
  1114. IF ~SameShape( left, right ) THEN
  1115. RETURN geometryMismatchDefault
  1116. END;
  1117. (* is destination already allocated? (might be a temporary result) *)
  1118. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1119. (* check pattern: longest piece that can be done with a loop *)
  1120. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1121. (* run through dimensions *)
  1122. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1123. END ApplyBinaryAABOp;
  1124. (** special binary operator: array x scalar -> boolean *)
  1125. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1126. Loop: BinaryASBLoop ): BOOLEAN;
  1127. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1128. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1129. VAR len: SIZE; linc: SIZE;
  1130. BEGIN
  1131. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1132. ELSE
  1133. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1134. WHILE (len > 0) DO
  1135. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1136. INC( ladr, linc ); DEC( len );
  1137. END;
  1138. RETURN TRUE;
  1139. END;
  1140. END Traverse;
  1141. BEGIN
  1142. SYSTEM.GET( l, left ); dim := GetDim( left );
  1143. IF debug THEN Report( "AAB:left", left ); END;
  1144. (* check pattern: longest piece that can be done with a loop *)
  1145. FindPattern1( left, dim, loopd, looplen, loopli );
  1146. (* run through dimensions *)
  1147. RETURN Traverse( 0, GetAdr( left ) );
  1148. END ApplyBinaryASBOp;
  1149. (**** operators *)
  1150. (*** copy *)
  1151. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1152. CODE {SYSTEM.i386}
  1153. MOV ECX, [EBP+ladr] ; ECX := ladr
  1154. MOV EDX, [EBP+dadr] ; EDX := dadr
  1155. MOV EBX, [EBP+len] ; EBX := len
  1156. start:
  1157. CMP EBX, 0 ;
  1158. JLE end ; WHILE EBX > 0 DO
  1159. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1160. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1161. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1162. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1163. DEC EBX ; DEC(EBX)
  1164. JMP start
  1165. end:
  1166. END Copy4;
  1167. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1168. CODE {SYSTEM.i386}
  1169. MOV ECX, [EBP+ladr] ; ECX := ladr
  1170. MOV EDX, [EBP+dadr] ; EDX := dadr
  1171. MOV EBX, [EBP+len] ; EBX := len
  1172. start:
  1173. CMP EBX, 0 ;
  1174. JLE end ; WHILE EBX > 0 DO
  1175. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1176. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1177. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1178. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1179. DEC EBX ; DEC(EBX)
  1180. JMP start
  1181. end:
  1182. END Copy2;
  1183. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1184. CODE {SYSTEM.i386}
  1185. MOV ECX, [EBP+ladr] ; ECX := ladr
  1186. MOV EDX, [EBP+dadr] ; EDX := dadr
  1187. MOV EBX, [EBP+len] ; EBX := len
  1188. start:
  1189. CMP EBX, 0 ;
  1190. JLE end ; WHILE EBX > 0 DO
  1191. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1192. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1193. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1194. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1195. DEC EBX ; DEC(EBX)
  1196. JMP start
  1197. end:
  1198. END Copy1;
  1199. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1200. CODE {SYSTEM.i386}
  1201. MOV ECX, [EBP+ladr] ; ECX := ladr
  1202. MOV EDX, [EBP+dadr] ; EDX := dadr
  1203. MOV EBX, [EBP+len] ; EBX := len
  1204. start:
  1205. CMP EBX, 0 ;
  1206. JLE end ; WHILE EBX > 0 DO
  1207. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1208. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1209. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1210. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1211. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1212. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1213. DEC EBX ; DEC(EBX)
  1214. JMP start
  1215. end:
  1216. END Copy8;
  1217. PROCEDURE -MoveB*( srcadr, destadr, len: SIZE );
  1218. (** Correct move if overlap, might be important for some array operations,
  1219. do not use SYSTEM.MOVE. *)
  1220. CODE {SYSTEM.i386}
  1221. MOV ECX, [ESP] ; len
  1222. MOV EDI, [ESP+4] ; destadr
  1223. MOV ESI, [ESP+8] ; srcadr
  1224. CMP ESI, EDI
  1225. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1226. MOV EAX, ESI
  1227. ADD EAX, ECX
  1228. CMP EAX, EDI
  1229. JBE moveup ; no overlap, no problem, move up
  1230. MOV ESI, EAX
  1231. ADD EDI, ECX
  1232. DEC ESI
  1233. DEC EDI
  1234. STD ; move down since overlap occured
  1235. REP
  1236. MOVSB
  1237. JMP done
  1238. moveup:
  1239. CLD
  1240. MOV BL, CL
  1241. SHR ECX, 2
  1242. AND BL, 00000003H ; rest to move after 4 byte move
  1243. REP
  1244. MOVSD ; move 4 bytes each step
  1245. MOV CL, BL
  1246. REP
  1247. MOVSB ; move rest in one byte steps
  1248. done:
  1249. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1250. END MoveB;
  1251. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1252. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1253. origdest: ADDRESS; modes: SET; dim: SIZE;
  1254. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1255. BEGIN
  1256. IF (dinc = elementSize) & (linc = elementSize) THEN
  1257. MoveB( ladr, dadr, len * elementSize );
  1258. (*
  1259. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1260. *)
  1261. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1262. len := len * elementSize;
  1263. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1264. ELSIF elementSize = 1 THEN
  1265. Copy1( ladr, dadr, linc, dinc, len );
  1266. (*
  1267. WHILE (len > 0) DO
  1268. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1269. END;
  1270. *)
  1271. ELSIF elementSize = 2 THEN
  1272. Copy2( ladr, dadr, linc, dinc, len );
  1273. (*
  1274. WHILE (len > 0) DO
  1275. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1276. END;
  1277. *)
  1278. ELSIF elementSize = 4 THEN
  1279. Copy4( ladr, dadr, linc, dinc, len );
  1280. (*
  1281. WHILE (len > 0) DO
  1282. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1283. END;
  1284. *)
  1285. ELSIF elementSize = 8 THEN
  1286. Copy8( ladr, dadr, linc, dinc, len );
  1287. (*
  1288. WHILE (len > 0) DO
  1289. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1290. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1291. INC( dadr, dinc );
  1292. END;
  1293. *)
  1294. ELSE (* SYSTEM.MOVE is expensive ! *)
  1295. WHILE (len > 0) DO
  1296. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1297. INC( dadr, dinc );
  1298. END;
  1299. END;
  1300. END Loop;
  1301. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1302. VAR len: SIZE; linc, dinc: SIZE;
  1303. BEGIN
  1304. IF dim = loopd THEN
  1305. Loop( ladr, dadr, loopli, loopdi, looplen );
  1306. IF conservative THEN INC( glen, looplen ) END;
  1307. ELSE
  1308. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1309. dinc := GetIncr( dest, dim ); INC( dim );
  1310. WHILE (len > 0) DO
  1311. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1312. DEC( len );
  1313. END;
  1314. END;
  1315. END Traverse;
  1316. BEGIN
  1317. dim := GetDim( src );
  1318. origdest := 0; modes := {up, down}; (* copy modes *)
  1319. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1320. CopyUpCompatible( dest, src, modes );
  1321. IF up IN modes THEN (* nothing to be done *)
  1322. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1323. Reverse( src, dim ); Reverse( dest, dim )
  1324. ELSE (* can only copy via double buffer *)
  1325. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1326. END;
  1327. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1328. END;
  1329. (* check pattern: longest piece that can be done with a loop *)
  1330. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1331. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1332. IF up IN modes THEN (* nothing to be done *)
  1333. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1334. ELSE CopyContent( origdest, dest, elementSize );
  1335. END;
  1336. END CopyContent;
  1337. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  1338. VAR ptr, data: ANY; Size: SIZE;
  1339. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1340. PROCEDURE NewData;
  1341. VAR dim, len, size: SIZE;
  1342. BEGIN
  1343. dim := GetDim( src ); size := elementsize;
  1344. PutDim( dest, dim );
  1345. PutSize( dest, elementsize );
  1346. WHILE (dim > 0) DO
  1347. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1348. PutInc( dest, dim, size ); size := size * len;
  1349. END;
  1350. SYSTEM.NEW( data, size + ArrayAlignment);
  1351. PutAdr( dest, Align(data));
  1352. PutPtr( dest, data );
  1353. END NewData;
  1354. BEGIN
  1355. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1356. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1357. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1358. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1359. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1360. PutFlags(dest, {TensorFlag});
  1361. NewData(); RETURN ptr;
  1362. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1363. (* check if re-allocation of descriptor is allowed *)
  1364. IF ~(TensorFlag IN GetFlags( dest )) &
  1365. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1366. HALT( 100 );
  1367. END;
  1368. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1369. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1370. PutFlags(dest, {TensorFlag});
  1371. NewData();
  1372. RETURN ptr;
  1373. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1374. (* check if re-allocation of array data is allowed *)
  1375. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1376. HALT( 100 );
  1377. END;
  1378. NewData();
  1379. RETURN data;
  1380. ELSE (* nothing to do *)
  1381. RETURN NIL;
  1382. END;
  1383. END AllocateSame;
  1384. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1385. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1386. BEGIN
  1387. dim := GetDim(src);
  1388. p := GetArrayDesc(dim);
  1389. adr := p;
  1390. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1391. PutAdr( src, 0 );
  1392. PutPtr( src, NIL );
  1393. PutFlags( src, {} );
  1394. RETURN p;
  1395. END TempDescCopy;
  1396. (* used when arrays are passed by value *)
  1397. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: SIZE );
  1398. VAR p: ANY;
  1399. BEGIN
  1400. ASSERT( src = dest );
  1401. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1402. CopyArray( dest, p, elementsize );
  1403. END CopyArraySelf;
  1404. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1405. VAR p: ANY; srcdim, destdim: SIZE;
  1406. BEGIN
  1407. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1408. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1409. srcdim := GetDim(src);
  1410. destdim := GetDim(dest);
  1411. (*
  1412. Debugging.Stack("copy array");
  1413. *)
  1414. Report( "copy array source", src ); Report( "copy array des", dest );
  1415. HALT(100);
  1416. ELSIF src = dest THEN (* self copy *)
  1417. CopyArraySelf( dest, src, elementsize );
  1418. ELSE
  1419. p := AllocateSame( dest, src, elementsize );
  1420. CopyContent( dest, src, elementsize )
  1421. END;
  1422. END CopyArray;
  1423. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1424. BEGIN
  1425. dest := 0; CopyTensor( dest, src, elementsize );
  1426. END CopyTensorSelf;
  1427. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1428. elementsize: SIZE );
  1429. VAR p: ANY;
  1430. BEGIN
  1431. (* Report("dest",dest); Report("src",src); *)
  1432. IF (src = NIL) THEN dest := NIL
  1433. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1434. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1435. CopyContent( dest, src, elementsize );
  1436. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1437. ELSE CopyContent( dest, src, elementsize )
  1438. END;
  1439. END CopyTensor;
  1440. (* copy descriptor of src to that of dest. If not existent then create.*)
  1441. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS): ANY;
  1442. VAR ptr: ANY; flags: SET;
  1443. PROCEDURE CopyDescriptor;
  1444. BEGIN
  1445. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1446. PutPtr(dest, GetPtr(src)); (* GC! *)
  1447. END CopyDescriptor;
  1448. BEGIN
  1449. (*
  1450. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1451. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1452. *)
  1453. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1454. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1455. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1456. CopyDescriptor();
  1457. PutFlags(dest, {TensorFlag});
  1458. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1459. flags := GetFlags(dest);
  1460. (* check if re-allocation of descriptor is allowed *)
  1461. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1462. Halt(DimensionMismatch,src,0,dest);
  1463. END;
  1464. (* create a new descriptor!!! (added by Alexey) *)
  1465. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1466. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1467. CopyDescriptor();
  1468. PutFlags(dest, flags);
  1469. ELSE
  1470. flags := GetFlags(dest);
  1471. (* check if re-allocation of array data is allowed *)
  1472. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1473. Halt(AllocationForbidden,src,0,dest);
  1474. END;
  1475. CopyDescriptor();
  1476. PutFlags(dest, flags);
  1477. END;
  1478. RETURN ptr;
  1479. END ShallowCopy;
  1480. (*
  1481. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1482. BEGIN
  1483. IF debug THEN
  1484. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1485. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1486. END;
  1487. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1488. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1489. END DescriptorCopy;
  1490. *)
  1491. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1492. VAR p: ANY; s,d: ADDRESS;
  1493. BEGIN
  1494. s := SYSTEM.VAL(ADDRESS,src);
  1495. d := SYSTEM.VAL(ADDRESS,dest);
  1496. p := ShallowCopy(d,s);
  1497. SYSTEM.PUT(ADDRESSOF(dest),d);
  1498. IF p = d THEN
  1499. Heaps.CheckAssignment(ADDRESS OF dest, p);
  1500. END;
  1501. END ZeroCopy;
  1502. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1503. BEGIN
  1504. ZeroCopy(src, RESULT);
  1505. RETURN RESULT
  1506. END "ALIAS";
  1507. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1508. VAR dim: SIZE;
  1509. BEGIN
  1510. dim := GetDim( l );
  1511. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1512. WHILE (dim > 0) DO
  1513. DEC( dim );
  1514. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1515. END;
  1516. RETURN TRUE;
  1517. END SameShape;
  1518. (*
  1519. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1520. (*
  1521. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1522. check if deep copy can be avoided and if so then do a shallow copy
  1523. *)
  1524. BEGIN
  1525. ASSERT( dest # 0 ); (* impossible *)
  1526. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1527. HALT( 100 );
  1528. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1529. (* must copy (and allocate) *)
  1530. CopyArray( dest, src, elementsize );
  1531. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1532. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1533. ELSE CopyContent( dest, src, elementsize )
  1534. END;
  1535. ELSE DescriptorCopy( src, dest )
  1536. END;
  1537. END ZeroCopyArray;
  1538. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1539. (*
  1540. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1541. check if deep copy can be avoided and if so then do a shallow copy
  1542. *)
  1543. BEGIN
  1544. IF debug THEN
  1545. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1546. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1547. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1548. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1549. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1550. END;
  1551. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1552. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1553. ELSE
  1554. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1555. END;
  1556. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1557. (* must copy (and allocate) *)
  1558. CopyTensor( dest, src, elementsize );
  1559. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1560. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1561. ELSE
  1562. HALT( 100 ); (* copy forbidden *)
  1563. END;
  1564. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1565. DescriptorCopy( src, dest );
  1566. ELSE
  1567. HALT( 100 ); (* different shapes: not allowed *)
  1568. END;
  1569. END ZeroCopyTensor;
  1570. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1571. VAR i: LONGINT;
  1572. BEGIN
  1573. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1574. CopyContent( dest, left, elementSize )
  1575. ELSE
  1576. IF debug THEN
  1577. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1578. KernelLog.Ln;
  1579. END;
  1580. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1581. FOR i := 0 TO dim - 1 DO
  1582. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1583. END;
  1584. END;
  1585. END ZeroCopy;
  1586. *)
  1587. (*** conversions ****)
  1588. (** SHORTINT -> INTEGER *)
  1589. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1590. BEGIN
  1591. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1592. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1593. DEC( len );
  1594. END;
  1595. END ConvertASAILoop;
  1596. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1597. BEGIN
  1598. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1599. RETURN RESULT
  1600. END "@Convert";
  1601. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1602. BEGIN
  1603. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1604. RETURN RESULT
  1605. END "LONG";
  1606. (** SHORTINT -> LONGINT *)
  1607. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1608. BEGIN
  1609. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1610. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1611. DEC( len );
  1612. END;
  1613. END ConvertLoopSL;
  1614. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1615. BEGIN
  1616. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1617. RETURN RESULT
  1618. END "@Convert";
  1619. (** SHORTINT -> REAL *)
  1620. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1621. VAR lval: SHORTINT; dval: REAL;
  1622. BEGIN
  1623. WHILE (len > 0) DO
  1624. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1625. INC( dadr, dinc ); DEC( len );
  1626. END;
  1627. END ConvertLoopSR;
  1628. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1629. BEGIN
  1630. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1631. RETURN RESULT
  1632. END "@Convert";
  1633. (** SHORTINT -> LONGREAL *)
  1634. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1635. VAR lval: SHORTINT; dval: LONGREAL;
  1636. BEGIN
  1637. WHILE (len > 0) DO
  1638. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1639. INC( dadr, dinc ); DEC( len );
  1640. END;
  1641. END ConvertLoopSX;
  1642. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1643. BEGIN
  1644. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1645. RETURN RESULT
  1646. END "@Convert";
  1647. (** INTEGER -> SHORTINT (SHORT) *)
  1648. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1649. VAR lval: INTEGER; dval: SHORTINT;
  1650. BEGIN
  1651. WHILE (len > 0) DO
  1652. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1653. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1654. END;
  1655. END ConvertLoopIS;
  1656. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1657. BEGIN
  1658. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1659. RETURN RESULT
  1660. END "@Convert";
  1661. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1662. BEGIN
  1663. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1664. RETURN RESULT
  1665. END "SHORT";
  1666. (** INTEGER -> LONGINT *)
  1667. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1668. BEGIN
  1669. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1670. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1671. DEC( len );
  1672. END;
  1673. END ConvertLoopIL;
  1674. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1675. BEGIN
  1676. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1677. RETURN RESULT
  1678. END "@Convert";
  1679. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1680. BEGIN
  1681. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1682. RETURN RESULT
  1683. END "LONG";
  1684. (** INTEGER -> REAL *)
  1685. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1686. VAR lval: INTEGER; dval: REAL;
  1687. BEGIN
  1688. WHILE (len > 0) DO
  1689. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1690. INC( dadr, dinc ); DEC( len );
  1691. END;
  1692. END ConvertLoopIR;
  1693. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1694. BEGIN
  1695. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1696. RETURN RESULT
  1697. END "@Convert";
  1698. (** INTEGER -> LONGREAL *)
  1699. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1700. VAR lval: INTEGER; dval: LONGREAL;
  1701. BEGIN
  1702. WHILE (len > 0) DO
  1703. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1704. INC( dadr, dinc ); DEC( len );
  1705. END;
  1706. END ConvertLoopIX;
  1707. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1708. BEGIN
  1709. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1710. RETURN RESULT
  1711. END "@Convert";
  1712. (** LONGINT -> INTEGER (SHORT) *)
  1713. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1714. VAR lval: LONGINT; dval: INTEGER;
  1715. BEGIN
  1716. WHILE (len > 0) DO
  1717. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1718. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1719. END;
  1720. END ConvertLoopLI;
  1721. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1722. BEGIN
  1723. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1724. RETURN RESULT
  1725. END "@Convert";
  1726. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1727. BEGIN
  1728. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1729. RETURN RESULT
  1730. END "SHORT";
  1731. (** LONGINT -> REAL *)
  1732. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1733. VAR lval: LONGINT; dval: REAL;
  1734. BEGIN
  1735. WHILE (len > 0) DO
  1736. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1737. INC( dadr, dinc ); DEC( len );
  1738. END;
  1739. END ConvertLoopLR;
  1740. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1741. BEGIN
  1742. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1743. RETURN RESULT
  1744. END "@Convert";
  1745. (** LONGINT -> LONGREAL *)
  1746. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1747. VAR lval: LONGINT; dval: LONGREAL;
  1748. BEGIN
  1749. WHILE (len > 0) DO
  1750. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1751. INC( dadr, dinc ); DEC( len );
  1752. END;
  1753. END ConvertLoopLX;
  1754. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1755. BEGIN
  1756. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1757. RETURN RESULT
  1758. END "@Convert";
  1759. (** REAL -> LONGINT (ENTIER) *)
  1760. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1761. VAR lval: REAL; dval: LONGINT;
  1762. BEGIN
  1763. WHILE (len > 0) DO
  1764. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1765. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1766. END;
  1767. END ConvertLoopRL;
  1768. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1769. BEGIN
  1770. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1771. RETURN RESULT
  1772. END "@Convert";
  1773. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1774. BEGIN
  1775. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1776. RETURN RESULT
  1777. END "ENTIER";
  1778. (** REAL -> LONGREAL *)
  1779. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1780. VAR lval: REAL; dval: LONGREAL;
  1781. BEGIN
  1782. WHILE (len > 0) DO
  1783. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1784. INC( dadr, dinc ); DEC( len );
  1785. END;
  1786. END ConvertLoopRX;
  1787. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1788. BEGIN
  1789. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1790. RETURN RESULT
  1791. END "@Convert";
  1792. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1793. BEGIN
  1794. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1795. RETURN RESULT
  1796. END "LONG";
  1797. (** LONGREAL -> REAL (SHORT) *)
  1798. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1799. VAR lval: LONGREAL; dval: REAL;
  1800. BEGIN
  1801. WHILE (len > 0) DO
  1802. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1803. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1804. END;
  1805. END ConvertLoopXR;
  1806. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1807. BEGIN
  1808. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1809. RETURN RESULT
  1810. END "@Convert";
  1811. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1812. BEGIN
  1813. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1814. RETURN RESULT
  1815. END "SHORT";
  1816. (** LONGREAL -> LONGINT (ENTIER) *)
  1817. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1818. VAR lval: LONGREAL; dval: LONGINT;
  1819. BEGIN
  1820. WHILE (len > 0) DO
  1821. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1822. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1823. END;
  1824. END ConvertLoopXL;
  1825. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1826. BEGIN
  1827. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1828. RETURN RESULT
  1829. END "@Convert";
  1830. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1831. BEGIN
  1832. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1833. RETURN RESULT
  1834. END "ENTIER";
  1835. (*** monadic not A -> ~A ********************************************************************)
  1836. (** BOOLEAN *)
  1837. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1838. VAR lval: BOOLEAN;
  1839. BEGIN
  1840. WHILE (len > 0) DO
  1841. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1842. DEC( len );
  1843. END;
  1844. END NotLoopAB;
  1845. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1846. BEGIN
  1847. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1848. RETURN RESULT
  1849. END "~";
  1850. (*** monadic generic (A) -> -A ********************************************************************)
  1851. (** SHORTINT *)
  1852. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1853. VAR lval: SHORTINT;
  1854. BEGIN
  1855. WHILE (len > 0) DO
  1856. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1857. DEC( len );
  1858. END;
  1859. END GenericLoopS;
  1860. (** INTEGER *)
  1861. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1862. VAR lval: INTEGER;
  1863. BEGIN
  1864. WHILE (len > 0) DO
  1865. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1866. DEC( len );
  1867. END;
  1868. END GenericLoopI;
  1869. (** LONGINT *)
  1870. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1871. VAR lval: LONGINT;
  1872. BEGIN
  1873. WHILE (len > 0) DO
  1874. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1875. DEC( len );
  1876. END;
  1877. END GenericLoopL;
  1878. (** HUGEINT *)
  1879. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1880. VAR lval: HUGEINT;
  1881. BEGIN
  1882. WHILE (len > 0) DO
  1883. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1884. DEC( len );
  1885. END;
  1886. END GenericLoopH;
  1887. (** REAL *)
  1888. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1889. VAR lval: REAL;
  1890. BEGIN
  1891. WHILE (len > 0) DO
  1892. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1893. DEC( len );
  1894. END;
  1895. END GenericLoopR;
  1896. (** LONGREAL *)
  1897. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1898. VAR lval: LONGREAL;
  1899. BEGIN
  1900. WHILE (len > 0) DO
  1901. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1902. DEC( len );
  1903. END;
  1904. END GenericLoopX;
  1905. (** COMPLEX *)
  1906. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1907. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1908. BEGIN
  1909. WHILE (len > 0) DO
  1910. lval := ladr;
  1911. dval := dadr;
  1912. dval.val := op(lval.val);
  1913. INC( ladr, linc ); INC( dadr, dinc );
  1914. DEC( len );
  1915. END;
  1916. END GenericLoopZ;
  1917. (** LONGCOMPLEX *)
  1918. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1919. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1920. BEGIN
  1921. WHILE (len > 0) DO
  1922. lval := ladr;
  1923. dval := dadr;
  1924. dval.val := op (lval.val);
  1925. INC( ladr, linc ); INC( dadr, dinc );
  1926. DEC( len );
  1927. END;
  1928. END GenericLoopLZ;
  1929. (*** monadic minus A -> -A ********************************************************************)
  1930. (** SHORTINT *)
  1931. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1932. VAR lval: SHORTINT;
  1933. BEGIN
  1934. WHILE (len > 0) DO
  1935. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1936. DEC( len );
  1937. END;
  1938. END MinusLoopS;
  1939. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1940. BEGIN
  1941. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1942. RETURN RESULT
  1943. END "-";
  1944. (** INTEGER *)
  1945. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1946. VAR lval: INTEGER;
  1947. BEGIN
  1948. WHILE (len > 0) DO
  1949. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1950. DEC( len );
  1951. END;
  1952. END MinusLoopI;
  1953. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1954. BEGIN
  1955. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1956. RETURN RESULT
  1957. END "-";
  1958. (** LONGINT *)
  1959. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1960. VAR lval: LONGINT;
  1961. BEGIN
  1962. WHILE (len > 0) DO
  1963. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1964. DEC( len );
  1965. END;
  1966. END MinusLoopL;
  1967. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1968. BEGIN
  1969. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1970. RETURN RESULT
  1971. END "-";
  1972. (** REAL *)
  1973. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1974. VAR lval: REAL;
  1975. BEGIN
  1976. WHILE (len > 0) DO
  1977. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1978. DEC( len );
  1979. END;
  1980. END MinusLoopR;
  1981. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1982. BEGIN
  1983. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1984. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1985. RETURN RESULT
  1986. END "-";
  1987. (** LONGREAL *)
  1988. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1989. VAR lval: LONGREAL;
  1990. BEGIN
  1991. WHILE (len > 0) DO
  1992. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1993. DEC( len );
  1994. END;
  1995. END MinusLoopX;
  1996. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1997. BEGIN
  1998. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1999. MinusLoopX );
  2000. RETURN RESULT
  2001. END "-";
  2002. (*** add array + array -> array ********************************************************************)
  2003. (** SHORTINT *)
  2004. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2005. VAR lval, rval: SHORTINT;
  2006. BEGIN
  2007. WHILE (len > 0) DO
  2008. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2009. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2010. END;
  2011. END AddASASLoop;
  2012. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2013. BEGIN
  2014. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2015. SIZEOF( SHORTINT ), AddASASLoop );
  2016. RETURN RESULT
  2017. END "+";
  2018. (** INTEGER *)
  2019. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2020. VAR lval, rval: INTEGER;
  2021. BEGIN
  2022. WHILE (len > 0) DO
  2023. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2024. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2025. END;
  2026. END AddAIAILoop;
  2027. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2028. BEGIN
  2029. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2030. SIZEOF( INTEGER ), AddAIAILoop );
  2031. RETURN RESULT
  2032. END "+";
  2033. (** LONGINT *)
  2034. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2035. VAR lval, rval: LONGINT;
  2036. BEGIN
  2037. WHILE (len > 0) DO
  2038. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2039. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2040. END;
  2041. END AddALALLoop;
  2042. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2043. BEGIN
  2044. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2045. SIZEOF( LONGINT ), AddALALLoop );
  2046. RETURN RESULT
  2047. END "+";
  2048. (** REAL *)
  2049. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2050. VAR lval, rval: REAL;
  2051. BEGIN
  2052. WHILE (len > 0) DO
  2053. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2054. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2055. END;
  2056. END AddARARLoop;
  2057. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2058. BEGIN
  2059. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2060. loopAddARAR );
  2061. RETURN RESULT
  2062. END "+";
  2063. (** LONGREAL *)
  2064. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2065. VAR lval, rval: LONGREAL;
  2066. BEGIN
  2067. WHILE (len > 0) DO
  2068. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2069. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2070. END;
  2071. END AddAXAXLoop;
  2072. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2073. BEGIN
  2074. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2075. SIZEOF( LONGREAL ), loopAddAXAX );
  2076. RETURN RESULT
  2077. END "+";
  2078. (** COMPLEX *)
  2079. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2080. VAR lval, rval: COMPLEX;
  2081. BEGIN
  2082. WHILE (len > 0) DO
  2083. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2084. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2085. END;
  2086. END AddAZAZLoop;
  2087. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2088. BEGIN
  2089. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2090. SIZEOF( COMPLEX ), loopAddAZAZ );
  2091. RETURN RESULT
  2092. END "+";
  2093. (** LONGCOMPLEX *)
  2094. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2095. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2096. BEGIN
  2097. WHILE (len > 0) DO
  2098. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2099. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2100. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2101. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2102. DEC( len );
  2103. END;
  2104. END AddALZALZLoop;
  2105. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2106. BEGIN
  2107. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2108. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2109. RETURN RESULT
  2110. END "+";
  2111. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2112. (** SHORTINT *)
  2113. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2114. VAR lval, rval: SHORTINT;
  2115. BEGIN
  2116. SYSTEM.GET( radr, rval );
  2117. WHILE (len > 0) DO
  2118. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2119. INC( dadr, dinc ); DEC( len );
  2120. END;
  2121. END AddASSSLoop;
  2122. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2123. BEGIN
  2124. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2125. SIZEOF( SHORTINT ), AddASSSLoop );
  2126. RETURN RESULT
  2127. END "+";
  2128. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2129. BEGIN
  2130. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2131. SIZEOF( SHORTINT ), AddASSSLoop );
  2132. RETURN RESULT
  2133. END "+";
  2134. (** INTEGER *)
  2135. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2136. VAR lval, rval: INTEGER;
  2137. BEGIN
  2138. SYSTEM.GET( radr, rval );
  2139. WHILE (len > 0) DO
  2140. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2141. INC( dadr, dinc ); DEC( len );
  2142. END;
  2143. END AddAISILoop;
  2144. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2145. BEGIN
  2146. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2147. SIZEOF( INTEGER ), AddAISILoop );
  2148. RETURN RESULT
  2149. END "+";
  2150. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2151. BEGIN
  2152. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2153. SIZEOF( INTEGER ), AddAISILoop );
  2154. RETURN RESULT
  2155. END "+";
  2156. (** LONGINT *)
  2157. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2158. VAR lval, rval: LONGINT;
  2159. BEGIN
  2160. SYSTEM.GET( radr, rval );
  2161. WHILE (len > 0) DO
  2162. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2163. INC( dadr, dinc ); DEC( len );
  2164. END;
  2165. END AddALSLLoop;
  2166. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2167. BEGIN
  2168. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2169. SIZEOF( LONGINT ), AddALSLLoop );
  2170. RETURN RESULT
  2171. END "+";
  2172. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2173. BEGIN
  2174. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2175. SIZEOF( LONGINT ), AddALSLLoop );
  2176. RETURN RESULT
  2177. END "+";
  2178. (** REAL *)
  2179. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2180. VAR lval, rval: REAL;
  2181. BEGIN
  2182. SYSTEM.GET( radr, rval );
  2183. WHILE (len > 0) DO
  2184. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2185. INC( dadr, dinc ); DEC( len );
  2186. END;
  2187. END AddARSRLoop;
  2188. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2189. BEGIN
  2190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2191. AddARSRLoop );
  2192. RETURN RESULT
  2193. END "+";
  2194. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2195. BEGIN
  2196. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2197. AddARSRLoop );
  2198. RETURN RESULT
  2199. END "+";
  2200. (** LONGREAL *)
  2201. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2202. VAR lval, rval: LONGREAL;
  2203. BEGIN
  2204. SYSTEM.GET( radr, rval );
  2205. WHILE (len > 0) DO
  2206. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2207. INC( dadr, dinc ); DEC( len );
  2208. END;
  2209. END AddAXSXLoop;
  2210. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2211. BEGIN
  2212. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2213. SIZEOF( LONGREAL ), AddAXSXLoop );
  2214. RETURN RESULT
  2215. END "+";
  2216. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2217. BEGIN
  2218. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2219. SIZEOF( LONGREAL ), AddAXSXLoop );
  2220. RETURN RESULT
  2221. END "+";
  2222. (** COMPLEX *)
  2223. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2224. VAR lval, rval: COMPLEX;
  2225. BEGIN
  2226. SYSTEM.GET( radr, rval );
  2227. WHILE (len > 0) DO
  2228. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2229. INC( dadr, dinc ); DEC( len );
  2230. END;
  2231. END AddAZSZLoop;
  2232. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2233. BEGIN
  2234. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2235. AddAZSZLoop );
  2236. RETURN RESULT
  2237. END "+";
  2238. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2239. BEGIN
  2240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2241. AddAZSZLoop );
  2242. RETURN RESULT
  2243. END "+";
  2244. (** LONGCOMPLEX *)
  2245. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2246. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2247. BEGIN
  2248. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2249. WHILE (len > 0) DO
  2250. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2251. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2252. INC( ladr, linc );
  2253. INC( dadr, dinc ); DEC( len );
  2254. END;
  2255. END AddALZSLZLoop;
  2256. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2257. BEGIN
  2258. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2259. AddALZSLZLoop );
  2260. RETURN RESULT
  2261. END "+";
  2262. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2263. BEGIN
  2264. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2265. AddALZSLZLoop );
  2266. RETURN RESULT
  2267. END "+";
  2268. (*** subtraction array - array -> array ********************************************************************)
  2269. (** SHORTINT *)
  2270. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2271. VAR lval, rval: SHORTINT;
  2272. BEGIN
  2273. WHILE (len > 0) DO
  2274. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2275. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2276. END;
  2277. END SubASASLoop;
  2278. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2279. BEGIN
  2280. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2281. SIZEOF( SHORTINT ), SubASASLoop );
  2282. RETURN RESULT
  2283. END "-";
  2284. (** INTEGER *)
  2285. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2286. VAR lval, rval: INTEGER;
  2287. BEGIN
  2288. WHILE (len > 0) DO
  2289. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2290. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2291. END;
  2292. END SubAIAILoop;
  2293. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2294. BEGIN
  2295. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2296. SIZEOF( INTEGER ), SubAIAILoop );
  2297. RETURN RESULT
  2298. END "-";
  2299. (** LONGINT *)
  2300. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2301. VAR lval, rval: LONGINT;
  2302. BEGIN
  2303. WHILE (len > 0) DO
  2304. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2305. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2306. END;
  2307. END SubALALLoop;
  2308. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2309. BEGIN
  2310. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2311. SIZEOF( LONGINT ), SubALALLoop );
  2312. RETURN RESULT
  2313. END "-";
  2314. (** REAL *)
  2315. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2316. VAR lval, rval: REAL;
  2317. BEGIN
  2318. WHILE (len > 0) DO
  2319. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2320. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2321. END;
  2322. END SubARARLoop;
  2323. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2324. BEGIN
  2325. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2326. SubARARLoop );
  2327. RETURN RESULT
  2328. END "-";
  2329. (** LONGREAL *)
  2330. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2331. VAR lval, rval: LONGREAL;
  2332. BEGIN
  2333. WHILE (len > 0) DO
  2334. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2335. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2336. END;
  2337. END SubAXAXLoop;
  2338. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2339. BEGIN
  2340. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2341. SIZEOF( LONGREAL ), SubAXAXLoop );
  2342. RETURN RESULT
  2343. END "-";
  2344. (** COMPLEX *)
  2345. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2346. VAR lval, rval: COMPLEX;
  2347. BEGIN
  2348. WHILE (len > 0) DO
  2349. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2350. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2351. END;
  2352. END SubAZAZLoop;
  2353. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2354. BEGIN
  2355. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2356. SIZEOF( COMPLEX ), SubAZAZLoop );
  2357. RETURN RESULT
  2358. END "-";
  2359. (** LONGCOMPLEX *)
  2360. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2361. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2362. BEGIN
  2363. WHILE (len > 0) DO
  2364. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2365. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2366. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2367. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2368. DEC( len );
  2369. END;
  2370. END SubALZALZLoop;
  2371. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2372. BEGIN
  2373. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2374. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2375. RETURN RESULT
  2376. END "-";
  2377. (*** subtraction array-scalar -> array ********************************************************************)
  2378. (** SHORTINT *)
  2379. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2380. BEGIN
  2381. RESULT := left + (-right);
  2382. RETURN RESULT
  2383. END "-";
  2384. (** INTEGER *)
  2385. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2386. BEGIN
  2387. RESULT := left + (-right);
  2388. RETURN RESULT
  2389. END "-";
  2390. (** LONGINT *)
  2391. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2392. BEGIN
  2393. RESULT := left + (-right);
  2394. RETURN RESULT
  2395. END "-";
  2396. (** REAL *)
  2397. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2398. BEGIN
  2399. RESULT := left + (-right);
  2400. RETURN RESULT
  2401. END "-";
  2402. (** LONGREAL *)
  2403. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2404. BEGIN
  2405. RESULT := left + (-right);
  2406. RETURN RESULT
  2407. END "-";
  2408. (** COMPLEX *)
  2409. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2410. BEGIN
  2411. RESULT := left + (-right);
  2412. RETURN RESULT
  2413. END "-";
  2414. (** LONGCOMPLEX *)
  2415. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2416. BEGIN
  2417. RESULT := left + (-right);
  2418. RETURN RESULT
  2419. END "-";
  2420. (*** subtraction scalar-array -> array ********************************************************************)
  2421. (** SHORTINT *)
  2422. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2423. VAR lval, rval, dval: SHORTINT;
  2424. BEGIN
  2425. SYSTEM.GET( radr, rval );
  2426. WHILE (len > 0) DO
  2427. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2428. INC( dadr, dinc ); DEC( len );
  2429. END;
  2430. END SubSSASLoop;
  2431. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2432. BEGIN
  2433. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2434. SIZEOF( SHORTINT ), SubSSASLoop );
  2435. RETURN RESULT
  2436. END "-";
  2437. (** INTEGER *)
  2438. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2439. VAR lval, rval, dval: INTEGER;
  2440. BEGIN
  2441. SYSTEM.GET( radr, rval );
  2442. WHILE (len > 0) DO
  2443. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2444. INC( dadr, dinc ); DEC( len );
  2445. END;
  2446. END SubSIAILoop;
  2447. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2448. BEGIN
  2449. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2450. SIZEOF( INTEGER ), SubSIAILoop );
  2451. RETURN RESULT
  2452. END "-";
  2453. (** LONGINT *)
  2454. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2455. VAR lval, rval, dval: LONGINT;
  2456. BEGIN
  2457. SYSTEM.GET( radr, rval );
  2458. WHILE (len > 0) DO
  2459. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2460. INC( dadr, dinc ); DEC( len );
  2461. END;
  2462. END SubSLALLoop;
  2463. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2464. BEGIN
  2465. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2466. SIZEOF( LONGINT ), SubSLALLoop );
  2467. RETURN RESULT
  2468. END "-";
  2469. (** REAL *)
  2470. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2471. VAR lval, rval, dval: REAL;
  2472. BEGIN
  2473. SYSTEM.GET( radr, rval );
  2474. WHILE (len > 0) DO
  2475. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2476. INC( dadr, dinc ); DEC( len );
  2477. END;
  2478. END SubSRARLoop;
  2479. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2480. BEGIN
  2481. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2482. SubSRARLoop );
  2483. RETURN RESULT
  2484. END "-";
  2485. (** LONGREAL *)
  2486. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2487. VAR lval, rval, dval: LONGREAL;
  2488. BEGIN
  2489. SYSTEM.GET( radr, rval );
  2490. WHILE (len > 0) DO
  2491. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2492. INC( dadr, dinc ); DEC( len );
  2493. END;
  2494. END SubSXAXLoop;
  2495. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2496. BEGIN
  2497. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2498. SIZEOF( LONGREAL ), SubSXAXLoop );
  2499. RETURN RESULT
  2500. END "-";
  2501. (** COMPLEX *)
  2502. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2503. VAR lval, rval, dval: COMPLEX;
  2504. BEGIN
  2505. SYSTEM.GET( radr, rval );
  2506. WHILE (len > 0) DO
  2507. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2508. INC( dadr, dinc ); DEC( len );
  2509. END;
  2510. END SubSZAZLoop;
  2511. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2512. BEGIN
  2513. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2514. SIZEOF( COMPLEX ), SubSZAZLoop );
  2515. RETURN RESULT
  2516. END "-";
  2517. (** LONGCOMPLEX *)
  2518. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2519. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2520. BEGIN
  2521. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2522. WHILE (len > 0) DO
  2523. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2524. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2525. INC( ladr, linc );
  2526. INC( dadr, dinc ); DEC( len );
  2527. END;
  2528. END SubSLZALZLoop;
  2529. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2530. BEGIN
  2531. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2532. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2533. RETURN RESULT
  2534. END "-";
  2535. (*** element-wise multiply array x array -> array ********************************************************************)
  2536. (** SHORTINT *)
  2537. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2538. VAR lval, rval: SHORTINT;
  2539. BEGIN
  2540. WHILE (len > 0) DO
  2541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2542. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2543. END;
  2544. END EMulASASLoop;
  2545. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2546. BEGIN
  2547. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2548. SIZEOF( SHORTINT ), EMulASASLoop );
  2549. RETURN RESULT
  2550. END ".*";
  2551. (** INTEGER *)
  2552. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2553. VAR lval, rval: INTEGER; dval: INTEGER;
  2554. BEGIN
  2555. WHILE (len > 0) DO
  2556. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2557. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2558. DEC( len );
  2559. END;
  2560. END EMulAIAILoop;
  2561. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2562. BEGIN
  2563. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2564. SIZEOF( INTEGER ), EMulAIAILoop );
  2565. RETURN RESULT
  2566. END ".*";
  2567. (** LONGINT *)
  2568. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2569. VAR lval, rval: LONGINT;
  2570. BEGIN
  2571. WHILE (len > 0) DO
  2572. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2573. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2574. END;
  2575. END EMulALALLoop;
  2576. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2577. BEGIN
  2578. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2579. SIZEOF( LONGINT ), EMulALALLoop );
  2580. RETURN RESULT
  2581. END ".*";
  2582. (** REAL *)
  2583. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2584. VAR lval, rval: REAL;
  2585. BEGIN
  2586. WHILE (len > 0) DO
  2587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2588. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2589. END;
  2590. END EMulARARLoop;
  2591. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2592. BEGIN
  2593. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2594. EMulARARLoop );
  2595. RETURN RESULT
  2596. END ".*";
  2597. (** LONGREAL *)
  2598. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2599. VAR lval, rval: LONGREAL;
  2600. BEGIN
  2601. WHILE (len > 0) DO
  2602. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2603. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2604. END;
  2605. END EMulAXAXLoop;
  2606. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2607. BEGIN
  2608. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2609. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2610. RETURN RESULT
  2611. END ".*";
  2612. (** COMPLEX *)
  2613. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2614. VAR lval, rval: COMPLEX;
  2615. BEGIN
  2616. WHILE (len > 0) DO
  2617. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2618. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2619. END;
  2620. END EMulAZAZLoop;
  2621. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2622. BEGIN
  2623. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2624. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2625. RETURN RESULT
  2626. END ".*";
  2627. (** LONGCOMPLEX *)
  2628. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2629. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2630. BEGIN
  2631. WHILE (len > 0) DO
  2632. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2633. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2634. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2635. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2636. DEC( len );
  2637. END;
  2638. END EMulALZALZLoop;
  2639. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2640. BEGIN
  2641. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2642. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2643. RETURN RESULT
  2644. END ".*";
  2645. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2646. (** SHORTINT *)
  2647. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2648. VAR lval, rval,dval: SHORTINT;
  2649. BEGIN
  2650. WHILE (len > 0) DO
  2651. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2652. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2653. END;
  2654. END EMulIncASASLoop;
  2655. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2656. BEGIN
  2657. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2658. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2659. END ".*+";
  2660. (** INTEGER *)
  2661. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2662. VAR lval, rval,dval: INTEGER;
  2663. BEGIN
  2664. WHILE (len > 0) DO
  2665. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2666. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2667. DEC( len );
  2668. END;
  2669. END EMulIncAIAILoop;
  2670. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2671. BEGIN
  2672. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2673. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2674. END ".*+";
  2675. (** LONGINT *)
  2676. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2677. VAR lval, rval,dval: LONGINT;
  2678. BEGIN
  2679. WHILE (len > 0) DO
  2680. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2681. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2682. END;
  2683. END EMulIncALALLoop;
  2684. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2685. BEGIN
  2686. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2687. SIZEOF( LONGINT ), EMulIncALALLoop );
  2688. END ".*+";
  2689. (** REAL *)
  2690. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2691. VAR lval, rval,dval: REAL;
  2692. BEGIN
  2693. WHILE (len > 0) DO
  2694. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2695. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2696. END;
  2697. END EMulIncARARLoop;
  2698. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2699. BEGIN
  2700. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2701. EMulIncARARLoop );
  2702. END ".*+";
  2703. (** LONGREAL *)
  2704. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2705. VAR lval, rval,dval: LONGREAL;
  2706. BEGIN
  2707. WHILE (len > 0) DO
  2708. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2709. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2710. END;
  2711. END EMulIncAXAXLoop;
  2712. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2713. BEGIN
  2714. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2715. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2716. END ".*+";
  2717. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2718. (** SHORTINT *)
  2719. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2720. VAR lval, rval: SHORTINT;
  2721. BEGIN
  2722. SYSTEM.GET( radr, rval );
  2723. WHILE (len > 0) DO
  2724. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2725. INC( dadr, dinc ); DEC( len );
  2726. END;
  2727. END MulASSSLoop;
  2728. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2729. BEGIN
  2730. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2731. SIZEOF( SHORTINT ), MulASSSLoop );
  2732. RETURN RESULT
  2733. END "*";
  2734. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2735. BEGIN
  2736. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2737. SIZEOF( SHORTINT ), MulASSSLoop );
  2738. RETURN RESULT
  2739. END "*";
  2740. (** INTEGER *)
  2741. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2742. VAR lval, rval: INTEGER;
  2743. BEGIN
  2744. SYSTEM.GET( radr, rval );
  2745. WHILE (len > 0) DO
  2746. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2747. INC( dadr, dinc ); DEC( len );
  2748. END;
  2749. END MulAISILoop;
  2750. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2751. BEGIN
  2752. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2753. SIZEOF( INTEGER ), MulAISILoop );
  2754. RETURN RESULT
  2755. END "*";
  2756. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2757. BEGIN
  2758. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2759. SIZEOF( INTEGER ), MulAISILoop );
  2760. RETURN RESULT
  2761. END "*";
  2762. (** LONGINT *)
  2763. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2764. VAR lval, rval: LONGINT;
  2765. BEGIN
  2766. SYSTEM.GET( radr, rval );
  2767. WHILE (len > 0) DO
  2768. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2769. INC( dadr, dinc ); DEC( len );
  2770. END;
  2771. END MulALSLLoop;
  2772. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2773. BEGIN
  2774. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2775. SIZEOF( LONGINT ), MulALSLLoop );
  2776. RETURN RESULT
  2777. END "*";
  2778. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2779. BEGIN
  2780. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2781. SIZEOF( LONGINT ), MulALSLLoop );
  2782. RETURN RESULT
  2783. END "*";
  2784. (** REAL *)
  2785. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2786. VAR lval, rval: REAL;
  2787. BEGIN
  2788. SYSTEM.GET( radr, rval );
  2789. WHILE (len > 0) DO
  2790. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2791. INC( dadr, dinc ); DEC( len );
  2792. END;
  2793. END MulARSRLoop;
  2794. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2795. BEGIN
  2796. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2797. loopMulARSR );
  2798. RETURN RESULT
  2799. END "*";
  2800. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2801. BEGIN
  2802. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2803. loopMulARSR );
  2804. RETURN RESULT
  2805. END "*";
  2806. (** LONGREAL *)
  2807. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2808. VAR lval, rval: LONGREAL;
  2809. BEGIN
  2810. IF debug THEN
  2811. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2812. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2813. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2814. END;
  2815. SYSTEM.GET( radr, rval );
  2816. WHILE (len > 0) DO
  2817. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2818. INC( dadr, dinc ); DEC( len );
  2819. END;
  2820. END MulAXSXLoop;
  2821. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2822. BEGIN
  2823. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2824. SIZEOF( LONGREAL ), loopMulAXSX );
  2825. RETURN RESULT
  2826. END "*";
  2827. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2828. BEGIN
  2829. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2830. SIZEOF( LONGREAL ), loopMulAXSX );
  2831. RETURN RESULT
  2832. END "*";
  2833. (** COMPLEX *)
  2834. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2835. VAR lval, rval: COMPLEX;
  2836. BEGIN
  2837. SYSTEM.GET( radr, rval );
  2838. WHILE (len > 0) DO
  2839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2840. INC( dadr, dinc ); DEC( len );
  2841. END;
  2842. END MulAZSZLoop;
  2843. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2844. BEGIN
  2845. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2846. loopMulAZSZ );
  2847. RETURN RESULT
  2848. END "*";
  2849. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2850. BEGIN
  2851. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2852. loopMulAZSZ );
  2853. RETURN RESULT
  2854. END "*";
  2855. (** LONGCOMPLEX *)
  2856. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2857. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2858. BEGIN
  2859. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2860. WHILE (len > 0) DO
  2861. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2862. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2863. INC( ladr, linc );
  2864. INC( dadr, dinc ); DEC( len );
  2865. END;
  2866. END MulALZSLZLoop;
  2867. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2868. BEGIN
  2869. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2870. loopMulALZSLZ );
  2871. RETURN RESULT
  2872. END "*";
  2873. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2874. BEGIN
  2875. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2876. loopMulALZSLZ );
  2877. RETURN RESULT
  2878. END "*";
  2879. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2880. (** SHORTINT *)
  2881. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2882. VAR lval, rval, dval: SHORTINT;
  2883. BEGIN
  2884. SYSTEM.GET( radr, rval );
  2885. WHILE (len > 0) DO
  2886. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2887. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2888. END;
  2889. END IncMulASSSLoop;
  2890. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2891. BEGIN
  2892. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2893. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2894. END "INCMUL";
  2895. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2896. BEGIN
  2897. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2898. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2899. RETURN RESULT
  2900. END "INCMUL";
  2901. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2902. BEGIN
  2903. RESULT := -RESULT;
  2904. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2905. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2906. RESULT := -RESULT;
  2907. RETURN RESULT
  2908. END "DECMUL";
  2909. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2910. BEGIN
  2911. RESULT := -RESULT;
  2912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2913. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2914. RESULT := -RESULT;
  2915. RETURN RESULT
  2916. END "DECMUL";
  2917. (** INTEGER *)
  2918. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2919. VAR lval, rval, dval: INTEGER;
  2920. BEGIN
  2921. SYSTEM.GET( radr, rval );
  2922. WHILE (len > 0) DO
  2923. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2924. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2925. END;
  2926. END IncMulAISILoop;
  2927. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2928. BEGIN
  2929. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2930. SIZEOF( INTEGER ), IncMulAISILoop );
  2931. RETURN RESULT
  2932. END "INCMUL";
  2933. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2934. BEGIN
  2935. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2936. SIZEOF( INTEGER ), IncMulAISILoop );
  2937. RETURN RESULT
  2938. END "INCMUL";
  2939. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2940. BEGIN
  2941. RESULT := -RESULT;
  2942. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2943. SIZEOF( INTEGER ), IncMulAISILoop );
  2944. RESULT := -RESULT;
  2945. RETURN RESULT
  2946. END "DECMUL";
  2947. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2948. BEGIN
  2949. RESULT := -RESULT;
  2950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2951. SIZEOF( INTEGER ), IncMulAISILoop );
  2952. RESULT := -RESULT;
  2953. RETURN RESULT
  2954. END "DECMUL";
  2955. (** LONGINT *)
  2956. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2957. VAR lval, rval, dval: LONGINT;
  2958. BEGIN
  2959. SYSTEM.GET( radr, rval );
  2960. WHILE (len > 0) DO
  2961. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2962. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2963. END;
  2964. END IncMulALSLLoop;
  2965. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2966. BEGIN
  2967. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2968. SIZEOF( LONGINT ), IncMulALSLLoop );
  2969. RETURN RESULT
  2970. END "INCMUL";
  2971. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2972. BEGIN
  2973. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2974. SIZEOF( LONGINT ), IncMulALSLLoop );
  2975. RETURN RESULT
  2976. END "INCMUL";
  2977. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2978. BEGIN
  2979. RESULT := -RESULT;
  2980. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2981. SIZEOF( LONGINT ), IncMulALSLLoop );
  2982. RESULT := -RESULT;
  2983. RETURN RESULT
  2984. END "DECMUL";
  2985. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2986. BEGIN
  2987. RESULT := -RESULT;
  2988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2989. SIZEOF( LONGINT ), IncMulALSLLoop );
  2990. RESULT := -RESULT;
  2991. RETURN RESULT
  2992. END "DECMUL";
  2993. (** REAL *)
  2994. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2995. VAR lval, rval, dval: REAL;
  2996. BEGIN
  2997. SYSTEM.GET( radr, rval );
  2998. WHILE (len > 0) DO
  2999. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3000. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3001. END;
  3002. END IncMulARSRLoop;
  3003. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3004. BEGIN
  3005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3006. loopIncMulARSR );
  3007. RETURN RESULT
  3008. END "INCMUL";
  3009. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3010. BEGIN
  3011. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3012. loopIncMulARSR );
  3013. RETURN RESULT
  3014. END "INCMUL";
  3015. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3016. BEGIN
  3017. RESULT := -RESULT;
  3018. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3019. loopIncMulARSR );
  3020. RESULT := -RESULT;
  3021. RETURN RESULT
  3022. END "DECMUL";
  3023. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3024. BEGIN
  3025. RESULT := -RESULT;
  3026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3027. loopIncMulARSR );
  3028. RESULT := -RESULT;
  3029. RETURN RESULT
  3030. END "DECMUL";
  3031. (** LONGREAL *)
  3032. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3033. VAR lval, rval, dval: LONGREAL;
  3034. BEGIN
  3035. IF debug THEN
  3036. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3037. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3038. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3039. END;
  3040. SYSTEM.GET( radr, rval );
  3041. WHILE (len > 0) DO
  3042. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3043. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3044. END;
  3045. END IncMulAXSXLoop;
  3046. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3047. BEGIN
  3048. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3049. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3050. RETURN RESULT
  3051. END "INCMUL";
  3052. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3053. BEGIN
  3054. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3055. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3056. RETURN RESULT
  3057. END "INCMUL";
  3058. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3059. BEGIN
  3060. RESULT := -RESULT;
  3061. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3062. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3063. RESULT := -RESULT;
  3064. RETURN RESULT
  3065. END "DECMUL";
  3066. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3067. BEGIN
  3068. RESULT := -RESULT;
  3069. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3070. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3071. RESULT := -RESULT;
  3072. RETURN RESULT
  3073. END "DECMUL";
  3074. (*** element-wise division array / array -> array ********************************************************************)
  3075. (** SHORTINT *)
  3076. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3077. VAR lval, rval: SHORTINT; dval: REAL;
  3078. BEGIN
  3079. WHILE (len > 0) DO
  3080. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3081. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3082. DEC( len );
  3083. END;
  3084. END EDivideASASLoop;
  3085. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3086. BEGIN
  3087. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3088. EDivideASASLoop );
  3089. RETURN RESULT
  3090. END "./";
  3091. (** INTEGER *)
  3092. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3093. VAR lval, rval: INTEGER; dval: REAL;
  3094. BEGIN
  3095. WHILE (len > 0) DO
  3096. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3097. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3098. DEC( len );
  3099. END;
  3100. END EDivideAIAILoop;
  3101. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3102. BEGIN
  3103. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3104. EDivideAIAILoop );
  3105. RETURN RESULT
  3106. END "./";
  3107. (** LONGINT *)
  3108. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3109. VAR lval, rval: LONGINT; dval: REAL;
  3110. BEGIN
  3111. WHILE (len > 0) DO
  3112. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3113. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3114. DEC( len );
  3115. END;
  3116. END EDivideALALLoop;
  3117. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3118. BEGIN
  3119. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3120. EDivideALALLoop );
  3121. RETURN RESULT
  3122. END "./";
  3123. (** REAL *)
  3124. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3125. VAR lval, rval: REAL; dval: REAL;
  3126. BEGIN
  3127. WHILE (len > 0) DO
  3128. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3129. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3130. DEC( len );
  3131. END;
  3132. END EDivideARARLoop;
  3133. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3134. BEGIN
  3135. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3136. EDivideARARLoop );
  3137. RETURN RESULT
  3138. END "./";
  3139. (** LONGREAL *)
  3140. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3141. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3142. BEGIN
  3143. WHILE (len > 0) DO
  3144. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3145. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3146. DEC( len );
  3147. END;
  3148. END EDivideAXAXLoop;
  3149. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3150. BEGIN
  3151. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3152. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3153. RETURN RESULT
  3154. END "./";
  3155. (** COMPLEX *)
  3156. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3157. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3158. BEGIN
  3159. WHILE (len > 0) DO
  3160. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3161. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3162. DEC( len );
  3163. END;
  3164. END EDivideAZAZLoop;
  3165. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3166. BEGIN
  3167. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3168. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3169. RETURN RESULT
  3170. END "./";
  3171. (** LONGCOMPLEX *)
  3172. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3173. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3174. BEGIN
  3175. WHILE (len > 0) DO
  3176. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3177. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3178. IF rvalIm # 0.0D0 THEN
  3179. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3180. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3181. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3182. ELSE
  3183. dvalRe := lvalRe/rvalRe;
  3184. dvalIm := lvalIm/rvalRe;
  3185. END;
  3186. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3187. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3188. DEC( len );
  3189. END;
  3190. END EDivideALZALZLoop;
  3191. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3192. BEGIN
  3193. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3194. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3195. RETURN RESULT
  3196. END "./";
  3197. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3198. (** SHORTINT *)
  3199. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3200. VAR lval, rval: SHORTINT; dval: REAL;
  3201. BEGIN
  3202. SYSTEM.GET( radr, rval );
  3203. WHILE (len > 0) DO
  3204. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3205. INC( dadr, dinc ); DEC( len );
  3206. END;
  3207. END DivideASSSLoop;
  3208. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3209. BEGIN
  3210. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3211. DivideASSSLoop );
  3212. RETURN RESULT
  3213. END "/";
  3214. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3215. VAR lval, rval: SHORTINT; dval: REAL;
  3216. BEGIN
  3217. SYSTEM.GET( radr, rval );
  3218. WHILE (len > 0) DO
  3219. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3220. INC( dadr, dinc ); DEC( len );
  3221. END;
  3222. END DivideSSASLoop;
  3223. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3224. BEGIN
  3225. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3226. DivideSSASLoop );
  3227. RETURN RESULT
  3228. END "/";
  3229. (** INTEGER *)
  3230. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3231. VAR lval, rval: INTEGER; dval: REAL;
  3232. BEGIN
  3233. SYSTEM.GET( radr, rval );
  3234. WHILE (len > 0) DO
  3235. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3236. INC( dadr, dinc ); DEC( len );
  3237. END;
  3238. END DivideAISILoop;
  3239. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3240. BEGIN
  3241. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3242. DivideAISILoop );
  3243. RETURN RESULT
  3244. END "/";
  3245. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3246. VAR lval, rval: INTEGER; dval: REAL;
  3247. BEGIN
  3248. SYSTEM.GET( radr, rval );
  3249. WHILE (len > 0) DO
  3250. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3251. INC( dadr, dinc ); DEC( len );
  3252. END;
  3253. END DivideSIAILoop;
  3254. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3255. BEGIN
  3256. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3257. DivideSIAILoop );
  3258. RETURN RESULT
  3259. END "/";
  3260. (** LONGINT *)
  3261. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3262. VAR lval, rval: LONGINT; dval: REAL;
  3263. BEGIN
  3264. SYSTEM.GET( radr, rval );
  3265. WHILE (len > 0) DO
  3266. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3267. INC( dadr, dinc ); DEC( len );
  3268. END;
  3269. END DivideALSLLoop;
  3270. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3271. BEGIN
  3272. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3273. DivideALSLLoop );
  3274. RETURN RESULT
  3275. END "/";
  3276. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3277. VAR lval, rval: LONGINT; dval: REAL;
  3278. BEGIN
  3279. SYSTEM.GET( radr, rval );
  3280. WHILE (len > 0) DO
  3281. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3282. INC( dadr, dinc ); DEC( len );
  3283. END;
  3284. END DivideSLALLoop;
  3285. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3286. BEGIN
  3287. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3288. DivideSLALLoop );
  3289. RETURN RESULT
  3290. END "/";
  3291. (** REAL *)
  3292. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3293. VAR lval, rval: REAL; dval: REAL;
  3294. BEGIN
  3295. SYSTEM.GET( radr, rval );
  3296. WHILE (len > 0) DO
  3297. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3298. INC( dadr, dinc ); DEC( len );
  3299. END;
  3300. END DivideARSRLoop;
  3301. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3302. BEGIN
  3303. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3304. DivideARSRLoop );
  3305. RETURN RESULT
  3306. END "/";
  3307. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3308. VAR lval, rval: REAL; dval: REAL;
  3309. BEGIN
  3310. SYSTEM.GET( radr, rval );
  3311. WHILE (len > 0) DO
  3312. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3313. INC( dadr, dinc ); DEC( len );
  3314. END;
  3315. END DivideSRARLoop;
  3316. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3317. BEGIN
  3318. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3319. DivideSRARLoop );
  3320. RETURN RESULT
  3321. END "/";
  3322. (** LONGREAL *)
  3323. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3324. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3325. BEGIN
  3326. SYSTEM.GET( radr, rval );
  3327. WHILE (len > 0) DO
  3328. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3329. INC( dadr, dinc ); DEC( len );
  3330. END;
  3331. END DivideAXSXLoop;
  3332. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3333. BEGIN
  3334. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3335. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3336. RETURN RESULT
  3337. END "/";
  3338. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3339. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3340. BEGIN
  3341. SYSTEM.GET( radr, rval );
  3342. WHILE (len > 0) DO
  3343. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3344. INC( dadr, dinc ); DEC( len );
  3345. END;
  3346. END DivideSXAXLoop;
  3347. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3348. BEGIN
  3349. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3350. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3351. RETURN RESULT
  3352. END "/";
  3353. (** COMPLEX *)
  3354. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3355. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3356. BEGIN
  3357. SYSTEM.GET( radr, rval );
  3358. WHILE (len > 0) DO
  3359. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3360. INC( dadr, dinc ); DEC( len );
  3361. END;
  3362. END DivideAZSZLoop;
  3363. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3364. BEGIN
  3365. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3366. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3367. RETURN RESULT
  3368. END "/";
  3369. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3370. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3371. BEGIN
  3372. SYSTEM.GET( radr, rval );
  3373. WHILE (len > 0) DO
  3374. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3375. INC( dadr, dinc ); DEC( len );
  3376. END;
  3377. END DivideSZAZLoop;
  3378. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3379. BEGIN
  3380. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3381. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3382. RETURN RESULT
  3383. END "/";
  3384. (** LONGCOMPLEX *)
  3385. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3386. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3387. BEGIN
  3388. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3389. IF rvalIm # 0.0D0 THEN
  3390. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3391. WHILE (len > 0) DO
  3392. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3393. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3394. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3395. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3396. INC( ladr, linc );
  3397. INC( dadr, dinc ); DEC( len );
  3398. END;
  3399. ELSE
  3400. WHILE (len > 0) DO
  3401. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3402. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3403. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3404. INC( ladr, linc );
  3405. INC( dadr, dinc ); DEC( len );
  3406. END;
  3407. END;
  3408. END DivideALZSLZLoop;
  3409. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3410. BEGIN
  3411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3412. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3413. RETURN RESULT
  3414. END "/";
  3415. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3416. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3417. BEGIN
  3418. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3419. WHILE (len > 0) DO
  3420. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3421. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3422. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3423. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3424. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3425. INC( ladr, linc );
  3426. INC( dadr, dinc ); DEC( len );
  3427. END;
  3428. END DivideSLZALZLoop;
  3429. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3430. BEGIN
  3431. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3432. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3433. RETURN RESULT
  3434. END "/";
  3435. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3436. (** SHORTINT *)
  3437. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3438. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3439. BEGIN
  3440. WHILE (len > 0) DO
  3441. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3442. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3443. DEC( len );
  3444. END;
  3445. END EDivASASLoop;
  3446. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3447. BEGIN
  3448. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3449. SIZEOF( SHORTINT ), EDivASASLoop );
  3450. RETURN RESULT
  3451. END "DIV";
  3452. (** INTEGER *)
  3453. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3454. VAR lval, rval: INTEGER; dval: INTEGER;
  3455. BEGIN
  3456. WHILE (len > 0) DO
  3457. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3458. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3459. DEC( len );
  3460. END;
  3461. END EDivAIAILoop;
  3462. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3463. BEGIN
  3464. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3465. SIZEOF( INTEGER ), EDivAIAILoop );
  3466. RETURN RESULT
  3467. END "DIV";
  3468. (** LONGINT *)
  3469. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3470. VAR lval, rval: LONGINT; dval: LONGINT;
  3471. BEGIN
  3472. WHILE (len > 0) DO
  3473. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3474. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3475. DEC( len );
  3476. END;
  3477. END EDivALALLoop;
  3478. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3479. BEGIN
  3480. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3481. SIZEOF( LONGINT ), EDivALALLoop );
  3482. RETURN RESULT
  3483. END "DIV";
  3484. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3485. (** SHORTINT *)
  3486. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3487. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3488. BEGIN
  3489. SYSTEM.GET( radr, rval );
  3490. WHILE (len > 0) DO
  3491. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3492. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3493. END;
  3494. END DivASSSLoop;
  3495. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3496. BEGIN
  3497. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3498. SIZEOF( SHORTINT ), DivASSSLoop );
  3499. RETURN RESULT
  3500. END "DIV";
  3501. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3502. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3503. BEGIN
  3504. SYSTEM.GET( radr, rval );
  3505. WHILE (len > 0) DO
  3506. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3507. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3508. END;
  3509. END DivSSASLoop;
  3510. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3511. BEGIN
  3512. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3513. SIZEOF( SHORTINT ), DivSSASLoop );
  3514. RETURN RESULT
  3515. END "DIV";
  3516. (** INTEGER *)
  3517. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3518. VAR lval, rval: INTEGER; dval: INTEGER;
  3519. BEGIN
  3520. SYSTEM.GET( radr, rval );
  3521. WHILE (len > 0) DO
  3522. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3523. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3524. END;
  3525. END DivAISILoop;
  3526. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3527. BEGIN
  3528. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3529. SIZEOF( INTEGER ), DivAISILoop );
  3530. RETURN RESULT
  3531. END "DIV";
  3532. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3533. VAR lval, rval: INTEGER; dval: INTEGER;
  3534. BEGIN
  3535. SYSTEM.GET( radr, rval );
  3536. WHILE (len > 0) DO
  3537. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3538. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3539. END;
  3540. END DivSIAILoop;
  3541. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3542. BEGIN
  3543. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3544. SIZEOF( INTEGER ), DivSIAILoop );
  3545. RETURN RESULT
  3546. END "DIV";
  3547. (** LONGINT *)
  3548. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3549. VAR lval, rval: LONGINT; dval: LONGINT;
  3550. BEGIN
  3551. SYSTEM.GET( radr, rval );
  3552. WHILE (len > 0) DO
  3553. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3554. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3555. END;
  3556. END DivALSLLoop;
  3557. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3558. BEGIN
  3559. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3560. SIZEOF( LONGINT ), DivALSLLoop );
  3561. RETURN RESULT
  3562. END "DIV";
  3563. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3564. VAR lval, rval: LONGINT; dval: LONGINT;
  3565. BEGIN
  3566. SYSTEM.GET( radr, rval );
  3567. WHILE (len > 0) DO
  3568. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3569. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3570. END;
  3571. END DivSLALLoop;
  3572. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3573. BEGIN
  3574. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3575. SIZEOF( LONGINT ), DivSLALLoop );
  3576. RETURN RESULT
  3577. END "DIV";
  3578. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3579. (** SHORTINT *)
  3580. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3581. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3582. BEGIN
  3583. WHILE (len > 0) DO
  3584. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3585. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3586. DEC( len );
  3587. END;
  3588. END EModASASLoop;
  3589. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3590. BEGIN
  3591. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3592. SIZEOF( SHORTINT ), EModASASLoop );
  3593. RETURN RESULT
  3594. END "MOD";
  3595. (** INTEGER *)
  3596. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3597. VAR lval, rval: INTEGER; dval: INTEGER;
  3598. BEGIN
  3599. WHILE (len > 0) DO
  3600. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3601. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3602. DEC( len );
  3603. END;
  3604. END EModAIAILoop;
  3605. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3606. BEGIN
  3607. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3608. SIZEOF( INTEGER ), EModAIAILoop );
  3609. RETURN RESULT
  3610. END "MOD";
  3611. (** LONGINT *)
  3612. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3613. VAR lval, rval: LONGINT; dval: LONGINT;
  3614. BEGIN
  3615. WHILE (len > 0) DO
  3616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3617. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3618. DEC( len );
  3619. END;
  3620. END EModALALLoop;
  3621. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3622. BEGIN
  3623. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3624. SIZEOF( LONGINT ), EModALALLoop );
  3625. RETURN RESULT
  3626. END "MOD";
  3627. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3628. (** SHORTINT *)
  3629. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3630. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3631. BEGIN
  3632. SYSTEM.GET( radr, rval );
  3633. WHILE (len > 0) DO
  3634. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3635. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3636. END;
  3637. END ModASSSLoop;
  3638. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3639. BEGIN
  3640. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3641. SIZEOF( SHORTINT ), ModASSSLoop );
  3642. RETURN RESULT
  3643. END "MOD";
  3644. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3645. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3646. BEGIN
  3647. SYSTEM.GET( radr, rval );
  3648. WHILE (len > 0) DO
  3649. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3650. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3651. END;
  3652. END ModSSASLoop;
  3653. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3654. BEGIN
  3655. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3656. SIZEOF( SHORTINT ), ModSSASLoop );
  3657. RETURN RESULT
  3658. END "MOD";
  3659. (** INTEGER *)
  3660. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3661. VAR lval, rval: INTEGER; dval: INTEGER;
  3662. BEGIN
  3663. SYSTEM.GET( radr, rval );
  3664. WHILE (len > 0) DO
  3665. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3666. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3667. END;
  3668. END ModAISILoop;
  3669. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3670. BEGIN
  3671. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3672. SIZEOF( INTEGER ), ModAISILoop );
  3673. RETURN RESULT
  3674. END "MOD";
  3675. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3676. VAR lval, rval: INTEGER; dval: INTEGER;
  3677. BEGIN
  3678. SYSTEM.GET( radr, rval );
  3679. WHILE (len > 0) DO
  3680. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3681. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3682. END;
  3683. END ModSIAILoop;
  3684. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3685. BEGIN
  3686. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3687. SIZEOF( INTEGER ), ModSIAILoop );
  3688. RETURN RESULT
  3689. END "MOD";
  3690. (** LONGINT *)
  3691. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3692. VAR lval, rval: LONGINT; dval: LONGINT;
  3693. BEGIN
  3694. SYSTEM.GET( radr, rval );
  3695. WHILE (len > 0) DO
  3696. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3697. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3698. END;
  3699. END ModALSLLoop;
  3700. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3701. BEGIN
  3702. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3703. SIZEOF( LONGINT ), ModALSLLoop );
  3704. RETURN RESULT
  3705. END "MOD";
  3706. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3707. VAR lval, rval: LONGINT; dval: LONGINT;
  3708. BEGIN
  3709. SYSTEM.GET( radr, rval );
  3710. WHILE (len > 0) DO
  3711. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3712. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3713. END;
  3714. END ModSLALLoop;
  3715. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3716. BEGIN
  3717. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3718. SIZEOF( LONGINT ), ModSLALLoop );
  3719. RETURN RESULT
  3720. END "MOD";
  3721. (*** scalar product <array,array> -> scalar ********************************************************************)
  3722. (** SHORTINT *)
  3723. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3724. VAR lval, rval: SHORTINT; dval: LONGINT;
  3725. BEGIN
  3726. SYSTEM.GET( dadr, dval );
  3727. WHILE (len > 0) DO
  3728. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3729. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3730. END;
  3731. SYSTEM.PUT( dadr, dval );
  3732. END SPASASLoop;
  3733. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3734. VAR dest: LONGINT;
  3735. BEGIN
  3736. dest := 0;
  3737. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3738. RETURN dest;
  3739. END "+*";
  3740. (** INTEGER *)
  3741. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3742. VAR lval, rval: INTEGER; dval: LONGINT;
  3743. BEGIN
  3744. SYSTEM.GET( dadr, dval );
  3745. WHILE (len > 0) DO
  3746. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3747. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3748. END;
  3749. SYSTEM.PUT( dadr, dval );
  3750. END SPAIAILoop;
  3751. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3752. VAR dest: LONGINT;
  3753. BEGIN
  3754. dest := 0;
  3755. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3756. RETURN dest;
  3757. END "+*";
  3758. (** LONGINT *)
  3759. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3760. VAR lval, rval: LONGINT; dval: LONGINT;
  3761. BEGIN
  3762. SYSTEM.GET( dadr, dval );
  3763. WHILE (len > 0) DO
  3764. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3765. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3766. END;
  3767. SYSTEM.PUT( dadr, dval );
  3768. END SPALALLoop;
  3769. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3770. VAR dest: LONGINT;
  3771. BEGIN
  3772. dest := 0;
  3773. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3774. RETURN dest;
  3775. END "+*";
  3776. (** REAL *)
  3777. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3778. VAR lval, rval: REAL; dval: REAL;
  3779. BEGIN
  3780. SYSTEM.GET( dadr, dval );
  3781. WHILE (len > 0) DO
  3782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3783. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3784. END;
  3785. SYSTEM.PUT( dadr, dval );
  3786. END SPARARLoop;
  3787. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3788. VAR dest: REAL;
  3789. BEGIN
  3790. dest := 0;
  3791. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3792. RETURN dest;
  3793. END "+*";
  3794. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3795. VAR lval, rval, dval: LONGREAL;
  3796. BEGIN
  3797. IF debug THEN
  3798. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3799. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3800. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3801. END;
  3802. SYSTEM.GET( dadr, dval );
  3803. WHILE (len > 0) DO
  3804. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3805. dval := dval + rval * lval; DEC( len );
  3806. END;
  3807. SYSTEM.PUT( dadr, dval );
  3808. END SPAXAXLoop;
  3809. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3810. VAR dest: LONGREAL;
  3811. BEGIN
  3812. dest := 0;
  3813. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3814. RETURN dest;
  3815. END "+*";
  3816. (** COMPLEX *)
  3817. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3818. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3819. BEGIN
  3820. SYSTEM.GET( dadr, dval );
  3821. WHILE (len > 0) DO
  3822. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3823. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3824. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3825. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3826. END;
  3827. SYSTEM.PUT( dadr, dval );
  3828. END SPAZAZLoop;
  3829. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3830. VAR dest: COMPLEX;
  3831. BEGIN
  3832. dest := 0;
  3833. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3834. RETURN dest;
  3835. END "+*";
  3836. (** COMPLEX *)
  3837. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3838. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3839. BEGIN
  3840. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3841. WHILE (len > 0) DO
  3842. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3843. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3844. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3845. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3846. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3847. END;
  3848. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3849. END SPALZALZLoop;
  3850. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3851. VAR dest: LONGCOMPLEX;
  3852. BEGIN
  3853. dest := 0;
  3854. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3855. RETURN dest;
  3856. END "+*";
  3857. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3858. (** BOOLEAN *)
  3859. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3860. VAR lval, rval: BOOLEAN;
  3861. BEGIN
  3862. WHILE (len > 0) DO
  3863. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3864. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3865. END;
  3866. END EEqlABABLoop;
  3867. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3868. BEGIN
  3869. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3870. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3871. RETURN RESULT
  3872. END ".=";
  3873. (** SHORTINT *)
  3874. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3875. VAR lval, rval: SHORTINT;
  3876. BEGIN
  3877. WHILE (len > 0) DO
  3878. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3879. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3880. END;
  3881. END EEqlASASLoop;
  3882. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3883. BEGIN
  3884. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3885. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3886. RETURN RESULT
  3887. END ".=";
  3888. (** INTEGER *)
  3889. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3890. VAR lval, rval: INTEGER;
  3891. BEGIN
  3892. WHILE (len > 0) DO
  3893. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3894. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3895. END;
  3896. END EEqlAIAILoop;
  3897. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3898. BEGIN
  3899. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3900. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3901. RETURN RESULT
  3902. END ".=";
  3903. (** LONGINT *)
  3904. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3905. VAR lval, rval: LONGINT;
  3906. BEGIN
  3907. WHILE (len > 0) DO
  3908. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3909. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3910. END;
  3911. END EEqlALALLoop;
  3912. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3913. BEGIN
  3914. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3915. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3916. RETURN RESULT
  3917. END ".=";
  3918. (** REAL *)
  3919. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3920. VAR lval, rval: REAL;
  3921. BEGIN
  3922. WHILE (len > 0) DO
  3923. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3924. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3925. END;
  3926. END EEqlARARLoop;
  3927. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3928. BEGIN
  3929. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3930. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3931. RETURN RESULT
  3932. END ".=";
  3933. (** LONGREAL *)
  3934. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3935. VAR lval, rval: LONGREAL;
  3936. BEGIN
  3937. WHILE (len > 0) DO
  3938. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3939. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3940. END;
  3941. END EEqlAXAXLoop;
  3942. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3943. BEGIN
  3944. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3945. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3946. RETURN RESULT
  3947. END ".=";
  3948. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3949. (** BOOLEAN *)
  3950. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3951. VAR lval, rval: BOOLEAN;
  3952. BEGIN
  3953. SYSTEM.GET( radr, rval );
  3954. WHILE (len > 0) DO
  3955. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3956. INC( dadr, dinc ); DEC( len );
  3957. END;
  3958. END EEqlABSBLoop;
  3959. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3960. BEGIN
  3961. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3962. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3963. RETURN RESULT
  3964. END ".=";
  3965. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3966. BEGIN
  3967. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3968. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3969. RETURN RESULT
  3970. END ".=";
  3971. (** SHORTINT *)
  3972. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3973. VAR lval, rval: SHORTINT;
  3974. BEGIN
  3975. SYSTEM.GET( radr, rval );
  3976. WHILE (len > 0) DO
  3977. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3978. INC( dadr, dinc ); DEC( len );
  3979. END;
  3980. END EEqlASSSLoop;
  3981. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3982. BEGIN
  3983. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3984. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3985. RETURN RESULT
  3986. END ".=";
  3987. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3988. BEGIN
  3989. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3990. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3991. RETURN RESULT
  3992. END ".=";
  3993. (** INTEGER *)
  3994. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3995. VAR lval, rval: INTEGER;
  3996. BEGIN
  3997. SYSTEM.GET( radr, rval );
  3998. WHILE (len > 0) DO
  3999. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4000. INC( dadr, dinc ); DEC( len );
  4001. END;
  4002. END EEqlAISILoop;
  4003. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4004. BEGIN
  4005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4006. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4007. RETURN RESULT
  4008. END ".=";
  4009. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4010. BEGIN
  4011. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4012. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4013. RETURN RESULT
  4014. END ".=";
  4015. (** LONGINT *)
  4016. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4017. VAR lval, rval: LONGINT;
  4018. BEGIN
  4019. SYSTEM.GET( radr, rval );
  4020. WHILE (len > 0) DO
  4021. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4022. INC( dadr, dinc ); DEC( len );
  4023. END;
  4024. END EEqlALSLLoop;
  4025. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4026. BEGIN
  4027. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4028. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4029. RETURN RESULT
  4030. END ".=";
  4031. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4032. BEGIN
  4033. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4034. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4035. RETURN RESULT
  4036. END ".=";
  4037. (** REAL *)
  4038. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4039. VAR lval, rval: REAL;
  4040. BEGIN
  4041. SYSTEM.GET( radr, rval );
  4042. WHILE (len > 0) DO
  4043. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4044. INC( dadr, dinc ); DEC( len );
  4045. END;
  4046. END EEqlARSRLoop;
  4047. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4048. BEGIN
  4049. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4050. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4051. RETURN RESULT
  4052. END ".=";
  4053. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4054. BEGIN
  4055. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4056. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4057. RETURN RESULT
  4058. END ".=";
  4059. (** LONGREAL *)
  4060. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4061. VAR lval, rval: LONGREAL;
  4062. BEGIN
  4063. SYSTEM.GET( radr, rval );
  4064. WHILE (len > 0) DO
  4065. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4066. INC( dadr, dinc ); DEC( len );
  4067. END;
  4068. END EEqlAXSXLoop;
  4069. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4070. BEGIN
  4071. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4072. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4073. RETURN RESULT
  4074. END ".=";
  4075. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4076. BEGIN
  4077. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4078. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4079. RETURN RESULT
  4080. END ".=";
  4081. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4082. (** BOOLEAN *)
  4083. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4084. VAR lval, rval: BOOLEAN;
  4085. BEGIN
  4086. WHILE (len > 0) DO
  4087. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4088. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4089. END;
  4090. END ENeqABABLoop;
  4091. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4092. BEGIN
  4093. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4094. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4095. RETURN RESULT
  4096. END ".#";
  4097. (** SHORTINT *)
  4098. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4099. VAR lval, rval: SHORTINT;
  4100. BEGIN
  4101. WHILE (len > 0) DO
  4102. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4103. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4104. END;
  4105. END ENeqASASLoop;
  4106. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4107. BEGIN
  4108. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4109. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4110. RETURN RESULT
  4111. END ".#";
  4112. (** INTEGER*)
  4113. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4114. VAR lval, rval: INTEGER;
  4115. BEGIN
  4116. WHILE (len > 0) DO
  4117. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4118. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4119. END;
  4120. END ENeqAIAILoop;
  4121. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4122. BEGIN
  4123. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4124. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4125. RETURN RESULT
  4126. END ".#";
  4127. (** LONGINT*)
  4128. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4129. VAR lval, rval: LONGINT;
  4130. BEGIN
  4131. WHILE (len > 0) DO
  4132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4133. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4134. END;
  4135. END ENeqALALLoop;
  4136. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4137. BEGIN
  4138. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4139. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4140. RETURN RESULT
  4141. END ".#";
  4142. (** REAL *)
  4143. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4144. VAR lval, rval: REAL;
  4145. BEGIN
  4146. WHILE (len > 0) DO
  4147. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4148. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4149. END;
  4150. END ENeqARARLoop;
  4151. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4152. BEGIN
  4153. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4154. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4155. RETURN RESULT
  4156. END ".#";
  4157. (** LONGREAL *)
  4158. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4159. VAR lval, rval: LONGREAL;
  4160. BEGIN
  4161. WHILE (len > 0) DO
  4162. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4163. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4164. END;
  4165. END ENeqAXAXLoop;
  4166. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4167. BEGIN
  4168. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4169. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4170. RETURN RESULT
  4171. END ".#";
  4172. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4173. (** BOOLEAN *)
  4174. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4175. VAR lval, rval: BOOLEAN;
  4176. BEGIN
  4177. SYSTEM.GET( radr, rval );
  4178. WHILE (len > 0) DO
  4179. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4180. INC( dadr, dinc ); DEC( len );
  4181. END;
  4182. END ENeqABSBLoop;
  4183. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4184. BEGIN
  4185. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4186. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4187. RETURN RESULT
  4188. END ".#";
  4189. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4190. BEGIN
  4191. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4192. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4193. RETURN RESULT
  4194. END ".#";
  4195. (** SHORTINT *)
  4196. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4197. VAR lval, rval: SHORTINT;
  4198. BEGIN
  4199. SYSTEM.GET( radr, rval );
  4200. WHILE (len > 0) DO
  4201. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4202. INC( dadr, dinc ); DEC( len );
  4203. END;
  4204. END ENeqASSSLoop;
  4205. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4206. BEGIN
  4207. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4208. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4209. RETURN RESULT
  4210. END ".#";
  4211. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4212. BEGIN
  4213. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4214. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4215. RETURN RESULT
  4216. END ".#";
  4217. (** INTEGER *)
  4218. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4219. VAR lval, rval: INTEGER;
  4220. BEGIN
  4221. SYSTEM.GET( radr, rval );
  4222. WHILE (len > 0) DO
  4223. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4224. INC( dadr, dinc ); DEC( len );
  4225. END;
  4226. END ENeqAISILoop;
  4227. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4228. BEGIN
  4229. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4230. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4231. RETURN RESULT
  4232. END ".#";
  4233. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4234. BEGIN
  4235. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4236. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4237. RETURN RESULT
  4238. END ".#";
  4239. (** LONGINT *)
  4240. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4241. VAR lval, rval: LONGINT;
  4242. BEGIN
  4243. SYSTEM.GET( radr, rval );
  4244. WHILE (len > 0) DO
  4245. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4246. INC( dadr, dinc ); DEC( len );
  4247. END;
  4248. END ENeqALSLLoop;
  4249. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4250. BEGIN
  4251. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4252. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4253. RETURN RESULT
  4254. END ".#";
  4255. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4256. BEGIN
  4257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4258. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4259. RETURN RESULT
  4260. END ".#";
  4261. (** REAL *)
  4262. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4263. VAR lval, rval: REAL;
  4264. BEGIN
  4265. SYSTEM.GET( radr, rval );
  4266. WHILE (len > 0) DO
  4267. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4268. INC( dadr, dinc ); DEC( len );
  4269. END;
  4270. END ENeqARSRLoop;
  4271. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4272. BEGIN
  4273. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4274. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4275. RETURN RESULT
  4276. END ".#";
  4277. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4278. BEGIN
  4279. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4280. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4281. RETURN RESULT
  4282. END ".#";
  4283. (** LONGREAL *)
  4284. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4285. VAR lval, rval: LONGREAL;
  4286. BEGIN
  4287. SYSTEM.GET( radr, rval );
  4288. WHILE (len > 0) DO
  4289. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4290. INC( dadr, dinc ); DEC( len );
  4291. END;
  4292. END ENeqAXSXLoop;
  4293. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4294. BEGIN
  4295. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4296. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4297. RETURN RESULT
  4298. END ".#";
  4299. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4300. BEGIN
  4301. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4302. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4303. RETURN RESULT
  4304. END ".#";
  4305. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4306. (** SHORTINT *)
  4307. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4308. VAR lval, rval: SHORTINT;
  4309. BEGIN
  4310. WHILE (len > 0) DO
  4311. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4312. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4313. END;
  4314. END EGtrASASLoop;
  4315. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4316. BEGIN
  4317. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4318. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4319. RETURN RESULT
  4320. END ".>";
  4321. (** INTEGER *)
  4322. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4323. VAR lval, rval: INTEGER;
  4324. BEGIN
  4325. WHILE (len > 0) DO
  4326. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4327. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4328. END;
  4329. END EGtrAIAILoop;
  4330. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4331. BEGIN
  4332. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4333. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4334. RETURN RESULT
  4335. END ".>";
  4336. (** LONGINT *)
  4337. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4338. VAR lval, rval: LONGINT;
  4339. BEGIN
  4340. WHILE (len > 0) DO
  4341. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4342. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4343. END;
  4344. END EGtrALALLoop;
  4345. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4346. BEGIN
  4347. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4348. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4349. RETURN RESULT
  4350. END ".>";
  4351. (** REAL *)
  4352. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4353. VAR lval, rval: REAL;
  4354. BEGIN
  4355. WHILE (len > 0) DO
  4356. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4357. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4358. END;
  4359. END EGtrARARLoop;
  4360. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4361. BEGIN
  4362. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4363. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4364. RETURN RESULT
  4365. END ".>";
  4366. (** LONGREAL *)
  4367. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4368. VAR lval, rval: LONGREAL;
  4369. BEGIN
  4370. WHILE (len > 0) DO
  4371. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4372. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4373. END;
  4374. END EGtrAXAXLoop;
  4375. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4376. BEGIN
  4377. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4378. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4379. RETURN RESULT
  4380. END ".>";
  4381. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4382. (** SHORTINT *)
  4383. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4384. VAR lval, rval: SHORTINT;
  4385. BEGIN
  4386. SYSTEM.GET( radr, rval );
  4387. WHILE (len > 0) DO
  4388. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4389. INC( dadr, dinc ); DEC( len );
  4390. END;
  4391. END EGtrASSSLoop;
  4392. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4393. BEGIN
  4394. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4395. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4396. RETURN RESULT
  4397. END ".>";
  4398. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4399. BEGIN
  4400. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4401. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4402. RETURN RESULT
  4403. END ".<";
  4404. (** INTEGER *)
  4405. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4406. VAR lval, rval: INTEGER;
  4407. BEGIN
  4408. SYSTEM.GET( radr, rval );
  4409. WHILE (len > 0) DO
  4410. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4411. INC( dadr, dinc ); DEC( len );
  4412. END;
  4413. END EGtrAISILoop;
  4414. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4415. BEGIN
  4416. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4417. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4418. RETURN RESULT
  4419. END ".>";
  4420. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4421. BEGIN
  4422. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4423. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4424. RETURN RESULT
  4425. END ".<";
  4426. (** LONGINT *)
  4427. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4428. VAR lval, rval: LONGINT;
  4429. BEGIN
  4430. SYSTEM.GET( radr, rval );
  4431. WHILE (len > 0) DO
  4432. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4433. INC( dadr, dinc ); DEC( len );
  4434. END;
  4435. END EGtrALSLLoop;
  4436. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4437. BEGIN
  4438. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4439. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4440. RETURN RESULT
  4441. END ".>";
  4442. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4443. BEGIN
  4444. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4445. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4446. RETURN RESULT
  4447. END ".<";
  4448. (** REAL *)
  4449. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4450. VAR lval, rval: REAL;
  4451. BEGIN
  4452. SYSTEM.GET( radr, rval );
  4453. WHILE (len > 0) DO
  4454. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4455. INC( dadr, dinc ); DEC( len );
  4456. END;
  4457. END EGtrARSRLoop;
  4458. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4459. BEGIN
  4460. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4461. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4462. RETURN RESULT
  4463. END ".>";
  4464. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4465. BEGIN
  4466. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4467. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4468. RETURN RESULT
  4469. END ".<";
  4470. (** LONGREAL *)
  4471. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4472. VAR lval, rval: LONGREAL;
  4473. BEGIN
  4474. SYSTEM.GET( radr, rval );
  4475. WHILE (len > 0) DO
  4476. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4477. INC( dadr, dinc ); DEC( len );
  4478. END;
  4479. END EGtrAXSXLoop;
  4480. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4481. BEGIN
  4482. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4483. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4484. RETURN RESULT
  4485. END ".>";
  4486. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4487. BEGIN
  4488. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4489. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4490. RETURN RESULT
  4491. END ".<";
  4492. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4493. (** SHORTINT *)
  4494. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4495. VAR lval, rval: SHORTINT;
  4496. BEGIN
  4497. WHILE (len > 0) DO
  4498. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4499. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4500. END;
  4501. END EGeqASASLoop;
  4502. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4503. BEGIN
  4504. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4505. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4506. RETURN RESULT
  4507. END ".>=";
  4508. (** INTEGER *)
  4509. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4510. VAR lval, rval: INTEGER;
  4511. BEGIN
  4512. WHILE (len > 0) DO
  4513. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4514. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4515. END;
  4516. END EGeqAIAILoop;
  4517. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4518. BEGIN
  4519. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4520. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4521. RETURN RESULT
  4522. END ".>=";
  4523. (** LONGINT *)
  4524. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4525. VAR lval, rval: LONGINT;
  4526. BEGIN
  4527. WHILE (len > 0) DO
  4528. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4529. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4530. END;
  4531. END EGeqALALLoop;
  4532. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4533. BEGIN
  4534. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4535. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4536. RETURN RESULT
  4537. END ".>=";
  4538. (** REAL *)
  4539. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4540. VAR lval, rval: REAL;
  4541. BEGIN
  4542. WHILE (len > 0) DO
  4543. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4544. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4545. END;
  4546. END EGeqARARLoop;
  4547. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4548. BEGIN
  4549. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4550. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4551. RETURN RESULT
  4552. END ".>=";
  4553. (** LONGREAL *)
  4554. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4555. VAR lval, rval: LONGREAL;
  4556. BEGIN
  4557. WHILE (len > 0) DO
  4558. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4559. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4560. END;
  4561. END EGeqAXAXLoop;
  4562. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4563. BEGIN
  4564. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4565. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4566. RETURN RESULT
  4567. END ".>=";
  4568. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4569. (** SHORTINT *)
  4570. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4571. VAR lval, rval: SHORTINT;
  4572. BEGIN
  4573. SYSTEM.GET( radr, rval );
  4574. WHILE (len > 0) DO
  4575. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4576. INC( dadr, dinc ); DEC( len );
  4577. END;
  4578. END EGeqASSSLoop;
  4579. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4580. BEGIN
  4581. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4582. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4583. RETURN RESULT
  4584. END ".>=";
  4585. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4586. BEGIN
  4587. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4588. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4589. RETURN RESULT
  4590. END ".<=";
  4591. (** INTEGER *)
  4592. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4593. VAR lval, rval: INTEGER;
  4594. BEGIN
  4595. SYSTEM.GET( radr, rval );
  4596. WHILE (len > 0) DO
  4597. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4598. INC( dadr, dinc ); DEC( len );
  4599. END;
  4600. END EGeqAISILoop;
  4601. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4602. BEGIN
  4603. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4604. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4605. RETURN RESULT
  4606. END ".>=";
  4607. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4608. BEGIN
  4609. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4610. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4611. RETURN RESULT
  4612. END ".<=";
  4613. (** LONGINT *)
  4614. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4615. VAR lval, rval: LONGINT;
  4616. BEGIN
  4617. SYSTEM.GET( radr, rval );
  4618. WHILE (len > 0) DO
  4619. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4620. INC( dadr, dinc ); DEC( len );
  4621. END;
  4622. END EGeqALSLLoop;
  4623. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4624. BEGIN
  4625. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4626. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4627. RETURN RESULT
  4628. END ".>=";
  4629. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4630. BEGIN
  4631. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4632. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4633. RETURN RESULT
  4634. END ".<=";
  4635. (** REAL *)
  4636. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4637. VAR lval, rval: REAL;
  4638. BEGIN
  4639. SYSTEM.GET( radr, rval );
  4640. WHILE (len > 0) DO
  4641. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4642. INC( dadr, dinc ); DEC( len );
  4643. END;
  4644. END EGeqARSRLoop;
  4645. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4646. BEGIN
  4647. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4648. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4649. RETURN RESULT
  4650. END ".>=";
  4651. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4652. BEGIN
  4653. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4654. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4655. RETURN RESULT
  4656. END ".<=";
  4657. (** LONGREAL *)
  4658. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4659. VAR lval, rval: LONGREAL;
  4660. BEGIN
  4661. SYSTEM.GET( radr, rval );
  4662. WHILE (len > 0) DO
  4663. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4664. INC( dadr, dinc ); DEC( len );
  4665. END;
  4666. END EGeqAXSXLoop;
  4667. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4668. BEGIN
  4669. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4670. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4671. RETURN RESULT
  4672. END ".>=";
  4673. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4674. BEGIN
  4675. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4676. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4677. RETURN RESULT
  4678. END ".<=";
  4679. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4680. (** SHORTINT *)
  4681. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4682. VAR lval, rval: SHORTINT;
  4683. BEGIN
  4684. WHILE (len > 0) DO
  4685. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4686. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4687. END;
  4688. END ELssASASLoop;
  4689. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4690. BEGIN
  4691. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4692. SIZEOF( BOOLEAN ), ELssASASLoop );
  4693. RETURN RESULT
  4694. END ".<";
  4695. (** INTEGER *)
  4696. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4697. VAR lval, rval: INTEGER;
  4698. BEGIN
  4699. WHILE (len > 0) DO
  4700. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4701. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4702. END;
  4703. END ELssAIAILoop;
  4704. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4705. BEGIN
  4706. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4707. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4708. RETURN RESULT
  4709. END ".<";
  4710. (** LONGINT*)
  4711. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4712. VAR lval, rval: LONGINT;
  4713. BEGIN
  4714. WHILE (len > 0) DO
  4715. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4716. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4717. END;
  4718. END ELssALALLoop;
  4719. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4720. BEGIN
  4721. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4722. SIZEOF( BOOLEAN ), ELssALALLoop );
  4723. RETURN RESULT
  4724. END ".<";
  4725. (** REAL *)
  4726. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4727. VAR lval, rval: REAL;
  4728. BEGIN
  4729. WHILE (len > 0) DO
  4730. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4731. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4732. END;
  4733. END ELssARARLoop;
  4734. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4735. BEGIN
  4736. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4737. SIZEOF( BOOLEAN ), ELssARARLoop );
  4738. RETURN RESULT
  4739. END ".<";
  4740. (** LONGREAL *)
  4741. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4742. VAR lval, rval: LONGREAL;
  4743. BEGIN
  4744. WHILE (len > 0) DO
  4745. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4746. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4747. END;
  4748. END ELssAXAXLoop;
  4749. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4750. BEGIN
  4751. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4752. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4753. RETURN RESULT
  4754. END ".<";
  4755. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4756. (** SHORTINT *)
  4757. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4758. VAR lval, rval: SHORTINT;
  4759. BEGIN
  4760. SYSTEM.GET( radr, rval );
  4761. WHILE (len > 0) DO
  4762. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4763. INC( dadr, dinc ); DEC( len );
  4764. END;
  4765. END ELssASSSLoop;
  4766. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4767. BEGIN
  4768. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4769. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4770. RETURN RESULT
  4771. END ".<";
  4772. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4773. BEGIN
  4774. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4775. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4776. RETURN RESULT
  4777. END ".>";
  4778. (** INTEGER *)
  4779. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4780. VAR lval, rval: INTEGER;
  4781. BEGIN
  4782. SYSTEM.GET( radr, rval );
  4783. WHILE (len > 0) DO
  4784. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4785. INC( dadr, dinc ); DEC( len );
  4786. END;
  4787. END ELssAISILoop;
  4788. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4789. BEGIN
  4790. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4791. SIZEOF( BOOLEAN ), ELssAISILoop );
  4792. RETURN RESULT
  4793. END ".<";
  4794. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4795. BEGIN
  4796. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4797. SIZEOF( BOOLEAN ), ELssAISILoop );
  4798. RETURN RESULT
  4799. END ".>";
  4800. (** LONGINT *)
  4801. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4802. VAR lval, rval: LONGINT;
  4803. BEGIN
  4804. SYSTEM.GET( radr, rval );
  4805. WHILE (len > 0) DO
  4806. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4807. INC( dadr, dinc ); DEC( len );
  4808. END;
  4809. END ELssALSLLoop;
  4810. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4811. BEGIN
  4812. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4813. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4814. RETURN RESULT
  4815. END ".<";
  4816. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4817. BEGIN
  4818. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4819. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4820. RETURN RESULT
  4821. END ".>";
  4822. (** REAL *)
  4823. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4824. VAR lval, rval: REAL;
  4825. BEGIN
  4826. SYSTEM.GET( radr, rval );
  4827. WHILE (len > 0) DO
  4828. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4829. INC( dadr, dinc ); DEC( len );
  4830. END;
  4831. END ELssARSRLoop;
  4832. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4833. BEGIN
  4834. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4835. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4836. RETURN RESULT
  4837. END ".<";
  4838. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4839. BEGIN
  4840. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4841. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4842. RETURN RESULT
  4843. END ".>";
  4844. (** LONGREAL *)
  4845. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4846. VAR lval, rval: LONGREAL;
  4847. BEGIN
  4848. SYSTEM.GET( radr, rval );
  4849. WHILE (len > 0) DO
  4850. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4851. INC( dadr, dinc ); DEC( len );
  4852. END;
  4853. END ELssAXSXLoop;
  4854. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4855. BEGIN
  4856. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4857. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4858. RETURN RESULT
  4859. END ".<";
  4860. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4861. BEGIN
  4862. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4863. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4864. RETURN RESULT
  4865. END ".>";
  4866. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4867. (** SHORTINT *)
  4868. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4869. VAR lval, rval: SHORTINT;
  4870. BEGIN
  4871. WHILE (len > 0) DO
  4872. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4873. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4874. END;
  4875. END ELeqASASLoop;
  4876. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4877. BEGIN
  4878. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4879. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4880. RETURN RESULT
  4881. END ".<=";
  4882. (** INTEGER *)
  4883. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4884. VAR lval, rval: INTEGER;
  4885. BEGIN
  4886. WHILE (len > 0) DO
  4887. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4888. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4889. END;
  4890. END ELeqAIAILoop;
  4891. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4892. BEGIN
  4893. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4894. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4895. RETURN RESULT
  4896. END ".<=";
  4897. (** LONGINT *)
  4898. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4899. VAR lval, rval: LONGINT;
  4900. BEGIN
  4901. WHILE (len > 0) DO
  4902. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4903. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4904. END;
  4905. END ELeqALALLoop;
  4906. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4907. BEGIN
  4908. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4909. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4910. RETURN RESULT
  4911. END ".<=";
  4912. (** REAL *)
  4913. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4914. VAR lval, rval: REAL;
  4915. BEGIN
  4916. WHILE (len > 0) DO
  4917. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4918. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4919. END;
  4920. END ELeqARARLoop;
  4921. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4922. BEGIN
  4923. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4924. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4925. RETURN RESULT
  4926. END ".<=";
  4927. (** LONGREAL*)
  4928. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4929. VAR lval, rval: LONGREAL;
  4930. BEGIN
  4931. WHILE (len > 0) DO
  4932. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4933. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4934. END;
  4935. END ELeqAXAXLoop;
  4936. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4937. BEGIN
  4938. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4939. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4940. RETURN RESULT
  4941. END ".<=";
  4942. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4943. (** SHORTINT *)
  4944. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4945. VAR lval, rval: SHORTINT;
  4946. BEGIN
  4947. SYSTEM.GET( radr, rval );
  4948. WHILE (len > 0) DO
  4949. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4950. INC( dadr, dinc ); DEC( len );
  4951. END;
  4952. END ELeqASSSLoop;
  4953. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4954. BEGIN
  4955. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4956. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4957. RETURN RESULT
  4958. END ".<=";
  4959. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4960. BEGIN
  4961. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4962. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4963. RETURN RESULT
  4964. END ".>=";
  4965. (** INTEGER *)
  4966. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4967. VAR lval, rval: INTEGER;
  4968. BEGIN
  4969. SYSTEM.GET( radr, rval );
  4970. WHILE (len > 0) DO
  4971. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4972. INC( dadr, dinc ); DEC( len );
  4973. END;
  4974. END ELeqAISILoop;
  4975. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4976. BEGIN
  4977. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4978. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4979. RETURN RESULT
  4980. END ".<=";
  4981. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4982. BEGIN
  4983. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4984. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4985. RETURN RESULT
  4986. END ".>=";
  4987. (** LONGINT *)
  4988. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4989. VAR lval, rval: LONGINT;
  4990. BEGIN
  4991. SYSTEM.GET( radr, rval );
  4992. WHILE (len > 0) DO
  4993. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4994. INC( dadr, dinc ); DEC( len );
  4995. END;
  4996. END ELeqALSLLoop;
  4997. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4998. BEGIN
  4999. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5000. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5001. RETURN RESULT
  5002. END ".<=";
  5003. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5004. BEGIN
  5005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5006. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5007. RETURN RESULT
  5008. END ".>=";
  5009. (** REAL *)
  5010. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5011. VAR lval, rval: REAL;
  5012. BEGIN
  5013. SYSTEM.GET( radr, rval );
  5014. WHILE (len > 0) DO
  5015. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5016. INC( dadr, dinc ); DEC( len );
  5017. END;
  5018. END ELeqARSRLoop;
  5019. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5020. BEGIN
  5021. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5022. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5023. RETURN RESULT
  5024. END ".<=";
  5025. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5026. BEGIN
  5027. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5028. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5029. RETURN RESULT
  5030. END ".>=";
  5031. (** LONGREAL *)
  5032. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5033. VAR lval, rval: LONGREAL;
  5034. BEGIN
  5035. SYSTEM.GET( radr, rval );
  5036. WHILE (len > 0) DO
  5037. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5038. INC( dadr, dinc ); DEC( len );
  5039. END;
  5040. END ELeqAXSXLoop;
  5041. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5042. BEGIN
  5043. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5044. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5045. RETURN RESULT
  5046. END ".<=";
  5047. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5048. BEGIN
  5049. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5050. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5051. RETURN RESULT
  5052. END ".>=";
  5053. (*** elementwise or, elementwise and ********************************************************************)
  5054. (** array x array *)
  5055. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5056. VAR lval, rval: BOOLEAN;
  5057. BEGIN
  5058. WHILE (len > 0) DO
  5059. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5060. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5061. END;
  5062. END ElOrABABLoop;
  5063. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5064. BEGIN
  5065. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5066. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5067. RETURN RESULT
  5068. END "OR";
  5069. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5070. VAR lval, rval: BOOLEAN;
  5071. BEGIN
  5072. WHILE (len > 0) DO
  5073. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5074. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5075. END;
  5076. END ElAndABABLoop;
  5077. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5078. BEGIN
  5079. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5080. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5081. RETURN RESULT
  5082. END "&";
  5083. (** array x boolean *)
  5084. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5085. VAR lval, rval: BOOLEAN;
  5086. BEGIN
  5087. SYSTEM.GET( radr, rval );
  5088. WHILE (len > 0) DO
  5089. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5090. INC( dadr, dinc ); DEC( len );
  5091. END;
  5092. END ElOrABSBLoop;
  5093. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5094. BEGIN
  5095. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5096. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5097. RETURN RESULT
  5098. END "OR";
  5099. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5100. BEGIN
  5101. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5102. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5103. RETURN RESULT
  5104. END "OR";
  5105. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5106. VAR lval, rval: BOOLEAN;
  5107. BEGIN
  5108. SYSTEM.GET( radr, rval );
  5109. WHILE (len > 0) DO
  5110. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5111. INC( dadr, dinc ); DEC( len );
  5112. END;
  5113. END ElAndABSBLoop;
  5114. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5115. BEGIN
  5116. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5117. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5118. RETURN RESULT
  5119. END "&";
  5120. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5121. BEGIN
  5122. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5123. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5124. RETURN RESULT
  5125. END "&";
  5126. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5127. (** SHORTINT *)
  5128. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5129. VAR lval, rval: SHORTINT;
  5130. BEGIN
  5131. WHILE (len > 0) DO
  5132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5133. IF rval <= lval THEN RETURN FALSE END;
  5134. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5135. END;
  5136. RETURN TRUE;
  5137. END LssASASLoop;
  5138. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5139. BEGIN
  5140. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5141. END "<";
  5142. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5143. VAR lval, rval: SHORTINT;
  5144. BEGIN
  5145. WHILE (len > 0) DO
  5146. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5147. IF rval > lval THEN RETURN FALSE END;
  5148. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5149. END;
  5150. RETURN TRUE;
  5151. END GeqASASLoop;
  5152. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5153. BEGIN
  5154. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5155. END ">=";
  5156. (** INTEGER *)
  5157. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5158. VAR lval, rval: INTEGER;
  5159. BEGIN
  5160. WHILE (len > 0) DO
  5161. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5162. IF rval <= lval THEN RETURN FALSE END;
  5163. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5164. END;
  5165. RETURN TRUE;
  5166. END LssAIAILoop;
  5167. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5168. BEGIN
  5169. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5170. END "<";
  5171. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5172. VAR lval, rval: INTEGER;
  5173. BEGIN
  5174. WHILE (len > 0) DO
  5175. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5176. IF rval > lval THEN RETURN FALSE END;
  5177. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5178. END;
  5179. RETURN TRUE;
  5180. END GeqAIAILoop;
  5181. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5182. BEGIN
  5183. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5184. END ">=";
  5185. (** LONGINT *)
  5186. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5187. VAR lval, rval: LONGINT;
  5188. BEGIN
  5189. WHILE (len > 0) DO
  5190. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5191. IF rval <= lval THEN RETURN FALSE END;
  5192. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5193. END;
  5194. RETURN TRUE;
  5195. END LssALALLoop;
  5196. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5197. BEGIN
  5198. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5199. END "<";
  5200. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5201. VAR lval, rval: LONGINT;
  5202. BEGIN
  5203. WHILE (len > 0) DO
  5204. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5205. IF rval > lval THEN RETURN FALSE END;
  5206. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5207. END;
  5208. RETURN TRUE;
  5209. END GeqALALLoop;
  5210. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5211. BEGIN
  5212. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5213. END ">=";
  5214. (** SIZE *)
  5215. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5216. VAR lval, rval: LONGINT;
  5217. BEGIN
  5218. WHILE (len > 0) DO
  5219. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5220. IF rval <= lval THEN RETURN FALSE END;
  5221. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5222. END;
  5223. RETURN TRUE;
  5224. END LssAZAZLoop;
  5225. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5226. BEGIN
  5227. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZAZLoop , FALSE);
  5228. END "<";
  5229. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5230. VAR lval, rval: SIZE;
  5231. BEGIN
  5232. WHILE (len > 0) DO
  5233. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5234. IF rval > lval THEN RETURN FALSE END;
  5235. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5236. END;
  5237. RETURN TRUE;
  5238. END GeqAZAZLoop;
  5239. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5240. BEGIN
  5241. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZAZLoop , FALSE);
  5242. END ">=";
  5243. (** REAL *)
  5244. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5245. VAR lval, rval: REAL;
  5246. BEGIN
  5247. WHILE (len > 0) DO
  5248. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5249. IF rval <= lval THEN RETURN FALSE END;
  5250. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5251. END;
  5252. RETURN TRUE;
  5253. END LssARARLoop;
  5254. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5255. BEGIN
  5256. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5257. END "<";
  5258. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5259. VAR lval, rval: REAL;
  5260. BEGIN
  5261. WHILE (len > 0) DO
  5262. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5263. IF rval > lval THEN RETURN FALSE END;
  5264. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5265. END;
  5266. RETURN TRUE;
  5267. END GeqARARLoop;
  5268. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5269. BEGIN
  5270. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5271. END ">=";
  5272. (** LONGREAL *)
  5273. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5274. VAR lval, rval: LONGREAL;
  5275. BEGIN
  5276. WHILE (len > 0) DO
  5277. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5278. IF rval <= lval THEN RETURN FALSE END;
  5279. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5280. END;
  5281. RETURN TRUE;
  5282. END LssAXAXLoop;
  5283. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5284. BEGIN
  5285. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5286. END "<";
  5287. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5288. VAR lval, rval: LONGREAL;
  5289. BEGIN
  5290. WHILE (len > 0) DO
  5291. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5292. IF rval > lval THEN RETURN FALSE END;
  5293. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5294. END;
  5295. RETURN TRUE;
  5296. END GeqAXAXLoop;
  5297. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5298. BEGIN
  5299. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5300. END ">=";
  5301. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5302. (** SHORTINT *)
  5303. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5304. VAR lval, rval: SHORTINT;
  5305. BEGIN
  5306. WHILE (len > 0) DO
  5307. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5308. IF rval >= lval THEN RETURN FALSE END;
  5309. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5310. END;
  5311. RETURN TRUE;
  5312. END GtrASASLoop;
  5313. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5314. BEGIN
  5315. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5316. END ">";
  5317. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5318. VAR lval, rval: SHORTINT;
  5319. BEGIN
  5320. WHILE (len > 0) DO
  5321. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5322. IF rval < lval THEN RETURN FALSE END;
  5323. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5324. END;
  5325. RETURN TRUE;
  5326. END LeqASASLoop;
  5327. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5328. BEGIN
  5329. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5330. END "<=";
  5331. (** INTEGER *)
  5332. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5333. VAR lval, rval: INTEGER;
  5334. BEGIN
  5335. WHILE (len > 0) DO
  5336. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5337. IF rval >= lval THEN RETURN FALSE END;
  5338. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5339. END;
  5340. RETURN TRUE;
  5341. END GtrAIAILoop;
  5342. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5343. BEGIN
  5344. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5345. END ">";
  5346. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5347. VAR lval, rval: INTEGER;
  5348. BEGIN
  5349. WHILE (len > 0) DO
  5350. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5351. IF rval < lval THEN RETURN FALSE END;
  5352. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5353. END;
  5354. RETURN TRUE;
  5355. END LeqAIAILoop;
  5356. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5357. BEGIN
  5358. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5359. END "<=";
  5360. (** LONGINT *)
  5361. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5362. VAR lval, rval: LONGINT;
  5363. BEGIN
  5364. WHILE (len > 0) DO
  5365. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5366. IF rval >= lval THEN RETURN FALSE END;
  5367. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5368. END;
  5369. RETURN TRUE;
  5370. END GtrALALLoop;
  5371. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5372. BEGIN
  5373. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5374. END ">";
  5375. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5376. VAR lval, rval: LONGINT;
  5377. BEGIN
  5378. WHILE (len > 0) DO
  5379. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5380. IF rval < lval THEN RETURN FALSE END;
  5381. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5382. END;
  5383. RETURN TRUE;
  5384. END LeqALALLoop;
  5385. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5386. BEGIN
  5387. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5388. END "<=";
  5389. (** SIZE *)
  5390. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5391. VAR lval, rval: SIZE;
  5392. BEGIN
  5393. WHILE (len > 0) DO
  5394. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5395. IF rval >= lval THEN RETURN FALSE END;
  5396. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5397. END;
  5398. RETURN TRUE;
  5399. END GtrAZAZLoop;
  5400. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5401. BEGIN
  5402. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZAZLoop , FALSE);
  5403. END ">";
  5404. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5405. VAR lval, rval: SIZE;
  5406. BEGIN
  5407. WHILE (len > 0) DO
  5408. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5409. IF rval < lval THEN RETURN FALSE END;
  5410. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5411. END;
  5412. RETURN TRUE;
  5413. END LeqAZAZLoop;
  5414. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5415. BEGIN
  5416. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZAZLoop , FALSE);
  5417. END "<=";
  5418. (** SIZE *)
  5419. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5420. VAR lval, rval: REAL;
  5421. BEGIN
  5422. WHILE (len > 0) DO
  5423. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5424. IF rval >= lval THEN RETURN FALSE END;
  5425. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5426. END;
  5427. RETURN TRUE;
  5428. END GtrARARLoop;
  5429. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5430. BEGIN
  5431. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5432. END ">";
  5433. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5434. VAR lval, rval: REAL;
  5435. BEGIN
  5436. WHILE (len > 0) DO
  5437. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5438. IF rval < lval THEN RETURN FALSE END;
  5439. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5440. END;
  5441. RETURN TRUE;
  5442. END LeqARARLoop;
  5443. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5444. BEGIN
  5445. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5446. END "<=";
  5447. (** LONGREAL *)
  5448. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5449. VAR lval, rval: LONGREAL;
  5450. BEGIN
  5451. WHILE (len > 0) DO
  5452. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5453. IF rval >= lval THEN RETURN FALSE END;
  5454. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5455. END;
  5456. RETURN TRUE;
  5457. END GtrAXAXLoop;
  5458. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5459. BEGIN
  5460. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5461. END ">";
  5462. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5463. VAR lval, rval: LONGREAL;
  5464. BEGIN
  5465. WHILE (len > 0) DO
  5466. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5467. IF rval < lval THEN RETURN FALSE END;
  5468. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5469. END;
  5470. RETURN TRUE;
  5471. END LeqAXAXLoop;
  5472. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5473. BEGIN
  5474. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5475. END "<=";
  5476. (*** equals: array x array -> boolean ********************************************************************)
  5477. (** BOOLEAN *)
  5478. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5479. VAR lval, rval: BOOLEAN;
  5480. BEGIN
  5481. WHILE (len > 0) DO
  5482. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5483. IF rval # lval THEN RETURN FALSE END;
  5484. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5485. END;
  5486. RETURN TRUE;
  5487. END EqlABABLoop;
  5488. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5489. BEGIN
  5490. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5491. END "=";
  5492. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5493. BEGIN
  5494. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5495. END "#";
  5496. (** SHORTINT *)
  5497. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5498. VAR lval, rval: SHORTINT;
  5499. BEGIN
  5500. WHILE (len > 0) DO
  5501. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5502. IF rval # lval THEN RETURN FALSE END;
  5503. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5504. END;
  5505. RETURN TRUE;
  5506. END EqlASASLoop;
  5507. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5508. BEGIN
  5509. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5510. END "=";
  5511. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5512. BEGIN
  5513. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5514. END "#";
  5515. (** INTEGER *)
  5516. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5517. VAR lval, rval: INTEGER;
  5518. BEGIN
  5519. WHILE (len > 0) DO
  5520. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5521. IF rval # lval THEN RETURN FALSE END;
  5522. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5523. END;
  5524. RETURN TRUE;
  5525. END EqlAIAILoop;
  5526. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5527. BEGIN
  5528. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5529. END "=";
  5530. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5531. BEGIN
  5532. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5533. END "#";
  5534. (** LONGINT *)
  5535. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5536. VAR lval, rval: LONGINT;
  5537. BEGIN
  5538. WHILE (len > 0) DO
  5539. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5540. IF rval # lval THEN RETURN FALSE END;
  5541. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5542. END;
  5543. RETURN TRUE;
  5544. END EqlALALLoop;
  5545. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5546. BEGIN
  5547. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5548. END "=";
  5549. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5550. BEGIN
  5551. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5552. END "#";
  5553. (** SIZE *)
  5554. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5555. VAR lval, rval: SIZE;
  5556. BEGIN
  5557. WHILE (len > 0) DO
  5558. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5559. IF rval # lval THEN RETURN FALSE END;
  5560. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5561. END;
  5562. RETURN TRUE;
  5563. END EqlAZAZLoop;
  5564. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5565. BEGIN
  5566. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5567. END "=";
  5568. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5569. BEGIN
  5570. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5571. END "#";
  5572. (** REAL *)
  5573. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5574. VAR lval, rval: REAL;
  5575. BEGIN
  5576. WHILE (len > 0) DO
  5577. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5578. IF rval # lval THEN RETURN FALSE END;
  5579. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5580. END;
  5581. RETURN TRUE;
  5582. END EqlARARLoop;
  5583. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5584. BEGIN
  5585. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5586. END "=";
  5587. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5588. BEGIN
  5589. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5590. END "#";
  5591. (** LONGREAL *)
  5592. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5593. VAR lval, rval: LONGREAL;
  5594. BEGIN
  5595. WHILE (len > 0) DO
  5596. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5597. IF rval # lval THEN RETURN FALSE END;
  5598. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5599. END;
  5600. RETURN TRUE;
  5601. END EqlAXAXLoop;
  5602. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5603. BEGIN
  5604. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5605. END "=";
  5606. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5607. BEGIN
  5608. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5609. END "#";
  5610. (** COMPLEX *)
  5611. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5612. VAR lval, rval: COMPLEX;
  5613. BEGIN
  5614. WHILE (len > 0) DO
  5615. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5616. IF rval # lval THEN RETURN FALSE END;
  5617. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5618. END;
  5619. RETURN TRUE;
  5620. END EqlACACLoop;
  5621. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5622. BEGIN
  5623. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5624. END "=";
  5625. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5626. BEGIN
  5627. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5628. END "#";
  5629. (** LONGCOMPLEX *)
  5630. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5631. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5632. BEGIN
  5633. WHILE (len > 0) DO
  5634. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5635. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5636. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5637. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5638. END;
  5639. RETURN TRUE;
  5640. END EqlALZALZLoop;
  5641. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5642. BEGIN
  5643. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5644. END "=";
  5645. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5646. BEGIN
  5647. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5648. END "#";
  5649. (*** equals: array x scalar -> boolean ********************************************************************)
  5650. (** BOOLEAN *)
  5651. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5652. VAR lval, rval: BOOLEAN;
  5653. BEGIN
  5654. SYSTEM.GET( radr, rval );
  5655. WHILE (len > 0) DO
  5656. SYSTEM.GET( ladr, lval );
  5657. IF lval # rval THEN RETURN FALSE END;
  5658. INC( ladr, linc ); DEC( len );
  5659. END;
  5660. RETURN TRUE;
  5661. END EqlABSBLoop;
  5662. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5663. right: BOOLEAN ): BOOLEAN;
  5664. BEGIN
  5665. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5666. END "=";
  5667. OPERATOR "="*( left: BOOLEAN;
  5668. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5669. BEGIN
  5670. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5671. END "=";
  5672. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5673. right: BOOLEAN ): BOOLEAN;
  5674. BEGIN
  5675. RETURN ~(left = right);
  5676. END "#";
  5677. OPERATOR "#"*( left: BOOLEAN;
  5678. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5679. BEGIN
  5680. RETURN ~( left = right );
  5681. END "#";
  5682. (** SHORTINT *)
  5683. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5684. VAR lval, rval: SHORTINT;
  5685. BEGIN
  5686. SYSTEM.GET( radr, rval );
  5687. WHILE (len > 0) DO
  5688. SYSTEM.GET( ladr, lval );
  5689. IF lval # rval THEN RETURN FALSE END;
  5690. INC( ladr, linc ); DEC( len );
  5691. END;
  5692. RETURN TRUE;
  5693. END EqlASSSLoop;
  5694. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5695. BEGIN
  5696. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5697. END "=";
  5698. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5699. BEGIN
  5700. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5701. END "=";
  5702. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5703. BEGIN
  5704. RETURN ~( left= right );
  5705. END "#";
  5706. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5707. BEGIN
  5708. RETURN ~( left= right );
  5709. END "#";
  5710. (** INTEGER *)
  5711. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5712. VAR lval, rval: INTEGER;
  5713. BEGIN
  5714. SYSTEM.GET( radr, rval );
  5715. WHILE (len > 0) DO
  5716. SYSTEM.GET( ladr, lval );
  5717. IF lval # rval THEN RETURN FALSE END;
  5718. INC( ladr, linc ); DEC( len );
  5719. END;
  5720. RETURN TRUE;
  5721. END EqlAISILoop;
  5722. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5723. BEGIN
  5724. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5725. END "=";
  5726. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5727. BEGIN
  5728. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5729. END "=";
  5730. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5731. BEGIN
  5732. RETURN ~( left = right );
  5733. END "#";
  5734. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5735. BEGIN
  5736. RETURN ~( left = right );
  5737. END "#";
  5738. (** LONGINT *)
  5739. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5740. VAR lval, rval: LONGINT;
  5741. BEGIN
  5742. SYSTEM.GET( radr, rval );
  5743. WHILE (len > 0) DO
  5744. SYSTEM.GET( ladr, lval );
  5745. IF lval # rval THEN RETURN FALSE END;
  5746. INC( ladr, linc ); DEC( len );
  5747. END;
  5748. RETURN TRUE;
  5749. END EqlALSLLoop;
  5750. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5751. right: LONGINT ): BOOLEAN;
  5752. BEGIN
  5753. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5754. END "=";
  5755. OPERATOR "="*( left: LONGINT;
  5756. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5757. BEGIN
  5758. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5759. END "=";
  5760. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5761. right: LONGINT ): BOOLEAN;
  5762. BEGIN
  5763. RETURN ~(left = right);
  5764. END "#";
  5765. OPERATOR "#"*( left: LONGINT;
  5766. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5767. BEGIN
  5768. RETURN ~(left = right);
  5769. END "#";
  5770. (** SIZE *)
  5771. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5772. VAR lval, rval: SIZE;
  5773. BEGIN
  5774. SYSTEM.GET( radr, rval );
  5775. WHILE (len > 0) DO
  5776. SYSTEM.GET( ladr, lval );
  5777. IF lval # rval THEN RETURN FALSE END;
  5778. INC( ladr, linc ); DEC( len );
  5779. END;
  5780. RETURN TRUE;
  5781. END EqlAZSZLoop;
  5782. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5783. right: SIZE ): BOOLEAN;
  5784. BEGIN
  5785. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZSZLoop );
  5786. END "=";
  5787. OPERATOR "="*( left: SIZE;
  5788. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5789. BEGIN
  5790. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5791. END "=";
  5792. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5793. right: SIZE ): BOOLEAN;
  5794. BEGIN
  5795. RETURN ~(left = right);
  5796. END "#";
  5797. OPERATOR "#"*( left: SIZE;
  5798. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5799. BEGIN
  5800. RETURN ~(left = right);
  5801. END "#";
  5802. (** REAL *)
  5803. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5804. VAR lval, rval: REAL;
  5805. BEGIN
  5806. SYSTEM.GET( radr, rval );
  5807. WHILE (len > 0) DO
  5808. SYSTEM.GET( ladr, lval );
  5809. IF lval # rval THEN RETURN FALSE END;
  5810. INC( ladr, linc ); DEC( len );
  5811. END;
  5812. RETURN TRUE;
  5813. END EqlARSRLoop;
  5814. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5815. right: REAL ): BOOLEAN;
  5816. BEGIN
  5817. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5818. END "=";
  5819. OPERATOR "="*( left: REAL;
  5820. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5821. BEGIN
  5822. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5823. END "=";
  5824. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5825. right: REAL ): BOOLEAN;
  5826. BEGIN
  5827. RETURN ~( left = right );
  5828. END "#";
  5829. OPERATOR "#"*( left: REAL;
  5830. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5831. BEGIN
  5832. RETURN ~( left = right );
  5833. END "#";
  5834. (** LONGREAL *)
  5835. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5836. VAR lval, rval: LONGREAL;
  5837. BEGIN
  5838. SYSTEM.GET( radr, rval );
  5839. WHILE (len > 0) DO
  5840. SYSTEM.GET( ladr, lval );
  5841. IF lval # rval THEN RETURN FALSE END;
  5842. INC( ladr, linc ); DEC( len );
  5843. END;
  5844. RETURN TRUE;
  5845. END EqlAXSXLoop;
  5846. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5847. right: LONGREAL ): BOOLEAN;
  5848. BEGIN
  5849. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5850. END "=";
  5851. OPERATOR "="*( left: LONGREAL;
  5852. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5853. BEGIN
  5854. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5855. END "=";
  5856. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5857. right: LONGREAL ): BOOLEAN;
  5858. BEGIN
  5859. RETURN ~( left = right );
  5860. END "#";
  5861. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5862. BEGIN
  5863. RETURN ~( left= right );
  5864. END "#";
  5865. (*** gtr : array x scalar -> boolean ********************************************************************)
  5866. (** SHORTINT *)
  5867. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5868. VAR lval, rval: SHORTINT;
  5869. BEGIN
  5870. SYSTEM.GET( radr, rval );
  5871. WHILE (len > 0) DO
  5872. SYSTEM.GET( ladr, lval );
  5873. IF lval <= rval THEN RETURN FALSE END;
  5874. INC( ladr, linc ); DEC( len );
  5875. END;
  5876. RETURN TRUE;
  5877. END GtrASSSLoop;
  5878. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5879. BEGIN
  5880. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5881. END ">";
  5882. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5883. BEGIN
  5884. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5885. END "<";
  5886. (** INTEGER *)
  5887. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5888. VAR lval, rval: INTEGER;
  5889. BEGIN
  5890. SYSTEM.GET( radr, rval );
  5891. WHILE (len > 0) DO
  5892. SYSTEM.GET( ladr, lval );
  5893. IF lval <= rval THEN RETURN FALSE END;
  5894. INC( ladr, linc ); DEC( len );
  5895. END;
  5896. RETURN TRUE;
  5897. END GtrAISILoop;
  5898. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5899. BEGIN
  5900. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5901. END ">";
  5902. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5903. BEGIN
  5904. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5905. END "<";
  5906. (** LONGINT *)
  5907. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5908. VAR lval, rval: LONGINT;
  5909. BEGIN
  5910. SYSTEM.GET( radr, rval );
  5911. WHILE (len > 0) DO
  5912. SYSTEM.GET( ladr, lval );
  5913. IF lval <= rval THEN RETURN FALSE END;
  5914. INC( ladr, linc ); DEC( len );
  5915. END;
  5916. RETURN TRUE;
  5917. END GtrALSLLoop;
  5918. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5921. END ">";
  5922. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5925. END "<";
  5926. (** SIZE *)
  5927. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5928. VAR lval, rval: SIZE;
  5929. BEGIN
  5930. SYSTEM.GET( radr, rval );
  5931. WHILE (len > 0) DO
  5932. SYSTEM.GET( ladr, lval );
  5933. IF lval <= rval THEN RETURN FALSE END;
  5934. INC( ladr, linc ); DEC( len );
  5935. END;
  5936. RETURN TRUE;
  5937. END GtrAZSZLoop;
  5938. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  5939. BEGIN
  5940. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZSZLoop );
  5941. END ">";
  5942. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5943. BEGIN
  5944. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAZSZLoop );
  5945. END "<";
  5946. (** REAL *)
  5947. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5948. VAR lval, rval: REAL;
  5949. BEGIN
  5950. SYSTEM.GET( radr, rval );
  5951. WHILE (len > 0) DO
  5952. SYSTEM.GET( ladr, lval );
  5953. IF lval <= rval THEN RETURN FALSE END;
  5954. INC( ladr, linc ); DEC( len );
  5955. END;
  5956. RETURN TRUE;
  5957. END GtrARSRLoop;
  5958. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5959. right: REAL ): BOOLEAN;
  5960. BEGIN
  5961. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5962. END ">";
  5963. OPERATOR "<"*( left: REAL;
  5964. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5965. BEGIN
  5966. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5967. END "<";
  5968. (** LONGREAL *)
  5969. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5970. VAR lval, rval: LONGREAL;
  5971. BEGIN
  5972. SYSTEM.GET( radr, rval );
  5973. WHILE (len > 0) DO
  5974. SYSTEM.GET( ladr, lval );
  5975. IF lval <= rval THEN RETURN FALSE END;
  5976. INC( ladr, linc ); DEC( len );
  5977. END;
  5978. RETURN TRUE;
  5979. END GtrAXSXLoop;
  5980. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5981. right: LONGREAL ): BOOLEAN;
  5982. BEGIN
  5983. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5984. END ">";
  5985. OPERATOR "<"*( left: LONGREAL;
  5986. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5987. BEGIN
  5988. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5989. END "<";
  5990. (*** geq : array x scalar -> boolean ********************************************************************)
  5991. (** SHORTINT *)
  5992. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5993. VAR lval, rval: SHORTINT;
  5994. BEGIN
  5995. SYSTEM.GET( radr, rval );
  5996. WHILE (len > 0) DO
  5997. SYSTEM.GET( ladr, lval );
  5998. IF lval < rval THEN RETURN FALSE END;
  5999. INC( ladr, linc ); DEC( len );
  6000. END;
  6001. RETURN TRUE;
  6002. END GeqASSSLoop;
  6003. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6004. right: SHORTINT ): BOOLEAN;
  6005. BEGIN
  6006. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  6007. END ">=";
  6008. OPERATOR "<="*( left: SHORTINT;
  6009. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6010. BEGIN
  6011. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  6012. END "<=";
  6013. (** INTEGER *)
  6014. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6015. VAR lval, rval: INTEGER;
  6016. BEGIN
  6017. SYSTEM.GET( radr, rval );
  6018. WHILE (len > 0) DO
  6019. SYSTEM.GET( ladr, lval );
  6020. IF lval < rval THEN RETURN FALSE END;
  6021. INC( ladr, linc ); DEC( len );
  6022. END;
  6023. RETURN TRUE;
  6024. END GeqAISILoop;
  6025. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6026. BEGIN
  6027. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  6028. END ">=";
  6029. OPERATOR "<="*( left: INTEGER;
  6030. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6031. BEGIN
  6032. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  6033. END "<=";
  6034. (** LONGINT *)
  6035. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6036. VAR lval, rval: LONGINT;
  6037. BEGIN
  6038. SYSTEM.GET( radr, rval );
  6039. WHILE (len > 0) DO
  6040. SYSTEM.GET( ladr, lval );
  6041. IF lval < rval THEN RETURN FALSE END;
  6042. INC( ladr, linc ); DEC( len );
  6043. END;
  6044. RETURN TRUE;
  6045. END GeqALSLLoop;
  6046. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6047. right: LONGINT ): BOOLEAN;
  6048. BEGIN
  6049. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  6050. END ">=";
  6051. OPERATOR "<="*( left: LONGINT;
  6052. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6053. BEGIN
  6054. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  6055. END "<=";
  6056. (** SIZE *)
  6057. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6058. VAR lval, rval: SIZE;
  6059. BEGIN
  6060. SYSTEM.GET( radr, rval );
  6061. WHILE (len > 0) DO
  6062. SYSTEM.GET( ladr, lval );
  6063. IF lval < rval THEN RETURN FALSE END;
  6064. INC( ladr, linc ); DEC( len );
  6065. END;
  6066. RETURN TRUE;
  6067. END GeqAZSZLoop;
  6068. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6069. right: SIZE ): BOOLEAN;
  6070. BEGIN
  6071. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZSZLoop );
  6072. END ">=";
  6073. OPERATOR "<="*( left:SIZE;
  6074. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6075. BEGIN
  6076. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAZSZLoop );
  6077. END "<=";
  6078. (** REAL *)
  6079. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6080. VAR lval, rval: REAL;
  6081. BEGIN
  6082. SYSTEM.GET( radr, rval );
  6083. WHILE (len > 0) DO
  6084. SYSTEM.GET( ladr, lval );
  6085. IF lval < rval THEN RETURN FALSE END;
  6086. INC( ladr, linc ); DEC( len );
  6087. END;
  6088. RETURN TRUE;
  6089. END GeqARSRLoop;
  6090. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6091. right: REAL ): BOOLEAN;
  6092. BEGIN
  6093. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  6094. END ">=";
  6095. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6096. BEGIN
  6097. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  6098. END "<=";
  6099. (** LONGREAL *)
  6100. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6101. VAR lval, rval: LONGREAL;
  6102. BEGIN
  6103. SYSTEM.GET( radr, rval );
  6104. WHILE (len > 0) DO
  6105. SYSTEM.GET( ladr, lval );
  6106. IF lval < rval THEN RETURN FALSE END;
  6107. INC( ladr, linc ); DEC( len );
  6108. END;
  6109. RETURN TRUE;
  6110. END GeqAXSXLoop;
  6111. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6112. BEGIN
  6113. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  6114. END ">=";
  6115. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6116. BEGIN
  6117. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  6118. END "<=";
  6119. (*** leq : array x scalar -> boolean ********************************************************************)
  6120. (** SHORTINT *)
  6121. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6122. VAR lval, rval: SHORTINT;
  6123. BEGIN
  6124. SYSTEM.GET( radr, rval );
  6125. WHILE (len > 0) DO
  6126. SYSTEM.GET( ladr, lval );
  6127. IF lval > rval THEN RETURN FALSE END;
  6128. INC( ladr, linc ); DEC( len );
  6129. END;
  6130. RETURN TRUE;
  6131. END LeqASSSLoop;
  6132. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6133. BEGIN
  6134. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6135. END "<=";
  6136. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6137. BEGIN
  6138. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6139. END ">=";
  6140. (** INTEGER *)
  6141. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6142. VAR lval, rval: INTEGER;
  6143. BEGIN
  6144. SYSTEM.GET( radr, rval );
  6145. WHILE (len > 0) DO
  6146. SYSTEM.GET( ladr, lval );
  6147. IF lval > rval THEN RETURN FALSE END;
  6148. INC( ladr, linc ); DEC( len );
  6149. END;
  6150. RETURN TRUE;
  6151. END LeqAISILoop;
  6152. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6153. BEGIN
  6154. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6155. END "<=";
  6156. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6157. BEGIN
  6158. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6159. END ">=";
  6160. (** LONGINT *)
  6161. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6162. VAR lval, rval: LONGINT;
  6163. BEGIN
  6164. SYSTEM.GET( radr, rval );
  6165. WHILE (len > 0) DO
  6166. SYSTEM.GET( ladr, lval );
  6167. IF lval > rval THEN RETURN FALSE END;
  6168. INC( ladr, linc ); DEC( len );
  6169. END;
  6170. RETURN TRUE;
  6171. END LeqALSLLoop;
  6172. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6173. BEGIN
  6174. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6175. END "<=";
  6176. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6177. BEGIN
  6178. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6179. END ">=";
  6180. (** SIZE *)
  6181. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6182. VAR lval, rval: SIZE;
  6183. BEGIN
  6184. SYSTEM.GET( radr, rval );
  6185. WHILE (len > 0) DO
  6186. SYSTEM.GET( ladr, lval );
  6187. IF lval > rval THEN RETURN FALSE END;
  6188. INC( ladr, linc ); DEC( len );
  6189. END;
  6190. RETURN TRUE;
  6191. END LeqAZSZLoop;
  6192. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6193. BEGIN
  6194. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZSZLoop );
  6195. END "<=";
  6196. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6197. BEGIN
  6198. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAZSZLoop );
  6199. END ">=";
  6200. (** REAL *)
  6201. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6202. VAR lval, rval: REAL;
  6203. BEGIN
  6204. SYSTEM.GET( radr, rval );
  6205. WHILE (len > 0) DO
  6206. SYSTEM.GET( ladr, lval );
  6207. IF lval > rval THEN RETURN FALSE END;
  6208. INC( ladr, linc ); DEC( len );
  6209. END;
  6210. RETURN TRUE;
  6211. END LeqARSRLoop;
  6212. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6213. BEGIN
  6214. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6215. END "<=";
  6216. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6217. BEGIN
  6218. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6219. END ">=";
  6220. (** LONGREAL *)
  6221. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6222. VAR lval, rval: LONGREAL;
  6223. BEGIN
  6224. SYSTEM.GET( radr, rval );
  6225. WHILE (len > 0) DO
  6226. SYSTEM.GET( ladr, lval );
  6227. IF lval > rval THEN RETURN FALSE END;
  6228. INC( ladr, linc ); DEC( len );
  6229. END;
  6230. RETURN TRUE;
  6231. END LeqAXSXLoop;
  6232. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6233. BEGIN
  6234. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6235. END "<=";
  6236. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6237. BEGIN
  6238. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6239. END ">=";
  6240. (*** lss: array x scalar -> boolean ********************************************************************)
  6241. (** SHORTINT *)
  6242. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6243. VAR lval, rval: SHORTINT;
  6244. BEGIN
  6245. SYSTEM.GET( radr, rval );
  6246. WHILE (len > 0) DO
  6247. SYSTEM.GET( ladr, lval );
  6248. IF lval >= rval THEN RETURN FALSE END;
  6249. INC( ladr, linc ); DEC( len );
  6250. END;
  6251. RETURN TRUE;
  6252. END LssASSSLoop;
  6253. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6254. BEGIN
  6255. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6256. END "<";
  6257. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6258. BEGIN
  6259. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6260. END ">";
  6261. (** INTEGER *)
  6262. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6263. VAR lval, rval: INTEGER;
  6264. BEGIN
  6265. SYSTEM.GET( radr, rval );
  6266. WHILE (len > 0) DO
  6267. SYSTEM.GET( ladr, lval );
  6268. IF lval >= rval THEN RETURN FALSE END;
  6269. INC( ladr, linc ); DEC( len );
  6270. END;
  6271. RETURN TRUE;
  6272. END LssAISILoop;
  6273. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6274. BEGIN
  6275. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6276. END "<";
  6277. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6278. BEGIN
  6279. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6280. END ">";
  6281. (** LONGINT *)
  6282. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6283. VAR lval, rval: LONGINT;
  6284. BEGIN
  6285. SYSTEM.GET( radr, rval );
  6286. WHILE (len > 0) DO
  6287. SYSTEM.GET( ladr, lval );
  6288. IF lval >= rval THEN RETURN FALSE END;
  6289. INC( ladr, linc ); DEC( len );
  6290. END;
  6291. RETURN TRUE;
  6292. END LssALSLLoop;
  6293. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6294. BEGIN
  6295. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6296. END "<";
  6297. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6298. BEGIN
  6299. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6300. END ">";
  6301. (** SIZE *)
  6302. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6303. VAR lval, rval: SIZE;
  6304. BEGIN
  6305. SYSTEM.GET( radr, rval );
  6306. WHILE (len > 0) DO
  6307. SYSTEM.GET( ladr, lval );
  6308. IF lval >= rval THEN RETURN FALSE END;
  6309. INC( ladr, linc ); DEC( len );
  6310. END;
  6311. RETURN TRUE;
  6312. END LssAZSZLoop;
  6313. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6314. BEGIN
  6315. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZSZLoop );
  6316. END "<";
  6317. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6318. BEGIN
  6319. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAZSZLoop );
  6320. END ">";
  6321. (** REAL *)
  6322. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6323. VAR lval, rval: REAL;
  6324. BEGIN
  6325. SYSTEM.GET( radr, rval );
  6326. WHILE (len > 0) DO
  6327. SYSTEM.GET( ladr, lval );
  6328. IF lval >= rval THEN RETURN FALSE END;
  6329. INC( ladr, linc ); DEC( len );
  6330. END;
  6331. RETURN TRUE;
  6332. END LssARSRLoop;
  6333. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6334. right: REAL ): BOOLEAN;
  6335. BEGIN
  6336. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6337. END "<";
  6338. OPERATOR ">"*( left: REAL;
  6339. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6340. BEGIN
  6341. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6342. END ">";
  6343. (** LONGREAL *)
  6344. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6345. VAR lval, rval: LONGREAL;
  6346. BEGIN
  6347. SYSTEM.GET( radr, rval );
  6348. WHILE (len > 0) DO
  6349. SYSTEM.GET( ladr, lval );
  6350. IF lval >= rval THEN RETURN FALSE END;
  6351. INC( ladr, linc ); DEC( len );
  6352. END;
  6353. RETURN TRUE;
  6354. END LssAXSXLoop;
  6355. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6356. right: LONGREAL ): BOOLEAN;
  6357. BEGIN
  6358. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6359. END "<";
  6360. OPERATOR ">"*( left: LONGREAL;
  6361. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6362. BEGIN
  6363. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6364. END ">";
  6365. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6366. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6367. VAR lval, val: LONGREAL;
  6368. BEGIN
  6369. SYSTEM.GET( radr, val );
  6370. WHILE (len > 0) DO
  6371. SYSTEM.GET( ladr, lval );
  6372. INC( ladr, linc ); DEC( len );
  6373. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6374. INC(dadr,dinc);
  6375. END;
  6376. END MaxAXSXLoop;
  6377. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6378. TYPE Type = LONGREAL;
  6379. BEGIN
  6380. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6381. RETURN RESULT
  6382. END "MAX";
  6383. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6384. VAR lval, val: REAL;
  6385. BEGIN
  6386. SYSTEM.GET( radr, val );
  6387. WHILE (len > 0) DO
  6388. SYSTEM.GET( ladr, lval );
  6389. INC( ladr, linc ); DEC( len );
  6390. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6391. INC(dadr,dinc);
  6392. END;
  6393. END MaxARSRLoop;
  6394. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6395. TYPE Type = REAL;
  6396. BEGIN
  6397. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6398. RETURN RESULT
  6399. END "MAX";
  6400. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6401. VAR lval, val: LONGINT;
  6402. BEGIN
  6403. SYSTEM.GET( radr, val );
  6404. WHILE (len > 0) DO
  6405. SYSTEM.GET( ladr, lval );
  6406. INC( ladr, linc ); DEC( len );
  6407. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6408. INC(dadr,dinc);
  6409. END;
  6410. END MaxALSLLoop;
  6411. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6412. TYPE Type = LONGINT;
  6413. BEGIN
  6414. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6415. RETURN RESULT
  6416. END "MAX";
  6417. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6418. VAR lval, val: INTEGER;
  6419. BEGIN
  6420. SYSTEM.GET( radr, val );
  6421. WHILE (len > 0) DO
  6422. SYSTEM.GET( ladr, lval );
  6423. INC( ladr, linc ); DEC( len );
  6424. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6425. INC(dadr,dinc);
  6426. END;
  6427. END MaxAISILoop;
  6428. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6429. TYPE Type = INTEGER;
  6430. BEGIN
  6431. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6432. RETURN RESULT
  6433. END "MAX";
  6434. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6435. VAR lval, val: SHORTINT;
  6436. BEGIN
  6437. SYSTEM.GET( radr, val );
  6438. WHILE (len > 0) DO
  6439. SYSTEM.GET( ladr, lval );
  6440. INC( ladr, linc ); DEC( len );
  6441. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6442. INC(dadr,dinc);
  6443. END;
  6444. END MaxASSSLoop;
  6445. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6446. TYPE Type = SHORTINT;
  6447. BEGIN
  6448. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6449. RETURN RESULT
  6450. END "MAX";
  6451. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6452. VAR lval, val: LONGREAL;
  6453. BEGIN
  6454. SYSTEM.GET( radr, val );
  6455. WHILE (len > 0) DO
  6456. SYSTEM.GET( ladr, lval );
  6457. INC( ladr, linc ); DEC( len );
  6458. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6459. INC(dadr,dinc);
  6460. END;
  6461. END MinAXSXLoop;
  6462. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6463. TYPE Type = LONGREAL;
  6464. BEGIN
  6465. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6466. RETURN RESULT
  6467. END "MIN";
  6468. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6469. VAR lval, val: REAL;
  6470. BEGIN
  6471. SYSTEM.GET( radr, val );
  6472. WHILE (len > 0) DO
  6473. SYSTEM.GET( ladr, lval );
  6474. INC( ladr, linc ); DEC( len );
  6475. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6476. INC(dadr,dinc);
  6477. END;
  6478. END MinARSRLoop;
  6479. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6480. TYPE Type = REAL;
  6481. BEGIN
  6482. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6483. RETURN RESULT
  6484. END "MIN";
  6485. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6486. VAR lval, val: LONGINT;
  6487. BEGIN
  6488. SYSTEM.GET( radr, val );
  6489. WHILE (len > 0) DO
  6490. SYSTEM.GET( ladr, lval );
  6491. INC( ladr, linc ); DEC( len );
  6492. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6493. INC(dadr,dinc);
  6494. END;
  6495. END MinALSLLoop;
  6496. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6497. TYPE Type = LONGINT;
  6498. BEGIN
  6499. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6500. RETURN RESULT
  6501. END "MIN";
  6502. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6503. VAR lval, val: INTEGER;
  6504. BEGIN
  6505. SYSTEM.GET( radr, val );
  6506. WHILE (len > 0) DO
  6507. SYSTEM.GET( ladr, lval );
  6508. INC( ladr, linc ); DEC( len );
  6509. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6510. INC(dadr,dinc);
  6511. END;
  6512. END MinAISILoop;
  6513. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6514. TYPE Type = INTEGER;
  6515. BEGIN
  6516. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6517. RETURN RESULT
  6518. END "MIN";
  6519. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6520. VAR lval, val: SHORTINT;
  6521. BEGIN
  6522. SYSTEM.GET( radr, val );
  6523. WHILE (len > 0) DO
  6524. SYSTEM.GET( ladr, lval );
  6525. INC( ladr, linc ); DEC( len );
  6526. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6527. INC(dadr,dinc);
  6528. END;
  6529. END MinASSSLoop;
  6530. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6531. TYPE Type = SHORTINT;
  6532. BEGIN
  6533. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6534. RETURN RESULT
  6535. END "MIN";
  6536. (**** binary max/min operators array x array -> array ********************************************************************)
  6537. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6538. VAR lval, rval: LONGREAL;
  6539. BEGIN
  6540. WHILE (len > 0) DO
  6541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6542. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6543. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6544. INC(dadr,dinc);
  6545. END;
  6546. END MaxAXAXLoop;
  6547. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6548. BEGIN
  6549. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6550. RETURN RESULT
  6551. END "MAX";
  6552. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6553. VAR lval, rval: REAL ;
  6554. BEGIN
  6555. WHILE (len > 0) DO
  6556. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6557. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6558. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6559. INC(dadr,dinc);
  6560. END;
  6561. END MaxARARLoop;
  6562. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6563. BEGIN
  6564. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6565. RETURN RESULT
  6566. END "MAX";
  6567. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6568. VAR lval, rval: LONGINT;
  6569. BEGIN
  6570. WHILE (len > 0) DO
  6571. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6572. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6573. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6574. INC(dadr,dinc);
  6575. END;
  6576. END MaxALALLoop;
  6577. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6578. BEGIN
  6579. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6580. RETURN RESULT
  6581. END "MAX";
  6582. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6583. VAR lval, rval: INTEGER;
  6584. BEGIN
  6585. WHILE (len > 0) DO
  6586. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6587. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6588. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6589. INC(dadr,dinc);
  6590. END;
  6591. END MaxAIAILoop;
  6592. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6593. BEGIN
  6594. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6595. RETURN RESULT
  6596. END "MAX";
  6597. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6598. VAR lval, rval: SHORTINT;
  6599. BEGIN
  6600. WHILE (len > 0) DO
  6601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6602. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6603. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6604. INC(dadr,dinc);
  6605. END;
  6606. END MaxASASLoop;
  6607. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6608. BEGIN
  6609. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6610. RETURN RESULT
  6611. END "MAX";
  6612. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6613. VAR lval, rval: LONGREAL;
  6614. BEGIN
  6615. WHILE (len > 0) DO
  6616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6617. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6618. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6619. INC(dadr,dinc);
  6620. END;
  6621. END MinAXAXLoop;
  6622. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6623. BEGIN
  6624. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6625. RETURN RESULT
  6626. END "MIN";
  6627. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6628. VAR lval, rval: REAL ;
  6629. BEGIN
  6630. WHILE (len > 0) DO
  6631. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6632. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6633. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6634. INC(dadr,dinc);
  6635. END;
  6636. END MinARARLoop;
  6637. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6638. BEGIN
  6639. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6640. RETURN RESULT
  6641. END "MIN";
  6642. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6643. VAR lval, rval: LONGINT;
  6644. BEGIN
  6645. WHILE (len > 0) DO
  6646. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6647. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6648. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6649. INC(dadr,dinc);
  6650. END;
  6651. END MinALALLoop;
  6652. *)
  6653. TYPE
  6654. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6655. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6656. BEGIN
  6657. WHILE (len > 0) DO
  6658. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6659. ladr := ladr + linc;
  6660. radr := radr + rinc;
  6661. dadr := dadr + dinc;
  6662. DEC(len);
  6663. END;
  6664. END MinALALLoop;
  6665. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6666. BEGIN
  6667. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6668. RETURN RESULT
  6669. END "MIN";
  6670. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6671. VAR lval, rval: INTEGER;
  6672. BEGIN
  6673. WHILE (len > 0) DO
  6674. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6675. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6676. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6677. INC(dadr,dinc);
  6678. END;
  6679. END MinAIAILoop;
  6680. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6681. BEGIN
  6682. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6683. RETURN RESULT
  6684. END "MIN";
  6685. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6686. VAR lval, rval: SHORTINT;
  6687. BEGIN
  6688. WHILE (len > 0) DO
  6689. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6690. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6691. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6692. INC(dadr,dinc);
  6693. END;
  6694. END MinASASLoop;
  6695. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6696. BEGIN
  6697. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6698. RETURN RESULT
  6699. END "MIN";
  6700. (**** unary operators array -> scalar ********************************************************************)
  6701. (*** min: array -> scalar ****************************************)
  6702. (** SHORTINT *)
  6703. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6704. VAR lval, dval: SHORTINT;
  6705. BEGIN
  6706. SYSTEM.GET( dadr, dval );
  6707. WHILE (len > 0) DO
  6708. SYSTEM.GET( ladr, lval );
  6709. IF lval < dval THEN dval := lval END;
  6710. INC( ladr, linc ); DEC( len );
  6711. END;
  6712. SYSTEM.PUT( dadr, dval );
  6713. END MinASLoop;
  6714. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6715. TYPE Type = SHORTINT;
  6716. VAR val: Type;
  6717. BEGIN
  6718. val := MAX( Type );
  6719. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6720. END "MIN";
  6721. (** INTEGER *)
  6722. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6723. VAR lval, dval: INTEGER;
  6724. BEGIN
  6725. SYSTEM.GET( dadr, dval );
  6726. WHILE (len > 0) DO
  6727. SYSTEM.GET( ladr, lval );
  6728. IF lval < dval THEN dval := lval END;
  6729. INC( ladr, linc ); DEC( len );
  6730. END;
  6731. SYSTEM.PUT( dadr, dval );
  6732. END MinAILoop;
  6733. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6734. TYPE Type = INTEGER;
  6735. VAR val: Type;
  6736. BEGIN
  6737. val := MAX( Type );
  6738. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6739. END "MIN";
  6740. (** LONGINT *)
  6741. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6742. VAR lval, dval: LONGINT;
  6743. BEGIN
  6744. SYSTEM.GET( dadr, dval );
  6745. WHILE (len > 0) DO
  6746. SYSTEM.GET( ladr, lval );
  6747. IF lval < dval THEN dval := lval END;
  6748. INC( ladr, linc ); DEC( len );
  6749. END;
  6750. SYSTEM.PUT( dadr, dval );
  6751. END MinALLoop;
  6752. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6753. TYPE Type = LONGINT;
  6754. VAR val: Type;
  6755. BEGIN
  6756. val := MAX( Type );
  6757. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6758. END "MIN";
  6759. (** SIZE *)
  6760. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6761. VAR lval, dval: SIZE;
  6762. BEGIN
  6763. SYSTEM.GET( dadr, dval );
  6764. WHILE (len > 0) DO
  6765. SYSTEM.GET( ladr, lval );
  6766. IF lval < dval THEN dval := lval END;
  6767. INC( ladr, linc ); DEC( len );
  6768. END;
  6769. SYSTEM.PUT( dadr, dval );
  6770. END MinAZLoop;
  6771. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6772. TYPE Type = SIZE;
  6773. VAR val: Type;
  6774. BEGIN
  6775. val := MAX( Type );
  6776. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAZLoop ); RETURN val;
  6777. END "MIN";
  6778. (** REAL *)
  6779. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6780. VAR lval, dval: REAL;
  6781. BEGIN
  6782. SYSTEM.GET( dadr, dval );
  6783. WHILE (len > 0) DO
  6784. SYSTEM.GET( ladr, lval );
  6785. IF lval < dval THEN dval := lval END;
  6786. INC( ladr, linc ); DEC( len );
  6787. END;
  6788. SYSTEM.PUT( dadr, dval );
  6789. END MinARLoop;
  6790. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6791. TYPE Type = REAL;
  6792. VAR val: Type;
  6793. BEGIN
  6794. val := MAX( Type );
  6795. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6796. END "MIN";
  6797. (** LONGREAL *)
  6798. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6799. VAR lval, dval: LONGREAL;
  6800. BEGIN
  6801. SYSTEM.GET( dadr, dval );
  6802. WHILE (len > 0) DO
  6803. SYSTEM.GET( ladr, lval );
  6804. IF lval < dval THEN dval := lval END;
  6805. INC( ladr, linc ); DEC( len );
  6806. END;
  6807. SYSTEM.PUT( dadr, dval );
  6808. END MinAXLoop;
  6809. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6810. TYPE Type = LONGREAL;
  6811. VAR val: Type;
  6812. BEGIN
  6813. val := MAX( Type );
  6814. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6815. END "MIN";
  6816. (*** max: array -> scalar ********************************************************************)
  6817. (** SHORTINT *)
  6818. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6819. VAR lval, dval: SHORTINT;
  6820. BEGIN
  6821. SYSTEM.GET( dadr, dval );
  6822. WHILE (len > 0) DO
  6823. SYSTEM.GET( ladr, lval );
  6824. IF lval > dval THEN dval := lval END;
  6825. INC( ladr, linc ); DEC( len );
  6826. END;
  6827. SYSTEM.PUT( dadr, dval );
  6828. END MaxASLoop;
  6829. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6830. TYPE Type = SHORTINT;
  6831. VAR val: Type;
  6832. BEGIN
  6833. val := MIN( Type );
  6834. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6835. END "MAX";
  6836. (** INTEGER *)
  6837. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6838. VAR lval, dval: INTEGER;
  6839. BEGIN
  6840. SYSTEM.GET( dadr, dval );
  6841. WHILE (len > 0) DO
  6842. SYSTEM.GET( ladr, lval );
  6843. IF lval > dval THEN dval := lval END;
  6844. INC( ladr, linc ); DEC( len );
  6845. END;
  6846. SYSTEM.PUT( dadr, dval );
  6847. END MaxAILoop;
  6848. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6849. TYPE Type = INTEGER;
  6850. VAR val: Type;
  6851. BEGIN
  6852. val := MIN( Type );
  6853. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6854. END "MAX";
  6855. (** LONGINT *)
  6856. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6857. VAR lval, dval: LONGINT;
  6858. BEGIN
  6859. SYSTEM.GET( dadr, dval );
  6860. WHILE (len > 0) DO
  6861. SYSTEM.GET( ladr, lval );
  6862. IF lval > dval THEN dval := lval END;
  6863. INC( ladr, linc ); DEC( len );
  6864. END;
  6865. SYSTEM.PUT( dadr, dval );
  6866. END MaxALLoop;
  6867. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6868. TYPE Type = LONGINT;
  6869. VAR val: Type;
  6870. BEGIN
  6871. val := MIN( Type );
  6872. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6873. END "MAX";
  6874. (** REAL *)
  6875. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6876. VAR lval, dval: REAL;
  6877. BEGIN
  6878. SYSTEM.GET( dadr, dval );
  6879. WHILE (len > 0) DO
  6880. SYSTEM.GET( ladr, lval );
  6881. IF lval > dval THEN dval := lval END;
  6882. INC( ladr, linc ); DEC( len );
  6883. END;
  6884. SYSTEM.PUT( dadr, dval );
  6885. END MaxARLoop;
  6886. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6887. TYPE Type = REAL;
  6888. VAR val: Type;
  6889. BEGIN
  6890. val := MIN( Type );
  6891. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6892. END "MAX";
  6893. (** LONGREAL *)
  6894. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6895. VAR lval, dval: LONGREAL;
  6896. BEGIN
  6897. SYSTEM.GET( dadr, dval );
  6898. WHILE (len > 0) DO
  6899. SYSTEM.GET( ladr, lval );
  6900. IF lval > dval THEN dval := lval END;
  6901. INC( ladr, linc ); DEC( len );
  6902. END;
  6903. SYSTEM.PUT( dadr, dval );
  6904. END MaxAXLoop;
  6905. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6906. TYPE Type = LONGREAL;
  6907. VAR val: Type;
  6908. BEGIN
  6909. val := MIN( Type );
  6910. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6911. END "MAX";
  6912. (*** LEN: array -> array **)
  6913. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LenType;
  6914. VAR src: ADDRESS; dim,i: SIZE;
  6915. BEGIN
  6916. src := SYSTEM.VAL(ADDRESS,left);
  6917. dim := GetDim( src );
  6918. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6919. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(src,i)) END;
  6920. RETURN RESULT
  6921. END "LEN";
  6922. (*** SUM: array -> scalar ********************************************************************)
  6923. (** SHORTINT *)
  6924. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6925. VAR lval, dval: SHORTINT;
  6926. BEGIN
  6927. SYSTEM.GET( dadr, dval );
  6928. WHILE (len > 0) DO
  6929. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6930. END;
  6931. SYSTEM.PUT( dadr, dval );
  6932. END SumASLoop;
  6933. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6934. TYPE Type = SHORTINT;
  6935. VAR val: Type;
  6936. BEGIN
  6937. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6938. RETURN val;
  6939. END "SUM";
  6940. (** INTEGER *)
  6941. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6942. VAR lval, dval: INTEGER;
  6943. BEGIN
  6944. SYSTEM.GET( dadr, dval );
  6945. WHILE (len > 0) DO
  6946. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6947. END;
  6948. SYSTEM.PUT( dadr, dval );
  6949. END SumAILoop;
  6950. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6951. TYPE Type = INTEGER;
  6952. VAR val: Type;
  6953. BEGIN
  6954. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6955. RETURN val;
  6956. END "SUM";
  6957. (** LONGINT *)
  6958. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6959. VAR lval, dval: LONGINT;
  6960. BEGIN
  6961. SYSTEM.GET( dadr, dval );
  6962. WHILE (len > 0) DO
  6963. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6964. END;
  6965. SYSTEM.PUT( dadr, dval );
  6966. END SumALLoop;
  6967. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6968. TYPE Type = LONGINT;
  6969. VAR val: Type;
  6970. BEGIN
  6971. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6972. RETURN val;
  6973. END "SUM";
  6974. (** REAL *)
  6975. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6976. VAR lval, dval: REAL;
  6977. BEGIN
  6978. SYSTEM.GET( dadr, dval );
  6979. WHILE (len > 0) DO
  6980. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6981. END;
  6982. SYSTEM.PUT( dadr, dval );
  6983. END SumARLoop;
  6984. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6985. TYPE Type = REAL;
  6986. VAR val: Type;
  6987. BEGIN
  6988. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6989. RETURN val;
  6990. END "SUM";
  6991. (** LONGREAL *)
  6992. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6993. VAR lval, dval: LONGREAL;
  6994. BEGIN
  6995. SYSTEM.GET( dadr, dval );
  6996. WHILE (len > 0) DO
  6997. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6998. END;
  6999. SYSTEM.PUT( dadr, dval );
  7000. END SumAXLoop;
  7001. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7002. TYPE Type = LONGREAL;
  7003. VAR val: Type;
  7004. BEGIN
  7005. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  7006. RETURN val;
  7007. END "SUM";
  7008. (** COMPLEX *)
  7009. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7010. VAR lval, dval: COMPLEX;
  7011. BEGIN
  7012. SYSTEM.GET( dadr, dval );
  7013. WHILE (len > 0) DO
  7014. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7015. END;
  7016. SYSTEM.PUT( dadr, dval );
  7017. END SumAZLoop;
  7018. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7019. TYPE Type = COMPLEX;
  7020. VAR val: Type;
  7021. BEGIN
  7022. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  7023. RETURN val;
  7024. END "SUM";
  7025. (** LONGCOMPLEX *)
  7026. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7027. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7028. BEGIN
  7029. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7030. WHILE (len > 0) DO
  7031. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7032. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7033. INC( ladr, linc ); DEC( len );
  7034. END;
  7035. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7036. END SumALZLoop;
  7037. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7038. TYPE Type = LONGCOMPLEX;
  7039. VAR val: Type;
  7040. BEGIN
  7041. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  7042. RETURN val;
  7043. END "SUM";
  7044. (*** monadic ABS array -> array ********************************************************************)
  7045. (** SHORTINT *)
  7046. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7047. VAR lval: SHORTINT;
  7048. BEGIN
  7049. WHILE (len > 0) DO
  7050. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7051. INC( dadr, dinc ); DEC( len );
  7052. END;
  7053. END AbsLoopS;
  7054. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  7055. BEGIN
  7056. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  7057. RETURN RESULT
  7058. END "ABS";
  7059. (** INTEGER *)
  7060. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7061. VAR lval: INTEGER;
  7062. BEGIN
  7063. WHILE (len > 0) DO
  7064. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7065. INC( dadr, dinc ); DEC( len );
  7066. END;
  7067. END AbsLoopI;
  7068. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  7069. BEGIN
  7070. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  7071. RETURN RESULT
  7072. END "ABS";
  7073. (** LONGINT *)
  7074. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7075. VAR lval: LONGINT;
  7076. BEGIN
  7077. WHILE (len > 0) DO
  7078. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7079. INC( dadr, dinc ); DEC( len );
  7080. END;
  7081. END AbsLoopL;
  7082. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  7083. BEGIN
  7084. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  7085. RETURN RESULT
  7086. END "ABS";
  7087. (** REAL *)
  7088. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7089. VAR lval: REAL;
  7090. BEGIN
  7091. WHILE (len > 0) DO
  7092. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7093. INC( dadr, dinc ); DEC( len );
  7094. END;
  7095. END AbsLoopR;
  7096. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  7097. BEGIN
  7098. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  7099. RETURN RESULT
  7100. END "ABS";
  7101. (** LONGREAL *)
  7102. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7103. VAR lval: LONGREAL;
  7104. BEGIN
  7105. WHILE (len > 0) DO
  7106. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7107. INC( dadr, dinc ); DEC( len );
  7108. END;
  7109. END AbsLoopX;
  7110. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  7111. BEGIN
  7112. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  7113. RETURN RESULT
  7114. END "ABS";
  7115. (** COMPLEX *)
  7116. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7117. VAR lval: COMPLEX;
  7118. BEGIN
  7119. WHILE (len > 0) DO
  7120. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7121. INC( dadr, dinc ); DEC( len );
  7122. END;
  7123. END AbsLoopZ;
  7124. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  7125. BEGIN
  7126. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  7127. RETURN RESULT
  7128. END "ABS";
  7129. (** LONGCOMPLEX *)
  7130. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7131. VAR lvalRe, lvalIm: LONGREAL;
  7132. BEGIN
  7133. WHILE (len > 0) DO
  7134. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7135. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7136. INC( ladr, linc );
  7137. INC( dadr, dinc ); DEC( len );
  7138. END;
  7139. END AbsLoopLZ;
  7140. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  7141. BEGIN
  7142. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  7143. RETURN RESULT
  7144. END "ABS";
  7145. (*** assign number to array (initialisation) ********************************************************************)
  7146. (** BOOLEAN *)
  7147. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7148. VAR lval: BOOLEAN;
  7149. BEGIN
  7150. SYSTEM.GET( ladr, lval );
  7151. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7152. END AssignSBABLoop;
  7153. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  7154. BEGIN
  7155. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  7156. END ":=";
  7157. (** SHORTINT*)
  7158. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7159. VAR lval: SHORTINT;
  7160. BEGIN
  7161. SYSTEM.GET( ladr, lval );
  7162. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7163. END AssignSSASLoop;
  7164. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  7165. BEGIN
  7166. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  7167. END ":=";
  7168. (**INTEGER *)
  7169. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7170. VAR lval: INTEGER;
  7171. BEGIN
  7172. SYSTEM.GET( ladr, lval );
  7173. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7174. END AssignSIAILoop;
  7175. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  7176. BEGIN
  7177. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  7178. END ":=";
  7179. (** LONGINT *)
  7180. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7181. VAR lval: LONGINT;
  7182. BEGIN
  7183. SYSTEM.GET( ladr, lval );
  7184. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7185. END AssignSLALLoop;
  7186. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  7187. BEGIN
  7188. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  7189. END ":=";
  7190. (** REAL *)
  7191. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7192. VAR lval: REAL;
  7193. BEGIN
  7194. SYSTEM.GET( ladr, lval );
  7195. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7196. END AssignSRARLoop;
  7197. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  7198. BEGIN
  7199. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  7200. END ":=";
  7201. (** LONGREAL *)
  7202. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7203. VAR lval: LONGREAL;
  7204. BEGIN
  7205. SYSTEM.GET( ladr, lval );
  7206. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7207. END AssignSXAXLoop;
  7208. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7209. BEGIN
  7210. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7211. END ":=";
  7212. (** COMPLEX *)
  7213. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7214. VAR lval: COMPLEX;
  7215. BEGIN
  7216. SYSTEM.GET( ladr, lval );
  7217. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7218. END AssignSZAZLoop;
  7219. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7220. BEGIN
  7221. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7222. END ":=";
  7223. (** LONGCOMPLEX *)
  7224. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7225. VAR lvalRe, lvalIm: LONGREAL;
  7226. BEGIN
  7227. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7228. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7229. END AssignSLZALZLoop;
  7230. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7231. BEGIN
  7232. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7233. END ":=";
  7234. (*** matrix multipliation ********************************************************************)
  7235. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7236. rows, cols, elementsize: SIZE ): ANY;
  7237. VAR p: ANY;
  7238. BEGIN
  7239. (*
  7240. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7241. *)
  7242. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7243. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7244. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7245. PutPtr( dest, p); RETURN p;
  7246. END AllocateMatrix;
  7247. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7248. VAR p: ANY;
  7249. BEGIN
  7250. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7251. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7252. PutPtr( dest, p ); RETURN p;
  7253. END AllocateVector;
  7254. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7255. loop: BinaryAASLoop;
  7256. fast: FastMatMul ); (* Size= element-size *)
  7257. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7258. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7259. BEGIN
  7260. (*
  7261. <- 1 ->
  7262. xxx xxxx -> xxxx
  7263. ^ xxx xxxx xxxx
  7264. 0 xxx xxxx xxxx
  7265. v xxx xxxx
  7266. xxx xxxx
  7267. Len(..,1): #columns ; Inc(..,1): inc in rows
  7268. Len(..,0): #rows ; Inc(..,0): inc between rows
  7269. *)
  7270. (* apply multiplication D = L * R *)
  7271. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7272. colsL := GetLen( left, 1 ); (* # left columns *)
  7273. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7274. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7275. (* check geometric restriction *)
  7276. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7277. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7278. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7279. IF RangeFlag IN GetFlags( dest ) THEN
  7280. Halt( GeometryMismatch, left, right, dest )
  7281. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7282. END;
  7283. END;
  7284. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7285. IF overlap THEN
  7286. destOld := dest; destNew := 0;
  7287. p := AllocateSame( destNew, destOld, Size );
  7288. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7289. dest := destNew;
  7290. END;
  7291. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7292. HALT( 9999 )
  7293. END;
  7294. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7295. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7296. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7297. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7298. (*
  7299. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7300. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7301. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7302. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7303. *)
  7304. IF rowsL = 0 THEN RETURN
  7305. ELSIF colsL=0 THEN RETURN
  7306. ELSIF colsR=0 THEN RETURN
  7307. ELSIF (fast = NIL ) OR
  7308. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7309. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7310. radri := radr; dadri := dadr; colsRi := colsR;
  7311. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7312. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7313. INC( dadri, incD ); DEC( colsRi );
  7314. END;
  7315. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7316. END;
  7317. END;
  7318. IF overlap THEN CopyContent( destOld, dest, Size );
  7319. END;
  7320. END ApplyMatMulLoop;
  7321. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7322. Size: SIZE; loop: BinaryAASLoop;
  7323. fast: FastMatMul ); (* Size= element-size *)
  7324. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7325. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7326. BEGIN
  7327. (*
  7328. <- 0 ->
  7329. xxx T(xxx) -> T(xxxxx)
  7330. xxx
  7331. 1 xxx
  7332. xxx
  7333. xxx
  7334. Len(..,0): #columns ; Inc(..,0): inc in rows
  7335. Len(..,1): #rows ; Inc(..,1): inc between rows
  7336. *)
  7337. (* check geometric restriction *)
  7338. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7339. Halt( GeometryMismatch, left, right,0 );
  7340. END;
  7341. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7342. l2 := GetLen( left, 1 ); (* inner loop len *)
  7343. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7344. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7345. IF RangeFlag IN GetFlags( dest ) THEN
  7346. Halt( GeometryMismatch, left, right, dest );
  7347. ELSE p := AllocateVector( dest, l1, Size );
  7348. END;
  7349. END;
  7350. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7351. IF overlap THEN
  7352. destOld := dest; destNew := 0;
  7353. p := AllocateSame( destNew, destOld, Size );
  7354. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7355. dest := destNew;
  7356. END;
  7357. (*
  7358. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7359. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7360. END;
  7361. *)
  7362. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7363. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7364. di0 := GetIncr( dest, 0 );
  7365. IF l1=0 THEN RETURN
  7366. ELSIF l2=0 THEN RETURN
  7367. ELSIF (fast = NIL ) OR
  7368. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7369. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7370. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7371. DEC( l1 );
  7372. END;
  7373. END;
  7374. IF overlap THEN CopyContent( destOld, dest, Size );
  7375. END;
  7376. END ApplyMatVecMulLoop;
  7377. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7378. Size: SIZE; loop: BinaryAASLoop;
  7379. fast: FastMatMul ); (* Size= element-size *)
  7380. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7381. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7382. BEGIN
  7383. (*
  7384. <- 0 ->
  7385. xxx xxxx -> xxxx
  7386. xxxx
  7387. 1 xxxx
  7388. Len(..,0): #columns ; Inc(..,0): inc in rows
  7389. Len(..,1): #rows ; Inc(..,1): inc between rows
  7390. *)
  7391. (* check geometric restriction *)
  7392. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7393. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7394. l2 := GetLen( right, 0 ); (* inner loop len *)
  7395. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7396. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7397. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7398. ELSE p := AllocateVector( dest, l0, Size );
  7399. END;
  7400. END;
  7401. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7402. IF overlap THEN
  7403. destOld := dest; destNew := 0;
  7404. p := AllocateSame( destNew, destOld, Size );
  7405. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7406. dest := destNew;
  7407. END;
  7408. (*
  7409. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7410. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7411. END;
  7412. *)
  7413. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7414. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7415. di0 := GetIncr( dest, 0 );
  7416. IF l2=0 THEN RETURN
  7417. ELSIF l0=0 THEN RETURN
  7418. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7419. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7420. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7421. DEC( l0 );
  7422. END;
  7423. END;
  7424. IF overlap THEN CopyContent( destOld, dest, Size );
  7425. END;
  7426. END ApplyVecMatMulLoop;
  7427. (** SHORTINT *)
  7428. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7429. VAR lval, rval, dval: SHORTINT;
  7430. BEGIN
  7431. dval := 0;
  7432. WHILE (len > 0) DO
  7433. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7434. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7435. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7436. END;
  7437. SYSTEM.PUT( dadr, dval );
  7438. END MatMulASASLoop;
  7439. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7440. BEGIN
  7441. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7442. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7443. RETURN RESULT
  7444. END "*";
  7445. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7446. BEGIN
  7447. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7448. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7449. RETURN RESULT
  7450. END "*";
  7451. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7452. BEGIN
  7453. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7454. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7455. RETURN RESULT
  7456. END "*";
  7457. (** INTEGER *)
  7458. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7459. VAR lval, rval, dval: INTEGER;
  7460. BEGIN
  7461. dval := 0;
  7462. WHILE (len > 0) DO
  7463. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7464. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7465. END;
  7466. SYSTEM.PUT( dadr, dval );
  7467. END MatMulAIAILoop;
  7468. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7469. BEGIN
  7470. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7471. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7472. RETURN RESULT
  7473. END "*";
  7474. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7475. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7476. BEGIN
  7477. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7478. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7479. RETURN RESULT
  7480. END "*";
  7481. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7482. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7483. BEGIN
  7484. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7485. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7486. RETURN RESULT
  7487. END "*";
  7488. (** LONGINT *)
  7489. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7490. VAR lval, rval, dval: LONGINT;
  7491. BEGIN
  7492. dval := 0;
  7493. WHILE (len > 0) DO
  7494. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7495. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7496. END;
  7497. SYSTEM.PUT( dadr, dval );
  7498. END MatMulALALLoop;
  7499. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7500. BEGIN
  7501. (*
  7502. KernelLog.String("MatMulALAL");
  7503. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7504. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7505. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7506. KernelLog.Ln;
  7507. *)
  7508. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7509. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7510. RETURN RESULT
  7511. END "*";
  7512. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7513. BEGIN
  7514. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7515. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7516. RETURN RESULT
  7517. END "*";
  7518. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7519. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7520. BEGIN
  7521. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7522. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7523. RETURN RESULT
  7524. END "*";
  7525. (** REAL *)
  7526. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7527. VAR lval, rval, dval: REAL;
  7528. BEGIN
  7529. dval := 0;
  7530. WHILE (len > 0) DO
  7531. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7532. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7533. END;
  7534. SYSTEM.PUT( dadr, dval );
  7535. END MatMulARARLoop;
  7536. (*
  7537. Optimized for small matrices (Alexey Morozov)
  7538. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7539. *)
  7540. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7541. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7542. BEGIN
  7543. dadr := GetAdr(ADDRESSOF(RESULT));
  7544. ladr := GetAdr(ADDRESSOF(left));
  7545. radr := GetAdr(ADDRESSOF(right));
  7546. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7547. IF (ladr # dadr) & (radr # dadr) THEN
  7548. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7549. CASE SYSTEM.VAL(LONGINT,flags) OF
  7550. Mat2x2:
  7551. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7552. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7553. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7554. END;
  7555. END;
  7556. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7557. ELSE
  7558. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7559. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7560. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7561. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7562. END;
  7563. |Mat3x3:
  7564. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7565. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7566. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7567. END;
  7568. END;
  7569. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7570. ELSE
  7571. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7572. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7573. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7574. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7575. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7576. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7577. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7578. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7579. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7580. END;
  7581. |Mat4x4:
  7582. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7583. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7584. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7585. END;
  7586. END;
  7587. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7588. ELSE
  7589. 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];
  7590. 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];
  7591. 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];
  7592. 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];
  7593. 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];
  7594. 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];
  7595. 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];
  7596. 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];
  7597. 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];
  7598. 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];
  7599. 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];
  7600. 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];
  7601. 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];
  7602. 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];
  7603. 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];
  7604. 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];
  7605. END;
  7606. ELSE
  7607. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7608. loopMatMulARAR, matMulR );
  7609. END;
  7610. ELSE
  7611. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7612. loopMatMulARAR, matMulR );
  7613. END;
  7614. RETURN RESULT
  7615. END "*";
  7616. (*
  7617. Optimized for small arrays (Alexey Morozov)
  7618. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7619. *)
  7620. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7621. VAR
  7622. flags: SET; dadr, ladr, radr: ADDRESS;
  7623. v0, v1, v2: REAL;
  7624. BEGIN
  7625. dadr := GetAdr(ADDRESSOF(RESULT));
  7626. ladr := GetAdr(ADDRESSOF(left));
  7627. radr := GetAdr(ADDRESSOF(right));
  7628. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7629. CASE SYSTEM.VAL(LONGINT,flags) OF
  7630. MatVec2x2:
  7631. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7632. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7633. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7634. END;
  7635. END;
  7636. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7637. ELSE
  7638. (* account possible overlapping *)
  7639. v0 := right[0];
  7640. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7641. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7642. END;
  7643. |MatVec3x3:
  7644. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7645. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7646. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7647. END;
  7648. END;
  7649. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7650. ELSE
  7651. (* account possible overlapping *)
  7652. v0 := right[0]; v1 := right[1];
  7653. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7654. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7655. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7656. END;
  7657. |MatVec4x4:
  7658. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7659. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7660. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7661. END;
  7662. END;
  7663. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7664. ELSE
  7665. (* account possible overlapping *)
  7666. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7667. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7668. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7669. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7670. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7671. END;
  7672. ELSE
  7673. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7674. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7675. END;
  7676. RETURN RESULT
  7677. END "*";
  7678. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7679. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7680. BEGIN
  7681. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7682. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7683. RETURN RESULT
  7684. END "*";
  7685. (** LONGREAL *)
  7686. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7687. VAR lval, rval, dval: LONGREAL;
  7688. BEGIN
  7689. dval := 0;
  7690. WHILE (len > 0) DO
  7691. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7692. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7693. END;
  7694. SYSTEM.PUT( dadr, dval );
  7695. END MatMulAXAXLoop;
  7696. (*
  7697. Optimized for small matrices (Alexey Morozov)
  7698. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7699. *)
  7700. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7701. VAR
  7702. flags: SET; dadr, ladr, radr: ADDRESS;
  7703. BEGIN
  7704. dadr := GetAdr(ADDRESSOF(RESULT));
  7705. ladr := GetAdr(ADDRESSOF(left));
  7706. radr := GetAdr(ADDRESSOF(right));
  7707. IF (ladr # dadr) & (radr # dadr) THEN
  7708. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7709. CASE SYSTEM.VAL(LONGINT,flags) OF
  7710. Mat2x2:
  7711. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7712. IF dadr = 0 THEN NEW(RESULT,2,2);
  7713. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7714. END;
  7715. END;
  7716. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7717. ELSE
  7718. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7719. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7720. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7721. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7722. END;
  7723. |Mat3x3:
  7724. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7725. IF dadr = 0 THEN NEW(RESULT,3,3);
  7726. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7727. END;
  7728. END;
  7729. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7730. ELSE
  7731. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7732. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7733. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7734. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7735. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7736. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7737. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7738. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7739. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7740. END;
  7741. |Mat4x4:
  7742. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7743. IF dadr = 0 THEN NEW(RESULT,4,4);
  7744. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7745. END;
  7746. END;
  7747. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7748. ELSE
  7749. 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];
  7750. 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];
  7751. 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];
  7752. 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];
  7753. 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];
  7754. 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];
  7755. 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];
  7756. 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];
  7757. 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];
  7758. 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];
  7759. 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];
  7760. 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];
  7761. 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];
  7762. 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];
  7763. 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];
  7764. 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];
  7765. END;
  7766. ELSE
  7767. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7768. loopMatMulAXAX, matMulX );
  7769. END;
  7770. ELSE
  7771. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7772. loopMatMulAXAX, matMulX );
  7773. END;
  7774. RETURN RESULT
  7775. END "*";
  7776. (*
  7777. Optimized for small arrays (Alexey Morozov)
  7778. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7779. *)
  7780. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7781. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7782. VAR
  7783. flags: SET; dadr, ladr, radr: ADDRESS;
  7784. v0, v1, v2: LONGREAL;
  7785. BEGIN
  7786. dadr := GetAdr(ADDRESSOF(RESULT));
  7787. ladr := GetAdr(ADDRESSOF(left));
  7788. radr := GetAdr(ADDRESSOF(right));
  7789. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7790. CASE SYSTEM.VAL(LONGINT,flags) OF
  7791. MatVec2x2:
  7792. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7793. IF dadr = 0 THEN NEW(RESULT,2);
  7794. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7795. END;
  7796. END;
  7797. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7798. ELSE
  7799. (* account possible overlapping *)
  7800. v0 := right[0];
  7801. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7802. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7803. END;
  7804. |MatVec3x3:
  7805. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7806. IF dadr = 0 THEN NEW(RESULT,3);
  7807. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7808. END;
  7809. END;
  7810. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7811. ELSE
  7812. (* account possible overlapping *)
  7813. v0 := right[0]; v1 := right[1];
  7814. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7815. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7816. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7817. END;
  7818. |MatVec4x4:
  7819. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7820. IF dadr = 0 THEN NEW(RESULT,4);
  7821. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7822. END;
  7823. END;
  7824. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7825. ELSE
  7826. (* account possible overlapping *)
  7827. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7828. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7829. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7830. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7831. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7832. END;
  7833. ELSE
  7834. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7835. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7836. END;
  7837. RETURN RESULT
  7838. END "*";
  7839. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7840. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7841. BEGIN
  7842. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7843. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7844. RETURN RESULT
  7845. END "*";
  7846. (** SHORTINT *)
  7847. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7848. VAR lval, rval, dval: SHORTINT;
  7849. BEGIN
  7850. SYSTEM.GET( dadr, dval );
  7851. WHILE (len > 0) DO
  7852. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7853. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7854. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7855. END;
  7856. SYSTEM.PUT( dadr, dval );
  7857. END MatMulIncASASLoop;
  7858. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7859. BEGIN
  7860. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7861. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7862. RETURN RESULT
  7863. END "INCMUL";
  7864. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7865. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7866. BEGIN
  7867. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7868. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7869. RETURN RESULT
  7870. END "INCMUL";
  7871. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7872. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7873. BEGIN
  7874. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7875. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7876. RETURN RESULT
  7877. END "INCMUL";
  7878. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7879. BEGIN
  7880. RESULT := -RESULT;
  7881. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7882. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7883. RESULT := -RESULT;
  7884. RETURN RESULT
  7885. END "DECMUL";
  7886. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7887. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7888. BEGIN
  7889. RESULT := -RESULT;
  7890. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7891. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7892. RESULT := -RESULT;
  7893. RETURN RESULT
  7894. END "DECMUL";
  7895. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7896. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7897. BEGIN
  7898. RESULT := -RESULT;
  7899. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7900. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7901. RESULT := -RESULT;
  7902. RETURN RESULT
  7903. END "DECMUL";
  7904. (** INTEGER *)
  7905. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7906. VAR lval, rval, dval: INTEGER;
  7907. BEGIN
  7908. SYSTEM.GET( dadr, dval );
  7909. WHILE (len > 0) DO
  7910. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7911. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7912. END;
  7913. SYSTEM.PUT( dadr, dval );
  7914. END MatMulIncAIAILoop;
  7915. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7916. BEGIN
  7917. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7918. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7919. RETURN RESULT
  7920. END "INCMUL";
  7921. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7922. BEGIN
  7923. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7924. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7925. RETURN RESULT
  7926. END "INCMUL";
  7927. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7928. BEGIN
  7929. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7930. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7931. RETURN RESULT
  7932. END "INCMUL";
  7933. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7934. BEGIN
  7935. RESULT := -RESULT;
  7936. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7937. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7938. RESULT := -RESULT;
  7939. RETURN RESULT
  7940. END "DECMUL";
  7941. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7942. BEGIN
  7943. RESULT := -RESULT;
  7944. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7945. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7946. RESULT := -RESULT;
  7947. RETURN RESULT
  7948. END "DECMUL";
  7949. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7950. BEGIN
  7951. RESULT := -RESULT;
  7952. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7953. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7954. RESULT := -RESULT;
  7955. RETURN RESULT
  7956. END "DECMUL";
  7957. (** LONGINT *)
  7958. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7959. VAR lval, rval, dval: LONGINT;
  7960. BEGIN
  7961. SYSTEM.GET( dadr, dval );
  7962. WHILE (len > 0) DO
  7963. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7964. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7965. END;
  7966. SYSTEM.PUT( dadr, dval );
  7967. END MatMulIncALALLoop;
  7968. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7969. BEGIN
  7970. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7971. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7972. RETURN RESULT
  7973. END "INCMUL";
  7974. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7975. BEGIN
  7976. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7977. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7978. RETURN RESULT
  7979. END "INCMUL";
  7980. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7981. BEGIN
  7982. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7983. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7984. RETURN RESULT
  7985. END "INCMUL";
  7986. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7987. BEGIN
  7988. RESULT := -RESULT;
  7989. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7990. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7991. RESULT := -RESULT;
  7992. RETURN RESULT
  7993. END "DECMUL";
  7994. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7995. BEGIN
  7996. RESULT := -RESULT;
  7997. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7998. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7999. RESULT := -RESULT;
  8000. RETURN RESULT
  8001. END "DECMUL";
  8002. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8003. BEGIN
  8004. RESULT := -RESULT;
  8005. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8006. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8007. RESULT := -RESULT;
  8008. RETURN RESULT
  8009. END "DECMUL";
  8010. (** REAL *)
  8011. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8012. VAR lval, rval, dval: REAL;
  8013. BEGIN
  8014. SYSTEM.GET( dadr, dval );
  8015. WHILE (len > 0) DO
  8016. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8017. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8018. END;
  8019. SYSTEM.PUT( dadr, dval );
  8020. END MatMulIncARARLoop;
  8021. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8022. BEGIN
  8023. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8024. loopMatMulIncARAR, matMulIncR );
  8025. RETURN RESULT
  8026. END "INCMUL";
  8027. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8028. BEGIN
  8029. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8030. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8031. RETURN RESULT
  8032. END "INCMUL";
  8033. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8034. BEGIN
  8035. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8036. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8037. RETURN RESULT
  8038. END "INCMUL";
  8039. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8040. BEGIN
  8041. RESULT := -RESULT;
  8042. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8043. loopMatMulIncARAR, matMulIncR );
  8044. RESULT := -RESULT;
  8045. RETURN RESULT
  8046. END "DECMUL";
  8047. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8048. BEGIN
  8049. RESULT := -RESULT;
  8050. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8051. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8052. RESULT := -RESULT;
  8053. RETURN RESULT
  8054. END "DECMUL";
  8055. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8056. BEGIN
  8057. RESULT := -RESULT;
  8058. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8059. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8060. RESULT := -RESULT;
  8061. RETURN RESULT
  8062. END "DECMUL";
  8063. (** LONGREAL *)
  8064. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8065. VAR lval, rval, dval: LONGREAL;
  8066. BEGIN
  8067. SYSTEM.GET( dadr, dval );
  8068. WHILE (len > 0) DO
  8069. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8070. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8071. END;
  8072. SYSTEM.PUT( dadr, dval );
  8073. END MatMulIncAXAXLoop;
  8074. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8075. BEGIN
  8076. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8077. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8078. RETURN RESULT
  8079. END "INCMUL";
  8080. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8081. BEGIN
  8082. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8083. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8084. RETURN RESULT
  8085. END "INCMUL";
  8086. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8087. BEGIN
  8088. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8089. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8090. RETURN RESULT
  8091. END "INCMUL";
  8092. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8093. BEGIN
  8094. RESULT := -RESULT;
  8095. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8096. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8097. RESULT := -RESULT;
  8098. RETURN RESULT
  8099. END "DECMUL";
  8100. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8101. BEGIN
  8102. RESULT := -RESULT;
  8103. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8104. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8105. RESULT := -RESULT;
  8106. RETURN RESULT
  8107. END "DECMUL";
  8108. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8109. BEGIN
  8110. RESULT := -RESULT;
  8111. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8112. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8113. RESULT := -RESULT;
  8114. RETURN RESULT
  8115. END "DECMUL";
  8116. (*** Cross product ********************************************************************)
  8117. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8118. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8119. BEGIN
  8120. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8121. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8122. END;
  8123. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8124. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8125. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8126. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8127. RETURN RESULT
  8128. END "*";
  8129. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8130. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8131. BEGIN
  8132. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8133. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8134. END;
  8135. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8136. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8137. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8138. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8139. RETURN RESULT
  8140. END "*";
  8141. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8142. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8143. BEGIN
  8144. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8145. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8146. END;
  8147. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8148. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8149. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8150. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8151. RETURN RESULT
  8152. END "*";
  8153. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8154. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8155. BEGIN
  8156. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8157. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8158. END;
  8159. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8160. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8161. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8162. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8163. RETURN RESULT
  8164. END "*";
  8165. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8166. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8167. BEGIN
  8168. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8169. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8170. END;
  8171. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8172. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8173. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8174. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8175. RETURN RESULT
  8176. END "*";
  8177. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  8178. VAR tensor: Tensor;
  8179. BEGIN
  8180. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8181. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8182. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8183. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8184. ELSE HALT(200);
  8185. END;
  8186. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8187. loopMatMulAXAX, matMulX );
  8188. RETURN RESULT
  8189. END "*";
  8190. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  8191. BEGIN
  8192. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8193. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8194. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8195. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8196. ELSE HALT(200);
  8197. END;
  8198. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8199. loopMatMulARAR, matMulR );
  8200. RETURN RESULT
  8201. END "*";
  8202. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  8203. BEGIN
  8204. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8205. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8206. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8207. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8208. ELSE HALT(200);
  8209. END;
  8210. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8211. MatMulALALLoop, NIL );
  8212. RETURN RESULT
  8213. END "*";
  8214. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8215. BEGIN
  8216. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8217. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8218. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8219. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8220. ELSE HALT(200);
  8221. END;
  8222. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8223. MatMulAIAILoop,NIL );
  8224. RETURN RESULT
  8225. END "*";
  8226. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8227. BEGIN
  8228. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8229. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8230. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8231. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8232. ELSE HALT(200);
  8233. END;
  8234. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8235. MatMulASASLoop, NIL );
  8236. RETURN RESULT
  8237. END "*";
  8238. (** Transpose ********************************************************************)
  8239. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8240. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8241. BEGIN
  8242. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8243. dim := GetDim( src1 ) - 1;
  8244. WHILE (dim > 0) DO
  8245. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8246. END;
  8247. dim := GetDim( src2 ) - 1;
  8248. WHILE (dim > 0) DO
  8249. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8250. END;
  8251. IF from1 < from2 THEN RETURN to1 >= from2;
  8252. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8253. ELSE RETURN TRUE;
  8254. END;
  8255. END Overlap;
  8256. (*
  8257. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8258. VAR from1, from2, to1, to2: ADDRESS;
  8259. BEGIN
  8260. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8261. DEC( dim );
  8262. WHILE (dim > 0) DO
  8263. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8264. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8265. END;
  8266. IF from1 < from2 THEN RETURN to1 >= from2;
  8267. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8268. ELSE RETURN TRUE;
  8269. END;
  8270. END Overlap;
  8271. *)
  8272. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8273. VAR ptr, data: ANY; Size: SIZE;
  8274. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8275. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8276. VAR dim,max: SIZE;
  8277. BEGIN
  8278. dim := GetDim( l );
  8279. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8280. max := dim-1;
  8281. WHILE (dim > 0) DO
  8282. DEC( dim );
  8283. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8284. END;
  8285. RETURN TRUE;
  8286. END TransposedShape;
  8287. PROCEDURE NewData;
  8288. VAR max,dim, len, size: SIZE;
  8289. BEGIN
  8290. dim := GetDim( src ); size := elementsize;
  8291. PutDim( dest, dim );
  8292. PutSize( dest, elementsize );
  8293. max := dim-1;
  8294. WHILE (dim > 0) DO
  8295. DEC( dim );
  8296. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8297. PutInc( dest, dim, size ); size := size * len;
  8298. END;
  8299. SYSTEM.NEW( data, size + ArrayAlignment);
  8300. PutAdr( dest, Align(data) );
  8301. PutPtr( dest, data );
  8302. END NewData;
  8303. BEGIN
  8304. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8305. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8306. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8307. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8308. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8309. PutFlags(dest, {TensorFlag});
  8310. NewData();
  8311. RETURN ptr;
  8312. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8313. (* check if re-allocation of descriptor is allowed *)
  8314. IF ~(TensorFlag IN GetFlags( dest )) &
  8315. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8316. HALT( 100 );
  8317. END;
  8318. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8319. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8320. PutFlags(dest, {TensorFlag});
  8321. NewData(); RETURN ptr;
  8322. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8323. (* check if re-allocation of array data is allowed *)
  8324. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8325. HALT( 100 );
  8326. END;
  8327. NewData();
  8328. RETURN data;
  8329. ELSE (* nothing to do *)
  8330. RETURN NIL;
  8331. END;
  8332. END AllocateTransposed;
  8333. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8334. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8335. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8336. BEGIN
  8337. WHILE (len > 0) DO
  8338. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8339. DEC( len );
  8340. END;
  8341. END CopyLoop;
  8342. BEGIN
  8343. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8344. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8345. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8346. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8347. ELSE
  8348. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8349. p := AllocateTransposed(dest,left,Size);
  8350. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8351. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8352. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8353. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8354. WHILE (len0 > 0) DO
  8355. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8356. INC( dadr, dinc0 ); DEC( len0 );
  8357. END;
  8358. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8359. ladr := p;
  8360. ELSE
  8361. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8362. END;
  8363. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8364. dadr := GetAdr( dest );
  8365. IF (Size = 4) & (transpose4 # NIL ) THEN
  8366. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8367. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8368. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8369. ELSE
  8370. WHILE (len0 > 0) DO
  8371. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8372. INC( dadr, dinc1 ); DEC( len0 );
  8373. END;
  8374. END;
  8375. END;
  8376. END Transpose;
  8377. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8378. BEGIN
  8379. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8380. RETURN RESULT
  8381. END "`";
  8382. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8383. BEGIN
  8384. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8385. RETURN RESULT
  8386. END "`";
  8387. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8388. BEGIN
  8389. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8390. RETURN RESULT
  8391. END "`";
  8392. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8393. BEGIN
  8394. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8395. RETURN RESULT
  8396. END "`";
  8397. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8398. BEGIN
  8399. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8400. RETURN RESULT
  8401. END "`";
  8402. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8403. VAR i: SIZE;
  8404. BEGIN
  8405. FOR i := 0 TO rdim - 1 DO
  8406. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8407. END;
  8408. FOR i := 0 TO ldim - 1 DO
  8409. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8410. END;
  8411. RETURN TRUE;
  8412. END CheckTensorGeometry;
  8413. (*
  8414. PROCEDURE Zero(p: ANY; size: LONGINT);
  8415. VAR adr: LONGINT;
  8416. BEGIN
  8417. adr := SYSTEM.VAL(LONGINT,p);
  8418. WHILE(size>0) DO
  8419. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8420. END;
  8421. END Zero;
  8422. *)
  8423. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8424. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8425. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8426. squeezingReshape: BOOLEAN;
  8427. PROCEDURE CheckAlloc;
  8428. BEGIN
  8429. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8430. END CheckAlloc;
  8431. PROCEDURE NewDescriptor;
  8432. BEGIN
  8433. CheckAlloc;
  8434. ptr := GetArrayDesc( newDim ); new := ptr;
  8435. END NewDescriptor;
  8436. (* Added by Alexey
  8437. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8438. *)
  8439. PROCEDURE SqueezingReshape(): BOOLEAN;
  8440. VAR
  8441. i, j, n: SIZE;
  8442. BEGIN
  8443. IF oldDim > newDim THEN
  8444. i := 0; j := 0;
  8445. WHILE (i < oldDim) & (j < newDim) DO
  8446. n := GetLen(src,i);
  8447. IF n = shape[j] THEN INC(j); END;
  8448. INC(i);
  8449. END;
  8450. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8451. ELSE
  8452. squeezingReshape := FALSE;
  8453. END;
  8454. squeezingReshape := (i = oldDim) & (j = newDim);
  8455. RETURN squeezingReshape;
  8456. END SqueezingReshape;
  8457. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8458. PROCEDURE TargetContinuous(): BOOLEAN;
  8459. VAR
  8460. i, n: SIZE;
  8461. continue: BOOLEAN;
  8462. BEGIN
  8463. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8464. continue := TRUE;
  8465. WHILE (i > 0) & continue DO
  8466. n := n * GetLen(dest,i);
  8467. DEC(i);
  8468. continue := GetIncr(dest,i) = n;
  8469. END;
  8470. (*TRACE(i,continue,Size,GetSize(dest));*)
  8471. (*tod obviously size is not what I expect it to be*)
  8472. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8473. RETURN TRUE;
  8474. ELSE
  8475. RETURN FALSE;
  8476. END;
  8477. END TargetContinuous;
  8478. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8479. PROCEDURE PreservesContiguity(): BOOLEAN;
  8480. VAR
  8481. i, n: SIZE;
  8482. continue: BOOLEAN;
  8483. BEGIN
  8484. i := oldDim-1; n := GetIncr(src,i);
  8485. continue := TRUE;
  8486. WHILE (i > 0) & continue DO
  8487. n := n * GetLen(src,i);
  8488. DEC(i);
  8489. continue := GetIncr(src,i) = n;
  8490. END;
  8491. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8492. RETURN TRUE;
  8493. ELSE Err("Not yet implemented!");
  8494. END;
  8495. END PreservesContiguity;
  8496. (* Added by Alexey *)
  8497. PROCEDURE NewDescriptorForSameData;
  8498. VAR len, size, i, j: SIZE;
  8499. BEGIN
  8500. CheckAlloc();
  8501. ptr := GetArrayDesc( newDim ); new := ptr;
  8502. IF ~squeezingReshape THEN
  8503. size := Size;
  8504. FOR i := newDim - 1 TO 0 BY -1 DO
  8505. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8506. size := size * len;
  8507. END;
  8508. ELSE (* squeezing reshape *)
  8509. j := 0; len := shape[j];
  8510. FOR i := 0 TO oldDim-1 DO
  8511. IF GetLen(src,i) = len THEN
  8512. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8513. INC(j);
  8514. IF j < newDim THEN len := shape[j]; END;
  8515. END;
  8516. END;
  8517. END;
  8518. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8519. PutFlags(new,GetFlags(new)+{RangeFlag});
  8520. END;
  8521. PutAdr( new, GetAdr(src) );
  8522. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8523. PutSize( new, Size );
  8524. END NewDescriptorForSameData;
  8525. PROCEDURE NewData;
  8526. VAR len, size, i: SIZE;
  8527. BEGIN
  8528. size := Size;
  8529. FOR i := newDim - 1 TO 0 BY -1 DO
  8530. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8531. size := size * len;
  8532. END;
  8533. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8534. PutAdr( new, Align(data) );
  8535. PutPtr( new, data ); PutDim( new, newDim );
  8536. PutSize( new, Size );
  8537. END NewData;
  8538. PROCEDURE CopyData;
  8539. VAR d, s: SIZE; dadr: ADDRESS;
  8540. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8541. VAR inc, len, i: SIZE;
  8542. BEGIN
  8543. IF dim = d THEN
  8544. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8545. FOR i := 0 TO len - 1 DO
  8546. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8547. END;
  8548. ELSE
  8549. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8550. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8551. END;
  8552. END Loop;
  8553. BEGIN
  8554. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8555. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8556. s := s * GetLen( src, d ); DEC( d );
  8557. END;
  8558. IF d = -1 THEN (* special case: both continuous *)
  8559. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8560. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8561. END;
  8562. END CopyData;
  8563. PROCEDURE CopyDataBack;
  8564. VAR d, s: SIZE; sadr: ADDRESS;
  8565. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8566. VAR inc, len, i: SIZE;
  8567. BEGIN
  8568. IF dim = d THEN
  8569. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8570. FOR i := 0 TO len - 1 DO
  8571. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8572. END;
  8573. ELSE
  8574. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8575. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8576. END;
  8577. END Loop;
  8578. BEGIN
  8579. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8580. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8581. s := s * GetLen( dest, d ); DEC( d );
  8582. END;
  8583. IF d = -1 THEN (* special case: both continuous *)
  8584. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8585. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8586. END;
  8587. END CopyDataBack;
  8588. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8589. BEGIN
  8590. ASSERT( GetDim( src ) = GetDim( dest ) );
  8591. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8592. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8593. END CopyDescriptor;
  8594. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8595. VAR i: SIZE;
  8596. BEGIN
  8597. ASSERT(GetDim(dest) = newDim);
  8598. FOR i := 0 TO newDim - 1 DO
  8599. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8600. END;
  8601. RETURN FALSE;
  8602. END ShapeDiffers;
  8603. BEGIN
  8604. (*
  8605. cases
  8606. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8607. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8608. 3.) descriptor may not be reshaped: dest = RANGE
  8609. *)
  8610. (* first check invariants *)
  8611. oldDim := GetDim( src );
  8612. IF oldDim = 0 THEN oldSize := 0
  8613. ELSE
  8614. oldSize := 1;
  8615. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8616. END;
  8617. newDim := LEN( shape, 0 );
  8618. IF newDim = 0 THEN newSize := 0
  8619. ELSE
  8620. newSize := 1;
  8621. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8622. END;
  8623. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8624. Size := GetSize( src );
  8625. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8626. IF dest = src THEN (* added by Alexey *)
  8627. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8628. NewDescriptorForSameData;
  8629. dest := new;
  8630. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8631. (* create a copy of the original descriptor *)
  8632. CheckAlloc();
  8633. ptr := GetArrayDesc(newDim); dest := ptr;
  8634. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8635. CopyDescriptor(src,dest);
  8636. ELSE
  8637. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8638. END;
  8639. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8640. NewDescriptor; NewData; CopyData; dest := new;
  8641. ELSIF (dest = temporary) THEN
  8642. NewDescriptorForSameData;
  8643. dest := new;
  8644. ELSIF TargetContinuous() THEN
  8645. NewDescriptor; new:=dest; CopyData;
  8646. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8647. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8648. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8649. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8650. END;
  8651. NewDescriptor; NewData; CopyData;
  8652. dest := new;
  8653. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8654. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8655. (*
  8656. NewDescriptor; *)
  8657. new := dest;
  8658. NewData; CopyData;
  8659. new := NIL;
  8660. (*CopyDescriptor( new, dest );*)
  8661. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8662. NewDescriptor; NewData; CopyData; CopyDataBack;
  8663. ELSE (* same shape, just copy *)
  8664. CopyContent( src, dest, Size ); RETURN;
  8665. END;
  8666. IF dest = new THEN (* new block *)
  8667. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  8668. END;
  8669. END DoReshape;
  8670. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8671. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8672. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8673. PROCEDURE NewData;
  8674. VAR len, size, i: SIZE;
  8675. BEGIN
  8676. size := elementSize;
  8677. FOR i := dim - 1 TO 0 BY -1 DO
  8678. len := a[i];
  8679. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8680. END;
  8681. IF tag = 0 THEN
  8682. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8683. dest.adr := Align(data);
  8684. ELSE
  8685. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8686. dest.adr := data + ArrDataArrayOffset;
  8687. END;
  8688. SafePut(dest.ptr, data);
  8689. (*dest.ptr := data;*)
  8690. PutSize( dest, elementSize );
  8691. END NewData;
  8692. PROCEDURE ClearData;
  8693. (*! todo *)
  8694. END ClearData;
  8695. BEGIN
  8696. dim := LEN( a,0 );
  8697. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8698. IF dest # 0 THEN
  8699. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8700. END;
  8701. descr := GetArrayDesc( LEN( a,0 ) );
  8702. dest := descr;
  8703. NewData;
  8704. Heaps.SetPC(data);
  8705. ELSE
  8706. i := 0;
  8707. same := TRUE;
  8708. WHILE (i < dim) & same DO
  8709. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8710. INC( i );
  8711. END;
  8712. IF ~same THEN
  8713. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8714. NewData;
  8715. Heaps.SetPC(data);
  8716. ELSE ClearData
  8717. END;
  8718. END;
  8719. END AllocateTensorA;
  8720. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8721. BEGIN
  8722. AllocateTensorA(a,elementSize,tag,dest);
  8723. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8724. END AllocateArrayA;
  8725. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8726. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  8727. PROCEDURE NewData;
  8728. VAR len, size: SIZE; i: SIZE;
  8729. BEGIN
  8730. size := Size;
  8731. FOR i := dim - 1 TO 0 BY -1 DO
  8732. len := a[i];
  8733. (*
  8734. KernelLog.Int(len,10); KernelLog.Ln;
  8735. *)
  8736. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8737. END;
  8738. IF tag = 0 THEN
  8739. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8740. PutAdr( dest, Align(data) );
  8741. ELSE
  8742. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8743. PutAdr( dest, data+ ArrDataArrayOffset );
  8744. END;
  8745. PutPtr( dest, data ); PutSize( dest, Size );
  8746. END NewData;
  8747. PROCEDURE ClearData;
  8748. (*! todo *)
  8749. END ClearData;
  8750. BEGIN
  8751. dim := LEN( a,0 );
  8752. dest := SYSTEM.VAL(ADDRESS,destA);
  8753. (*! check range flag! *)
  8754. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8755. IF dest # 0 THEN
  8756. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8757. END;
  8758. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8759. NewData;
  8760. ELSE
  8761. i := 0;
  8762. WHILE (i < dim) & same DO
  8763. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8764. INC( i );
  8765. END;
  8766. IF ~same THEN
  8767. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8768. NewData
  8769. ELSE ClearData
  8770. END;
  8771. END;
  8772. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8773. IF dest = descr THEN (* new block *)
  8774. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  8775. END;
  8776. END AllocateTensorX;
  8777. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8778. VAR dim, i: SIZE;
  8779. BEGIN
  8780. dim := GetDim( src );
  8781. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8782. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8783. END LenA;
  8784. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8785. VAR dim, len: SIZE; i: SIZE;
  8786. BEGIN
  8787. dim := GetDim( src ); len := LEN( dest, 0 );
  8788. IF len # dim THEN NEW( dest, dim ); END;
  8789. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8790. END IncrA;
  8791. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8792. VAR dim: SIZE;
  8793. BEGIN
  8794. dim := GetDim(src);
  8795. IF (d<0) OR (d>=dim) THEN HALT(100)
  8796. ELSE
  8797. RETURN GetLen(src,d);
  8798. END;
  8799. END Len;
  8800. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8801. VAR dim: SIZE;
  8802. BEGIN
  8803. dim := GetDim(src);
  8804. IF (d<0) OR (d>=dim) THEN HALT(100)
  8805. ELSE
  8806. RETURN GetIncr(src,d);
  8807. END;
  8808. END Incr;
  8809. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8810. Size: SIZE ): ANY;
  8811. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8812. PROCEDURE NewData;
  8813. VAR len, size, i: SIZE;
  8814. BEGIN
  8815. size := 1;
  8816. FOR i := 0 TO ldim - 1 DO
  8817. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8818. END;
  8819. FOR i := 0 TO rdim - 1 DO
  8820. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8821. END;
  8822. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8823. (*
  8824. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8825. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8826. *)
  8827. size := Size;
  8828. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8829. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8830. END;
  8831. PutAdr( dest, Align(data) );
  8832. PutPtr( dest, data );
  8833. END NewData;
  8834. BEGIN
  8835. ldim := GetDim( left ); rdim := GetDim( right );
  8836. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8837. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8838. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8839. NewData(); RETURN ptr;
  8840. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8841. IF ~(TensorFlag IN GetFlags( dest )) &
  8842. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8843. HALT( 100 );
  8844. END;
  8845. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8846. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8847. NewData(); RETURN ptr;
  8848. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8849. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8850. HALT( 100 );
  8851. END;
  8852. NewData(); RETURN data;
  8853. END;
  8854. RETURN NIL;
  8855. END AllocateTensor;
  8856. (* 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 *)
  8857. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8858. VAR rdim, len, linc, ri: SIZE );
  8859. (* geometric precondition: lengths must coincide *)
  8860. VAR ldim: SIZE;
  8861. BEGIN
  8862. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8863. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8864. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8865. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8866. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8867. END;
  8868. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8869. DEC( ldim );
  8870. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8871. (GetIncr( right, rdim ) = len * ri) DO
  8872. len := len * GetLen( left, ldim );
  8873. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8874. DEC( ldim );
  8875. END;
  8876. INC( ldim ); INC( rdim );
  8877. IF debug THEN
  8878. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8879. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8880. END;
  8881. END FindPatternTensor;
  8882. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  8883. Loop: BinaryASALoop );
  8884. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  8885. origdest: ADDRESS; left, right, dest: ADDRESS;
  8886. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  8887. VAR len: SIZE; linc, rinc, dinc: SIZE;
  8888. BEGIN
  8889. IF (ldim < lDim) THEN
  8890. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8891. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8892. WHILE (len > 0) DO
  8893. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8894. INC( dadr, dinc ); DEC( len );
  8895. END;
  8896. ELSIF (rdim # loopd) THEN
  8897. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8898. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8899. WHILE (len > 0) DO
  8900. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8901. INC( dadr, dinc ); DEC( len );
  8902. END;
  8903. ELSE
  8904. (*
  8905. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8906. KernelLog.Int(GetAdr(dest),10);
  8907. KernelLog.Int(GetAdr(dest)+clen,10);
  8908. KernelLog.Ln;
  8909. *)
  8910. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8911. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8912. END;
  8913. END Traverse;
  8914. BEGIN
  8915. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8916. (* check array lengths *)
  8917. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8918. p := AllocateTensor( dest, left, right, elementSize );
  8919. (*
  8920. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8921. p := AllocateTensor( left, right, dest, elementSize )
  8922. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8923. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8924. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8925. END;
  8926. (*! to be done: treat overlapping memory *)
  8927. END;
  8928. *)
  8929. (* debugging *)
  8930. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8931. (* check pattern: longest piece that can be done with a loop *)
  8932. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8933. (* run through dimensions *)
  8934. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8935. SYSTEM.PUT( d, dest );
  8936. IF p = dest THEN
  8937. Heaps.CheckAssignment(d,dest);
  8938. END;
  8939. END ApplyTensorAAAOp;
  8940. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8941. BEGIN
  8942. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8943. SIZEOF( SHORTINT ), MulASSSLoop );
  8944. RETURN RESULT
  8945. END "**";
  8946. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8947. BEGIN
  8948. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8949. SIZEOF( INTEGER ), MulAISILoop );
  8950. RETURN RESULT
  8951. END "**";
  8952. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8953. BEGIN
  8954. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8955. SIZEOF( LONGINT ), MulALSLLoop );
  8956. RETURN RESULT
  8957. END "**";
  8958. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8959. BEGIN
  8960. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8961. loopMulARSR );
  8962. RETURN RESULT
  8963. END "**";
  8964. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8965. BEGIN
  8966. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8967. SIZEOF( LONGREAL ), loopMulAXSX );
  8968. RETURN RESULT
  8969. END "**";
  8970. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8971. BEGIN
  8972. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8973. loopMulAZSZ );
  8974. RETURN RESULT
  8975. END "**";
  8976. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8977. BEGIN
  8978. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8979. loopMulALZSLZ );
  8980. RETURN RESULT
  8981. END "**";
  8982. PROCEDURE InitOptimization;
  8983. VAR p: PROCEDURE;
  8984. BEGIN
  8985. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8986. IF p # NIL THEN
  8987. p;
  8988. ELSE
  8989. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8990. END;
  8991. END InitOptimization;
  8992. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  8993. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  8994. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  8995. BEGIN
  8996. IF src = 0 THEN
  8997. HALT(100);
  8998. ELSE
  8999. srcDim := GetDim(src);
  9000. destDim := srcDim - prefixIndices - suffixIndices;
  9001. (*
  9002. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9003. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9004. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9005. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9006. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9007. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9008. *)
  9009. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  9010. dest := SYSTEM.VAL(ADDRESS,destPtr);
  9011. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9012. PutAdr(dest,GetAdr(src));
  9013. PutPtr(dest,GetPtr(src));
  9014. PutFlags(dest,GetFlags(src));
  9015. PutSize(dest,GetSize(src));
  9016. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9017. srcDim := i + prefixIndices + prefixRanges;
  9018. destDim := i + prefixRanges;
  9019. len := GetLen(src,srcDim);
  9020. incr := GetIncr(src,srcDim);
  9021. PutLen(dest,destDim,len);
  9022. PutInc(dest,destDim,incr);
  9023. END;
  9024. (*
  9025. Report("copy descriptor src",src);
  9026. Report("copy descriptor dest",dest);
  9027. *)
  9028. END;
  9029. END CopyDescriptor;
  9030. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9031. VAR dest: ARRAY [?] OF basetype
  9032. CONST src: ARRAY [?] OF basetype
  9033. CONST shape: ARRAY [*] OF LONGINT
  9034. *)
  9035. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  9036. BEGIN
  9037. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  9038. RETURN RESULT
  9039. END Reshape;
  9040. (* OLIVIER *)
  9041. (** creates a degenerated range from an integer.
  9042. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9043. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9044. **)
  9045. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9046. BEGIN RETURN (integer .. integer BY 1)
  9047. END RangeFromInteger;
  9048. (* OLIVIER *)
  9049. (** create an array with the same data but with more dimensions
  9050. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9051. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9052. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9053. e.g.:
  9054. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9055. performs the following type transformation:
  9056. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9057. **)
  9058. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9059. VAR
  9060. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9061. sourceADDRESS, targetADDRESS: ADDRESS;
  9062. targetArrayDescriptor: ANY;
  9063. BEGIN
  9064. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9065. targetDimensionality := LEN(keptDimensions, 0);
  9066. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9067. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9068. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9069. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9070. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9071. PutFlags(targetADDRESS, {TensorFlag});
  9072. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9073. (* set increments and lengths *)
  9074. sourceIndex := 0;
  9075. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9076. IF keptDimensions[targetIndex] THEN
  9077. (* reuse length and increment from source array *)
  9078. ASSERT(sourceIndex < DIM(sourceArray));
  9079. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9080. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9081. INC(sourceIndex)
  9082. ELSE
  9083. (* set length = 1 and increment = 0 *)
  9084. PutLen(targetADDRESS, targetIndex, 1);
  9085. PutInc(targetADDRESS, targetIndex, 0);
  9086. END
  9087. END;
  9088. (* Report("expand dimensions: ", targetADDRESS); *)
  9089. RETURN RESULT
  9090. END ExpandDimensions;
  9091. (* index ranges *)
  9092. (* the length of a range, i.e. the number of indices that it stands for *)
  9093. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9094. VAR
  9095. temp, result: SIZE;
  9096. BEGIN
  9097. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9098. (* invalid range *)
  9099. result := 0
  9100. ELSIF LAST(range) = MAX(LONGINT) THEN
  9101. (* open-ended range *)
  9102. result := MAX(LONGINT)
  9103. ELSE
  9104. temp := 1 + LAST(range) - FIRST(range);
  9105. result := temp DIV STEP(range);
  9106. IF (temp MOD STEP(range)) # 0 THEN
  9107. INC(result)
  9108. END
  9109. END;
  9110. RETURN result
  9111. END "LEN";
  9112. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  9113. BEGIN
  9114. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  9115. RETURN RESULT;
  9116. END "ALL";
  9117. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  9118. BEGIN
  9119. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  9120. RETURN RESULT;
  9121. END "ALL";
  9122. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  9123. BEGIN
  9124. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  9125. RETURN RESULT;
  9126. END "ALL";
  9127. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  9128. BEGIN
  9129. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  9130. RETURN RESULT;
  9131. END "ALL";
  9132. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  9133. BEGIN
  9134. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  9135. RETURN RESULT;
  9136. END "ALL";
  9137. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  9138. BEGIN
  9139. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  9140. RETURN RESULT;
  9141. END "ALL";
  9142. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  9143. BEGIN
  9144. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  9145. RETURN RESULT;
  9146. END "ALL";
  9147. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9148. BEGIN
  9149. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9150. RETURN RESULT;
  9151. END "ALL";
  9152. BEGIN
  9153. alloc := 0; NEW(temporary);
  9154. PutFlags(temporary,{TensorFlag});
  9155. PutDim(temporary, 0);
  9156. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9157. END FoxArrayBase.
  9158. Compiler.Compile FoxArrayBase.Mod ~
  9159. SystemTools.ListModules