ARM.FoxArrayBase.Mod 339 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. CONST
  23. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  24. statistics= FALSE;
  25. conservative=TRUE;
  26. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  27. AddressSize=SIZEOF(ADDRESS);
  28. MathPtrOffset=0*AddressSize;
  29. MathAdrOffset=1*AddressSize;
  30. MathFlagsOffset=2*AddressSize;
  31. MathDimOffset=3*AddressSize;
  32. MathElementSizeOffset=4*AddressSize;
  33. MathLenOffset=5*AddressSize;
  34. MathIncrOffset=6*AddressSize;
  35. GeometryMismatch = 400;
  36. DimensionMismatch=401;
  37. AllocationForbidden=402;
  38. ArrayAlignment=8;
  39. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  40. down = 0; up = 1; (* memory copy modes *)
  41. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  42. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  43. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  44. Size2Flag = 4; (* size = 2 *)
  45. Size3Flag = 5; (* size = 3 *)
  46. Size4Flag = 6; (* size = 4 *)
  47. Size5Flag = 7; (* size = 5 *)
  48. Size6Flag = 8; (* size = 6 *)
  49. Size7Flag = 9; (* size = 7 *)
  50. Size8Flag = 10; (* size = 8 *)
  51. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  52. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  53. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  54. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  55. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  56. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  57. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  58. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  59. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  60. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  61. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  62. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  63. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  64. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  65. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  66. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  67. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  68. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  69. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  70. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  71. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  72. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  73. TYPE
  74. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  75. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  76. LenInc* = RECORD
  77. len*: SIZE;
  78. inc*: SIZE
  79. END;
  80. ArrayDescriptor*= RECORD
  81. ptr*: ANY;
  82. adr*: ADDRESS;
  83. flags*: SET;
  84. dim*: SIZE;
  85. elementSize*: SIZE;
  86. END;
  87. Tensor = POINTER TO ArrayDescriptor;
  88. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  89. lens*: ARRAY 8 OF LenInc;
  90. END;
  91. A0 = RECORD(ArrayDescriptor) END;
  92. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  93. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  94. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  95. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  96. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  97. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  98. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  99. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  100. T0 = POINTER TO A0;
  101. T1 = POINTER TO A1;
  102. T2 = POINTER TO A2;
  103. T3 = POINTER TO A3;
  104. T4 = POINTER TO A4;
  105. T5 = POINTER TO A5;
  106. T6 = POINTER TO A6;
  107. T7 = POINTER TO A7;
  108. T8 = POINTER TO A8;
  109. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  110. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  111. VAR
  112. temporary*: T0;
  113. alloc*: LONGINT; (* statistics *)
  114. allocTemp*: LONGINT; (* statistics *)
  115. (* procedures that might be replaced by ASM methods *)
  116. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  117. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  118. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  119. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  120. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  121. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  122. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  123. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  124. transpose4*: TransposeP; transpose8*: TransposeP;
  125. (* optimizations for small arrays (Alexey Morozov) *)
  126. matMulR2x2*: SmallMatMul;
  127. matMulR3x3*: SmallMatMul;
  128. matMulR4x4*: SmallMatMul;
  129. matVecMulR2x2*: SmallMatMul;
  130. matVecMulR3x3*: SmallMatMul;
  131. matVecMulR4x4*: SmallMatMul;
  132. matMulLR2x2*: SmallMatMul;
  133. matMulLR3x3*: SmallMatMul;
  134. matMulLR4x4*: SmallMatMul;
  135. matVecMulLR2x2*: SmallMatMul;
  136. matVecMulLR3x3*: SmallMatMul;
  137. matVecMulLR4x4*: SmallMatMul;
  138. (*
  139. TensorTypePool: ARRAY 32 OF TensorType;
  140. *)
  141. PROCEDURE SetDefaults*; (* set standard procedures *)
  142. BEGIN
  143. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  144. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  145. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  146. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  147. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  148. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  149. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  150. loopIncMulAXSX := IncMulAXSXLoop;
  151. loopMatMulIncARAR := MatMulIncARARLoop;
  152. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  153. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  154. loopMulAZSZ := MulAZSZLoop;
  155. loopMulALZSLZ := MulALZSLZLoop;
  156. END SetDefaults;
  157. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  158. BEGIN
  159. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  160. END Err;
  161. (* get increment of dimension dim *)
  162. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  163. BEGIN{UNCHECKED}
  164. RETURN base.lens[dim].inc
  165. END GetIncr;
  166. (* set increment of dimension dim *)
  167. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  168. BEGIN{UNCHECKED}
  169. base.lens[dim].inc := val
  170. END PutInc;
  171. (* get length of dimension dim *)
  172. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  173. BEGIN{UNCHECKED}
  174. RETURN base.lens[dim].len
  175. END GetLen;
  176. (* set length of dimension dim *)
  177. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  178. BEGIN{UNCHECKED}
  179. base.lens[dim].len := val
  180. END PutLen;
  181. (* get data address *)
  182. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  183. BEGIN
  184. RETURN base.adr;
  185. END GetAdr;
  186. (* set data address *)
  187. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  188. BEGIN
  189. base.adr := value
  190. END PutAdr;
  191. PROCEDURE Align(value: ADDRESS): ADDRESS;
  192. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  193. END Align;
  194. (* get data base pointer (GC protection) *)
  195. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  196. BEGIN
  197. RETURN base.ptr;
  198. END GetPtr;
  199. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  200. BEGIN
  201. dest := src;
  202. END SafePut;
  203. (* set data base pointer (GC protection) *)
  204. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  205. BEGIN
  206. SafePut(base.ptr,value);
  207. END PutPtr;
  208. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  209. BEGIN
  210. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  211. END GetSize;
  212. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  213. BEGIN
  214. base.elementSize := val
  215. END PutSize;
  216. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  217. VAR dim: SIZE;
  218. BEGIN
  219. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  220. END GetDim;
  221. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  222. BEGIN
  223. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  224. END GetFlags;
  225. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  226. BEGIN
  227. base.dim := dim
  228. END PutDim;
  229. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  230. BEGIN
  231. base.flags := flags
  232. END PutFlags;
  233. (* report geometry of array passed via address s *)
  234. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  235. VAR i: SIZE; dim: SIZE;
  236. PROCEDURE Set( s: SET );
  237. VAR i: SIZE; first: BOOLEAN;
  238. BEGIN
  239. KernelLog.String( "{" ); first := TRUE;
  240. FOR i := 31 TO 0 BY -1 DO
  241. IF i IN s THEN
  242. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  243. KernelLog.Int( i, 1 );
  244. END;
  245. END;
  246. KernelLog.String( "}" );
  247. END Set;
  248. BEGIN
  249. KernelLog.String( name );
  250. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  251. ELSE
  252. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  253. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  254. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  255. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  256. KernelLog.Ln; dim := GetDim( s );
  257. IF dim > 32 THEN dim := 0 END;
  258. FOR i := 0 TO dim - 1 DO
  259. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  260. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  261. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  262. END;
  263. (*
  264. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  265. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  266. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  267. *)
  268. END;
  269. END Report;
  270. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  271. VAR (* t: TensorType; *) ptr: Tensor;
  272. p0: T0;
  273. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  274. BEGIN
  275. CASE dim OF
  276. |0: NEW(p0); ptr := p0;
  277. |1:NEW(p1); ptr := p1;
  278. |2:NEW(p2); ptr := p2;
  279. |3:NEW(p3); ptr := p3;
  280. |4:NEW(p4); ptr := p4;
  281. |5:NEW(p5); ptr := p5;
  282. |6:NEW(p6); ptr := p6;
  283. |7:NEW(p7); ptr := p7;
  284. |8:NEW(p8); ptr := p8;
  285. ELSE
  286. HALT(200)
  287. END;
  288. ptr.dim := dim;
  289. ptr.flags := {TensorFlag};
  290. RETURN ptr;
  291. END GetArrayDesc;
  292. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  293. BEGIN
  294. IF d = NIL THEN
  295. d := GetArrayDesc(dim);
  296. ELSIF d.dim # dim THEN
  297. IF ~(TensorFlag IN d.flags) &
  298. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  299. HALT( 100 );
  300. END;
  301. d := GetArrayDesc(dim)
  302. (* ELSE keep as is *)
  303. END;
  304. END EnsureArrayDesc;
  305. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  306. VAR reason: ARRAY 64 OF CHAR;
  307. BEGIN
  308. IF left # 0 THEN Report( "Source operand ", left ) END;
  309. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  310. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  311. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  312. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  313. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  314. ELSE reason := "unknown";
  315. END;
  316. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  317. HALT( 400 );
  318. END Halt;
  319. (** patterns ********************************************************************)
  320. (* find the largest block with a regular pattern of the form offset+{i*li: 0<=i<len}. d is dimension applying to the resulting loop *)
  321. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  322. BEGIN
  323. d := dim - 1; len := GetLen( left, d );
  324. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  325. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  326. linc := GetIncr( left, d ); DEC( d );
  327. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  328. len := len * GetLen( left, d ); DEC( d );
  329. END; (* find dimension where pattern does not work any more *)
  330. INC( d );
  331. IF debug THEN
  332. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  333. KernelLog.Ln;
  334. END;
  335. END FindPattern1;
  336. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  337. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  338. VAR d, len, linc, ri: SIZE );
  339. (* geometric precondition: lengths must coincide *)
  340. BEGIN
  341. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  342. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  343. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  344. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  345. len := len * GetLen( left, d ); DEC( d );
  346. END;
  347. INC( d );
  348. IF debug THEN
  349. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  350. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  351. END;
  352. END FindPattern2;
  353. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for three arrays simultaneously. d is dimension applying to the resulting loop *)
  354. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  355. VAR d, len, linc, ri, di: SIZE );
  356. (* geometric precondition: lengths must coincide *)
  357. BEGIN
  358. d := dim - 1; len := GetLen( left, d );
  359. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  360. END;
  361. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  362. DEC( d );
  363. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  364. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  365. len := len * GetLen( left, d ); DEC( d );
  366. END;
  367. INC( d );
  368. IF debug THEN
  369. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  370. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  371. END;
  372. END FindPattern3;
  373. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  374. VAR d, sl, sr: SIZE;
  375. BEGIN
  376. d := 0; sl := GetAdr( src );
  377. WHILE (d < dim) DO
  378. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  379. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  380. END;
  381. PutAdr( src, sl + sr );
  382. END Reverse;
  383. (* check if forward copy may be performed *)
  384. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  385. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  386. (* precondition: len(src,i)=len(dest,i) *)
  387. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  388. Sufficient (but not necessary) conditions:
  389. 1.) no overlap: src right < dest left or src left > dest right or
  390. 2.) same geometry and src left >= dest left
  391. same geometry if ginc(s)=ginc(d) with
  392. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  393. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  394. *)
  395. BEGIN
  396. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  397. dim := GetDim( src );
  398. WHILE (d < dim) DO
  399. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  400. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  401. END;
  402. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  403. ELSIF ((sr - sl) = (dr - dl)) THEN
  404. IF (sl = dl) THEN (* same memory region, both directions possible *)
  405. ELSIF (sl > dl) THEN
  406. EXCL( modes, down ) (* only copy up possible *)
  407. ELSE (*sl < dl*)
  408. EXCL( modes, up ) (* only copy down possible *)
  409. END;
  410. ELSE
  411. modes := modes - {down, up}; (* neither nor *)
  412. END;
  413. END CopyUpCompatible;
  414. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  415. Size: SIZE ): ANY;
  416. (* allocate a temporary block containing both descriptor and data *)
  417. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  418. BEGIN
  419. HALT(100);
  420. (*
  421. IF statistics THEN INC( allocTemp ) END;
  422. d := 0; len := Size; dim := GetDim( src );
  423. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  424. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  425. dest := SYSTEM.VAL( SIZE, p );
  426. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  427. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  428. FOR i := 0 TO dim - 1 DO
  429. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  430. len := len * GetLen( src, i );
  431. END;
  432. (* Report("allocdest",dest,dim); *)
  433. RETURN p;
  434. *)
  435. END AllocateTemp;
  436. (*** procedures to traverse arrays and apply operators *)
  437. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  438. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  439. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  440. origdest: ADDRESS; modes: SET;
  441. dest, left: ADDRESS; dim: SIZE;
  442. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  443. VAR len: SIZE; linc, dinc: SIZE;
  444. BEGIN
  445. IF dim = loopd THEN
  446. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  447. IF conservative THEN INC( glen, looplen ) END;
  448. ELSE
  449. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  450. dinc := GetIncr( dest, dim ); INC( dim );
  451. WHILE (len > 0) DO
  452. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  453. END;
  454. END;
  455. END Traverse;
  456. BEGIN
  457. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  458. origdest := 0; modes := {up, down};
  459. (* allocate destination, if necessary *)
  460. p := AllocateSame( dest, left, elementSize );
  461. IF p = NIL THEN
  462. CopyUpCompatible( dest, left, modes );
  463. IF up IN modes THEN (* nothing to be done *)
  464. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  465. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  466. END;
  467. END;
  468. (* allocate destination, if necessary *)
  469. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  470. ELSIF CheckGeometry( left, dest, dim )
  471. END; *)
  472. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  473. (* check pattern: longest piece that can be done with a loop *)
  474. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  475. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  476. IF up IN modes THEN (* nothing to be done *)
  477. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  478. ELSE CopyContent( origdest, dest, elementSize );
  479. END;
  480. SYSTEM.PUT( d, dest );
  481. IF d = p THEN (* new block *)
  482. Heaps.CheckAssignment(d,dest);
  483. END;
  484. END ApplyGenericUnaryAAOpS;
  485. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  486. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  487. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  488. origdest: SIZE; modes: SET;
  489. dest, left: ADDRESS; dim: SIZE;
  490. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  491. VAR len: SIZE; linc, dinc: SIZE;
  492. BEGIN
  493. IF dim = loopd THEN
  494. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  495. IF conservative THEN INC( glen, looplen ) END;
  496. ELSE
  497. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  498. dinc := GetIncr( dest, dim ); INC( dim );
  499. WHILE (len > 0) DO
  500. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  501. END;
  502. END;
  503. END Traverse;
  504. BEGIN
  505. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  506. origdest := 0; modes := {up, down};
  507. (* allocate destination, if necessary *)
  508. p := AllocateSame( dest, left, elementSize );
  509. IF p = NIL THEN
  510. CopyUpCompatible( dest, left, modes );
  511. IF up IN modes THEN (* nothing to be done *)
  512. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  513. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  514. END;
  515. END;
  516. (* allocate destination, if necessary *)
  517. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  518. ELSIF CheckGeometry( left, dest, dim )
  519. END; *)
  520. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  521. (* check pattern: longest piece that can be done with a loop *)
  522. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  523. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  524. IF up IN modes THEN (* nothing to be done *)
  525. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  526. ELSE CopyContent( origdest, dest, elementSize );
  527. END;
  528. SYSTEM.PUT( d, dest );
  529. IF d = p THEN (* new block *)
  530. Heaps.CheckAssignment(d,dest);
  531. END;
  532. END ApplyGenericUnaryAAOpI;
  533. (** apply unary operator to array: array SIZE -> array SIZE *)
  534. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  535. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  536. origdest: SIZE; modes: SET;
  537. dest, left: ADDRESS; dim: SIZE;
  538. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  539. VAR len: SIZE; linc, dinc: SIZE;
  540. BEGIN
  541. IF dim = loopd THEN
  542. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  543. IF conservative THEN INC( glen, looplen ) END;
  544. ELSE
  545. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  546. dinc := GetIncr( dest, dim ); INC( dim );
  547. WHILE (len > 0) DO
  548. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  549. END;
  550. END;
  551. END Traverse;
  552. BEGIN
  553. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  554. origdest := 0; modes := {up, down};
  555. (* allocate destination, if necessary *)
  556. p := AllocateSame( dest, left, elementSize );
  557. IF p = NIL THEN
  558. CopyUpCompatible( dest, left, modes );
  559. IF up IN modes THEN (* nothing to be done *)
  560. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  561. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  562. END;
  563. END;
  564. (* allocate destination, if necessary *)
  565. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  566. ELSIF CheckGeometry( left, dest, dim )
  567. END; *)
  568. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  569. (* check pattern: longest piece that can be done with a loop *)
  570. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  571. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  572. IF up IN modes THEN (* nothing to be done *)
  573. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  574. ELSE CopyContent( origdest, dest, elementSize );
  575. END;
  576. SYSTEM.PUT( d, dest );
  577. IF d = p THEN (* new block *)
  578. Heaps.CheckAssignment(d,dest);
  579. END;
  580. END ApplyGenericUnaryAAOpL;
  581. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  582. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  583. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  584. origdest: SIZE; modes: SET;
  585. VAR dest, left: ADDRESS; dim: SIZE;
  586. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  587. VAR len: SIZE; linc, dinc: SIZE;
  588. BEGIN
  589. IF dim = loopd THEN
  590. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  591. IF conservative THEN INC( glen, looplen ) END;
  592. ELSE
  593. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  594. dinc := GetIncr( dest, dim ); INC( dim );
  595. WHILE (len > 0) DO
  596. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  597. DEC( len );
  598. END;
  599. END;
  600. END Traverse;
  601. BEGIN
  602. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  603. origdest := 0; modes := {up, down};
  604. (* allocate destination, if necessary *)
  605. p := AllocateSame( dest, left, elementSize );
  606. IF p = NIL THEN
  607. CopyUpCompatible( dest, left, modes );
  608. IF up IN modes THEN (* nothing to be done *)
  609. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  610. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  611. END;
  612. END;
  613. (*
  614. (* allocate destination, if necessary *)
  615. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  616. ELSIF CheckGeometry( left, dest, dim )
  617. END;
  618. *)
  619. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  620. (* check pattern: longest piece that can be done with a loop *)
  621. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  622. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  623. IF up IN modes THEN (* nothing to be done *)
  624. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  625. ELSE CopyContent( origdest, dest, elementSize );
  626. END;
  627. SYSTEM.PUT( d, dest );
  628. IF d = p THEN (* new block *)
  629. Heaps.CheckAssignment(d,dest);
  630. END;
  631. END ApplyGenericUnaryAAOpH;
  632. (** apply unary operator to array: array REAL -> array REAL *)
  633. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  634. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  635. origdest: SIZE; modes: SET;
  636. dest, left: ADDRESS; dim: SIZE;
  637. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  638. VAR len: SIZE; linc, dinc: SIZE;
  639. BEGIN
  640. IF dim = loopd THEN
  641. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  642. IF conservative THEN INC( glen, looplen ) END;
  643. ELSE
  644. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  645. dinc := GetIncr( dest, dim ); INC( dim );
  646. WHILE (len > 0) DO
  647. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  648. END;
  649. END;
  650. END Traverse;
  651. BEGIN
  652. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  653. origdest := 0; modes := {up, down};
  654. (* allocate destination, if necessary *)
  655. p := AllocateSame( dest, left, elementSize );
  656. IF p = NIL THEN
  657. CopyUpCompatible( dest, left, modes );
  658. IF up IN modes THEN (* nothing to be done *)
  659. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  660. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  661. END;
  662. END;
  663. (* allocate destination, if necessary *)
  664. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  665. ELSIF CheckGeometry( left, dest, dim )
  666. END; *)
  667. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  668. (* check pattern: longest piece that can be done with a loop *)
  669. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  670. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  671. IF up IN modes THEN (* nothing to be done *)
  672. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  673. ELSE CopyContent( origdest, dest, elementSize );
  674. END;
  675. SYSTEM.PUT( d, dest );
  676. IF d = p THEN (* new block *)
  677. Heaps.CheckAssignment(d,dest);
  678. END;
  679. END ApplyGenericUnaryAAOpR;
  680. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  681. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  682. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  683. origdest: SIZE; modes: SET;
  684. dest, left: ADDRESS; dim: SIZE;
  685. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  686. VAR len: SIZE; linc, dinc: SIZE;
  687. BEGIN
  688. IF dim = loopd THEN
  689. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  690. IF conservative THEN INC( glen, looplen ) END;
  691. ELSE
  692. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  693. dinc := GetIncr( dest, dim ); INC( dim );
  694. WHILE (len > 0) DO
  695. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  696. DEC( len );
  697. END;
  698. END;
  699. END Traverse;
  700. BEGIN
  701. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  702. origdest := 0; modes := {up, down};
  703. (* allocate destination, if necessary *)
  704. p := AllocateSame( dest, left, elementSize );
  705. IF p = NIL THEN
  706. CopyUpCompatible( dest, left, modes );
  707. IF up IN modes THEN (* nothing to be done *)
  708. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  709. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  710. END;
  711. END;
  712. (*
  713. (* allocate destination, if necessary *)
  714. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  715. ELSIF CheckGeometry( left, dest, dim )
  716. END;
  717. *)
  718. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  719. (* check pattern: longest piece that can be done with a loop *)
  720. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  721. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  722. IF up IN modes THEN (* nothing to be done *)
  723. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  724. ELSE CopyContent( origdest, dest, elementSize );
  725. END;
  726. SYSTEM.PUT( d, dest );
  727. IF d = p THEN (* new block *)
  728. Heaps.CheckAssignment(d,dest);
  729. END;
  730. END ApplyGenericUnaryAAOpX;
  731. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  732. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  733. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  734. origdest: SIZE; modes: SET;
  735. dest, left: ADDRESS; dim: SIZE;
  736. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  737. VAR len: SIZE; linc, dinc: SIZE;
  738. BEGIN
  739. IF dim = loopd THEN
  740. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  741. IF conservative THEN INC( glen, looplen ) END;
  742. ELSE
  743. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  744. dinc := GetIncr( dest, dim ); INC( dim );
  745. WHILE (len > 0) DO
  746. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  747. DEC( len );
  748. END;
  749. END;
  750. END Traverse;
  751. BEGIN
  752. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  753. origdest := 0; modes := {up, down};
  754. (* allocate destination, if necessary *)
  755. p := AllocateSame( dest, left, elementSize );
  756. IF p = NIL THEN
  757. CopyUpCompatible( dest, left, modes );
  758. IF up IN modes THEN (* nothing to be done *)
  759. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  760. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  761. END;
  762. END;
  763. (*
  764. (* allocate destination, if necessary *)
  765. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  766. ELSIF CheckGeometry( left, dest, dim )
  767. END;
  768. *)
  769. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  770. (* check pattern: longest piece that can be done with a loop *)
  771. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  772. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  773. IF up IN modes THEN (* nothing to be done *)
  774. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  775. ELSE CopyContent( origdest, dest, elementSize );
  776. END;
  777. SYSTEM.PUT( d, dest );
  778. IF d = p THEN (* new block *)
  779. Heaps.CheckAssignment(d,dest);
  780. END;
  781. END ApplyGenericUnaryAAOpZ;
  782. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  783. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  784. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  785. origdest: SIZE; modes: SET;
  786. dest, left: ADDRESS; dim: SIZE;
  787. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  788. VAR len: SIZE; linc, dinc: SIZE;
  789. BEGIN
  790. IF dim = loopd THEN
  791. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  792. IF conservative THEN INC( glen, looplen ) END;
  793. ELSE
  794. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  795. dinc := GetIncr( dest, dim ); INC( dim );
  796. WHILE (len > 0) DO
  797. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  798. DEC( len );
  799. END;
  800. END;
  801. END Traverse;
  802. BEGIN
  803. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  804. origdest := 0; modes := {up, down};
  805. (* allocate destination, if necessary *)
  806. p := AllocateSame( dest, left, elementSize );
  807. IF p = NIL THEN
  808. CopyUpCompatible( dest, left, modes );
  809. IF up IN modes THEN (* nothing to be done *)
  810. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  811. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  812. END;
  813. END;
  814. (*
  815. (* allocate destination, if necessary *)
  816. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  817. ELSIF CheckGeometry( left, dest, dim )
  818. END;
  819. *)
  820. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  821. (* check pattern: longest piece that can be done with a loop *)
  822. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  823. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  824. IF up IN modes THEN (* nothing to be done *)
  825. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  826. ELSE CopyContent( origdest, dest, elementSize );
  827. END;
  828. SYSTEM.PUT( d, dest );
  829. IF d = p THEN (* new block *)
  830. Heaps.CheckAssignment(d,dest);
  831. END;
  832. END ApplyGenericUnaryAAOpLZ;
  833. (** apply unary operator to array: array -> array *)
  834. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  835. Loop: UnaryAALoop );
  836. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  837. origdest: SIZE; modes: SET;
  838. dest, left: ADDRESS; dim: SIZE;
  839. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  840. VAR len: SIZE; linc, dinc: SIZE;
  841. BEGIN
  842. IF dim = loopd THEN
  843. Loop( ladr, dadr, loopli, loopdi, looplen );
  844. IF conservative THEN INC( glen, looplen ) END;
  845. ELSE
  846. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  847. dinc := GetIncr( dest, dim ); INC( dim );
  848. WHILE (len > 0) DO
  849. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  850. DEC( len );
  851. END;
  852. END;
  853. END Traverse;
  854. BEGIN
  855. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  856. origdest := 0; modes := {up, down};
  857. (* allocate destination, if necessary *)
  858. p := AllocateSame( dest, left, elementSize );
  859. IF p = NIL THEN
  860. CopyUpCompatible( dest, left, modes );
  861. IF up IN modes THEN (* nothing to be done *)
  862. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  863. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  864. END;
  865. END;
  866. (*
  867. (* allocate destination, if necessary *)
  868. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  869. ELSIF CheckGeometry( left, dest, dim )
  870. END;
  871. *)
  872. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  873. (* check pattern: longest piece that can be done with a loop *)
  874. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  875. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  876. IF up IN modes THEN (* nothing to be done *)
  877. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  878. ELSE CopyContent( origdest, dest, elementSize );
  879. END;
  880. SYSTEM.PUT( d, dest );
  881. IF d = p THEN (* new block *)
  882. Heaps.CheckAssignment(d,dest);
  883. END;
  884. END ApplyUnaryAAOp;
  885. (** apply unary operator to array: array -> scalar *)
  886. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  887. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  888. VAR left: ADDRESS; dim: SIZE;
  889. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  890. VAR len: SIZE; linc: SIZE;
  891. BEGIN
  892. IF dim = loopd THEN
  893. Loop( ladr, dest, loopli, looplen );
  894. IF conservative THEN INC( glen, looplen ) END;
  895. ELSE
  896. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  897. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  898. END;
  899. END Traverse;
  900. BEGIN
  901. SYSTEM.GET( l, left ); dim := GetDim( left );
  902. IF debug THEN Report( "AS: left", left ); END;
  903. (* check pattern: longest piece that can be done with a loop *)
  904. IF conservative THEN glen := 0 END;
  905. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  906. IF conservative THEN
  907. looplen := 1;
  908. WHILE (dim > 0) DO
  909. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  910. END;
  911. ASSERT( looplen = glen );
  912. END;
  913. END ApplyUnaryASOp;
  914. (** apply unary operator to array: scalar -> array *)
  915. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  916. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  917. VAR dest: ADDRESS; dim: SIZE;
  918. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  919. VAR len: SIZE; dinc: SIZE;
  920. BEGIN
  921. IF dim = loopd THEN
  922. Loop( right, dadr, loopdi, looplen );
  923. IF conservative THEN INC( glen, looplen ) END;
  924. ELSE
  925. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  926. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  927. END;
  928. END Traverse;
  929. BEGIN
  930. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  931. IF debug THEN Report( "AS: dest", dest ); END;
  932. (* check pattern: longest piece that can be done with a loop *)
  933. IF conservative THEN glen := 0 END;
  934. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  935. IF conservative THEN
  936. looplen := 1;
  937. WHILE (dim > 0) DO
  938. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  939. END;
  940. ASSERT( looplen = glen );
  941. END;
  942. END ApplyUnarySAOp;
  943. (** apply binary operator : array x array -> array *)
  944. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  945. Loop: BinaryAAALoop );
  946. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  947. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  948. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  949. VAR len: SIZE; linc, rinc, dinc: SIZE;
  950. BEGIN
  951. IF dim = loopd THEN
  952. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  953. IF conservative THEN INC( glen, looplen ) END;
  954. ELSE
  955. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  956. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  957. WHILE (len > 0) DO
  958. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  959. INC( dadr, dinc ); DEC( len );
  960. END;
  961. END;
  962. END Traverse;
  963. BEGIN
  964. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  965. (* allocate destination, if necessary *)
  966. IF ~SameShape( left, right ) THEN
  967. Halt( GeometryMismatch, left, right, 0 )
  968. END;
  969. origdest := 0; modes := {up, down};
  970. p := AllocateSame( dest, left, elementSize );
  971. IF p = NIL THEN
  972. CopyUpCompatible( dest, left, modes );
  973. CopyUpCompatible( dest, right, modes );
  974. IF up IN modes THEN (* nothing to be done *)
  975. ELSIF down IN modes THEN
  976. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  977. ELSE
  978. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  979. END;
  980. END;
  981. (* debugging *)
  982. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  983. (* check pattern: longest piece that can be done with a loop *)
  984. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  985. (* run through dimensions *)
  986. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  987. IF up IN modes THEN (* nothing to be done *)
  988. ELSIF down IN modes THEN
  989. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  990. ELSE CopyContent( origdest, dest, elementSize );
  991. END;
  992. SYSTEM.PUT( d, dest );
  993. IF d = p THEN (* new block *)
  994. Heaps.CheckAssignment(d,dest);
  995. END;
  996. END ApplyBinaryAAAOp;
  997. (** apply binary operator: array x scalar -> array *)
  998. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  999. elementSize: SIZE;
  1000. Loop: BinaryASALoop );
  1001. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1002. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1003. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1004. VAR len: SIZE; linc, dinc: SIZE;
  1005. BEGIN
  1006. IF dim = loopd THEN
  1007. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1008. IF conservative THEN INC( glen, looplen ) END;
  1009. ELSE
  1010. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1011. dinc := GetIncr( dest, dim ); INC( dim );
  1012. WHILE (len > 0) DO
  1013. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1014. DEC( len );
  1015. END;
  1016. END;
  1017. END Traverse;
  1018. BEGIN
  1019. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1020. (* allocate destination, if necessary *)
  1021. origdest := 0; modes := {up, down};
  1022. p := AllocateSame( dest, left, elementSize );
  1023. IF p = NIL THEN
  1024. CopyUpCompatible( dest, left, modes );
  1025. IF up IN modes THEN (* nothing to be done *)
  1026. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1027. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1028. END;
  1029. END;
  1030. (* debugging *)
  1031. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1032. (* check pattern: longest piece that can be done with a loop *)
  1033. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1034. (* run through dimensions *)
  1035. IF conservative THEN glen := 0 END;
  1036. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1037. IF conservative THEN
  1038. looplen := 1;
  1039. WHILE (dim > 0) DO
  1040. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1041. END;
  1042. ASSERT( looplen = glen );
  1043. END;
  1044. IF up IN modes THEN (* nothing to be done *)
  1045. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1046. ELSE CopyContent( origdest, dest, elementSize );
  1047. END;
  1048. SYSTEM.PUT( d, dest );
  1049. IF d = p THEN (* new block *)
  1050. Heaps.CheckAssignment(d,dest);
  1051. END;
  1052. END ApplyBinaryASAOp;
  1053. (** apply binary operator: array x array -> scalar *)
  1054. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1055. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1056. left, right: ADDRESS; dim: SIZE;
  1057. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1058. VAR len: SIZE; linc, rinc: SIZE;
  1059. BEGIN
  1060. IF dim = loopd THEN
  1061. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1062. IF conservative THEN INC( glen, looplen ) END;
  1063. ELSE
  1064. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1065. rinc := GetIncr( right, dim ); INC( dim );
  1066. WHILE (len > 0) DO
  1067. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1068. DEC( len );
  1069. END;
  1070. END;
  1071. END Traverse;
  1072. BEGIN
  1073. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1074. (* check array lengths *)
  1075. IF ~SameShape( left, right ) THEN
  1076. Halt( GeometryMismatch, left, right, 0 )
  1077. END;
  1078. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1079. (* check pattern: longest piece that can be done with a loop *)
  1080. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1081. (* run through dimensions *)
  1082. IF conservative THEN glen := 0 END;
  1083. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1084. IF conservative THEN
  1085. looplen := 1;
  1086. WHILE (dim > 0) DO
  1087. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1088. END;
  1089. ASSERT( looplen = glen );
  1090. END;
  1091. END ApplyBinaryAASOp;
  1092. (** special binary operator: array x array -> boolean *)
  1093. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1094. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1095. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1096. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1097. VAR len: SIZE; linc, rinc: SIZE;
  1098. BEGIN
  1099. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1100. ELSE
  1101. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1102. rinc := GetIncr( right, dim ); INC( dim );
  1103. WHILE (len > 0) DO
  1104. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1105. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1106. END;
  1107. RETURN TRUE;
  1108. END;
  1109. END Traverse;
  1110. BEGIN
  1111. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1112. (* check array lengths *)
  1113. IF ~SameShape( left, right ) THEN
  1114. RETURN geometryMismatchDefault
  1115. END;
  1116. (* is destination already allocated? (might be a temporary result) *)
  1117. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1118. (* check pattern: longest piece that can be done with a loop *)
  1119. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1120. (* run through dimensions *)
  1121. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1122. END ApplyBinaryAABOp;
  1123. (** special binary operator: array x scalar -> boolean *)
  1124. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1125. Loop: BinaryASBLoop ): BOOLEAN;
  1126. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1127. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1128. VAR len: SIZE; linc: SIZE;
  1129. BEGIN
  1130. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1131. ELSE
  1132. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1133. WHILE (len > 0) DO
  1134. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1135. INC( ladr, linc ); DEC( len );
  1136. END;
  1137. RETURN TRUE;
  1138. END;
  1139. END Traverse;
  1140. BEGIN
  1141. SYSTEM.GET( l, left ); dim := GetDim( left );
  1142. IF debug THEN Report( "AAB:left", left ); END;
  1143. (* check pattern: longest piece that can be done with a loop *)
  1144. FindPattern1( left, dim, loopd, looplen, loopli );
  1145. (* run through dimensions *)
  1146. RETURN Traverse( 0, GetAdr( left ) );
  1147. END ApplyBinaryASBOp;
  1148. (**** operators *)
  1149. (*** copy *)
  1150. PROCEDURE Copy4( ladr, dadr, linc, dinc, len: LONGINT );
  1151. CODE
  1152. LDR R0, [FP, #len] ; R0 := len
  1153. LDR R1, [FP, #ladr] ; R1 := ladr
  1154. LDR R2, [FP, #dadr] ; R2 := dadr
  1155. LDR R3, [FP, #linc] ; R3 := linc
  1156. LDR R4, [FP, #dinc] ; R4 := dinc
  1157. loop:
  1158. CMP R0, #0
  1159. BEQ end ; while R0 > 0 do
  1160. LDR R5, [R1, #0] ; R5 := get(R1)
  1161. STR R5, [R2, #0] ; put(R2, R5)
  1162. ADD R1, R1, R3 ; INC(R1, R3)
  1163. ADD R2, R2, R4 ; INC(R2, R4)
  1164. B loop ; end
  1165. end:
  1166. END Copy4;
  1167. PROCEDURE Copy2( ladr, dadr, linc, dinc, len: LONGINT );
  1168. CODE
  1169. LDR R0, [FP, #len] ; R0 := len
  1170. LDR R1, [FP, #ladr] ; R1 := ladr
  1171. LDR R2, [FP, #dadr] ; R2 := dadr
  1172. LDR R3, [FP, #linc] ; R3 := linc
  1173. LDR R4, [FP, #dinc] ; R4 := dinc
  1174. loop:
  1175. CMP R0, #0
  1176. BEQ end ; while R0 > 0 do
  1177. LDRH R5, [R1, #0] ; R5 := get(R1)
  1178. STRH R5, [R2, #0] ; put(R2, R5)
  1179. ADD R1, R1, R3 ; INC(R1, R3)
  1180. ADD R2, R2, R4 ; INC(R2, R4)
  1181. B loop ; end
  1182. end:
  1183. END Copy2;
  1184. PROCEDURE Copy1( ladr, dadr, linc, dinc, len: LONGINT );
  1185. CODE
  1186. LDR R0, [FP, #len] ; R0 := len
  1187. LDR R1, [FP, #ladr] ; R1 := ladr
  1188. LDR R2, [FP, #dadr] ; R2 := dadr
  1189. LDR R3, [FP, #linc] ; R3 := linc
  1190. LDR R4, [FP, #dinc] ; R4 := dinc
  1191. loop:
  1192. CMP R0, #0
  1193. BEQ end ; while R0 > 0 do
  1194. LDRB R5, [R1, #0] ; R5 := get(R1)
  1195. STRB R5, [R2, #0] ; put(R2, R5)
  1196. ADD R1, R1, R3 ; INC(R1, R3)
  1197. ADD R2, R2, R4 ; INC(R2, R4)
  1198. B loop ; end
  1199. end:
  1200. END Copy1;
  1201. PROCEDURE Copy8( ladr, dadr, linc, dinc, len: LONGINT );
  1202. CODE
  1203. LDR R0, [FP, #len] ; R0 := len
  1204. LDR R1, [FP, #ladr] ; R1 := ladr
  1205. LDR R2, [FP, #dadr] ; R2 := dadr
  1206. LDR R3, [FP, #linc] ; R3 := linc
  1207. LDR R4, [FP, #dinc] ; R4 := dinc
  1208. loop:
  1209. CMP R0, #0
  1210. BEQ end ; while R0 > 0 do
  1211. LDR R5, [R1, #0] ; R5 := get(R1)
  1212. LDR R6, [R1, #4] ; R6 := get(R1 + 4)
  1213. STR R5, [R2, #0] ; put(R2, R5)
  1214. STR R6, [R2, #4] ; put(R2 + 4, R6)
  1215. ADD R1, R1, R3 ; INC(R1, R3)
  1216. ADD R2, R2, R4 ; INC(R2, R4)
  1217. B loop ; end
  1218. end:
  1219. END Copy8;
  1220. (** Correct move if overlap, might be important for some array operations,
  1221. do not use SYSTEM.MOVE. *)
  1222. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1223. CODE
  1224. LDR R0, [SP, #len]
  1225. LDR R1, [SP, #srcadr]
  1226. LDR R2, [SP, #destadr]
  1227. ADD SP, SP, #12
  1228. CMP R1, R2
  1229. BHI moveup ; srcadr > destadr -> moving up
  1230. ADD R3, R1, R0
  1231. CMP R3, R2
  1232. BLO moveup ; srcadr + len < destadr -> moving up
  1233. ; Moving down
  1234. ADD R2, R2, R0
  1235. movedown:
  1236. CMP R0, #0
  1237. BEQ end
  1238. LDRB R4, [R2, #0]
  1239. STRB R4, [R3, #0]
  1240. SUB R2, R2, #1
  1241. SUB R3, R3, #1
  1242. SUB R0, R0, #1
  1243. B movedown
  1244. moveup:
  1245. CMP R0, #0
  1246. BEQ end
  1247. LDRB R4, [R1, #0]
  1248. STRB R4, [R2, #0]
  1249. ADD R1, R1, #1
  1250. ADD R2, R2, #1
  1251. SUB R0, R0, #1
  1252. B moveup
  1253. end:
  1254. END MoveB;
  1255. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1256. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1257. origdest: ADDRESS; modes: SET; dim: SIZE;
  1258. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1259. BEGIN
  1260. IF (dinc = elementSize) & (linc = elementSize) THEN
  1261. MoveB( ladr, dadr, len * elementSize );
  1262. (*
  1263. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1264. *)
  1265. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1266. len := len * elementSize;
  1267. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1268. ELSIF elementSize = 1 THEN
  1269. Copy1( ladr, dadr, linc, dinc, len );
  1270. (*
  1271. WHILE (len > 0) DO
  1272. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1273. END;
  1274. *)
  1275. ELSIF elementSize = 2 THEN
  1276. Copy2( ladr, dadr, linc, dinc, len );
  1277. (*
  1278. WHILE (len > 0) DO
  1279. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1280. END;
  1281. *)
  1282. ELSIF elementSize = 4 THEN
  1283. Copy4( ladr, dadr, linc, dinc, len );
  1284. (*
  1285. WHILE (len > 0) DO
  1286. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1287. END;
  1288. *)
  1289. ELSIF elementSize = 8 THEN
  1290. Copy8( ladr, dadr, linc, dinc, len );
  1291. (*
  1292. WHILE (len > 0) DO
  1293. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1294. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1295. INC( dadr, dinc );
  1296. END;
  1297. *)
  1298. ELSE (* SYSTEM.MOVE is expensive ! *)
  1299. WHILE (len > 0) DO
  1300. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1301. INC( dadr, dinc );
  1302. END;
  1303. END;
  1304. END Loop;
  1305. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1306. VAR len: SIZE; linc, dinc: SIZE;
  1307. BEGIN
  1308. IF dim = loopd THEN
  1309. Loop( ladr, dadr, loopli, loopdi, looplen );
  1310. IF conservative THEN INC( glen, looplen ) END;
  1311. ELSE
  1312. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1313. dinc := GetIncr( dest, dim ); INC( dim );
  1314. WHILE (len > 0) DO
  1315. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1316. DEC( len );
  1317. END;
  1318. END;
  1319. END Traverse;
  1320. BEGIN
  1321. dim := GetDim( src );
  1322. origdest := 0; modes := {up, down}; (* copy modes *)
  1323. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1324. CopyUpCompatible( dest, src, modes );
  1325. IF up IN modes THEN (* nothing to be done *)
  1326. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1327. Reverse( src, dim ); Reverse( dest, dim )
  1328. ELSE (* can only copy via double buffer *)
  1329. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1330. END;
  1331. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1332. END;
  1333. (* check pattern: longest piece that can be done with a loop *)
  1334. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1335. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1336. IF up IN modes THEN (* nothing to be done *)
  1337. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1338. ELSE CopyContent( origdest, dest, elementSize );
  1339. END;
  1340. END CopyContent;
  1341. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  1342. VAR ptr, data: ANY; Size: SIZE;
  1343. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1344. PROCEDURE NewData;
  1345. VAR dim, len, size: SIZE;
  1346. BEGIN
  1347. dim := GetDim( src ); size := elementsize;
  1348. PutDim( dest, dim );
  1349. PutSize( dest, elementsize );
  1350. WHILE (dim > 0) DO
  1351. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1352. PutInc( dest, dim, size ); size := size * len;
  1353. END;
  1354. SYSTEM.NEW( data, size + ArrayAlignment);
  1355. PutAdr( dest, Align(data));
  1356. PutPtr( dest, data );
  1357. END NewData;
  1358. BEGIN
  1359. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1360. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1361. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1362. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1363. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1364. PutFlags(dest, {TensorFlag});
  1365. NewData(); RETURN ptr;
  1366. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1367. (* check if re-allocation of descriptor is allowed *)
  1368. IF ~(TensorFlag IN GetFlags( dest )) &
  1369. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1370. HALT( 100 );
  1371. END;
  1372. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1373. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1374. PutFlags(dest, {TensorFlag});
  1375. NewData();
  1376. RETURN ptr;
  1377. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1378. (* check if re-allocation of array data is allowed *)
  1379. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1380. HALT( 100 );
  1381. END;
  1382. NewData();
  1383. RETURN data;
  1384. ELSE (* nothing to do *)
  1385. RETURN NIL;
  1386. END;
  1387. END AllocateSame;
  1388. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1389. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1390. BEGIN
  1391. dim := GetDim(src);
  1392. p := GetArrayDesc(dim);
  1393. adr := p;
  1394. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1395. PutAdr( src, 0 );
  1396. PutPtr( src, NIL );
  1397. PutFlags( src, {} );
  1398. RETURN p;
  1399. END TempDescCopy;
  1400. (* used when arrays are passed by value *)
  1401. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: SIZE );
  1402. VAR p: ANY;
  1403. BEGIN
  1404. ASSERT( src = dest );
  1405. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1406. CopyArray( dest, p, elementsize );
  1407. END CopyArraySelf;
  1408. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1409. VAR p: ANY; srcdim, destdim: SIZE;
  1410. BEGIN
  1411. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1412. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1413. srcdim := GetDim(src);
  1414. destdim := GetDim(dest);
  1415. (*
  1416. Debugging.Stack("copy array");
  1417. *)
  1418. Report( "copy array source", src ); Report( "copy array des", dest );
  1419. HALT(100);
  1420. ELSIF src = dest THEN (* self copy *)
  1421. CopyArraySelf( dest, src, elementsize );
  1422. ELSE
  1423. p := AllocateSame( dest, src, elementsize );
  1424. CopyContent( dest, src, elementsize )
  1425. END;
  1426. END CopyArray;
  1427. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1428. BEGIN
  1429. dest := 0; CopyTensor( dest, src, elementsize );
  1430. END CopyTensorSelf;
  1431. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1432. elementsize: SIZE );
  1433. VAR p: ANY;
  1434. BEGIN
  1435. (* Report("dest",dest); Report("src",src); *)
  1436. IF (src = NIL) THEN dest := NIL
  1437. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1438. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1439. CopyContent( dest, src, elementsize );
  1440. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1441. ELSE CopyContent( dest, src, elementsize )
  1442. END;
  1443. END CopyTensor;
  1444. (* copy descriptor of src to that of dest. If not existent then create.*)
  1445. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS): ANY;
  1446. VAR ptr: ANY; flags: SET;
  1447. PROCEDURE CopyDescriptor;
  1448. BEGIN
  1449. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1450. PutPtr(dest, GetPtr(src)); (* GC! *)
  1451. END CopyDescriptor;
  1452. BEGIN
  1453. (*
  1454. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1455. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1456. *)
  1457. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1458. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1459. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1460. CopyDescriptor();
  1461. PutFlags(dest, {TensorFlag});
  1462. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1463. flags := GetFlags(dest);
  1464. (* check if re-allocation of descriptor is allowed *)
  1465. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1466. Halt(DimensionMismatch,src,0,dest);
  1467. END;
  1468. (* create a new descriptor!!! (added by Alexey) *)
  1469. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1470. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1471. CopyDescriptor();
  1472. PutFlags(dest, flags);
  1473. ELSE
  1474. flags := GetFlags(dest);
  1475. (* check if re-allocation of array data is allowed *)
  1476. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1477. Halt(AllocationForbidden,src,0,dest);
  1478. END;
  1479. CopyDescriptor();
  1480. PutFlags(dest, flags);
  1481. END;
  1482. RETURN ptr;
  1483. END ShallowCopy;
  1484. (*
  1485. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1486. BEGIN
  1487. IF debug THEN
  1488. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1489. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1490. END;
  1491. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1492. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1493. END DescriptorCopy;
  1494. *)
  1495. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1496. VAR p: ANY; s,d: ADDRESS;
  1497. BEGIN
  1498. s := SYSTEM.VAL(ADDRESS,src);
  1499. d := SYSTEM.VAL(ADDRESS,dest);
  1500. p := ShallowCopy(d,s);
  1501. SYSTEM.PUT(ADDRESSOF(dest),d);
  1502. IF p = d THEN
  1503. Heaps.CheckAssignment(ADDRESS OF dest, p);
  1504. END;
  1505. END ZeroCopy;
  1506. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1507. BEGIN
  1508. ZeroCopy(src, RESULT);
  1509. RETURN RESULT
  1510. END "ALIAS";
  1511. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1512. VAR dim: SIZE;
  1513. BEGIN
  1514. dim := GetDim( l );
  1515. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1516. WHILE (dim > 0) DO
  1517. DEC( dim );
  1518. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1519. END;
  1520. RETURN TRUE;
  1521. END SameShape;
  1522. (*
  1523. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1524. (*
  1525. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1526. check if deep copy can be avoided and if so then do a shallow copy
  1527. *)
  1528. BEGIN
  1529. ASSERT( dest # 0 ); (* impossible *)
  1530. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1531. HALT( 100 );
  1532. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1533. (* must copy (and allocate) *)
  1534. CopyArray( dest, src, elementsize );
  1535. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1536. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1537. ELSE CopyContent( dest, src, elementsize )
  1538. END;
  1539. ELSE DescriptorCopy( src, dest )
  1540. END;
  1541. END ZeroCopyArray;
  1542. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1543. (*
  1544. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1545. check if deep copy can be avoided and if so then do a shallow copy
  1546. *)
  1547. BEGIN
  1548. IF debug THEN
  1549. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1550. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1551. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1552. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1553. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1554. END;
  1555. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1556. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1557. ELSE
  1558. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1559. END;
  1560. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1561. (* must copy (and allocate) *)
  1562. CopyTensor( dest, src, elementsize );
  1563. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1564. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1565. ELSE
  1566. HALT( 100 ); (* copy forbidden *)
  1567. END;
  1568. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1569. DescriptorCopy( src, dest );
  1570. ELSE
  1571. HALT( 100 ); (* different shapes: not allowed *)
  1572. END;
  1573. END ZeroCopyTensor;
  1574. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1575. VAR i: LONGINT;
  1576. BEGIN
  1577. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1578. CopyContent( dest, left, elementSize )
  1579. ELSE
  1580. IF debug THEN
  1581. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1582. KernelLog.Ln;
  1583. END;
  1584. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1585. FOR i := 0 TO dim - 1 DO
  1586. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1587. END;
  1588. END;
  1589. END ZeroCopy;
  1590. *)
  1591. (*** conversions ****)
  1592. (** SHORTINT -> INTEGER *)
  1593. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1594. BEGIN
  1595. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1596. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1597. DEC( len );
  1598. END;
  1599. END ConvertASAILoop;
  1600. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1601. BEGIN
  1602. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1603. RETURN RESULT
  1604. END "@Convert";
  1605. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1606. BEGIN
  1607. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1608. RETURN RESULT
  1609. END "LONG";
  1610. (** SHORTINT -> LONGINT *)
  1611. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1612. BEGIN
  1613. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1614. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1615. DEC( len );
  1616. END;
  1617. END ConvertLoopSL;
  1618. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1619. BEGIN
  1620. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1621. RETURN RESULT
  1622. END "@Convert";
  1623. (** SHORTINT -> REAL *)
  1624. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1625. VAR lval: SHORTINT; dval: REAL;
  1626. BEGIN
  1627. WHILE (len > 0) DO
  1628. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1629. INC( dadr, dinc ); DEC( len );
  1630. END;
  1631. END ConvertLoopSR;
  1632. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1633. BEGIN
  1634. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1635. RETURN RESULT
  1636. END "@Convert";
  1637. (** SHORTINT -> LONGREAL *)
  1638. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1639. VAR lval: SHORTINT; dval: LONGREAL;
  1640. BEGIN
  1641. WHILE (len > 0) DO
  1642. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1643. INC( dadr, dinc ); DEC( len );
  1644. END;
  1645. END ConvertLoopSX;
  1646. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1647. BEGIN
  1648. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1649. RETURN RESULT
  1650. END "@Convert";
  1651. (** INTEGER -> SHORTINT (SHORT) *)
  1652. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1653. VAR lval: INTEGER; dval: SHORTINT;
  1654. BEGIN
  1655. WHILE (len > 0) DO
  1656. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1657. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1658. END;
  1659. END ConvertLoopIS;
  1660. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1661. BEGIN
  1662. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1663. RETURN RESULT
  1664. END "@Convert";
  1665. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1666. BEGIN
  1667. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1668. RETURN RESULT
  1669. END "SHORT";
  1670. (** INTEGER -> LONGINT *)
  1671. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1672. BEGIN
  1673. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1674. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1675. DEC( len );
  1676. END;
  1677. END ConvertLoopIL;
  1678. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1679. BEGIN
  1680. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1681. RETURN RESULT
  1682. END "@Convert";
  1683. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1684. BEGIN
  1685. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1686. RETURN RESULT
  1687. END "LONG";
  1688. (** INTEGER -> REAL *)
  1689. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1690. VAR lval: INTEGER; dval: REAL;
  1691. BEGIN
  1692. WHILE (len > 0) DO
  1693. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1694. INC( dadr, dinc ); DEC( len );
  1695. END;
  1696. END ConvertLoopIR;
  1697. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1698. BEGIN
  1699. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1700. RETURN RESULT
  1701. END "@Convert";
  1702. (** INTEGER -> LONGREAL *)
  1703. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1704. VAR lval: INTEGER; dval: LONGREAL;
  1705. BEGIN
  1706. WHILE (len > 0) DO
  1707. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1708. INC( dadr, dinc ); DEC( len );
  1709. END;
  1710. END ConvertLoopIX;
  1711. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1712. BEGIN
  1713. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1714. RETURN RESULT
  1715. END "@Convert";
  1716. (** LONGINT -> INTEGER (SHORT) *)
  1717. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1718. VAR lval: LONGINT; dval: INTEGER;
  1719. BEGIN
  1720. WHILE (len > 0) DO
  1721. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1722. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1723. END;
  1724. END ConvertLoopLI;
  1725. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1726. BEGIN
  1727. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1728. RETURN RESULT
  1729. END "@Convert";
  1730. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1731. BEGIN
  1732. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1733. RETURN RESULT
  1734. END "SHORT";
  1735. (** LONGINT -> REAL *)
  1736. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1737. VAR lval: LONGINT; dval: REAL;
  1738. BEGIN
  1739. WHILE (len > 0) DO
  1740. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1741. INC( dadr, dinc ); DEC( len );
  1742. END;
  1743. END ConvertLoopLR;
  1744. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1745. BEGIN
  1746. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1747. RETURN RESULT
  1748. END "@Convert";
  1749. (** LONGINT -> LONGREAL *)
  1750. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1751. VAR lval: LONGINT; dval: LONGREAL;
  1752. BEGIN
  1753. WHILE (len > 0) DO
  1754. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1755. INC( dadr, dinc ); DEC( len );
  1756. END;
  1757. END ConvertLoopLX;
  1758. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1759. BEGIN
  1760. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1761. RETURN RESULT
  1762. END "@Convert";
  1763. (** REAL -> LONGINT (ENTIER) *)
  1764. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1765. VAR lval: REAL; dval: LONGINT;
  1766. BEGIN
  1767. WHILE (len > 0) DO
  1768. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1769. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1770. END;
  1771. END ConvertLoopRL;
  1772. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1773. BEGIN
  1774. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1775. RETURN RESULT
  1776. END "@Convert";
  1777. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1778. BEGIN
  1779. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1780. RETURN RESULT
  1781. END "ENTIER";
  1782. (** REAL -> LONGREAL *)
  1783. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1784. VAR lval: REAL; dval: LONGREAL;
  1785. BEGIN
  1786. WHILE (len > 0) DO
  1787. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1788. INC( dadr, dinc ); DEC( len );
  1789. END;
  1790. END ConvertLoopRX;
  1791. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1792. BEGIN
  1793. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1794. RETURN RESULT
  1795. END "@Convert";
  1796. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1797. BEGIN
  1798. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1799. RETURN RESULT
  1800. END "LONG";
  1801. (** LONGREAL -> REAL (SHORT) *)
  1802. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1803. VAR lval: LONGREAL; dval: REAL;
  1804. BEGIN
  1805. WHILE (len > 0) DO
  1806. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1807. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1808. END;
  1809. END ConvertLoopXR;
  1810. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1811. BEGIN
  1812. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1813. RETURN RESULT
  1814. END "@Convert";
  1815. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1816. BEGIN
  1817. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1818. RETURN RESULT
  1819. END "SHORT";
  1820. (** LONGREAL -> LONGINT (ENTIER) *)
  1821. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1822. VAR lval: LONGREAL; dval: LONGINT;
  1823. BEGIN
  1824. WHILE (len > 0) DO
  1825. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1826. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1827. END;
  1828. END ConvertLoopXL;
  1829. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1830. BEGIN
  1831. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1832. RETURN RESULT
  1833. END "@Convert";
  1834. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1835. BEGIN
  1836. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1837. RETURN RESULT
  1838. END "ENTIER";
  1839. (*** monadic not A -> ~A ********************************************************************)
  1840. (** BOOLEAN *)
  1841. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1842. VAR lval: BOOLEAN;
  1843. BEGIN
  1844. WHILE (len > 0) DO
  1845. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1846. DEC( len );
  1847. END;
  1848. END NotLoopAB;
  1849. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1850. BEGIN
  1851. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1852. RETURN RESULT
  1853. END "~";
  1854. (*** monadic generic (A) -> -A ********************************************************************)
  1855. (** SHORTINT *)
  1856. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1857. VAR lval: SHORTINT;
  1858. BEGIN
  1859. WHILE (len > 0) DO
  1860. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1861. DEC( len );
  1862. END;
  1863. END GenericLoopS;
  1864. (** INTEGER *)
  1865. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1866. VAR lval: INTEGER;
  1867. BEGIN
  1868. WHILE (len > 0) DO
  1869. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1870. DEC( len );
  1871. END;
  1872. END GenericLoopI;
  1873. (** LONGINT *)
  1874. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1875. VAR lval: LONGINT;
  1876. BEGIN
  1877. WHILE (len > 0) DO
  1878. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1879. DEC( len );
  1880. END;
  1881. END GenericLoopL;
  1882. (** HUGEINT *)
  1883. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1884. VAR lval: HUGEINT;
  1885. BEGIN
  1886. WHILE (len > 0) DO
  1887. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1888. DEC( len );
  1889. END;
  1890. END GenericLoopH;
  1891. (** REAL *)
  1892. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1893. VAR lval: REAL;
  1894. BEGIN
  1895. WHILE (len > 0) DO
  1896. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1897. DEC( len );
  1898. END;
  1899. END GenericLoopR;
  1900. (** LONGREAL *)
  1901. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1902. VAR lval: LONGREAL;
  1903. BEGIN
  1904. WHILE (len > 0) DO
  1905. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1906. DEC( len );
  1907. END;
  1908. END GenericLoopX;
  1909. (** COMPLEX *)
  1910. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1911. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1912. BEGIN
  1913. WHILE (len > 0) DO
  1914. lval := ladr;
  1915. dval := dadr;
  1916. dval.val := op(lval.val);
  1917. INC( ladr, linc ); INC( dadr, dinc );
  1918. DEC( len );
  1919. END;
  1920. END GenericLoopZ;
  1921. (** LONGCOMPLEX *)
  1922. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1923. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1924. BEGIN
  1925. WHILE (len > 0) DO
  1926. lval := ladr;
  1927. dval := dadr;
  1928. dval.val := op (lval.val);
  1929. INC( ladr, linc ); INC( dadr, dinc );
  1930. DEC( len );
  1931. END;
  1932. END GenericLoopLZ;
  1933. (*** monadic minus A -> -A ********************************************************************)
  1934. (** SHORTINT *)
  1935. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1936. VAR lval: SHORTINT;
  1937. BEGIN
  1938. WHILE (len > 0) DO
  1939. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1940. DEC( len );
  1941. END;
  1942. END MinusLoopS;
  1943. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1944. BEGIN
  1945. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1946. RETURN RESULT
  1947. END "-";
  1948. (** INTEGER *)
  1949. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1950. VAR lval: INTEGER;
  1951. BEGIN
  1952. WHILE (len > 0) DO
  1953. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1954. DEC( len );
  1955. END;
  1956. END MinusLoopI;
  1957. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1958. BEGIN
  1959. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1960. RETURN RESULT
  1961. END "-";
  1962. (** LONGINT *)
  1963. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1964. VAR lval: LONGINT;
  1965. BEGIN
  1966. WHILE (len > 0) DO
  1967. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1968. DEC( len );
  1969. END;
  1970. END MinusLoopL;
  1971. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1972. BEGIN
  1973. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1974. RETURN RESULT
  1975. END "-";
  1976. (** REAL *)
  1977. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1978. VAR lval: REAL;
  1979. BEGIN
  1980. WHILE (len > 0) DO
  1981. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1982. DEC( len );
  1983. END;
  1984. END MinusLoopR;
  1985. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1986. BEGIN
  1987. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1988. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1989. RETURN RESULT
  1990. END "-";
  1991. (** LONGREAL *)
  1992. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1993. VAR lval: LONGREAL;
  1994. BEGIN
  1995. WHILE (len > 0) DO
  1996. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1997. DEC( len );
  1998. END;
  1999. END MinusLoopX;
  2000. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2001. BEGIN
  2002. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  2003. MinusLoopX );
  2004. RETURN RESULT
  2005. END "-";
  2006. (*** add array + array -> array ********************************************************************)
  2007. (** SHORTINT *)
  2008. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2009. VAR lval, rval: SHORTINT;
  2010. BEGIN
  2011. WHILE (len > 0) DO
  2012. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2013. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2014. END;
  2015. END AddASASLoop;
  2016. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2017. BEGIN
  2018. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2019. SIZEOF( SHORTINT ), AddASASLoop );
  2020. RETURN RESULT
  2021. END "+";
  2022. (** INTEGER *)
  2023. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2024. VAR lval, rval: INTEGER;
  2025. BEGIN
  2026. WHILE (len > 0) DO
  2027. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2028. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2029. END;
  2030. END AddAIAILoop;
  2031. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2032. BEGIN
  2033. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2034. SIZEOF( INTEGER ), AddAIAILoop );
  2035. RETURN RESULT
  2036. END "+";
  2037. (** LONGINT *)
  2038. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2039. VAR lval, rval: LONGINT;
  2040. BEGIN
  2041. WHILE (len > 0) DO
  2042. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2043. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2044. END;
  2045. END AddALALLoop;
  2046. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2047. BEGIN
  2048. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2049. SIZEOF( LONGINT ), AddALALLoop );
  2050. RETURN RESULT
  2051. END "+";
  2052. (** REAL *)
  2053. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2054. VAR lval, rval: REAL;
  2055. BEGIN
  2056. WHILE (len > 0) DO
  2057. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2058. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2059. END;
  2060. END AddARARLoop;
  2061. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2062. BEGIN
  2063. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2064. loopAddARAR );
  2065. RETURN RESULT
  2066. END "+";
  2067. (** LONGREAL *)
  2068. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2069. VAR lval, rval: LONGREAL;
  2070. BEGIN
  2071. WHILE (len > 0) DO
  2072. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2073. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2074. END;
  2075. END AddAXAXLoop;
  2076. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2077. BEGIN
  2078. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2079. SIZEOF( LONGREAL ), loopAddAXAX );
  2080. RETURN RESULT
  2081. END "+";
  2082. (** COMPLEX *)
  2083. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2084. VAR lval, rval: COMPLEX;
  2085. BEGIN
  2086. WHILE (len > 0) DO
  2087. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2088. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2089. END;
  2090. END AddAZAZLoop;
  2091. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2092. BEGIN
  2093. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2094. SIZEOF( COMPLEX ), loopAddAZAZ );
  2095. RETURN RESULT
  2096. END "+";
  2097. (** LONGCOMPLEX *)
  2098. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2099. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2100. BEGIN
  2101. WHILE (len > 0) DO
  2102. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2103. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2104. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2105. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2106. DEC( len );
  2107. END;
  2108. END AddALZALZLoop;
  2109. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2110. BEGIN
  2111. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2112. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2113. RETURN RESULT
  2114. END "+";
  2115. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2116. (** SHORTINT *)
  2117. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2118. VAR lval, rval: SHORTINT;
  2119. BEGIN
  2120. SYSTEM.GET( radr, rval );
  2121. WHILE (len > 0) DO
  2122. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2123. INC( dadr, dinc ); DEC( len );
  2124. END;
  2125. END AddASSSLoop;
  2126. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2127. BEGIN
  2128. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2129. SIZEOF( SHORTINT ), AddASSSLoop );
  2130. RETURN RESULT
  2131. END "+";
  2132. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2133. BEGIN
  2134. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2135. SIZEOF( SHORTINT ), AddASSSLoop );
  2136. RETURN RESULT
  2137. END "+";
  2138. (** INTEGER *)
  2139. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2140. VAR lval, rval: INTEGER;
  2141. BEGIN
  2142. SYSTEM.GET( radr, rval );
  2143. WHILE (len > 0) DO
  2144. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2145. INC( dadr, dinc ); DEC( len );
  2146. END;
  2147. END AddAISILoop;
  2148. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2149. BEGIN
  2150. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2151. SIZEOF( INTEGER ), AddAISILoop );
  2152. RETURN RESULT
  2153. END "+";
  2154. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2155. BEGIN
  2156. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2157. SIZEOF( INTEGER ), AddAISILoop );
  2158. RETURN RESULT
  2159. END "+";
  2160. (** LONGINT *)
  2161. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2162. VAR lval, rval: LONGINT;
  2163. BEGIN
  2164. SYSTEM.GET( radr, rval );
  2165. WHILE (len > 0) DO
  2166. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2167. INC( dadr, dinc ); DEC( len );
  2168. END;
  2169. END AddALSLLoop;
  2170. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2171. BEGIN
  2172. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2173. SIZEOF( LONGINT ), AddALSLLoop );
  2174. RETURN RESULT
  2175. END "+";
  2176. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2177. BEGIN
  2178. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2179. SIZEOF( LONGINT ), AddALSLLoop );
  2180. RETURN RESULT
  2181. END "+";
  2182. (** REAL *)
  2183. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2184. VAR lval, rval: REAL;
  2185. BEGIN
  2186. SYSTEM.GET( radr, rval );
  2187. WHILE (len > 0) DO
  2188. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2189. INC( dadr, dinc ); DEC( len );
  2190. END;
  2191. END AddARSRLoop;
  2192. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2193. BEGIN
  2194. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2195. AddARSRLoop );
  2196. RETURN RESULT
  2197. END "+";
  2198. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2199. BEGIN
  2200. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2201. AddARSRLoop );
  2202. RETURN RESULT
  2203. END "+";
  2204. (** LONGREAL *)
  2205. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2206. VAR lval, rval: LONGREAL;
  2207. BEGIN
  2208. SYSTEM.GET( radr, rval );
  2209. WHILE (len > 0) DO
  2210. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2211. INC( dadr, dinc ); DEC( len );
  2212. END;
  2213. END AddAXSXLoop;
  2214. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2215. BEGIN
  2216. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2217. SIZEOF( LONGREAL ), AddAXSXLoop );
  2218. RETURN RESULT
  2219. END "+";
  2220. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2221. BEGIN
  2222. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2223. SIZEOF( LONGREAL ), AddAXSXLoop );
  2224. RETURN RESULT
  2225. END "+";
  2226. (** COMPLEX *)
  2227. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2228. VAR lval, rval: COMPLEX;
  2229. BEGIN
  2230. SYSTEM.GET( radr, rval );
  2231. WHILE (len > 0) DO
  2232. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2233. INC( dadr, dinc ); DEC( len );
  2234. END;
  2235. END AddAZSZLoop;
  2236. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2237. BEGIN
  2238. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2239. AddAZSZLoop );
  2240. RETURN RESULT
  2241. END "+";
  2242. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2243. BEGIN
  2244. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2245. AddAZSZLoop );
  2246. RETURN RESULT
  2247. END "+";
  2248. (** LONGCOMPLEX *)
  2249. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2250. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2251. BEGIN
  2252. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2253. WHILE (len > 0) DO
  2254. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2255. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2256. INC( ladr, linc );
  2257. INC( dadr, dinc ); DEC( len );
  2258. END;
  2259. END AddALZSLZLoop;
  2260. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2261. BEGIN
  2262. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2263. AddALZSLZLoop );
  2264. RETURN RESULT
  2265. END "+";
  2266. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2267. BEGIN
  2268. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2269. AddALZSLZLoop );
  2270. RETURN RESULT
  2271. END "+";
  2272. (*** subtraction array - array -> array ********************************************************************)
  2273. (** SHORTINT *)
  2274. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2275. VAR lval, rval: SHORTINT;
  2276. BEGIN
  2277. WHILE (len > 0) DO
  2278. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2279. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2280. END;
  2281. END SubASASLoop;
  2282. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2283. BEGIN
  2284. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2285. SIZEOF( SHORTINT ), SubASASLoop );
  2286. RETURN RESULT
  2287. END "-";
  2288. (** INTEGER *)
  2289. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2290. VAR lval, rval: INTEGER;
  2291. BEGIN
  2292. WHILE (len > 0) DO
  2293. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2294. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2295. END;
  2296. END SubAIAILoop;
  2297. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2298. BEGIN
  2299. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2300. SIZEOF( INTEGER ), SubAIAILoop );
  2301. RETURN RESULT
  2302. END "-";
  2303. (** LONGINT *)
  2304. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2305. VAR lval, rval: LONGINT;
  2306. BEGIN
  2307. WHILE (len > 0) DO
  2308. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2309. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2310. END;
  2311. END SubALALLoop;
  2312. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2313. BEGIN
  2314. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2315. SIZEOF( LONGINT ), SubALALLoop );
  2316. RETURN RESULT
  2317. END "-";
  2318. (** REAL *)
  2319. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2320. VAR lval, rval: REAL;
  2321. BEGIN
  2322. WHILE (len > 0) DO
  2323. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2324. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2325. END;
  2326. END SubARARLoop;
  2327. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2328. BEGIN
  2329. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2330. SubARARLoop );
  2331. RETURN RESULT
  2332. END "-";
  2333. (** LONGREAL *)
  2334. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2335. VAR lval, rval: LONGREAL;
  2336. BEGIN
  2337. WHILE (len > 0) DO
  2338. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2339. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2340. END;
  2341. END SubAXAXLoop;
  2342. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2343. BEGIN
  2344. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2345. SIZEOF( LONGREAL ), SubAXAXLoop );
  2346. RETURN RESULT
  2347. END "-";
  2348. (** COMPLEX *)
  2349. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2350. VAR lval, rval: COMPLEX;
  2351. BEGIN
  2352. WHILE (len > 0) DO
  2353. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2354. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2355. END;
  2356. END SubAZAZLoop;
  2357. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2358. BEGIN
  2359. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2360. SIZEOF( COMPLEX ), SubAZAZLoop );
  2361. RETURN RESULT
  2362. END "-";
  2363. (** LONGCOMPLEX *)
  2364. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2365. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2366. BEGIN
  2367. WHILE (len > 0) DO
  2368. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2369. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2370. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2371. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2372. DEC( len );
  2373. END;
  2374. END SubALZALZLoop;
  2375. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2376. BEGIN
  2377. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2378. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2379. RETURN RESULT
  2380. END "-";
  2381. (*** subtraction array-scalar -> array ********************************************************************)
  2382. (** SHORTINT *)
  2383. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2384. BEGIN
  2385. RESULT := left + (-right);
  2386. RETURN RESULT
  2387. END "-";
  2388. (** INTEGER *)
  2389. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2390. BEGIN
  2391. RESULT := left + (-right);
  2392. RETURN RESULT
  2393. END "-";
  2394. (** LONGINT *)
  2395. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2396. BEGIN
  2397. RESULT := left + (-right);
  2398. RETURN RESULT
  2399. END "-";
  2400. (** REAL *)
  2401. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2402. BEGIN
  2403. RESULT := left + (-right);
  2404. RETURN RESULT
  2405. END "-";
  2406. (** LONGREAL *)
  2407. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2408. BEGIN
  2409. RESULT := left + (-right);
  2410. RETURN RESULT
  2411. END "-";
  2412. (** COMPLEX *)
  2413. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2414. BEGIN
  2415. RESULT := left + (-right);
  2416. RETURN RESULT
  2417. END "-";
  2418. (** LONGCOMPLEX *)
  2419. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2420. BEGIN
  2421. RESULT := left + (-right);
  2422. RETURN RESULT
  2423. END "-";
  2424. (*** subtraction scalar-array -> array ********************************************************************)
  2425. (** SHORTINT *)
  2426. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2427. VAR lval, rval, dval: SHORTINT;
  2428. BEGIN
  2429. SYSTEM.GET( radr, rval );
  2430. WHILE (len > 0) DO
  2431. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2432. INC( dadr, dinc ); DEC( len );
  2433. END;
  2434. END SubSSASLoop;
  2435. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2436. BEGIN
  2437. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2438. SIZEOF( SHORTINT ), SubSSASLoop );
  2439. RETURN RESULT
  2440. END "-";
  2441. (** INTEGER *)
  2442. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2443. VAR lval, rval, dval: INTEGER;
  2444. BEGIN
  2445. SYSTEM.GET( radr, rval );
  2446. WHILE (len > 0) DO
  2447. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2448. INC( dadr, dinc ); DEC( len );
  2449. END;
  2450. END SubSIAILoop;
  2451. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2452. BEGIN
  2453. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2454. SIZEOF( INTEGER ), SubSIAILoop );
  2455. RETURN RESULT
  2456. END "-";
  2457. (** LONGINT *)
  2458. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2459. VAR lval, rval, dval: LONGINT;
  2460. BEGIN
  2461. SYSTEM.GET( radr, rval );
  2462. WHILE (len > 0) DO
  2463. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2464. INC( dadr, dinc ); DEC( len );
  2465. END;
  2466. END SubSLALLoop;
  2467. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2468. BEGIN
  2469. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2470. SIZEOF( LONGINT ), SubSLALLoop );
  2471. RETURN RESULT
  2472. END "-";
  2473. (** REAL *)
  2474. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2475. VAR lval, rval, dval: REAL;
  2476. BEGIN
  2477. SYSTEM.GET( radr, rval );
  2478. WHILE (len > 0) DO
  2479. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2480. INC( dadr, dinc ); DEC( len );
  2481. END;
  2482. END SubSRARLoop;
  2483. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2484. BEGIN
  2485. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2486. SubSRARLoop );
  2487. RETURN RESULT
  2488. END "-";
  2489. (** LONGREAL *)
  2490. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2491. VAR lval, rval, dval: LONGREAL;
  2492. BEGIN
  2493. SYSTEM.GET( radr, rval );
  2494. WHILE (len > 0) DO
  2495. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2496. INC( dadr, dinc ); DEC( len );
  2497. END;
  2498. END SubSXAXLoop;
  2499. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2500. BEGIN
  2501. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2502. SIZEOF( LONGREAL ), SubSXAXLoop );
  2503. RETURN RESULT
  2504. END "-";
  2505. (** COMPLEX *)
  2506. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2507. VAR lval, rval, dval: COMPLEX;
  2508. BEGIN
  2509. SYSTEM.GET( radr, rval );
  2510. WHILE (len > 0) DO
  2511. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2512. INC( dadr, dinc ); DEC( len );
  2513. END;
  2514. END SubSZAZLoop;
  2515. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2516. BEGIN
  2517. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2518. SIZEOF( COMPLEX ), SubSZAZLoop );
  2519. RETURN RESULT
  2520. END "-";
  2521. (** LONGCOMPLEX *)
  2522. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2523. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2524. BEGIN
  2525. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2526. WHILE (len > 0) DO
  2527. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2528. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2529. INC( ladr, linc );
  2530. INC( dadr, dinc ); DEC( len );
  2531. END;
  2532. END SubSLZALZLoop;
  2533. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2534. BEGIN
  2535. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2536. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2537. RETURN RESULT
  2538. END "-";
  2539. (*** element-wise multiply array x array -> array ********************************************************************)
  2540. (** SHORTINT *)
  2541. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2542. VAR lval, rval: SHORTINT;
  2543. BEGIN
  2544. WHILE (len > 0) DO
  2545. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2546. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2547. END;
  2548. END EMulASASLoop;
  2549. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2550. BEGIN
  2551. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2552. SIZEOF( SHORTINT ), EMulASASLoop );
  2553. RETURN RESULT
  2554. END ".*";
  2555. (** INTEGER *)
  2556. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2557. VAR lval, rval: INTEGER; dval: INTEGER;
  2558. BEGIN
  2559. WHILE (len > 0) DO
  2560. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2561. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2562. DEC( len );
  2563. END;
  2564. END EMulAIAILoop;
  2565. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2566. BEGIN
  2567. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2568. SIZEOF( INTEGER ), EMulAIAILoop );
  2569. RETURN RESULT
  2570. END ".*";
  2571. (** LONGINT *)
  2572. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2573. VAR lval, rval: LONGINT;
  2574. BEGIN
  2575. WHILE (len > 0) DO
  2576. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2577. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2578. END;
  2579. END EMulALALLoop;
  2580. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2581. BEGIN
  2582. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2583. SIZEOF( LONGINT ), EMulALALLoop );
  2584. RETURN RESULT
  2585. END ".*";
  2586. (** REAL *)
  2587. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2588. VAR lval, rval: REAL;
  2589. BEGIN
  2590. WHILE (len > 0) DO
  2591. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2592. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2593. END;
  2594. END EMulARARLoop;
  2595. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2596. BEGIN
  2597. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2598. EMulARARLoop );
  2599. RETURN RESULT
  2600. END ".*";
  2601. (** LONGREAL *)
  2602. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2603. VAR lval, rval: LONGREAL;
  2604. BEGIN
  2605. WHILE (len > 0) DO
  2606. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2607. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2608. END;
  2609. END EMulAXAXLoop;
  2610. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2611. BEGIN
  2612. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2613. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2614. RETURN RESULT
  2615. END ".*";
  2616. (** COMPLEX *)
  2617. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2618. VAR lval, rval: COMPLEX;
  2619. BEGIN
  2620. WHILE (len > 0) DO
  2621. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2622. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2623. END;
  2624. END EMulAZAZLoop;
  2625. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2626. BEGIN
  2627. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2628. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2629. RETURN RESULT
  2630. END ".*";
  2631. (** LONGCOMPLEX *)
  2632. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2633. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2634. BEGIN
  2635. WHILE (len > 0) DO
  2636. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2637. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2638. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2639. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2640. DEC( len );
  2641. END;
  2642. END EMulALZALZLoop;
  2643. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2644. BEGIN
  2645. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2646. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2647. RETURN RESULT
  2648. END ".*";
  2649. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2650. (** SHORTINT *)
  2651. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2652. VAR lval, rval,dval: SHORTINT;
  2653. BEGIN
  2654. WHILE (len > 0) DO
  2655. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2656. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2657. END;
  2658. END EMulIncASASLoop;
  2659. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2660. BEGIN
  2661. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2662. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2663. END ".*+";
  2664. (** INTEGER *)
  2665. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2666. VAR lval, rval,dval: INTEGER;
  2667. BEGIN
  2668. WHILE (len > 0) DO
  2669. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2670. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2671. DEC( len );
  2672. END;
  2673. END EMulIncAIAILoop;
  2674. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2675. BEGIN
  2676. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2677. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2678. END ".*+";
  2679. (** LONGINT *)
  2680. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2681. VAR lval, rval,dval: LONGINT;
  2682. BEGIN
  2683. WHILE (len > 0) DO
  2684. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2685. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2686. END;
  2687. END EMulIncALALLoop;
  2688. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2689. BEGIN
  2690. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2691. SIZEOF( LONGINT ), EMulIncALALLoop );
  2692. END ".*+";
  2693. (** REAL *)
  2694. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2695. VAR lval, rval,dval: REAL;
  2696. BEGIN
  2697. WHILE (len > 0) DO
  2698. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2699. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2700. END;
  2701. END EMulIncARARLoop;
  2702. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2703. BEGIN
  2704. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2705. EMulIncARARLoop );
  2706. END ".*+";
  2707. (** LONGREAL *)
  2708. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2709. VAR lval, rval,dval: LONGREAL;
  2710. BEGIN
  2711. WHILE (len > 0) DO
  2712. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2713. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2714. END;
  2715. END EMulIncAXAXLoop;
  2716. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2717. BEGIN
  2718. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2719. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2720. END ".*+";
  2721. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2722. (** SHORTINT *)
  2723. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2724. VAR lval, rval: SHORTINT;
  2725. BEGIN
  2726. SYSTEM.GET( radr, rval );
  2727. WHILE (len > 0) DO
  2728. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2729. INC( dadr, dinc ); DEC( len );
  2730. END;
  2731. END MulASSSLoop;
  2732. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2733. BEGIN
  2734. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2735. SIZEOF( SHORTINT ), MulASSSLoop );
  2736. RETURN RESULT
  2737. END "*";
  2738. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2739. BEGIN
  2740. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2741. SIZEOF( SHORTINT ), MulASSSLoop );
  2742. RETURN RESULT
  2743. END "*";
  2744. (** INTEGER *)
  2745. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2746. VAR lval, rval: INTEGER;
  2747. BEGIN
  2748. SYSTEM.GET( radr, rval );
  2749. WHILE (len > 0) DO
  2750. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2751. INC( dadr, dinc ); DEC( len );
  2752. END;
  2753. END MulAISILoop;
  2754. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2755. BEGIN
  2756. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2757. SIZEOF( INTEGER ), MulAISILoop );
  2758. RETURN RESULT
  2759. END "*";
  2760. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2761. BEGIN
  2762. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2763. SIZEOF( INTEGER ), MulAISILoop );
  2764. RETURN RESULT
  2765. END "*";
  2766. (** LONGINT *)
  2767. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2768. VAR lval, rval: LONGINT;
  2769. BEGIN
  2770. SYSTEM.GET( radr, rval );
  2771. WHILE (len > 0) DO
  2772. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2773. INC( dadr, dinc ); DEC( len );
  2774. END;
  2775. END MulALSLLoop;
  2776. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2777. BEGIN
  2778. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2779. SIZEOF( LONGINT ), MulALSLLoop );
  2780. RETURN RESULT
  2781. END "*";
  2782. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2783. BEGIN
  2784. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2785. SIZEOF( LONGINT ), MulALSLLoop );
  2786. RETURN RESULT
  2787. END "*";
  2788. (** REAL *)
  2789. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2790. VAR lval, rval: REAL;
  2791. BEGIN
  2792. SYSTEM.GET( radr, rval );
  2793. WHILE (len > 0) DO
  2794. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2795. INC( dadr, dinc ); DEC( len );
  2796. END;
  2797. END MulARSRLoop;
  2798. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2799. BEGIN
  2800. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2801. loopMulARSR );
  2802. RETURN RESULT
  2803. END "*";
  2804. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2805. BEGIN
  2806. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2807. loopMulARSR );
  2808. RETURN RESULT
  2809. END "*";
  2810. (** LONGREAL *)
  2811. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2812. VAR lval, rval: LONGREAL;
  2813. BEGIN
  2814. IF debug THEN
  2815. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2816. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2817. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2818. END;
  2819. SYSTEM.GET( radr, rval );
  2820. WHILE (len > 0) DO
  2821. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2822. INC( dadr, dinc ); DEC( len );
  2823. END;
  2824. END MulAXSXLoop;
  2825. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2826. BEGIN
  2827. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2828. SIZEOF( LONGREAL ), loopMulAXSX );
  2829. RETURN RESULT
  2830. END "*";
  2831. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2832. BEGIN
  2833. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2834. SIZEOF( LONGREAL ), loopMulAXSX );
  2835. RETURN RESULT
  2836. END "*";
  2837. (** COMPLEX *)
  2838. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2839. VAR lval, rval: COMPLEX;
  2840. BEGIN
  2841. SYSTEM.GET( radr, rval );
  2842. WHILE (len > 0) DO
  2843. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2844. INC( dadr, dinc ); DEC( len );
  2845. END;
  2846. END MulAZSZLoop;
  2847. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2848. BEGIN
  2849. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2850. loopMulAZSZ );
  2851. RETURN RESULT
  2852. END "*";
  2853. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2854. BEGIN
  2855. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2856. loopMulAZSZ );
  2857. RETURN RESULT
  2858. END "*";
  2859. (** LONGCOMPLEX *)
  2860. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2861. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2862. BEGIN
  2863. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2864. WHILE (len > 0) DO
  2865. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2866. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2867. INC( ladr, linc );
  2868. INC( dadr, dinc ); DEC( len );
  2869. END;
  2870. END MulALZSLZLoop;
  2871. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2872. BEGIN
  2873. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2874. loopMulALZSLZ );
  2875. RETURN RESULT
  2876. END "*";
  2877. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2878. BEGIN
  2879. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2880. loopMulALZSLZ );
  2881. RETURN RESULT
  2882. END "*";
  2883. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2884. (** SHORTINT *)
  2885. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2886. VAR lval, rval, dval: SHORTINT;
  2887. BEGIN
  2888. SYSTEM.GET( radr, rval );
  2889. WHILE (len > 0) DO
  2890. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2891. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2892. END;
  2893. END IncMulASSSLoop;
  2894. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2895. BEGIN
  2896. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2897. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2898. END "INCMUL";
  2899. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2900. BEGIN
  2901. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2902. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2903. RETURN RESULT
  2904. END "INCMUL";
  2905. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2906. BEGIN
  2907. RESULT := -RESULT;
  2908. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2909. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2910. RESULT := -RESULT;
  2911. RETURN RESULT
  2912. END "DECMUL";
  2913. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2914. BEGIN
  2915. RESULT := -RESULT;
  2916. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2917. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2918. RESULT := -RESULT;
  2919. RETURN RESULT
  2920. END "DECMUL";
  2921. (** INTEGER *)
  2922. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2923. VAR lval, rval, dval: INTEGER;
  2924. BEGIN
  2925. SYSTEM.GET( radr, rval );
  2926. WHILE (len > 0) DO
  2927. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2928. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2929. END;
  2930. END IncMulAISILoop;
  2931. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2932. BEGIN
  2933. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2934. SIZEOF( INTEGER ), IncMulAISILoop );
  2935. RETURN RESULT
  2936. END "INCMUL";
  2937. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2938. BEGIN
  2939. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2940. SIZEOF( INTEGER ), IncMulAISILoop );
  2941. RETURN RESULT
  2942. END "INCMUL";
  2943. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2944. BEGIN
  2945. RESULT := -RESULT;
  2946. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2947. SIZEOF( INTEGER ), IncMulAISILoop );
  2948. RESULT := -RESULT;
  2949. RETURN RESULT
  2950. END "DECMUL";
  2951. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2952. BEGIN
  2953. RESULT := -RESULT;
  2954. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2955. SIZEOF( INTEGER ), IncMulAISILoop );
  2956. RESULT := -RESULT;
  2957. RETURN RESULT
  2958. END "DECMUL";
  2959. (** LONGINT *)
  2960. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2961. VAR lval, rval, dval: LONGINT;
  2962. BEGIN
  2963. SYSTEM.GET( radr, rval );
  2964. WHILE (len > 0) DO
  2965. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2966. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2967. END;
  2968. END IncMulALSLLoop;
  2969. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2970. BEGIN
  2971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2972. SIZEOF( LONGINT ), IncMulALSLLoop );
  2973. RETURN RESULT
  2974. END "INCMUL";
  2975. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2976. BEGIN
  2977. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2978. SIZEOF( LONGINT ), IncMulALSLLoop );
  2979. RETURN RESULT
  2980. END "INCMUL";
  2981. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2982. BEGIN
  2983. RESULT := -RESULT;
  2984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2985. SIZEOF( LONGINT ), IncMulALSLLoop );
  2986. RESULT := -RESULT;
  2987. RETURN RESULT
  2988. END "DECMUL";
  2989. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2990. BEGIN
  2991. RESULT := -RESULT;
  2992. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2993. SIZEOF( LONGINT ), IncMulALSLLoop );
  2994. RESULT := -RESULT;
  2995. RETURN RESULT
  2996. END "DECMUL";
  2997. (** REAL *)
  2998. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2999. VAR lval, rval, dval: REAL;
  3000. BEGIN
  3001. SYSTEM.GET( radr, rval );
  3002. WHILE (len > 0) DO
  3003. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3004. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3005. END;
  3006. END IncMulARSRLoop;
  3007. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3008. BEGIN
  3009. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3010. loopIncMulARSR );
  3011. RETURN RESULT
  3012. END "INCMUL";
  3013. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3014. BEGIN
  3015. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3016. loopIncMulARSR );
  3017. RETURN RESULT
  3018. END "INCMUL";
  3019. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3020. BEGIN
  3021. RESULT := -RESULT;
  3022. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3023. loopIncMulARSR );
  3024. RESULT := -RESULT;
  3025. RETURN RESULT
  3026. END "DECMUL";
  3027. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3028. BEGIN
  3029. RESULT := -RESULT;
  3030. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3031. loopIncMulARSR );
  3032. RESULT := -RESULT;
  3033. RETURN RESULT
  3034. END "DECMUL";
  3035. (** LONGREAL *)
  3036. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3037. VAR lval, rval, dval: LONGREAL;
  3038. BEGIN
  3039. IF debug THEN
  3040. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3041. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3042. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3043. END;
  3044. SYSTEM.GET( radr, rval );
  3045. WHILE (len > 0) DO
  3046. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3047. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3048. END;
  3049. END IncMulAXSXLoop;
  3050. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3051. BEGIN
  3052. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3053. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3054. RETURN RESULT
  3055. END "INCMUL";
  3056. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3057. BEGIN
  3058. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3059. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3060. RETURN RESULT
  3061. END "INCMUL";
  3062. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3063. BEGIN
  3064. RESULT := -RESULT;
  3065. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3066. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3067. RESULT := -RESULT;
  3068. RETURN RESULT
  3069. END "DECMUL";
  3070. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3071. BEGIN
  3072. RESULT := -RESULT;
  3073. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3074. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3075. RESULT := -RESULT;
  3076. RETURN RESULT
  3077. END "DECMUL";
  3078. (*** element-wise division array / array -> array ********************************************************************)
  3079. (** SHORTINT *)
  3080. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3081. VAR lval, rval: SHORTINT; dval: REAL;
  3082. BEGIN
  3083. WHILE (len > 0) DO
  3084. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3085. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3086. DEC( len );
  3087. END;
  3088. END EDivideASASLoop;
  3089. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3090. BEGIN
  3091. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3092. EDivideASASLoop );
  3093. RETURN RESULT
  3094. END "./";
  3095. (** INTEGER *)
  3096. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3097. VAR lval, rval: INTEGER; dval: REAL;
  3098. BEGIN
  3099. WHILE (len > 0) DO
  3100. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3101. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3102. DEC( len );
  3103. END;
  3104. END EDivideAIAILoop;
  3105. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3106. BEGIN
  3107. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3108. EDivideAIAILoop );
  3109. RETURN RESULT
  3110. END "./";
  3111. (** LONGINT *)
  3112. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3113. VAR lval, rval: LONGINT; dval: REAL;
  3114. BEGIN
  3115. WHILE (len > 0) DO
  3116. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3117. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3118. DEC( len );
  3119. END;
  3120. END EDivideALALLoop;
  3121. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3122. BEGIN
  3123. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3124. EDivideALALLoop );
  3125. RETURN RESULT
  3126. END "./";
  3127. (** REAL *)
  3128. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3129. VAR lval, rval: REAL; dval: REAL;
  3130. BEGIN
  3131. WHILE (len > 0) DO
  3132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3133. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3134. DEC( len );
  3135. END;
  3136. END EDivideARARLoop;
  3137. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3138. BEGIN
  3139. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3140. EDivideARARLoop );
  3141. RETURN RESULT
  3142. END "./";
  3143. (** LONGREAL *)
  3144. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3145. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3146. BEGIN
  3147. WHILE (len > 0) DO
  3148. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3149. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3150. DEC( len );
  3151. END;
  3152. END EDivideAXAXLoop;
  3153. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3154. BEGIN
  3155. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3156. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3157. RETURN RESULT
  3158. END "./";
  3159. (** COMPLEX *)
  3160. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3161. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3162. BEGIN
  3163. WHILE (len > 0) DO
  3164. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3165. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3166. DEC( len );
  3167. END;
  3168. END EDivideAZAZLoop;
  3169. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3170. BEGIN
  3171. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3172. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3173. RETURN RESULT
  3174. END "./";
  3175. (** LONGCOMPLEX *)
  3176. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3177. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3178. BEGIN
  3179. WHILE (len > 0) DO
  3180. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3181. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3182. IF rvalIm # 0.0D0 THEN
  3183. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3184. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3185. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3186. ELSE
  3187. dvalRe := lvalRe/rvalRe;
  3188. dvalIm := lvalIm/rvalRe;
  3189. END;
  3190. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3191. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3192. DEC( len );
  3193. END;
  3194. END EDivideALZALZLoop;
  3195. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3196. BEGIN
  3197. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3198. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3199. RETURN RESULT
  3200. END "./";
  3201. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3202. (** SHORTINT *)
  3203. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3204. VAR lval, rval: SHORTINT; dval: REAL;
  3205. BEGIN
  3206. SYSTEM.GET( radr, rval );
  3207. WHILE (len > 0) DO
  3208. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3209. INC( dadr, dinc ); DEC( len );
  3210. END;
  3211. END DivideASSSLoop;
  3212. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3213. BEGIN
  3214. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3215. DivideASSSLoop );
  3216. RETURN RESULT
  3217. END "/";
  3218. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3219. VAR lval, rval: SHORTINT; dval: REAL;
  3220. BEGIN
  3221. SYSTEM.GET( radr, rval );
  3222. WHILE (len > 0) DO
  3223. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3224. INC( dadr, dinc ); DEC( len );
  3225. END;
  3226. END DivideSSASLoop;
  3227. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3228. BEGIN
  3229. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3230. DivideSSASLoop );
  3231. RETURN RESULT
  3232. END "/";
  3233. (** INTEGER *)
  3234. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3235. VAR lval, rval: INTEGER; dval: REAL;
  3236. BEGIN
  3237. SYSTEM.GET( radr, rval );
  3238. WHILE (len > 0) DO
  3239. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3240. INC( dadr, dinc ); DEC( len );
  3241. END;
  3242. END DivideAISILoop;
  3243. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3244. BEGIN
  3245. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3246. DivideAISILoop );
  3247. RETURN RESULT
  3248. END "/";
  3249. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3250. VAR lval, rval: INTEGER; dval: REAL;
  3251. BEGIN
  3252. SYSTEM.GET( radr, rval );
  3253. WHILE (len > 0) DO
  3254. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3255. INC( dadr, dinc ); DEC( len );
  3256. END;
  3257. END DivideSIAILoop;
  3258. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3259. BEGIN
  3260. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3261. DivideSIAILoop );
  3262. RETURN RESULT
  3263. END "/";
  3264. (** LONGINT *)
  3265. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3266. VAR lval, rval: LONGINT; dval: REAL;
  3267. BEGIN
  3268. SYSTEM.GET( radr, rval );
  3269. WHILE (len > 0) DO
  3270. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3271. INC( dadr, dinc ); DEC( len );
  3272. END;
  3273. END DivideALSLLoop;
  3274. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3275. BEGIN
  3276. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3277. DivideALSLLoop );
  3278. RETURN RESULT
  3279. END "/";
  3280. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3281. VAR lval, rval: LONGINT; dval: REAL;
  3282. BEGIN
  3283. SYSTEM.GET( radr, rval );
  3284. WHILE (len > 0) DO
  3285. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3286. INC( dadr, dinc ); DEC( len );
  3287. END;
  3288. END DivideSLALLoop;
  3289. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3290. BEGIN
  3291. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3292. DivideSLALLoop );
  3293. RETURN RESULT
  3294. END "/";
  3295. (** REAL *)
  3296. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3297. VAR lval, rval: REAL; dval: REAL;
  3298. BEGIN
  3299. SYSTEM.GET( radr, rval );
  3300. WHILE (len > 0) DO
  3301. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3302. INC( dadr, dinc ); DEC( len );
  3303. END;
  3304. END DivideARSRLoop;
  3305. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3306. BEGIN
  3307. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3308. DivideARSRLoop );
  3309. RETURN RESULT
  3310. END "/";
  3311. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3312. VAR lval, rval: REAL; dval: REAL;
  3313. BEGIN
  3314. SYSTEM.GET( radr, rval );
  3315. WHILE (len > 0) DO
  3316. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3317. INC( dadr, dinc ); DEC( len );
  3318. END;
  3319. END DivideSRARLoop;
  3320. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3321. BEGIN
  3322. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3323. DivideSRARLoop );
  3324. RETURN RESULT
  3325. END "/";
  3326. (** LONGREAL *)
  3327. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3328. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3329. BEGIN
  3330. SYSTEM.GET( radr, rval );
  3331. WHILE (len > 0) DO
  3332. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3333. INC( dadr, dinc ); DEC( len );
  3334. END;
  3335. END DivideAXSXLoop;
  3336. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3337. BEGIN
  3338. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3339. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3340. RETURN RESULT
  3341. END "/";
  3342. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3343. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3344. BEGIN
  3345. SYSTEM.GET( radr, rval );
  3346. WHILE (len > 0) DO
  3347. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3348. INC( dadr, dinc ); DEC( len );
  3349. END;
  3350. END DivideSXAXLoop;
  3351. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3352. BEGIN
  3353. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3354. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3355. RETURN RESULT
  3356. END "/";
  3357. (** COMPLEX *)
  3358. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3359. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3360. BEGIN
  3361. SYSTEM.GET( radr, rval );
  3362. WHILE (len > 0) DO
  3363. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3364. INC( dadr, dinc ); DEC( len );
  3365. END;
  3366. END DivideAZSZLoop;
  3367. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3368. BEGIN
  3369. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3370. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3371. RETURN RESULT
  3372. END "/";
  3373. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3374. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3375. BEGIN
  3376. SYSTEM.GET( radr, rval );
  3377. WHILE (len > 0) DO
  3378. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3379. INC( dadr, dinc ); DEC( len );
  3380. END;
  3381. END DivideSZAZLoop;
  3382. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3383. BEGIN
  3384. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3385. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3386. RETURN RESULT
  3387. END "/";
  3388. (** LONGCOMPLEX *)
  3389. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3390. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3391. BEGIN
  3392. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3393. IF rvalIm # 0.0D0 THEN
  3394. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3395. WHILE (len > 0) DO
  3396. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3397. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3398. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3399. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3400. INC( ladr, linc );
  3401. INC( dadr, dinc ); DEC( len );
  3402. END;
  3403. ELSE
  3404. WHILE (len > 0) DO
  3405. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3406. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3407. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3408. INC( ladr, linc );
  3409. INC( dadr, dinc ); DEC( len );
  3410. END;
  3411. END;
  3412. END DivideALZSLZLoop;
  3413. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3414. BEGIN
  3415. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3416. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3417. RETURN RESULT
  3418. END "/";
  3419. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3420. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3421. BEGIN
  3422. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3423. WHILE (len > 0) DO
  3424. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3425. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3426. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3427. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3428. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3429. INC( ladr, linc );
  3430. INC( dadr, dinc ); DEC( len );
  3431. END;
  3432. END DivideSLZALZLoop;
  3433. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3434. BEGIN
  3435. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3436. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3437. RETURN RESULT
  3438. END "/";
  3439. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3440. (** SHORTINT *)
  3441. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3442. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3443. BEGIN
  3444. WHILE (len > 0) DO
  3445. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3446. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3447. DEC( len );
  3448. END;
  3449. END EDivASASLoop;
  3450. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3451. BEGIN
  3452. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3453. SIZEOF( SHORTINT ), EDivASASLoop );
  3454. RETURN RESULT
  3455. END "DIV";
  3456. (** INTEGER *)
  3457. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3458. VAR lval, rval: INTEGER; dval: INTEGER;
  3459. BEGIN
  3460. WHILE (len > 0) DO
  3461. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3462. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3463. DEC( len );
  3464. END;
  3465. END EDivAIAILoop;
  3466. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3467. BEGIN
  3468. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3469. SIZEOF( INTEGER ), EDivAIAILoop );
  3470. RETURN RESULT
  3471. END "DIV";
  3472. (** LONGINT *)
  3473. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3474. VAR lval, rval: LONGINT; dval: LONGINT;
  3475. BEGIN
  3476. WHILE (len > 0) DO
  3477. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3478. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3479. DEC( len );
  3480. END;
  3481. END EDivALALLoop;
  3482. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3483. BEGIN
  3484. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3485. SIZEOF( LONGINT ), EDivALALLoop );
  3486. RETURN RESULT
  3487. END "DIV";
  3488. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3489. (** SHORTINT *)
  3490. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3491. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3492. BEGIN
  3493. SYSTEM.GET( radr, rval );
  3494. WHILE (len > 0) DO
  3495. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3496. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3497. END;
  3498. END DivASSSLoop;
  3499. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3500. BEGIN
  3501. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3502. SIZEOF( SHORTINT ), DivASSSLoop );
  3503. RETURN RESULT
  3504. END "DIV";
  3505. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3506. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3507. BEGIN
  3508. SYSTEM.GET( radr, rval );
  3509. WHILE (len > 0) DO
  3510. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3511. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3512. END;
  3513. END DivSSASLoop;
  3514. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3515. BEGIN
  3516. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3517. SIZEOF( SHORTINT ), DivSSASLoop );
  3518. RETURN RESULT
  3519. END "DIV";
  3520. (** INTEGER *)
  3521. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3522. VAR lval, rval: INTEGER; dval: INTEGER;
  3523. BEGIN
  3524. SYSTEM.GET( radr, rval );
  3525. WHILE (len > 0) DO
  3526. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3527. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3528. END;
  3529. END DivAISILoop;
  3530. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3531. BEGIN
  3532. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3533. SIZEOF( INTEGER ), DivAISILoop );
  3534. RETURN RESULT
  3535. END "DIV";
  3536. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3537. VAR lval, rval: INTEGER; dval: INTEGER;
  3538. BEGIN
  3539. SYSTEM.GET( radr, rval );
  3540. WHILE (len > 0) DO
  3541. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3542. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3543. END;
  3544. END DivSIAILoop;
  3545. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3546. BEGIN
  3547. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3548. SIZEOF( INTEGER ), DivSIAILoop );
  3549. RETURN RESULT
  3550. END "DIV";
  3551. (** LONGINT *)
  3552. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3553. VAR lval, rval: LONGINT; dval: LONGINT;
  3554. BEGIN
  3555. SYSTEM.GET( radr, rval );
  3556. WHILE (len > 0) DO
  3557. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3558. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3559. END;
  3560. END DivALSLLoop;
  3561. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3562. BEGIN
  3563. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3564. SIZEOF( LONGINT ), DivALSLLoop );
  3565. RETURN RESULT
  3566. END "DIV";
  3567. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3568. VAR lval, rval: LONGINT; dval: LONGINT;
  3569. BEGIN
  3570. SYSTEM.GET( radr, rval );
  3571. WHILE (len > 0) DO
  3572. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3573. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3574. END;
  3575. END DivSLALLoop;
  3576. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3577. BEGIN
  3578. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3579. SIZEOF( LONGINT ), DivSLALLoop );
  3580. RETURN RESULT
  3581. END "DIV";
  3582. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3583. (** SHORTINT *)
  3584. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3585. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3586. BEGIN
  3587. WHILE (len > 0) DO
  3588. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3589. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3590. DEC( len );
  3591. END;
  3592. END EModASASLoop;
  3593. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3594. BEGIN
  3595. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3596. SIZEOF( SHORTINT ), EModASASLoop );
  3597. RETURN RESULT
  3598. END "MOD";
  3599. (** INTEGER *)
  3600. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3601. VAR lval, rval: INTEGER; dval: INTEGER;
  3602. BEGIN
  3603. WHILE (len > 0) DO
  3604. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3605. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3606. DEC( len );
  3607. END;
  3608. END EModAIAILoop;
  3609. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3610. BEGIN
  3611. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3612. SIZEOF( INTEGER ), EModAIAILoop );
  3613. RETURN RESULT
  3614. END "MOD";
  3615. (** LONGINT *)
  3616. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3617. VAR lval, rval: LONGINT; dval: LONGINT;
  3618. BEGIN
  3619. WHILE (len > 0) DO
  3620. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3621. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3622. DEC( len );
  3623. END;
  3624. END EModALALLoop;
  3625. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3626. BEGIN
  3627. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3628. SIZEOF( LONGINT ), EModALALLoop );
  3629. RETURN RESULT
  3630. END "MOD";
  3631. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3632. (** SHORTINT *)
  3633. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3634. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3635. BEGIN
  3636. SYSTEM.GET( radr, rval );
  3637. WHILE (len > 0) DO
  3638. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3639. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3640. END;
  3641. END ModASSSLoop;
  3642. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3643. BEGIN
  3644. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3645. SIZEOF( SHORTINT ), ModASSSLoop );
  3646. RETURN RESULT
  3647. END "MOD";
  3648. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3649. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3650. BEGIN
  3651. SYSTEM.GET( radr, rval );
  3652. WHILE (len > 0) DO
  3653. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3654. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3655. END;
  3656. END ModSSASLoop;
  3657. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3658. BEGIN
  3659. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3660. SIZEOF( SHORTINT ), ModSSASLoop );
  3661. RETURN RESULT
  3662. END "MOD";
  3663. (** INTEGER *)
  3664. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3665. VAR lval, rval: INTEGER; dval: INTEGER;
  3666. BEGIN
  3667. SYSTEM.GET( radr, rval );
  3668. WHILE (len > 0) DO
  3669. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3670. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3671. END;
  3672. END ModAISILoop;
  3673. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3674. BEGIN
  3675. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3676. SIZEOF( INTEGER ), ModAISILoop );
  3677. RETURN RESULT
  3678. END "MOD";
  3679. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3680. VAR lval, rval: INTEGER; dval: INTEGER;
  3681. BEGIN
  3682. SYSTEM.GET( radr, rval );
  3683. WHILE (len > 0) DO
  3684. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3685. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3686. END;
  3687. END ModSIAILoop;
  3688. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3689. BEGIN
  3690. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3691. SIZEOF( INTEGER ), ModSIAILoop );
  3692. RETURN RESULT
  3693. END "MOD";
  3694. (** LONGINT *)
  3695. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3696. VAR lval, rval: LONGINT; dval: LONGINT;
  3697. BEGIN
  3698. SYSTEM.GET( radr, rval );
  3699. WHILE (len > 0) DO
  3700. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3701. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3702. END;
  3703. END ModALSLLoop;
  3704. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3705. BEGIN
  3706. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3707. SIZEOF( LONGINT ), ModALSLLoop );
  3708. RETURN RESULT
  3709. END "MOD";
  3710. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3711. VAR lval, rval: LONGINT; dval: LONGINT;
  3712. BEGIN
  3713. SYSTEM.GET( radr, rval );
  3714. WHILE (len > 0) DO
  3715. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3716. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3717. END;
  3718. END ModSLALLoop;
  3719. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3720. BEGIN
  3721. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3722. SIZEOF( LONGINT ), ModSLALLoop );
  3723. RETURN RESULT
  3724. END "MOD";
  3725. (*** scalar product <array,array> -> scalar ********************************************************************)
  3726. (** SHORTINT *)
  3727. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3728. VAR lval, rval: SHORTINT; dval: LONGINT;
  3729. BEGIN
  3730. SYSTEM.GET( dadr, dval );
  3731. WHILE (len > 0) DO
  3732. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3733. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3734. END;
  3735. SYSTEM.PUT( dadr, dval );
  3736. END SPASASLoop;
  3737. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3738. VAR dest: LONGINT;
  3739. BEGIN
  3740. dest := 0;
  3741. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3742. RETURN dest;
  3743. END "+*";
  3744. (** INTEGER *)
  3745. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3746. VAR lval, rval: INTEGER; dval: LONGINT;
  3747. BEGIN
  3748. SYSTEM.GET( dadr, dval );
  3749. WHILE (len > 0) DO
  3750. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3751. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3752. END;
  3753. SYSTEM.PUT( dadr, dval );
  3754. END SPAIAILoop;
  3755. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3756. VAR dest: LONGINT;
  3757. BEGIN
  3758. dest := 0;
  3759. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3760. RETURN dest;
  3761. END "+*";
  3762. (** LONGINT *)
  3763. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3764. VAR lval, rval: LONGINT; dval: LONGINT;
  3765. BEGIN
  3766. SYSTEM.GET( dadr, dval );
  3767. WHILE (len > 0) DO
  3768. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3769. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3770. END;
  3771. SYSTEM.PUT( dadr, dval );
  3772. END SPALALLoop;
  3773. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3774. VAR dest: LONGINT;
  3775. BEGIN
  3776. dest := 0;
  3777. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3778. RETURN dest;
  3779. END "+*";
  3780. (** REAL *)
  3781. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3782. VAR lval, rval: REAL; dval: REAL;
  3783. BEGIN
  3784. SYSTEM.GET( dadr, dval );
  3785. WHILE (len > 0) DO
  3786. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3787. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3788. END;
  3789. SYSTEM.PUT( dadr, dval );
  3790. END SPARARLoop;
  3791. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3792. VAR dest: REAL;
  3793. BEGIN
  3794. dest := 0;
  3795. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3796. RETURN dest;
  3797. END "+*";
  3798. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3799. VAR lval, rval, dval: LONGREAL;
  3800. BEGIN
  3801. IF debug THEN
  3802. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3803. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3804. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3805. END;
  3806. SYSTEM.GET( dadr, dval );
  3807. WHILE (len > 0) DO
  3808. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3809. dval := dval + rval * lval; DEC( len );
  3810. END;
  3811. SYSTEM.PUT( dadr, dval );
  3812. END SPAXAXLoop;
  3813. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3814. VAR dest: LONGREAL;
  3815. BEGIN
  3816. dest := 0;
  3817. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3818. RETURN dest;
  3819. END "+*";
  3820. (** COMPLEX *)
  3821. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3822. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3823. BEGIN
  3824. SYSTEM.GET( dadr, dval );
  3825. WHILE (len > 0) DO
  3826. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3827. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3828. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3829. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3830. END;
  3831. SYSTEM.PUT( dadr, dval );
  3832. END SPAZAZLoop;
  3833. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3834. VAR dest: COMPLEX;
  3835. BEGIN
  3836. dest := 0;
  3837. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3838. RETURN dest;
  3839. END "+*";
  3840. (** COMPLEX *)
  3841. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3842. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3843. BEGIN
  3844. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3845. WHILE (len > 0) DO
  3846. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3847. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3848. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3849. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3850. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3851. END;
  3852. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3853. END SPALZALZLoop;
  3854. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3855. VAR dest: LONGCOMPLEX;
  3856. BEGIN
  3857. dest := 0;
  3858. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3859. RETURN dest;
  3860. END "+*";
  3861. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3862. (** BOOLEAN *)
  3863. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3864. VAR lval, rval: BOOLEAN;
  3865. BEGIN
  3866. WHILE (len > 0) DO
  3867. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3868. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3869. END;
  3870. END EEqlABABLoop;
  3871. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3872. BEGIN
  3873. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3874. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3875. RETURN RESULT
  3876. END ".=";
  3877. (** SHORTINT *)
  3878. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3879. VAR lval, rval: SHORTINT;
  3880. BEGIN
  3881. WHILE (len > 0) DO
  3882. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3883. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3884. END;
  3885. END EEqlASASLoop;
  3886. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3887. BEGIN
  3888. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3889. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3890. RETURN RESULT
  3891. END ".=";
  3892. (** INTEGER *)
  3893. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3894. VAR lval, rval: INTEGER;
  3895. BEGIN
  3896. WHILE (len > 0) DO
  3897. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3898. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3899. END;
  3900. END EEqlAIAILoop;
  3901. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3902. BEGIN
  3903. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3904. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3905. RETURN RESULT
  3906. END ".=";
  3907. (** LONGINT *)
  3908. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3909. VAR lval, rval: LONGINT;
  3910. BEGIN
  3911. WHILE (len > 0) DO
  3912. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3913. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3914. END;
  3915. END EEqlALALLoop;
  3916. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3917. BEGIN
  3918. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3919. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3920. RETURN RESULT
  3921. END ".=";
  3922. (** REAL *)
  3923. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3924. VAR lval, rval: REAL;
  3925. BEGIN
  3926. WHILE (len > 0) DO
  3927. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3928. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3929. END;
  3930. END EEqlARARLoop;
  3931. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3932. BEGIN
  3933. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3934. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3935. RETURN RESULT
  3936. END ".=";
  3937. (** LONGREAL *)
  3938. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3939. VAR lval, rval: LONGREAL;
  3940. BEGIN
  3941. WHILE (len > 0) DO
  3942. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3943. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3944. END;
  3945. END EEqlAXAXLoop;
  3946. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3947. BEGIN
  3948. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3949. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3950. RETURN RESULT
  3951. END ".=";
  3952. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3953. (** BOOLEAN *)
  3954. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3955. VAR lval, rval: BOOLEAN;
  3956. BEGIN
  3957. SYSTEM.GET( radr, rval );
  3958. WHILE (len > 0) DO
  3959. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3960. INC( dadr, dinc ); DEC( len );
  3961. END;
  3962. END EEqlABSBLoop;
  3963. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3964. BEGIN
  3965. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3966. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3967. RETURN RESULT
  3968. END ".=";
  3969. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3970. BEGIN
  3971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3972. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3973. RETURN RESULT
  3974. END ".=";
  3975. (** SHORTINT *)
  3976. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3977. VAR lval, rval: SHORTINT;
  3978. BEGIN
  3979. SYSTEM.GET( radr, rval );
  3980. WHILE (len > 0) DO
  3981. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3982. INC( dadr, dinc ); DEC( len );
  3983. END;
  3984. END EEqlASSSLoop;
  3985. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3986. BEGIN
  3987. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3988. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3989. RETURN RESULT
  3990. END ".=";
  3991. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3992. BEGIN
  3993. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3994. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3995. RETURN RESULT
  3996. END ".=";
  3997. (** INTEGER *)
  3998. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3999. VAR lval, rval: INTEGER;
  4000. BEGIN
  4001. SYSTEM.GET( radr, rval );
  4002. WHILE (len > 0) DO
  4003. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4004. INC( dadr, dinc ); DEC( len );
  4005. END;
  4006. END EEqlAISILoop;
  4007. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4008. BEGIN
  4009. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4010. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4011. RETURN RESULT
  4012. END ".=";
  4013. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4014. BEGIN
  4015. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4016. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4017. RETURN RESULT
  4018. END ".=";
  4019. (** LONGINT *)
  4020. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4021. VAR lval, rval: LONGINT;
  4022. BEGIN
  4023. SYSTEM.GET( radr, rval );
  4024. WHILE (len > 0) DO
  4025. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4026. INC( dadr, dinc ); DEC( len );
  4027. END;
  4028. END EEqlALSLLoop;
  4029. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4030. BEGIN
  4031. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4032. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4033. RETURN RESULT
  4034. END ".=";
  4035. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4036. BEGIN
  4037. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4038. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4039. RETURN RESULT
  4040. END ".=";
  4041. (** REAL *)
  4042. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4043. VAR lval, rval: REAL;
  4044. BEGIN
  4045. SYSTEM.GET( radr, rval );
  4046. WHILE (len > 0) DO
  4047. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4048. INC( dadr, dinc ); DEC( len );
  4049. END;
  4050. END EEqlARSRLoop;
  4051. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4052. BEGIN
  4053. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4054. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4055. RETURN RESULT
  4056. END ".=";
  4057. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4058. BEGIN
  4059. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4060. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4061. RETURN RESULT
  4062. END ".=";
  4063. (** LONGREAL *)
  4064. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4065. VAR lval, rval: LONGREAL;
  4066. BEGIN
  4067. SYSTEM.GET( radr, rval );
  4068. WHILE (len > 0) DO
  4069. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4070. INC( dadr, dinc ); DEC( len );
  4071. END;
  4072. END EEqlAXSXLoop;
  4073. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4074. BEGIN
  4075. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4076. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4077. RETURN RESULT
  4078. END ".=";
  4079. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4080. BEGIN
  4081. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4082. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4083. RETURN RESULT
  4084. END ".=";
  4085. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4086. (** BOOLEAN *)
  4087. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4088. VAR lval, rval: BOOLEAN;
  4089. BEGIN
  4090. WHILE (len > 0) DO
  4091. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4092. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4093. END;
  4094. END ENeqABABLoop;
  4095. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4096. BEGIN
  4097. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4098. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4099. RETURN RESULT
  4100. END ".#";
  4101. (** SHORTINT *)
  4102. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4103. VAR lval, rval: SHORTINT;
  4104. BEGIN
  4105. WHILE (len > 0) DO
  4106. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4107. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4108. END;
  4109. END ENeqASASLoop;
  4110. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4111. BEGIN
  4112. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4113. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4114. RETURN RESULT
  4115. END ".#";
  4116. (** INTEGER*)
  4117. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4118. VAR lval, rval: INTEGER;
  4119. BEGIN
  4120. WHILE (len > 0) DO
  4121. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4122. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4123. END;
  4124. END ENeqAIAILoop;
  4125. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4126. BEGIN
  4127. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4128. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4129. RETURN RESULT
  4130. END ".#";
  4131. (** LONGINT*)
  4132. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4133. VAR lval, rval: LONGINT;
  4134. BEGIN
  4135. WHILE (len > 0) DO
  4136. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4137. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4138. END;
  4139. END ENeqALALLoop;
  4140. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4141. BEGIN
  4142. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4143. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4144. RETURN RESULT
  4145. END ".#";
  4146. (** REAL *)
  4147. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4148. VAR lval, rval: REAL;
  4149. BEGIN
  4150. WHILE (len > 0) DO
  4151. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4152. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4153. END;
  4154. END ENeqARARLoop;
  4155. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4156. BEGIN
  4157. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4158. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4159. RETURN RESULT
  4160. END ".#";
  4161. (** LONGREAL *)
  4162. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4163. VAR lval, rval: LONGREAL;
  4164. BEGIN
  4165. WHILE (len > 0) DO
  4166. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4167. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4168. END;
  4169. END ENeqAXAXLoop;
  4170. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4171. BEGIN
  4172. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4173. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4174. RETURN RESULT
  4175. END ".#";
  4176. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4177. (** BOOLEAN *)
  4178. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4179. VAR lval, rval: BOOLEAN;
  4180. BEGIN
  4181. SYSTEM.GET( radr, rval );
  4182. WHILE (len > 0) DO
  4183. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4184. INC( dadr, dinc ); DEC( len );
  4185. END;
  4186. END ENeqABSBLoop;
  4187. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4188. BEGIN
  4189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4190. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4191. RETURN RESULT
  4192. END ".#";
  4193. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4194. BEGIN
  4195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4196. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4197. RETURN RESULT
  4198. END ".#";
  4199. (** SHORTINT *)
  4200. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4201. VAR lval, rval: SHORTINT;
  4202. BEGIN
  4203. SYSTEM.GET( radr, rval );
  4204. WHILE (len > 0) DO
  4205. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4206. INC( dadr, dinc ); DEC( len );
  4207. END;
  4208. END ENeqASSSLoop;
  4209. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4210. BEGIN
  4211. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4212. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4213. RETURN RESULT
  4214. END ".#";
  4215. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4216. BEGIN
  4217. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4218. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4219. RETURN RESULT
  4220. END ".#";
  4221. (** INTEGER *)
  4222. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4223. VAR lval, rval: INTEGER;
  4224. BEGIN
  4225. SYSTEM.GET( radr, rval );
  4226. WHILE (len > 0) DO
  4227. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4228. INC( dadr, dinc ); DEC( len );
  4229. END;
  4230. END ENeqAISILoop;
  4231. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4232. BEGIN
  4233. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4234. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4235. RETURN RESULT
  4236. END ".#";
  4237. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4238. BEGIN
  4239. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4240. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4241. RETURN RESULT
  4242. END ".#";
  4243. (** LONGINT *)
  4244. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4245. VAR lval, rval: LONGINT;
  4246. BEGIN
  4247. SYSTEM.GET( radr, rval );
  4248. WHILE (len > 0) DO
  4249. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4250. INC( dadr, dinc ); DEC( len );
  4251. END;
  4252. END ENeqALSLLoop;
  4253. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4254. BEGIN
  4255. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4256. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4257. RETURN RESULT
  4258. END ".#";
  4259. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4260. BEGIN
  4261. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4262. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4263. RETURN RESULT
  4264. END ".#";
  4265. (** REAL *)
  4266. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4267. VAR lval, rval: REAL;
  4268. BEGIN
  4269. SYSTEM.GET( radr, rval );
  4270. WHILE (len > 0) DO
  4271. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4272. INC( dadr, dinc ); DEC( len );
  4273. END;
  4274. END ENeqARSRLoop;
  4275. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4276. BEGIN
  4277. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4278. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4279. RETURN RESULT
  4280. END ".#";
  4281. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4282. BEGIN
  4283. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4284. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4285. RETURN RESULT
  4286. END ".#";
  4287. (** LONGREAL *)
  4288. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4289. VAR lval, rval: LONGREAL;
  4290. BEGIN
  4291. SYSTEM.GET( radr, rval );
  4292. WHILE (len > 0) DO
  4293. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4294. INC( dadr, dinc ); DEC( len );
  4295. END;
  4296. END ENeqAXSXLoop;
  4297. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4298. BEGIN
  4299. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4300. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4301. RETURN RESULT
  4302. END ".#";
  4303. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4304. BEGIN
  4305. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4306. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4307. RETURN RESULT
  4308. END ".#";
  4309. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4310. (** SHORTINT *)
  4311. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4312. VAR lval, rval: SHORTINT;
  4313. BEGIN
  4314. WHILE (len > 0) DO
  4315. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4316. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4317. END;
  4318. END EGtrASASLoop;
  4319. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4320. BEGIN
  4321. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4322. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4323. RETURN RESULT
  4324. END ".>";
  4325. (** INTEGER *)
  4326. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4327. VAR lval, rval: INTEGER;
  4328. BEGIN
  4329. WHILE (len > 0) DO
  4330. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4331. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4332. END;
  4333. END EGtrAIAILoop;
  4334. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4335. BEGIN
  4336. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4337. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4338. RETURN RESULT
  4339. END ".>";
  4340. (** LONGINT *)
  4341. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4342. VAR lval, rval: LONGINT;
  4343. BEGIN
  4344. WHILE (len > 0) DO
  4345. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4346. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4347. END;
  4348. END EGtrALALLoop;
  4349. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4350. BEGIN
  4351. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4352. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4353. RETURN RESULT
  4354. END ".>";
  4355. (** REAL *)
  4356. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4357. VAR lval, rval: REAL;
  4358. BEGIN
  4359. WHILE (len > 0) DO
  4360. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4361. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4362. END;
  4363. END EGtrARARLoop;
  4364. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4365. BEGIN
  4366. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4367. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4368. RETURN RESULT
  4369. END ".>";
  4370. (** LONGREAL *)
  4371. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4372. VAR lval, rval: LONGREAL;
  4373. BEGIN
  4374. WHILE (len > 0) DO
  4375. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4376. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4377. END;
  4378. END EGtrAXAXLoop;
  4379. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4380. BEGIN
  4381. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4382. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4383. RETURN RESULT
  4384. END ".>";
  4385. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4386. (** SHORTINT *)
  4387. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4388. VAR lval, rval: SHORTINT;
  4389. BEGIN
  4390. SYSTEM.GET( radr, rval );
  4391. WHILE (len > 0) DO
  4392. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4393. INC( dadr, dinc ); DEC( len );
  4394. END;
  4395. END EGtrASSSLoop;
  4396. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4397. BEGIN
  4398. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4399. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4400. RETURN RESULT
  4401. END ".>";
  4402. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4403. BEGIN
  4404. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4405. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4406. RETURN RESULT
  4407. END ".<";
  4408. (** INTEGER *)
  4409. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4410. VAR lval, rval: INTEGER;
  4411. BEGIN
  4412. SYSTEM.GET( radr, rval );
  4413. WHILE (len > 0) DO
  4414. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4415. INC( dadr, dinc ); DEC( len );
  4416. END;
  4417. END EGtrAISILoop;
  4418. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4419. BEGIN
  4420. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4421. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4422. RETURN RESULT
  4423. END ".>";
  4424. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4425. BEGIN
  4426. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4427. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4428. RETURN RESULT
  4429. END ".<";
  4430. (** LONGINT *)
  4431. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4432. VAR lval, rval: LONGINT;
  4433. BEGIN
  4434. SYSTEM.GET( radr, rval );
  4435. WHILE (len > 0) DO
  4436. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4437. INC( dadr, dinc ); DEC( len );
  4438. END;
  4439. END EGtrALSLLoop;
  4440. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4441. BEGIN
  4442. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4443. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4444. RETURN RESULT
  4445. END ".>";
  4446. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4447. BEGIN
  4448. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4449. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4450. RETURN RESULT
  4451. END ".<";
  4452. (** REAL *)
  4453. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4454. VAR lval, rval: REAL;
  4455. BEGIN
  4456. SYSTEM.GET( radr, rval );
  4457. WHILE (len > 0) DO
  4458. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4459. INC( dadr, dinc ); DEC( len );
  4460. END;
  4461. END EGtrARSRLoop;
  4462. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4463. BEGIN
  4464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4465. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4466. RETURN RESULT
  4467. END ".>";
  4468. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4469. BEGIN
  4470. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4471. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4472. RETURN RESULT
  4473. END ".<";
  4474. (** LONGREAL *)
  4475. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4476. VAR lval, rval: LONGREAL;
  4477. BEGIN
  4478. SYSTEM.GET( radr, rval );
  4479. WHILE (len > 0) DO
  4480. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4481. INC( dadr, dinc ); DEC( len );
  4482. END;
  4483. END EGtrAXSXLoop;
  4484. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4485. BEGIN
  4486. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4487. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4488. RETURN RESULT
  4489. END ".>";
  4490. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4491. BEGIN
  4492. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4493. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4494. RETURN RESULT
  4495. END ".<";
  4496. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4497. (** SHORTINT *)
  4498. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4499. VAR lval, rval: SHORTINT;
  4500. BEGIN
  4501. WHILE (len > 0) DO
  4502. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4503. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4504. END;
  4505. END EGeqASASLoop;
  4506. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4507. BEGIN
  4508. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4509. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4510. RETURN RESULT
  4511. END ".>=";
  4512. (** INTEGER *)
  4513. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4514. VAR lval, rval: INTEGER;
  4515. BEGIN
  4516. WHILE (len > 0) DO
  4517. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4518. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4519. END;
  4520. END EGeqAIAILoop;
  4521. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4522. BEGIN
  4523. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4524. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4525. RETURN RESULT
  4526. END ".>=";
  4527. (** LONGINT *)
  4528. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4529. VAR lval, rval: LONGINT;
  4530. BEGIN
  4531. WHILE (len > 0) DO
  4532. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4533. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4534. END;
  4535. END EGeqALALLoop;
  4536. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4537. BEGIN
  4538. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4539. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4540. RETURN RESULT
  4541. END ".>=";
  4542. (** REAL *)
  4543. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4544. VAR lval, rval: REAL;
  4545. BEGIN
  4546. WHILE (len > 0) DO
  4547. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4548. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4549. END;
  4550. END EGeqARARLoop;
  4551. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4552. BEGIN
  4553. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4554. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4555. RETURN RESULT
  4556. END ".>=";
  4557. (** LONGREAL *)
  4558. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4559. VAR lval, rval: LONGREAL;
  4560. BEGIN
  4561. WHILE (len > 0) DO
  4562. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4563. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4564. END;
  4565. END EGeqAXAXLoop;
  4566. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4567. BEGIN
  4568. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4569. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4570. RETURN RESULT
  4571. END ".>=";
  4572. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4573. (** SHORTINT *)
  4574. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4575. VAR lval, rval: SHORTINT;
  4576. BEGIN
  4577. SYSTEM.GET( radr, rval );
  4578. WHILE (len > 0) DO
  4579. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4580. INC( dadr, dinc ); DEC( len );
  4581. END;
  4582. END EGeqASSSLoop;
  4583. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4584. BEGIN
  4585. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4586. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4587. RETURN RESULT
  4588. END ".>=";
  4589. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4590. BEGIN
  4591. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4592. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4593. RETURN RESULT
  4594. END ".<=";
  4595. (** INTEGER *)
  4596. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4597. VAR lval, rval: INTEGER;
  4598. BEGIN
  4599. SYSTEM.GET( radr, rval );
  4600. WHILE (len > 0) DO
  4601. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4602. INC( dadr, dinc ); DEC( len );
  4603. END;
  4604. END EGeqAISILoop;
  4605. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4606. BEGIN
  4607. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4608. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4609. RETURN RESULT
  4610. END ".>=";
  4611. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4612. BEGIN
  4613. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4614. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4615. RETURN RESULT
  4616. END ".<=";
  4617. (** LONGINT *)
  4618. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4619. VAR lval, rval: LONGINT;
  4620. BEGIN
  4621. SYSTEM.GET( radr, rval );
  4622. WHILE (len > 0) DO
  4623. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4624. INC( dadr, dinc ); DEC( len );
  4625. END;
  4626. END EGeqALSLLoop;
  4627. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4628. BEGIN
  4629. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4630. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4631. RETURN RESULT
  4632. END ".>=";
  4633. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4634. BEGIN
  4635. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4636. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4637. RETURN RESULT
  4638. END ".<=";
  4639. (** REAL *)
  4640. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4641. VAR lval, rval: REAL;
  4642. BEGIN
  4643. SYSTEM.GET( radr, rval );
  4644. WHILE (len > 0) DO
  4645. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4646. INC( dadr, dinc ); DEC( len );
  4647. END;
  4648. END EGeqARSRLoop;
  4649. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4650. BEGIN
  4651. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4652. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4653. RETURN RESULT
  4654. END ".>=";
  4655. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4656. BEGIN
  4657. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4658. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4659. RETURN RESULT
  4660. END ".<=";
  4661. (** LONGREAL *)
  4662. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4663. VAR lval, rval: LONGREAL;
  4664. BEGIN
  4665. SYSTEM.GET( radr, rval );
  4666. WHILE (len > 0) DO
  4667. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4668. INC( dadr, dinc ); DEC( len );
  4669. END;
  4670. END EGeqAXSXLoop;
  4671. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4672. BEGIN
  4673. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4674. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4675. RETURN RESULT
  4676. END ".>=";
  4677. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4678. BEGIN
  4679. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4680. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4681. RETURN RESULT
  4682. END ".<=";
  4683. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4684. (** SHORTINT *)
  4685. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4686. VAR lval, rval: SHORTINT;
  4687. BEGIN
  4688. WHILE (len > 0) DO
  4689. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4690. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4691. END;
  4692. END ELssASASLoop;
  4693. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4694. BEGIN
  4695. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4696. SIZEOF( BOOLEAN ), ELssASASLoop );
  4697. RETURN RESULT
  4698. END ".<";
  4699. (** INTEGER *)
  4700. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4701. VAR lval, rval: INTEGER;
  4702. BEGIN
  4703. WHILE (len > 0) DO
  4704. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4705. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4706. END;
  4707. END ELssAIAILoop;
  4708. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4709. BEGIN
  4710. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4711. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4712. RETURN RESULT
  4713. END ".<";
  4714. (** LONGINT*)
  4715. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4716. VAR lval, rval: LONGINT;
  4717. BEGIN
  4718. WHILE (len > 0) DO
  4719. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4720. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4721. END;
  4722. END ELssALALLoop;
  4723. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4724. BEGIN
  4725. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4726. SIZEOF( BOOLEAN ), ELssALALLoop );
  4727. RETURN RESULT
  4728. END ".<";
  4729. (** REAL *)
  4730. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4731. VAR lval, rval: REAL;
  4732. BEGIN
  4733. WHILE (len > 0) DO
  4734. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4735. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4736. END;
  4737. END ELssARARLoop;
  4738. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4739. BEGIN
  4740. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4741. SIZEOF( BOOLEAN ), ELssARARLoop );
  4742. RETURN RESULT
  4743. END ".<";
  4744. (** LONGREAL *)
  4745. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4746. VAR lval, rval: LONGREAL;
  4747. BEGIN
  4748. WHILE (len > 0) DO
  4749. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4750. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4751. END;
  4752. END ELssAXAXLoop;
  4753. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4754. BEGIN
  4755. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4756. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4757. RETURN RESULT
  4758. END ".<";
  4759. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4760. (** SHORTINT *)
  4761. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4762. VAR lval, rval: SHORTINT;
  4763. BEGIN
  4764. SYSTEM.GET( radr, rval );
  4765. WHILE (len > 0) DO
  4766. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4767. INC( dadr, dinc ); DEC( len );
  4768. END;
  4769. END ELssASSSLoop;
  4770. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4771. BEGIN
  4772. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4773. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4774. RETURN RESULT
  4775. END ".<";
  4776. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4777. BEGIN
  4778. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4779. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4780. RETURN RESULT
  4781. END ".>";
  4782. (** INTEGER *)
  4783. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4784. VAR lval, rval: INTEGER;
  4785. BEGIN
  4786. SYSTEM.GET( radr, rval );
  4787. WHILE (len > 0) DO
  4788. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4789. INC( dadr, dinc ); DEC( len );
  4790. END;
  4791. END ELssAISILoop;
  4792. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4793. BEGIN
  4794. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4795. SIZEOF( BOOLEAN ), ELssAISILoop );
  4796. RETURN RESULT
  4797. END ".<";
  4798. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4799. BEGIN
  4800. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4801. SIZEOF( BOOLEAN ), ELssAISILoop );
  4802. RETURN RESULT
  4803. END ".>";
  4804. (** LONGINT *)
  4805. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4806. VAR lval, rval: LONGINT;
  4807. BEGIN
  4808. SYSTEM.GET( radr, rval );
  4809. WHILE (len > 0) DO
  4810. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4811. INC( dadr, dinc ); DEC( len );
  4812. END;
  4813. END ELssALSLLoop;
  4814. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4815. BEGIN
  4816. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4817. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4818. RETURN RESULT
  4819. END ".<";
  4820. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4821. BEGIN
  4822. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4823. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4824. RETURN RESULT
  4825. END ".>";
  4826. (** REAL *)
  4827. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4828. VAR lval, rval: REAL;
  4829. BEGIN
  4830. SYSTEM.GET( radr, rval );
  4831. WHILE (len > 0) DO
  4832. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4833. INC( dadr, dinc ); DEC( len );
  4834. END;
  4835. END ELssARSRLoop;
  4836. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4837. BEGIN
  4838. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4839. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4840. RETURN RESULT
  4841. END ".<";
  4842. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4843. BEGIN
  4844. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4845. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4846. RETURN RESULT
  4847. END ".>";
  4848. (** LONGREAL *)
  4849. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4850. VAR lval, rval: LONGREAL;
  4851. BEGIN
  4852. SYSTEM.GET( radr, rval );
  4853. WHILE (len > 0) DO
  4854. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4855. INC( dadr, dinc ); DEC( len );
  4856. END;
  4857. END ELssAXSXLoop;
  4858. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4859. BEGIN
  4860. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4861. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4862. RETURN RESULT
  4863. END ".<";
  4864. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4865. BEGIN
  4866. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4867. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4868. RETURN RESULT
  4869. END ".>";
  4870. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4871. (** SHORTINT *)
  4872. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4873. VAR lval, rval: SHORTINT;
  4874. BEGIN
  4875. WHILE (len > 0) DO
  4876. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4877. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4878. END;
  4879. END ELeqASASLoop;
  4880. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4881. BEGIN
  4882. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4883. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4884. RETURN RESULT
  4885. END ".<=";
  4886. (** INTEGER *)
  4887. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4888. VAR lval, rval: INTEGER;
  4889. BEGIN
  4890. WHILE (len > 0) DO
  4891. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4892. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4893. END;
  4894. END ELeqAIAILoop;
  4895. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4896. BEGIN
  4897. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4898. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4899. RETURN RESULT
  4900. END ".<=";
  4901. (** LONGINT *)
  4902. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4903. VAR lval, rval: LONGINT;
  4904. BEGIN
  4905. WHILE (len > 0) DO
  4906. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4907. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4908. END;
  4909. END ELeqALALLoop;
  4910. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4911. BEGIN
  4912. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4913. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4914. RETURN RESULT
  4915. END ".<=";
  4916. (** REAL *)
  4917. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4918. VAR lval, rval: REAL;
  4919. BEGIN
  4920. WHILE (len > 0) DO
  4921. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4922. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4923. END;
  4924. END ELeqARARLoop;
  4925. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4926. BEGIN
  4927. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4928. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4929. RETURN RESULT
  4930. END ".<=";
  4931. (** LONGREAL*)
  4932. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4933. VAR lval, rval: LONGREAL;
  4934. BEGIN
  4935. WHILE (len > 0) DO
  4936. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4937. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4938. END;
  4939. END ELeqAXAXLoop;
  4940. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4941. BEGIN
  4942. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4943. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4944. RETURN RESULT
  4945. END ".<=";
  4946. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4947. (** SHORTINT *)
  4948. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4949. VAR lval, rval: SHORTINT;
  4950. BEGIN
  4951. SYSTEM.GET( radr, rval );
  4952. WHILE (len > 0) DO
  4953. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4954. INC( dadr, dinc ); DEC( len );
  4955. END;
  4956. END ELeqASSSLoop;
  4957. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4958. BEGIN
  4959. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4960. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4961. RETURN RESULT
  4962. END ".<=";
  4963. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4964. BEGIN
  4965. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4966. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4967. RETURN RESULT
  4968. END ".>=";
  4969. (** INTEGER *)
  4970. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4971. VAR lval, rval: INTEGER;
  4972. BEGIN
  4973. SYSTEM.GET( radr, rval );
  4974. WHILE (len > 0) DO
  4975. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4976. INC( dadr, dinc ); DEC( len );
  4977. END;
  4978. END ELeqAISILoop;
  4979. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4980. BEGIN
  4981. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4982. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4983. RETURN RESULT
  4984. END ".<=";
  4985. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4986. BEGIN
  4987. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4988. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4989. RETURN RESULT
  4990. END ".>=";
  4991. (** LONGINT *)
  4992. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4993. VAR lval, rval: LONGINT;
  4994. BEGIN
  4995. SYSTEM.GET( radr, rval );
  4996. WHILE (len > 0) DO
  4997. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4998. INC( dadr, dinc ); DEC( len );
  4999. END;
  5000. END ELeqALSLLoop;
  5001. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5002. BEGIN
  5003. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5004. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5005. RETURN RESULT
  5006. END ".<=";
  5007. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5008. BEGIN
  5009. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5010. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5011. RETURN RESULT
  5012. END ".>=";
  5013. (** REAL *)
  5014. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5015. VAR lval, rval: REAL;
  5016. BEGIN
  5017. SYSTEM.GET( radr, rval );
  5018. WHILE (len > 0) DO
  5019. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5020. INC( dadr, dinc ); DEC( len );
  5021. END;
  5022. END ELeqARSRLoop;
  5023. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5024. BEGIN
  5025. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5026. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5027. RETURN RESULT
  5028. END ".<=";
  5029. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5030. BEGIN
  5031. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5032. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5033. RETURN RESULT
  5034. END ".>=";
  5035. (** LONGREAL *)
  5036. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5037. VAR lval, rval: LONGREAL;
  5038. BEGIN
  5039. SYSTEM.GET( radr, rval );
  5040. WHILE (len > 0) DO
  5041. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5042. INC( dadr, dinc ); DEC( len );
  5043. END;
  5044. END ELeqAXSXLoop;
  5045. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5046. BEGIN
  5047. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5048. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5049. RETURN RESULT
  5050. END ".<=";
  5051. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5052. BEGIN
  5053. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5054. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5055. RETURN RESULT
  5056. END ".>=";
  5057. (*** elementwise or, elementwise and ********************************************************************)
  5058. (** array x array *)
  5059. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5060. VAR lval, rval: BOOLEAN;
  5061. BEGIN
  5062. WHILE (len > 0) DO
  5063. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5064. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5065. END;
  5066. END ElOrABABLoop;
  5067. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5068. BEGIN
  5069. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5070. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5071. RETURN RESULT
  5072. END "OR";
  5073. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5074. VAR lval, rval: BOOLEAN;
  5075. BEGIN
  5076. WHILE (len > 0) DO
  5077. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5078. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5079. END;
  5080. END ElAndABABLoop;
  5081. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5082. BEGIN
  5083. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5084. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5085. RETURN RESULT
  5086. END "&";
  5087. (** array x boolean *)
  5088. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5089. VAR lval, rval: BOOLEAN;
  5090. BEGIN
  5091. SYSTEM.GET( radr, rval );
  5092. WHILE (len > 0) DO
  5093. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5094. INC( dadr, dinc ); DEC( len );
  5095. END;
  5096. END ElOrABSBLoop;
  5097. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5098. BEGIN
  5099. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5100. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5101. RETURN RESULT
  5102. END "OR";
  5103. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5104. BEGIN
  5105. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5106. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5107. RETURN RESULT
  5108. END "OR";
  5109. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5110. VAR lval, rval: BOOLEAN;
  5111. BEGIN
  5112. SYSTEM.GET( radr, rval );
  5113. WHILE (len > 0) DO
  5114. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5115. INC( dadr, dinc ); DEC( len );
  5116. END;
  5117. END ElAndABSBLoop;
  5118. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5119. BEGIN
  5120. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5121. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5122. RETURN RESULT
  5123. END "&";
  5124. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5125. BEGIN
  5126. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5127. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5128. RETURN RESULT
  5129. END "&";
  5130. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5131. (** SHORTINT *)
  5132. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5133. VAR lval, rval: SHORTINT;
  5134. BEGIN
  5135. WHILE (len > 0) DO
  5136. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5137. IF rval <= lval THEN RETURN FALSE END;
  5138. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5139. END;
  5140. RETURN TRUE;
  5141. END LssASASLoop;
  5142. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5143. BEGIN
  5144. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5145. END "<";
  5146. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5147. VAR lval, rval: SHORTINT;
  5148. BEGIN
  5149. WHILE (len > 0) DO
  5150. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5151. IF rval > lval THEN RETURN FALSE END;
  5152. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5153. END;
  5154. RETURN TRUE;
  5155. END GeqASASLoop;
  5156. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5157. BEGIN
  5158. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5159. END ">=";
  5160. (** INTEGER *)
  5161. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5162. VAR lval, rval: INTEGER;
  5163. BEGIN
  5164. WHILE (len > 0) DO
  5165. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5166. IF rval <= lval THEN RETURN FALSE END;
  5167. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5168. END;
  5169. RETURN TRUE;
  5170. END LssAIAILoop;
  5171. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5172. BEGIN
  5173. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5174. END "<";
  5175. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5176. VAR lval, rval: INTEGER;
  5177. BEGIN
  5178. WHILE (len > 0) DO
  5179. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5180. IF rval > lval THEN RETURN FALSE END;
  5181. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5182. END;
  5183. RETURN TRUE;
  5184. END GeqAIAILoop;
  5185. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5186. BEGIN
  5187. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5188. END ">=";
  5189. (** LONGINT *)
  5190. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5191. VAR lval, rval: LONGINT;
  5192. BEGIN
  5193. WHILE (len > 0) DO
  5194. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5195. IF rval <= lval THEN RETURN FALSE END;
  5196. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5197. END;
  5198. RETURN TRUE;
  5199. END LssALALLoop;
  5200. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5201. BEGIN
  5202. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5203. END "<";
  5204. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5205. VAR lval, rval: LONGINT;
  5206. BEGIN
  5207. WHILE (len > 0) DO
  5208. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5209. IF rval > lval THEN RETURN FALSE END;
  5210. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5211. END;
  5212. RETURN TRUE;
  5213. END GeqALALLoop;
  5214. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5215. BEGIN
  5216. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5217. END ">=";
  5218. (** REAL *)
  5219. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5220. VAR lval, rval: REAL;
  5221. BEGIN
  5222. WHILE (len > 0) DO
  5223. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5224. IF rval <= lval THEN RETURN FALSE END;
  5225. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5226. END;
  5227. RETURN TRUE;
  5228. END LssARARLoop;
  5229. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5230. BEGIN
  5231. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5232. END "<";
  5233. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5234. VAR lval, rval: REAL;
  5235. BEGIN
  5236. WHILE (len > 0) DO
  5237. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5238. IF rval > lval THEN RETURN FALSE END;
  5239. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5240. END;
  5241. RETURN TRUE;
  5242. END GeqARARLoop;
  5243. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5244. BEGIN
  5245. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5246. END ">=";
  5247. (** LONGREAL *)
  5248. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5249. VAR lval, rval: LONGREAL;
  5250. BEGIN
  5251. WHILE (len > 0) DO
  5252. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5253. IF rval <= lval THEN RETURN FALSE END;
  5254. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5255. END;
  5256. RETURN TRUE;
  5257. END LssAXAXLoop;
  5258. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5259. BEGIN
  5260. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5261. END "<";
  5262. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5263. VAR lval, rval: LONGREAL;
  5264. BEGIN
  5265. WHILE (len > 0) DO
  5266. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5267. IF rval > lval THEN RETURN FALSE END;
  5268. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5269. END;
  5270. RETURN TRUE;
  5271. END GeqAXAXLoop;
  5272. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5273. BEGIN
  5274. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5275. END ">=";
  5276. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5277. (** SHORTINT *)
  5278. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5279. VAR lval, rval: SHORTINT;
  5280. BEGIN
  5281. WHILE (len > 0) DO
  5282. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5283. IF rval >= lval THEN RETURN FALSE END;
  5284. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5285. END;
  5286. RETURN TRUE;
  5287. END GtrASASLoop;
  5288. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5289. BEGIN
  5290. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5291. END ">";
  5292. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5293. VAR lval, rval: SHORTINT;
  5294. BEGIN
  5295. WHILE (len > 0) DO
  5296. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5297. IF rval < lval THEN RETURN FALSE END;
  5298. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5299. END;
  5300. RETURN TRUE;
  5301. END LeqASASLoop;
  5302. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5303. BEGIN
  5304. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5305. END "<=";
  5306. (** INTEGER *)
  5307. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5308. VAR lval, rval: INTEGER;
  5309. BEGIN
  5310. WHILE (len > 0) DO
  5311. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5312. IF rval >= lval THEN RETURN FALSE END;
  5313. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5314. END;
  5315. RETURN TRUE;
  5316. END GtrAIAILoop;
  5317. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5318. BEGIN
  5319. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5320. END ">";
  5321. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5322. VAR lval, rval: INTEGER;
  5323. BEGIN
  5324. WHILE (len > 0) DO
  5325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5326. IF rval < lval THEN RETURN FALSE END;
  5327. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5328. END;
  5329. RETURN TRUE;
  5330. END LeqAIAILoop;
  5331. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5332. BEGIN
  5333. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5334. END "<=";
  5335. (** LONGINT *)
  5336. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5337. VAR lval, rval: LONGINT;
  5338. BEGIN
  5339. WHILE (len > 0) DO
  5340. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5341. IF rval >= lval THEN RETURN FALSE END;
  5342. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5343. END;
  5344. RETURN TRUE;
  5345. END GtrALALLoop;
  5346. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5347. BEGIN
  5348. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5349. END ">";
  5350. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5351. VAR lval, rval: LONGINT;
  5352. BEGIN
  5353. WHILE (len > 0) DO
  5354. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5355. IF rval < lval THEN RETURN FALSE END;
  5356. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5357. END;
  5358. RETURN TRUE;
  5359. END LeqALALLoop;
  5360. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5361. BEGIN
  5362. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5363. END "<=";
  5364. (** REAL *)
  5365. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5366. VAR lval, rval: REAL;
  5367. BEGIN
  5368. WHILE (len > 0) DO
  5369. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5370. IF rval >= lval THEN RETURN FALSE END;
  5371. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5372. END;
  5373. RETURN TRUE;
  5374. END GtrARARLoop;
  5375. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5376. BEGIN
  5377. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5378. END ">";
  5379. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5380. VAR lval, rval: REAL;
  5381. BEGIN
  5382. WHILE (len > 0) DO
  5383. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5384. IF rval < lval THEN RETURN FALSE END;
  5385. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5386. END;
  5387. RETURN TRUE;
  5388. END LeqARARLoop;
  5389. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5390. BEGIN
  5391. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5392. END "<=";
  5393. (** LONGREAL *)
  5394. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5395. VAR lval, rval: LONGREAL;
  5396. BEGIN
  5397. WHILE (len > 0) DO
  5398. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5399. IF rval >= lval THEN RETURN FALSE END;
  5400. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5401. END;
  5402. RETURN TRUE;
  5403. END GtrAXAXLoop;
  5404. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5405. BEGIN
  5406. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5407. END ">";
  5408. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5409. VAR lval, rval: LONGREAL;
  5410. BEGIN
  5411. WHILE (len > 0) DO
  5412. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5413. IF rval < lval THEN RETURN FALSE END;
  5414. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5415. END;
  5416. RETURN TRUE;
  5417. END LeqAXAXLoop;
  5418. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5419. BEGIN
  5420. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5421. END "<=";
  5422. (*** equals: array x array -> boolean ********************************************************************)
  5423. (** BOOLEAN *)
  5424. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5425. VAR lval, rval: BOOLEAN;
  5426. BEGIN
  5427. WHILE (len > 0) DO
  5428. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5429. IF rval # lval THEN RETURN FALSE END;
  5430. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5431. END;
  5432. RETURN TRUE;
  5433. END EqlABABLoop;
  5434. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5435. BEGIN
  5436. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5437. END "=";
  5438. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5439. BEGIN
  5440. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5441. END "#";
  5442. (** SHORTINT *)
  5443. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5444. VAR lval, rval: SHORTINT;
  5445. BEGIN
  5446. WHILE (len > 0) DO
  5447. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5448. IF rval # lval THEN RETURN FALSE END;
  5449. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5450. END;
  5451. RETURN TRUE;
  5452. END EqlASASLoop;
  5453. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5454. BEGIN
  5455. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5456. END "=";
  5457. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5458. BEGIN
  5459. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5460. END "#";
  5461. (** INTEGER *)
  5462. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5463. VAR lval, rval: INTEGER;
  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 EqlAIAILoop;
  5472. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5473. BEGIN
  5474. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5475. END "=";
  5476. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5477. BEGIN
  5478. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5479. END "#";
  5480. (** LONGINT *)
  5481. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5482. VAR lval, rval: LONGINT;
  5483. BEGIN
  5484. WHILE (len > 0) DO
  5485. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5486. IF rval # lval THEN RETURN FALSE END;
  5487. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5488. END;
  5489. RETURN TRUE;
  5490. END EqlALALLoop;
  5491. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5492. BEGIN
  5493. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5494. END "=";
  5495. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5496. BEGIN
  5497. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5498. END "#";
  5499. (** REAL *)
  5500. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5501. VAR lval, rval: REAL;
  5502. BEGIN
  5503. WHILE (len > 0) DO
  5504. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5505. IF rval # lval THEN RETURN FALSE END;
  5506. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5507. END;
  5508. RETURN TRUE;
  5509. END EqlARARLoop;
  5510. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5511. BEGIN
  5512. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5513. END "=";
  5514. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5515. BEGIN
  5516. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5517. END "#";
  5518. (** LONGREAL *)
  5519. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5520. VAR lval, rval: LONGREAL;
  5521. BEGIN
  5522. WHILE (len > 0) DO
  5523. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5524. IF rval # lval THEN RETURN FALSE END;
  5525. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5526. END;
  5527. RETURN TRUE;
  5528. END EqlAXAXLoop;
  5529. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5530. BEGIN
  5531. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5532. END "=";
  5533. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5534. BEGIN
  5535. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5536. END "#";
  5537. (** COMPLEX *)
  5538. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5539. VAR lval, rval: COMPLEX;
  5540. BEGIN
  5541. WHILE (len > 0) DO
  5542. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5543. IF rval # lval THEN RETURN FALSE END;
  5544. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5545. END;
  5546. RETURN TRUE;
  5547. END EqlAZAZLoop;
  5548. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5549. BEGIN
  5550. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5551. END "=";
  5552. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5553. BEGIN
  5554. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5555. END "#";
  5556. (** LONGCOMPLEX *)
  5557. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5558. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5559. BEGIN
  5560. WHILE (len > 0) DO
  5561. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5562. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5563. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5564. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5565. END;
  5566. RETURN TRUE;
  5567. END EqlALZALZLoop;
  5568. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5569. BEGIN
  5570. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5571. END "=";
  5572. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5573. BEGIN
  5574. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5575. END "#";
  5576. (*** equals: array x scalar -> boolean ********************************************************************)
  5577. (** BOOLEAN *)
  5578. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5579. VAR lval, rval: BOOLEAN;
  5580. BEGIN
  5581. SYSTEM.GET( radr, rval );
  5582. WHILE (len > 0) DO
  5583. SYSTEM.GET( ladr, lval );
  5584. IF lval # rval THEN RETURN FALSE END;
  5585. INC( ladr, linc ); DEC( len );
  5586. END;
  5587. RETURN TRUE;
  5588. END EqlABSBLoop;
  5589. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5590. right: BOOLEAN ): BOOLEAN;
  5591. BEGIN
  5592. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5593. END "=";
  5594. OPERATOR "="*( left: BOOLEAN;
  5595. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5596. BEGIN
  5597. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5598. END "=";
  5599. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5600. right: BOOLEAN ): BOOLEAN;
  5601. BEGIN
  5602. RETURN ~(left = right);
  5603. END "#";
  5604. OPERATOR "#"*( left: BOOLEAN;
  5605. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5606. BEGIN
  5607. RETURN ~( left = right );
  5608. END "#";
  5609. (** SHORTINT *)
  5610. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5611. VAR lval, rval: SHORTINT;
  5612. BEGIN
  5613. SYSTEM.GET( radr, rval );
  5614. WHILE (len > 0) DO
  5615. SYSTEM.GET( ladr, lval );
  5616. IF lval # rval THEN RETURN FALSE END;
  5617. INC( ladr, linc ); DEC( len );
  5618. END;
  5619. RETURN TRUE;
  5620. END EqlASSSLoop;
  5621. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5622. BEGIN
  5623. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5624. END "=";
  5625. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5626. BEGIN
  5627. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5628. END "=";
  5629. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5630. BEGIN
  5631. RETURN ~( left= right );
  5632. END "#";
  5633. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5634. BEGIN
  5635. RETURN ~( left= right );
  5636. END "#";
  5637. (** INTEGER *)
  5638. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5639. VAR lval, rval: INTEGER;
  5640. BEGIN
  5641. SYSTEM.GET( radr, rval );
  5642. WHILE (len > 0) DO
  5643. SYSTEM.GET( ladr, lval );
  5644. IF lval # rval THEN RETURN FALSE END;
  5645. INC( ladr, linc ); DEC( len );
  5646. END;
  5647. RETURN TRUE;
  5648. END EqlAISILoop;
  5649. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5650. BEGIN
  5651. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5652. END "=";
  5653. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5654. BEGIN
  5655. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5656. END "=";
  5657. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5658. BEGIN
  5659. RETURN ~( left = right );
  5660. END "#";
  5661. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5662. BEGIN
  5663. RETURN ~( left = right );
  5664. END "#";
  5665. (** LONGINT *)
  5666. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5667. VAR lval, rval: LONGINT;
  5668. BEGIN
  5669. SYSTEM.GET( radr, rval );
  5670. WHILE (len > 0) DO
  5671. SYSTEM.GET( ladr, lval );
  5672. IF lval # rval THEN RETURN FALSE END;
  5673. INC( ladr, linc ); DEC( len );
  5674. END;
  5675. RETURN TRUE;
  5676. END EqlALSLLoop;
  5677. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5678. right: LONGINT ): BOOLEAN;
  5679. BEGIN
  5680. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5681. END "=";
  5682. OPERATOR "="*( left: LONGINT;
  5683. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5684. BEGIN
  5685. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5686. END "=";
  5687. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5688. right: LONGINT ): BOOLEAN;
  5689. BEGIN
  5690. RETURN ~(left = right);
  5691. END "#";
  5692. OPERATOR "#"*( left: LONGINT;
  5693. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5694. BEGIN
  5695. RETURN ~(left = right);
  5696. END "#";
  5697. (** REAL *)
  5698. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5699. VAR lval, rval: REAL;
  5700. BEGIN
  5701. SYSTEM.GET( radr, rval );
  5702. WHILE (len > 0) DO
  5703. SYSTEM.GET( ladr, lval );
  5704. IF lval # rval THEN RETURN FALSE END;
  5705. INC( ladr, linc ); DEC( len );
  5706. END;
  5707. RETURN TRUE;
  5708. END EqlARSRLoop;
  5709. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5710. right: REAL ): BOOLEAN;
  5711. BEGIN
  5712. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5713. END "=";
  5714. OPERATOR "="*( left: REAL;
  5715. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5716. BEGIN
  5717. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5718. END "=";
  5719. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5720. right: REAL ): BOOLEAN;
  5721. BEGIN
  5722. RETURN ~( left = right );
  5723. END "#";
  5724. OPERATOR "#"*( left: REAL;
  5725. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5726. BEGIN
  5727. RETURN ~( left = right );
  5728. END "#";
  5729. (** LONGREAL *)
  5730. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5731. VAR lval, rval: LONGREAL;
  5732. BEGIN
  5733. SYSTEM.GET( radr, rval );
  5734. WHILE (len > 0) DO
  5735. SYSTEM.GET( ladr, lval );
  5736. IF lval # rval THEN RETURN FALSE END;
  5737. INC( ladr, linc ); DEC( len );
  5738. END;
  5739. RETURN TRUE;
  5740. END EqlAXSXLoop;
  5741. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5742. right: LONGREAL ): BOOLEAN;
  5743. BEGIN
  5744. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5745. END "=";
  5746. OPERATOR "="*( left: LONGREAL;
  5747. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5748. BEGIN
  5749. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5750. END "=";
  5751. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5752. right: LONGREAL ): BOOLEAN;
  5753. BEGIN
  5754. RETURN ~( left = right );
  5755. END "#";
  5756. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5757. BEGIN
  5758. RETURN ~( left= right );
  5759. END "#";
  5760. (*** gtr : array x scalar -> boolean ********************************************************************)
  5761. (** SHORTINT *)
  5762. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5763. VAR lval, rval: SHORTINT;
  5764. BEGIN
  5765. SYSTEM.GET( radr, rval );
  5766. WHILE (len > 0) DO
  5767. SYSTEM.GET( ladr, lval );
  5768. IF lval <= rval THEN RETURN FALSE END;
  5769. INC( ladr, linc ); DEC( len );
  5770. END;
  5771. RETURN TRUE;
  5772. END GtrASSSLoop;
  5773. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5774. BEGIN
  5775. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5776. END ">";
  5777. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5778. BEGIN
  5779. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5780. END "<";
  5781. (** INTEGER *)
  5782. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5783. VAR lval, rval: INTEGER;
  5784. BEGIN
  5785. SYSTEM.GET( radr, rval );
  5786. WHILE (len > 0) DO
  5787. SYSTEM.GET( ladr, lval );
  5788. IF lval <= rval THEN RETURN FALSE END;
  5789. INC( ladr, linc ); DEC( len );
  5790. END;
  5791. RETURN TRUE;
  5792. END GtrAISILoop;
  5793. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5794. BEGIN
  5795. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5796. END ">";
  5797. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5798. BEGIN
  5799. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5800. END "<";
  5801. (** LONGINT *)
  5802. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5803. VAR lval, rval: LONGINT;
  5804. BEGIN
  5805. SYSTEM.GET( radr, rval );
  5806. WHILE (len > 0) DO
  5807. SYSTEM.GET( ladr, lval );
  5808. IF lval <= rval THEN RETURN FALSE END;
  5809. INC( ladr, linc ); DEC( len );
  5810. END;
  5811. RETURN TRUE;
  5812. END GtrALSLLoop;
  5813. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5814. BEGIN
  5815. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5816. END ">";
  5817. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5818. BEGIN
  5819. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5820. END "<";
  5821. (** REAL *)
  5822. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5823. VAR lval, rval: REAL;
  5824. BEGIN
  5825. SYSTEM.GET( radr, rval );
  5826. WHILE (len > 0) DO
  5827. SYSTEM.GET( ladr, lval );
  5828. IF lval <= rval THEN RETURN FALSE END;
  5829. INC( ladr, linc ); DEC( len );
  5830. END;
  5831. RETURN TRUE;
  5832. END GtrARSRLoop;
  5833. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5834. right: REAL ): BOOLEAN;
  5835. BEGIN
  5836. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5837. END ">";
  5838. OPERATOR "<"*( left: REAL;
  5839. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5840. BEGIN
  5841. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5842. END "<";
  5843. (** LONGREAL *)
  5844. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5845. VAR lval, rval: LONGREAL;
  5846. BEGIN
  5847. SYSTEM.GET( radr, rval );
  5848. WHILE (len > 0) DO
  5849. SYSTEM.GET( ladr, lval );
  5850. IF lval <= rval THEN RETURN FALSE END;
  5851. INC( ladr, linc ); DEC( len );
  5852. END;
  5853. RETURN TRUE;
  5854. END GtrAXSXLoop;
  5855. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5856. right: LONGREAL ): BOOLEAN;
  5857. BEGIN
  5858. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5859. END ">";
  5860. OPERATOR "<"*( left: LONGREAL;
  5861. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5862. BEGIN
  5863. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5864. END "<";
  5865. (*** geq : array x scalar -> boolean ********************************************************************)
  5866. (** SHORTINT *)
  5867. PROCEDURE GeqASSSLoop( 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 GeqASSSLoop;
  5878. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5879. right: SHORTINT ): BOOLEAN;
  5880. BEGIN
  5881. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5882. END ">=";
  5883. OPERATOR "<="*( left: SHORTINT;
  5884. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5885. BEGIN
  5886. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5887. END "<=";
  5888. (** INTEGER *)
  5889. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5890. VAR lval, rval: INTEGER;
  5891. BEGIN
  5892. SYSTEM.GET( radr, rval );
  5893. WHILE (len > 0) DO
  5894. SYSTEM.GET( ladr, lval );
  5895. IF lval < rval THEN RETURN FALSE END;
  5896. INC( ladr, linc ); DEC( len );
  5897. END;
  5898. RETURN TRUE;
  5899. END GeqAISILoop;
  5900. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5901. BEGIN
  5902. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5903. END ">=";
  5904. OPERATOR "<="*( left: INTEGER;
  5905. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5906. BEGIN
  5907. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5908. END "<=";
  5909. (** LONGINT *)
  5910. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5911. VAR lval, rval: LONGINT;
  5912. BEGIN
  5913. SYSTEM.GET( radr, rval );
  5914. WHILE (len > 0) DO
  5915. SYSTEM.GET( ladr, lval );
  5916. IF lval < rval THEN RETURN FALSE END;
  5917. INC( ladr, linc ); DEC( len );
  5918. END;
  5919. RETURN TRUE;
  5920. END GeqALSLLoop;
  5921. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5922. right: LONGINT ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5925. END ">=";
  5926. OPERATOR "<="*( left: LONGINT;
  5927. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5928. BEGIN
  5929. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5930. END "<=";
  5931. (** REAL *)
  5932. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5933. VAR lval, rval: REAL;
  5934. BEGIN
  5935. SYSTEM.GET( radr, rval );
  5936. WHILE (len > 0) DO
  5937. SYSTEM.GET( ladr, lval );
  5938. IF lval < rval THEN RETURN FALSE END;
  5939. INC( ladr, linc ); DEC( len );
  5940. END;
  5941. RETURN TRUE;
  5942. END GeqARSRLoop;
  5943. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5944. right: REAL ): BOOLEAN;
  5945. BEGIN
  5946. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5947. END ">=";
  5948. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5949. BEGIN
  5950. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5951. END "<=";
  5952. (** LONGREAL *)
  5953. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5954. VAR lval, rval: LONGREAL;
  5955. BEGIN
  5956. SYSTEM.GET( radr, rval );
  5957. WHILE (len > 0) DO
  5958. SYSTEM.GET( ladr, lval );
  5959. IF lval < rval THEN RETURN FALSE END;
  5960. INC( ladr, linc ); DEC( len );
  5961. END;
  5962. RETURN TRUE;
  5963. END GeqAXSXLoop;
  5964. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5965. BEGIN
  5966. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5967. END ">=";
  5968. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5969. BEGIN
  5970. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5971. END "<=";
  5972. (*** leq : array x scalar -> boolean ********************************************************************)
  5973. (** SHORTINT *)
  5974. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5975. VAR lval, rval: SHORTINT;
  5976. BEGIN
  5977. SYSTEM.GET( radr, rval );
  5978. WHILE (len > 0) DO
  5979. SYSTEM.GET( ladr, lval );
  5980. IF lval > rval THEN RETURN FALSE END;
  5981. INC( ladr, linc ); DEC( len );
  5982. END;
  5983. RETURN TRUE;
  5984. END LeqASSSLoop;
  5985. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5986. BEGIN
  5987. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5988. END "<=";
  5989. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5990. BEGIN
  5991. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5992. END ">=";
  5993. (** INTEGER *)
  5994. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5995. VAR lval, rval: INTEGER;
  5996. BEGIN
  5997. SYSTEM.GET( radr, rval );
  5998. WHILE (len > 0) DO
  5999. SYSTEM.GET( ladr, lval );
  6000. IF lval > rval THEN RETURN FALSE END;
  6001. INC( ladr, linc ); DEC( len );
  6002. END;
  6003. RETURN TRUE;
  6004. END LeqAISILoop;
  6005. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6006. BEGIN
  6007. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6008. END "<=";
  6009. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6010. BEGIN
  6011. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6012. END ">=";
  6013. (** LONGINT *)
  6014. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6015. VAR lval, rval: LONGINT;
  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 LeqALSLLoop;
  6025. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6026. BEGIN
  6027. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6028. END "<=";
  6029. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6030. BEGIN
  6031. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6032. END ">=";
  6033. (** REAL *)
  6034. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6035. VAR lval, rval: REAL;
  6036. BEGIN
  6037. SYSTEM.GET( radr, rval );
  6038. WHILE (len > 0) DO
  6039. SYSTEM.GET( ladr, lval );
  6040. IF lval > rval THEN RETURN FALSE END;
  6041. INC( ladr, linc ); DEC( len );
  6042. END;
  6043. RETURN TRUE;
  6044. END LeqARSRLoop;
  6045. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6046. BEGIN
  6047. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6048. END "<=";
  6049. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6050. BEGIN
  6051. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6052. END ">=";
  6053. (** LONGREAL *)
  6054. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6055. VAR lval, rval: LONGREAL;
  6056. BEGIN
  6057. SYSTEM.GET( radr, rval );
  6058. WHILE (len > 0) DO
  6059. SYSTEM.GET( ladr, lval );
  6060. IF lval > rval THEN RETURN FALSE END;
  6061. INC( ladr, linc ); DEC( len );
  6062. END;
  6063. RETURN TRUE;
  6064. END LeqAXSXLoop;
  6065. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6066. BEGIN
  6067. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6068. END "<=";
  6069. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6070. BEGIN
  6071. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6072. END ">=";
  6073. (*** lss: array x scalar -> boolean ********************************************************************)
  6074. (** SHORTINT *)
  6075. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6076. VAR lval, rval: SHORTINT;
  6077. BEGIN
  6078. SYSTEM.GET( radr, rval );
  6079. WHILE (len > 0) DO
  6080. SYSTEM.GET( ladr, lval );
  6081. IF lval >= rval THEN RETURN FALSE END;
  6082. INC( ladr, linc ); DEC( len );
  6083. END;
  6084. RETURN TRUE;
  6085. END LssASSSLoop;
  6086. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6087. BEGIN
  6088. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6089. END "<";
  6090. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6091. BEGIN
  6092. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6093. END ">";
  6094. (** INTEGER *)
  6095. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6096. VAR lval, rval: INTEGER;
  6097. BEGIN
  6098. SYSTEM.GET( radr, rval );
  6099. WHILE (len > 0) DO
  6100. SYSTEM.GET( ladr, lval );
  6101. IF lval >= rval THEN RETURN FALSE END;
  6102. INC( ladr, linc ); DEC( len );
  6103. END;
  6104. RETURN TRUE;
  6105. END LssAISILoop;
  6106. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6107. BEGIN
  6108. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6109. END "<";
  6110. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6111. BEGIN
  6112. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6113. END ">";
  6114. (** LONGINT *)
  6115. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6116. VAR lval, rval: LONGINT;
  6117. BEGIN
  6118. SYSTEM.GET( radr, rval );
  6119. WHILE (len > 0) DO
  6120. SYSTEM.GET( ladr, lval );
  6121. IF lval >= rval THEN RETURN FALSE END;
  6122. INC( ladr, linc ); DEC( len );
  6123. END;
  6124. RETURN TRUE;
  6125. END LssALSLLoop;
  6126. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6127. BEGIN
  6128. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6129. END "<";
  6130. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6131. BEGIN
  6132. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6133. END ">";
  6134. (** REAL *)
  6135. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6136. VAR lval, rval: REAL;
  6137. BEGIN
  6138. SYSTEM.GET( radr, rval );
  6139. WHILE (len > 0) DO
  6140. SYSTEM.GET( ladr, lval );
  6141. IF lval >= rval THEN RETURN FALSE END;
  6142. INC( ladr, linc ); DEC( len );
  6143. END;
  6144. RETURN TRUE;
  6145. END LssARSRLoop;
  6146. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6147. right: REAL ): BOOLEAN;
  6148. BEGIN
  6149. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6150. END "<";
  6151. OPERATOR ">"*( left: REAL;
  6152. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6153. BEGIN
  6154. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6155. END ">";
  6156. (** LONGREAL *)
  6157. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6158. VAR lval, rval: LONGREAL;
  6159. BEGIN
  6160. SYSTEM.GET( radr, rval );
  6161. WHILE (len > 0) DO
  6162. SYSTEM.GET( ladr, lval );
  6163. IF lval >= rval THEN RETURN FALSE END;
  6164. INC( ladr, linc ); DEC( len );
  6165. END;
  6166. RETURN TRUE;
  6167. END LssAXSXLoop;
  6168. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6169. right: LONGREAL ): BOOLEAN;
  6170. BEGIN
  6171. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6172. END "<";
  6173. OPERATOR ">"*( left: LONGREAL;
  6174. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6175. BEGIN
  6176. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6177. END ">";
  6178. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6179. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6180. VAR lval, val: LONGREAL;
  6181. BEGIN
  6182. SYSTEM.GET( radr, val );
  6183. WHILE (len > 0) DO
  6184. SYSTEM.GET( ladr, lval );
  6185. INC( ladr, linc ); DEC( len );
  6186. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6187. INC(dadr,dinc);
  6188. END;
  6189. END MaxAXSXLoop;
  6190. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6191. TYPE Type = LONGREAL;
  6192. BEGIN
  6193. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6194. RETURN RESULT
  6195. END "MAX";
  6196. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6197. VAR lval, val: REAL;
  6198. BEGIN
  6199. SYSTEM.GET( radr, val );
  6200. WHILE (len > 0) DO
  6201. SYSTEM.GET( ladr, lval );
  6202. INC( ladr, linc ); DEC( len );
  6203. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6204. INC(dadr,dinc);
  6205. END;
  6206. END MaxARSRLoop;
  6207. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6208. TYPE Type = REAL;
  6209. BEGIN
  6210. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6211. RETURN RESULT
  6212. END "MAX";
  6213. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6214. VAR lval, val: LONGINT;
  6215. BEGIN
  6216. SYSTEM.GET( radr, val );
  6217. WHILE (len > 0) DO
  6218. SYSTEM.GET( ladr, lval );
  6219. INC( ladr, linc ); DEC( len );
  6220. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6221. INC(dadr,dinc);
  6222. END;
  6223. END MaxALSLLoop;
  6224. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6225. TYPE Type = LONGINT;
  6226. BEGIN
  6227. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6228. RETURN RESULT
  6229. END "MAX";
  6230. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6231. VAR lval, val: INTEGER;
  6232. BEGIN
  6233. SYSTEM.GET( radr, val );
  6234. WHILE (len > 0) DO
  6235. SYSTEM.GET( ladr, lval );
  6236. INC( ladr, linc ); DEC( len );
  6237. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6238. INC(dadr,dinc);
  6239. END;
  6240. END MaxAISILoop;
  6241. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6242. TYPE Type = INTEGER;
  6243. BEGIN
  6244. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6245. RETURN RESULT
  6246. END "MAX";
  6247. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6248. VAR lval, val: SHORTINT;
  6249. BEGIN
  6250. SYSTEM.GET( radr, val );
  6251. WHILE (len > 0) DO
  6252. SYSTEM.GET( ladr, lval );
  6253. INC( ladr, linc ); DEC( len );
  6254. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6255. INC(dadr,dinc);
  6256. END;
  6257. END MaxASSSLoop;
  6258. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6259. TYPE Type = SHORTINT;
  6260. BEGIN
  6261. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6262. RETURN RESULT
  6263. END "MAX";
  6264. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6265. VAR lval, val: LONGREAL;
  6266. BEGIN
  6267. SYSTEM.GET( radr, val );
  6268. WHILE (len > 0) DO
  6269. SYSTEM.GET( ladr, lval );
  6270. INC( ladr, linc ); DEC( len );
  6271. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6272. INC(dadr,dinc);
  6273. END;
  6274. END MinAXSXLoop;
  6275. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6276. TYPE Type = LONGREAL;
  6277. BEGIN
  6278. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6279. RETURN RESULT
  6280. END "MIN";
  6281. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6282. VAR lval, val: REAL;
  6283. BEGIN
  6284. SYSTEM.GET( radr, val );
  6285. WHILE (len > 0) DO
  6286. SYSTEM.GET( ladr, lval );
  6287. INC( ladr, linc ); DEC( len );
  6288. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6289. INC(dadr,dinc);
  6290. END;
  6291. END MinARSRLoop;
  6292. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6293. TYPE Type = REAL;
  6294. BEGIN
  6295. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6296. RETURN RESULT
  6297. END "MIN";
  6298. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6299. VAR lval, val: LONGINT;
  6300. BEGIN
  6301. SYSTEM.GET( radr, val );
  6302. WHILE (len > 0) DO
  6303. SYSTEM.GET( ladr, lval );
  6304. INC( ladr, linc ); DEC( len );
  6305. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6306. INC(dadr,dinc);
  6307. END;
  6308. END MinALSLLoop;
  6309. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6310. TYPE Type = LONGINT;
  6311. BEGIN
  6312. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6313. RETURN RESULT
  6314. END "MIN";
  6315. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6316. VAR lval, val: INTEGER;
  6317. BEGIN
  6318. SYSTEM.GET( radr, val );
  6319. WHILE (len > 0) DO
  6320. SYSTEM.GET( ladr, lval );
  6321. INC( ladr, linc ); DEC( len );
  6322. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6323. INC(dadr,dinc);
  6324. END;
  6325. END MinAISILoop;
  6326. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6327. TYPE Type = INTEGER;
  6328. BEGIN
  6329. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6330. RETURN RESULT
  6331. END "MIN";
  6332. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6333. VAR lval, val: SHORTINT;
  6334. BEGIN
  6335. SYSTEM.GET( radr, val );
  6336. WHILE (len > 0) DO
  6337. SYSTEM.GET( ladr, lval );
  6338. INC( ladr, linc ); DEC( len );
  6339. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6340. INC(dadr,dinc);
  6341. END;
  6342. END MinASSSLoop;
  6343. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6344. TYPE Type = SHORTINT;
  6345. BEGIN
  6346. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6347. RETURN RESULT
  6348. END "MIN";
  6349. (**** binary max/min operators array x array -> array ********************************************************************)
  6350. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6351. VAR lval, rval: LONGREAL;
  6352. BEGIN
  6353. WHILE (len > 0) DO
  6354. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6355. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6356. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6357. INC(dadr,dinc);
  6358. END;
  6359. END MaxAXAXLoop;
  6360. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6361. BEGIN
  6362. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6363. RETURN RESULT
  6364. END "MAX";
  6365. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6366. VAR lval, rval: REAL ;
  6367. BEGIN
  6368. WHILE (len > 0) DO
  6369. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6370. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6371. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6372. INC(dadr,dinc);
  6373. END;
  6374. END MaxARARLoop;
  6375. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6376. BEGIN
  6377. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6378. RETURN RESULT
  6379. END "MAX";
  6380. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6381. VAR lval, rval: LONGINT;
  6382. BEGIN
  6383. WHILE (len > 0) DO
  6384. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6385. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6386. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6387. INC(dadr,dinc);
  6388. END;
  6389. END MaxALALLoop;
  6390. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6391. BEGIN
  6392. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6393. RETURN RESULT
  6394. END "MAX";
  6395. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6396. VAR lval, rval: INTEGER;
  6397. BEGIN
  6398. WHILE (len > 0) DO
  6399. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6400. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6401. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6402. INC(dadr,dinc);
  6403. END;
  6404. END MaxAIAILoop;
  6405. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6406. BEGIN
  6407. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6408. RETURN RESULT
  6409. END "MAX";
  6410. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6411. VAR lval, rval: SHORTINT;
  6412. BEGIN
  6413. WHILE (len > 0) DO
  6414. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6415. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6416. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6417. INC(dadr,dinc);
  6418. END;
  6419. END MaxASASLoop;
  6420. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6421. BEGIN
  6422. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6423. RETURN RESULT
  6424. END "MAX";
  6425. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6426. VAR lval, rval: LONGREAL;
  6427. BEGIN
  6428. WHILE (len > 0) DO
  6429. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6430. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6431. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6432. INC(dadr,dinc);
  6433. END;
  6434. END MinAXAXLoop;
  6435. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6436. BEGIN
  6437. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6438. RETURN RESULT
  6439. END "MIN";
  6440. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6441. VAR lval, rval: REAL ;
  6442. BEGIN
  6443. WHILE (len > 0) DO
  6444. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6445. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6446. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6447. INC(dadr,dinc);
  6448. END;
  6449. END MinARARLoop;
  6450. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6451. BEGIN
  6452. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6453. RETURN RESULT
  6454. END "MIN";
  6455. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6456. VAR lval, rval: LONGINT;
  6457. BEGIN
  6458. WHILE (len > 0) DO
  6459. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6460. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6461. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6462. INC(dadr,dinc);
  6463. END;
  6464. END MinALALLoop;
  6465. *)
  6466. TYPE
  6467. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6468. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6469. BEGIN
  6470. WHILE (len > 0) DO
  6471. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6472. ladr := ladr + linc;
  6473. radr := radr + rinc;
  6474. dadr := dadr + dinc;
  6475. DEC(len);
  6476. END;
  6477. END MinALALLoop;
  6478. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6479. BEGIN
  6480. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6481. RETURN RESULT
  6482. END "MIN";
  6483. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6484. VAR lval, rval: INTEGER;
  6485. BEGIN
  6486. WHILE (len > 0) DO
  6487. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6488. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6489. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6490. INC(dadr,dinc);
  6491. END;
  6492. END MinAIAILoop;
  6493. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6494. BEGIN
  6495. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6496. RETURN RESULT
  6497. END "MIN";
  6498. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6499. VAR lval, rval: SHORTINT;
  6500. BEGIN
  6501. WHILE (len > 0) DO
  6502. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6503. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6504. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6505. INC(dadr,dinc);
  6506. END;
  6507. END MinASASLoop;
  6508. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6509. BEGIN
  6510. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6511. RETURN RESULT
  6512. END "MIN";
  6513. (**** unary operators array -> scalar ********************************************************************)
  6514. (*** min: array -> scalar ****************************************)
  6515. (** SHORTINT *)
  6516. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6517. VAR lval, dval: SHORTINT;
  6518. BEGIN
  6519. SYSTEM.GET( dadr, dval );
  6520. WHILE (len > 0) DO
  6521. SYSTEM.GET( ladr, lval );
  6522. IF lval < dval THEN dval := lval END;
  6523. INC( ladr, linc ); DEC( len );
  6524. END;
  6525. SYSTEM.PUT( dadr, dval );
  6526. END MinASLoop;
  6527. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6528. TYPE Type = SHORTINT;
  6529. VAR val: Type;
  6530. BEGIN
  6531. val := MAX( Type );
  6532. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6533. END "MIN";
  6534. (** INTEGER *)
  6535. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6536. VAR lval, dval: INTEGER;
  6537. BEGIN
  6538. SYSTEM.GET( dadr, dval );
  6539. WHILE (len > 0) DO
  6540. SYSTEM.GET( ladr, lval );
  6541. IF lval < dval THEN dval := lval END;
  6542. INC( ladr, linc ); DEC( len );
  6543. END;
  6544. SYSTEM.PUT( dadr, dval );
  6545. END MinAILoop;
  6546. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6547. TYPE Type = INTEGER;
  6548. VAR val: Type;
  6549. BEGIN
  6550. val := MAX( Type );
  6551. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6552. END "MIN";
  6553. (** LONGINT *)
  6554. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6555. VAR lval, dval: LONGINT;
  6556. BEGIN
  6557. SYSTEM.GET( dadr, dval );
  6558. WHILE (len > 0) DO
  6559. SYSTEM.GET( ladr, lval );
  6560. IF lval < dval THEN dval := lval END;
  6561. INC( ladr, linc ); DEC( len );
  6562. END;
  6563. SYSTEM.PUT( dadr, dval );
  6564. END MinALLoop;
  6565. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6566. TYPE Type = LONGINT;
  6567. VAR val: Type;
  6568. BEGIN
  6569. val := MAX( Type );
  6570. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6571. END "MIN";
  6572. (** REAL *)
  6573. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6574. VAR lval, dval: REAL;
  6575. BEGIN
  6576. SYSTEM.GET( dadr, dval );
  6577. WHILE (len > 0) DO
  6578. SYSTEM.GET( ladr, lval );
  6579. IF lval < dval THEN dval := lval END;
  6580. INC( ladr, linc ); DEC( len );
  6581. END;
  6582. SYSTEM.PUT( dadr, dval );
  6583. END MinARLoop;
  6584. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6585. TYPE Type = REAL;
  6586. VAR val: Type;
  6587. BEGIN
  6588. val := MAX( Type );
  6589. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6590. END "MIN";
  6591. (** LONGREAL *)
  6592. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6593. VAR lval, dval: LONGREAL;
  6594. BEGIN
  6595. SYSTEM.GET( dadr, dval );
  6596. WHILE (len > 0) DO
  6597. SYSTEM.GET( ladr, lval );
  6598. IF lval < dval THEN dval := lval END;
  6599. INC( ladr, linc ); DEC( len );
  6600. END;
  6601. SYSTEM.PUT( dadr, dval );
  6602. END MinAXLoop;
  6603. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6604. TYPE Type = LONGREAL;
  6605. VAR val: Type;
  6606. BEGIN
  6607. val := MAX( Type );
  6608. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6609. END "MIN";
  6610. (*** max: array -> scalar ********************************************************************)
  6611. (** SHORTINT *)
  6612. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6613. VAR lval, dval: SHORTINT;
  6614. BEGIN
  6615. SYSTEM.GET( dadr, dval );
  6616. WHILE (len > 0) DO
  6617. SYSTEM.GET( ladr, lval );
  6618. IF lval > dval THEN dval := lval END;
  6619. INC( ladr, linc ); DEC( len );
  6620. END;
  6621. SYSTEM.PUT( dadr, dval );
  6622. END MaxASLoop;
  6623. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6624. TYPE Type = SHORTINT;
  6625. VAR val: Type;
  6626. BEGIN
  6627. val := MIN( Type );
  6628. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6629. END "MAX";
  6630. (** INTEGER *)
  6631. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6632. VAR lval, dval: INTEGER;
  6633. BEGIN
  6634. SYSTEM.GET( dadr, dval );
  6635. WHILE (len > 0) DO
  6636. SYSTEM.GET( ladr, lval );
  6637. IF lval > dval THEN dval := lval END;
  6638. INC( ladr, linc ); DEC( len );
  6639. END;
  6640. SYSTEM.PUT( dadr, dval );
  6641. END MaxAILoop;
  6642. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6643. TYPE Type = INTEGER;
  6644. VAR val: Type;
  6645. BEGIN
  6646. val := MIN( Type );
  6647. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6648. END "MAX";
  6649. (** LONGINT *)
  6650. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6651. VAR lval, dval: LONGINT;
  6652. BEGIN
  6653. SYSTEM.GET( dadr, dval );
  6654. WHILE (len > 0) DO
  6655. SYSTEM.GET( ladr, lval );
  6656. IF lval > dval THEN dval := lval END;
  6657. INC( ladr, linc ); DEC( len );
  6658. END;
  6659. SYSTEM.PUT( dadr, dval );
  6660. END MaxALLoop;
  6661. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6662. TYPE Type = LONGINT;
  6663. VAR val: Type;
  6664. BEGIN
  6665. val := MIN( Type );
  6666. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6667. END "MAX";
  6668. (** REAL *)
  6669. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6670. VAR lval, dval: REAL;
  6671. BEGIN
  6672. SYSTEM.GET( dadr, dval );
  6673. WHILE (len > 0) DO
  6674. SYSTEM.GET( ladr, lval );
  6675. IF lval > dval THEN dval := lval END;
  6676. INC( ladr, linc ); DEC( len );
  6677. END;
  6678. SYSTEM.PUT( dadr, dval );
  6679. END MaxARLoop;
  6680. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6681. TYPE Type = REAL;
  6682. VAR val: Type;
  6683. BEGIN
  6684. val := MIN( Type );
  6685. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6686. END "MAX";
  6687. (** LONGREAL *)
  6688. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6689. VAR lval, dval: LONGREAL;
  6690. BEGIN
  6691. SYSTEM.GET( dadr, dval );
  6692. WHILE (len > 0) DO
  6693. SYSTEM.GET( ladr, lval );
  6694. IF lval > dval THEN dval := lval END;
  6695. INC( ladr, linc ); DEC( len );
  6696. END;
  6697. SYSTEM.PUT( dadr, dval );
  6698. END MaxAXLoop;
  6699. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6700. TYPE Type = LONGREAL;
  6701. VAR val: Type;
  6702. BEGIN
  6703. val := MIN( Type );
  6704. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6705. END "MAX";
  6706. (*** LEN: array -> array **)
  6707. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  6708. VAR src: ADDRESS; dim,i: SIZE;
  6709. BEGIN
  6710. src := SYSTEM.VAL(ADDRESS,left);
  6711. dim := GetDim( src );
  6712. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6713. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6714. RETURN RESULT
  6715. END "LEN";
  6716. (*** SUM: array -> scalar ********************************************************************)
  6717. (** SHORTINT *)
  6718. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6719. VAR lval, dval: SHORTINT;
  6720. BEGIN
  6721. SYSTEM.GET( dadr, dval );
  6722. WHILE (len > 0) DO
  6723. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6724. END;
  6725. SYSTEM.PUT( dadr, dval );
  6726. END SumASLoop;
  6727. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6728. TYPE Type = SHORTINT;
  6729. VAR val: Type;
  6730. BEGIN
  6731. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6732. RETURN val;
  6733. END "SUM";
  6734. (** INTEGER *)
  6735. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6736. VAR lval, dval: INTEGER;
  6737. BEGIN
  6738. SYSTEM.GET( dadr, dval );
  6739. WHILE (len > 0) DO
  6740. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6741. END;
  6742. SYSTEM.PUT( dadr, dval );
  6743. END SumAILoop;
  6744. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6745. TYPE Type = INTEGER;
  6746. VAR val: Type;
  6747. BEGIN
  6748. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6749. RETURN val;
  6750. END "SUM";
  6751. (** LONGINT *)
  6752. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6753. VAR lval, dval: LONGINT;
  6754. BEGIN
  6755. SYSTEM.GET( dadr, dval );
  6756. WHILE (len > 0) DO
  6757. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6758. END;
  6759. SYSTEM.PUT( dadr, dval );
  6760. END SumALLoop;
  6761. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6762. TYPE Type = LONGINT;
  6763. VAR val: Type;
  6764. BEGIN
  6765. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6766. RETURN val;
  6767. END "SUM";
  6768. (** REAL *)
  6769. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6770. VAR lval, dval: REAL;
  6771. BEGIN
  6772. SYSTEM.GET( dadr, dval );
  6773. WHILE (len > 0) DO
  6774. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6775. END;
  6776. SYSTEM.PUT( dadr, dval );
  6777. END SumARLoop;
  6778. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6779. TYPE Type = REAL;
  6780. VAR val: Type;
  6781. BEGIN
  6782. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6783. RETURN val;
  6784. END "SUM";
  6785. (** LONGREAL *)
  6786. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6787. VAR lval, dval: LONGREAL;
  6788. BEGIN
  6789. SYSTEM.GET( dadr, dval );
  6790. WHILE (len > 0) DO
  6791. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6792. END;
  6793. SYSTEM.PUT( dadr, dval );
  6794. END SumAXLoop;
  6795. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6796. TYPE Type = LONGREAL;
  6797. VAR val: Type;
  6798. BEGIN
  6799. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6800. RETURN val;
  6801. END "SUM";
  6802. (** COMPLEX *)
  6803. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6804. VAR lval, dval: COMPLEX;
  6805. BEGIN
  6806. SYSTEM.GET( dadr, dval );
  6807. WHILE (len > 0) DO
  6808. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6809. END;
  6810. SYSTEM.PUT( dadr, dval );
  6811. END SumAZLoop;
  6812. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6813. TYPE Type = COMPLEX;
  6814. VAR val: Type;
  6815. BEGIN
  6816. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6817. RETURN val;
  6818. END "SUM";
  6819. (** LONGCOMPLEX *)
  6820. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6821. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6822. BEGIN
  6823. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6824. WHILE (len > 0) DO
  6825. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6826. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6827. INC( ladr, linc ); DEC( len );
  6828. END;
  6829. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6830. END SumALZLoop;
  6831. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6832. TYPE Type = LONGCOMPLEX;
  6833. VAR val: Type;
  6834. BEGIN
  6835. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6836. RETURN val;
  6837. END "SUM";
  6838. (*** monadic ABS array -> array ********************************************************************)
  6839. (** SHORTINT *)
  6840. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6841. VAR lval: SHORTINT;
  6842. BEGIN
  6843. WHILE (len > 0) DO
  6844. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6845. INC( dadr, dinc ); DEC( len );
  6846. END;
  6847. END AbsLoopS;
  6848. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6849. BEGIN
  6850. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6851. RETURN RESULT
  6852. END "ABS";
  6853. (** INTEGER *)
  6854. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6855. VAR lval: INTEGER;
  6856. BEGIN
  6857. WHILE (len > 0) DO
  6858. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6859. INC( dadr, dinc ); DEC( len );
  6860. END;
  6861. END AbsLoopI;
  6862. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6863. BEGIN
  6864. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6865. RETURN RESULT
  6866. END "ABS";
  6867. (** LONGINT *)
  6868. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6869. VAR lval: LONGINT;
  6870. BEGIN
  6871. WHILE (len > 0) DO
  6872. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6873. INC( dadr, dinc ); DEC( len );
  6874. END;
  6875. END AbsLoopL;
  6876. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6877. BEGIN
  6878. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6879. RETURN RESULT
  6880. END "ABS";
  6881. (** REAL *)
  6882. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6883. VAR lval: REAL;
  6884. BEGIN
  6885. WHILE (len > 0) DO
  6886. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6887. INC( dadr, dinc ); DEC( len );
  6888. END;
  6889. END AbsLoopR;
  6890. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6891. BEGIN
  6892. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6893. RETURN RESULT
  6894. END "ABS";
  6895. (** LONGREAL *)
  6896. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6897. VAR lval: LONGREAL;
  6898. BEGIN
  6899. WHILE (len > 0) DO
  6900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6901. INC( dadr, dinc ); DEC( len );
  6902. END;
  6903. END AbsLoopX;
  6904. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6905. BEGIN
  6906. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6907. RETURN RESULT
  6908. END "ABS";
  6909. (** COMPLEX *)
  6910. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6911. VAR lval: COMPLEX;
  6912. BEGIN
  6913. WHILE (len > 0) DO
  6914. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6915. INC( dadr, dinc ); DEC( len );
  6916. END;
  6917. END AbsLoopZ;
  6918. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6919. BEGIN
  6920. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6921. RETURN RESULT
  6922. END "ABS";
  6923. (** LONGCOMPLEX *)
  6924. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6925. VAR lvalRe, lvalIm: LONGREAL;
  6926. BEGIN
  6927. WHILE (len > 0) DO
  6928. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6929. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6930. INC( ladr, linc );
  6931. INC( dadr, dinc ); DEC( len );
  6932. END;
  6933. END AbsLoopLZ;
  6934. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6935. BEGIN
  6936. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6937. RETURN RESULT
  6938. END "ABS";
  6939. (*** assign number to array (initialisation) ********************************************************************)
  6940. (** BOOLEAN *)
  6941. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6942. VAR lval: BOOLEAN;
  6943. BEGIN
  6944. SYSTEM.GET( ladr, lval );
  6945. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6946. END AssignSBABLoop;
  6947. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6948. BEGIN
  6949. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6950. END ":=";
  6951. (** SHORTINT*)
  6952. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6953. VAR lval: SHORTINT;
  6954. BEGIN
  6955. SYSTEM.GET( ladr, lval );
  6956. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6957. END AssignSSASLoop;
  6958. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6959. BEGIN
  6960. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6961. END ":=";
  6962. (**INTEGER *)
  6963. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6964. VAR lval: INTEGER;
  6965. BEGIN
  6966. SYSTEM.GET( ladr, lval );
  6967. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6968. END AssignSIAILoop;
  6969. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6970. BEGIN
  6971. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6972. END ":=";
  6973. (** LONGINT *)
  6974. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6975. VAR lval: LONGINT;
  6976. BEGIN
  6977. SYSTEM.GET( ladr, lval );
  6978. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6979. END AssignSLALLoop;
  6980. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6981. BEGIN
  6982. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6983. END ":=";
  6984. (** REAL *)
  6985. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6986. VAR lval: REAL;
  6987. BEGIN
  6988. SYSTEM.GET( ladr, lval );
  6989. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6990. END AssignSRARLoop;
  6991. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6992. BEGIN
  6993. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6994. END ":=";
  6995. (** LONGREAL *)
  6996. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6997. VAR lval: LONGREAL;
  6998. BEGIN
  6999. SYSTEM.GET( ladr, lval );
  7000. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7001. END AssignSXAXLoop;
  7002. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7003. BEGIN
  7004. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7005. END ":=";
  7006. (** COMPLEX *)
  7007. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7008. VAR lval: COMPLEX;
  7009. BEGIN
  7010. SYSTEM.GET( ladr, lval );
  7011. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7012. END AssignSZAZLoop;
  7013. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7014. BEGIN
  7015. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7016. END ":=";
  7017. (** LONGCOMPLEX *)
  7018. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7019. VAR lvalRe, lvalIm: LONGREAL;
  7020. BEGIN
  7021. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7022. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7023. END AssignSLZALZLoop;
  7024. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7025. BEGIN
  7026. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7027. END ":=";
  7028. (*** matrix multipliation ********************************************************************)
  7029. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7030. rows, cols, elementsize: SIZE ): ANY;
  7031. VAR p: ANY;
  7032. BEGIN
  7033. (*
  7034. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7035. *)
  7036. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7037. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7038. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7039. PutPtr( dest, p); RETURN p;
  7040. END AllocateMatrix;
  7041. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7042. VAR p: ANY;
  7043. BEGIN
  7044. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7045. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7046. PutPtr( dest, p ); RETURN p;
  7047. END AllocateVector;
  7048. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7049. loop: BinaryAASLoop;
  7050. fast: FastMatMul ); (* Size= element-size *)
  7051. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7052. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7053. BEGIN
  7054. (*
  7055. <- 1 ->
  7056. xxx xxxx -> xxxx
  7057. ^ xxx xxxx xxxx
  7058. 0 xxx xxxx xxxx
  7059. v xxx xxxx
  7060. xxx xxxx
  7061. Len(..,1): #columns ; Inc(..,1): inc in rows
  7062. Len(..,0): #rows ; Inc(..,0): inc between rows
  7063. *)
  7064. (* apply multiplication D = L * R *)
  7065. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7066. colsL := GetLen( left, 1 ); (* # left columns *)
  7067. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7068. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7069. (* check geometric restriction *)
  7070. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7071. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7072. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7073. IF RangeFlag IN GetFlags( dest ) THEN
  7074. Halt( GeometryMismatch, left, right, dest )
  7075. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7076. END;
  7077. END;
  7078. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7079. IF overlap THEN
  7080. destOld := dest; destNew := 0;
  7081. p := AllocateSame( destNew, destOld, Size );
  7082. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7083. dest := destNew;
  7084. END;
  7085. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7086. HALT( 9999 )
  7087. END;
  7088. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7089. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7090. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7091. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7092. (*
  7093. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7094. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7095. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7096. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7097. *)
  7098. IF rowsL = 0 THEN RETURN
  7099. ELSIF colsL=0 THEN RETURN
  7100. ELSIF colsR=0 THEN RETURN
  7101. ELSIF (fast = NIL ) OR
  7102. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7103. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7104. radri := radr; dadri := dadr; colsRi := colsR;
  7105. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7106. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7107. INC( dadri, incD ); DEC( colsRi );
  7108. END;
  7109. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7110. END;
  7111. END;
  7112. IF overlap THEN CopyContent( destOld, dest, Size );
  7113. END;
  7114. END ApplyMatMulLoop;
  7115. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7116. Size: SIZE; loop: BinaryAASLoop;
  7117. fast: FastMatMul ); (* Size= element-size *)
  7118. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7119. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7120. BEGIN
  7121. (*
  7122. <- 0 ->
  7123. xxx T(xxx) -> T(xxxxx)
  7124. xxx
  7125. 1 xxx
  7126. xxx
  7127. xxx
  7128. Len(..,0): #columns ; Inc(..,0): inc in rows
  7129. Len(..,1): #rows ; Inc(..,1): inc between rows
  7130. *)
  7131. (* check geometric restriction *)
  7132. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7133. Halt( GeometryMismatch, left, right,0 );
  7134. END;
  7135. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7136. l2 := GetLen( left, 1 ); (* inner loop len *)
  7137. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7138. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7139. IF RangeFlag IN GetFlags( dest ) THEN
  7140. Halt( GeometryMismatch, left, right, dest );
  7141. ELSE p := AllocateVector( dest, l1, Size );
  7142. END;
  7143. END;
  7144. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7145. IF overlap THEN
  7146. destOld := dest; destNew := 0;
  7147. p := AllocateSame( destNew, destOld, Size );
  7148. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7149. dest := destNew;
  7150. END;
  7151. (*
  7152. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7153. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7154. END;
  7155. *)
  7156. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7157. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7158. di0 := GetIncr( dest, 0 );
  7159. IF l1=0 THEN RETURN
  7160. ELSIF l2=0 THEN RETURN
  7161. ELSIF (fast = NIL ) OR
  7162. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7163. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7164. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7165. DEC( l1 );
  7166. END;
  7167. END;
  7168. IF overlap THEN CopyContent( destOld, dest, Size );
  7169. END;
  7170. END ApplyMatVecMulLoop;
  7171. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7172. Size: SIZE; loop: BinaryAASLoop;
  7173. fast: FastMatMul ); (* Size= element-size *)
  7174. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7175. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7176. BEGIN
  7177. (*
  7178. <- 0 ->
  7179. xxx xxxx -> xxxx
  7180. xxxx
  7181. 1 xxxx
  7182. Len(..,0): #columns ; Inc(..,0): inc in rows
  7183. Len(..,1): #rows ; Inc(..,1): inc between rows
  7184. *)
  7185. (* check geometric restriction *)
  7186. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7187. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7188. l2 := GetLen( right, 0 ); (* inner loop len *)
  7189. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7190. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7191. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7192. ELSE p := AllocateVector( dest, l0, Size );
  7193. END;
  7194. END;
  7195. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7196. IF overlap THEN
  7197. destOld := dest; destNew := 0;
  7198. p := AllocateSame( destNew, destOld, Size );
  7199. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7200. dest := destNew;
  7201. END;
  7202. (*
  7203. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7204. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7205. END;
  7206. *)
  7207. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7208. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7209. di0 := GetIncr( dest, 0 );
  7210. IF l2=0 THEN RETURN
  7211. ELSIF l0=0 THEN RETURN
  7212. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7213. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7214. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7215. DEC( l0 );
  7216. END;
  7217. END;
  7218. IF overlap THEN CopyContent( destOld, dest, Size );
  7219. END;
  7220. END ApplyVecMatMulLoop;
  7221. (** SHORTINT *)
  7222. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7223. VAR lval, rval, dval: SHORTINT;
  7224. BEGIN
  7225. dval := 0;
  7226. WHILE (len > 0) DO
  7227. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7228. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7229. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7230. END;
  7231. SYSTEM.PUT( dadr, dval );
  7232. END MatMulASASLoop;
  7233. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7234. BEGIN
  7235. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7236. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7237. RETURN RESULT
  7238. END "*";
  7239. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7240. BEGIN
  7241. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7242. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7243. RETURN RESULT
  7244. END "*";
  7245. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7246. BEGIN
  7247. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7248. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7249. RETURN RESULT
  7250. END "*";
  7251. (** INTEGER *)
  7252. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7253. VAR lval, rval, dval: INTEGER;
  7254. BEGIN
  7255. dval := 0;
  7256. WHILE (len > 0) DO
  7257. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7258. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7259. END;
  7260. SYSTEM.PUT( dadr, dval );
  7261. END MatMulAIAILoop;
  7262. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7263. BEGIN
  7264. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7265. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7266. RETURN RESULT
  7267. END "*";
  7268. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7269. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7270. BEGIN
  7271. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7272. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7273. RETURN RESULT
  7274. END "*";
  7275. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7276. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7277. BEGIN
  7278. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7279. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7280. RETURN RESULT
  7281. END "*";
  7282. (** LONGINT *)
  7283. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7284. VAR lval, rval, dval: LONGINT;
  7285. BEGIN
  7286. dval := 0;
  7287. WHILE (len > 0) DO
  7288. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7289. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7290. END;
  7291. SYSTEM.PUT( dadr, dval );
  7292. END MatMulALALLoop;
  7293. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7294. BEGIN
  7295. (*
  7296. KernelLog.String("MatMulALAL");
  7297. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7298. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7299. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7300. KernelLog.Ln;
  7301. *)
  7302. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7303. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7304. RETURN RESULT
  7305. END "*";
  7306. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7307. BEGIN
  7308. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7309. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7310. RETURN RESULT
  7311. END "*";
  7312. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7313. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7314. BEGIN
  7315. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7316. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7317. RETURN RESULT
  7318. END "*";
  7319. (** REAL *)
  7320. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7321. VAR lval, rval, dval: REAL;
  7322. BEGIN
  7323. dval := 0;
  7324. WHILE (len > 0) DO
  7325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7326. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7327. END;
  7328. SYSTEM.PUT( dadr, dval );
  7329. END MatMulARARLoop;
  7330. (*
  7331. Optimized for small matrices (Alexey Morozov)
  7332. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7333. *)
  7334. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7335. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7336. BEGIN
  7337. dadr := GetAdr(ADDRESSOF(RESULT));
  7338. ladr := GetAdr(ADDRESSOF(left));
  7339. radr := GetAdr(ADDRESSOF(right));
  7340. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7341. IF (ladr # dadr) & (radr # dadr) THEN
  7342. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7343. CASE SYSTEM.VAL(LONGINT,flags) OF
  7344. Mat2x2:
  7345. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7346. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7347. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7348. END;
  7349. END;
  7350. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7351. ELSE
  7352. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7353. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7354. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7355. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7356. END;
  7357. |Mat3x3:
  7358. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7359. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7360. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7361. END;
  7362. END;
  7363. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7364. ELSE
  7365. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7366. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7367. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7368. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7369. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7370. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7371. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7372. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7373. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7374. END;
  7375. |Mat4x4:
  7376. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7377. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7378. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7379. END;
  7380. END;
  7381. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7382. ELSE
  7383. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0] + left[0,3]*right[3,0];
  7384. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1] + left[0,3]*right[3,1];
  7385. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2] + left[0,3]*right[3,2];
  7386. RESULT[0,3] := left[0,0]*right[0,3] + left[0,1]*right[1,3] + left[0,2]*right[2,3] + left[0,3]*right[3,3];
  7387. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0] + left[1,3]*right[3,0];
  7388. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1] + left[1,3]*right[3,1];
  7389. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2] + left[1,3]*right[3,2];
  7390. RESULT[1,3] := left[1,0]*right[0,3] + left[1,1]*right[1,3] + left[1,2]*right[2,3] + left[1,3]*right[3,3];
  7391. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0] + left[2,3]*right[3,0];
  7392. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1] + left[2,3]*right[3,1];
  7393. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2] + left[2,3]*right[3,2];
  7394. RESULT[2,3] := left[2,0]*right[0,3] + left[2,1]*right[1,3] + left[2,2]*right[2,3] + left[2,3]*right[3,3];
  7395. RESULT[3,0] := left[3,0]*right[0,0] + left[3,1]*right[1,0] + left[3,2]*right[2,0] + left[3,3]*right[3,0];
  7396. RESULT[3,1] := left[3,0]*right[0,1] + left[3,1]*right[1,1] + left[3,2]*right[2,1] + left[3,3]*right[3,1];
  7397. RESULT[3,2] := left[3,0]*right[0,2] + left[3,1]*right[1,2] + left[3,2]*right[2,2] + left[3,3]*right[3,2];
  7398. RESULT[3,3] := left[3,0]*right[0,3] + left[3,1]*right[1,3] + left[3,2]*right[2,3] + left[3,3]*right[3,3];
  7399. END;
  7400. ELSE
  7401. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7402. loopMatMulARAR, matMulR );
  7403. END;
  7404. ELSE
  7405. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7406. loopMatMulARAR, matMulR );
  7407. END;
  7408. RETURN RESULT
  7409. END "*";
  7410. (*
  7411. Optimized for small arrays (Alexey Morozov)
  7412. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7413. *)
  7414. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7415. VAR
  7416. flags: SET; dadr, ladr, radr: ADDRESS;
  7417. v0, v1, v2: REAL;
  7418. BEGIN
  7419. dadr := GetAdr(ADDRESSOF(RESULT));
  7420. ladr := GetAdr(ADDRESSOF(left));
  7421. radr := GetAdr(ADDRESSOF(right));
  7422. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7423. CASE SYSTEM.VAL(LONGINT,flags) OF
  7424. MatVec2x2:
  7425. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7426. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7427. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7428. END;
  7429. END;
  7430. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7431. ELSE
  7432. (* account possible overlapping *)
  7433. v0 := right[0];
  7434. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7435. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7436. END;
  7437. |MatVec3x3:
  7438. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7439. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7440. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7441. END;
  7442. END;
  7443. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7444. ELSE
  7445. (* account possible overlapping *)
  7446. v0 := right[0]; v1 := right[1];
  7447. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7448. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7449. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7450. END;
  7451. |MatVec4x4:
  7452. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7453. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7454. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7455. END;
  7456. END;
  7457. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7458. ELSE
  7459. (* account possible overlapping *)
  7460. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7461. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7462. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7463. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7464. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7465. END;
  7466. ELSE
  7467. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7468. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7469. END;
  7470. RETURN RESULT
  7471. END "*";
  7472. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7473. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7474. BEGIN
  7475. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7476. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7477. RETURN RESULT
  7478. END "*";
  7479. (** LONGREAL *)
  7480. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7481. VAR lval, rval, dval: LONGREAL;
  7482. BEGIN
  7483. dval := 0;
  7484. WHILE (len > 0) DO
  7485. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7486. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7487. END;
  7488. SYSTEM.PUT( dadr, dval );
  7489. END MatMulAXAXLoop;
  7490. (*
  7491. Optimized for small matrices (Alexey Morozov)
  7492. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7493. *)
  7494. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7495. VAR
  7496. flags: SET; dadr, ladr, radr: ADDRESS;
  7497. BEGIN
  7498. dadr := GetAdr(ADDRESSOF(RESULT));
  7499. ladr := GetAdr(ADDRESSOF(left));
  7500. radr := GetAdr(ADDRESSOF(right));
  7501. IF (ladr # dadr) & (radr # dadr) THEN
  7502. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7503. CASE SYSTEM.VAL(LONGINT,flags) OF
  7504. Mat2x2:
  7505. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7506. IF dadr = 0 THEN NEW(RESULT,2,2);
  7507. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7508. END;
  7509. END;
  7510. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7511. ELSE
  7512. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7513. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7514. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7515. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7516. END;
  7517. |Mat3x3:
  7518. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7519. IF dadr = 0 THEN NEW(RESULT,3,3);
  7520. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7521. END;
  7522. END;
  7523. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7524. ELSE
  7525. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7526. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7527. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7528. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7529. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7530. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7531. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7532. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7533. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7534. END;
  7535. |Mat4x4:
  7536. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7537. IF dadr = 0 THEN NEW(RESULT,4,4);
  7538. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7539. END;
  7540. END;
  7541. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7542. ELSE
  7543. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0] + left[0,3]*right[3,0];
  7544. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1] + left[0,3]*right[3,1];
  7545. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2] + left[0,3]*right[3,2];
  7546. RESULT[0,3] := left[0,0]*right[0,3] + left[0,1]*right[1,3] + left[0,2]*right[2,3] + left[0,3]*right[3,3];
  7547. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0] + left[1,3]*right[3,0];
  7548. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1] + left[1,3]*right[3,1];
  7549. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2] + left[1,3]*right[3,2];
  7550. RESULT[1,3] := left[1,0]*right[0,3] + left[1,1]*right[1,3] + left[1,2]*right[2,3] + left[1,3]*right[3,3];
  7551. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0] + left[2,3]*right[3,0];
  7552. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1] + left[2,3]*right[3,1];
  7553. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2] + left[2,3]*right[3,2];
  7554. RESULT[2,3] := left[2,0]*right[0,3] + left[2,1]*right[1,3] + left[2,2]*right[2,3] + left[2,3]*right[3,3];
  7555. RESULT[3,0] := left[3,0]*right[0,0] + left[3,1]*right[1,0] + left[3,2]*right[2,0] + left[3,3]*right[3,0];
  7556. RESULT[3,1] := left[3,0]*right[0,1] + left[3,1]*right[1,1] + left[3,2]*right[2,1] + left[3,3]*right[3,1];
  7557. RESULT[3,2] := left[3,0]*right[0,2] + left[3,1]*right[1,2] + left[3,2]*right[2,2] + left[3,3]*right[3,2];
  7558. RESULT[3,3] := left[3,0]*right[0,3] + left[3,1]*right[1,3] + left[3,2]*right[2,3] + left[3,3]*right[3,3];
  7559. END;
  7560. ELSE
  7561. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7562. loopMatMulAXAX, matMulX );
  7563. END;
  7564. ELSE
  7565. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7566. loopMatMulAXAX, matMulX );
  7567. END;
  7568. RETURN RESULT
  7569. END "*";
  7570. (*
  7571. Optimized for small arrays (Alexey Morozov)
  7572. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7573. *)
  7574. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7575. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7576. VAR
  7577. flags: SET; dadr, ladr, radr: ADDRESS;
  7578. v0, v1, v2: LONGREAL;
  7579. BEGIN
  7580. dadr := GetAdr(ADDRESSOF(RESULT));
  7581. ladr := GetAdr(ADDRESSOF(left));
  7582. radr := GetAdr(ADDRESSOF(right));
  7583. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7584. CASE SYSTEM.VAL(LONGINT,flags) OF
  7585. MatVec2x2:
  7586. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7587. IF dadr = 0 THEN NEW(RESULT,2);
  7588. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7589. END;
  7590. END;
  7591. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7592. ELSE
  7593. (* account possible overlapping *)
  7594. v0 := right[0];
  7595. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7596. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7597. END;
  7598. |MatVec3x3:
  7599. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7600. IF dadr = 0 THEN NEW(RESULT,3);
  7601. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7602. END;
  7603. END;
  7604. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7605. ELSE
  7606. (* account possible overlapping *)
  7607. v0 := right[0]; v1 := right[1];
  7608. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7609. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7610. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7611. END;
  7612. |MatVec4x4:
  7613. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7614. IF dadr = 0 THEN NEW(RESULT,4);
  7615. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7616. END;
  7617. END;
  7618. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7619. ELSE
  7620. (* account possible overlapping *)
  7621. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7622. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7623. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7624. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7625. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7626. END;
  7627. ELSE
  7628. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7629. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7630. END;
  7631. RETURN RESULT
  7632. END "*";
  7633. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7634. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7635. BEGIN
  7636. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7637. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7638. RETURN RESULT
  7639. END "*";
  7640. (** SHORTINT *)
  7641. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7642. VAR lval, rval, dval: SHORTINT;
  7643. BEGIN
  7644. SYSTEM.GET( dadr, dval );
  7645. WHILE (len > 0) DO
  7646. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7647. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7648. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7649. END;
  7650. SYSTEM.PUT( dadr, dval );
  7651. END MatMulIncASASLoop;
  7652. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7653. BEGIN
  7654. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7655. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7656. RETURN RESULT
  7657. END "INCMUL";
  7658. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7659. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7660. BEGIN
  7661. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7662. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7663. RETURN RESULT
  7664. END "INCMUL";
  7665. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7666. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7667. BEGIN
  7668. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7669. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7670. RETURN RESULT
  7671. END "INCMUL";
  7672. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7673. BEGIN
  7674. RESULT := -RESULT;
  7675. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7676. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7677. RESULT := -RESULT;
  7678. RETURN RESULT
  7679. END "DECMUL";
  7680. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7681. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7682. BEGIN
  7683. RESULT := -RESULT;
  7684. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7685. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7686. RESULT := -RESULT;
  7687. RETURN RESULT
  7688. END "DECMUL";
  7689. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7690. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7691. BEGIN
  7692. RESULT := -RESULT;
  7693. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7694. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7695. RESULT := -RESULT;
  7696. RETURN RESULT
  7697. END "DECMUL";
  7698. (** INTEGER *)
  7699. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7700. VAR lval, rval, dval: INTEGER;
  7701. BEGIN
  7702. SYSTEM.GET( dadr, dval );
  7703. WHILE (len > 0) DO
  7704. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7705. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7706. END;
  7707. SYSTEM.PUT( dadr, dval );
  7708. END MatMulIncAIAILoop;
  7709. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7710. BEGIN
  7711. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7712. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7713. RETURN RESULT
  7714. END "INCMUL";
  7715. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7716. BEGIN
  7717. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7718. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7719. RETURN RESULT
  7720. END "INCMUL";
  7721. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7722. BEGIN
  7723. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7724. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7725. RETURN RESULT
  7726. END "INCMUL";
  7727. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7728. BEGIN
  7729. RESULT := -RESULT;
  7730. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7731. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7732. RESULT := -RESULT;
  7733. RETURN RESULT
  7734. END "DECMUL";
  7735. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7736. BEGIN
  7737. RESULT := -RESULT;
  7738. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7739. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7740. RESULT := -RESULT;
  7741. RETURN RESULT
  7742. END "DECMUL";
  7743. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7744. BEGIN
  7745. RESULT := -RESULT;
  7746. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7747. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7748. RESULT := -RESULT;
  7749. RETURN RESULT
  7750. END "DECMUL";
  7751. (** LONGINT *)
  7752. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7753. VAR lval, rval, dval: LONGINT;
  7754. BEGIN
  7755. SYSTEM.GET( dadr, dval );
  7756. WHILE (len > 0) DO
  7757. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7758. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7759. END;
  7760. SYSTEM.PUT( dadr, dval );
  7761. END MatMulIncALALLoop;
  7762. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7763. BEGIN
  7764. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7765. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7766. RETURN RESULT
  7767. END "INCMUL";
  7768. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7769. BEGIN
  7770. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7771. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7772. RETURN RESULT
  7773. END "INCMUL";
  7774. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7775. BEGIN
  7776. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7777. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7778. RETURN RESULT
  7779. END "INCMUL";
  7780. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7781. BEGIN
  7782. RESULT := -RESULT;
  7783. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7784. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7785. RESULT := -RESULT;
  7786. RETURN RESULT
  7787. END "DECMUL";
  7788. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7789. BEGIN
  7790. RESULT := -RESULT;
  7791. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7792. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7793. RESULT := -RESULT;
  7794. RETURN RESULT
  7795. END "DECMUL";
  7796. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7797. BEGIN
  7798. RESULT := -RESULT;
  7799. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7800. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7801. RESULT := -RESULT;
  7802. RETURN RESULT
  7803. END "DECMUL";
  7804. (** REAL *)
  7805. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7806. VAR lval, rval, dval: REAL;
  7807. BEGIN
  7808. SYSTEM.GET( dadr, dval );
  7809. WHILE (len > 0) DO
  7810. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7811. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7812. END;
  7813. SYSTEM.PUT( dadr, dval );
  7814. END MatMulIncARARLoop;
  7815. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7816. BEGIN
  7817. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7818. loopMatMulIncARAR, matMulIncR );
  7819. RETURN RESULT
  7820. END "INCMUL";
  7821. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7822. BEGIN
  7823. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7824. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7825. RETURN RESULT
  7826. END "INCMUL";
  7827. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7828. BEGIN
  7829. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7830. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7831. RETURN RESULT
  7832. END "INCMUL";
  7833. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7834. BEGIN
  7835. RESULT := -RESULT;
  7836. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7837. loopMatMulIncARAR, matMulIncR );
  7838. RESULT := -RESULT;
  7839. RETURN RESULT
  7840. END "DECMUL";
  7841. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7842. BEGIN
  7843. RESULT := -RESULT;
  7844. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7845. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7846. RESULT := -RESULT;
  7847. RETURN RESULT
  7848. END "DECMUL";
  7849. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7850. BEGIN
  7851. RESULT := -RESULT;
  7852. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7853. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7854. RESULT := -RESULT;
  7855. RETURN RESULT
  7856. END "DECMUL";
  7857. (** LONGREAL *)
  7858. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7859. VAR lval, rval, dval: LONGREAL;
  7860. BEGIN
  7861. SYSTEM.GET( dadr, dval );
  7862. WHILE (len > 0) DO
  7863. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7864. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7865. END;
  7866. SYSTEM.PUT( dadr, dval );
  7867. END MatMulIncAXAXLoop;
  7868. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7869. BEGIN
  7870. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7871. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7872. RETURN RESULT
  7873. END "INCMUL";
  7874. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7875. BEGIN
  7876. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7877. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7878. RETURN RESULT
  7879. END "INCMUL";
  7880. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7881. BEGIN
  7882. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7883. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7884. RETURN RESULT
  7885. END "INCMUL";
  7886. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7887. BEGIN
  7888. RESULT := -RESULT;
  7889. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7890. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7891. RESULT := -RESULT;
  7892. RETURN RESULT
  7893. END "DECMUL";
  7894. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7895. BEGIN
  7896. RESULT := -RESULT;
  7897. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7898. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7899. RESULT := -RESULT;
  7900. RETURN RESULT
  7901. END "DECMUL";
  7902. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7903. BEGIN
  7904. RESULT := -RESULT;
  7905. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7906. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7907. RESULT := -RESULT;
  7908. RETURN RESULT
  7909. END "DECMUL";
  7910. (*** Cross product ********************************************************************)
  7911. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7912. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7913. BEGIN
  7914. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7915. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7916. END;
  7917. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7918. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7919. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7920. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7921. RETURN RESULT
  7922. END "*";
  7923. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7924. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7925. BEGIN
  7926. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7927. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7928. END;
  7929. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7930. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7931. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7932. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7933. RETURN RESULT
  7934. END "*";
  7935. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7936. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7937. BEGIN
  7938. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7939. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7940. END;
  7941. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7942. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7943. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7944. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7945. RETURN RESULT
  7946. END "*";
  7947. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7948. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7949. BEGIN
  7950. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7951. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7952. END;
  7953. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7954. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7955. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7956. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7957. RETURN RESULT
  7958. END "*";
  7959. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7960. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7961. BEGIN
  7962. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7963. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7964. END;
  7965. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7966. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7967. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7968. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7969. RETURN RESULT
  7970. END "*";
  7971. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  7972. VAR tensor: Tensor;
  7973. BEGIN
  7974. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7975. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7976. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7977. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7978. ELSE HALT(200);
  7979. END;
  7980. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  7981. loopMatMulAXAX, matMulX );
  7982. RETURN RESULT
  7983. END "*";
  7984. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  7985. BEGIN
  7986. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7987. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7988. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7989. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7990. ELSE HALT(200);
  7991. END;
  7992. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  7993. loopMatMulARAR, matMulR );
  7994. RETURN RESULT
  7995. END "*";
  7996. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  7997. BEGIN
  7998. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7999. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8000. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8001. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8002. ELSE HALT(200);
  8003. END;
  8004. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8005. MatMulALALLoop, NIL );
  8006. RETURN RESULT
  8007. END "*";
  8008. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8009. BEGIN
  8010. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8011. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8012. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8013. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8014. ELSE HALT(200);
  8015. END;
  8016. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8017. MatMulAIAILoop,NIL );
  8018. RETURN RESULT
  8019. END "*";
  8020. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8021. BEGIN
  8022. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8023. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8024. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8025. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8026. ELSE HALT(200);
  8027. END;
  8028. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8029. MatMulASASLoop, NIL );
  8030. RETURN RESULT
  8031. END "*";
  8032. (** Transpose ********************************************************************)
  8033. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8034. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8035. BEGIN
  8036. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8037. dim := GetDim( src1 ) - 1;
  8038. WHILE (dim > 0) DO
  8039. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8040. END;
  8041. dim := GetDim( src2 ) - 1;
  8042. WHILE (dim > 0) DO
  8043. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8044. END;
  8045. IF from1 < from2 THEN RETURN to1 >= from2;
  8046. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8047. ELSE RETURN TRUE;
  8048. END;
  8049. END Overlap;
  8050. (*
  8051. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8052. VAR from1, from2, to1, to2: ADDRESS;
  8053. BEGIN
  8054. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8055. DEC( dim );
  8056. WHILE (dim > 0) DO
  8057. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8058. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8059. END;
  8060. IF from1 < from2 THEN RETURN to1 >= from2;
  8061. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8062. ELSE RETURN TRUE;
  8063. END;
  8064. END Overlap;
  8065. *)
  8066. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8067. VAR ptr, data: ANY; Size: SIZE;
  8068. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8069. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8070. VAR dim,max: SIZE;
  8071. BEGIN
  8072. dim := GetDim( l );
  8073. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8074. max := dim-1;
  8075. WHILE (dim > 0) DO
  8076. DEC( dim );
  8077. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8078. END;
  8079. RETURN TRUE;
  8080. END TransposedShape;
  8081. PROCEDURE NewData;
  8082. VAR max,dim, len, size: SIZE;
  8083. BEGIN
  8084. dim := GetDim( src ); size := elementsize;
  8085. PutDim( dest, dim );
  8086. PutSize( dest, elementsize );
  8087. max := dim-1;
  8088. WHILE (dim > 0) DO
  8089. DEC( dim );
  8090. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8091. PutInc( dest, dim, size ); size := size * len;
  8092. END;
  8093. SYSTEM.NEW( data, size + ArrayAlignment);
  8094. PutAdr( dest, Align(data) );
  8095. PutPtr( dest, data );
  8096. END NewData;
  8097. BEGIN
  8098. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8099. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8100. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8101. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8102. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8103. PutFlags(dest, {TensorFlag});
  8104. NewData();
  8105. RETURN ptr;
  8106. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8107. (* check if re-allocation of descriptor is allowed *)
  8108. IF ~(TensorFlag IN GetFlags( dest )) &
  8109. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8110. HALT( 100 );
  8111. END;
  8112. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8113. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8114. PutFlags(dest, {TensorFlag});
  8115. NewData(); RETURN ptr;
  8116. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8117. (* check if re-allocation of array data is allowed *)
  8118. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8119. HALT( 100 );
  8120. END;
  8121. NewData();
  8122. RETURN data;
  8123. ELSE (* nothing to do *)
  8124. RETURN NIL;
  8125. END;
  8126. END AllocateTransposed;
  8127. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8128. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8129. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8130. BEGIN
  8131. WHILE (len > 0) DO
  8132. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8133. DEC( len );
  8134. END;
  8135. END CopyLoop;
  8136. BEGIN
  8137. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8138. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8139. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8140. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8141. ELSE
  8142. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8143. p := AllocateTransposed(dest,left,Size);
  8144. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8145. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8146. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8147. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8148. WHILE (len0 > 0) DO
  8149. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8150. INC( dadr, dinc0 ); DEC( len0 );
  8151. END;
  8152. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8153. ladr := p;
  8154. ELSE
  8155. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8156. END;
  8157. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8158. dadr := GetAdr( dest );
  8159. IF (Size = 4) & (transpose4 # NIL ) THEN
  8160. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8161. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8162. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8163. ELSE
  8164. WHILE (len0 > 0) DO
  8165. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8166. INC( dadr, dinc1 ); DEC( len0 );
  8167. END;
  8168. END;
  8169. END;
  8170. END Transpose;
  8171. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8172. BEGIN
  8173. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8174. RETURN RESULT
  8175. END "`";
  8176. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8177. BEGIN
  8178. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8179. RETURN RESULT
  8180. END "`";
  8181. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8182. BEGIN
  8183. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8184. RETURN RESULT
  8185. END "`";
  8186. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8187. BEGIN
  8188. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8189. RETURN RESULT
  8190. END "`";
  8191. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8192. BEGIN
  8193. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8194. RETURN RESULT
  8195. END "`";
  8196. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8197. VAR i: SIZE;
  8198. BEGIN
  8199. FOR i := 0 TO rdim - 1 DO
  8200. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8201. END;
  8202. FOR i := 0 TO ldim - 1 DO
  8203. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8204. END;
  8205. RETURN TRUE;
  8206. END CheckTensorGeometry;
  8207. (*
  8208. PROCEDURE Zero(p: ANY; size: LONGINT);
  8209. VAR adr: LONGINT;
  8210. BEGIN
  8211. adr := SYSTEM.VAL(LONGINT,p);
  8212. WHILE(size>0) DO
  8213. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8214. END;
  8215. END Zero;
  8216. *)
  8217. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8218. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8219. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8220. squeezingReshape: BOOLEAN;
  8221. PROCEDURE CheckAlloc;
  8222. BEGIN
  8223. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8224. END CheckAlloc;
  8225. PROCEDURE NewDescriptor;
  8226. BEGIN
  8227. CheckAlloc;
  8228. ptr := GetArrayDesc( newDim ); new := ptr;
  8229. END NewDescriptor;
  8230. (* Added by Alexey
  8231. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8232. *)
  8233. PROCEDURE SqueezingReshape(): BOOLEAN;
  8234. VAR
  8235. i, j, n: SIZE;
  8236. BEGIN
  8237. IF oldDim > newDim THEN
  8238. i := 0; j := 0;
  8239. WHILE (i < oldDim) & (j < newDim) DO
  8240. n := GetLen(src,i);
  8241. IF n = shape[j] THEN INC(j); END;
  8242. INC(i);
  8243. END;
  8244. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8245. ELSE
  8246. squeezingReshape := FALSE;
  8247. END;
  8248. squeezingReshape := (i = oldDim) & (j = newDim);
  8249. RETURN squeezingReshape;
  8250. END SqueezingReshape;
  8251. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8252. PROCEDURE TargetContinuous(): BOOLEAN;
  8253. VAR
  8254. i, n: SIZE;
  8255. continue: BOOLEAN;
  8256. BEGIN
  8257. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8258. continue := TRUE;
  8259. WHILE (i > 0) & continue DO
  8260. n := n * GetLen(dest,i);
  8261. DEC(i);
  8262. continue := GetIncr(dest,i) = n;
  8263. END;
  8264. (*TRACE(i,continue,Size,GetSize(dest));*)
  8265. (*tod obviously size is not what I expect it to be*)
  8266. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8267. RETURN TRUE;
  8268. ELSE
  8269. RETURN FALSE;
  8270. END;
  8271. END TargetContinuous;
  8272. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8273. PROCEDURE PreservesContiguity(): BOOLEAN;
  8274. VAR
  8275. i, n: SIZE;
  8276. continue: BOOLEAN;
  8277. BEGIN
  8278. i := oldDim-1; n := GetIncr(src,i);
  8279. continue := TRUE;
  8280. WHILE (i > 0) & continue DO
  8281. n := n * GetLen(src,i);
  8282. DEC(i);
  8283. continue := GetIncr(src,i) = n;
  8284. END;
  8285. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8286. RETURN TRUE;
  8287. ELSE Err("Not yet implemented!");
  8288. END;
  8289. END PreservesContiguity;
  8290. (* Added by Alexey *)
  8291. PROCEDURE NewDescriptorForSameData;
  8292. VAR len, size, i, j: SIZE;
  8293. BEGIN
  8294. CheckAlloc();
  8295. ptr := GetArrayDesc( newDim ); new := ptr;
  8296. IF ~squeezingReshape THEN
  8297. size := Size;
  8298. FOR i := newDim - 1 TO 0 BY -1 DO
  8299. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8300. size := size * len;
  8301. END;
  8302. ELSE (* squeezing reshape *)
  8303. j := 0; len := shape[j];
  8304. FOR i := 0 TO oldDim-1 DO
  8305. IF GetLen(src,i) = len THEN
  8306. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8307. INC(j);
  8308. IF j < newDim THEN len := shape[j]; END;
  8309. END;
  8310. END;
  8311. END;
  8312. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8313. PutFlags(new,GetFlags(new)+{RangeFlag});
  8314. END;
  8315. PutAdr( new, GetAdr(src) );
  8316. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8317. PutSize( new, Size );
  8318. END NewDescriptorForSameData;
  8319. PROCEDURE NewData;
  8320. VAR len, size, i: SIZE;
  8321. BEGIN
  8322. size := Size;
  8323. FOR i := newDim - 1 TO 0 BY -1 DO
  8324. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8325. size := size * len;
  8326. END;
  8327. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8328. PutAdr( new, Align(data) );
  8329. PutPtr( new, data ); PutDim( new, newDim );
  8330. PutSize( new, Size );
  8331. END NewData;
  8332. PROCEDURE CopyData;
  8333. VAR d, s: SIZE; dadr: ADDRESS;
  8334. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8335. VAR inc, len, i: SIZE;
  8336. BEGIN
  8337. IF dim = d THEN
  8338. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8339. FOR i := 0 TO len - 1 DO
  8340. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8341. END;
  8342. ELSE
  8343. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8344. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8345. END;
  8346. END Loop;
  8347. BEGIN
  8348. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8349. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8350. s := s * GetLen( src, d ); DEC( d );
  8351. END;
  8352. IF d = -1 THEN (* special case: both continuous *)
  8353. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8354. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8355. END;
  8356. END CopyData;
  8357. PROCEDURE CopyDataBack;
  8358. VAR d, s: SIZE; sadr: ADDRESS;
  8359. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8360. VAR inc, len, i: SIZE;
  8361. BEGIN
  8362. IF dim = d THEN
  8363. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8364. FOR i := 0 TO len - 1 DO
  8365. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8366. END;
  8367. ELSE
  8368. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8369. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8370. END;
  8371. END Loop;
  8372. BEGIN
  8373. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8374. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8375. s := s * GetLen( dest, d ); DEC( d );
  8376. END;
  8377. IF d = -1 THEN (* special case: both continuous *)
  8378. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8379. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8380. END;
  8381. END CopyDataBack;
  8382. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8383. BEGIN
  8384. ASSERT( GetDim( src ) = GetDim( dest ) );
  8385. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8386. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8387. END CopyDescriptor;
  8388. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8389. VAR i: SIZE;
  8390. BEGIN
  8391. ASSERT(GetDim(dest) = newDim);
  8392. FOR i := 0 TO newDim - 1 DO
  8393. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8394. END;
  8395. RETURN FALSE;
  8396. END ShapeDiffers;
  8397. BEGIN
  8398. (*
  8399. cases
  8400. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8401. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8402. 3.) descriptor may not be reshaped: dest = RANGE
  8403. *)
  8404. (* first check invariants *)
  8405. oldDim := GetDim( src );
  8406. IF oldDim = 0 THEN oldSize := 0
  8407. ELSE
  8408. oldSize := 1;
  8409. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8410. END;
  8411. newDim := LEN( shape, 0 );
  8412. IF newDim = 0 THEN newSize := 0
  8413. ELSE
  8414. newSize := 1;
  8415. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8416. END;
  8417. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8418. Size := GetSize( src );
  8419. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8420. IF dest = src THEN (* added by Alexey *)
  8421. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8422. NewDescriptorForSameData;
  8423. dest := new;
  8424. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8425. (* create a copy of the original descriptor *)
  8426. CheckAlloc();
  8427. ptr := GetArrayDesc(newDim); dest := ptr;
  8428. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8429. CopyDescriptor(src,dest);
  8430. ELSE
  8431. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8432. END;
  8433. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8434. NewDescriptor; NewData; CopyData; dest := new;
  8435. ELSIF (dest = temporary) THEN
  8436. NewDescriptorForSameData;
  8437. dest := new;
  8438. ELSIF TargetContinuous() THEN
  8439. NewDescriptor; new:=dest; CopyData;
  8440. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8441. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8442. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8443. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8444. END;
  8445. NewDescriptor; NewData; CopyData;
  8446. dest := new;
  8447. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8448. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8449. (*
  8450. NewDescriptor; *)
  8451. new := dest;
  8452. NewData; CopyData;
  8453. new := NIL;
  8454. (*CopyDescriptor( new, dest );*)
  8455. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8456. NewDescriptor; NewData; CopyData; CopyDataBack;
  8457. ELSE (* same shape, just copy *)
  8458. CopyContent( src, dest, Size ); RETURN;
  8459. END;
  8460. IF dest = new THEN (* new block *)
  8461. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  8462. END;
  8463. END DoReshape;
  8464. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8465. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8466. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8467. PROCEDURE NewData;
  8468. VAR len, size, i: SIZE;
  8469. BEGIN
  8470. size := elementSize;
  8471. FOR i := dim - 1 TO 0 BY -1 DO
  8472. len := a[i];
  8473. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8474. END;
  8475. IF tag = 0 THEN
  8476. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8477. dest.adr := Align(data);
  8478. ELSE
  8479. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8480. dest.adr := data + ArrDataArrayOffset;
  8481. END;
  8482. SafePut(dest.ptr, data);
  8483. (*dest.ptr := data;*)
  8484. PutSize( dest, elementSize );
  8485. END NewData;
  8486. PROCEDURE ClearData;
  8487. (*! todo *)
  8488. END ClearData;
  8489. BEGIN
  8490. dim := LEN( a,0 );
  8491. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8492. IF dest # 0 THEN
  8493. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8494. END;
  8495. descr := GetArrayDesc( LEN( a,0 ) );
  8496. dest := descr;
  8497. NewData;
  8498. Heaps.SetPC(data);
  8499. ELSE
  8500. i := 0;
  8501. same := TRUE;
  8502. WHILE (i < dim) & same DO
  8503. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8504. INC( i );
  8505. END;
  8506. IF ~same THEN
  8507. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8508. NewData;
  8509. Heaps.SetPC(data);
  8510. ELSE ClearData
  8511. END;
  8512. END;
  8513. END AllocateTensorA;
  8514. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8515. BEGIN
  8516. AllocateTensorA(a,elementSize,tag,dest);
  8517. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8518. END AllocateArrayA;
  8519. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8520. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  8521. PROCEDURE NewData;
  8522. VAR len, size: SIZE; i: SIZE;
  8523. BEGIN
  8524. size := Size;
  8525. FOR i := dim - 1 TO 0 BY -1 DO
  8526. len := a[i];
  8527. (*
  8528. KernelLog.Int(len,10); KernelLog.Ln;
  8529. *)
  8530. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8531. END;
  8532. IF tag = 0 THEN
  8533. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8534. PutAdr( dest, Align(data) );
  8535. ELSE
  8536. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8537. PutAdr( dest, data+ ArrDataArrayOffset );
  8538. END;
  8539. PutPtr( dest, data ); PutSize( dest, Size );
  8540. END NewData;
  8541. PROCEDURE ClearData;
  8542. (*! todo *)
  8543. END ClearData;
  8544. BEGIN
  8545. dim := LEN( a,0 );
  8546. dest := SYSTEM.VAL(ADDRESS,destA);
  8547. (*! check range flag! *)
  8548. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8549. IF dest # 0 THEN
  8550. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8551. END;
  8552. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8553. NewData;
  8554. ELSE
  8555. i := 0;
  8556. WHILE (i < dim) & same DO
  8557. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8558. INC( i );
  8559. END;
  8560. IF ~same THEN
  8561. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8562. NewData
  8563. ELSE ClearData
  8564. END;
  8565. END;
  8566. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8567. IF dest = descr THEN (* new block *)
  8568. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  8569. END;
  8570. END AllocateTensorX;
  8571. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8572. VAR dim, i: SIZE;
  8573. BEGIN
  8574. dim := GetDim( src );
  8575. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8576. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8577. END LenA;
  8578. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8579. VAR dim, len: SIZE; i: SIZE;
  8580. BEGIN
  8581. dim := GetDim( src ); len := LEN( dest, 0 );
  8582. IF len # dim THEN NEW( dest, dim ); END;
  8583. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8584. END IncrA;
  8585. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8586. VAR dim: SIZE;
  8587. BEGIN
  8588. dim := GetDim(src);
  8589. IF (d<0) OR (d>=dim) THEN HALT(100)
  8590. ELSE
  8591. RETURN GetLen(src,d);
  8592. END;
  8593. END Len;
  8594. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8595. VAR dim: SIZE;
  8596. BEGIN
  8597. dim := GetDim(src);
  8598. IF (d<0) OR (d>=dim) THEN HALT(100)
  8599. ELSE
  8600. RETURN GetIncr(src,d);
  8601. END;
  8602. END Incr;
  8603. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8604. Size: SIZE ): ANY;
  8605. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8606. PROCEDURE NewData;
  8607. VAR len, size, i: SIZE;
  8608. BEGIN
  8609. size := 1;
  8610. FOR i := 0 TO ldim - 1 DO
  8611. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8612. END;
  8613. FOR i := 0 TO rdim - 1 DO
  8614. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8615. END;
  8616. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8617. (*
  8618. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8619. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8620. *)
  8621. size := Size;
  8622. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8623. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8624. END;
  8625. PutAdr( dest, Align(data) );
  8626. PutPtr( dest, data );
  8627. END NewData;
  8628. BEGIN
  8629. ldim := GetDim( left ); rdim := GetDim( right );
  8630. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8631. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8632. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8633. NewData(); RETURN ptr;
  8634. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8635. IF ~(TensorFlag IN GetFlags( dest )) &
  8636. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8637. HALT( 100 );
  8638. END;
  8639. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8640. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8641. NewData(); RETURN ptr;
  8642. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8643. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8644. HALT( 100 );
  8645. END;
  8646. NewData(); RETURN data;
  8647. END;
  8648. RETURN NIL;
  8649. END AllocateTensor;
  8650. (* 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 *)
  8651. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8652. VAR rdim, len, linc, ri: SIZE );
  8653. (* geometric precondition: lengths must coincide *)
  8654. VAR ldim: SIZE;
  8655. BEGIN
  8656. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8657. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8658. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8659. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8660. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8661. END;
  8662. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8663. DEC( ldim );
  8664. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8665. (GetIncr( right, rdim ) = len * ri) DO
  8666. len := len * GetLen( left, ldim );
  8667. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8668. DEC( ldim );
  8669. END;
  8670. INC( ldim ); INC( rdim );
  8671. IF debug THEN
  8672. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8673. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8674. END;
  8675. END FindPatternTensor;
  8676. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  8677. Loop: BinaryASALoop );
  8678. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  8679. origdest: ADDRESS; left, right, dest: ADDRESS;
  8680. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  8681. VAR len: SIZE; linc, rinc, dinc: SIZE;
  8682. BEGIN
  8683. IF (ldim < lDim) THEN
  8684. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8685. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8686. WHILE (len > 0) DO
  8687. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8688. INC( dadr, dinc ); DEC( len );
  8689. END;
  8690. ELSIF (rdim # loopd) THEN
  8691. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8692. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8693. WHILE (len > 0) DO
  8694. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8695. INC( dadr, dinc ); DEC( len );
  8696. END;
  8697. ELSE
  8698. (*
  8699. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8700. KernelLog.Int(GetAdr(dest),10);
  8701. KernelLog.Int(GetAdr(dest)+clen,10);
  8702. KernelLog.Ln;
  8703. *)
  8704. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8705. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8706. END;
  8707. END Traverse;
  8708. BEGIN
  8709. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8710. (* check array lengths *)
  8711. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8712. p := AllocateTensor( dest, left, right, elementSize );
  8713. (*
  8714. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8715. p := AllocateTensor( left, right, dest, elementSize )
  8716. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8717. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8718. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8719. END;
  8720. (*! to be done: treat overlapping memory *)
  8721. END;
  8722. *)
  8723. (* debugging *)
  8724. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8725. (* check pattern: longest piece that can be done with a loop *)
  8726. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8727. (* run through dimensions *)
  8728. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8729. SYSTEM.PUT( d, dest );
  8730. IF p = dest THEN
  8731. Heaps.CheckAssignment(d,dest);
  8732. END;
  8733. END ApplyTensorAAAOp;
  8734. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8735. BEGIN
  8736. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8737. SIZEOF( SHORTINT ), MulASSSLoop );
  8738. RETURN RESULT
  8739. END "**";
  8740. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8741. BEGIN
  8742. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8743. SIZEOF( INTEGER ), MulAISILoop );
  8744. RETURN RESULT
  8745. END "**";
  8746. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8747. BEGIN
  8748. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8749. SIZEOF( LONGINT ), MulALSLLoop );
  8750. RETURN RESULT
  8751. END "**";
  8752. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8753. BEGIN
  8754. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8755. loopMulARSR );
  8756. RETURN RESULT
  8757. END "**";
  8758. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8759. BEGIN
  8760. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8761. SIZEOF( LONGREAL ), loopMulAXSX );
  8762. RETURN RESULT
  8763. END "**";
  8764. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8765. BEGIN
  8766. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8767. loopMulAZSZ );
  8768. RETURN RESULT
  8769. END "**";
  8770. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8771. BEGIN
  8772. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8773. loopMulALZSLZ );
  8774. RETURN RESULT
  8775. END "**";
  8776. PROCEDURE InitOptimization;
  8777. VAR p: PROCEDURE;
  8778. BEGIN
  8779. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8780. IF p # NIL THEN
  8781. p;
  8782. ELSE
  8783. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8784. END;
  8785. END InitOptimization;
  8786. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  8787. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  8788. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  8789. BEGIN
  8790. IF src = 0 THEN
  8791. HALT(100);
  8792. ELSE
  8793. srcDim := GetDim(src);
  8794. destDim := srcDim - prefixIndices - suffixIndices;
  8795. (*
  8796. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8797. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8798. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8799. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8800. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8801. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8802. *)
  8803. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  8804. dest := SYSTEM.VAL(ADDRESS,destPtr);
  8805. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8806. PutAdr(dest,GetAdr(src));
  8807. PutPtr(dest,GetPtr(src));
  8808. PutFlags(dest,GetFlags(src));
  8809. PutSize(dest,GetSize(src));
  8810. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8811. srcDim := i + prefixIndices + prefixRanges;
  8812. destDim := i + prefixRanges;
  8813. len := GetLen(src,srcDim);
  8814. incr := GetIncr(src,srcDim);
  8815. PutLen(dest,destDim,len);
  8816. PutInc(dest,destDim,incr);
  8817. END;
  8818. (*
  8819. Report("copy descriptor src",src);
  8820. Report("copy descriptor dest",dest);
  8821. *)
  8822. END;
  8823. END CopyDescriptor;
  8824. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8825. VAR dest: ARRAY [?] OF basetype
  8826. CONST src: ARRAY [?] OF basetype
  8827. CONST shape: ARRAY [*] OF LONGINT
  8828. *)
  8829. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8830. BEGIN
  8831. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  8832. RETURN RESULT
  8833. END Reshape;
  8834. (* OLIVIER *)
  8835. (** creates a degenerated range from an integer.
  8836. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8837. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8838. **)
  8839. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  8840. BEGIN RETURN (integer .. integer BY 1)
  8841. END RangeFromInteger;
  8842. (* OLIVIER *)
  8843. (** create an array with the same data but with more dimensions
  8844. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8845. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8846. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8847. e.g.:
  8848. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8849. performs the following type transformation:
  8850. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8851. **)
  8852. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8853. VAR
  8854. targetDimensionality, sourceIndex, targetIndex: SIZE;
  8855. sourceADDRESS, targetADDRESS: ADDRESS;
  8856. targetArrayDescriptor: ANY;
  8857. BEGIN
  8858. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  8859. targetDimensionality := LEN(keptDimensions, 0);
  8860. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8861. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8862. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  8863. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8864. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8865. PutFlags(targetADDRESS, {TensorFlag});
  8866. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8867. (* set increments and lengths *)
  8868. sourceIndex := 0;
  8869. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8870. IF keptDimensions[targetIndex] THEN
  8871. (* reuse length and increment from source array *)
  8872. ASSERT(sourceIndex < DIM(sourceArray));
  8873. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8874. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8875. INC(sourceIndex)
  8876. ELSE
  8877. (* set length = 1 and increment = 0 *)
  8878. PutLen(targetADDRESS, targetIndex, 1);
  8879. PutInc(targetADDRESS, targetIndex, 0);
  8880. END
  8881. END;
  8882. (* Report("expand dimensions: ", targetADDRESS); *)
  8883. RETURN RESULT
  8884. END ExpandDimensions;
  8885. (* index ranges *)
  8886. (* the length of a range, i.e. the number of indices that it stands for *)
  8887. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  8888. VAR
  8889. temp, result: SIZE;
  8890. BEGIN
  8891. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8892. (* invalid range *)
  8893. result := 0
  8894. ELSIF LAST(range) = MAX(LONGINT) THEN
  8895. (* open-ended range *)
  8896. result := MAX(LONGINT)
  8897. ELSE
  8898. temp := 1 + LAST(range) - FIRST(range);
  8899. result := temp DIV STEP(range);
  8900. IF (temp MOD STEP(range)) # 0 THEN
  8901. INC(result)
  8902. END
  8903. END;
  8904. RETURN result
  8905. END "LEN";
  8906. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8907. BEGIN
  8908. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8909. RETURN RESULT;
  8910. END "ALL";
  8911. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8912. BEGIN
  8913. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8914. RETURN RESULT;
  8915. END "ALL";
  8916. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8917. BEGIN
  8918. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8919. RETURN RESULT;
  8920. END "ALL";
  8921. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8922. BEGIN
  8923. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8924. RETURN RESULT;
  8925. END "ALL";
  8926. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8927. BEGIN
  8928. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8929. RETURN RESULT;
  8930. END "ALL";
  8931. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8932. BEGIN
  8933. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8934. RETURN RESULT;
  8935. END "ALL";
  8936. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8937. BEGIN
  8938. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8939. RETURN RESULT;
  8940. END "ALL";
  8941. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8942. BEGIN
  8943. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8944. RETURN RESULT;
  8945. END "ALL";
  8946. BEGIN
  8947. alloc := 0; NEW(temporary);
  8948. PutFlags(temporary,{TensorFlag});
  8949. PutDim(temporary, 0);
  8950. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8951. END FoxArrayBase.
  8952. Compiler.Compile FoxArrayBase.Mod ~
  8953. SystemTools.ListModules