FoxArrayBase.Mod 337 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129
  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. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  39. down = 0; up = 1; (* memory copy modes *)
  40. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  41. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  42. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  43. Size2Flag = 4; (* size = 2 *)
  44. Size3Flag = 5; (* size = 3 *)
  45. Size4Flag = 6; (* size = 4 *)
  46. Size5Flag = 7; (* size = 5 *)
  47. Size6Flag = 8; (* size = 6 *)
  48. Size7Flag = 9; (* size = 7 *)
  49. Size8Flag = 10; (* size = 8 *)
  50. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  51. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  52. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  53. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  54. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  55. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  56. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  57. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  58. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  59. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  60. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  61. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  62. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  63. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  64. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  65. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  66. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  67. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  68. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  69. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  70. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  71. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  72. TYPE
  73. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC, IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: LONGINT ): BOOLEAN;
  74. TransposeP* = PROCEDURE ( ladr, dadr, lstride, linc, dstride, dinc, rows, cols: LONGINT );
  75. LenInc = RECORD
  76. len: SIZE;
  77. inc: SIZE
  78. END;
  79. ArrayDescriptor*= RECORD
  80. ptr*: ANY;
  81. adr*: ADDRESS;
  82. flags*: SET;
  83. dim*: SIZE;
  84. elementSize*: SIZE;
  85. END;
  86. Tensor = POINTER TO ArrayDescriptor;
  87. UnsafeArray*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  88. lens*: ARRAY 8 OF LenInc;
  89. END;
  90. A0 = RECORD(ArrayDescriptor) END;
  91. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  92. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  93. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  94. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  95. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  96. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  97. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  98. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  99. T0 = POINTER TO A0;
  100. T1 = POINTER TO A1;
  101. T2 = POINTER TO A2;
  102. T3 = POINTER TO A3;
  103. T4 = POINTER TO A4;
  104. T5 = POINTER TO A5;
  105. T6 = POINTER TO A6;
  106. T7 = POINTER TO A7;
  107. T8 = POINTER TO A8;
  108. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  109. SmallMatMul* = PROCEDURE(dadr, ladr, radr: LONGINT);
  110. VAR
  111. alloc*: LONGINT; (* statistics *)
  112. allocTemp*: LONGINT; (* statistics *)
  113. (* procedures that might be replaced by ASM methods *)
  114. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  115. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  116. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  117. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  118. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  119. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  120. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  121. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  122. transpose4*: TransposeP; transpose8*: TransposeP;
  123. (* optimizations for small arrays (Alexey Morozov) *)
  124. matMulR2x2*: SmallMatMul;
  125. matMulR3x3*: SmallMatMul;
  126. matMulR4x4*: SmallMatMul;
  127. matVecMulR2x2*: SmallMatMul;
  128. matVecMulR3x3*: SmallMatMul;
  129. matVecMulR4x4*: SmallMatMul;
  130. matMulLR2x2*: SmallMatMul;
  131. matMulLR3x3*: SmallMatMul;
  132. matMulLR4x4*: SmallMatMul;
  133. matVecMulLR2x2*: SmallMatMul;
  134. matVecMulLR3x3*: SmallMatMul;
  135. matVecMulLR4x4*: SmallMatMul;
  136. (*
  137. TensorTypePool: ARRAY 32 OF TensorType;
  138. *)
  139. PROCEDURE SetDefaults*; (* set standard procedures *)
  140. BEGIN
  141. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  142. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  143. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  144. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  145. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  146. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  147. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  148. loopIncMulAXSX := IncMulAXSXLoop;
  149. loopMatMulIncARAR := MatMulIncARARLoop;
  150. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  151. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  152. loopMulAZSZ := MulAZSZLoop;
  153. loopMulALZSLZ := MulALZSLZLoop;
  154. END SetDefaults;
  155. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  156. BEGIN
  157. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  158. END Err;
  159. (* get increment of dimension dim *)
  160. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  161. BEGIN{UNCHECKED}
  162. RETURN base.lens[dim].inc
  163. END GetIncr;
  164. (* set increment of dimension dim *)
  165. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  166. BEGIN{UNCHECKED}
  167. base.lens[dim].inc := val
  168. END PutInc;
  169. (* get length of dimension dim *)
  170. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): LONGINT;
  171. BEGIN{UNCHECKED}
  172. RETURN base.lens[dim].len
  173. END GetLen;
  174. (* set length of dimension dim *)
  175. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  176. BEGIN{UNCHECKED}
  177. base.lens[dim].len := val
  178. END PutLen;
  179. (* get data address *)
  180. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  181. BEGIN
  182. RETURN base.adr;
  183. END GetAdr;
  184. (* set data address *)
  185. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  186. BEGIN
  187. base.adr := value
  188. END PutAdr;
  189. (* get data base pointer (GC protection) *)
  190. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  191. BEGIN
  192. RETURN base.ptr;
  193. END GetPtr;
  194. (* set data base pointer (GC protection) *)
  195. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  196. BEGIN
  197. base.ptr := value
  198. END PutPtr;
  199. PROCEDURE GetSize( base: UnsafeArray ): LONGINT;
  200. BEGIN
  201. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  202. END GetSize;
  203. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  204. BEGIN
  205. base.elementSize := val
  206. END PutSize;
  207. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  208. VAR dim: LONGINT;
  209. BEGIN
  210. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  211. END GetDim;
  212. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  213. BEGIN
  214. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  215. END GetFlags;
  216. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  217. BEGIN
  218. base.dim := dim
  219. END PutDim;
  220. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  221. BEGIN
  222. base.flags := flags
  223. END PutFlags;
  224. (* report geometry of array passed via address s *)
  225. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  226. VAR i: LONGINT; dim: LONGINT;
  227. PROCEDURE Set( s: SET );
  228. VAR i: LONGINT; first: BOOLEAN;
  229. BEGIN
  230. KernelLog.String( "{" ); first := TRUE;
  231. FOR i := 31 TO 0 BY -1 DO
  232. IF i IN s THEN
  233. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  234. KernelLog.Int( i, 1 );
  235. END;
  236. END;
  237. KernelLog.String( "}" );
  238. END Set;
  239. BEGIN
  240. KernelLog.String( name );
  241. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  242. ELSE
  243. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  244. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  245. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  246. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  247. KernelLog.Ln; dim := GetDim( s );
  248. IF dim > 32 THEN dim := 0 END;
  249. FOR i := 0 TO dim - 1 DO
  250. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  251. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  252. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  253. END;
  254. (*
  255. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  256. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  257. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  258. *)
  259. END;
  260. END Report;
  261. PROCEDURE GetArrayDesc( dim: LONGINT ): Tensor;
  262. VAR (* t: TensorType; *) ptr: Tensor;
  263. p0: T0;
  264. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  265. BEGIN
  266. CASE dim OF
  267. |0: NEW(p0); ptr := p0;
  268. |1:NEW(p1); ptr := p1;
  269. |2:NEW(p2); ptr := p2;
  270. |3:NEW(p3); ptr := p3;
  271. |4:NEW(p4); ptr := p4;
  272. |5:NEW(p5); ptr := p5;
  273. |6:NEW(p6); ptr := p6;
  274. |7:NEW(p7); ptr := p7;
  275. |8:NEW(p8); ptr := p8;
  276. ELSE
  277. HALT(200)
  278. END;
  279. ptr.dim := dim;
  280. ptr.flags := {TensorFlag};
  281. RETURN ptr;
  282. END GetArrayDesc;
  283. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  284. BEGIN
  285. IF d = NIL THEN
  286. d := GetArrayDesc(dim);
  287. ELSIF d.dim # dim THEN
  288. IF ~(TensorFlag IN d.flags) &
  289. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  290. HALT( 100 );
  291. END;
  292. d := GetArrayDesc(dim)
  293. (* ELSE keep as is *)
  294. END;
  295. END EnsureArrayDesc;
  296. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  297. VAR reason: ARRAY 64 OF CHAR;
  298. BEGIN
  299. IF left # 0 THEN Report( "Source operand ", left ) END;
  300. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  301. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  302. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  303. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  304. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  305. ELSE reason := "unknown";
  306. END;
  307. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  308. HALT( 400 );
  309. END Halt;
  310. (** patterns ********************************************************************)
  311. (* 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 *)
  312. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: LONGINT );
  313. BEGIN
  314. d := dim - 1; len := GetLen( left, d );
  315. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  316. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  317. linc := GetIncr( left, d ); DEC( d );
  318. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  319. len := len * GetLen( left, d ); DEC( d );
  320. END; (* find dimension where pattern does not work any more *)
  321. INC( d );
  322. IF debug THEN
  323. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  324. KernelLog.Ln;
  325. END;
  326. END FindPattern1;
  327. (* 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 *)
  328. PROCEDURE FindPattern2( left, right: ADDRESS; dim: LONGINT;
  329. VAR d, len, linc, ri: LONGINT );
  330. (* geometric precondition: lengths must coincide *)
  331. BEGIN
  332. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  333. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  334. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  335. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  336. len := len * GetLen( left, d ); DEC( d );
  337. END;
  338. INC( d );
  339. IF debug THEN
  340. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  341. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  342. END;
  343. END FindPattern2;
  344. (* 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 *)
  345. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: LONGINT;
  346. VAR d, len, linc, ri, di: LONGINT );
  347. (* geometric precondition: lengths must coincide *)
  348. BEGIN
  349. d := dim - 1; len := GetLen( left, d );
  350. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  351. END;
  352. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  353. DEC( d );
  354. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  355. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  356. len := len * GetLen( left, d ); DEC( d );
  357. END;
  358. INC( d );
  359. IF debug THEN
  360. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  361. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  362. END;
  363. END FindPattern3;
  364. PROCEDURE Reverse( src: ADDRESS; dim: LONGINT );
  365. VAR d, sl, sr: LONGINT;
  366. BEGIN
  367. d := 0; sl := GetAdr( src );
  368. WHILE (d < dim) DO
  369. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  370. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  371. END;
  372. PutAdr( src, sl + sr );
  373. END Reverse;
  374. (* check if forward copy may be performed *)
  375. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  376. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  377. (* precondition: len(src,i)=len(dest,i) *)
  378. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  379. Sufficient (but not necessary) conditions:
  380. 1.) no overlap: src right < dest left or src left > dest right or
  381. 2.) same geometry and src left >= dest left
  382. same geometry if ginc(s)=ginc(d) with
  383. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  384. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  385. *)
  386. BEGIN
  387. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  388. dim := GetDim( src );
  389. WHILE (d < dim) DO
  390. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  391. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  392. END;
  393. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  394. ELSIF ((sr - sl) = (dr - dl)) THEN
  395. IF (sl = dl) THEN (* same memory region, both directions possible *)
  396. ELSIF (sl > dl) THEN
  397. EXCL( modes, down ) (* only copy up possible *)
  398. ELSE (*sl < dl*)
  399. EXCL( modes, up ) (* only copy down possible *)
  400. END;
  401. ELSE
  402. modes := modes - {down, up}; (* neither nor *)
  403. END;
  404. END CopyUpCompatible;
  405. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  406. Size: LONGINT ): ANY;
  407. (* allocate a temporary block containing both descriptor and data *)
  408. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  409. BEGIN
  410. HALT(100);
  411. (*
  412. IF statistics THEN INC( allocTemp ) END;
  413. d := 0; len := Size; dim := GetDim( src );
  414. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  415. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  416. dest := SYSTEM.VAL( LONGINT, p );
  417. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  418. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  419. FOR i := 0 TO dim - 1 DO
  420. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  421. len := len * GetLen( src, i );
  422. END;
  423. (* Report("allocdest",dest,dim); *)
  424. RETURN p;
  425. *)
  426. END AllocateTemp;
  427. (*** procedures to traverse arrays and apply operators *)
  428. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  429. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  430. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  431. origdest: ADDRESS; modes: SET;
  432. dest, left: ADDRESS; dim: SIZE;
  433. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  434. VAR len: LONGINT; linc, dinc: LONGINT;
  435. BEGIN
  436. IF dim = loopd THEN
  437. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  438. IF conservative THEN INC( glen, looplen ) END;
  439. ELSE
  440. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  441. dinc := GetIncr( dest, dim ); INC( dim );
  442. WHILE (len > 0) DO
  443. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  444. END;
  445. END;
  446. END Traverse;
  447. BEGIN
  448. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  449. origdest := 0; modes := {up, down};
  450. (* allocate destination, if necessary *)
  451. p := AllocateSame( dest, left, elementSize );
  452. IF p = NIL THEN
  453. CopyUpCompatible( dest, left, modes );
  454. IF up IN modes THEN (* nothing to be done *)
  455. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  456. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  457. END;
  458. END;
  459. (* allocate destination, if necessary *)
  460. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  461. ELSIF CheckGeometry( left, dest, dim )
  462. END; *)
  463. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  464. (* check pattern: longest piece that can be done with a loop *)
  465. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  466. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  467. IF up IN modes THEN (* nothing to be done *)
  468. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  469. ELSE CopyContent( origdest, dest, elementSize );
  470. END;
  471. SYSTEM.PUT( d, dest );
  472. END ApplyGenericUnaryAAOpS;
  473. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  474. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  475. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  476. origdest: LONGINT; modes: SET;
  477. dest, left: ADDRESS; dim: SIZE;
  478. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  479. VAR len: LONGINT; linc, dinc: LONGINT;
  480. BEGIN
  481. IF dim = loopd THEN
  482. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  483. IF conservative THEN INC( glen, looplen ) END;
  484. ELSE
  485. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  486. dinc := GetIncr( dest, dim ); INC( dim );
  487. WHILE (len > 0) DO
  488. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  489. END;
  490. END;
  491. END Traverse;
  492. BEGIN
  493. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  494. origdest := 0; modes := {up, down};
  495. (* allocate destination, if necessary *)
  496. p := AllocateSame( dest, left, elementSize );
  497. IF p = NIL THEN
  498. CopyUpCompatible( dest, left, modes );
  499. IF up IN modes THEN (* nothing to be done *)
  500. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  501. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  502. END;
  503. END;
  504. (* allocate destination, if necessary *)
  505. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  506. ELSIF CheckGeometry( left, dest, dim )
  507. END; *)
  508. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  509. (* check pattern: longest piece that can be done with a loop *)
  510. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  511. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  512. IF up IN modes THEN (* nothing to be done *)
  513. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  514. ELSE CopyContent( origdest, dest, elementSize );
  515. END;
  516. SYSTEM.PUT( d, dest );
  517. END ApplyGenericUnaryAAOpI;
  518. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  519. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  520. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  521. origdest: LONGINT; modes: SET;
  522. dest, left: ADDRESS; dim: SIZE;
  523. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  524. VAR len: LONGINT; linc, dinc: LONGINT;
  525. BEGIN
  526. IF dim = loopd THEN
  527. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  528. IF conservative THEN INC( glen, looplen ) END;
  529. ELSE
  530. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  531. dinc := GetIncr( dest, dim ); INC( dim );
  532. WHILE (len > 0) DO
  533. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  534. END;
  535. END;
  536. END Traverse;
  537. BEGIN
  538. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  539. origdest := 0; modes := {up, down};
  540. (* allocate destination, if necessary *)
  541. p := AllocateSame( dest, left, elementSize );
  542. IF p = NIL THEN
  543. CopyUpCompatible( dest, left, modes );
  544. IF up IN modes THEN (* nothing to be done *)
  545. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  546. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  547. END;
  548. END;
  549. (* allocate destination, if necessary *)
  550. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  551. ELSIF CheckGeometry( left, dest, dim )
  552. END; *)
  553. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  554. (* check pattern: longest piece that can be done with a loop *)
  555. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  556. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  557. IF up IN modes THEN (* nothing to be done *)
  558. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  559. ELSE CopyContent( origdest, dest, elementSize );
  560. END;
  561. SYSTEM.PUT( d, dest );
  562. END ApplyGenericUnaryAAOpL;
  563. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  564. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  565. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  566. origdest: LONGINT; modes: SET;
  567. VAR dest, left: ADDRESS; dim: SIZE;
  568. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  569. VAR len: LONGINT; linc, dinc: LONGINT;
  570. BEGIN
  571. IF dim = loopd THEN
  572. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  573. IF conservative THEN INC( glen, looplen ) END;
  574. ELSE
  575. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  576. dinc := GetIncr( dest, dim ); INC( dim );
  577. WHILE (len > 0) DO
  578. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  579. DEC( len );
  580. END;
  581. END;
  582. END Traverse;
  583. BEGIN
  584. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  585. origdest := 0; modes := {up, down};
  586. (* allocate destination, if necessary *)
  587. p := AllocateSame( dest, left, elementSize );
  588. IF p = NIL THEN
  589. CopyUpCompatible( dest, left, modes );
  590. IF up IN modes THEN (* nothing to be done *)
  591. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  592. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  593. END;
  594. END;
  595. (*
  596. (* allocate destination, if necessary *)
  597. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  598. ELSIF CheckGeometry( left, dest, dim )
  599. END;
  600. *)
  601. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  602. (* check pattern: longest piece that can be done with a loop *)
  603. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  604. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  605. IF up IN modes THEN (* nothing to be done *)
  606. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  607. ELSE CopyContent( origdest, dest, elementSize );
  608. END;
  609. SYSTEM.PUT( d, dest );
  610. END ApplyGenericUnaryAAOpH;
  611. (** apply unary operator to array: array REAL -> array REAL *)
  612. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  613. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  614. origdest: LONGINT; modes: SET;
  615. dest, left: ADDRESS; dim: SIZE;
  616. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  617. VAR len: LONGINT; linc, dinc: LONGINT;
  618. BEGIN
  619. IF dim = loopd THEN
  620. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  621. IF conservative THEN INC( glen, looplen ) END;
  622. ELSE
  623. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  624. dinc := GetIncr( dest, dim ); INC( dim );
  625. WHILE (len > 0) DO
  626. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  627. END;
  628. END;
  629. END Traverse;
  630. BEGIN
  631. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  632. origdest := 0; modes := {up, down};
  633. (* allocate destination, if necessary *)
  634. p := AllocateSame( dest, left, elementSize );
  635. IF p = NIL THEN
  636. CopyUpCompatible( dest, left, modes );
  637. IF up IN modes THEN (* nothing to be done *)
  638. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  639. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  640. END;
  641. END;
  642. (* allocate destination, if necessary *)
  643. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  644. ELSIF CheckGeometry( left, dest, dim )
  645. END; *)
  646. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  647. (* check pattern: longest piece that can be done with a loop *)
  648. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  649. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  650. IF up IN modes THEN (* nothing to be done *)
  651. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  652. ELSE CopyContent( origdest, dest, elementSize );
  653. END;
  654. SYSTEM.PUT( d, dest );
  655. END ApplyGenericUnaryAAOpR;
  656. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  657. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  658. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  659. origdest: LONGINT; modes: SET;
  660. dest, left: ADDRESS; dim: SIZE;
  661. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  662. VAR len: LONGINT; linc, dinc: LONGINT;
  663. BEGIN
  664. IF dim = loopd THEN
  665. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  666. IF conservative THEN INC( glen, looplen ) END;
  667. ELSE
  668. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  669. dinc := GetIncr( dest, dim ); INC( dim );
  670. WHILE (len > 0) DO
  671. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  672. DEC( len );
  673. END;
  674. END;
  675. END Traverse;
  676. BEGIN
  677. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  678. origdest := 0; modes := {up, down};
  679. (* allocate destination, if necessary *)
  680. p := AllocateSame( dest, left, elementSize );
  681. IF p = NIL THEN
  682. CopyUpCompatible( dest, left, modes );
  683. IF up IN modes THEN (* nothing to be done *)
  684. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  685. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  686. END;
  687. END;
  688. (*
  689. (* allocate destination, if necessary *)
  690. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  691. ELSIF CheckGeometry( left, dest, dim )
  692. END;
  693. *)
  694. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  695. (* check pattern: longest piece that can be done with a loop *)
  696. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  697. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  698. IF up IN modes THEN (* nothing to be done *)
  699. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  700. ELSE CopyContent( origdest, dest, elementSize );
  701. END;
  702. SYSTEM.PUT( d, dest );
  703. END ApplyGenericUnaryAAOpX;
  704. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  705. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  706. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  707. origdest: LONGINT; modes: SET;
  708. dest, left: ADDRESS; dim: SIZE;
  709. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  710. VAR len: LONGINT; linc, dinc: LONGINT;
  711. BEGIN
  712. IF dim = loopd THEN
  713. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  714. IF conservative THEN INC( glen, looplen ) END;
  715. ELSE
  716. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  717. dinc := GetIncr( dest, dim ); INC( dim );
  718. WHILE (len > 0) DO
  719. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  720. DEC( len );
  721. END;
  722. END;
  723. END Traverse;
  724. BEGIN
  725. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  726. origdest := 0; modes := {up, down};
  727. (* allocate destination, if necessary *)
  728. p := AllocateSame( dest, left, elementSize );
  729. IF p = NIL THEN
  730. CopyUpCompatible( dest, left, modes );
  731. IF up IN modes THEN (* nothing to be done *)
  732. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  733. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  734. END;
  735. END;
  736. (*
  737. (* allocate destination, if necessary *)
  738. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  739. ELSIF CheckGeometry( left, dest, dim )
  740. END;
  741. *)
  742. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  743. (* check pattern: longest piece that can be done with a loop *)
  744. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  745. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  746. IF up IN modes THEN (* nothing to be done *)
  747. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  748. ELSE CopyContent( origdest, dest, elementSize );
  749. END;
  750. SYSTEM.PUT( d, dest );
  751. END ApplyGenericUnaryAAOpZ;
  752. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  753. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  754. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  755. origdest: LONGINT; modes: SET;
  756. dest, left: ADDRESS; dim: SIZE;
  757. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  758. VAR len: LONGINT; linc, dinc: LONGINT;
  759. BEGIN
  760. IF dim = loopd THEN
  761. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  762. IF conservative THEN INC( glen, looplen ) END;
  763. ELSE
  764. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  765. dinc := GetIncr( dest, dim ); INC( dim );
  766. WHILE (len > 0) DO
  767. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  768. DEC( len );
  769. END;
  770. END;
  771. END Traverse;
  772. BEGIN
  773. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  774. origdest := 0; modes := {up, down};
  775. (* allocate destination, if necessary *)
  776. p := AllocateSame( dest, left, elementSize );
  777. IF p = NIL THEN
  778. CopyUpCompatible( dest, left, modes );
  779. IF up IN modes THEN (* nothing to be done *)
  780. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  781. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  782. END;
  783. END;
  784. (*
  785. (* allocate destination, if necessary *)
  786. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  787. ELSIF CheckGeometry( left, dest, dim )
  788. END;
  789. *)
  790. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  791. (* check pattern: longest piece that can be done with a loop *)
  792. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  793. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  794. IF up IN modes THEN (* nothing to be done *)
  795. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  796. ELSE CopyContent( origdest, dest, elementSize );
  797. END;
  798. SYSTEM.PUT( d, dest );
  799. END ApplyGenericUnaryAAOpLZ;
  800. (** apply unary operator to array: array -> array *)
  801. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: LONGINT;
  802. Loop: UnaryAALoop );
  803. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  804. origdest: LONGINT; modes: SET;
  805. dest, left: ADDRESS; dim: SIZE;
  806. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  807. VAR len: LONGINT; linc, dinc: LONGINT;
  808. BEGIN
  809. IF dim = loopd THEN
  810. Loop( ladr, dadr, loopli, loopdi, looplen );
  811. IF conservative THEN INC( glen, looplen ) END;
  812. ELSE
  813. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  814. dinc := GetIncr( dest, dim ); INC( dim );
  815. WHILE (len > 0) DO
  816. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  817. DEC( len );
  818. END;
  819. END;
  820. END Traverse;
  821. BEGIN
  822. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  823. origdest := 0; modes := {up, down};
  824. (* allocate destination, if necessary *)
  825. p := AllocateSame( dest, left, elementSize );
  826. IF p = NIL THEN
  827. CopyUpCompatible( dest, left, modes );
  828. IF up IN modes THEN (* nothing to be done *)
  829. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  830. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  831. END;
  832. END;
  833. (*
  834. (* allocate destination, if necessary *)
  835. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  836. ELSIF CheckGeometry( left, dest, dim )
  837. END;
  838. *)
  839. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  840. (* check pattern: longest piece that can be done with a loop *)
  841. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  842. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  843. IF up IN modes THEN (* nothing to be done *)
  844. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  845. ELSE CopyContent( origdest, dest, elementSize );
  846. END;
  847. SYSTEM.PUT( d, dest );
  848. END ApplyUnaryAAOp;
  849. (** apply unary operator to array: array -> scalar *)
  850. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  851. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  852. VAR left, dim: LONGINT;
  853. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS );
  854. VAR len: LONGINT; linc: LONGINT;
  855. BEGIN
  856. IF dim = loopd THEN
  857. Loop( ladr, dest, loopli, looplen );
  858. IF conservative THEN INC( glen, looplen ) END;
  859. ELSE
  860. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  861. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  862. END;
  863. END Traverse;
  864. BEGIN
  865. SYSTEM.GET( l, left ); dim := GetDim( left );
  866. IF debug THEN Report( "AS: left", left ); END;
  867. (* check pattern: longest piece that can be done with a loop *)
  868. IF conservative THEN glen := 0 END;
  869. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  870. IF conservative THEN
  871. looplen := 1;
  872. WHILE (dim > 0) DO
  873. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  874. END;
  875. ASSERT( looplen = glen );
  876. END;
  877. END ApplyUnaryASOp;
  878. (** apply unary operator to array: scalar -> array *)
  879. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  880. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  881. VAR dest, dim: LONGINT;
  882. PROCEDURE Traverse( dim: LONGINT; dadr: ADDRESS );
  883. VAR len: LONGINT; dinc: LONGINT;
  884. BEGIN
  885. IF dim = loopd THEN
  886. Loop( right, dadr, loopdi, looplen );
  887. IF conservative THEN INC( glen, looplen ) END;
  888. ELSE
  889. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  890. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  891. END;
  892. END Traverse;
  893. BEGIN
  894. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  895. IF debug THEN Report( "AS: dest", dest ); END;
  896. (* check pattern: longest piece that can be done with a loop *)
  897. IF conservative THEN glen := 0 END;
  898. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  899. IF conservative THEN
  900. looplen := 1;
  901. WHILE (dim > 0) DO
  902. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  903. END;
  904. ASSERT( looplen = glen );
  905. END;
  906. END ApplyUnarySAOp;
  907. (** apply binary operator : array x array -> array *)
  908. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  909. Loop: BinaryAAALoop );
  910. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  911. origdest: LONGINT; modes: SET; left, right, dest: ADDRESS; dim: LONGINT;
  912. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: ADDRESS );
  913. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  914. BEGIN
  915. IF dim = loopd THEN
  916. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  917. IF conservative THEN INC( glen, looplen ) END;
  918. ELSE
  919. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  920. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  921. WHILE (len > 0) DO
  922. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  923. INC( dadr, dinc ); DEC( len );
  924. END;
  925. END;
  926. END Traverse;
  927. BEGIN
  928. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  929. (* allocate destination, if necessary *)
  930. IF ~SameShape( left, right ) THEN
  931. Halt( GeometryMismatch, left, right, 0 )
  932. END;
  933. origdest := 0; modes := {up, down};
  934. p := AllocateSame( dest, left, elementSize );
  935. IF p = NIL THEN
  936. CopyUpCompatible( dest, left, modes );
  937. CopyUpCompatible( dest, right, modes );
  938. IF up IN modes THEN (* nothing to be done *)
  939. ELSIF down IN modes THEN
  940. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  941. ELSE
  942. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  943. END;
  944. END;
  945. (* debugging *)
  946. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  947. (* check pattern: longest piece that can be done with a loop *)
  948. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  949. (* run through dimensions *)
  950. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  951. IF up IN modes THEN (* nothing to be done *)
  952. ELSIF down IN modes THEN
  953. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  954. ELSE CopyContent( origdest, dest, elementSize );
  955. END;
  956. SYSTEM.PUT( d, dest );
  957. END ApplyBinaryAAAOp;
  958. (** apply binary operator: array x scalar -> array *)
  959. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  960. elementSize: LONGINT;
  961. Loop: BinaryASALoop );
  962. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  963. origdest: LONGINT; modes: SET; dest, left: ADDRESS; dim: SIZE;
  964. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  965. VAR len: LONGINT; linc, dinc: LONGINT;
  966. BEGIN
  967. IF dim = loopd THEN
  968. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  969. IF conservative THEN INC( glen, looplen ) END;
  970. ELSE
  971. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  972. dinc := GetIncr( dest, dim ); INC( dim );
  973. WHILE (len > 0) DO
  974. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  975. DEC( len );
  976. END;
  977. END;
  978. END Traverse;
  979. BEGIN
  980. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  981. (* allocate destination, if necessary *)
  982. origdest := 0; modes := {up, down};
  983. p := AllocateSame( dest, left, elementSize );
  984. IF p = NIL THEN
  985. CopyUpCompatible( dest, left, modes );
  986. IF up IN modes THEN (* nothing to be done *)
  987. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  988. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  989. END;
  990. END;
  991. (* debugging *)
  992. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  993. (* check pattern: longest piece that can be done with a loop *)
  994. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  995. (* run through dimensions *)
  996. IF conservative THEN glen := 0 END;
  997. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  998. IF conservative THEN
  999. looplen := 1;
  1000. WHILE (dim > 0) DO
  1001. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1002. END;
  1003. ASSERT( looplen = glen );
  1004. END;
  1005. IF up IN modes THEN (* nothing to be done *)
  1006. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1007. ELSE CopyContent( origdest, dest, elementSize );
  1008. END;
  1009. SYSTEM.PUT( d, dest );
  1010. END ApplyBinaryASAOp;
  1011. (** apply binary operator: array x array -> scalar *)
  1012. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1013. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1014. left, right, dim: LONGINT;
  1015. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS );
  1016. VAR len: LONGINT; linc, rinc: LONGINT;
  1017. BEGIN
  1018. IF dim = loopd THEN
  1019. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1020. IF conservative THEN INC( glen, looplen ) END;
  1021. ELSE
  1022. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1023. rinc := GetIncr( right, dim ); INC( dim );
  1024. WHILE (len > 0) DO
  1025. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1026. DEC( len );
  1027. END;
  1028. END;
  1029. END Traverse;
  1030. BEGIN
  1031. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1032. (* check array lengths *)
  1033. IF ~SameShape( left, right ) THEN
  1034. Halt( GeometryMismatch, left, right, 0 )
  1035. END;
  1036. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1037. (* check pattern: longest piece that can be done with a loop *)
  1038. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1039. (* run through dimensions *)
  1040. IF conservative THEN glen := 0 END;
  1041. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1042. IF conservative THEN
  1043. looplen := 1;
  1044. WHILE (dim > 0) DO
  1045. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1046. END;
  1047. ASSERT( looplen = glen );
  1048. END;
  1049. END ApplyBinaryAASOp;
  1050. (** special binary operator: array x array -> boolean *)
  1051. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1052. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1053. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1054. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS ): BOOLEAN;
  1055. VAR len: LONGINT; linc, rinc: LONGINT;
  1056. BEGIN
  1057. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1058. ELSE
  1059. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1060. rinc := GetIncr( right, dim ); INC( dim );
  1061. WHILE (len > 0) DO
  1062. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1063. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1064. END;
  1065. RETURN TRUE;
  1066. END;
  1067. END Traverse;
  1068. BEGIN
  1069. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1070. (* check array lengths *)
  1071. IF ~SameShape( left, right ) THEN
  1072. RETURN geometryMismatchDefault
  1073. END;
  1074. (* is destination already allocated? (might be a temporary result) *)
  1075. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1076. (* check pattern: longest piece that can be done with a loop *)
  1077. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1078. (* run through dimensions *)
  1079. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1080. END ApplyBinaryAABOp;
  1081. (** special binary operator: array x scalar -> boolean *)
  1082. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1083. Loop: BinaryASBLoop ): BOOLEAN;
  1084. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1085. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS ): BOOLEAN;
  1086. VAR len: LONGINT; linc: LONGINT;
  1087. BEGIN
  1088. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1089. ELSE
  1090. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1091. WHILE (len > 0) DO
  1092. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1093. INC( ladr, linc ); DEC( len );
  1094. END;
  1095. RETURN TRUE;
  1096. END;
  1097. END Traverse;
  1098. BEGIN
  1099. SYSTEM.GET( l, left ); dim := GetDim( left );
  1100. IF debug THEN Report( "AAB:left", left ); END;
  1101. (* check pattern: longest piece that can be done with a loop *)
  1102. FindPattern1( left, dim, loopd, looplen, loopli );
  1103. (* run through dimensions *)
  1104. RETURN Traverse( 0, GetAdr( left ) );
  1105. END ApplyBinaryASBOp;
  1106. (**** operators *)
  1107. (*** copy *)
  1108. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1109. CODE {SYSTEM.i386}
  1110. MOV ECX, [EBP+ladr] ; ECX := ladr
  1111. MOV EDX, [EBP+dadr] ; EDX := dadr
  1112. MOV EBX, [EBP+len] ; EBX := len
  1113. start:
  1114. CMP EBX, 0 ;
  1115. JLE end ; WHILE EBX > 0 DO
  1116. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1117. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1118. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1119. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1120. DEC EBX ; DEC(EBX)
  1121. JMP start
  1122. end:
  1123. END Copy4;
  1124. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1125. CODE {SYSTEM.i386}
  1126. MOV ECX, [EBP+ladr] ; ECX := ladr
  1127. MOV EDX, [EBP+dadr] ; EDX := dadr
  1128. MOV EBX, [EBP+len] ; EBX := len
  1129. start:
  1130. CMP EBX, 0 ;
  1131. JLE end ; WHILE EBX > 0 DO
  1132. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1133. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1134. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1135. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1136. DEC EBX ; DEC(EBX)
  1137. JMP start
  1138. end:
  1139. END Copy2;
  1140. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1141. CODE {SYSTEM.i386}
  1142. MOV ECX, [EBP+ladr] ; ECX := ladr
  1143. MOV EDX, [EBP+dadr] ; EDX := dadr
  1144. MOV EBX, [EBP+len] ; EBX := len
  1145. start:
  1146. CMP EBX, 0 ;
  1147. JLE end ; WHILE EBX > 0 DO
  1148. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1149. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1150. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1151. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1152. DEC EBX ; DEC(EBX)
  1153. JMP start
  1154. end:
  1155. END Copy1;
  1156. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1157. CODE {SYSTEM.i386}
  1158. MOV ECX, [EBP+ladr] ; ECX := ladr
  1159. MOV EDX, [EBP+dadr] ; EDX := dadr
  1160. MOV EBX, [EBP+len] ; EBX := len
  1161. start:
  1162. CMP EBX, 0 ;
  1163. JLE end ; WHILE EBX > 0 DO
  1164. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1165. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1166. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1167. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1168. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1169. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1170. DEC EBX ; DEC(EBX)
  1171. JMP start
  1172. end:
  1173. END Copy8;
  1174. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1175. (** Correct move if overlap, might be important for some array operations,
  1176. do not use SYSTEM.MOVE. *)
  1177. CODE {SYSTEM.i386}
  1178. MOV ECX, [ESP] ; len
  1179. MOV EDI, [ESP+4] ; destadr
  1180. MOV ESI, [ESP+8] ; srcadr
  1181. CMP ESI, EDI
  1182. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1183. MOV EAX, ESI
  1184. ADD EAX, ECX
  1185. CMP EAX, EDI
  1186. JBE moveup ; no overlap, no problem, move up
  1187. MOV ESI, EAX
  1188. ADD EDI, ECX
  1189. DEC ESI
  1190. DEC EDI
  1191. STD ; move down since overlap occured
  1192. REP
  1193. MOVSB
  1194. JMP done
  1195. moveup:
  1196. CLD
  1197. MOV BL, CL
  1198. SHR ECX, 2
  1199. AND BL, 00000003H ; rest to move after 4 byte move
  1200. REP
  1201. MOVSD ; move 4 bytes each step
  1202. MOV CL, BL
  1203. REP
  1204. MOVSB ; move rest in one byte steps
  1205. done:
  1206. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1207. END MoveB;
  1208. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1209. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1210. origdest: ADDRESS; modes: SET; dim: LONGINT;
  1211. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1212. BEGIN
  1213. IF (dinc = elementSize) & (linc = elementSize) THEN
  1214. MoveB( ladr, dadr, len * elementSize );
  1215. (*
  1216. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1217. *)
  1218. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1219. len := len * elementSize;
  1220. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1221. ELSIF elementSize = 1 THEN
  1222. Copy1( ladr, dadr, linc, dinc, len );
  1223. (*
  1224. WHILE (len > 0) DO
  1225. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1226. END;
  1227. *)
  1228. ELSIF elementSize = 2 THEN
  1229. Copy2( ladr, dadr, linc, dinc, len );
  1230. (*
  1231. WHILE (len > 0) DO
  1232. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1233. END;
  1234. *)
  1235. ELSIF elementSize = 4 THEN
  1236. Copy4( ladr, dadr, linc, dinc, len );
  1237. (*
  1238. WHILE (len > 0) DO
  1239. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1240. END;
  1241. *)
  1242. ELSIF elementSize = 8 THEN
  1243. Copy8( ladr, dadr, linc, dinc, len );
  1244. (*
  1245. WHILE (len > 0) DO
  1246. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1247. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1248. INC( dadr, dinc );
  1249. END;
  1250. *)
  1251. ELSE (* SYSTEM.MOVE is expensive ! *)
  1252. WHILE (len > 0) DO
  1253. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1254. INC( dadr, dinc );
  1255. END;
  1256. END;
  1257. END Loop;
  1258. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  1259. VAR len: LONGINT; linc, dinc: LONGINT;
  1260. BEGIN
  1261. IF dim = loopd THEN
  1262. Loop( ladr, dadr, loopli, loopdi, looplen );
  1263. IF conservative THEN INC( glen, looplen ) END;
  1264. ELSE
  1265. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1266. dinc := GetIncr( dest, dim ); INC( dim );
  1267. WHILE (len > 0) DO
  1268. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1269. DEC( len );
  1270. END;
  1271. END;
  1272. END Traverse;
  1273. BEGIN
  1274. dim := GetDim( src );
  1275. origdest := 0; modes := {up, down}; (* copy modes *)
  1276. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1277. CopyUpCompatible( dest, src, modes );
  1278. IF up IN modes THEN (* nothing to be done *)
  1279. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1280. Reverse( src, dim ); Reverse( dest, dim )
  1281. ELSE (* can only copy via double buffer *)
  1282. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1283. END;
  1284. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1285. END;
  1286. (* check pattern: longest piece that can be done with a loop *)
  1287. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1288. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1289. IF up IN modes THEN (* nothing to be done *)
  1290. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1291. ELSE CopyContent( origdest, dest, elementSize );
  1292. END;
  1293. END CopyContent;
  1294. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT ): ANY;
  1295. VAR ptr, data: ANY; Size: LONGINT;
  1296. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1297. PROCEDURE NewData;
  1298. VAR dim, len, size: LONGINT;
  1299. BEGIN
  1300. dim := GetDim( src ); size := elementsize;
  1301. PutDim( dest, dim );
  1302. PutSize( dest, elementsize );
  1303. WHILE (dim > 0) DO
  1304. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1305. PutInc( dest, dim, size ); size := size * len;
  1306. END;
  1307. SYSTEM.NEW( data, size );
  1308. PutAdr( dest, data);
  1309. PutPtr( dest, data );
  1310. END NewData;
  1311. BEGIN
  1312. IF dest # NIL THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  1313. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1314. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1315. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1316. PutFlags(dest, {TensorFlag});
  1317. NewData(); RETURN ptr;
  1318. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1319. (* check if re-allocation of descriptor is allowed *)
  1320. IF ~(TensorFlag IN GetFlags( dest )) &
  1321. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1322. HALT( 100 );
  1323. END;
  1324. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1325. PutFlags(dest, {TensorFlag});
  1326. NewData();
  1327. RETURN ptr;
  1328. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1329. (* check if re-allocation of array data is allowed *)
  1330. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1331. HALT( 100 );
  1332. END;
  1333. NewData();
  1334. RETURN data;
  1335. ELSE (* nothing to do *)
  1336. RETURN NIL;
  1337. END;
  1338. END AllocateSame;
  1339. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1340. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1341. BEGIN
  1342. dim := GetDim(src);
  1343. p := GetArrayDesc(dim);
  1344. adr := p;
  1345. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1346. PutAdr( src, 0 );
  1347. PutPtr( src, NIL );
  1348. PutFlags( src, {} );
  1349. RETURN p;
  1350. END TempDescCopy;
  1351. (* used when arrays are passed by value *)
  1352. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: LONGINT );
  1353. VAR p: ANY;
  1354. BEGIN
  1355. ASSERT( src = dest );
  1356. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1357. CopyArray( dest, p, elementsize );
  1358. END CopyArraySelf;
  1359. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1360. VAR p: ANY; srcdim, destdim: LONGINT;
  1361. BEGIN
  1362. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1363. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1364. srcdim := GetDim(src);
  1365. destdim := GetDim(dest);
  1366. (*
  1367. Debugging.Stack("copy array");
  1368. *)
  1369. Report( "copy array source", src ); Report( "copy array des", dest );
  1370. HALT(100);
  1371. ELSIF src = dest THEN (* self copy *)
  1372. CopyArraySelf( dest, src, elementsize );
  1373. ELSE
  1374. p := AllocateSame( dest, src, elementsize );
  1375. CopyContent( dest, src, elementsize )
  1376. END;
  1377. END CopyArray;
  1378. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1379. BEGIN
  1380. dest := 0; CopyTensor( dest, src, elementsize );
  1381. END CopyTensorSelf;
  1382. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1383. elementsize: SIZE );
  1384. VAR p: ANY;
  1385. BEGIN
  1386. (* Report("dest",dest); Report("src",src); *)
  1387. IF (src = NIL) THEN dest := NIL
  1388. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1389. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1390. CopyContent( dest, src, elementsize );
  1391. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1392. ELSE CopyContent( dest, src, elementsize )
  1393. END;
  1394. END CopyTensor;
  1395. (* copy descriptor of src to that of dest. If not existent then create.*)
  1396. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS);
  1397. VAR ptr: ANY; flags: SET;
  1398. PROCEDURE CopyDescriptor;
  1399. BEGIN
  1400. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1401. END CopyDescriptor;
  1402. BEGIN
  1403. (*
  1404. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1405. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1406. *)
  1407. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1408. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1409. CopyDescriptor();
  1410. PutFlags(dest, {TensorFlag});
  1411. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1412. flags := GetFlags(dest);
  1413. (* check if re-allocation of descriptor is allowed *)
  1414. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1415. Halt(DimensionMismatch,src,0,dest);
  1416. END;
  1417. (* create a new descriptor!!! (added by Alexey) *)
  1418. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1419. CopyDescriptor();
  1420. PutFlags(dest, flags);
  1421. ELSE
  1422. flags := GetFlags(dest);
  1423. (* check if re-allocation of array data is allowed *)
  1424. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1425. Halt(AllocationForbidden,src,0,dest);
  1426. END;
  1427. CopyDescriptor();
  1428. PutFlags(dest, flags);
  1429. END;
  1430. END ShallowCopy;
  1431. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1432. BEGIN
  1433. IF debug THEN
  1434. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1435. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1436. END;
  1437. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1438. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1439. END DescriptorCopy;
  1440. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1441. VAR s,d: ADDRESS;
  1442. BEGIN
  1443. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1444. ShallowCopy(d,s);
  1445. SYSTEM.PUT(ADDRESSOF(dest),d);
  1446. END ZeroCopy;
  1447. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1448. BEGIN
  1449. ZeroCopy(src, RESULT);
  1450. RETURN RESULT
  1451. END "ALIAS";
  1452. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1453. VAR dim: LONGINT;
  1454. BEGIN
  1455. dim := GetDim( l );
  1456. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1457. WHILE (dim > 0) DO
  1458. DEC( dim );
  1459. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1460. END;
  1461. RETURN TRUE;
  1462. END SameShape;
  1463. (*
  1464. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1465. (*
  1466. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1467. check if deep copy can be avoided and if so then do a shallow copy
  1468. *)
  1469. BEGIN
  1470. ASSERT( dest # 0 ); (* impossible *)
  1471. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1472. HALT( 100 );
  1473. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1474. (* must copy (and allocate) *)
  1475. CopyArray( dest, src, elementsize );
  1476. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1477. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1478. ELSE CopyContent( dest, src, elementsize )
  1479. END;
  1480. ELSE DescriptorCopy( src, dest )
  1481. END;
  1482. END ZeroCopyArray;
  1483. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1484. (*
  1485. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1486. check if deep copy can be avoided and if so then do a shallow copy
  1487. *)
  1488. BEGIN
  1489. IF debug THEN
  1490. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1491. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1492. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1493. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1494. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1495. END;
  1496. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1497. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1498. ELSE
  1499. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1500. END;
  1501. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1502. (* must copy (and allocate) *)
  1503. CopyTensor( dest, src, elementsize );
  1504. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1505. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1506. ELSE
  1507. HALT( 100 ); (* copy forbidden *)
  1508. END;
  1509. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1510. DescriptorCopy( src, dest );
  1511. ELSE
  1512. HALT( 100 ); (* different shapes: not allowed *)
  1513. END;
  1514. END ZeroCopyTensor;
  1515. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1516. VAR i: LONGINT;
  1517. BEGIN
  1518. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1519. CopyContent( dest, left, elementSize )
  1520. ELSE
  1521. IF debug THEN
  1522. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1523. KernelLog.Ln;
  1524. END;
  1525. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1526. FOR i := 0 TO dim - 1 DO
  1527. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1528. END;
  1529. END;
  1530. END ZeroCopy;
  1531. *)
  1532. (*** conversions ****)
  1533. (** SHORTINT -> INTEGER *)
  1534. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1535. BEGIN
  1536. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1537. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1538. DEC( len );
  1539. END;
  1540. END ConvertASAILoop;
  1541. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1542. BEGIN
  1543. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1544. RETURN RESULT
  1545. END "@Convert";
  1546. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1547. BEGIN
  1548. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1549. RETURN RESULT
  1550. END "LONG";
  1551. (** SHORTINT -> LONGINT *)
  1552. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1553. BEGIN
  1554. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1555. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1556. DEC( len );
  1557. END;
  1558. END ConvertLoopSL;
  1559. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1560. BEGIN
  1561. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1562. RETURN RESULT
  1563. END "@Convert";
  1564. (** SHORTINT -> REAL *)
  1565. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1566. VAR lval: SHORTINT; dval: REAL;
  1567. BEGIN
  1568. WHILE (len > 0) DO
  1569. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1570. INC( dadr, dinc ); DEC( len );
  1571. END;
  1572. END ConvertLoopSR;
  1573. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1574. BEGIN
  1575. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1576. RETURN RESULT
  1577. END "@Convert";
  1578. (** SHORTINT -> LONGREAL *)
  1579. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1580. VAR lval: SHORTINT; dval: LONGREAL;
  1581. BEGIN
  1582. WHILE (len > 0) DO
  1583. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1584. INC( dadr, dinc ); DEC( len );
  1585. END;
  1586. END ConvertLoopSX;
  1587. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1588. BEGIN
  1589. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1590. RETURN RESULT
  1591. END "@Convert";
  1592. (** INTEGER -> SHORTINT (SHORT) *)
  1593. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1594. VAR lval: INTEGER; dval: SHORTINT;
  1595. BEGIN
  1596. WHILE (len > 0) DO
  1597. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1598. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1599. END;
  1600. END ConvertLoopIS;
  1601. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1602. BEGIN
  1603. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1604. RETURN RESULT
  1605. END "@Convert";
  1606. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1607. BEGIN
  1608. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1609. RETURN RESULT
  1610. END "SHORT";
  1611. (** INTEGER -> LONGINT *)
  1612. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1613. BEGIN
  1614. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1615. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1616. DEC( len );
  1617. END;
  1618. END ConvertLoopIL;
  1619. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1620. BEGIN
  1621. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1622. RETURN RESULT
  1623. END "@Convert";
  1624. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1625. BEGIN
  1626. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1627. RETURN RESULT
  1628. END "LONG";
  1629. (** INTEGER -> REAL *)
  1630. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1631. VAR lval: INTEGER; dval: REAL;
  1632. BEGIN
  1633. WHILE (len > 0) DO
  1634. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1635. INC( dadr, dinc ); DEC( len );
  1636. END;
  1637. END ConvertLoopIR;
  1638. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1639. BEGIN
  1640. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1641. RETURN RESULT
  1642. END "@Convert";
  1643. (** INTEGER -> LONGREAL *)
  1644. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1645. VAR lval: INTEGER; dval: LONGREAL;
  1646. BEGIN
  1647. WHILE (len > 0) DO
  1648. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1649. INC( dadr, dinc ); DEC( len );
  1650. END;
  1651. END ConvertLoopIX;
  1652. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1653. BEGIN
  1654. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1655. RETURN RESULT
  1656. END "@Convert";
  1657. (** LONGINT -> INTEGER (SHORT) *)
  1658. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1659. VAR lval: LONGINT; dval: INTEGER;
  1660. BEGIN
  1661. WHILE (len > 0) DO
  1662. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1663. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1664. END;
  1665. END ConvertLoopLI;
  1666. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1667. BEGIN
  1668. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1669. RETURN RESULT
  1670. END "@Convert";
  1671. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1672. BEGIN
  1673. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1674. RETURN RESULT
  1675. END "SHORT";
  1676. (** LONGINT -> REAL *)
  1677. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1678. VAR lval: LONGINT; dval: REAL;
  1679. BEGIN
  1680. WHILE (len > 0) DO
  1681. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1682. INC( dadr, dinc ); DEC( len );
  1683. END;
  1684. END ConvertLoopLR;
  1685. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1686. BEGIN
  1687. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1688. RETURN RESULT
  1689. END "@Convert";
  1690. (** LONGINT -> LONGREAL *)
  1691. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1692. VAR lval: LONGINT; dval: LONGREAL;
  1693. BEGIN
  1694. WHILE (len > 0) DO
  1695. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1696. INC( dadr, dinc ); DEC( len );
  1697. END;
  1698. END ConvertLoopLX;
  1699. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1700. BEGIN
  1701. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1702. RETURN RESULT
  1703. END "@Convert";
  1704. (** REAL -> LONGINT (ENTIER) *)
  1705. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1706. VAR lval: REAL; dval: LONGINT;
  1707. BEGIN
  1708. WHILE (len > 0) DO
  1709. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1710. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1711. END;
  1712. END ConvertLoopRL;
  1713. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1714. BEGIN
  1715. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1716. RETURN RESULT
  1717. END "@Convert";
  1718. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1719. BEGIN
  1720. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1721. RETURN RESULT
  1722. END "ENTIER";
  1723. (** REAL -> LONGREAL *)
  1724. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1725. VAR lval: REAL; dval: LONGREAL;
  1726. BEGIN
  1727. WHILE (len > 0) DO
  1728. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1729. INC( dadr, dinc ); DEC( len );
  1730. END;
  1731. END ConvertLoopRX;
  1732. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1733. BEGIN
  1734. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1735. RETURN RESULT
  1736. END "@Convert";
  1737. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1738. BEGIN
  1739. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1740. RETURN RESULT
  1741. END "LONG";
  1742. (** LONGREAL -> REAL (SHORT) *)
  1743. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1744. VAR lval: LONGREAL; dval: REAL;
  1745. BEGIN
  1746. WHILE (len > 0) DO
  1747. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1748. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1749. END;
  1750. END ConvertLoopXR;
  1751. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1752. BEGIN
  1753. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1754. RETURN RESULT
  1755. END "@Convert";
  1756. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1757. BEGIN
  1758. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1759. RETURN RESULT
  1760. END "SHORT";
  1761. (** LONGREAL -> LONGINT (ENTIER) *)
  1762. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1763. VAR lval: LONGREAL; dval: LONGINT;
  1764. BEGIN
  1765. WHILE (len > 0) DO
  1766. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1767. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1768. END;
  1769. END ConvertLoopXL;
  1770. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1771. BEGIN
  1772. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1773. RETURN RESULT
  1774. END "@Convert";
  1775. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1776. BEGIN
  1777. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1778. RETURN RESULT
  1779. END "ENTIER";
  1780. (*** monadic not A -> ~A ********************************************************************)
  1781. (** BOOLEAN *)
  1782. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1783. VAR lval: BOOLEAN;
  1784. BEGIN
  1785. WHILE (len > 0) DO
  1786. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1787. DEC( len );
  1788. END;
  1789. END NotLoopAB;
  1790. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1791. BEGIN
  1792. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1793. RETURN RESULT
  1794. END "~";
  1795. (*** monadic generic (A) -> -A ********************************************************************)
  1796. (** SHORTINT *)
  1797. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1798. VAR lval: SHORTINT;
  1799. BEGIN
  1800. WHILE (len > 0) DO
  1801. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1802. DEC( len );
  1803. END;
  1804. END GenericLoopS;
  1805. (** INTEGER *)
  1806. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1807. VAR lval: INTEGER;
  1808. BEGIN
  1809. WHILE (len > 0) DO
  1810. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1811. DEC( len );
  1812. END;
  1813. END GenericLoopI;
  1814. (** LONGINT *)
  1815. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1816. VAR lval: LONGINT;
  1817. BEGIN
  1818. WHILE (len > 0) DO
  1819. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1820. DEC( len );
  1821. END;
  1822. END GenericLoopL;
  1823. (** HUGEINT *)
  1824. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1825. VAR lval: HUGEINT;
  1826. BEGIN
  1827. WHILE (len > 0) DO
  1828. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1829. DEC( len );
  1830. END;
  1831. END GenericLoopH;
  1832. (** REAL *)
  1833. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1834. VAR lval: REAL;
  1835. BEGIN
  1836. WHILE (len > 0) DO
  1837. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1838. DEC( len );
  1839. END;
  1840. END GenericLoopR;
  1841. (** LONGREAL *)
  1842. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1843. VAR lval: LONGREAL;
  1844. BEGIN
  1845. WHILE (len > 0) DO
  1846. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1847. DEC( len );
  1848. END;
  1849. END GenericLoopX;
  1850. (** COMPLEX *)
  1851. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1852. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1853. BEGIN
  1854. WHILE (len > 0) DO
  1855. lval := ladr;
  1856. dval := dadr;
  1857. dval.val := op(lval.val);
  1858. INC( ladr, linc ); INC( dadr, dinc );
  1859. DEC( len );
  1860. END;
  1861. END GenericLoopZ;
  1862. (** LONGCOMPLEX *)
  1863. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1864. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1865. BEGIN
  1866. WHILE (len > 0) DO
  1867. lval := ladr;
  1868. dval := dadr;
  1869. dval.val := op (lval.val);
  1870. INC( ladr, linc ); INC( dadr, dinc );
  1871. DEC( len );
  1872. END;
  1873. END GenericLoopLZ;
  1874. (*** monadic minus A -> -A ********************************************************************)
  1875. (** SHORTINT *)
  1876. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1877. VAR lval: SHORTINT;
  1878. BEGIN
  1879. WHILE (len > 0) DO
  1880. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1881. DEC( len );
  1882. END;
  1883. END MinusLoopS;
  1884. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1885. BEGIN
  1886. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1887. RETURN RESULT
  1888. END "-";
  1889. (** INTEGER *)
  1890. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1891. VAR lval: INTEGER;
  1892. BEGIN
  1893. WHILE (len > 0) DO
  1894. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1895. DEC( len );
  1896. END;
  1897. END MinusLoopI;
  1898. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1899. BEGIN
  1900. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1901. RETURN RESULT
  1902. END "-";
  1903. (** LONGINT *)
  1904. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1905. VAR lval: LONGINT;
  1906. BEGIN
  1907. WHILE (len > 0) DO
  1908. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1909. DEC( len );
  1910. END;
  1911. END MinusLoopL;
  1912. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1913. BEGIN
  1914. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1915. RETURN RESULT
  1916. END "-";
  1917. (** REAL *)
  1918. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1919. VAR lval: REAL;
  1920. BEGIN
  1921. WHILE (len > 0) DO
  1922. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1923. DEC( len );
  1924. END;
  1925. END MinusLoopR;
  1926. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1927. BEGIN
  1928. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1929. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1930. RETURN RESULT
  1931. END "-";
  1932. (** LONGREAL *)
  1933. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1934. VAR lval: LONGREAL;
  1935. BEGIN
  1936. WHILE (len > 0) DO
  1937. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1938. DEC( len );
  1939. END;
  1940. END MinusLoopX;
  1941. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1942. BEGIN
  1943. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1944. MinusLoopX );
  1945. RETURN RESULT
  1946. END "-";
  1947. (*** add array + array -> array ********************************************************************)
  1948. (** SHORTINT *)
  1949. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1950. VAR lval, rval: SHORTINT;
  1951. BEGIN
  1952. WHILE (len > 0) DO
  1953. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1954. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1955. END;
  1956. END AddASASLoop;
  1957. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1958. BEGIN
  1959. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1960. SIZEOF( SHORTINT ), AddASASLoop );
  1961. RETURN RESULT
  1962. END "+";
  1963. (** INTEGER *)
  1964. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1965. VAR lval, rval: INTEGER;
  1966. BEGIN
  1967. WHILE (len > 0) DO
  1968. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1969. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1970. END;
  1971. END AddAIAILoop;
  1972. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  1973. BEGIN
  1974. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1975. SIZEOF( INTEGER ), AddAIAILoop );
  1976. RETURN RESULT
  1977. END "+";
  1978. (** LONGINT *)
  1979. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1980. VAR lval, rval: LONGINT;
  1981. BEGIN
  1982. WHILE (len > 0) DO
  1983. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1984. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1985. END;
  1986. END AddALALLoop;
  1987. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  1988. BEGIN
  1989. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1990. SIZEOF( LONGINT ), AddALALLoop );
  1991. RETURN RESULT
  1992. END "+";
  1993. (** REAL *)
  1994. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1995. VAR lval, rval: REAL;
  1996. BEGIN
  1997. WHILE (len > 0) DO
  1998. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1999. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2000. END;
  2001. END AddARARLoop;
  2002. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2003. BEGIN
  2004. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2005. loopAddARAR );
  2006. RETURN RESULT
  2007. END "+";
  2008. (** LONGREAL *)
  2009. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2010. VAR lval, rval: LONGREAL;
  2011. BEGIN
  2012. WHILE (len > 0) DO
  2013. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2014. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2015. END;
  2016. END AddAXAXLoop;
  2017. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2018. BEGIN
  2019. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2020. SIZEOF( LONGREAL ), loopAddAXAX );
  2021. RETURN RESULT
  2022. END "+";
  2023. (** COMPLEX *)
  2024. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2025. VAR lval, rval: COMPLEX;
  2026. BEGIN
  2027. WHILE (len > 0) DO
  2028. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2029. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2030. END;
  2031. END AddAZAZLoop;
  2032. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2033. BEGIN
  2034. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2035. SIZEOF( COMPLEX ), loopAddAZAZ );
  2036. RETURN RESULT
  2037. END "+";
  2038. (** LONGCOMPLEX *)
  2039. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2040. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2041. BEGIN
  2042. WHILE (len > 0) DO
  2043. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2044. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2045. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2046. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2047. DEC( len );
  2048. END;
  2049. END AddALZALZLoop;
  2050. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2051. BEGIN
  2052. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2053. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2054. RETURN RESULT
  2055. END "+";
  2056. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2057. (** SHORTINT *)
  2058. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2059. VAR lval, rval: SHORTINT;
  2060. BEGIN
  2061. SYSTEM.GET( radr, rval );
  2062. WHILE (len > 0) DO
  2063. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2064. INC( dadr, dinc ); DEC( len );
  2065. END;
  2066. END AddASSSLoop;
  2067. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2068. BEGIN
  2069. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2070. SIZEOF( SHORTINT ), AddASSSLoop );
  2071. RETURN RESULT
  2072. END "+";
  2073. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2074. BEGIN
  2075. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2076. SIZEOF( SHORTINT ), AddASSSLoop );
  2077. RETURN RESULT
  2078. END "+";
  2079. (** INTEGER *)
  2080. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2081. VAR lval, rval: INTEGER;
  2082. BEGIN
  2083. SYSTEM.GET( radr, rval );
  2084. WHILE (len > 0) DO
  2085. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2086. INC( dadr, dinc ); DEC( len );
  2087. END;
  2088. END AddAISILoop;
  2089. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2090. BEGIN
  2091. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2092. SIZEOF( INTEGER ), AddAISILoop );
  2093. RETURN RESULT
  2094. END "+";
  2095. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2096. BEGIN
  2097. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2098. SIZEOF( INTEGER ), AddAISILoop );
  2099. RETURN RESULT
  2100. END "+";
  2101. (** LONGINT *)
  2102. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2103. VAR lval, rval: LONGINT;
  2104. BEGIN
  2105. SYSTEM.GET( radr, rval );
  2106. WHILE (len > 0) DO
  2107. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2108. INC( dadr, dinc ); DEC( len );
  2109. END;
  2110. END AddALSLLoop;
  2111. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2112. BEGIN
  2113. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2114. SIZEOF( LONGINT ), AddALSLLoop );
  2115. RETURN RESULT
  2116. END "+";
  2117. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2118. BEGIN
  2119. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2120. SIZEOF( LONGINT ), AddALSLLoop );
  2121. RETURN RESULT
  2122. END "+";
  2123. (** REAL *)
  2124. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2125. VAR lval, rval: REAL;
  2126. BEGIN
  2127. SYSTEM.GET( radr, rval );
  2128. WHILE (len > 0) DO
  2129. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2130. INC( dadr, dinc ); DEC( len );
  2131. END;
  2132. END AddARSRLoop;
  2133. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2134. BEGIN
  2135. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2136. AddARSRLoop );
  2137. RETURN RESULT
  2138. END "+";
  2139. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2140. BEGIN
  2141. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2142. AddARSRLoop );
  2143. RETURN RESULT
  2144. END "+";
  2145. (** LONGREAL *)
  2146. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2147. VAR lval, rval: LONGREAL;
  2148. BEGIN
  2149. SYSTEM.GET( radr, rval );
  2150. WHILE (len > 0) DO
  2151. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2152. INC( dadr, dinc ); DEC( len );
  2153. END;
  2154. END AddAXSXLoop;
  2155. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2156. BEGIN
  2157. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2158. SIZEOF( LONGREAL ), AddAXSXLoop );
  2159. RETURN RESULT
  2160. END "+";
  2161. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2162. BEGIN
  2163. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2164. SIZEOF( LONGREAL ), AddAXSXLoop );
  2165. RETURN RESULT
  2166. END "+";
  2167. (** COMPLEX *)
  2168. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2169. VAR lval, rval: COMPLEX;
  2170. BEGIN
  2171. SYSTEM.GET( radr, rval );
  2172. WHILE (len > 0) DO
  2173. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2174. INC( dadr, dinc ); DEC( len );
  2175. END;
  2176. END AddAZSZLoop;
  2177. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2178. BEGIN
  2179. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2180. AddAZSZLoop );
  2181. RETURN RESULT
  2182. END "+";
  2183. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2184. BEGIN
  2185. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2186. AddAZSZLoop );
  2187. RETURN RESULT
  2188. END "+";
  2189. (** LONGCOMPLEX *)
  2190. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2191. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2192. BEGIN
  2193. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2194. WHILE (len > 0) DO
  2195. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2196. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2197. INC( ladr, linc );
  2198. INC( dadr, dinc ); DEC( len );
  2199. END;
  2200. END AddALZSLZLoop;
  2201. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2202. BEGIN
  2203. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2204. AddALZSLZLoop );
  2205. RETURN RESULT
  2206. END "+";
  2207. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2208. BEGIN
  2209. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2210. AddALZSLZLoop );
  2211. RETURN RESULT
  2212. END "+";
  2213. (*** subtraction array - array -> array ********************************************************************)
  2214. (** SHORTINT *)
  2215. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2216. VAR lval, rval: SHORTINT;
  2217. BEGIN
  2218. WHILE (len > 0) DO
  2219. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2220. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2221. END;
  2222. END SubASASLoop;
  2223. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2224. BEGIN
  2225. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2226. SIZEOF( SHORTINT ), SubASASLoop );
  2227. RETURN RESULT
  2228. END "-";
  2229. (** INTEGER *)
  2230. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2231. VAR lval, rval: INTEGER;
  2232. BEGIN
  2233. WHILE (len > 0) DO
  2234. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2235. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2236. END;
  2237. END SubAIAILoop;
  2238. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2239. BEGIN
  2240. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2241. SIZEOF( INTEGER ), SubAIAILoop );
  2242. RETURN RESULT
  2243. END "-";
  2244. (** LONGINT *)
  2245. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2246. VAR lval, rval: LONGINT;
  2247. BEGIN
  2248. WHILE (len > 0) DO
  2249. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2250. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2251. END;
  2252. END SubALALLoop;
  2253. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2254. BEGIN
  2255. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2256. SIZEOF( LONGINT ), SubALALLoop );
  2257. RETURN RESULT
  2258. END "-";
  2259. (** REAL *)
  2260. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2261. VAR lval, rval: REAL;
  2262. BEGIN
  2263. WHILE (len > 0) DO
  2264. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2265. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2266. END;
  2267. END SubARARLoop;
  2268. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2269. BEGIN
  2270. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2271. SubARARLoop );
  2272. RETURN RESULT
  2273. END "-";
  2274. (** LONGREAL *)
  2275. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2276. VAR lval, rval: LONGREAL;
  2277. BEGIN
  2278. WHILE (len > 0) DO
  2279. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2280. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2281. END;
  2282. END SubAXAXLoop;
  2283. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2284. BEGIN
  2285. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2286. SIZEOF( LONGREAL ), SubAXAXLoop );
  2287. RETURN RESULT
  2288. END "-";
  2289. (** COMPLEX *)
  2290. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2291. VAR lval, rval: COMPLEX;
  2292. BEGIN
  2293. WHILE (len > 0) DO
  2294. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2295. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2296. END;
  2297. END SubAZAZLoop;
  2298. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2299. BEGIN
  2300. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2301. SIZEOF( COMPLEX ), SubAZAZLoop );
  2302. RETURN RESULT
  2303. END "-";
  2304. (** LONGCOMPLEX *)
  2305. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2306. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2307. BEGIN
  2308. WHILE (len > 0) DO
  2309. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2310. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2311. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2312. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2313. DEC( len );
  2314. END;
  2315. END SubALZALZLoop;
  2316. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2317. BEGIN
  2318. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2319. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2320. RETURN RESULT
  2321. END "-";
  2322. (*** subtraction array-scalar -> array ********************************************************************)
  2323. (** SHORTINT *)
  2324. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2325. BEGIN
  2326. RESULT := left + (-right);
  2327. RETURN RESULT
  2328. END "-";
  2329. (** INTEGER *)
  2330. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2331. BEGIN
  2332. RESULT := left + (-right);
  2333. RETURN RESULT
  2334. END "-";
  2335. (** LONGINT *)
  2336. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2337. BEGIN
  2338. RESULT := left + (-right);
  2339. RETURN RESULT
  2340. END "-";
  2341. (** REAL *)
  2342. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2343. BEGIN
  2344. RESULT := left + (-right);
  2345. RETURN RESULT
  2346. END "-";
  2347. (** LONGREAL *)
  2348. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2349. BEGIN
  2350. RESULT := left + (-right);
  2351. RETURN RESULT
  2352. END "-";
  2353. (** COMPLEX *)
  2354. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2355. BEGIN
  2356. RESULT := left + (-right);
  2357. RETURN RESULT
  2358. END "-";
  2359. (** LONGCOMPLEX *)
  2360. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2361. BEGIN
  2362. RESULT := left + (-right);
  2363. RETURN RESULT
  2364. END "-";
  2365. (*** subtraction scalar-array -> array ********************************************************************)
  2366. (** SHORTINT *)
  2367. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2368. VAR lval, rval, dval: SHORTINT;
  2369. BEGIN
  2370. SYSTEM.GET( radr, rval );
  2371. WHILE (len > 0) DO
  2372. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2373. INC( dadr, dinc ); DEC( len );
  2374. END;
  2375. END SubSSASLoop;
  2376. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2377. BEGIN
  2378. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2379. SIZEOF( SHORTINT ), SubSSASLoop );
  2380. RETURN RESULT
  2381. END "-";
  2382. (** INTEGER *)
  2383. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2384. VAR lval, rval, dval: INTEGER;
  2385. BEGIN
  2386. SYSTEM.GET( radr, rval );
  2387. WHILE (len > 0) DO
  2388. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2389. INC( dadr, dinc ); DEC( len );
  2390. END;
  2391. END SubSIAILoop;
  2392. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2393. BEGIN
  2394. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2395. SIZEOF( INTEGER ), SubSIAILoop );
  2396. RETURN RESULT
  2397. END "-";
  2398. (** LONGINT *)
  2399. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2400. VAR lval, rval, dval: LONGINT;
  2401. BEGIN
  2402. SYSTEM.GET( radr, rval );
  2403. WHILE (len > 0) DO
  2404. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2405. INC( dadr, dinc ); DEC( len );
  2406. END;
  2407. END SubSLALLoop;
  2408. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2409. BEGIN
  2410. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2411. SIZEOF( LONGINT ), SubSLALLoop );
  2412. RETURN RESULT
  2413. END "-";
  2414. (** REAL *)
  2415. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2416. VAR lval, rval, dval: REAL;
  2417. BEGIN
  2418. SYSTEM.GET( radr, rval );
  2419. WHILE (len > 0) DO
  2420. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2421. INC( dadr, dinc ); DEC( len );
  2422. END;
  2423. END SubSRARLoop;
  2424. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2425. BEGIN
  2426. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2427. SubSRARLoop );
  2428. RETURN RESULT
  2429. END "-";
  2430. (** LONGREAL *)
  2431. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2432. VAR lval, rval, dval: LONGREAL;
  2433. BEGIN
  2434. SYSTEM.GET( radr, rval );
  2435. WHILE (len > 0) DO
  2436. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2437. INC( dadr, dinc ); DEC( len );
  2438. END;
  2439. END SubSXAXLoop;
  2440. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2441. BEGIN
  2442. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2443. SIZEOF( LONGREAL ), SubSXAXLoop );
  2444. RETURN RESULT
  2445. END "-";
  2446. (** COMPLEX *)
  2447. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2448. VAR lval, rval, dval: COMPLEX;
  2449. BEGIN
  2450. SYSTEM.GET( radr, rval );
  2451. WHILE (len > 0) DO
  2452. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2453. INC( dadr, dinc ); DEC( len );
  2454. END;
  2455. END SubSZAZLoop;
  2456. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2457. BEGIN
  2458. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2459. SIZEOF( COMPLEX ), SubSZAZLoop );
  2460. RETURN RESULT
  2461. END "-";
  2462. (** LONGCOMPLEX *)
  2463. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2464. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2465. BEGIN
  2466. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2467. WHILE (len > 0) DO
  2468. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2469. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2470. INC( ladr, linc );
  2471. INC( dadr, dinc ); DEC( len );
  2472. END;
  2473. END SubSLZALZLoop;
  2474. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2475. BEGIN
  2476. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2477. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2478. RETURN RESULT
  2479. END "-";
  2480. (*** element-wise multiply array x array -> array ********************************************************************)
  2481. (** SHORTINT *)
  2482. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2483. VAR lval, rval: SHORTINT;
  2484. BEGIN
  2485. WHILE (len > 0) DO
  2486. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2487. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2488. END;
  2489. END EMulASASLoop;
  2490. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2491. BEGIN
  2492. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2493. SIZEOF( SHORTINT ), EMulASASLoop );
  2494. RETURN RESULT
  2495. END ".*";
  2496. (** INTEGER *)
  2497. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2498. VAR lval, rval: INTEGER; dval: INTEGER;
  2499. BEGIN
  2500. WHILE (len > 0) DO
  2501. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2502. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2503. DEC( len );
  2504. END;
  2505. END EMulAIAILoop;
  2506. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2507. BEGIN
  2508. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2509. SIZEOF( INTEGER ), EMulAIAILoop );
  2510. RETURN RESULT
  2511. END ".*";
  2512. (** LONGINT *)
  2513. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2514. VAR lval, rval: LONGINT;
  2515. BEGIN
  2516. WHILE (len > 0) DO
  2517. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2518. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2519. END;
  2520. END EMulALALLoop;
  2521. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2522. BEGIN
  2523. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2524. SIZEOF( LONGINT ), EMulALALLoop );
  2525. RETURN RESULT
  2526. END ".*";
  2527. (** REAL *)
  2528. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2529. VAR lval, rval: REAL;
  2530. BEGIN
  2531. WHILE (len > 0) DO
  2532. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2533. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2534. END;
  2535. END EMulARARLoop;
  2536. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2537. BEGIN
  2538. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2539. EMulARARLoop );
  2540. RETURN RESULT
  2541. END ".*";
  2542. (** LONGREAL *)
  2543. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2544. VAR lval, rval: LONGREAL;
  2545. BEGIN
  2546. WHILE (len > 0) DO
  2547. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2548. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2549. END;
  2550. END EMulAXAXLoop;
  2551. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2552. BEGIN
  2553. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2554. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2555. RETURN RESULT
  2556. END ".*";
  2557. (** COMPLEX *)
  2558. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2559. VAR lval, rval: COMPLEX;
  2560. BEGIN
  2561. WHILE (len > 0) DO
  2562. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2563. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2564. END;
  2565. END EMulAZAZLoop;
  2566. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2567. BEGIN
  2568. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2569. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2570. RETURN RESULT
  2571. END ".*";
  2572. (** LONGCOMPLEX *)
  2573. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2574. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2575. BEGIN
  2576. WHILE (len > 0) DO
  2577. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2578. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2579. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2580. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2581. DEC( len );
  2582. END;
  2583. END EMulALZALZLoop;
  2584. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2585. BEGIN
  2586. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2587. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2588. RETURN RESULT
  2589. END ".*";
  2590. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2591. (** SHORTINT *)
  2592. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2593. VAR lval, rval,dval: SHORTINT;
  2594. BEGIN
  2595. WHILE (len > 0) DO
  2596. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2597. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2598. END;
  2599. END EMulIncASASLoop;
  2600. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2601. BEGIN
  2602. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2603. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2604. END ".*+";
  2605. (** INTEGER *)
  2606. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2607. VAR lval, rval,dval: INTEGER;
  2608. BEGIN
  2609. WHILE (len > 0) DO
  2610. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2611. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2612. DEC( len );
  2613. END;
  2614. END EMulIncAIAILoop;
  2615. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2616. BEGIN
  2617. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2618. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2619. END ".*+";
  2620. (** LONGINT *)
  2621. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2622. VAR lval, rval,dval: LONGINT;
  2623. BEGIN
  2624. WHILE (len > 0) DO
  2625. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2626. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2627. END;
  2628. END EMulIncALALLoop;
  2629. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2630. BEGIN
  2631. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2632. SIZEOF( LONGINT ), EMulIncALALLoop );
  2633. END ".*+";
  2634. (** REAL *)
  2635. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2636. VAR lval, rval,dval: REAL;
  2637. BEGIN
  2638. WHILE (len > 0) DO
  2639. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2640. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2641. END;
  2642. END EMulIncARARLoop;
  2643. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2644. BEGIN
  2645. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2646. EMulIncARARLoop );
  2647. END ".*+";
  2648. (** LONGREAL *)
  2649. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2650. VAR lval, rval,dval: LONGREAL;
  2651. BEGIN
  2652. WHILE (len > 0) DO
  2653. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2654. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2655. END;
  2656. END EMulIncAXAXLoop;
  2657. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2658. BEGIN
  2659. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2660. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2661. END ".*+";
  2662. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2663. (** SHORTINT *)
  2664. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2665. VAR lval, rval: SHORTINT;
  2666. BEGIN
  2667. SYSTEM.GET( radr, rval );
  2668. WHILE (len > 0) DO
  2669. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2670. INC( dadr, dinc ); DEC( len );
  2671. END;
  2672. END MulASSSLoop;
  2673. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2674. BEGIN
  2675. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2676. SIZEOF( SHORTINT ), MulASSSLoop );
  2677. RETURN RESULT
  2678. END "*";
  2679. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2680. BEGIN
  2681. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2682. SIZEOF( SHORTINT ), MulASSSLoop );
  2683. RETURN RESULT
  2684. END "*";
  2685. (** INTEGER *)
  2686. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2687. VAR lval, rval: INTEGER;
  2688. BEGIN
  2689. SYSTEM.GET( radr, rval );
  2690. WHILE (len > 0) DO
  2691. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2692. INC( dadr, dinc ); DEC( len );
  2693. END;
  2694. END MulAISILoop;
  2695. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2696. BEGIN
  2697. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2698. SIZEOF( INTEGER ), MulAISILoop );
  2699. RETURN RESULT
  2700. END "*";
  2701. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2702. BEGIN
  2703. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2704. SIZEOF( INTEGER ), MulAISILoop );
  2705. RETURN RESULT
  2706. END "*";
  2707. (** LONGINT *)
  2708. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2709. VAR lval, rval: LONGINT;
  2710. BEGIN
  2711. SYSTEM.GET( radr, rval );
  2712. WHILE (len > 0) DO
  2713. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2714. INC( dadr, dinc ); DEC( len );
  2715. END;
  2716. END MulALSLLoop;
  2717. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2718. BEGIN
  2719. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2720. SIZEOF( LONGINT ), MulALSLLoop );
  2721. RETURN RESULT
  2722. END "*";
  2723. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2724. BEGIN
  2725. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2726. SIZEOF( LONGINT ), MulALSLLoop );
  2727. RETURN RESULT
  2728. END "*";
  2729. (** REAL *)
  2730. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2731. VAR lval, rval: REAL;
  2732. BEGIN
  2733. SYSTEM.GET( radr, rval );
  2734. WHILE (len > 0) DO
  2735. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2736. INC( dadr, dinc ); DEC( len );
  2737. END;
  2738. END MulARSRLoop;
  2739. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2740. BEGIN
  2741. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2742. loopMulARSR );
  2743. RETURN RESULT
  2744. END "*";
  2745. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2746. BEGIN
  2747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2748. loopMulARSR );
  2749. RETURN RESULT
  2750. END "*";
  2751. (** LONGREAL *)
  2752. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2753. VAR lval, rval: LONGREAL;
  2754. BEGIN
  2755. IF debug THEN
  2756. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2757. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2758. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2759. END;
  2760. SYSTEM.GET( radr, rval );
  2761. WHILE (len > 0) DO
  2762. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2763. INC( dadr, dinc ); DEC( len );
  2764. END;
  2765. END MulAXSXLoop;
  2766. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2767. BEGIN
  2768. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2769. SIZEOF( LONGREAL ), loopMulAXSX );
  2770. RETURN RESULT
  2771. END "*";
  2772. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2773. BEGIN
  2774. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2775. SIZEOF( LONGREAL ), loopMulAXSX );
  2776. RETURN RESULT
  2777. END "*";
  2778. (** COMPLEX *)
  2779. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2780. VAR lval, rval: COMPLEX;
  2781. BEGIN
  2782. SYSTEM.GET( radr, rval );
  2783. WHILE (len > 0) DO
  2784. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2785. INC( dadr, dinc ); DEC( len );
  2786. END;
  2787. END MulAZSZLoop;
  2788. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2789. BEGIN
  2790. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2791. loopMulAZSZ );
  2792. RETURN RESULT
  2793. END "*";
  2794. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2795. BEGIN
  2796. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2797. loopMulAZSZ );
  2798. RETURN RESULT
  2799. END "*";
  2800. (** LONGCOMPLEX *)
  2801. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2802. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2803. BEGIN
  2804. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2805. WHILE (len > 0) DO
  2806. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2807. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2808. INC( ladr, linc );
  2809. INC( dadr, dinc ); DEC( len );
  2810. END;
  2811. END MulALZSLZLoop;
  2812. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2813. BEGIN
  2814. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2815. loopMulALZSLZ );
  2816. RETURN RESULT
  2817. END "*";
  2818. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2819. BEGIN
  2820. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2821. loopMulALZSLZ );
  2822. RETURN RESULT
  2823. END "*";
  2824. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2825. (** SHORTINT *)
  2826. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2827. VAR lval, rval, dval: SHORTINT;
  2828. BEGIN
  2829. SYSTEM.GET( radr, rval );
  2830. WHILE (len > 0) DO
  2831. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2832. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2833. END;
  2834. END IncMulASSSLoop;
  2835. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2836. BEGIN
  2837. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2838. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2839. END "INCMUL";
  2840. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2841. BEGIN
  2842. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2843. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2844. RETURN RESULT
  2845. END "INCMUL";
  2846. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2847. BEGIN
  2848. RESULT := -RESULT;
  2849. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2850. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2851. RESULT := -RESULT;
  2852. RETURN RESULT
  2853. END "DECMUL";
  2854. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2855. BEGIN
  2856. RESULT := -RESULT;
  2857. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2858. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2859. RESULT := -RESULT;
  2860. RETURN RESULT
  2861. END "DECMUL";
  2862. (** INTEGER *)
  2863. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2864. VAR lval, rval, dval: INTEGER;
  2865. BEGIN
  2866. SYSTEM.GET( radr, rval );
  2867. WHILE (len > 0) DO
  2868. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2869. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2870. END;
  2871. END IncMulAISILoop;
  2872. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2873. BEGIN
  2874. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2875. SIZEOF( INTEGER ), IncMulAISILoop );
  2876. RETURN RESULT
  2877. END "INCMUL";
  2878. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2879. BEGIN
  2880. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2881. SIZEOF( INTEGER ), IncMulAISILoop );
  2882. RETURN RESULT
  2883. END "INCMUL";
  2884. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2885. BEGIN
  2886. RESULT := -RESULT;
  2887. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2888. SIZEOF( INTEGER ), IncMulAISILoop );
  2889. RESULT := -RESULT;
  2890. RETURN RESULT
  2891. END "DECMUL";
  2892. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2893. BEGIN
  2894. RESULT := -RESULT;
  2895. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2896. SIZEOF( INTEGER ), IncMulAISILoop );
  2897. RESULT := -RESULT;
  2898. RETURN RESULT
  2899. END "DECMUL";
  2900. (** LONGINT *)
  2901. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2902. VAR lval, rval, dval: LONGINT;
  2903. BEGIN
  2904. SYSTEM.GET( radr, rval );
  2905. WHILE (len > 0) DO
  2906. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2907. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2908. END;
  2909. END IncMulALSLLoop;
  2910. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2911. BEGIN
  2912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2913. SIZEOF( LONGINT ), IncMulALSLLoop );
  2914. RETURN RESULT
  2915. END "INCMUL";
  2916. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2917. BEGIN
  2918. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2919. SIZEOF( LONGINT ), IncMulALSLLoop );
  2920. RETURN RESULT
  2921. END "INCMUL";
  2922. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2923. BEGIN
  2924. RESULT := -RESULT;
  2925. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2926. SIZEOF( LONGINT ), IncMulALSLLoop );
  2927. RESULT := -RESULT;
  2928. RETURN RESULT
  2929. END "DECMUL";
  2930. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2931. BEGIN
  2932. RESULT := -RESULT;
  2933. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2934. SIZEOF( LONGINT ), IncMulALSLLoop );
  2935. RESULT := -RESULT;
  2936. RETURN RESULT
  2937. END "DECMUL";
  2938. (** REAL *)
  2939. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2940. VAR lval, rval, dval: REAL;
  2941. BEGIN
  2942. SYSTEM.GET( radr, rval );
  2943. WHILE (len > 0) DO
  2944. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2945. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2946. END;
  2947. END IncMulARSRLoop;
  2948. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2949. BEGIN
  2950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2951. loopIncMulARSR );
  2952. RETURN RESULT
  2953. END "INCMUL";
  2954. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2955. BEGIN
  2956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2957. loopIncMulARSR );
  2958. RETURN RESULT
  2959. END "INCMUL";
  2960. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2961. BEGIN
  2962. RESULT := -RESULT;
  2963. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2964. loopIncMulARSR );
  2965. RESULT := -RESULT;
  2966. RETURN RESULT
  2967. END "DECMUL";
  2968. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2969. BEGIN
  2970. RESULT := -RESULT;
  2971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2972. loopIncMulARSR );
  2973. RESULT := -RESULT;
  2974. RETURN RESULT
  2975. END "DECMUL";
  2976. (** LONGREAL *)
  2977. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2978. VAR lval, rval, dval: LONGREAL;
  2979. BEGIN
  2980. IF debug THEN
  2981. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2982. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2983. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2984. END;
  2985. SYSTEM.GET( radr, rval );
  2986. WHILE (len > 0) DO
  2987. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2988. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2989. END;
  2990. END IncMulAXSXLoop;
  2991. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2992. BEGIN
  2993. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2994. SIZEOF( LONGREAL ), loopIncMulAXSX );
  2995. RETURN RESULT
  2996. END "INCMUL";
  2997. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2998. BEGIN
  2999. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3000. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3001. RETURN RESULT
  3002. END "INCMUL";
  3003. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3004. BEGIN
  3005. RESULT := -RESULT;
  3006. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3007. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3008. RESULT := -RESULT;
  3009. RETURN RESULT
  3010. END "DECMUL";
  3011. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3012. BEGIN
  3013. RESULT := -RESULT;
  3014. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3015. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3016. RESULT := -RESULT;
  3017. RETURN RESULT
  3018. END "DECMUL";
  3019. (*** element-wise division array / array -> array ********************************************************************)
  3020. (** SHORTINT *)
  3021. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3022. VAR lval, rval: SHORTINT; dval: REAL;
  3023. BEGIN
  3024. WHILE (len > 0) DO
  3025. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3026. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3027. DEC( len );
  3028. END;
  3029. END EDivideASASLoop;
  3030. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3031. BEGIN
  3032. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3033. EDivideASASLoop );
  3034. RETURN RESULT
  3035. END "./";
  3036. (** INTEGER *)
  3037. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3038. VAR lval, rval: INTEGER; dval: REAL;
  3039. BEGIN
  3040. WHILE (len > 0) DO
  3041. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3042. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3043. DEC( len );
  3044. END;
  3045. END EDivideAIAILoop;
  3046. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3047. BEGIN
  3048. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3049. EDivideAIAILoop );
  3050. RETURN RESULT
  3051. END "./";
  3052. (** LONGINT *)
  3053. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3054. VAR lval, rval: LONGINT; dval: REAL;
  3055. BEGIN
  3056. WHILE (len > 0) DO
  3057. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3058. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3059. DEC( len );
  3060. END;
  3061. END EDivideALALLoop;
  3062. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3063. BEGIN
  3064. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3065. EDivideALALLoop );
  3066. RETURN RESULT
  3067. END "./";
  3068. (** REAL *)
  3069. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3070. VAR lval, rval: REAL; dval: REAL;
  3071. BEGIN
  3072. WHILE (len > 0) DO
  3073. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3074. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3075. DEC( len );
  3076. END;
  3077. END EDivideARARLoop;
  3078. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3079. BEGIN
  3080. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3081. EDivideARARLoop );
  3082. RETURN RESULT
  3083. END "./";
  3084. (** LONGREAL *)
  3085. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3086. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3087. BEGIN
  3088. WHILE (len > 0) DO
  3089. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3090. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3091. DEC( len );
  3092. END;
  3093. END EDivideAXAXLoop;
  3094. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3095. BEGIN
  3096. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3097. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3098. RETURN RESULT
  3099. END "./";
  3100. (** COMPLEX *)
  3101. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3102. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3103. BEGIN
  3104. WHILE (len > 0) DO
  3105. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3106. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3107. DEC( len );
  3108. END;
  3109. END EDivideAZAZLoop;
  3110. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3111. BEGIN
  3112. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3113. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3114. RETURN RESULT
  3115. END "./";
  3116. (** LONGCOMPLEX *)
  3117. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3118. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3119. BEGIN
  3120. WHILE (len > 0) DO
  3121. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3122. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3123. IF rvalIm # 0.0D0 THEN
  3124. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3125. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3126. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3127. ELSE
  3128. dvalRe := lvalRe/rvalRe;
  3129. dvalIm := lvalIm/rvalRe;
  3130. END;
  3131. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3132. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3133. DEC( len );
  3134. END;
  3135. END EDivideALZALZLoop;
  3136. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3137. BEGIN
  3138. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3139. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3140. RETURN RESULT
  3141. END "./";
  3142. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3143. (** SHORTINT *)
  3144. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3145. VAR lval, rval: SHORTINT; dval: REAL;
  3146. BEGIN
  3147. SYSTEM.GET( radr, rval );
  3148. WHILE (len > 0) DO
  3149. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3150. INC( dadr, dinc ); DEC( len );
  3151. END;
  3152. END DivideASSSLoop;
  3153. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3154. BEGIN
  3155. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3156. DivideASSSLoop );
  3157. RETURN RESULT
  3158. END "/";
  3159. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3160. VAR lval, rval: SHORTINT; dval: REAL;
  3161. BEGIN
  3162. SYSTEM.GET( radr, rval );
  3163. WHILE (len > 0) DO
  3164. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3165. INC( dadr, dinc ); DEC( len );
  3166. END;
  3167. END DivideSSASLoop;
  3168. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3169. BEGIN
  3170. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3171. DivideSSASLoop );
  3172. RETURN RESULT
  3173. END "/";
  3174. (** INTEGER *)
  3175. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3176. VAR lval, rval: INTEGER; dval: REAL;
  3177. BEGIN
  3178. SYSTEM.GET( radr, rval );
  3179. WHILE (len > 0) DO
  3180. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3181. INC( dadr, dinc ); DEC( len );
  3182. END;
  3183. END DivideAISILoop;
  3184. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3185. BEGIN
  3186. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3187. DivideAISILoop );
  3188. RETURN RESULT
  3189. END "/";
  3190. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3191. VAR lval, rval: INTEGER; dval: REAL;
  3192. BEGIN
  3193. SYSTEM.GET( radr, rval );
  3194. WHILE (len > 0) DO
  3195. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3196. INC( dadr, dinc ); DEC( len );
  3197. END;
  3198. END DivideSIAILoop;
  3199. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3200. BEGIN
  3201. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3202. DivideSIAILoop );
  3203. RETURN RESULT
  3204. END "/";
  3205. (** LONGINT *)
  3206. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3207. VAR lval, rval: LONGINT; dval: REAL;
  3208. BEGIN
  3209. SYSTEM.GET( radr, rval );
  3210. WHILE (len > 0) DO
  3211. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3212. INC( dadr, dinc ); DEC( len );
  3213. END;
  3214. END DivideALSLLoop;
  3215. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3216. BEGIN
  3217. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3218. DivideALSLLoop );
  3219. RETURN RESULT
  3220. END "/";
  3221. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3222. VAR lval, rval: LONGINT; dval: REAL;
  3223. BEGIN
  3224. SYSTEM.GET( radr, rval );
  3225. WHILE (len > 0) DO
  3226. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3227. INC( dadr, dinc ); DEC( len );
  3228. END;
  3229. END DivideSLALLoop;
  3230. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3231. BEGIN
  3232. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3233. DivideSLALLoop );
  3234. RETURN RESULT
  3235. END "/";
  3236. (** REAL *)
  3237. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3238. VAR lval, rval: REAL; dval: REAL;
  3239. BEGIN
  3240. SYSTEM.GET( radr, rval );
  3241. WHILE (len > 0) DO
  3242. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3243. INC( dadr, dinc ); DEC( len );
  3244. END;
  3245. END DivideARSRLoop;
  3246. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3247. BEGIN
  3248. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3249. DivideARSRLoop );
  3250. RETURN RESULT
  3251. END "/";
  3252. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3253. VAR lval, rval: REAL; dval: REAL;
  3254. BEGIN
  3255. SYSTEM.GET( radr, rval );
  3256. WHILE (len > 0) DO
  3257. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3258. INC( dadr, dinc ); DEC( len );
  3259. END;
  3260. END DivideSRARLoop;
  3261. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3262. BEGIN
  3263. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3264. DivideSRARLoop );
  3265. RETURN RESULT
  3266. END "/";
  3267. (** LONGREAL *)
  3268. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3269. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3270. BEGIN
  3271. SYSTEM.GET( radr, rval );
  3272. WHILE (len > 0) DO
  3273. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3274. INC( dadr, dinc ); DEC( len );
  3275. END;
  3276. END DivideAXSXLoop;
  3277. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3278. BEGIN
  3279. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3280. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3281. RETURN RESULT
  3282. END "/";
  3283. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3284. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3285. BEGIN
  3286. SYSTEM.GET( radr, rval );
  3287. WHILE (len > 0) DO
  3288. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3289. INC( dadr, dinc ); DEC( len );
  3290. END;
  3291. END DivideSXAXLoop;
  3292. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3293. BEGIN
  3294. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3295. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3296. RETURN RESULT
  3297. END "/";
  3298. (** COMPLEX *)
  3299. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3300. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3301. BEGIN
  3302. SYSTEM.GET( radr, rval );
  3303. WHILE (len > 0) DO
  3304. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3305. INC( dadr, dinc ); DEC( len );
  3306. END;
  3307. END DivideAZSZLoop;
  3308. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3309. BEGIN
  3310. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3311. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3312. RETURN RESULT
  3313. END "/";
  3314. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3315. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3316. BEGIN
  3317. SYSTEM.GET( radr, rval );
  3318. WHILE (len > 0) DO
  3319. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3320. INC( dadr, dinc ); DEC( len );
  3321. END;
  3322. END DivideSZAZLoop;
  3323. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3324. BEGIN
  3325. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3326. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3327. RETURN RESULT
  3328. END "/";
  3329. (** LONGCOMPLEX *)
  3330. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3331. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3332. BEGIN
  3333. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3334. IF rvalIm # 0.0D0 THEN
  3335. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3336. WHILE (len > 0) DO
  3337. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3338. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3339. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3340. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3341. INC( ladr, linc );
  3342. INC( dadr, dinc ); DEC( len );
  3343. END;
  3344. ELSE
  3345. WHILE (len > 0) DO
  3346. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3347. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3348. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3349. INC( ladr, linc );
  3350. INC( dadr, dinc ); DEC( len );
  3351. END;
  3352. END;
  3353. END DivideALZSLZLoop;
  3354. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3355. BEGIN
  3356. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3357. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3358. RETURN RESULT
  3359. END "/";
  3360. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3361. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3362. BEGIN
  3363. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3364. WHILE (len > 0) DO
  3365. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3366. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3367. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3368. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3369. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3370. INC( ladr, linc );
  3371. INC( dadr, dinc ); DEC( len );
  3372. END;
  3373. END DivideSLZALZLoop;
  3374. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3375. BEGIN
  3376. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3377. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3378. RETURN RESULT
  3379. END "/";
  3380. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3381. (** SHORTINT *)
  3382. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3383. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3384. BEGIN
  3385. WHILE (len > 0) DO
  3386. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3387. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3388. DEC( len );
  3389. END;
  3390. END EDivASASLoop;
  3391. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3392. BEGIN
  3393. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3394. SIZEOF( SHORTINT ), EDivASASLoop );
  3395. RETURN RESULT
  3396. END "DIV";
  3397. (** INTEGER *)
  3398. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3399. VAR lval, rval: INTEGER; dval: INTEGER;
  3400. BEGIN
  3401. WHILE (len > 0) DO
  3402. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3403. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3404. DEC( len );
  3405. END;
  3406. END EDivAIAILoop;
  3407. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3408. BEGIN
  3409. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3410. SIZEOF( INTEGER ), EDivAIAILoop );
  3411. RETURN RESULT
  3412. END "DIV";
  3413. (** LONGINT *)
  3414. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3415. VAR lval, rval: LONGINT; dval: LONGINT;
  3416. BEGIN
  3417. WHILE (len > 0) DO
  3418. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3419. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3420. DEC( len );
  3421. END;
  3422. END EDivALALLoop;
  3423. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3424. BEGIN
  3425. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3426. SIZEOF( LONGINT ), EDivALALLoop );
  3427. RETURN RESULT
  3428. END "DIV";
  3429. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3430. (** SHORTINT *)
  3431. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3432. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3433. BEGIN
  3434. SYSTEM.GET( radr, rval );
  3435. WHILE (len > 0) DO
  3436. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3437. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3438. END;
  3439. END DivASSSLoop;
  3440. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3441. BEGIN
  3442. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3443. SIZEOF( SHORTINT ), DivASSSLoop );
  3444. RETURN RESULT
  3445. END "DIV";
  3446. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3447. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3448. BEGIN
  3449. SYSTEM.GET( radr, rval );
  3450. WHILE (len > 0) DO
  3451. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3452. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3453. END;
  3454. END DivSSASLoop;
  3455. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3456. BEGIN
  3457. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3458. SIZEOF( SHORTINT ), DivSSASLoop );
  3459. RETURN RESULT
  3460. END "DIV";
  3461. (** INTEGER *)
  3462. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3463. VAR lval, rval: INTEGER; dval: INTEGER;
  3464. BEGIN
  3465. SYSTEM.GET( radr, rval );
  3466. WHILE (len > 0) DO
  3467. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3468. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3469. END;
  3470. END DivAISILoop;
  3471. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3472. BEGIN
  3473. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3474. SIZEOF( INTEGER ), DivAISILoop );
  3475. RETURN RESULT
  3476. END "DIV";
  3477. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3478. VAR lval, rval: INTEGER; dval: INTEGER;
  3479. BEGIN
  3480. SYSTEM.GET( radr, rval );
  3481. WHILE (len > 0) DO
  3482. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3483. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3484. END;
  3485. END DivSIAILoop;
  3486. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3487. BEGIN
  3488. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3489. SIZEOF( INTEGER ), DivSIAILoop );
  3490. RETURN RESULT
  3491. END "DIV";
  3492. (** LONGINT *)
  3493. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3494. VAR lval, rval: LONGINT; dval: LONGINT;
  3495. BEGIN
  3496. SYSTEM.GET( radr, rval );
  3497. WHILE (len > 0) DO
  3498. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3499. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3500. END;
  3501. END DivALSLLoop;
  3502. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3503. BEGIN
  3504. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3505. SIZEOF( LONGINT ), DivALSLLoop );
  3506. RETURN RESULT
  3507. END "DIV";
  3508. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3509. VAR lval, rval: LONGINT; dval: LONGINT;
  3510. BEGIN
  3511. SYSTEM.GET( radr, rval );
  3512. WHILE (len > 0) DO
  3513. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3514. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3515. END;
  3516. END DivSLALLoop;
  3517. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3518. BEGIN
  3519. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3520. SIZEOF( LONGINT ), DivSLALLoop );
  3521. RETURN RESULT
  3522. END "DIV";
  3523. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3524. (** SHORTINT *)
  3525. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3526. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3527. BEGIN
  3528. WHILE (len > 0) DO
  3529. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3530. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3531. DEC( len );
  3532. END;
  3533. END EModASASLoop;
  3534. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3535. BEGIN
  3536. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3537. SIZEOF( SHORTINT ), EModASASLoop );
  3538. RETURN RESULT
  3539. END "MOD";
  3540. (** INTEGER *)
  3541. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3542. VAR lval, rval: INTEGER; dval: INTEGER;
  3543. BEGIN
  3544. WHILE (len > 0) DO
  3545. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3546. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3547. DEC( len );
  3548. END;
  3549. END EModAIAILoop;
  3550. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3551. BEGIN
  3552. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3553. SIZEOF( INTEGER ), EModAIAILoop );
  3554. RETURN RESULT
  3555. END "MOD";
  3556. (** LONGINT *)
  3557. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3558. VAR lval, rval: LONGINT; dval: LONGINT;
  3559. BEGIN
  3560. WHILE (len > 0) DO
  3561. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3562. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3563. DEC( len );
  3564. END;
  3565. END EModALALLoop;
  3566. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3567. BEGIN
  3568. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3569. SIZEOF( LONGINT ), EModALALLoop );
  3570. RETURN RESULT
  3571. END "MOD";
  3572. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3573. (** SHORTINT *)
  3574. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3575. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3576. BEGIN
  3577. SYSTEM.GET( radr, rval );
  3578. WHILE (len > 0) DO
  3579. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3580. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3581. END;
  3582. END ModASSSLoop;
  3583. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3584. BEGIN
  3585. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3586. SIZEOF( SHORTINT ), ModASSSLoop );
  3587. RETURN RESULT
  3588. END "MOD";
  3589. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3590. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3591. BEGIN
  3592. SYSTEM.GET( radr, rval );
  3593. WHILE (len > 0) DO
  3594. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3595. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3596. END;
  3597. END ModSSASLoop;
  3598. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3599. BEGIN
  3600. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3601. SIZEOF( SHORTINT ), ModSSASLoop );
  3602. RETURN RESULT
  3603. END "MOD";
  3604. (** INTEGER *)
  3605. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3606. VAR lval, rval: INTEGER; dval: INTEGER;
  3607. BEGIN
  3608. SYSTEM.GET( radr, rval );
  3609. WHILE (len > 0) DO
  3610. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3611. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3612. END;
  3613. END ModAISILoop;
  3614. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3615. BEGIN
  3616. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3617. SIZEOF( INTEGER ), ModAISILoop );
  3618. RETURN RESULT
  3619. END "MOD";
  3620. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3621. VAR lval, rval: INTEGER; dval: INTEGER;
  3622. BEGIN
  3623. SYSTEM.GET( radr, rval );
  3624. WHILE (len > 0) DO
  3625. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3626. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3627. END;
  3628. END ModSIAILoop;
  3629. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3630. BEGIN
  3631. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3632. SIZEOF( INTEGER ), ModSIAILoop );
  3633. RETURN RESULT
  3634. END "MOD";
  3635. (** LONGINT *)
  3636. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3637. VAR lval, rval: LONGINT; dval: LONGINT;
  3638. BEGIN
  3639. SYSTEM.GET( radr, rval );
  3640. WHILE (len > 0) DO
  3641. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3642. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3643. END;
  3644. END ModALSLLoop;
  3645. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3646. BEGIN
  3647. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3648. SIZEOF( LONGINT ), ModALSLLoop );
  3649. RETURN RESULT
  3650. END "MOD";
  3651. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3652. VAR lval, rval: LONGINT; dval: LONGINT;
  3653. BEGIN
  3654. SYSTEM.GET( radr, rval );
  3655. WHILE (len > 0) DO
  3656. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3657. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3658. END;
  3659. END ModSLALLoop;
  3660. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3661. BEGIN
  3662. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3663. SIZEOF( LONGINT ), ModSLALLoop );
  3664. RETURN RESULT
  3665. END "MOD";
  3666. (*** scalar product <array,array> -> scalar ********************************************************************)
  3667. (** SHORTINT *)
  3668. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3669. VAR lval, rval: SHORTINT; dval: LONGINT;
  3670. BEGIN
  3671. SYSTEM.GET( dadr, dval );
  3672. WHILE (len > 0) DO
  3673. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3674. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3675. END;
  3676. SYSTEM.PUT( dadr, dval );
  3677. END SPASASLoop;
  3678. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3679. VAR dest: LONGINT;
  3680. BEGIN
  3681. dest := 0;
  3682. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3683. RETURN dest;
  3684. END "+*";
  3685. (** INTEGER *)
  3686. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3687. VAR lval, rval: INTEGER; dval: LONGINT;
  3688. BEGIN
  3689. SYSTEM.GET( dadr, dval );
  3690. WHILE (len > 0) DO
  3691. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3692. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3693. END;
  3694. SYSTEM.PUT( dadr, dval );
  3695. END SPAIAILoop;
  3696. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3697. VAR dest: LONGINT;
  3698. BEGIN
  3699. dest := 0;
  3700. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3701. RETURN dest;
  3702. END "+*";
  3703. (** LONGINT *)
  3704. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3705. VAR lval, rval: LONGINT; dval: LONGINT;
  3706. BEGIN
  3707. SYSTEM.GET( dadr, dval );
  3708. WHILE (len > 0) DO
  3709. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3710. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3711. END;
  3712. SYSTEM.PUT( dadr, dval );
  3713. END SPALALLoop;
  3714. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3715. VAR dest: LONGINT;
  3716. BEGIN
  3717. dest := 0;
  3718. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3719. RETURN dest;
  3720. END "+*";
  3721. (** REAL *)
  3722. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3723. VAR lval, rval: REAL; dval: REAL;
  3724. BEGIN
  3725. SYSTEM.GET( dadr, dval );
  3726. WHILE (len > 0) DO
  3727. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3728. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3729. END;
  3730. SYSTEM.PUT( dadr, dval );
  3731. END SPARARLoop;
  3732. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3733. VAR dest: REAL;
  3734. BEGIN
  3735. dest := 0;
  3736. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3737. RETURN dest;
  3738. END "+*";
  3739. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3740. VAR lval, rval, dval: LONGREAL;
  3741. BEGIN
  3742. IF debug THEN
  3743. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3744. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3745. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3746. END;
  3747. SYSTEM.GET( dadr, dval );
  3748. WHILE (len > 0) DO
  3749. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3750. dval := dval + rval * lval; DEC( len );
  3751. END;
  3752. SYSTEM.PUT( dadr, dval );
  3753. END SPAXAXLoop;
  3754. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3755. VAR dest: LONGREAL;
  3756. BEGIN
  3757. dest := 0;
  3758. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3759. RETURN dest;
  3760. END "+*";
  3761. (** COMPLEX *)
  3762. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3763. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3764. BEGIN
  3765. SYSTEM.GET( dadr, dval );
  3766. WHILE (len > 0) DO
  3767. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3768. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3769. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3770. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3771. END;
  3772. SYSTEM.PUT( dadr, dval );
  3773. END SPAZAZLoop;
  3774. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3775. VAR dest: COMPLEX;
  3776. BEGIN
  3777. dest := 0;
  3778. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3779. RETURN dest;
  3780. END "+*";
  3781. (** COMPLEX *)
  3782. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3783. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3784. BEGIN
  3785. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3786. WHILE (len > 0) DO
  3787. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3788. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3789. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3790. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3791. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3792. END;
  3793. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3794. END SPALZALZLoop;
  3795. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3796. VAR dest: LONGCOMPLEX;
  3797. BEGIN
  3798. dest := 0;
  3799. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3800. RETURN dest;
  3801. END "+*";
  3802. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3803. (** BOOLEAN *)
  3804. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3805. VAR lval, rval: BOOLEAN;
  3806. BEGIN
  3807. WHILE (len > 0) DO
  3808. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3809. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3810. END;
  3811. END EEqlABABLoop;
  3812. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3813. BEGIN
  3814. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3815. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3816. RETURN RESULT
  3817. END ".=";
  3818. (** SHORTINT *)
  3819. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3820. VAR lval, rval: SHORTINT;
  3821. BEGIN
  3822. WHILE (len > 0) DO
  3823. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3824. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3825. END;
  3826. END EEqlASASLoop;
  3827. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3828. BEGIN
  3829. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3830. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3831. RETURN RESULT
  3832. END ".=";
  3833. (** INTEGER *)
  3834. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3835. VAR lval, rval: INTEGER;
  3836. BEGIN
  3837. WHILE (len > 0) DO
  3838. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3839. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3840. END;
  3841. END EEqlAIAILoop;
  3842. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3843. BEGIN
  3844. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3845. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3846. RETURN RESULT
  3847. END ".=";
  3848. (** LONGINT *)
  3849. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3850. VAR lval, rval: LONGINT;
  3851. BEGIN
  3852. WHILE (len > 0) DO
  3853. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3854. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3855. END;
  3856. END EEqlALALLoop;
  3857. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3858. BEGIN
  3859. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3860. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3861. RETURN RESULT
  3862. END ".=";
  3863. (** REAL *)
  3864. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3865. VAR lval, rval: REAL;
  3866. BEGIN
  3867. WHILE (len > 0) DO
  3868. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3869. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3870. END;
  3871. END EEqlARARLoop;
  3872. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3873. BEGIN
  3874. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3875. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3876. RETURN RESULT
  3877. END ".=";
  3878. (** LONGREAL *)
  3879. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3880. VAR lval, rval: LONGREAL;
  3881. BEGIN
  3882. WHILE (len > 0) DO
  3883. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3884. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3885. END;
  3886. END EEqlAXAXLoop;
  3887. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3888. BEGIN
  3889. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3890. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3891. RETURN RESULT
  3892. END ".=";
  3893. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3894. (** BOOLEAN *)
  3895. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3896. VAR lval, rval: BOOLEAN;
  3897. BEGIN
  3898. SYSTEM.GET( radr, rval );
  3899. WHILE (len > 0) DO
  3900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3901. INC( dadr, dinc ); DEC( len );
  3902. END;
  3903. END EEqlABSBLoop;
  3904. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3905. BEGIN
  3906. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3907. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3908. RETURN RESULT
  3909. END ".=";
  3910. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3911. BEGIN
  3912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3913. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3914. RETURN RESULT
  3915. END ".=";
  3916. (** SHORTINT *)
  3917. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3918. VAR lval, rval: SHORTINT;
  3919. BEGIN
  3920. SYSTEM.GET( radr, rval );
  3921. WHILE (len > 0) DO
  3922. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3923. INC( dadr, dinc ); DEC( len );
  3924. END;
  3925. END EEqlASSSLoop;
  3926. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3927. BEGIN
  3928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3929. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3930. RETURN RESULT
  3931. END ".=";
  3932. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3933. BEGIN
  3934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3935. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3936. RETURN RESULT
  3937. END ".=";
  3938. (** INTEGER *)
  3939. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3940. VAR lval, rval: INTEGER;
  3941. BEGIN
  3942. SYSTEM.GET( radr, rval );
  3943. WHILE (len > 0) DO
  3944. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3945. INC( dadr, dinc ); DEC( len );
  3946. END;
  3947. END EEqlAISILoop;
  3948. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3949. BEGIN
  3950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3951. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3952. RETURN RESULT
  3953. END ".=";
  3954. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3955. BEGIN
  3956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3957. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3958. RETURN RESULT
  3959. END ".=";
  3960. (** LONGINT *)
  3961. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3962. VAR lval, rval: LONGINT;
  3963. BEGIN
  3964. SYSTEM.GET( radr, rval );
  3965. WHILE (len > 0) DO
  3966. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3967. INC( dadr, dinc ); DEC( len );
  3968. END;
  3969. END EEqlALSLLoop;
  3970. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3971. BEGIN
  3972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3973. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3974. RETURN RESULT
  3975. END ".=";
  3976. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  3977. BEGIN
  3978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3979. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3980. RETURN RESULT
  3981. END ".=";
  3982. (** REAL *)
  3983. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3984. VAR lval, rval: REAL;
  3985. BEGIN
  3986. SYSTEM.GET( radr, rval );
  3987. WHILE (len > 0) DO
  3988. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3989. INC( dadr, dinc ); DEC( len );
  3990. END;
  3991. END EEqlARSRLoop;
  3992. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  3993. BEGIN
  3994. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3995. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  3996. RETURN RESULT
  3997. END ".=";
  3998. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  3999. BEGIN
  4000. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4001. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4002. RETURN RESULT
  4003. END ".=";
  4004. (** LONGREAL *)
  4005. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4006. VAR lval, rval: LONGREAL;
  4007. BEGIN
  4008. SYSTEM.GET( radr, rval );
  4009. WHILE (len > 0) DO
  4010. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4011. INC( dadr, dinc ); DEC( len );
  4012. END;
  4013. END EEqlAXSXLoop;
  4014. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4015. BEGIN
  4016. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4017. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4018. RETURN RESULT
  4019. END ".=";
  4020. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4021. BEGIN
  4022. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4023. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4024. RETURN RESULT
  4025. END ".=";
  4026. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4027. (** BOOLEAN *)
  4028. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4029. VAR lval, rval: BOOLEAN;
  4030. BEGIN
  4031. WHILE (len > 0) DO
  4032. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4033. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4034. END;
  4035. END ENeqABABLoop;
  4036. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4037. BEGIN
  4038. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4039. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4040. RETURN RESULT
  4041. END ".#";
  4042. (** SHORTINT *)
  4043. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4044. VAR lval, rval: SHORTINT;
  4045. BEGIN
  4046. WHILE (len > 0) DO
  4047. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4048. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4049. END;
  4050. END ENeqASASLoop;
  4051. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4052. BEGIN
  4053. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4054. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4055. RETURN RESULT
  4056. END ".#";
  4057. (** INTEGER*)
  4058. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4059. VAR lval, rval: INTEGER;
  4060. BEGIN
  4061. WHILE (len > 0) DO
  4062. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4063. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4064. END;
  4065. END ENeqAIAILoop;
  4066. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4067. BEGIN
  4068. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4069. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4070. RETURN RESULT
  4071. END ".#";
  4072. (** LONGINT*)
  4073. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4074. VAR lval, rval: LONGINT;
  4075. BEGIN
  4076. WHILE (len > 0) DO
  4077. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4078. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4079. END;
  4080. END ENeqALALLoop;
  4081. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4082. BEGIN
  4083. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4084. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4085. RETURN RESULT
  4086. END ".#";
  4087. (** REAL *)
  4088. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4089. VAR lval, rval: REAL;
  4090. BEGIN
  4091. WHILE (len > 0) DO
  4092. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4093. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4094. END;
  4095. END ENeqARARLoop;
  4096. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4097. BEGIN
  4098. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4099. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4100. RETURN RESULT
  4101. END ".#";
  4102. (** LONGREAL *)
  4103. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4104. VAR lval, rval: LONGREAL;
  4105. BEGIN
  4106. WHILE (len > 0) DO
  4107. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4108. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4109. END;
  4110. END ENeqAXAXLoop;
  4111. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4112. BEGIN
  4113. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4114. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4115. RETURN RESULT
  4116. END ".#";
  4117. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4118. (** BOOLEAN *)
  4119. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4120. VAR lval, rval: BOOLEAN;
  4121. BEGIN
  4122. SYSTEM.GET( radr, rval );
  4123. WHILE (len > 0) DO
  4124. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4125. INC( dadr, dinc ); DEC( len );
  4126. END;
  4127. END ENeqABSBLoop;
  4128. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4129. BEGIN
  4130. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4131. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4132. RETURN RESULT
  4133. END ".#";
  4134. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4135. BEGIN
  4136. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4137. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4138. RETURN RESULT
  4139. END ".#";
  4140. (** SHORTINT *)
  4141. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4142. VAR lval, rval: SHORTINT;
  4143. BEGIN
  4144. SYSTEM.GET( radr, rval );
  4145. WHILE (len > 0) DO
  4146. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4147. INC( dadr, dinc ); DEC( len );
  4148. END;
  4149. END ENeqASSSLoop;
  4150. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4151. BEGIN
  4152. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4153. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4154. RETURN RESULT
  4155. END ".#";
  4156. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4157. BEGIN
  4158. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4159. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4160. RETURN RESULT
  4161. END ".#";
  4162. (** INTEGER *)
  4163. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4164. VAR lval, rval: INTEGER;
  4165. BEGIN
  4166. SYSTEM.GET( radr, rval );
  4167. WHILE (len > 0) DO
  4168. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4169. INC( dadr, dinc ); DEC( len );
  4170. END;
  4171. END ENeqAISILoop;
  4172. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4173. BEGIN
  4174. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4175. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4176. RETURN RESULT
  4177. END ".#";
  4178. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4179. BEGIN
  4180. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4181. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4182. RETURN RESULT
  4183. END ".#";
  4184. (** LONGINT *)
  4185. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4186. VAR lval, rval: LONGINT;
  4187. BEGIN
  4188. SYSTEM.GET( radr, rval );
  4189. WHILE (len > 0) DO
  4190. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4191. INC( dadr, dinc ); DEC( len );
  4192. END;
  4193. END ENeqALSLLoop;
  4194. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4195. BEGIN
  4196. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4197. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4198. RETURN RESULT
  4199. END ".#";
  4200. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4201. BEGIN
  4202. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4203. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4204. RETURN RESULT
  4205. END ".#";
  4206. (** REAL *)
  4207. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4208. VAR lval, rval: REAL;
  4209. BEGIN
  4210. SYSTEM.GET( radr, rval );
  4211. WHILE (len > 0) DO
  4212. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4213. INC( dadr, dinc ); DEC( len );
  4214. END;
  4215. END ENeqARSRLoop;
  4216. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4217. BEGIN
  4218. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4219. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4220. RETURN RESULT
  4221. END ".#";
  4222. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4223. BEGIN
  4224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4225. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4226. RETURN RESULT
  4227. END ".#";
  4228. (** LONGREAL *)
  4229. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4230. VAR lval, rval: LONGREAL;
  4231. BEGIN
  4232. SYSTEM.GET( radr, rval );
  4233. WHILE (len > 0) DO
  4234. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4235. INC( dadr, dinc ); DEC( len );
  4236. END;
  4237. END ENeqAXSXLoop;
  4238. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4239. BEGIN
  4240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4241. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4242. RETURN RESULT
  4243. END ".#";
  4244. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4245. BEGIN
  4246. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4247. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4248. RETURN RESULT
  4249. END ".#";
  4250. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4251. (** SHORTINT *)
  4252. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4253. VAR lval, rval: SHORTINT;
  4254. BEGIN
  4255. WHILE (len > 0) DO
  4256. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4257. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4258. END;
  4259. END EGtrASASLoop;
  4260. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4261. BEGIN
  4262. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4263. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4264. RETURN RESULT
  4265. END ".>";
  4266. (** INTEGER *)
  4267. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4268. VAR lval, rval: INTEGER;
  4269. BEGIN
  4270. WHILE (len > 0) DO
  4271. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4272. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4273. END;
  4274. END EGtrAIAILoop;
  4275. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4276. BEGIN
  4277. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4278. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4279. RETURN RESULT
  4280. END ".>";
  4281. (** LONGINT *)
  4282. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4283. VAR lval, rval: LONGINT;
  4284. BEGIN
  4285. WHILE (len > 0) DO
  4286. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4287. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4288. END;
  4289. END EGtrALALLoop;
  4290. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4291. BEGIN
  4292. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4293. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4294. RETURN RESULT
  4295. END ".>";
  4296. (** REAL *)
  4297. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4298. VAR lval, rval: REAL;
  4299. BEGIN
  4300. WHILE (len > 0) DO
  4301. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4302. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4303. END;
  4304. END EGtrARARLoop;
  4305. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4306. BEGIN
  4307. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4308. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4309. RETURN RESULT
  4310. END ".>";
  4311. (** LONGREAL *)
  4312. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4313. VAR lval, rval: LONGREAL;
  4314. BEGIN
  4315. WHILE (len > 0) DO
  4316. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4317. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4318. END;
  4319. END EGtrAXAXLoop;
  4320. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4321. BEGIN
  4322. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4323. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4324. RETURN RESULT
  4325. END ".>";
  4326. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4327. (** SHORTINT *)
  4328. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4329. VAR lval, rval: SHORTINT;
  4330. BEGIN
  4331. SYSTEM.GET( radr, rval );
  4332. WHILE (len > 0) DO
  4333. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4334. INC( dadr, dinc ); DEC( len );
  4335. END;
  4336. END EGtrASSSLoop;
  4337. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4338. BEGIN
  4339. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4340. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4341. RETURN RESULT
  4342. END ".>";
  4343. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4344. BEGIN
  4345. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4346. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4347. RETURN RESULT
  4348. END ".<";
  4349. (** INTEGER *)
  4350. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4351. VAR lval, rval: INTEGER;
  4352. BEGIN
  4353. SYSTEM.GET( radr, rval );
  4354. WHILE (len > 0) DO
  4355. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4356. INC( dadr, dinc ); DEC( len );
  4357. END;
  4358. END EGtrAISILoop;
  4359. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4360. BEGIN
  4361. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4362. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4363. RETURN RESULT
  4364. END ".>";
  4365. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4366. BEGIN
  4367. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4368. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4369. RETURN RESULT
  4370. END ".<";
  4371. (** LONGINT *)
  4372. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4373. VAR lval, rval: LONGINT;
  4374. BEGIN
  4375. SYSTEM.GET( radr, rval );
  4376. WHILE (len > 0) DO
  4377. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4378. INC( dadr, dinc ); DEC( len );
  4379. END;
  4380. END EGtrALSLLoop;
  4381. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4382. BEGIN
  4383. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4384. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4385. RETURN RESULT
  4386. END ".>";
  4387. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4388. BEGIN
  4389. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4390. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4391. RETURN RESULT
  4392. END ".<";
  4393. (** REAL *)
  4394. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4395. VAR lval, rval: REAL;
  4396. BEGIN
  4397. SYSTEM.GET( radr, rval );
  4398. WHILE (len > 0) DO
  4399. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4400. INC( dadr, dinc ); DEC( len );
  4401. END;
  4402. END EGtrARSRLoop;
  4403. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4404. BEGIN
  4405. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4406. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4407. RETURN RESULT
  4408. END ".>";
  4409. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4410. BEGIN
  4411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4412. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4413. RETURN RESULT
  4414. END ".<";
  4415. (** LONGREAL *)
  4416. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4417. VAR lval, rval: LONGREAL;
  4418. BEGIN
  4419. SYSTEM.GET( radr, rval );
  4420. WHILE (len > 0) DO
  4421. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4422. INC( dadr, dinc ); DEC( len );
  4423. END;
  4424. END EGtrAXSXLoop;
  4425. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4426. BEGIN
  4427. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4428. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4429. RETURN RESULT
  4430. END ".>";
  4431. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4432. BEGIN
  4433. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4434. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4435. RETURN RESULT
  4436. END ".<";
  4437. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4438. (** SHORTINT *)
  4439. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4440. VAR lval, rval: SHORTINT;
  4441. BEGIN
  4442. WHILE (len > 0) DO
  4443. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4444. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4445. END;
  4446. END EGeqASASLoop;
  4447. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4448. BEGIN
  4449. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4450. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4451. RETURN RESULT
  4452. END ".>=";
  4453. (** INTEGER *)
  4454. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4455. VAR lval, rval: INTEGER;
  4456. BEGIN
  4457. WHILE (len > 0) DO
  4458. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4459. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4460. END;
  4461. END EGeqAIAILoop;
  4462. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4463. BEGIN
  4464. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4465. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4466. RETURN RESULT
  4467. END ".>=";
  4468. (** LONGINT *)
  4469. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4470. VAR lval, rval: LONGINT;
  4471. BEGIN
  4472. WHILE (len > 0) DO
  4473. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4474. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4475. END;
  4476. END EGeqALALLoop;
  4477. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4478. BEGIN
  4479. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4480. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4481. RETURN RESULT
  4482. END ".>=";
  4483. (** REAL *)
  4484. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4485. VAR lval, rval: REAL;
  4486. BEGIN
  4487. WHILE (len > 0) DO
  4488. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4489. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4490. END;
  4491. END EGeqARARLoop;
  4492. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4493. BEGIN
  4494. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4495. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4496. RETURN RESULT
  4497. END ".>=";
  4498. (** LONGREAL *)
  4499. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4500. VAR lval, rval: LONGREAL;
  4501. BEGIN
  4502. WHILE (len > 0) DO
  4503. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4504. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4505. END;
  4506. END EGeqAXAXLoop;
  4507. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4508. BEGIN
  4509. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4510. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4511. RETURN RESULT
  4512. END ".>=";
  4513. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4514. (** SHORTINT *)
  4515. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4516. VAR lval, rval: SHORTINT;
  4517. BEGIN
  4518. SYSTEM.GET( radr, rval );
  4519. WHILE (len > 0) DO
  4520. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4521. INC( dadr, dinc ); DEC( len );
  4522. END;
  4523. END EGeqASSSLoop;
  4524. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4525. BEGIN
  4526. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4527. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4528. RETURN RESULT
  4529. END ".>=";
  4530. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4531. BEGIN
  4532. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4533. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4534. RETURN RESULT
  4535. END ".<=";
  4536. (** INTEGER *)
  4537. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4538. VAR lval, rval: INTEGER;
  4539. BEGIN
  4540. SYSTEM.GET( radr, rval );
  4541. WHILE (len > 0) DO
  4542. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4543. INC( dadr, dinc ); DEC( len );
  4544. END;
  4545. END EGeqAISILoop;
  4546. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4547. BEGIN
  4548. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4549. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4550. RETURN RESULT
  4551. END ".>=";
  4552. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4553. BEGIN
  4554. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4555. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4556. RETURN RESULT
  4557. END ".<=";
  4558. (** LONGINT *)
  4559. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4560. VAR lval, rval: LONGINT;
  4561. BEGIN
  4562. SYSTEM.GET( radr, rval );
  4563. WHILE (len > 0) DO
  4564. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4565. INC( dadr, dinc ); DEC( len );
  4566. END;
  4567. END EGeqALSLLoop;
  4568. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4569. BEGIN
  4570. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4571. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4572. RETURN RESULT
  4573. END ".>=";
  4574. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4575. BEGIN
  4576. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4577. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4578. RETURN RESULT
  4579. END ".<=";
  4580. (** REAL *)
  4581. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4582. VAR lval, rval: REAL;
  4583. BEGIN
  4584. SYSTEM.GET( radr, rval );
  4585. WHILE (len > 0) DO
  4586. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4587. INC( dadr, dinc ); DEC( len );
  4588. END;
  4589. END EGeqARSRLoop;
  4590. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4591. BEGIN
  4592. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4593. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4594. RETURN RESULT
  4595. END ".>=";
  4596. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4597. BEGIN
  4598. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4599. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4600. RETURN RESULT
  4601. END ".<=";
  4602. (** LONGREAL *)
  4603. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4604. VAR lval, rval: LONGREAL;
  4605. BEGIN
  4606. SYSTEM.GET( radr, rval );
  4607. WHILE (len > 0) DO
  4608. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4609. INC( dadr, dinc ); DEC( len );
  4610. END;
  4611. END EGeqAXSXLoop;
  4612. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4613. BEGIN
  4614. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4615. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4616. RETURN RESULT
  4617. END ".>=";
  4618. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4619. BEGIN
  4620. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4621. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4622. RETURN RESULT
  4623. END ".<=";
  4624. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4625. (** SHORTINT *)
  4626. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4627. VAR lval, rval: SHORTINT;
  4628. BEGIN
  4629. WHILE (len > 0) DO
  4630. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4631. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4632. END;
  4633. END ELssASASLoop;
  4634. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4635. BEGIN
  4636. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4637. SIZEOF( BOOLEAN ), ELssASASLoop );
  4638. RETURN RESULT
  4639. END ".<";
  4640. (** INTEGER *)
  4641. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4642. VAR lval, rval: INTEGER;
  4643. BEGIN
  4644. WHILE (len > 0) DO
  4645. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4646. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4647. END;
  4648. END ELssAIAILoop;
  4649. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4650. BEGIN
  4651. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4652. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4653. RETURN RESULT
  4654. END ".<";
  4655. (** LONGINT*)
  4656. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4657. VAR lval, rval: LONGINT;
  4658. BEGIN
  4659. WHILE (len > 0) DO
  4660. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4661. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4662. END;
  4663. END ELssALALLoop;
  4664. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4665. BEGIN
  4666. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4667. SIZEOF( BOOLEAN ), ELssALALLoop );
  4668. RETURN RESULT
  4669. END ".<";
  4670. (** REAL *)
  4671. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4672. VAR lval, rval: REAL;
  4673. BEGIN
  4674. WHILE (len > 0) DO
  4675. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4676. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4677. END;
  4678. END ELssARARLoop;
  4679. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4680. BEGIN
  4681. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4682. SIZEOF( BOOLEAN ), ELssARARLoop );
  4683. RETURN RESULT
  4684. END ".<";
  4685. (** LONGREAL *)
  4686. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4687. VAR lval, rval: LONGREAL;
  4688. BEGIN
  4689. WHILE (len > 0) DO
  4690. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4691. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4692. END;
  4693. END ELssAXAXLoop;
  4694. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4695. BEGIN
  4696. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4697. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4698. RETURN RESULT
  4699. END ".<";
  4700. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4701. (** SHORTINT *)
  4702. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4703. VAR lval, rval: SHORTINT;
  4704. BEGIN
  4705. SYSTEM.GET( radr, rval );
  4706. WHILE (len > 0) DO
  4707. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4708. INC( dadr, dinc ); DEC( len );
  4709. END;
  4710. END ELssASSSLoop;
  4711. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4712. BEGIN
  4713. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4714. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4715. RETURN RESULT
  4716. END ".<";
  4717. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4718. BEGIN
  4719. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4720. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4721. RETURN RESULT
  4722. END ".>";
  4723. (** INTEGER *)
  4724. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4725. VAR lval, rval: INTEGER;
  4726. BEGIN
  4727. SYSTEM.GET( radr, rval );
  4728. WHILE (len > 0) DO
  4729. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4730. INC( dadr, dinc ); DEC( len );
  4731. END;
  4732. END ELssAISILoop;
  4733. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4734. BEGIN
  4735. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4736. SIZEOF( BOOLEAN ), ELssAISILoop );
  4737. RETURN RESULT
  4738. END ".<";
  4739. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4740. BEGIN
  4741. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4742. SIZEOF( BOOLEAN ), ELssAISILoop );
  4743. RETURN RESULT
  4744. END ".>";
  4745. (** LONGINT *)
  4746. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4747. VAR lval, rval: LONGINT;
  4748. BEGIN
  4749. SYSTEM.GET( radr, rval );
  4750. WHILE (len > 0) DO
  4751. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4752. INC( dadr, dinc ); DEC( len );
  4753. END;
  4754. END ELssALSLLoop;
  4755. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4756. BEGIN
  4757. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4758. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4759. RETURN RESULT
  4760. END ".<";
  4761. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4762. BEGIN
  4763. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4764. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4765. RETURN RESULT
  4766. END ".>";
  4767. (** REAL *)
  4768. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4769. VAR lval, rval: REAL;
  4770. BEGIN
  4771. SYSTEM.GET( radr, rval );
  4772. WHILE (len > 0) DO
  4773. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4774. INC( dadr, dinc ); DEC( len );
  4775. END;
  4776. END ELssARSRLoop;
  4777. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4778. BEGIN
  4779. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4780. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4781. RETURN RESULT
  4782. END ".<";
  4783. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4784. BEGIN
  4785. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4786. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4787. RETURN RESULT
  4788. END ".>";
  4789. (** LONGREAL *)
  4790. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4791. VAR lval, rval: LONGREAL;
  4792. BEGIN
  4793. SYSTEM.GET( radr, rval );
  4794. WHILE (len > 0) DO
  4795. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4796. INC( dadr, dinc ); DEC( len );
  4797. END;
  4798. END ELssAXSXLoop;
  4799. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4800. BEGIN
  4801. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4802. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4803. RETURN RESULT
  4804. END ".<";
  4805. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4806. BEGIN
  4807. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4808. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4809. RETURN RESULT
  4810. END ".>";
  4811. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4812. (** SHORTINT *)
  4813. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4814. VAR lval, rval: SHORTINT;
  4815. BEGIN
  4816. WHILE (len > 0) DO
  4817. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4818. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4819. END;
  4820. END ELeqASASLoop;
  4821. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4822. BEGIN
  4823. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4824. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4825. RETURN RESULT
  4826. END ".<=";
  4827. (** INTEGER *)
  4828. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4829. VAR lval, rval: INTEGER;
  4830. BEGIN
  4831. WHILE (len > 0) DO
  4832. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4833. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4834. END;
  4835. END ELeqAIAILoop;
  4836. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4837. BEGIN
  4838. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4839. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4840. RETURN RESULT
  4841. END ".<=";
  4842. (** LONGINT *)
  4843. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4844. VAR lval, rval: LONGINT;
  4845. BEGIN
  4846. WHILE (len > 0) DO
  4847. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4848. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4849. END;
  4850. END ELeqALALLoop;
  4851. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4852. BEGIN
  4853. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4854. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4855. RETURN RESULT
  4856. END ".<=";
  4857. (** REAL *)
  4858. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4859. VAR lval, rval: REAL;
  4860. BEGIN
  4861. WHILE (len > 0) DO
  4862. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4863. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4864. END;
  4865. END ELeqARARLoop;
  4866. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4867. BEGIN
  4868. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4869. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4870. RETURN RESULT
  4871. END ".<=";
  4872. (** LONGREAL*)
  4873. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4874. VAR lval, rval: LONGREAL;
  4875. BEGIN
  4876. WHILE (len > 0) DO
  4877. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4878. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4879. END;
  4880. END ELeqAXAXLoop;
  4881. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4882. BEGIN
  4883. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4884. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4885. RETURN RESULT
  4886. END ".<=";
  4887. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4888. (** SHORTINT *)
  4889. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4890. VAR lval, rval: SHORTINT;
  4891. BEGIN
  4892. SYSTEM.GET( radr, rval );
  4893. WHILE (len > 0) DO
  4894. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4895. INC( dadr, dinc ); DEC( len );
  4896. END;
  4897. END ELeqASSSLoop;
  4898. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4899. BEGIN
  4900. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4901. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4902. RETURN RESULT
  4903. END ".<=";
  4904. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4905. BEGIN
  4906. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4907. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4908. RETURN RESULT
  4909. END ".>=";
  4910. (** INTEGER *)
  4911. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4912. VAR lval, rval: INTEGER;
  4913. BEGIN
  4914. SYSTEM.GET( radr, rval );
  4915. WHILE (len > 0) DO
  4916. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4917. INC( dadr, dinc ); DEC( len );
  4918. END;
  4919. END ELeqAISILoop;
  4920. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4921. BEGIN
  4922. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4923. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4924. RETURN RESULT
  4925. END ".<=";
  4926. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4927. BEGIN
  4928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4929. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4930. RETURN RESULT
  4931. END ".>=";
  4932. (** LONGINT *)
  4933. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4934. VAR lval, rval: LONGINT;
  4935. BEGIN
  4936. SYSTEM.GET( radr, rval );
  4937. WHILE (len > 0) DO
  4938. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4939. INC( dadr, dinc ); DEC( len );
  4940. END;
  4941. END ELeqALSLLoop;
  4942. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4943. BEGIN
  4944. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4945. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4946. RETURN RESULT
  4947. END ".<=";
  4948. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4949. BEGIN
  4950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4951. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4952. RETURN RESULT
  4953. END ".>=";
  4954. (** REAL *)
  4955. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4956. VAR lval, rval: REAL;
  4957. BEGIN
  4958. SYSTEM.GET( radr, rval );
  4959. WHILE (len > 0) DO
  4960. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4961. INC( dadr, dinc ); DEC( len );
  4962. END;
  4963. END ELeqARSRLoop;
  4964. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4965. BEGIN
  4966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4967. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4968. RETURN RESULT
  4969. END ".<=";
  4970. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4971. BEGIN
  4972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4973. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4974. RETURN RESULT
  4975. END ".>=";
  4976. (** LONGREAL *)
  4977. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4978. VAR lval, rval: LONGREAL;
  4979. BEGIN
  4980. SYSTEM.GET( radr, rval );
  4981. WHILE (len > 0) DO
  4982. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4983. INC( dadr, dinc ); DEC( len );
  4984. END;
  4985. END ELeqAXSXLoop;
  4986. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4987. BEGIN
  4988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4989. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  4990. RETURN RESULT
  4991. END ".<=";
  4992. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4993. BEGIN
  4994. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4995. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  4996. RETURN RESULT
  4997. END ".>=";
  4998. (*** elementwise or, elementwise and ********************************************************************)
  4999. (** array x array *)
  5000. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5001. VAR lval, rval: BOOLEAN;
  5002. BEGIN
  5003. WHILE (len > 0) DO
  5004. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5005. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5006. END;
  5007. END ElOrABABLoop;
  5008. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5009. BEGIN
  5010. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5011. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5012. RETURN RESULT
  5013. END "OR";
  5014. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5015. VAR lval, rval: BOOLEAN;
  5016. BEGIN
  5017. WHILE (len > 0) DO
  5018. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5019. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5020. END;
  5021. END ElAndABABLoop;
  5022. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5023. BEGIN
  5024. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5025. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5026. RETURN RESULT
  5027. END "&";
  5028. (** array x boolean *)
  5029. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5030. VAR lval, rval: BOOLEAN;
  5031. BEGIN
  5032. SYSTEM.GET( radr, rval );
  5033. WHILE (len > 0) DO
  5034. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5035. INC( dadr, dinc ); DEC( len );
  5036. END;
  5037. END ElOrABSBLoop;
  5038. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5039. BEGIN
  5040. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5041. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5042. RETURN RESULT
  5043. END "OR";
  5044. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5045. BEGIN
  5046. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5047. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5048. RETURN RESULT
  5049. END "OR";
  5050. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5051. VAR lval, rval: BOOLEAN;
  5052. BEGIN
  5053. SYSTEM.GET( radr, rval );
  5054. WHILE (len > 0) DO
  5055. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5056. INC( dadr, dinc ); DEC( len );
  5057. END;
  5058. END ElAndABSBLoop;
  5059. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5060. BEGIN
  5061. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5062. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5063. RETURN RESULT
  5064. END "&";
  5065. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5066. BEGIN
  5067. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5068. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5069. RETURN RESULT
  5070. END "&";
  5071. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5072. (** SHORTINT *)
  5073. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5074. VAR lval, rval: SHORTINT;
  5075. BEGIN
  5076. WHILE (len > 0) DO
  5077. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5078. IF rval <= lval THEN RETURN FALSE END;
  5079. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5080. END;
  5081. RETURN TRUE;
  5082. END LssASASLoop;
  5083. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5084. BEGIN
  5085. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5086. END "<";
  5087. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5088. VAR lval, rval: SHORTINT;
  5089. BEGIN
  5090. WHILE (len > 0) DO
  5091. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5092. IF rval > lval THEN RETURN FALSE END;
  5093. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5094. END;
  5095. RETURN TRUE;
  5096. END GeqASASLoop;
  5097. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5098. BEGIN
  5099. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5100. END ">=";
  5101. (** INTEGER *)
  5102. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5103. VAR lval, rval: INTEGER;
  5104. BEGIN
  5105. WHILE (len > 0) DO
  5106. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5107. IF rval <= lval THEN RETURN FALSE END;
  5108. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5109. END;
  5110. RETURN TRUE;
  5111. END LssAIAILoop;
  5112. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5113. BEGIN
  5114. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5115. END "<";
  5116. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5117. VAR lval, rval: INTEGER;
  5118. BEGIN
  5119. WHILE (len > 0) DO
  5120. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5121. IF rval > lval THEN RETURN FALSE END;
  5122. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5123. END;
  5124. RETURN TRUE;
  5125. END GeqAIAILoop;
  5126. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5127. BEGIN
  5128. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5129. END ">=";
  5130. (** LONGINT *)
  5131. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5132. VAR lval, rval: LONGINT;
  5133. BEGIN
  5134. WHILE (len > 0) DO
  5135. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5136. IF rval <= lval THEN RETURN FALSE END;
  5137. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5138. END;
  5139. RETURN TRUE;
  5140. END LssALALLoop;
  5141. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5142. BEGIN
  5143. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5144. END "<";
  5145. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5146. VAR lval, rval: LONGINT;
  5147. BEGIN
  5148. WHILE (len > 0) DO
  5149. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5150. IF rval > lval THEN RETURN FALSE END;
  5151. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5152. END;
  5153. RETURN TRUE;
  5154. END GeqALALLoop;
  5155. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5156. BEGIN
  5157. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5158. END ">=";
  5159. (** REAL *)
  5160. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5161. VAR lval, rval: REAL;
  5162. BEGIN
  5163. WHILE (len > 0) DO
  5164. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5165. IF rval <= lval THEN RETURN FALSE END;
  5166. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5167. END;
  5168. RETURN TRUE;
  5169. END LssARARLoop;
  5170. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5171. BEGIN
  5172. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5173. END "<";
  5174. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5175. VAR lval, rval: REAL;
  5176. BEGIN
  5177. WHILE (len > 0) DO
  5178. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5179. IF rval > lval THEN RETURN FALSE END;
  5180. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5181. END;
  5182. RETURN TRUE;
  5183. END GeqARARLoop;
  5184. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5185. BEGIN
  5186. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5187. END ">=";
  5188. (** LONGREAL *)
  5189. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5190. VAR lval, rval: LONGREAL;
  5191. BEGIN
  5192. WHILE (len > 0) DO
  5193. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5194. IF rval <= lval THEN RETURN FALSE END;
  5195. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5196. END;
  5197. RETURN TRUE;
  5198. END LssAXAXLoop;
  5199. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5200. BEGIN
  5201. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5202. END "<";
  5203. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5204. VAR lval, rval: LONGREAL;
  5205. BEGIN
  5206. WHILE (len > 0) DO
  5207. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5208. IF rval > lval THEN RETURN FALSE END;
  5209. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5210. END;
  5211. RETURN TRUE;
  5212. END GeqAXAXLoop;
  5213. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5214. BEGIN
  5215. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5216. END ">=";
  5217. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5218. (** SHORTINT *)
  5219. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5220. VAR lval, rval: SHORTINT;
  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 GtrASASLoop;
  5229. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5230. BEGIN
  5231. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5232. END ">";
  5233. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5234. VAR lval, rval: SHORTINT;
  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 LeqASASLoop;
  5243. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5244. BEGIN
  5245. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5246. END "<=";
  5247. (** INTEGER *)
  5248. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5249. VAR lval, rval: INTEGER;
  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 GtrAIAILoop;
  5258. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5259. BEGIN
  5260. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5261. END ">";
  5262. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5263. VAR lval, rval: INTEGER;
  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 LeqAIAILoop;
  5272. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5273. BEGIN
  5274. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5275. END "<=";
  5276. (** LONGINT *)
  5277. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5278. VAR lval, rval: LONGINT;
  5279. BEGIN
  5280. WHILE (len > 0) DO
  5281. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5282. IF rval >= lval THEN RETURN FALSE END;
  5283. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5284. END;
  5285. RETURN TRUE;
  5286. END GtrALALLoop;
  5287. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5288. BEGIN
  5289. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5290. END ">";
  5291. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5292. VAR lval, rval: LONGINT;
  5293. BEGIN
  5294. WHILE (len > 0) DO
  5295. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5296. IF rval < lval THEN RETURN FALSE END;
  5297. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5298. END;
  5299. RETURN TRUE;
  5300. END LeqALALLoop;
  5301. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5302. BEGIN
  5303. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5304. END "<=";
  5305. (** REAL *)
  5306. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5307. VAR lval, rval: REAL;
  5308. BEGIN
  5309. WHILE (len > 0) DO
  5310. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5311. IF rval >= lval THEN RETURN FALSE END;
  5312. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5313. END;
  5314. RETURN TRUE;
  5315. END GtrARARLoop;
  5316. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5317. BEGIN
  5318. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5319. END ">";
  5320. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5321. VAR lval, rval: REAL;
  5322. BEGIN
  5323. WHILE (len > 0) DO
  5324. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5325. IF rval < lval THEN RETURN FALSE END;
  5326. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5327. END;
  5328. RETURN TRUE;
  5329. END LeqARARLoop;
  5330. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5331. BEGIN
  5332. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5333. END "<=";
  5334. (** LONGREAL *)
  5335. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5336. VAR lval, rval: LONGREAL;
  5337. BEGIN
  5338. WHILE (len > 0) DO
  5339. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5340. IF rval >= lval THEN RETURN FALSE END;
  5341. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5342. END;
  5343. RETURN TRUE;
  5344. END GtrAXAXLoop;
  5345. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5346. BEGIN
  5347. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5348. END ">";
  5349. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5350. VAR lval, rval: LONGREAL;
  5351. BEGIN
  5352. WHILE (len > 0) DO
  5353. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5354. IF rval < lval THEN RETURN FALSE END;
  5355. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5356. END;
  5357. RETURN TRUE;
  5358. END LeqAXAXLoop;
  5359. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5360. BEGIN
  5361. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5362. END "<=";
  5363. (*** equals: array x array -> boolean ********************************************************************)
  5364. (** BOOLEAN *)
  5365. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5366. VAR lval, rval: BOOLEAN;
  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 EqlABABLoop;
  5375. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5376. BEGIN
  5377. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5378. END "=";
  5379. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5380. BEGIN
  5381. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5382. END "#";
  5383. (** SHORTINT *)
  5384. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5385. VAR lval, rval: SHORTINT;
  5386. BEGIN
  5387. WHILE (len > 0) DO
  5388. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5389. IF rval # lval THEN RETURN FALSE END;
  5390. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5391. END;
  5392. RETURN TRUE;
  5393. END EqlASASLoop;
  5394. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5395. BEGIN
  5396. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5397. END "=";
  5398. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5399. BEGIN
  5400. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5401. END "#";
  5402. (** INTEGER *)
  5403. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5404. VAR lval, rval: INTEGER;
  5405. BEGIN
  5406. WHILE (len > 0) DO
  5407. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5408. IF rval # lval THEN RETURN FALSE END;
  5409. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5410. END;
  5411. RETURN TRUE;
  5412. END EqlAIAILoop;
  5413. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5414. BEGIN
  5415. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5416. END "=";
  5417. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5418. BEGIN
  5419. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5420. END "#";
  5421. (** LONGINT *)
  5422. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5423. VAR lval, rval: LONGINT;
  5424. BEGIN
  5425. WHILE (len > 0) DO
  5426. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5427. IF rval # lval THEN RETURN FALSE END;
  5428. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5429. END;
  5430. RETURN TRUE;
  5431. END EqlALALLoop;
  5432. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5433. BEGIN
  5434. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5435. END "=";
  5436. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5437. BEGIN
  5438. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5439. END "#";
  5440. (** REAL *)
  5441. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5442. VAR lval, rval: REAL;
  5443. BEGIN
  5444. WHILE (len > 0) DO
  5445. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5446. IF rval # lval THEN RETURN FALSE END;
  5447. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5448. END;
  5449. RETURN TRUE;
  5450. END EqlARARLoop;
  5451. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5452. BEGIN
  5453. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5454. END "=";
  5455. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5456. BEGIN
  5457. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5458. END "#";
  5459. (** LONGREAL *)
  5460. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5461. VAR lval, rval: LONGREAL;
  5462. BEGIN
  5463. WHILE (len > 0) DO
  5464. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5465. IF rval # lval THEN RETURN FALSE END;
  5466. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5467. END;
  5468. RETURN TRUE;
  5469. END EqlAXAXLoop;
  5470. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5471. BEGIN
  5472. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5473. END "=";
  5474. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5475. BEGIN
  5476. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5477. END "#";
  5478. (** COMPLEX *)
  5479. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5480. VAR lval, rval: COMPLEX;
  5481. BEGIN
  5482. WHILE (len > 0) DO
  5483. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5484. IF rval # lval THEN RETURN FALSE END;
  5485. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5486. END;
  5487. RETURN TRUE;
  5488. END EqlAZAZLoop;
  5489. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5490. BEGIN
  5491. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5492. END "=";
  5493. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5494. BEGIN
  5495. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5496. END "#";
  5497. (** LONGCOMPLEX *)
  5498. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5499. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5500. BEGIN
  5501. WHILE (len > 0) DO
  5502. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5503. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5504. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5505. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5506. END;
  5507. RETURN TRUE;
  5508. END EqlALZALZLoop;
  5509. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5510. BEGIN
  5511. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5512. END "=";
  5513. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5514. BEGIN
  5515. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5516. END "#";
  5517. (*** equals: array x scalar -> boolean ********************************************************************)
  5518. (** BOOLEAN *)
  5519. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5520. VAR lval, rval: BOOLEAN;
  5521. BEGIN
  5522. SYSTEM.GET( radr, rval );
  5523. WHILE (len > 0) DO
  5524. SYSTEM.GET( ladr, lval );
  5525. IF lval # rval THEN RETURN FALSE END;
  5526. INC( ladr, linc ); DEC( len );
  5527. END;
  5528. RETURN TRUE;
  5529. END EqlABSBLoop;
  5530. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5531. right: BOOLEAN ): BOOLEAN;
  5532. BEGIN
  5533. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5534. END "=";
  5535. OPERATOR "="*( left: BOOLEAN;
  5536. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5537. BEGIN
  5538. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5539. END "=";
  5540. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5541. right: BOOLEAN ): BOOLEAN;
  5542. BEGIN
  5543. RETURN ~(left = right);
  5544. END "#";
  5545. OPERATOR "#"*( left: BOOLEAN;
  5546. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5547. BEGIN
  5548. RETURN ~( left = right );
  5549. END "#";
  5550. (** SHORTINT *)
  5551. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5552. VAR lval, rval: SHORTINT;
  5553. BEGIN
  5554. SYSTEM.GET( radr, rval );
  5555. WHILE (len > 0) DO
  5556. SYSTEM.GET( ladr, lval );
  5557. IF lval # rval THEN RETURN FALSE END;
  5558. INC( ladr, linc ); DEC( len );
  5559. END;
  5560. RETURN TRUE;
  5561. END EqlASSSLoop;
  5562. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5563. BEGIN
  5564. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5565. END "=";
  5566. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5567. BEGIN
  5568. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5569. END "=";
  5570. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5571. BEGIN
  5572. RETURN ~( left= right );
  5573. END "#";
  5574. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5575. BEGIN
  5576. RETURN ~( left= right );
  5577. END "#";
  5578. (** INTEGER *)
  5579. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5580. VAR lval, rval: INTEGER;
  5581. BEGIN
  5582. SYSTEM.GET( radr, rval );
  5583. WHILE (len > 0) DO
  5584. SYSTEM.GET( ladr, lval );
  5585. IF lval # rval THEN RETURN FALSE END;
  5586. INC( ladr, linc ); DEC( len );
  5587. END;
  5588. RETURN TRUE;
  5589. END EqlAISILoop;
  5590. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5591. BEGIN
  5592. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5593. END "=";
  5594. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5595. BEGIN
  5596. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5597. END "=";
  5598. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5599. BEGIN
  5600. RETURN ~( left = right );
  5601. END "#";
  5602. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5603. BEGIN
  5604. RETURN ~( left = right );
  5605. END "#";
  5606. (** LONGINT *)
  5607. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5608. VAR lval, rval: LONGINT;
  5609. BEGIN
  5610. SYSTEM.GET( radr, rval );
  5611. WHILE (len > 0) DO
  5612. SYSTEM.GET( ladr, lval );
  5613. IF lval # rval THEN RETURN FALSE END;
  5614. INC( ladr, linc ); DEC( len );
  5615. END;
  5616. RETURN TRUE;
  5617. END EqlALSLLoop;
  5618. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5619. right: LONGINT ): BOOLEAN;
  5620. BEGIN
  5621. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5622. END "=";
  5623. OPERATOR "="*( left: LONGINT;
  5624. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5625. BEGIN
  5626. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5627. END "=";
  5628. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5629. right: LONGINT ): BOOLEAN;
  5630. BEGIN
  5631. RETURN ~(left = right);
  5632. END "#";
  5633. OPERATOR "#"*( left: LONGINT;
  5634. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5635. BEGIN
  5636. RETURN ~(left = right);
  5637. END "#";
  5638. (** REAL *)
  5639. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5640. VAR lval, rval: REAL;
  5641. BEGIN
  5642. SYSTEM.GET( radr, rval );
  5643. WHILE (len > 0) DO
  5644. SYSTEM.GET( ladr, lval );
  5645. IF lval # rval THEN RETURN FALSE END;
  5646. INC( ladr, linc ); DEC( len );
  5647. END;
  5648. RETURN TRUE;
  5649. END EqlARSRLoop;
  5650. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5651. right: REAL ): BOOLEAN;
  5652. BEGIN
  5653. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5654. END "=";
  5655. OPERATOR "="*( left: REAL;
  5656. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5657. BEGIN
  5658. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5659. END "=";
  5660. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5661. right: REAL ): BOOLEAN;
  5662. BEGIN
  5663. RETURN ~( left = right );
  5664. END "#";
  5665. OPERATOR "#"*( left: REAL;
  5666. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5667. BEGIN
  5668. RETURN ~( left = right );
  5669. END "#";
  5670. (** LONGREAL *)
  5671. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5672. VAR lval, rval: LONGREAL;
  5673. BEGIN
  5674. SYSTEM.GET( radr, rval );
  5675. WHILE (len > 0) DO
  5676. SYSTEM.GET( ladr, lval );
  5677. IF lval # rval THEN RETURN FALSE END;
  5678. INC( ladr, linc ); DEC( len );
  5679. END;
  5680. RETURN TRUE;
  5681. END EqlAXSXLoop;
  5682. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5683. right: LONGREAL ): BOOLEAN;
  5684. BEGIN
  5685. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5686. END "=";
  5687. OPERATOR "="*( left: LONGREAL;
  5688. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5689. BEGIN
  5690. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5691. END "=";
  5692. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5693. right: LONGREAL ): BOOLEAN;
  5694. BEGIN
  5695. RETURN ~( left = right );
  5696. END "#";
  5697. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5698. BEGIN
  5699. RETURN ~( left= right );
  5700. END "#";
  5701. (*** gtr : array x scalar -> boolean ********************************************************************)
  5702. (** SHORTINT *)
  5703. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5704. VAR lval, rval: SHORTINT;
  5705. BEGIN
  5706. SYSTEM.GET( radr, rval );
  5707. WHILE (len > 0) DO
  5708. SYSTEM.GET( ladr, lval );
  5709. IF lval <= rval THEN RETURN FALSE END;
  5710. INC( ladr, linc ); DEC( len );
  5711. END;
  5712. RETURN TRUE;
  5713. END GtrASSSLoop;
  5714. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5715. BEGIN
  5716. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5717. END ">";
  5718. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5719. BEGIN
  5720. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5721. END "<";
  5722. (** INTEGER *)
  5723. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5724. VAR lval, rval: INTEGER;
  5725. BEGIN
  5726. SYSTEM.GET( radr, rval );
  5727. WHILE (len > 0) DO
  5728. SYSTEM.GET( ladr, lval );
  5729. IF lval <= rval THEN RETURN FALSE END;
  5730. INC( ladr, linc ); DEC( len );
  5731. END;
  5732. RETURN TRUE;
  5733. END GtrAISILoop;
  5734. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5735. BEGIN
  5736. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5737. END ">";
  5738. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5739. BEGIN
  5740. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5741. END "<";
  5742. (** LONGINT *)
  5743. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5744. VAR lval, rval: LONGINT;
  5745. BEGIN
  5746. SYSTEM.GET( radr, rval );
  5747. WHILE (len > 0) DO
  5748. SYSTEM.GET( ladr, lval );
  5749. IF lval <= rval THEN RETURN FALSE END;
  5750. INC( ladr, linc ); DEC( len );
  5751. END;
  5752. RETURN TRUE;
  5753. END GtrALSLLoop;
  5754. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5755. BEGIN
  5756. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5757. END ">";
  5758. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5759. BEGIN
  5760. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5761. END "<";
  5762. (** REAL *)
  5763. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5764. VAR lval, rval: REAL;
  5765. BEGIN
  5766. SYSTEM.GET( radr, rval );
  5767. WHILE (len > 0) DO
  5768. SYSTEM.GET( ladr, lval );
  5769. IF lval <= rval THEN RETURN FALSE END;
  5770. INC( ladr, linc ); DEC( len );
  5771. END;
  5772. RETURN TRUE;
  5773. END GtrARSRLoop;
  5774. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5775. right: REAL ): BOOLEAN;
  5776. BEGIN
  5777. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5778. END ">";
  5779. OPERATOR "<"*( left: REAL;
  5780. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5781. BEGIN
  5782. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5783. END "<";
  5784. (** LONGREAL *)
  5785. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5786. VAR lval, rval: LONGREAL;
  5787. BEGIN
  5788. SYSTEM.GET( radr, rval );
  5789. WHILE (len > 0) DO
  5790. SYSTEM.GET( ladr, lval );
  5791. IF lval <= rval THEN RETURN FALSE END;
  5792. INC( ladr, linc ); DEC( len );
  5793. END;
  5794. RETURN TRUE;
  5795. END GtrAXSXLoop;
  5796. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5797. right: LONGREAL ): BOOLEAN;
  5798. BEGIN
  5799. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5800. END ">";
  5801. OPERATOR "<"*( left: LONGREAL;
  5802. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5803. BEGIN
  5804. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5805. END "<";
  5806. (*** geq : array x scalar -> boolean ********************************************************************)
  5807. (** SHORTINT *)
  5808. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5809. VAR lval, rval: SHORTINT;
  5810. BEGIN
  5811. SYSTEM.GET( radr, rval );
  5812. WHILE (len > 0) DO
  5813. SYSTEM.GET( ladr, lval );
  5814. IF lval < rval THEN RETURN FALSE END;
  5815. INC( ladr, linc ); DEC( len );
  5816. END;
  5817. RETURN TRUE;
  5818. END GeqASSSLoop;
  5819. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5820. right: SHORTINT ): BOOLEAN;
  5821. BEGIN
  5822. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5823. END ">=";
  5824. OPERATOR "<="*( left: SHORTINT;
  5825. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5826. BEGIN
  5827. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5828. END "<=";
  5829. (** INTEGER *)
  5830. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5831. VAR lval, rval: INTEGER;
  5832. BEGIN
  5833. SYSTEM.GET( radr, rval );
  5834. WHILE (len > 0) DO
  5835. SYSTEM.GET( ladr, lval );
  5836. IF lval < rval THEN RETURN FALSE END;
  5837. INC( ladr, linc ); DEC( len );
  5838. END;
  5839. RETURN TRUE;
  5840. END GeqAISILoop;
  5841. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5842. BEGIN
  5843. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5844. END ">=";
  5845. OPERATOR "<="*( left: INTEGER;
  5846. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5847. BEGIN
  5848. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5849. END "<=";
  5850. (** LONGINT *)
  5851. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5852. VAR lval, rval: LONGINT;
  5853. BEGIN
  5854. SYSTEM.GET( radr, rval );
  5855. WHILE (len > 0) DO
  5856. SYSTEM.GET( ladr, lval );
  5857. IF lval < rval THEN RETURN FALSE END;
  5858. INC( ladr, linc ); DEC( len );
  5859. END;
  5860. RETURN TRUE;
  5861. END GeqALSLLoop;
  5862. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5863. right: LONGINT ): BOOLEAN;
  5864. BEGIN
  5865. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5866. END ">=";
  5867. OPERATOR "<="*( left: LONGINT;
  5868. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5869. BEGIN
  5870. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5871. END "<=";
  5872. (** REAL *)
  5873. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5874. VAR lval, rval: REAL;
  5875. BEGIN
  5876. SYSTEM.GET( radr, rval );
  5877. WHILE (len > 0) DO
  5878. SYSTEM.GET( ladr, lval );
  5879. IF lval < rval THEN RETURN FALSE END;
  5880. INC( ladr, linc ); DEC( len );
  5881. END;
  5882. RETURN TRUE;
  5883. END GeqARSRLoop;
  5884. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5885. right: REAL ): BOOLEAN;
  5886. BEGIN
  5887. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5888. END ">=";
  5889. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5890. BEGIN
  5891. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5892. END "<=";
  5893. (** LONGREAL *)
  5894. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5895. VAR lval, rval: LONGREAL;
  5896. BEGIN
  5897. SYSTEM.GET( radr, rval );
  5898. WHILE (len > 0) DO
  5899. SYSTEM.GET( ladr, lval );
  5900. IF lval < rval THEN RETURN FALSE END;
  5901. INC( ladr, linc ); DEC( len );
  5902. END;
  5903. RETURN TRUE;
  5904. END GeqAXSXLoop;
  5905. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5906. BEGIN
  5907. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5908. END ">=";
  5909. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5910. BEGIN
  5911. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5912. END "<=";
  5913. (*** leq : array x scalar -> boolean ********************************************************************)
  5914. (** SHORTINT *)
  5915. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5916. VAR lval, rval: SHORTINT;
  5917. BEGIN
  5918. SYSTEM.GET( radr, rval );
  5919. WHILE (len > 0) DO
  5920. SYSTEM.GET( ladr, lval );
  5921. IF lval > rval THEN RETURN FALSE END;
  5922. INC( ladr, linc ); DEC( len );
  5923. END;
  5924. RETURN TRUE;
  5925. END LeqASSSLoop;
  5926. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5927. BEGIN
  5928. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5929. END "<=";
  5930. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5931. BEGIN
  5932. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5933. END ">=";
  5934. (** INTEGER *)
  5935. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5936. VAR lval, rval: INTEGER;
  5937. BEGIN
  5938. SYSTEM.GET( radr, rval );
  5939. WHILE (len > 0) DO
  5940. SYSTEM.GET( ladr, lval );
  5941. IF lval > rval THEN RETURN FALSE END;
  5942. INC( ladr, linc ); DEC( len );
  5943. END;
  5944. RETURN TRUE;
  5945. END LeqAISILoop;
  5946. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5947. BEGIN
  5948. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5949. END "<=";
  5950. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5951. BEGIN
  5952. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5953. END ">=";
  5954. (** LONGINT *)
  5955. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5956. VAR lval, rval: LONGINT;
  5957. BEGIN
  5958. SYSTEM.GET( radr, rval );
  5959. WHILE (len > 0) DO
  5960. SYSTEM.GET( ladr, lval );
  5961. IF lval > rval THEN RETURN FALSE END;
  5962. INC( ladr, linc ); DEC( len );
  5963. END;
  5964. RETURN TRUE;
  5965. END LeqALSLLoop;
  5966. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5967. BEGIN
  5968. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  5969. END "<=";
  5970. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5971. BEGIN
  5972. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  5973. END ">=";
  5974. (** REAL *)
  5975. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5976. VAR lval, rval: REAL;
  5977. BEGIN
  5978. SYSTEM.GET( radr, rval );
  5979. WHILE (len > 0) DO
  5980. SYSTEM.GET( ladr, lval );
  5981. IF lval > rval THEN RETURN FALSE END;
  5982. INC( ladr, linc ); DEC( len );
  5983. END;
  5984. RETURN TRUE;
  5985. END LeqARSRLoop;
  5986. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  5987. BEGIN
  5988. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  5989. END "<=";
  5990. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5991. BEGIN
  5992. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  5993. END ">=";
  5994. (** LONGREAL *)
  5995. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5996. VAR lval, rval: LONGREAL;
  5997. BEGIN
  5998. SYSTEM.GET( radr, rval );
  5999. WHILE (len > 0) DO
  6000. SYSTEM.GET( ladr, lval );
  6001. IF lval > rval THEN RETURN FALSE END;
  6002. INC( ladr, linc ); DEC( len );
  6003. END;
  6004. RETURN TRUE;
  6005. END LeqAXSXLoop;
  6006. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6007. BEGIN
  6008. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6009. END "<=";
  6010. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6011. BEGIN
  6012. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6013. END ">=";
  6014. (*** lss: array x scalar -> boolean ********************************************************************)
  6015. (** SHORTINT *)
  6016. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6017. VAR lval, rval: SHORTINT;
  6018. BEGIN
  6019. SYSTEM.GET( radr, rval );
  6020. WHILE (len > 0) DO
  6021. SYSTEM.GET( ladr, lval );
  6022. IF lval >= rval THEN RETURN FALSE END;
  6023. INC( ladr, linc ); DEC( len );
  6024. END;
  6025. RETURN TRUE;
  6026. END LssASSSLoop;
  6027. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6028. BEGIN
  6029. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6030. END "<";
  6031. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6032. BEGIN
  6033. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6034. END ">";
  6035. (** INTEGER *)
  6036. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6037. VAR lval, rval: INTEGER;
  6038. BEGIN
  6039. SYSTEM.GET( radr, rval );
  6040. WHILE (len > 0) DO
  6041. SYSTEM.GET( ladr, lval );
  6042. IF lval >= rval THEN RETURN FALSE END;
  6043. INC( ladr, linc ); DEC( len );
  6044. END;
  6045. RETURN TRUE;
  6046. END LssAISILoop;
  6047. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6048. BEGIN
  6049. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6050. END "<";
  6051. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6052. BEGIN
  6053. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6054. END ">";
  6055. (** LONGINT *)
  6056. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6057. VAR lval, rval: LONGINT;
  6058. BEGIN
  6059. SYSTEM.GET( radr, rval );
  6060. WHILE (len > 0) DO
  6061. SYSTEM.GET( ladr, lval );
  6062. IF lval >= rval THEN RETURN FALSE END;
  6063. INC( ladr, linc ); DEC( len );
  6064. END;
  6065. RETURN TRUE;
  6066. END LssALSLLoop;
  6067. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6068. BEGIN
  6069. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6070. END "<";
  6071. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6072. BEGIN
  6073. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6074. END ">";
  6075. (** REAL *)
  6076. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6077. VAR lval, rval: REAL;
  6078. BEGIN
  6079. SYSTEM.GET( radr, rval );
  6080. WHILE (len > 0) DO
  6081. SYSTEM.GET( ladr, lval );
  6082. IF lval >= rval THEN RETURN FALSE END;
  6083. INC( ladr, linc ); DEC( len );
  6084. END;
  6085. RETURN TRUE;
  6086. END LssARSRLoop;
  6087. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6088. right: REAL ): BOOLEAN;
  6089. BEGIN
  6090. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6091. END "<";
  6092. OPERATOR ">"*( left: REAL;
  6093. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6094. BEGIN
  6095. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6096. END ">";
  6097. (** LONGREAL *)
  6098. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6099. VAR lval, rval: LONGREAL;
  6100. BEGIN
  6101. SYSTEM.GET( radr, rval );
  6102. WHILE (len > 0) DO
  6103. SYSTEM.GET( ladr, lval );
  6104. IF lval >= rval THEN RETURN FALSE END;
  6105. INC( ladr, linc ); DEC( len );
  6106. END;
  6107. RETURN TRUE;
  6108. END LssAXSXLoop;
  6109. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6110. right: LONGREAL ): BOOLEAN;
  6111. BEGIN
  6112. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6113. END "<";
  6114. OPERATOR ">"*( left: LONGREAL;
  6115. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6116. BEGIN
  6117. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6118. END ">";
  6119. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6120. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6121. VAR lval, val: LONGREAL;
  6122. BEGIN
  6123. SYSTEM.GET( radr, val );
  6124. WHILE (len > 0) DO
  6125. SYSTEM.GET( ladr, lval );
  6126. INC( ladr, linc ); DEC( len );
  6127. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6128. INC(dadr,dinc);
  6129. END;
  6130. END MaxAXSXLoop;
  6131. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6132. TYPE Type = LONGREAL;
  6133. BEGIN
  6134. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6135. RETURN RESULT
  6136. END "MAX";
  6137. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6138. VAR lval, val: REAL;
  6139. BEGIN
  6140. SYSTEM.GET( radr, val );
  6141. WHILE (len > 0) DO
  6142. SYSTEM.GET( ladr, lval );
  6143. INC( ladr, linc ); DEC( len );
  6144. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6145. INC(dadr,dinc);
  6146. END;
  6147. END MaxARSRLoop;
  6148. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6149. TYPE Type = REAL;
  6150. BEGIN
  6151. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6152. RETURN RESULT
  6153. END "MAX";
  6154. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6155. VAR lval, val: LONGINT;
  6156. BEGIN
  6157. SYSTEM.GET( radr, val );
  6158. WHILE (len > 0) DO
  6159. SYSTEM.GET( ladr, lval );
  6160. INC( ladr, linc ); DEC( len );
  6161. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6162. INC(dadr,dinc);
  6163. END;
  6164. END MaxALSLLoop;
  6165. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6166. TYPE Type = LONGINT;
  6167. BEGIN
  6168. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6169. RETURN RESULT
  6170. END "MAX";
  6171. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6172. VAR lval, val: INTEGER;
  6173. BEGIN
  6174. SYSTEM.GET( radr, val );
  6175. WHILE (len > 0) DO
  6176. SYSTEM.GET( ladr, lval );
  6177. INC( ladr, linc ); DEC( len );
  6178. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6179. INC(dadr,dinc);
  6180. END;
  6181. END MaxAISILoop;
  6182. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6183. TYPE Type = INTEGER;
  6184. BEGIN
  6185. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6186. RETURN RESULT
  6187. END "MAX";
  6188. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6189. VAR lval, val: SHORTINT;
  6190. BEGIN
  6191. SYSTEM.GET( radr, val );
  6192. WHILE (len > 0) DO
  6193. SYSTEM.GET( ladr, lval );
  6194. INC( ladr, linc ); DEC( len );
  6195. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6196. INC(dadr,dinc);
  6197. END;
  6198. END MaxASSSLoop;
  6199. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6200. TYPE Type = SHORTINT;
  6201. BEGIN
  6202. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6203. RETURN RESULT
  6204. END "MAX";
  6205. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6206. VAR lval, val: LONGREAL;
  6207. BEGIN
  6208. SYSTEM.GET( radr, val );
  6209. WHILE (len > 0) DO
  6210. SYSTEM.GET( ladr, lval );
  6211. INC( ladr, linc ); DEC( len );
  6212. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6213. INC(dadr,dinc);
  6214. END;
  6215. END MinAXSXLoop;
  6216. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6217. TYPE Type = LONGREAL;
  6218. BEGIN
  6219. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6220. RETURN RESULT
  6221. END "MIN";
  6222. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6223. VAR lval, val: REAL;
  6224. BEGIN
  6225. SYSTEM.GET( radr, val );
  6226. WHILE (len > 0) DO
  6227. SYSTEM.GET( ladr, lval );
  6228. INC( ladr, linc ); DEC( len );
  6229. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6230. INC(dadr,dinc);
  6231. END;
  6232. END MinARSRLoop;
  6233. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6234. TYPE Type = REAL;
  6235. BEGIN
  6236. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6237. RETURN RESULT
  6238. END "MIN";
  6239. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6240. VAR lval, val: LONGINT;
  6241. BEGIN
  6242. SYSTEM.GET( radr, val );
  6243. WHILE (len > 0) DO
  6244. SYSTEM.GET( ladr, lval );
  6245. INC( ladr, linc ); DEC( len );
  6246. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6247. INC(dadr,dinc);
  6248. END;
  6249. END MinALSLLoop;
  6250. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6251. TYPE Type = LONGINT;
  6252. BEGIN
  6253. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6254. RETURN RESULT
  6255. END "MIN";
  6256. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6257. VAR lval, val: INTEGER;
  6258. BEGIN
  6259. SYSTEM.GET( radr, val );
  6260. WHILE (len > 0) DO
  6261. SYSTEM.GET( ladr, lval );
  6262. INC( ladr, linc ); DEC( len );
  6263. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6264. INC(dadr,dinc);
  6265. END;
  6266. END MinAISILoop;
  6267. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6268. TYPE Type = INTEGER;
  6269. BEGIN
  6270. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6271. RETURN RESULT
  6272. END "MIN";
  6273. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6274. VAR lval, val: SHORTINT;
  6275. BEGIN
  6276. SYSTEM.GET( radr, val );
  6277. WHILE (len > 0) DO
  6278. SYSTEM.GET( ladr, lval );
  6279. INC( ladr, linc ); DEC( len );
  6280. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6281. INC(dadr,dinc);
  6282. END;
  6283. END MinASSSLoop;
  6284. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6285. TYPE Type = SHORTINT;
  6286. BEGIN
  6287. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6288. RETURN RESULT
  6289. END "MIN";
  6290. (**** binary max/min operators array x array -> array ********************************************************************)
  6291. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6292. VAR lval, rval: LONGREAL;
  6293. BEGIN
  6294. WHILE (len > 0) DO
  6295. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6296. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6297. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6298. INC(dadr,dinc);
  6299. END;
  6300. END MaxAXAXLoop;
  6301. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6302. BEGIN
  6303. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6304. RETURN RESULT
  6305. END "MAX";
  6306. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6307. VAR lval, rval: REAL ;
  6308. BEGIN
  6309. WHILE (len > 0) DO
  6310. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6311. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6312. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6313. INC(dadr,dinc);
  6314. END;
  6315. END MaxARARLoop;
  6316. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6317. BEGIN
  6318. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6319. RETURN RESULT
  6320. END "MAX";
  6321. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6322. VAR lval, rval: LONGINT;
  6323. BEGIN
  6324. WHILE (len > 0) DO
  6325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6326. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6327. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6328. INC(dadr,dinc);
  6329. END;
  6330. END MaxALALLoop;
  6331. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6332. BEGIN
  6333. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6334. RETURN RESULT
  6335. END "MAX";
  6336. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6337. VAR lval, rval: INTEGER;
  6338. BEGIN
  6339. WHILE (len > 0) DO
  6340. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6341. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6342. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6343. INC(dadr,dinc);
  6344. END;
  6345. END MaxAIAILoop;
  6346. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6347. BEGIN
  6348. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6349. RETURN RESULT
  6350. END "MAX";
  6351. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6352. VAR lval, rval: SHORTINT;
  6353. BEGIN
  6354. WHILE (len > 0) DO
  6355. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6356. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6357. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6358. INC(dadr,dinc);
  6359. END;
  6360. END MaxASASLoop;
  6361. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6362. BEGIN
  6363. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6364. RETURN RESULT
  6365. END "MAX";
  6366. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6367. VAR lval, rval: LONGREAL;
  6368. BEGIN
  6369. WHILE (len > 0) DO
  6370. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6371. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6372. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6373. INC(dadr,dinc);
  6374. END;
  6375. END MinAXAXLoop;
  6376. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6377. BEGIN
  6378. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6379. RETURN RESULT
  6380. END "MIN";
  6381. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6382. VAR lval, rval: REAL ;
  6383. BEGIN
  6384. WHILE (len > 0) DO
  6385. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6386. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6387. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6388. INC(dadr,dinc);
  6389. END;
  6390. END MinARARLoop;
  6391. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6392. BEGIN
  6393. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6394. RETURN RESULT
  6395. END "MIN";
  6396. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6397. VAR lval, rval: LONGINT;
  6398. BEGIN
  6399. WHILE (len > 0) DO
  6400. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6401. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6402. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6403. INC(dadr,dinc);
  6404. END;
  6405. END MinALALLoop;
  6406. *)
  6407. TYPE
  6408. LongintPtr = POINTER {UNSAFE} TO RECORD val: LONGINT END;
  6409. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6410. BEGIN
  6411. WHILE (len > 0) DO
  6412. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6413. ladr := ladr + linc;
  6414. radr := radr + rinc;
  6415. dadr := dadr + dinc;
  6416. DEC(len);
  6417. END;
  6418. END MinALALLoop;
  6419. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6420. BEGIN
  6421. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6422. RETURN RESULT
  6423. END "MIN";
  6424. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6425. VAR lval, rval: INTEGER;
  6426. BEGIN
  6427. WHILE (len > 0) DO
  6428. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6429. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6430. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6431. INC(dadr,dinc);
  6432. END;
  6433. END MinAIAILoop;
  6434. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6435. BEGIN
  6436. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6437. RETURN RESULT
  6438. END "MIN";
  6439. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6440. VAR lval, rval: SHORTINT;
  6441. BEGIN
  6442. WHILE (len > 0) DO
  6443. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6444. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6445. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6446. INC(dadr,dinc);
  6447. END;
  6448. END MinASASLoop;
  6449. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6450. BEGIN
  6451. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6452. RETURN RESULT
  6453. END "MIN";
  6454. (**** unary operators array -> scalar ********************************************************************)
  6455. (*** min: array -> scalar ****************************************)
  6456. (** SHORTINT *)
  6457. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6458. VAR lval, dval: SHORTINT;
  6459. BEGIN
  6460. SYSTEM.GET( dadr, dval );
  6461. WHILE (len > 0) DO
  6462. SYSTEM.GET( ladr, lval );
  6463. IF lval < dval THEN dval := lval END;
  6464. INC( ladr, linc ); DEC( len );
  6465. END;
  6466. SYSTEM.PUT( dadr, dval );
  6467. END MinASLoop;
  6468. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6469. TYPE Type = SHORTINT;
  6470. VAR val: Type;
  6471. BEGIN
  6472. val := MAX( Type );
  6473. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6474. END "MIN";
  6475. (** INTEGER *)
  6476. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6477. VAR lval, dval: INTEGER;
  6478. BEGIN
  6479. SYSTEM.GET( dadr, dval );
  6480. WHILE (len > 0) DO
  6481. SYSTEM.GET( ladr, lval );
  6482. IF lval < dval THEN dval := lval END;
  6483. INC( ladr, linc ); DEC( len );
  6484. END;
  6485. SYSTEM.PUT( dadr, dval );
  6486. END MinAILoop;
  6487. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6488. TYPE Type = INTEGER;
  6489. VAR val: Type;
  6490. BEGIN
  6491. val := MAX( Type );
  6492. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6493. END "MIN";
  6494. (** LONGINT *)
  6495. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6496. VAR lval, dval: LONGINT;
  6497. BEGIN
  6498. SYSTEM.GET( dadr, dval );
  6499. WHILE (len > 0) DO
  6500. SYSTEM.GET( ladr, lval );
  6501. IF lval < dval THEN dval := lval END;
  6502. INC( ladr, linc ); DEC( len );
  6503. END;
  6504. SYSTEM.PUT( dadr, dval );
  6505. END MinALLoop;
  6506. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6507. TYPE Type = LONGINT;
  6508. VAR val: Type;
  6509. BEGIN
  6510. val := MAX( Type );
  6511. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6512. END "MIN";
  6513. (** REAL *)
  6514. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6515. VAR lval, dval: REAL;
  6516. BEGIN
  6517. SYSTEM.GET( dadr, dval );
  6518. WHILE (len > 0) DO
  6519. SYSTEM.GET( ladr, lval );
  6520. IF lval < dval THEN dval := lval END;
  6521. INC( ladr, linc ); DEC( len );
  6522. END;
  6523. SYSTEM.PUT( dadr, dval );
  6524. END MinARLoop;
  6525. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6526. TYPE Type = REAL;
  6527. VAR val: Type;
  6528. BEGIN
  6529. val := MAX( Type );
  6530. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6531. END "MIN";
  6532. (** LONGREAL *)
  6533. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6534. VAR lval, dval: LONGREAL;
  6535. BEGIN
  6536. SYSTEM.GET( dadr, dval );
  6537. WHILE (len > 0) DO
  6538. SYSTEM.GET( ladr, lval );
  6539. IF lval < dval THEN dval := lval END;
  6540. INC( ladr, linc ); DEC( len );
  6541. END;
  6542. SYSTEM.PUT( dadr, dval );
  6543. END MinAXLoop;
  6544. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6545. TYPE Type = LONGREAL;
  6546. VAR val: Type;
  6547. BEGIN
  6548. val := MAX( Type );
  6549. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6550. END "MIN";
  6551. (*** max: array -> scalar ********************************************************************)
  6552. (** SHORTINT *)
  6553. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6554. VAR lval, dval: SHORTINT;
  6555. BEGIN
  6556. SYSTEM.GET( dadr, dval );
  6557. WHILE (len > 0) DO
  6558. SYSTEM.GET( ladr, lval );
  6559. IF lval > dval THEN dval := lval END;
  6560. INC( ladr, linc ); DEC( len );
  6561. END;
  6562. SYSTEM.PUT( dadr, dval );
  6563. END MaxASLoop;
  6564. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6565. TYPE Type = SHORTINT;
  6566. VAR val: Type;
  6567. BEGIN
  6568. val := MIN( Type );
  6569. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6570. END "MAX";
  6571. (** INTEGER *)
  6572. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6573. VAR lval, dval: INTEGER;
  6574. BEGIN
  6575. SYSTEM.GET( dadr, dval );
  6576. WHILE (len > 0) DO
  6577. SYSTEM.GET( ladr, lval );
  6578. IF lval > dval THEN dval := lval END;
  6579. INC( ladr, linc ); DEC( len );
  6580. END;
  6581. SYSTEM.PUT( dadr, dval );
  6582. END MaxAILoop;
  6583. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6584. TYPE Type = INTEGER;
  6585. VAR val: Type;
  6586. BEGIN
  6587. val := MIN( Type );
  6588. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6589. END "MAX";
  6590. (** LONGINT *)
  6591. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6592. VAR lval, dval: LONGINT;
  6593. BEGIN
  6594. SYSTEM.GET( dadr, dval );
  6595. WHILE (len > 0) DO
  6596. SYSTEM.GET( ladr, lval );
  6597. IF lval > dval THEN dval := lval END;
  6598. INC( ladr, linc ); DEC( len );
  6599. END;
  6600. SYSTEM.PUT( dadr, dval );
  6601. END MaxALLoop;
  6602. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6603. TYPE Type = LONGINT;
  6604. VAR val: Type;
  6605. BEGIN
  6606. val := MIN( Type );
  6607. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6608. END "MAX";
  6609. (** REAL *)
  6610. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6611. VAR lval, dval: REAL;
  6612. BEGIN
  6613. SYSTEM.GET( dadr, dval );
  6614. WHILE (len > 0) DO
  6615. SYSTEM.GET( ladr, lval );
  6616. IF lval > dval THEN dval := lval END;
  6617. INC( ladr, linc ); DEC( len );
  6618. END;
  6619. SYSTEM.PUT( dadr, dval );
  6620. END MaxARLoop;
  6621. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6622. TYPE Type = REAL;
  6623. VAR val: Type;
  6624. BEGIN
  6625. val := MIN( Type );
  6626. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6627. END "MAX";
  6628. (** LONGREAL *)
  6629. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6630. VAR lval, dval: LONGREAL;
  6631. BEGIN
  6632. SYSTEM.GET( dadr, dval );
  6633. WHILE (len > 0) DO
  6634. SYSTEM.GET( ladr, lval );
  6635. IF lval > dval THEN dval := lval END;
  6636. INC( ladr, linc ); DEC( len );
  6637. END;
  6638. SYSTEM.PUT( dadr, dval );
  6639. END MaxAXLoop;
  6640. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6641. TYPE Type = LONGREAL;
  6642. VAR val: Type;
  6643. BEGIN
  6644. val := MIN( Type );
  6645. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6646. END "MAX";
  6647. (*** LEN: array -> array **)
  6648. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6649. VAR src,dim,i: LONGINT;
  6650. BEGIN
  6651. src := SYSTEM.VAL(LONGINT,left);
  6652. dim := GetDim( src );
  6653. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6654. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6655. RETURN RESULT
  6656. END "LEN";
  6657. (*** SUM: array -> scalar ********************************************************************)
  6658. (** SHORTINT *)
  6659. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6660. VAR lval, dval: SHORTINT;
  6661. BEGIN
  6662. SYSTEM.GET( dadr, dval );
  6663. WHILE (len > 0) DO
  6664. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6665. END;
  6666. SYSTEM.PUT( dadr, dval );
  6667. END SumASLoop;
  6668. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6669. TYPE Type = SHORTINT;
  6670. VAR val: Type;
  6671. BEGIN
  6672. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6673. RETURN val;
  6674. END "SUM";
  6675. (** INTEGER *)
  6676. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6677. VAR lval, dval: INTEGER;
  6678. BEGIN
  6679. SYSTEM.GET( dadr, dval );
  6680. WHILE (len > 0) DO
  6681. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6682. END;
  6683. SYSTEM.PUT( dadr, dval );
  6684. END SumAILoop;
  6685. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6686. TYPE Type = INTEGER;
  6687. VAR val: Type;
  6688. BEGIN
  6689. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6690. RETURN val;
  6691. END "SUM";
  6692. (** LONGINT *)
  6693. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6694. VAR lval, dval: LONGINT;
  6695. BEGIN
  6696. SYSTEM.GET( dadr, dval );
  6697. WHILE (len > 0) DO
  6698. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6699. END;
  6700. SYSTEM.PUT( dadr, dval );
  6701. END SumALLoop;
  6702. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6703. TYPE Type = LONGINT;
  6704. VAR val: Type;
  6705. BEGIN
  6706. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6707. RETURN val;
  6708. END "SUM";
  6709. (** REAL *)
  6710. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6711. VAR lval, dval: REAL;
  6712. BEGIN
  6713. SYSTEM.GET( dadr, dval );
  6714. WHILE (len > 0) DO
  6715. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6716. END;
  6717. SYSTEM.PUT( dadr, dval );
  6718. END SumARLoop;
  6719. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6720. TYPE Type = REAL;
  6721. VAR val: Type;
  6722. BEGIN
  6723. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6724. RETURN val;
  6725. END "SUM";
  6726. (** LONGREAL *)
  6727. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6728. VAR lval, dval: LONGREAL;
  6729. BEGIN
  6730. SYSTEM.GET( dadr, dval );
  6731. WHILE (len > 0) DO
  6732. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6733. END;
  6734. SYSTEM.PUT( dadr, dval );
  6735. END SumAXLoop;
  6736. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6737. TYPE Type = LONGREAL;
  6738. VAR val: Type;
  6739. BEGIN
  6740. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6741. RETURN val;
  6742. END "SUM";
  6743. (** COMPLEX *)
  6744. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6745. VAR lval, dval: COMPLEX;
  6746. BEGIN
  6747. SYSTEM.GET( dadr, dval );
  6748. WHILE (len > 0) DO
  6749. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6750. END;
  6751. SYSTEM.PUT( dadr, dval );
  6752. END SumAZLoop;
  6753. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6754. TYPE Type = COMPLEX;
  6755. VAR val: Type;
  6756. BEGIN
  6757. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6758. RETURN val;
  6759. END "SUM";
  6760. (** LONGCOMPLEX *)
  6761. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6762. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6763. BEGIN
  6764. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6765. WHILE (len > 0) DO
  6766. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6767. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6768. INC( ladr, linc ); DEC( len );
  6769. END;
  6770. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6771. END SumALZLoop;
  6772. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6773. TYPE Type = LONGCOMPLEX;
  6774. VAR val: Type;
  6775. BEGIN
  6776. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6777. RETURN val;
  6778. END "SUM";
  6779. (*** monadic ABS array -> array ********************************************************************)
  6780. (** SHORTINT *)
  6781. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6782. VAR lval: SHORTINT;
  6783. BEGIN
  6784. WHILE (len > 0) DO
  6785. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6786. INC( dadr, dinc ); DEC( len );
  6787. END;
  6788. END AbsLoopS;
  6789. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6790. BEGIN
  6791. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6792. RETURN RESULT
  6793. END "ABS";
  6794. (** INTEGER *)
  6795. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6796. VAR lval: INTEGER;
  6797. BEGIN
  6798. WHILE (len > 0) DO
  6799. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6800. INC( dadr, dinc ); DEC( len );
  6801. END;
  6802. END AbsLoopI;
  6803. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6804. BEGIN
  6805. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6806. RETURN RESULT
  6807. END "ABS";
  6808. (** LONGINT *)
  6809. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6810. VAR lval: LONGINT;
  6811. BEGIN
  6812. WHILE (len > 0) DO
  6813. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6814. INC( dadr, dinc ); DEC( len );
  6815. END;
  6816. END AbsLoopL;
  6817. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6818. BEGIN
  6819. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6820. RETURN RESULT
  6821. END "ABS";
  6822. (** REAL *)
  6823. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6824. VAR lval: REAL;
  6825. BEGIN
  6826. WHILE (len > 0) DO
  6827. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6828. INC( dadr, dinc ); DEC( len );
  6829. END;
  6830. END AbsLoopR;
  6831. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6832. BEGIN
  6833. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6834. RETURN RESULT
  6835. END "ABS";
  6836. (** LONGREAL *)
  6837. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6838. VAR lval: LONGREAL;
  6839. BEGIN
  6840. WHILE (len > 0) DO
  6841. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6842. INC( dadr, dinc ); DEC( len );
  6843. END;
  6844. END AbsLoopX;
  6845. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6846. BEGIN
  6847. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6848. RETURN RESULT
  6849. END "ABS";
  6850. (** COMPLEX *)
  6851. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6852. VAR lval: COMPLEX;
  6853. BEGIN
  6854. WHILE (len > 0) DO
  6855. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6856. INC( dadr, dinc ); DEC( len );
  6857. END;
  6858. END AbsLoopZ;
  6859. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6860. BEGIN
  6861. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6862. RETURN RESULT
  6863. END "ABS";
  6864. (** LONGCOMPLEX *)
  6865. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6866. VAR lvalRe, lvalIm: LONGREAL;
  6867. BEGIN
  6868. WHILE (len > 0) DO
  6869. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6870. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6871. INC( ladr, linc );
  6872. INC( dadr, dinc ); DEC( len );
  6873. END;
  6874. END AbsLoopLZ;
  6875. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6876. BEGIN
  6877. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6878. RETURN RESULT
  6879. END "ABS";
  6880. (*** assign number to array (initialisation) ********************************************************************)
  6881. (** BOOLEAN *)
  6882. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6883. VAR lval: BOOLEAN;
  6884. BEGIN
  6885. SYSTEM.GET( ladr, lval );
  6886. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6887. END AssignSBABLoop;
  6888. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6889. BEGIN
  6890. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6891. END ":=";
  6892. (** SHORTINT*)
  6893. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6894. VAR lval: SHORTINT;
  6895. BEGIN
  6896. SYSTEM.GET( ladr, lval );
  6897. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6898. END AssignSSASLoop;
  6899. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6900. BEGIN
  6901. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6902. END ":=";
  6903. (**INTEGER *)
  6904. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6905. VAR lval: INTEGER;
  6906. BEGIN
  6907. SYSTEM.GET( ladr, lval );
  6908. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6909. END AssignSIAILoop;
  6910. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6911. BEGIN
  6912. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6913. END ":=";
  6914. (** LONGINT *)
  6915. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6916. VAR lval: LONGINT;
  6917. BEGIN
  6918. SYSTEM.GET( ladr, lval );
  6919. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6920. END AssignSLALLoop;
  6921. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6922. BEGIN
  6923. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6924. END ":=";
  6925. (** REAL *)
  6926. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6927. VAR lval: REAL;
  6928. BEGIN
  6929. SYSTEM.GET( ladr, lval );
  6930. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6931. END AssignSRARLoop;
  6932. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6933. BEGIN
  6934. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6935. END ":=";
  6936. (** LONGREAL *)
  6937. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6938. VAR lval: LONGREAL;
  6939. BEGIN
  6940. SYSTEM.GET( ladr, lval );
  6941. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6942. END AssignSXAXLoop;
  6943. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6944. BEGIN
  6945. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6946. END ":=";
  6947. (** COMPLEX *)
  6948. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6949. VAR lval: COMPLEX;
  6950. BEGIN
  6951. SYSTEM.GET( ladr, lval );
  6952. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6953. END AssignSZAZLoop;
  6954. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6955. BEGIN
  6956. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6957. END ":=";
  6958. (** LONGCOMPLEX *)
  6959. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6960. VAR lvalRe, lvalIm: LONGREAL;
  6961. BEGIN
  6962. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6963. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6964. END AssignSLZALZLoop;
  6965. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6966. BEGIN
  6967. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6968. END ":=";
  6969. (*** matrix multipliation ********************************************************************)
  6970. PROCEDURE AllocateMatrix( dest: ADDRESS;
  6971. rows, cols, elementsize: LONGINT ): ANY;
  6972. VAR p: ANY;
  6973. BEGIN
  6974. (*
  6975. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  6976. *)
  6977. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  6978. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  6979. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6980. PutPtr( dest, p); RETURN p;
  6981. END AllocateMatrix;
  6982. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: LONGINT ): ANY;
  6983. VAR p: ANY;
  6984. BEGIN
  6985. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  6986. PutInc( dest, 0, elementsize ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  6987. PutPtr( dest, p ); RETURN p;
  6988. END AllocateVector;
  6989. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: LONGINT;
  6990. loop: BinaryAASLoop;
  6991. fast: FastMatMul ); (* Size= element-size *)
  6992. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  6993. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  6994. BEGIN
  6995. (*
  6996. <- 1 ->
  6997. xxx xxxx -> xxxx
  6998. ^ xxx xxxx xxxx
  6999. 0 xxx xxxx xxxx
  7000. v xxx xxxx
  7001. xxx xxxx
  7002. Len(..,1): #columns ; Inc(..,1): inc in rows
  7003. Len(..,0): #rows ; Inc(..,0): inc between rows
  7004. *)
  7005. (* apply multiplication D = L * R *)
  7006. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7007. colsL := GetLen( left, 1 ); (* # left columns *)
  7008. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7009. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7010. (* check geometric restriction *)
  7011. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7012. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7013. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7014. IF RangeFlag IN GetFlags( dest ) THEN
  7015. Halt( GeometryMismatch, left, right, dest )
  7016. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7017. END;
  7018. END;
  7019. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7020. IF overlap THEN
  7021. destOld := dest; destNew := 0;
  7022. p := AllocateSame( destNew, destOld, Size );
  7023. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7024. dest := destNew;
  7025. END;
  7026. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7027. HALT( 9999 )
  7028. END;
  7029. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7030. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7031. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7032. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7033. (*
  7034. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7035. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7036. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7037. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7038. *)
  7039. IF rowsL = 0 THEN RETURN
  7040. ELSIF colsL=0 THEN RETURN
  7041. ELSIF colsR=0 THEN RETURN
  7042. ELSIF (fast = NIL ) OR
  7043. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7044. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7045. radri := radr; dadri := dadr; colsRi := colsR;
  7046. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7047. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7048. INC( dadri, incD ); DEC( colsRi );
  7049. END;
  7050. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7051. END;
  7052. END;
  7053. IF overlap THEN CopyContent( destOld, dest, Size );
  7054. END;
  7055. END ApplyMatMulLoop;
  7056. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7057. Size: LONGINT; loop: BinaryAASLoop;
  7058. fast: FastMatMul ); (* Size= element-size *)
  7059. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7060. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7061. BEGIN
  7062. (*
  7063. <- 0 ->
  7064. xxx T(xxx) -> T(xxxxx)
  7065. xxx
  7066. 1 xxx
  7067. xxx
  7068. xxx
  7069. Len(..,0): #columns ; Inc(..,0): inc in rows
  7070. Len(..,1): #rows ; Inc(..,1): inc between rows
  7071. *)
  7072. (* check geometric restriction *)
  7073. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7074. Halt( GeometryMismatch, left, right,0 );
  7075. END;
  7076. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7077. l2 := GetLen( left, 1 ); (* inner loop len *)
  7078. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7079. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7080. IF RangeFlag IN GetFlags( dest ) THEN
  7081. Halt( GeometryMismatch, left, right, dest );
  7082. ELSE p := AllocateVector( dest, l1, Size );
  7083. END;
  7084. END;
  7085. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7086. IF overlap THEN
  7087. destOld := dest; destNew := 0;
  7088. p := AllocateSame( destNew, destOld, Size );
  7089. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7090. dest := destNew;
  7091. END;
  7092. (*
  7093. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7094. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7095. END;
  7096. *)
  7097. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7098. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7099. di0 := GetIncr( dest, 0 );
  7100. IF l1=0 THEN RETURN
  7101. ELSIF l2=0 THEN RETURN
  7102. ELSIF (fast = NIL ) OR
  7103. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7104. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7105. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7106. DEC( l1 );
  7107. END;
  7108. END;
  7109. IF overlap THEN CopyContent( destOld, dest, Size );
  7110. END;
  7111. END ApplyMatVecMulLoop;
  7112. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7113. Size: LONGINT; loop: BinaryAASLoop;
  7114. fast: FastMatMul ); (* Size= element-size *)
  7115. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7116. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7117. BEGIN
  7118. (*
  7119. <- 0 ->
  7120. xxx xxxx -> xxxx
  7121. xxxx
  7122. 1 xxxx
  7123. Len(..,0): #columns ; Inc(..,0): inc in rows
  7124. Len(..,1): #rows ; Inc(..,1): inc between rows
  7125. *)
  7126. (* check geometric restriction *)
  7127. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7128. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7129. l2 := GetLen( right, 0 ); (* inner loop len *)
  7130. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7131. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7132. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7133. ELSE p := AllocateVector( dest, l0, Size );
  7134. END;
  7135. END;
  7136. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7137. IF overlap THEN
  7138. destOld := dest; destNew := 0;
  7139. p := AllocateSame( destNew, destOld, Size );
  7140. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7141. dest := destNew;
  7142. END;
  7143. (*
  7144. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7145. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7146. END;
  7147. *)
  7148. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7149. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7150. di0 := GetIncr( dest, 0 );
  7151. IF l2=0 THEN RETURN
  7152. ELSIF l0=0 THEN RETURN
  7153. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7154. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7155. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7156. DEC( l0 );
  7157. END;
  7158. END;
  7159. IF overlap THEN CopyContent( destOld, dest, Size );
  7160. END;
  7161. END ApplyVecMatMulLoop;
  7162. (** SHORTINT *)
  7163. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7164. VAR lval, rval, dval: SHORTINT;
  7165. BEGIN
  7166. dval := 0;
  7167. WHILE (len > 0) DO
  7168. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7169. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7170. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7171. END;
  7172. SYSTEM.PUT( dadr, dval );
  7173. END MatMulASASLoop;
  7174. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7175. BEGIN
  7176. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7177. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7178. RETURN RESULT
  7179. END "*";
  7180. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7181. BEGIN
  7182. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7183. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7184. RETURN RESULT
  7185. END "*";
  7186. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7187. BEGIN
  7188. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7189. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7190. RETURN RESULT
  7191. END "*";
  7192. (** INTEGER *)
  7193. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7194. VAR lval, rval, dval: INTEGER;
  7195. BEGIN
  7196. dval := 0;
  7197. WHILE (len > 0) DO
  7198. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7199. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7200. END;
  7201. SYSTEM.PUT( dadr, dval );
  7202. END MatMulAIAILoop;
  7203. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7204. BEGIN
  7205. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7206. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7207. RETURN RESULT
  7208. END "*";
  7209. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7210. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7211. BEGIN
  7212. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7213. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7214. RETURN RESULT
  7215. END "*";
  7216. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7217. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7218. BEGIN
  7219. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7220. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7221. RETURN RESULT
  7222. END "*";
  7223. (** LONGINT *)
  7224. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7225. VAR lval, rval, dval: LONGINT;
  7226. BEGIN
  7227. dval := 0;
  7228. WHILE (len > 0) DO
  7229. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7230. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7231. END;
  7232. SYSTEM.PUT( dadr, dval );
  7233. END MatMulALALLoop;
  7234. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7235. BEGIN
  7236. (*
  7237. KernelLog.String("MatMulALAL");
  7238. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7239. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7240. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7241. KernelLog.Ln;
  7242. *)
  7243. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7244. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7245. RETURN RESULT
  7246. END "*";
  7247. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7248. BEGIN
  7249. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7250. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7251. RETURN RESULT
  7252. END "*";
  7253. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7254. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7255. BEGIN
  7256. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7257. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7258. RETURN RESULT
  7259. END "*";
  7260. (** REAL *)
  7261. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7262. VAR lval, rval, dval: REAL;
  7263. BEGIN
  7264. dval := 0;
  7265. WHILE (len > 0) DO
  7266. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7267. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7268. END;
  7269. SYSTEM.PUT( dadr, dval );
  7270. END MatMulARARLoop;
  7271. (*
  7272. Optimized for small matrices (Alexey Morozov)
  7273. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7274. *)
  7275. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7276. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7277. BEGIN
  7278. dadr := GetAdr(ADDRESSOF(RESULT));
  7279. ladr := GetAdr(ADDRESSOF(left));
  7280. radr := GetAdr(ADDRESSOF(right));
  7281. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7282. IF (ladr # dadr) & (radr # dadr) THEN
  7283. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7284. CASE SYSTEM.VAL(LONGINT,flags) OF
  7285. Mat2x2:
  7286. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7287. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7288. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7289. END;
  7290. END;
  7291. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7292. ELSE
  7293. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7294. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7295. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7296. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7297. END;
  7298. |Mat3x3:
  7299. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7300. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7301. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7302. END;
  7303. END;
  7304. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7305. ELSE
  7306. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7307. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7308. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7309. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7310. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7311. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7312. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7313. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7314. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7315. END;
  7316. |Mat4x4:
  7317. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7318. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7319. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7320. END;
  7321. END;
  7322. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7323. ELSE
  7324. 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];
  7325. 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];
  7326. 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];
  7327. 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];
  7328. 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];
  7329. 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];
  7330. 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];
  7331. 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];
  7332. 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];
  7333. 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];
  7334. 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];
  7335. 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];
  7336. 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];
  7337. 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];
  7338. 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];
  7339. 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];
  7340. END;
  7341. ELSE
  7342. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7343. loopMatMulARAR, matMulR );
  7344. END;
  7345. ELSE
  7346. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7347. loopMatMulARAR, matMulR );
  7348. END;
  7349. RETURN RESULT
  7350. END "*";
  7351. (*
  7352. Optimized for small arrays (Alexey Morozov)
  7353. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7354. *)
  7355. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7356. VAR
  7357. flags: SET; dadr, ladr, radr: LONGINT;
  7358. v0, v1, v2: REAL;
  7359. BEGIN
  7360. dadr := GetAdr(ADDRESSOF(RESULT));
  7361. ladr := GetAdr(ADDRESSOF(left));
  7362. radr := GetAdr(ADDRESSOF(right));
  7363. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7364. CASE SYSTEM.VAL(LONGINT,flags) OF
  7365. MatVec2x2:
  7366. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7367. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7368. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7369. END;
  7370. END;
  7371. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7372. ELSE
  7373. (* account possible overlapping *)
  7374. v0 := right[0];
  7375. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7376. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7377. END;
  7378. |MatVec3x3:
  7379. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7380. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7381. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7382. END;
  7383. END;
  7384. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7385. ELSE
  7386. (* account possible overlapping *)
  7387. v0 := right[0]; v1 := right[1];
  7388. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7389. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7390. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7391. END;
  7392. |MatVec4x4:
  7393. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7394. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7395. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7396. END;
  7397. END;
  7398. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7399. ELSE
  7400. (* account possible overlapping *)
  7401. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7402. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7403. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7404. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7405. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7406. END;
  7407. ELSE
  7408. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7409. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7410. END;
  7411. RETURN RESULT
  7412. END "*";
  7413. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7414. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7415. BEGIN
  7416. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7417. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7418. RETURN RESULT
  7419. END "*";
  7420. (** LONGREAL *)
  7421. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7422. VAR lval, rval, dval: LONGREAL;
  7423. BEGIN
  7424. dval := 0;
  7425. WHILE (len > 0) DO
  7426. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7427. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7428. END;
  7429. SYSTEM.PUT( dadr, dval );
  7430. END MatMulAXAXLoop;
  7431. (*
  7432. Optimized for small matrices (Alexey Morozov)
  7433. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7434. *)
  7435. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7436. VAR
  7437. flags: SET; dadr, ladr, radr: LONGINT;
  7438. BEGIN
  7439. dadr := GetAdr(ADDRESSOF(RESULT));
  7440. ladr := GetAdr(ADDRESSOF(left));
  7441. radr := GetAdr(ADDRESSOF(right));
  7442. IF (ladr # dadr) & (radr # dadr) THEN
  7443. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7444. CASE SYSTEM.VAL(LONGINT,flags) OF
  7445. Mat2x2:
  7446. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7447. IF dadr = 0 THEN NEW(RESULT,2,2);
  7448. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7449. END;
  7450. END;
  7451. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7452. ELSE
  7453. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7454. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7455. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7456. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7457. END;
  7458. |Mat3x3:
  7459. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7460. IF dadr = 0 THEN NEW(RESULT,3,3);
  7461. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7462. END;
  7463. END;
  7464. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7465. ELSE
  7466. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7467. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7468. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7469. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7470. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7471. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7472. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7473. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7474. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7475. END;
  7476. |Mat4x4:
  7477. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7478. IF dadr = 0 THEN NEW(RESULT,4,4);
  7479. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7480. END;
  7481. END;
  7482. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7483. ELSE
  7484. 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];
  7485. 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];
  7486. 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];
  7487. 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];
  7488. 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];
  7489. 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];
  7490. 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];
  7491. 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];
  7492. 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];
  7493. 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];
  7494. 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];
  7495. 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];
  7496. 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];
  7497. 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];
  7498. 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];
  7499. 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];
  7500. END;
  7501. ELSE
  7502. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7503. loopMatMulAXAX, matMulX );
  7504. END;
  7505. ELSE
  7506. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7507. loopMatMulAXAX, matMulX );
  7508. END;
  7509. RETURN RESULT
  7510. END "*";
  7511. (*
  7512. Optimized for small arrays (Alexey Morozov)
  7513. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7514. *)
  7515. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7516. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7517. VAR
  7518. flags: SET; dadr, ladr, radr: LONGINT;
  7519. v0, v1, v2: LONGREAL;
  7520. BEGIN
  7521. dadr := GetAdr(ADDRESSOF(RESULT));
  7522. ladr := GetAdr(ADDRESSOF(left));
  7523. radr := GetAdr(ADDRESSOF(right));
  7524. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7525. CASE SYSTEM.VAL(LONGINT,flags) OF
  7526. MatVec2x2:
  7527. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7528. IF dadr = 0 THEN NEW(RESULT,2);
  7529. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7530. END;
  7531. END;
  7532. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7533. ELSE
  7534. (* account possible overlapping *)
  7535. v0 := right[0];
  7536. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7537. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7538. END;
  7539. |MatVec3x3:
  7540. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7541. IF dadr = 0 THEN NEW(RESULT,3);
  7542. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7543. END;
  7544. END;
  7545. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7546. ELSE
  7547. (* account possible overlapping *)
  7548. v0 := right[0]; v1 := right[1];
  7549. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7550. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7551. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7552. END;
  7553. |MatVec4x4:
  7554. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7555. IF dadr = 0 THEN NEW(RESULT,4);
  7556. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7557. END;
  7558. END;
  7559. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7560. ELSE
  7561. (* account possible overlapping *)
  7562. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7563. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7564. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7565. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7566. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7567. END;
  7568. ELSE
  7569. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7570. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7571. END;
  7572. RETURN RESULT
  7573. END "*";
  7574. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7575. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7576. BEGIN
  7577. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7578. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7579. RETURN RESULT
  7580. END "*";
  7581. (** SHORTINT *)
  7582. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7583. VAR lval, rval, dval: SHORTINT;
  7584. BEGIN
  7585. SYSTEM.GET( dadr, dval );
  7586. WHILE (len > 0) DO
  7587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7588. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7589. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7590. END;
  7591. SYSTEM.PUT( dadr, dval );
  7592. END MatMulIncASASLoop;
  7593. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7594. BEGIN
  7595. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7596. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7597. RETURN RESULT
  7598. END "INCMUL";
  7599. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7600. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7601. BEGIN
  7602. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7603. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7604. RETURN RESULT
  7605. END "INCMUL";
  7606. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7607. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7608. BEGIN
  7609. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7610. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7611. RETURN RESULT
  7612. END "INCMUL";
  7613. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7614. BEGIN
  7615. RESULT := -RESULT;
  7616. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7617. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7618. RESULT := -RESULT;
  7619. RETURN RESULT
  7620. END "DECMUL";
  7621. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7622. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7623. BEGIN
  7624. RESULT := -RESULT;
  7625. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7626. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7627. RESULT := -RESULT;
  7628. RETURN RESULT
  7629. END "DECMUL";
  7630. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7631. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7632. BEGIN
  7633. RESULT := -RESULT;
  7634. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7635. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7636. RESULT := -RESULT;
  7637. RETURN RESULT
  7638. END "DECMUL";
  7639. (** INTEGER *)
  7640. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7641. VAR lval, rval, dval: INTEGER;
  7642. BEGIN
  7643. SYSTEM.GET( dadr, dval );
  7644. WHILE (len > 0) DO
  7645. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7646. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7647. END;
  7648. SYSTEM.PUT( dadr, dval );
  7649. END MatMulIncAIAILoop;
  7650. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7651. BEGIN
  7652. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7653. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7654. RETURN RESULT
  7655. END "INCMUL";
  7656. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7657. BEGIN
  7658. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7659. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7660. RETURN RESULT
  7661. END "INCMUL";
  7662. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7663. BEGIN
  7664. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7665. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7666. RETURN RESULT
  7667. END "INCMUL";
  7668. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7669. BEGIN
  7670. RESULT := -RESULT;
  7671. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7672. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7673. RESULT := -RESULT;
  7674. RETURN RESULT
  7675. END "DECMUL";
  7676. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7677. BEGIN
  7678. RESULT := -RESULT;
  7679. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7680. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7681. RESULT := -RESULT;
  7682. RETURN RESULT
  7683. END "DECMUL";
  7684. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7685. BEGIN
  7686. RESULT := -RESULT;
  7687. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7688. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7689. RESULT := -RESULT;
  7690. RETURN RESULT
  7691. END "DECMUL";
  7692. (** LONGINT *)
  7693. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7694. VAR lval, rval, dval: LONGINT;
  7695. BEGIN
  7696. SYSTEM.GET( dadr, dval );
  7697. WHILE (len > 0) DO
  7698. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7699. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7700. END;
  7701. SYSTEM.PUT( dadr, dval );
  7702. END MatMulIncALALLoop;
  7703. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7704. BEGIN
  7705. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7706. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7707. RETURN RESULT
  7708. END "INCMUL";
  7709. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7710. BEGIN
  7711. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7712. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7713. RETURN RESULT
  7714. END "INCMUL";
  7715. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7716. BEGIN
  7717. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7718. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7719. RETURN RESULT
  7720. END "INCMUL";
  7721. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7722. BEGIN
  7723. RESULT := -RESULT;
  7724. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7725. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7726. RESULT := -RESULT;
  7727. RETURN RESULT
  7728. END "DECMUL";
  7729. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7730. BEGIN
  7731. RESULT := -RESULT;
  7732. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7733. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7734. RESULT := -RESULT;
  7735. RETURN RESULT
  7736. END "DECMUL";
  7737. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7738. BEGIN
  7739. RESULT := -RESULT;
  7740. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7741. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7742. RESULT := -RESULT;
  7743. RETURN RESULT
  7744. END "DECMUL";
  7745. (** REAL *)
  7746. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7747. VAR lval, rval, dval: REAL;
  7748. BEGIN
  7749. SYSTEM.GET( dadr, dval );
  7750. WHILE (len > 0) DO
  7751. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7752. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7753. END;
  7754. SYSTEM.PUT( dadr, dval );
  7755. END MatMulIncARARLoop;
  7756. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7757. BEGIN
  7758. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7759. loopMatMulIncARAR, matMulIncR );
  7760. RETURN RESULT
  7761. END "INCMUL";
  7762. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7763. BEGIN
  7764. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7765. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7766. RETURN RESULT
  7767. END "INCMUL";
  7768. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7769. BEGIN
  7770. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7771. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7772. RETURN RESULT
  7773. END "INCMUL";
  7774. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7775. BEGIN
  7776. RESULT := -RESULT;
  7777. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7778. loopMatMulIncARAR, matMulIncR );
  7779. RESULT := -RESULT;
  7780. RETURN RESULT
  7781. END "DECMUL";
  7782. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7783. BEGIN
  7784. RESULT := -RESULT;
  7785. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7786. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7787. RESULT := -RESULT;
  7788. RETURN RESULT
  7789. END "DECMUL";
  7790. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7791. BEGIN
  7792. RESULT := -RESULT;
  7793. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7794. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7795. RESULT := -RESULT;
  7796. RETURN RESULT
  7797. END "DECMUL";
  7798. (** LONGREAL *)
  7799. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7800. VAR lval, rval, dval: LONGREAL;
  7801. BEGIN
  7802. SYSTEM.GET( dadr, dval );
  7803. WHILE (len > 0) DO
  7804. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7805. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7806. END;
  7807. SYSTEM.PUT( dadr, dval );
  7808. END MatMulIncAXAXLoop;
  7809. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7810. BEGIN
  7811. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7812. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7813. RETURN RESULT
  7814. END "INCMUL";
  7815. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7816. BEGIN
  7817. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7818. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7819. RETURN RESULT
  7820. END "INCMUL";
  7821. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7822. BEGIN
  7823. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7824. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7825. RETURN RESULT
  7826. END "INCMUL";
  7827. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7828. BEGIN
  7829. RESULT := -RESULT;
  7830. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7831. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7832. RESULT := -RESULT;
  7833. RETURN RESULT
  7834. END "DECMUL";
  7835. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7836. BEGIN
  7837. RESULT := -RESULT;
  7838. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7839. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7840. RESULT := -RESULT;
  7841. RETURN RESULT
  7842. END "DECMUL";
  7843. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7844. BEGIN
  7845. RESULT := -RESULT;
  7846. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7847. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7848. RESULT := -RESULT;
  7849. RETURN RESULT
  7850. END "DECMUL";
  7851. (*** Cross product ********************************************************************)
  7852. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7853. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7854. BEGIN
  7855. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7856. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7857. END;
  7858. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7859. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7860. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7861. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7862. RETURN RESULT
  7863. END "*";
  7864. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7865. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7866. BEGIN
  7867. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7868. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7869. END;
  7870. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7871. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7872. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7873. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7874. RETURN RESULT
  7875. END "*";
  7876. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7877. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7878. BEGIN
  7879. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7880. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7881. END;
  7882. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7883. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7884. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7885. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7886. RETURN RESULT
  7887. END "*";
  7888. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7889. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7890. BEGIN
  7891. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7892. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7893. END;
  7894. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7895. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7896. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7897. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7898. RETURN RESULT
  7899. END "*";
  7900. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7901. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7902. BEGIN
  7903. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7904. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7905. END;
  7906. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7907. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7908. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7909. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7910. RETURN RESULT
  7911. END "*";
  7912. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  7913. VAR tensor: Tensor;
  7914. BEGIN
  7915. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7916. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7917. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7918. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7919. ELSE HALT(200);
  7920. END;
  7921. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  7922. loopMatMulAXAX, matMulX );
  7923. RETURN RESULT
  7924. END "*";
  7925. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  7926. BEGIN
  7927. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7928. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7929. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7930. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7931. ELSE HALT(200);
  7932. END;
  7933. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  7934. loopMatMulARAR, matMulR );
  7935. RETURN RESULT
  7936. END "*";
  7937. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  7938. BEGIN
  7939. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7940. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7941. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7942. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7943. ELSE HALT(200);
  7944. END;
  7945. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  7946. MatMulALALLoop, NIL );
  7947. RETURN RESULT
  7948. END "*";
  7949. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  7950. BEGIN
  7951. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7952. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7953. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7954. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7955. ELSE HALT(200);
  7956. END;
  7957. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  7958. MatMulAIAILoop,NIL );
  7959. RETURN RESULT
  7960. END "*";
  7961. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  7962. BEGIN
  7963. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7964. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7965. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7966. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7967. ELSE HALT(200);
  7968. END;
  7969. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  7970. MatMulASASLoop, NIL );
  7971. RETURN RESULT
  7972. END "*";
  7973. (** Transpose ********************************************************************)
  7974. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  7975. VAR from1, from2, to1, to2: ADDRESS; dim: LONGINT;
  7976. BEGIN
  7977. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7978. dim := GetDim( src1 ) - 1;
  7979. WHILE (dim > 0) DO
  7980. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7981. END;
  7982. dim := GetDim( src2 ) - 1;
  7983. WHILE (dim > 0) DO
  7984. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7985. END;
  7986. IF from1 < from2 THEN RETURN to1 >= from2;
  7987. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7988. ELSE RETURN TRUE;
  7989. END;
  7990. END Overlap;
  7991. (*
  7992. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  7993. VAR from1, from2, to1, to2: ADDRESS;
  7994. BEGIN
  7995. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7996. DEC( dim );
  7997. WHILE (dim > 0) DO
  7998. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  7999. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8000. END;
  8001. IF from1 < from2 THEN RETURN to1 >= from2;
  8002. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8003. ELSE RETURN TRUE;
  8004. END;
  8005. END Overlap;
  8006. *)
  8007. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8008. VAR ptr, data: ANY; Size: LONGINT;
  8009. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8010. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  8011. VAR dim,max: LONGINT;
  8012. BEGIN
  8013. dim := GetDim( l );
  8014. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8015. max := dim-1;
  8016. WHILE (dim > 0) DO
  8017. DEC( dim );
  8018. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8019. END;
  8020. RETURN TRUE;
  8021. END TransposedShape;
  8022. PROCEDURE NewData;
  8023. VAR max,dim, len, size: LONGINT;
  8024. BEGIN
  8025. dim := GetDim( src ); size := elementsize;
  8026. PutDim( dest, dim );
  8027. PutSize( dest, elementsize );
  8028. max := dim-1;
  8029. WHILE (dim > 0) DO
  8030. DEC( dim );
  8031. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8032. PutInc( dest, dim, size ); size := size * len;
  8033. END;
  8034. SYSTEM.NEW( data, size );
  8035. PutAdr( dest, data );
  8036. PutPtr( dest, data );
  8037. END NewData;
  8038. BEGIN
  8039. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8040. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8041. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8042. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8043. PutFlags(dest, {TensorFlag});
  8044. NewData();
  8045. RETURN ptr;
  8046. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8047. (* check if re-allocation of descriptor is allowed *)
  8048. IF ~(TensorFlag IN GetFlags( dest )) &
  8049. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8050. HALT( 100 );
  8051. END;
  8052. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8053. PutFlags(dest, {TensorFlag});
  8054. NewData(); RETURN ptr;
  8055. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8056. (* check if re-allocation of array data is allowed *)
  8057. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8058. HALT( 100 );
  8059. END;
  8060. NewData();
  8061. RETURN data;
  8062. ELSE (* nothing to do *)
  8063. RETURN NIL;
  8064. END;
  8065. END AllocateTransposed;
  8066. PROCEDURE Transpose*( dest, left: ADDRESS; Size: LONGINT );
  8067. VAR len0, len1, linc0, linc1, dinc0, dinc1, ladr, dadr: LONGINT; p: ANY;
  8068. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8069. BEGIN
  8070. WHILE (len > 0) DO
  8071. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8072. DEC( len );
  8073. END;
  8074. END CopyLoop;
  8075. BEGIN
  8076. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8077. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8078. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8079. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8080. ELSE
  8081. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8082. p := AllocateTransposed(dest,left,Size);
  8083. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8084. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8085. dadr := SYSTEM.VAL( LONGINT, p ); linc0 := GetIncr( left, 0 );
  8086. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8087. WHILE (len0 > 0) DO
  8088. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8089. INC( dadr, dinc0 ); DEC( len0 );
  8090. END;
  8091. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8092. ladr := SYSTEM.VAL( LONGINT, p );
  8093. ELSE
  8094. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8095. END;
  8096. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8097. dadr := GetAdr( dest );
  8098. IF (Size = 4) & (transpose4 # NIL ) THEN
  8099. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8100. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8101. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8102. ELSE
  8103. WHILE (len0 > 0) DO
  8104. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8105. INC( dadr, dinc1 ); DEC( len0 );
  8106. END;
  8107. END;
  8108. END;
  8109. END Transpose;
  8110. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8111. BEGIN
  8112. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8113. RETURN RESULT
  8114. END "`";
  8115. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8116. BEGIN
  8117. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8118. RETURN RESULT
  8119. END "`";
  8120. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8121. BEGIN
  8122. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8123. RETURN RESULT
  8124. END "`";
  8125. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8126. BEGIN
  8127. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8128. RETURN RESULT
  8129. END "`";
  8130. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8131. BEGIN
  8132. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8133. RETURN RESULT
  8134. END "`";
  8135. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: LONGINT ): BOOLEAN;
  8136. VAR i: LONGINT;
  8137. BEGIN
  8138. FOR i := 0 TO rdim - 1 DO
  8139. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8140. END;
  8141. FOR i := 0 TO ldim - 1 DO
  8142. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8143. END;
  8144. RETURN TRUE;
  8145. END CheckTensorGeometry;
  8146. (*
  8147. PROCEDURE Zero(p: ANY; size: LONGINT);
  8148. VAR adr: LONGINT;
  8149. BEGIN
  8150. adr := SYSTEM.VAL(LONGINT,p);
  8151. WHILE(size>0) DO
  8152. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8153. END;
  8154. END Zero;
  8155. *)
  8156. PROCEDURE DoReshape*( VAR dest: LONGINT; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8157. VAR i, Size: LONGINT; ptr, data: ANY; new: ADDRESS;
  8158. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8159. squeezingReshape: BOOLEAN;
  8160. PROCEDURE NewDescriptor;
  8161. BEGIN
  8162. ptr := GetArrayDesc( newDim ); new := ptr;
  8163. END NewDescriptor;
  8164. (* Added by Alexey
  8165. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8166. *)
  8167. PROCEDURE SqueezingReshape(): BOOLEAN;
  8168. VAR
  8169. i, j, n: LONGINT;
  8170. BEGIN
  8171. IF oldDim > newDim THEN
  8172. i := 0; j := 0;
  8173. WHILE (i < oldDim) & (j < newDim) DO
  8174. n := GetLen(src,i);
  8175. IF n = shape[j] THEN INC(j); END;
  8176. INC(i);
  8177. END;
  8178. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8179. ELSE
  8180. squeezingReshape := FALSE;
  8181. END;
  8182. squeezingReshape := (i = oldDim) & (j = newDim);
  8183. RETURN squeezingReshape;
  8184. END SqueezingReshape;
  8185. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8186. PROCEDURE TargetContinuous(): BOOLEAN;
  8187. VAR
  8188. i, n: LONGINT;
  8189. continue: BOOLEAN;
  8190. BEGIN
  8191. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8192. continue := TRUE;
  8193. WHILE (i > 0) & continue DO
  8194. n := n * GetLen(dest,i);
  8195. DEC(i);
  8196. continue := GetIncr(dest,i) = n;
  8197. END;
  8198. (*TRACE(i,continue,Size,GetSize(dest));*)
  8199. (*tod obviously size is not what I expect it to be*)
  8200. IF (i = 0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8201. RETURN TRUE;
  8202. ELSE
  8203. RETURN FALSE;
  8204. END;
  8205. END TargetContinuous;
  8206. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8207. PROCEDURE PreservesContiguity(): BOOLEAN;
  8208. VAR
  8209. i, n: LONGINT;
  8210. continue: BOOLEAN;
  8211. BEGIN
  8212. i := oldDim-1; n := GetIncr(src,i);
  8213. continue := TRUE;
  8214. WHILE (i > 0) & continue DO
  8215. n := n * GetLen(src,i);
  8216. DEC(i);
  8217. continue := GetIncr(src,i) = n;
  8218. END;
  8219. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8220. RETURN TRUE;
  8221. ELSE Err("Not yet implemented!");
  8222. END;
  8223. END PreservesContiguity;
  8224. (* Added by Alexey *)
  8225. PROCEDURE NewDescriptorForSameData;
  8226. VAR len, size, i, j: LONGINT;
  8227. BEGIN
  8228. ptr := GetArrayDesc( newDim ); new := ptr;
  8229. IF ~squeezingReshape THEN
  8230. size := Size;
  8231. FOR i := newDim - 1 TO 0 BY -1 DO
  8232. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8233. size := size * len;
  8234. END;
  8235. ELSE (* squeezing reshape *)
  8236. j := 0; len := shape[j];
  8237. FOR i := 0 TO oldDim-1 DO
  8238. IF GetLen(src,i) = len THEN
  8239. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8240. INC(j);
  8241. IF j < newDim THEN len := shape[j]; END;
  8242. END;
  8243. END;
  8244. END;
  8245. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8246. PutFlags(new,GetFlags(new)+{RangeFlag});
  8247. END;
  8248. PutAdr( new, GetAdr(src) );
  8249. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8250. PutSize( new, Size );
  8251. END NewDescriptorForSameData;
  8252. PROCEDURE NewData;
  8253. VAR len, size, i: LONGINT;
  8254. BEGIN
  8255. size := Size;
  8256. FOR i := newDim - 1 TO 0 BY -1 DO
  8257. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8258. size := size * len;
  8259. END;
  8260. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8261. PutAdr( new, data );
  8262. PutPtr( new, data ); PutDim( new, newDim );
  8263. PutSize( new, Size );
  8264. END NewData;
  8265. PROCEDURE CopyData;
  8266. VAR d, s, dadr: LONGINT;
  8267. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8268. VAR inc, len, i: LONGINT;
  8269. BEGIN
  8270. IF dim = d THEN
  8271. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8272. FOR i := 0 TO len - 1 DO
  8273. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8274. END;
  8275. ELSE
  8276. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8277. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8278. END;
  8279. END Loop;
  8280. BEGIN
  8281. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8282. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8283. s := s * GetLen( src, d ); DEC( d );
  8284. END;
  8285. IF d = -1 THEN (* special case: both continuous *)
  8286. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8287. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8288. END;
  8289. END CopyData;
  8290. PROCEDURE CopyDataBack;
  8291. VAR d, s: LONGINT; sadr: LONGINT;
  8292. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8293. VAR inc, len, i: LONGINT;
  8294. BEGIN
  8295. IF dim = d THEN
  8296. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8297. FOR i := 0 TO len - 1 DO
  8298. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8299. END;
  8300. ELSE
  8301. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8302. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8303. END;
  8304. END Loop;
  8305. BEGIN
  8306. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8307. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8308. s := s * GetLen( dest, d ); DEC( d );
  8309. END;
  8310. IF d = -1 THEN (* special case: both continuous *)
  8311. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8312. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8313. END;
  8314. END CopyDataBack;
  8315. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8316. BEGIN
  8317. ASSERT( GetDim( src ) = GetDim( dest ) );
  8318. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8319. END CopyDescriptor;
  8320. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8321. VAR i: LONGINT;
  8322. BEGIN
  8323. ASSERT(GetDim(dest) = newDim);
  8324. FOR i := 0 TO newDim - 1 DO
  8325. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8326. END;
  8327. RETURN FALSE;
  8328. END ShapeDiffers;
  8329. BEGIN
  8330. (*
  8331. cases
  8332. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8333. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8334. 3.) descriptor may not be reshaped: dest = RANGE
  8335. *)
  8336. (* first check invariants *)
  8337. oldDim := GetDim( src );
  8338. IF oldDim = 0 THEN oldSize := 0
  8339. ELSE
  8340. oldSize := 1;
  8341. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8342. END;
  8343. newDim := LEN( shape, 0 );
  8344. IF newDim = 0 THEN newSize := 0
  8345. ELSE
  8346. newSize := 1;
  8347. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8348. END;
  8349. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8350. Size := GetSize( src );
  8351. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8352. IF dest = src THEN (* added by Alexey *)
  8353. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8354. NewDescriptorForSameData;
  8355. dest := new;
  8356. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8357. (* create a copy of the original descriptor *)
  8358. ptr := GetArrayDesc(newDim); dest := ptr; CopyDescriptor(src,dest);
  8359. ELSE
  8360. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8361. END;
  8362. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8363. NewDescriptor; NewData; CopyData; dest := new;
  8364. ELSIF TargetContinuous() THEN
  8365. NewDescriptor; new:=dest; CopyData;
  8366. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8367. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8368. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8369. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8370. END;
  8371. NewDescriptor; NewData; CopyData; dest := new;
  8372. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8373. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8374. NewDescriptor; NewData; CopyData; CopyDescriptor( new, dest );
  8375. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8376. NewDescriptor; NewData; CopyData; CopyDataBack;
  8377. ELSE (* same shape, just copy *)
  8378. CopyContent( src, dest, Size ); RETURN;
  8379. END;
  8380. END DoReshape;
  8381. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8382. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8383. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8384. PROCEDURE NewData;
  8385. VAR len, size, i: SIZE;
  8386. BEGIN
  8387. size := elementSize;
  8388. FOR i := dim - 1 TO 0 BY -1 DO
  8389. len := a[i];
  8390. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8391. END;
  8392. IF tag = 0 THEN
  8393. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8394. dest.adr := data;
  8395. ELSE
  8396. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8397. dest.adr := data + ArrDataArrayOffset;
  8398. END;
  8399. dest.ptr := data;
  8400. PutSize( dest, elementSize );
  8401. END NewData;
  8402. PROCEDURE ClearData;
  8403. (*! todo *)
  8404. END ClearData;
  8405. BEGIN
  8406. dim := LEN( a,0 );
  8407. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8408. IF dest # 0 THEN
  8409. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8410. END;
  8411. descr := GetArrayDesc( LEN( a,0 ) );
  8412. dest := descr;
  8413. NewData;
  8414. ELSE
  8415. i := 0;
  8416. WHILE (i < dim) & same DO
  8417. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8418. INC( i );
  8419. END;
  8420. IF ~same THEN
  8421. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8422. NewData
  8423. ELSE ClearData
  8424. END;
  8425. END;
  8426. END AllocateTensorA;
  8427. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8428. BEGIN
  8429. AllocateTensorA(a,elementSize,tag,dest);
  8430. END AllocateArrayA;
  8431. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: SIZE; tag: ADDRESS );
  8432. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: SIZE; dest: ADDRESS;
  8433. PROCEDURE NewData;
  8434. VAR len, size: SIZE; i: LONGINT;
  8435. BEGIN
  8436. size := Size;
  8437. FOR i := dim - 1 TO 0 BY -1 DO
  8438. len := a[i];
  8439. (*
  8440. KernelLog.Int(len,10); KernelLog.Ln;
  8441. *)
  8442. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8443. END;
  8444. IF tag = 0 THEN
  8445. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8446. PutAdr( dest, data );
  8447. ELSE
  8448. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8449. PutAdr( dest, data+ ArrDataArrayOffset );
  8450. END;
  8451. PutPtr( dest, data ); PutSize( dest, Size );
  8452. END NewData;
  8453. PROCEDURE ClearData;
  8454. (*! todo *)
  8455. END ClearData;
  8456. BEGIN
  8457. dim := LEN( a,0 );
  8458. dest := SYSTEM.VAL(ADDRESS,destA);
  8459. (*! check range flag! *)
  8460. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8461. IF dest # 0 THEN
  8462. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8463. END;
  8464. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8465. NewData;
  8466. ELSE
  8467. i := 0;
  8468. WHILE (i < dim) & same DO
  8469. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8470. INC( i );
  8471. END;
  8472. IF ~same THEN
  8473. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8474. NewData
  8475. ELSE ClearData
  8476. END;
  8477. END;
  8478. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8479. END AllocateTensorX;
  8480. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8481. VAR dim, i: LONGINT;
  8482. BEGIN
  8483. dim := GetDim( src );
  8484. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8485. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8486. END LenA;
  8487. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8488. VAR dim, len: SIZE; i: LONGINT;
  8489. BEGIN
  8490. dim := GetDim( src ); len := LEN( dest, 0 );
  8491. IF len # dim THEN NEW( dest, dim ); END;
  8492. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8493. END IncrA;
  8494. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8495. VAR dim: SIZE;
  8496. BEGIN
  8497. dim := GetDim(src);
  8498. IF (d<0) OR (d>=dim) THEN HALT(100)
  8499. ELSE
  8500. RETURN GetLen(src,d);
  8501. END;
  8502. END Len;
  8503. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8504. VAR dim: SIZE;
  8505. BEGIN
  8506. dim := GetDim(src);
  8507. IF (d<0) OR (d>=dim) THEN HALT(100)
  8508. ELSE
  8509. RETURN GetIncr(src,d);
  8510. END;
  8511. END Incr;
  8512. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8513. Size: SIZE ): ANY;
  8514. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8515. PROCEDURE NewData;
  8516. VAR len, size, i: SIZE;
  8517. BEGIN
  8518. size := 1;
  8519. FOR i := 0 TO ldim - 1 DO
  8520. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8521. END;
  8522. FOR i := 0 TO rdim - 1 DO
  8523. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8524. END;
  8525. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8526. (*
  8527. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8528. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8529. *)
  8530. size := Size;
  8531. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8532. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8533. END;
  8534. PutAdr( dest, data );
  8535. PutPtr( dest, data );
  8536. END NewData;
  8537. BEGIN
  8538. ldim := GetDim( left ); rdim := GetDim( right );
  8539. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8540. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8541. NewData(); RETURN ptr;
  8542. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8543. IF ~(TensorFlag IN GetFlags( dest )) &
  8544. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8545. HALT( 100 );
  8546. END;
  8547. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8548. NewData(); RETURN ptr;
  8549. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8550. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8551. HALT( 100 );
  8552. END;
  8553. NewData(); RETURN data;
  8554. END;
  8555. RETURN NIL;
  8556. END AllocateTensor;
  8557. (* 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 *)
  8558. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8559. VAR rdim, len, linc, ri: SIZE );
  8560. (* geometric precondition: lengths must coincide *)
  8561. VAR ldim: LONGINT;
  8562. BEGIN
  8563. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8564. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8565. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8566. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8567. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8568. END;
  8569. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8570. DEC( ldim );
  8571. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8572. (GetIncr( right, rdim ) = len * ri) DO
  8573. len := len * GetLen( left, ldim );
  8574. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8575. DEC( ldim );
  8576. END;
  8577. INC( ldim ); INC( rdim );
  8578. IF debug THEN
  8579. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8580. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8581. END;
  8582. END FindPatternTensor;
  8583. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  8584. Loop: BinaryASALoop );
  8585. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8586. origdest: LONGINT; left, right, dest: ADDRESS;
  8587. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: LONGINT );
  8588. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8589. BEGIN
  8590. IF (ldim < lDim) THEN
  8591. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8592. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8593. WHILE (len > 0) DO
  8594. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8595. INC( dadr, dinc ); DEC( len );
  8596. END;
  8597. ELSIF (rdim # loopd) THEN
  8598. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8599. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8600. WHILE (len > 0) DO
  8601. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8602. INC( dadr, dinc ); DEC( len );
  8603. END;
  8604. ELSE
  8605. (*
  8606. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8607. KernelLog.Int(GetAdr(dest),10);
  8608. KernelLog.Int(GetAdr(dest)+clen,10);
  8609. KernelLog.Ln;
  8610. *)
  8611. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8612. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8613. END;
  8614. END Traverse;
  8615. BEGIN
  8616. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8617. (* check array lengths *)
  8618. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8619. p := AllocateTensor( dest, left, right, elementSize );
  8620. (*
  8621. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8622. p := AllocateTensor( left, right, dest, elementSize )
  8623. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8624. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8625. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8626. END;
  8627. (*! to be done: treat overlapping memory *)
  8628. END;
  8629. *)
  8630. (* debugging *)
  8631. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8632. (* check pattern: longest piece that can be done with a loop *)
  8633. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8634. (* run through dimensions *)
  8635. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8636. SYSTEM.PUT( d, dest );
  8637. END ApplyTensorAAAOp;
  8638. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8639. BEGIN
  8640. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8641. SIZEOF( SHORTINT ), MulASSSLoop );
  8642. RETURN RESULT
  8643. END "**";
  8644. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8645. BEGIN
  8646. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8647. SIZEOF( INTEGER ), MulAISILoop );
  8648. RETURN RESULT
  8649. END "**";
  8650. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8651. BEGIN
  8652. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8653. SIZEOF( LONGINT ), MulALSLLoop );
  8654. RETURN RESULT
  8655. END "**";
  8656. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8657. BEGIN
  8658. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8659. loopMulARSR );
  8660. RETURN RESULT
  8661. END "**";
  8662. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8663. BEGIN
  8664. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8665. SIZEOF( LONGREAL ), loopMulAXSX );
  8666. RETURN RESULT
  8667. END "**";
  8668. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8669. BEGIN
  8670. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8671. loopMulAZSZ );
  8672. RETURN RESULT
  8673. END "**";
  8674. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8675. BEGIN
  8676. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8677. loopMulALZSLZ );
  8678. RETURN RESULT
  8679. END "**";
  8680. PROCEDURE InitOptimization;
  8681. VAR p: PROCEDURE;
  8682. BEGIN
  8683. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8684. IF p # NIL THEN
  8685. p;
  8686. ELSE
  8687. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8688. END;
  8689. END InitOptimization;
  8690. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8691. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: ADDRESS;
  8692. BEGIN
  8693. IF src = 0 THEN
  8694. HALT(100);
  8695. ELSE
  8696. srcDim := GetDim(src);
  8697. destDim := srcDim - prefixIndices - suffixIndices;
  8698. (*
  8699. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8700. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8701. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8702. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8703. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8704. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8705. *)
  8706. destPtr := GetArrayDesc(destDim);
  8707. dest := SYSTEM.VAL(LONGINT,destPtr);
  8708. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8709. PutAdr(dest,GetAdr(src));
  8710. PutPtr(dest,GetPtr(src));
  8711. PutFlags(dest,GetFlags(src));
  8712. PutSize(dest,GetSize(src));
  8713. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8714. srcDim := i + prefixIndices + prefixRanges;
  8715. destDim := i + prefixRanges;
  8716. len := GetLen(src,srcDim);
  8717. incr := GetIncr(src,srcDim);
  8718. PutLen(dest,destDim,len);
  8719. PutInc(dest,destDim,incr);
  8720. END;
  8721. (*
  8722. Report("copy descriptor src",src);
  8723. Report("copy descriptor dest",dest);
  8724. *)
  8725. END;
  8726. END CopyDescriptor;
  8727. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8728. VAR dest: ARRAY [?] OF basetype
  8729. CONST src: ARRAY [?] OF basetype
  8730. CONST shape: ARRAY [*] OF LONGINT
  8731. *)
  8732. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8733. BEGIN
  8734. DoReshape(SYSTEM.VAL(LONGINT,RESULT), SYSTEM.VAL(LONGINT,left), right);
  8735. RETURN RESULT
  8736. END Reshape;
  8737. (* OLIVIER *)
  8738. (** creates a degenerated range from an integer.
  8739. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8740. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8741. **)
  8742. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8743. BEGIN RETURN (integer .. integer BY 1)
  8744. END RangeFromInteger;
  8745. (* OLIVIER *)
  8746. (** create an array with the same data but with more dimensions
  8747. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8748. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8749. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8750. e.g.:
  8751. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8752. performs the following type transformation:
  8753. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8754. **)
  8755. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8756. VAR
  8757. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8758. sourceADDRESS, targetADDRESS: LONGINT;
  8759. targetArrayDescriptor: ANY;
  8760. BEGIN
  8761. sourceADDRESS := SYSTEM.VAL(LONGINT, sourceArray);
  8762. targetDimensionality := LEN(keptDimensions, 0);
  8763. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8764. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8765. targetADDRESS := SYSTEM.VAL(LONGINT, RESULT);
  8766. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8767. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8768. PutFlags(targetADDRESS, {TensorFlag});
  8769. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8770. (* set increments and lengths *)
  8771. sourceIndex := 0;
  8772. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8773. IF keptDimensions[targetIndex] THEN
  8774. (* reuse length and increment from source array *)
  8775. ASSERT(sourceIndex < DIM(sourceArray));
  8776. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8777. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8778. INC(sourceIndex)
  8779. ELSE
  8780. (* set length = 1 and increment = 0 *)
  8781. PutLen(targetADDRESS, targetIndex, 1);
  8782. PutInc(targetADDRESS, targetIndex, 0);
  8783. END
  8784. END;
  8785. (* Report("expand dimensions: ", targetADDRESS); *)
  8786. RETURN RESULT
  8787. END ExpandDimensions;
  8788. (* index ranges *)
  8789. (* the length of a range, i.e. the number of indices that it stands for *)
  8790. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8791. VAR
  8792. temp, result: LONGINT;
  8793. BEGIN
  8794. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8795. (* invalid range *)
  8796. result := 0
  8797. ELSIF LAST(range) = MAX(LONGINT) THEN
  8798. (* open-ended range *)
  8799. result := MAX(LONGINT)
  8800. ELSE
  8801. temp := 1 + LAST(range) - FIRST(range);
  8802. result := temp DIV STEP(range);
  8803. IF (temp MOD STEP(range)) # 0 THEN
  8804. INC(result)
  8805. END
  8806. END;
  8807. RETURN result
  8808. END "LEN";
  8809. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8810. BEGIN
  8811. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8812. RETURN RESULT;
  8813. END "ALL";
  8814. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8815. BEGIN
  8816. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8817. RETURN RESULT;
  8818. END "ALL";
  8819. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8820. BEGIN
  8821. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8822. RETURN RESULT;
  8823. END "ALL";
  8824. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8825. BEGIN
  8826. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8827. RETURN RESULT;
  8828. END "ALL";
  8829. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8830. BEGIN
  8831. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8832. RETURN RESULT;
  8833. END "ALL";
  8834. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8835. BEGIN
  8836. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8837. RETURN RESULT;
  8838. END "ALL";
  8839. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8840. BEGIN
  8841. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8842. RETURN RESULT;
  8843. END "ALL";
  8844. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8845. BEGIN
  8846. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8847. RETURN RESULT;
  8848. END "ALL";
  8849. BEGIN
  8850. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8851. END FoxArrayBase.
  8852. Compiler.Compile FoxArrayBase.Mod ~
  8853. SystemTools.ListModules