FoxArrayBase.Mod 350 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. LenType = SIZE; (* should be SIZE but for legacy reasons we have to use this *)
  23. CONST
  24. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  25. statistics= FALSE;
  26. conservative=TRUE;
  27. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(ADDRESS);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. ArrayAlignment=8;
  40. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  41. down = 0; up = 1; (* memory copy modes *)
  42. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  43. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  44. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  45. Size2Flag = 4; (* size = 2 *)
  46. Size3Flag = 5; (* size = 3 *)
  47. Size4Flag = 6; (* size = 4 *)
  48. Size5Flag = 7; (* size = 5 *)
  49. Size6Flag = 8; (* size = 6 *)
  50. Size7Flag = 9; (* size = 7 *)
  51. Size8Flag = 10; (* size = 8 *)
  52. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  53. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  54. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  55. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  56. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  57. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  58. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  59. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  60. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  61. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  62. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  63. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  64. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  65. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  66. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  67. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  68. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  69. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  70. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  71. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  72. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  73. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  74. TYPE
  75. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  76. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  77. LenInc* = RECORD
  78. len*: SIZE;
  79. inc*: SIZE
  80. END;
  81. ArrayDescriptor*= RECORD
  82. ptr*: ANY;
  83. adr*: ADDRESS;
  84. flags*: SET;
  85. dim*: SIZE;
  86. elementSize*: SIZE;
  87. END;
  88. Tensor = POINTER TO ArrayDescriptor;
  89. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  90. lens*: ARRAY 8 OF LenInc;
  91. END;
  92. A0 = RECORD(ArrayDescriptor) END;
  93. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  94. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  95. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  96. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  97. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  98. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  99. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  100. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  101. T0 = POINTER TO A0;
  102. T1 = POINTER TO A1;
  103. T2 = POINTER TO A2;
  104. T3 = POINTER TO A3;
  105. T4 = POINTER TO A4;
  106. T5 = POINTER TO A5;
  107. T6 = POINTER TO A6;
  108. T7 = POINTER TO A7;
  109. T8 = POINTER TO A8;
  110. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  111. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  112. VAR
  113. temporary*: T0;
  114. alloc*: LONGINT; (* statistics *)
  115. allocTemp*: LONGINT; (* statistics *)
  116. (* procedures that might be replaced by ASM methods *)
  117. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  118. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  119. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  120. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  121. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  122. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  123. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  124. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  125. transpose4*: TransposeP; transpose8*: TransposeP;
  126. (* optimizations for small arrays (Alexey Morozov) *)
  127. matMulR2x2*: SmallMatMul;
  128. matMulR3x3*: SmallMatMul;
  129. matMulR4x4*: SmallMatMul;
  130. matVecMulR2x2*: SmallMatMul;
  131. matVecMulR3x3*: SmallMatMul;
  132. matVecMulR4x4*: SmallMatMul;
  133. matMulLR2x2*: SmallMatMul;
  134. matMulLR3x3*: SmallMatMul;
  135. matMulLR4x4*: SmallMatMul;
  136. matVecMulLR2x2*: SmallMatMul;
  137. matVecMulLR3x3*: SmallMatMul;
  138. matVecMulLR4x4*: SmallMatMul;
  139. (*
  140. TensorTypePool: ARRAY 32 OF TensorType;
  141. *)
  142. PROCEDURE SetDefaults*; (* set standard procedures *)
  143. BEGIN
  144. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  145. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  146. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  147. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  148. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  149. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  150. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  151. loopIncMulAXSX := IncMulAXSXLoop;
  152. loopMatMulIncARAR := MatMulIncARARLoop;
  153. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  154. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  155. loopMulAZSZ := MulAZSZLoop;
  156. loopMulALZSLZ := MulALZSLZLoop;
  157. END SetDefaults;
  158. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  159. BEGIN
  160. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  161. END Err;
  162. (* get increment of dimension dim *)
  163. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  164. BEGIN{UNCHECKED}
  165. RETURN base.lens[dim].inc
  166. END GetIncr;
  167. (* set increment of dimension dim *)
  168. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  169. BEGIN{UNCHECKED}
  170. base.lens[dim].inc := val
  171. END PutInc;
  172. (* get length of dimension dim *)
  173. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  174. BEGIN{UNCHECKED}
  175. RETURN base.lens[dim].len
  176. END GetLen;
  177. (* set length of dimension dim *)
  178. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  179. BEGIN{UNCHECKED}
  180. base.lens[dim].len := val
  181. END PutLen;
  182. (* get data address *)
  183. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  184. BEGIN
  185. RETURN base.adr;
  186. END GetAdr;
  187. (* set data address *)
  188. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  189. BEGIN
  190. base.adr := value
  191. END PutAdr;
  192. PROCEDURE Align(value: ADDRESS): ADDRESS;
  193. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  194. END Align;
  195. (* get data base pointer (GC protection) *)
  196. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  197. BEGIN
  198. RETURN base.ptr;
  199. END GetPtr;
  200. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  201. BEGIN
  202. dest := src;
  203. END SafePut;
  204. (* set data base pointer (GC protection) *)
  205. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  206. BEGIN
  207. SafePut(base.ptr,value);
  208. END PutPtr;
  209. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  210. BEGIN
  211. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  212. END GetSize;
  213. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  214. BEGIN
  215. base.elementSize := val
  216. END PutSize;
  217. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  218. VAR dim: SIZE;
  219. BEGIN
  220. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  221. END GetDim;
  222. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  223. BEGIN
  224. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  225. END GetFlags;
  226. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  227. BEGIN
  228. base.dim := dim
  229. END PutDim;
  230. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  231. BEGIN
  232. base.flags := flags
  233. END PutFlags;
  234. (* report geometry of array passed via address s *)
  235. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  236. VAR i: SIZE; dim: SIZE;
  237. PROCEDURE Set( s: SET );
  238. VAR i: SIZE; first: BOOLEAN;
  239. BEGIN
  240. KernelLog.String( "{" ); first := TRUE;
  241. FOR i := 31 TO 0 BY -1 DO
  242. IF i IN s THEN
  243. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  244. KernelLog.Int( i, 1 );
  245. END;
  246. END;
  247. KernelLog.String( "}" );
  248. END Set;
  249. BEGIN
  250. KernelLog.String( name );
  251. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  252. ELSE
  253. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  254. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  255. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  256. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  257. KernelLog.Ln; dim := GetDim( s );
  258. IF dim > 32 THEN dim := 0 END;
  259. FOR i := 0 TO dim - 1 DO
  260. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  261. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  262. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  263. END;
  264. (*
  265. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  266. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  267. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  268. *)
  269. END;
  270. END Report;
  271. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  272. VAR (* t: TensorType; *) ptr: Tensor;
  273. p0: T0;
  274. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  275. BEGIN
  276. CASE dim OF
  277. |0: NEW(p0); ptr := p0;
  278. |1:NEW(p1); ptr := p1;
  279. |2:NEW(p2); ptr := p2;
  280. |3:NEW(p3); ptr := p3;
  281. |4:NEW(p4); ptr := p4;
  282. |5:NEW(p5); ptr := p5;
  283. |6:NEW(p6); ptr := p6;
  284. |7:NEW(p7); ptr := p7;
  285. |8:NEW(p8); ptr := p8;
  286. ELSE
  287. HALT(200)
  288. END;
  289. ptr.dim := dim;
  290. ptr.flags := {TensorFlag};
  291. RETURN ptr;
  292. END GetArrayDesc;
  293. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  294. BEGIN
  295. IF d = NIL THEN
  296. d := GetArrayDesc(dim);
  297. ELSIF d.dim # dim THEN
  298. IF ~(TensorFlag IN d.flags) &
  299. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  300. HALT( 100 );
  301. END;
  302. d := GetArrayDesc(dim)
  303. (* ELSE keep as is *)
  304. END;
  305. END EnsureArrayDesc;
  306. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  307. VAR reason: ARRAY 64 OF CHAR;
  308. BEGIN
  309. IF left # 0 THEN Report( "Source operand ", left ) END;
  310. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  311. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  312. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  313. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  314. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  315. ELSE reason := "unknown";
  316. END;
  317. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  318. HALT( 400 );
  319. END Halt;
  320. (** patterns ********************************************************************)
  321. (* find the largest block with a regular pattern of the form offset+{i*li: 0<=i<len}. d is dimension applying to the resulting loop *)
  322. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  323. BEGIN
  324. d := dim - 1; len := GetLen( left, d );
  325. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  326. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  327. linc := GetIncr( left, d ); DEC( d );
  328. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  329. len := len * GetLen( left, d ); DEC( d );
  330. END; (* find dimension where pattern does not work any more *)
  331. INC( d );
  332. IF debug THEN
  333. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  334. KernelLog.Ln;
  335. END;
  336. END FindPattern1;
  337. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  338. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  339. VAR d, len, linc, ri: SIZE );
  340. (* geometric precondition: lengths must coincide *)
  341. BEGIN
  342. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  343. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  344. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  345. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  346. len := len * GetLen( left, d ); DEC( d );
  347. END;
  348. INC( d );
  349. IF debug THEN
  350. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  351. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  352. END;
  353. END FindPattern2;
  354. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for three arrays simultaneously. d is dimension applying to the resulting loop *)
  355. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  356. VAR d, len, linc, ri, di: SIZE );
  357. (* geometric precondition: lengths must coincide *)
  358. BEGIN
  359. d := dim - 1; len := GetLen( left, d );
  360. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  361. END;
  362. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  363. DEC( d );
  364. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  365. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  366. len := len * GetLen( left, d ); DEC( d );
  367. END;
  368. INC( d );
  369. IF debug THEN
  370. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  371. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  372. END;
  373. END FindPattern3;
  374. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  375. VAR d, sl, sr: SIZE;
  376. BEGIN
  377. d := 0; sl := GetAdr( src );
  378. WHILE (d < dim) DO
  379. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  380. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  381. END;
  382. PutAdr( src, sl + sr );
  383. END Reverse;
  384. (* check if forward copy may be performed *)
  385. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  386. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  387. (* precondition: len(src,i)=len(dest,i) *)
  388. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  389. Sufficient (but not necessary) conditions:
  390. 1.) no overlap: src right < dest left or src left > dest right or
  391. 2.) same geometry and src left >= dest left
  392. same geometry if ginc(s)=ginc(d) with
  393. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  394. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  395. *)
  396. BEGIN
  397. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  398. dim := GetDim( src );
  399. WHILE (d < dim) DO
  400. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  401. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  402. END;
  403. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  404. ELSIF ((sr - sl) = (dr - dl)) THEN
  405. IF (sl = dl) THEN (* same memory region, both directions possible *)
  406. ELSIF (sl > dl) THEN
  407. EXCL( modes, down ) (* only copy up possible *)
  408. ELSE (*sl < dl*)
  409. EXCL( modes, up ) (* only copy down possible *)
  410. END;
  411. ELSE
  412. modes := modes - {down, up}; (* neither nor *)
  413. END;
  414. END CopyUpCompatible;
  415. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  416. Size: SIZE ): ANY;
  417. (* allocate a temporary block containing both descriptor and data *)
  418. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  419. BEGIN
  420. HALT(100);
  421. (*
  422. IF statistics THEN INC( allocTemp ) END;
  423. d := 0; len := Size; dim := GetDim( src );
  424. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  425. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  426. dest := SYSTEM.VAL( SIZE, p );
  427. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  428. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  429. FOR i := 0 TO dim - 1 DO
  430. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  431. len := len * GetLen( src, i );
  432. END;
  433. (* Report("allocdest",dest,dim); *)
  434. RETURN p;
  435. *)
  436. END AllocateTemp;
  437. (*** procedures to traverse arrays and apply operators *)
  438. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  439. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  440. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  441. origdest: ADDRESS; modes: SET;
  442. dest, left: ADDRESS; dim: SIZE;
  443. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  444. VAR len: SIZE; linc, dinc: SIZE;
  445. BEGIN
  446. IF dim = loopd THEN
  447. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  448. IF conservative THEN INC( glen, looplen ) END;
  449. ELSE
  450. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  451. dinc := GetIncr( dest, dim ); INC( dim );
  452. WHILE (len > 0) DO
  453. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  454. END;
  455. END;
  456. END Traverse;
  457. BEGIN
  458. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  459. origdest := 0; modes := {up, down};
  460. (* allocate destination, if necessary *)
  461. p := AllocateSame( dest, left, elementSize );
  462. IF p = NIL THEN
  463. CopyUpCompatible( dest, left, modes );
  464. IF up IN modes THEN (* nothing to be done *)
  465. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  466. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  467. END;
  468. END;
  469. (* allocate destination, if necessary *)
  470. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  471. ELSIF CheckGeometry( left, dest, dim )
  472. END; *)
  473. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  474. (* check pattern: longest piece that can be done with a loop *)
  475. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  476. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  477. IF up IN modes THEN (* nothing to be done *)
  478. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  479. ELSE CopyContent( origdest, dest, elementSize );
  480. END;
  481. SYSTEM.PUT( d, dest );
  482. IF d = p THEN (* new block *)
  483. Heaps.CheckAssignment(d,dest);
  484. END;
  485. END ApplyGenericUnaryAAOpS;
  486. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  487. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  488. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  489. origdest: SIZE; modes: SET;
  490. dest, left: ADDRESS; dim: SIZE;
  491. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  492. VAR len: SIZE; linc, dinc: SIZE;
  493. BEGIN
  494. IF dim = loopd THEN
  495. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  496. IF conservative THEN INC( glen, looplen ) END;
  497. ELSE
  498. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  499. dinc := GetIncr( dest, dim ); INC( dim );
  500. WHILE (len > 0) DO
  501. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  502. END;
  503. END;
  504. END Traverse;
  505. BEGIN
  506. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  507. origdest := 0; modes := {up, down};
  508. (* allocate destination, if necessary *)
  509. p := AllocateSame( dest, left, elementSize );
  510. IF p = NIL THEN
  511. CopyUpCompatible( dest, left, modes );
  512. IF up IN modes THEN (* nothing to be done *)
  513. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  514. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  515. END;
  516. END;
  517. (* allocate destination, if necessary *)
  518. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  519. ELSIF CheckGeometry( left, dest, dim )
  520. END; *)
  521. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  522. (* check pattern: longest piece that can be done with a loop *)
  523. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  524. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  525. IF up IN modes THEN (* nothing to be done *)
  526. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  527. ELSE CopyContent( origdest, dest, elementSize );
  528. END;
  529. SYSTEM.PUT( d, dest );
  530. IF d = p THEN (* new block *)
  531. Heaps.CheckAssignment(d,dest);
  532. END;
  533. END ApplyGenericUnaryAAOpI;
  534. (** apply unary operator to array: array SIZE -> array SIZE *)
  535. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  536. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  537. origdest: SIZE; modes: SET;
  538. dest, left: ADDRESS; dim: SIZE;
  539. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  540. VAR len: SIZE; linc, dinc: SIZE;
  541. BEGIN
  542. IF dim = loopd THEN
  543. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  544. IF conservative THEN INC( glen, looplen ) END;
  545. ELSE
  546. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  547. dinc := GetIncr( dest, dim ); INC( dim );
  548. WHILE (len > 0) DO
  549. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  550. END;
  551. END;
  552. END Traverse;
  553. BEGIN
  554. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  555. origdest := 0; modes := {up, down};
  556. (* allocate destination, if necessary *)
  557. p := AllocateSame( dest, left, elementSize );
  558. IF p = NIL THEN
  559. CopyUpCompatible( dest, left, modes );
  560. IF up IN modes THEN (* nothing to be done *)
  561. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  562. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  563. END;
  564. END;
  565. (* allocate destination, if necessary *)
  566. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  567. ELSIF CheckGeometry( left, dest, dim )
  568. END; *)
  569. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  570. (* check pattern: longest piece that can be done with a loop *)
  571. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  572. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  573. IF up IN modes THEN (* nothing to be done *)
  574. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  575. ELSE CopyContent( origdest, dest, elementSize );
  576. END;
  577. SYSTEM.PUT( d, dest );
  578. IF d = p THEN (* new block *)
  579. Heaps.CheckAssignment(d,dest);
  580. END;
  581. END ApplyGenericUnaryAAOpL;
  582. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  583. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  584. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  585. origdest: SIZE; modes: SET;
  586. VAR dest, left: ADDRESS; dim: SIZE;
  587. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  588. VAR len: SIZE; linc, dinc: SIZE;
  589. BEGIN
  590. IF dim = loopd THEN
  591. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  592. IF conservative THEN INC( glen, looplen ) END;
  593. ELSE
  594. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  595. dinc := GetIncr( dest, dim ); INC( dim );
  596. WHILE (len > 0) DO
  597. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  598. DEC( len );
  599. END;
  600. END;
  601. END Traverse;
  602. BEGIN
  603. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  604. origdest := 0; modes := {up, down};
  605. (* allocate destination, if necessary *)
  606. p := AllocateSame( dest, left, elementSize );
  607. IF p = NIL THEN
  608. CopyUpCompatible( dest, left, modes );
  609. IF up IN modes THEN (* nothing to be done *)
  610. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  611. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  612. END;
  613. END;
  614. (*
  615. (* allocate destination, if necessary *)
  616. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  617. ELSIF CheckGeometry( left, dest, dim )
  618. END;
  619. *)
  620. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  621. (* check pattern: longest piece that can be done with a loop *)
  622. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  623. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  624. IF up IN modes THEN (* nothing to be done *)
  625. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  626. ELSE CopyContent( origdest, dest, elementSize );
  627. END;
  628. SYSTEM.PUT( d, dest );
  629. IF d = p THEN (* new block *)
  630. Heaps.CheckAssignment(d,dest);
  631. END;
  632. END ApplyGenericUnaryAAOpH;
  633. (** apply unary operator to array: array REAL -> array REAL *)
  634. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  635. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  636. origdest: SIZE; modes: SET;
  637. dest, left: ADDRESS; dim: SIZE;
  638. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  639. VAR len: SIZE; linc, dinc: SIZE;
  640. BEGIN
  641. IF dim = loopd THEN
  642. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  643. IF conservative THEN INC( glen, looplen ) END;
  644. ELSE
  645. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  646. dinc := GetIncr( dest, dim ); INC( dim );
  647. WHILE (len > 0) DO
  648. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  649. END;
  650. END;
  651. END Traverse;
  652. BEGIN
  653. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  654. origdest := 0; modes := {up, down};
  655. (* allocate destination, if necessary *)
  656. p := AllocateSame( dest, left, elementSize );
  657. IF p = NIL THEN
  658. CopyUpCompatible( dest, left, modes );
  659. IF up IN modes THEN (* nothing to be done *)
  660. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  661. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  662. END;
  663. END;
  664. (* allocate destination, if necessary *)
  665. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  666. ELSIF CheckGeometry( left, dest, dim )
  667. END; *)
  668. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  669. (* check pattern: longest piece that can be done with a loop *)
  670. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  671. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  672. IF up IN modes THEN (* nothing to be done *)
  673. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  674. ELSE CopyContent( origdest, dest, elementSize );
  675. END;
  676. SYSTEM.PUT( d, dest );
  677. IF d = p THEN (* new block *)
  678. Heaps.CheckAssignment(d,dest);
  679. END;
  680. END ApplyGenericUnaryAAOpR;
  681. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  682. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  683. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  684. origdest: SIZE; modes: SET;
  685. dest, left: ADDRESS; dim: SIZE;
  686. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  687. VAR len: SIZE; linc, dinc: SIZE;
  688. BEGIN
  689. IF dim = loopd THEN
  690. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  691. IF conservative THEN INC( glen, looplen ) END;
  692. ELSE
  693. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  694. dinc := GetIncr( dest, dim ); INC( dim );
  695. WHILE (len > 0) DO
  696. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  697. DEC( len );
  698. END;
  699. END;
  700. END Traverse;
  701. BEGIN
  702. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  703. origdest := 0; modes := {up, down};
  704. (* allocate destination, if necessary *)
  705. p := AllocateSame( dest, left, elementSize );
  706. IF p = NIL THEN
  707. CopyUpCompatible( dest, left, modes );
  708. IF up IN modes THEN (* nothing to be done *)
  709. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  710. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  711. END;
  712. END;
  713. (*
  714. (* allocate destination, if necessary *)
  715. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  716. ELSIF CheckGeometry( left, dest, dim )
  717. END;
  718. *)
  719. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  720. (* check pattern: longest piece that can be done with a loop *)
  721. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  722. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  723. IF up IN modes THEN (* nothing to be done *)
  724. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  725. ELSE CopyContent( origdest, dest, elementSize );
  726. END;
  727. SYSTEM.PUT( d, dest );
  728. IF d = p THEN (* new block *)
  729. Heaps.CheckAssignment(d,dest);
  730. END;
  731. END ApplyGenericUnaryAAOpX;
  732. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  733. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  734. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  735. origdest: SIZE; modes: SET;
  736. dest, left: ADDRESS; dim: SIZE;
  737. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  738. VAR len: SIZE; linc, dinc: SIZE;
  739. BEGIN
  740. IF dim = loopd THEN
  741. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  742. IF conservative THEN INC( glen, looplen ) END;
  743. ELSE
  744. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  745. dinc := GetIncr( dest, dim ); INC( dim );
  746. WHILE (len > 0) DO
  747. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  748. DEC( len );
  749. END;
  750. END;
  751. END Traverse;
  752. BEGIN
  753. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  754. origdest := 0; modes := {up, down};
  755. (* allocate destination, if necessary *)
  756. p := AllocateSame( dest, left, elementSize );
  757. IF p = NIL THEN
  758. CopyUpCompatible( dest, left, modes );
  759. IF up IN modes THEN (* nothing to be done *)
  760. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  761. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  762. END;
  763. END;
  764. (*
  765. (* allocate destination, if necessary *)
  766. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  767. ELSIF CheckGeometry( left, dest, dim )
  768. END;
  769. *)
  770. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  771. (* check pattern: longest piece that can be done with a loop *)
  772. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  773. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  774. IF up IN modes THEN (* nothing to be done *)
  775. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  776. ELSE CopyContent( origdest, dest, elementSize );
  777. END;
  778. SYSTEM.PUT( d, dest );
  779. IF d = p THEN (* new block *)
  780. Heaps.CheckAssignment(d,dest);
  781. END;
  782. END ApplyGenericUnaryAAOpZ;
  783. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  784. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  785. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  786. origdest: SIZE; modes: SET;
  787. dest, left: ADDRESS; dim: SIZE;
  788. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  789. VAR len: SIZE; linc, dinc: SIZE;
  790. BEGIN
  791. IF dim = loopd THEN
  792. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  793. IF conservative THEN INC( glen, looplen ) END;
  794. ELSE
  795. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  796. dinc := GetIncr( dest, dim ); INC( dim );
  797. WHILE (len > 0) DO
  798. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  799. DEC( len );
  800. END;
  801. END;
  802. END Traverse;
  803. BEGIN
  804. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  805. origdest := 0; modes := {up, down};
  806. (* allocate destination, if necessary *)
  807. p := AllocateSame( dest, left, elementSize );
  808. IF p = NIL THEN
  809. CopyUpCompatible( dest, left, modes );
  810. IF up IN modes THEN (* nothing to be done *)
  811. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  812. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  813. END;
  814. END;
  815. (*
  816. (* allocate destination, if necessary *)
  817. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  818. ELSIF CheckGeometry( left, dest, dim )
  819. END;
  820. *)
  821. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  822. (* check pattern: longest piece that can be done with a loop *)
  823. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  824. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  825. IF up IN modes THEN (* nothing to be done *)
  826. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  827. ELSE CopyContent( origdest, dest, elementSize );
  828. END;
  829. SYSTEM.PUT( d, dest );
  830. IF d = p THEN (* new block *)
  831. Heaps.CheckAssignment(d,dest);
  832. END;
  833. END ApplyGenericUnaryAAOpLZ;
  834. (** apply unary operator to array: array -> array *)
  835. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  836. Loop: UnaryAALoop );
  837. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  838. origdest: SIZE; modes: SET;
  839. dest, left: ADDRESS; dim: SIZE;
  840. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  841. VAR len: SIZE; linc, dinc: SIZE;
  842. BEGIN
  843. IF dim = loopd THEN
  844. Loop( ladr, dadr, loopli, loopdi, looplen );
  845. IF conservative THEN INC( glen, looplen ) END;
  846. ELSE
  847. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  848. dinc := GetIncr( dest, dim ); INC( dim );
  849. WHILE (len > 0) DO
  850. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  851. DEC( len );
  852. END;
  853. END;
  854. END Traverse;
  855. BEGIN
  856. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  857. origdest := 0; modes := {up, down};
  858. (* allocate destination, if necessary *)
  859. p := AllocateSame( dest, left, elementSize );
  860. IF p = NIL THEN
  861. CopyUpCompatible( dest, left, modes );
  862. IF up IN modes THEN (* nothing to be done *)
  863. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  864. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  865. END;
  866. END;
  867. (*
  868. (* allocate destination, if necessary *)
  869. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  870. ELSIF CheckGeometry( left, dest, dim )
  871. END;
  872. *)
  873. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  874. (* check pattern: longest piece that can be done with a loop *)
  875. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  876. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  877. IF up IN modes THEN (* nothing to be done *)
  878. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  879. ELSE CopyContent( origdest, dest, elementSize );
  880. END;
  881. SYSTEM.PUT( d, dest );
  882. IF d = p THEN (* new block *)
  883. Heaps.CheckAssignment(d,dest);
  884. END;
  885. END ApplyUnaryAAOp;
  886. (** apply unary operator to array: array -> scalar *)
  887. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  888. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  889. VAR left: ADDRESS; dim: SIZE;
  890. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  891. VAR len: SIZE; linc: SIZE;
  892. BEGIN
  893. IF dim = loopd THEN
  894. Loop( ladr, dest, loopli, looplen );
  895. IF conservative THEN INC( glen, looplen ) END;
  896. ELSE
  897. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  898. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  899. END;
  900. END Traverse;
  901. BEGIN
  902. SYSTEM.GET( l, left ); dim := GetDim( left );
  903. IF debug THEN Report( "AS: left", left ); END;
  904. (* check pattern: longest piece that can be done with a loop *)
  905. IF conservative THEN glen := 0 END;
  906. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  907. IF conservative THEN
  908. looplen := 1;
  909. WHILE (dim > 0) DO
  910. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  911. END;
  912. ASSERT( looplen = glen );
  913. END;
  914. END ApplyUnaryASOp;
  915. (** apply unary operator to array: scalar -> array *)
  916. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  917. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  918. VAR dest: ADDRESS; dim: SIZE;
  919. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  920. VAR len: SIZE; dinc: SIZE;
  921. BEGIN
  922. IF dim = loopd THEN
  923. Loop( right, dadr, loopdi, looplen );
  924. IF conservative THEN INC( glen, looplen ) END;
  925. ELSE
  926. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  927. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  928. END;
  929. END Traverse;
  930. BEGIN
  931. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  932. IF debug THEN Report( "AS: dest", dest ); END;
  933. (* check pattern: longest piece that can be done with a loop *)
  934. IF conservative THEN glen := 0 END;
  935. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  936. IF conservative THEN
  937. looplen := 1;
  938. WHILE (dim > 0) DO
  939. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  940. END;
  941. ASSERT( looplen = glen );
  942. END;
  943. END ApplyUnarySAOp;
  944. (** apply binary operator : array x array -> array *)
  945. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  946. Loop: BinaryAAALoop );
  947. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  948. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  949. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  950. VAR len: SIZE; linc, rinc, dinc: SIZE;
  951. BEGIN
  952. IF dim = loopd THEN
  953. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  954. IF conservative THEN INC( glen, looplen ) END;
  955. ELSE
  956. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  957. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  958. WHILE (len > 0) DO
  959. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  960. INC( dadr, dinc ); DEC( len );
  961. END;
  962. END;
  963. END Traverse;
  964. BEGIN
  965. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  966. (* allocate destination, if necessary *)
  967. IF ~SameShape( left, right ) THEN
  968. Halt( GeometryMismatch, left, right, 0 )
  969. END;
  970. origdest := 0; modes := {up, down};
  971. p := AllocateSame( dest, left, elementSize );
  972. IF p = NIL THEN
  973. CopyUpCompatible( dest, left, modes );
  974. CopyUpCompatible( dest, right, modes );
  975. IF up IN modes THEN (* nothing to be done *)
  976. ELSIF down IN modes THEN
  977. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  978. ELSE
  979. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  980. END;
  981. END;
  982. (* debugging *)
  983. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  984. (* check pattern: longest piece that can be done with a loop *)
  985. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  986. (* run through dimensions *)
  987. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  988. IF up IN modes THEN (* nothing to be done *)
  989. ELSIF down IN modes THEN
  990. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  991. ELSE CopyContent( origdest, dest, elementSize );
  992. END;
  993. SYSTEM.PUT( d, dest );
  994. IF d = p THEN (* new block *)
  995. Heaps.CheckAssignment(d,dest);
  996. END;
  997. END ApplyBinaryAAAOp;
  998. (** apply binary operator: array x scalar -> array *)
  999. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  1000. elementSize: SIZE;
  1001. Loop: BinaryASALoop );
  1002. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1003. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1004. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1005. VAR len: SIZE; linc, dinc: SIZE;
  1006. BEGIN
  1007. IF dim = loopd THEN
  1008. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1009. IF conservative THEN INC( glen, looplen ) END;
  1010. ELSE
  1011. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1012. dinc := GetIncr( dest, dim ); INC( dim );
  1013. WHILE (len > 0) DO
  1014. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1015. DEC( len );
  1016. END;
  1017. END;
  1018. END Traverse;
  1019. BEGIN
  1020. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1021. (* allocate destination, if necessary *)
  1022. origdest := 0; modes := {up, down};
  1023. p := AllocateSame( dest, left, elementSize );
  1024. IF p = NIL THEN
  1025. CopyUpCompatible( dest, left, modes );
  1026. IF up IN modes THEN (* nothing to be done *)
  1027. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1028. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1029. END;
  1030. END;
  1031. (* debugging *)
  1032. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1033. (* check pattern: longest piece that can be done with a loop *)
  1034. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1035. (* run through dimensions *)
  1036. IF conservative THEN glen := 0 END;
  1037. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1038. IF conservative THEN
  1039. looplen := 1;
  1040. WHILE (dim > 0) DO
  1041. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1042. END;
  1043. ASSERT( looplen = glen );
  1044. END;
  1045. IF up IN modes THEN (* nothing to be done *)
  1046. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1047. ELSE CopyContent( origdest, dest, elementSize );
  1048. END;
  1049. SYSTEM.PUT( d, dest );
  1050. IF d = p THEN (* new block *)
  1051. Heaps.CheckAssignment(d,dest);
  1052. END;
  1053. END ApplyBinaryASAOp;
  1054. (** apply binary operator: array x array -> scalar *)
  1055. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1056. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1057. left, right: ADDRESS; dim: SIZE;
  1058. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1059. VAR len: SIZE; linc, rinc: SIZE;
  1060. BEGIN
  1061. IF dim = loopd THEN
  1062. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1063. IF conservative THEN INC( glen, looplen ) END;
  1064. ELSE
  1065. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1066. rinc := GetIncr( right, dim ); INC( dim );
  1067. WHILE (len > 0) DO
  1068. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1069. DEC( len );
  1070. END;
  1071. END;
  1072. END Traverse;
  1073. BEGIN
  1074. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1075. (* check array lengths *)
  1076. IF ~SameShape( left, right ) THEN
  1077. Halt( GeometryMismatch, left, right, 0 )
  1078. END;
  1079. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1080. (* check pattern: longest piece that can be done with a loop *)
  1081. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1082. (* run through dimensions *)
  1083. IF conservative THEN glen := 0 END;
  1084. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1085. IF conservative THEN
  1086. looplen := 1;
  1087. WHILE (dim > 0) DO
  1088. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1089. END;
  1090. ASSERT( looplen = glen );
  1091. END;
  1092. END ApplyBinaryAASOp;
  1093. (** special binary operator: array x array -> boolean *)
  1094. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1095. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1096. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1097. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1098. VAR len: SIZE; linc, rinc: SIZE;
  1099. BEGIN
  1100. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1101. ELSE
  1102. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1103. rinc := GetIncr( right, dim ); INC( dim );
  1104. WHILE (len > 0) DO
  1105. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1106. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1107. END;
  1108. RETURN TRUE;
  1109. END;
  1110. END Traverse;
  1111. BEGIN
  1112. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1113. (* check array lengths *)
  1114. IF ~SameShape( left, right ) THEN
  1115. RETURN geometryMismatchDefault
  1116. END;
  1117. (* is destination already allocated? (might be a temporary result) *)
  1118. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1119. (* check pattern: longest piece that can be done with a loop *)
  1120. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1121. (* run through dimensions *)
  1122. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1123. END ApplyBinaryAABOp;
  1124. (** special binary operator: array x scalar -> boolean *)
  1125. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1126. Loop: BinaryASBLoop ): BOOLEAN;
  1127. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1128. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1129. VAR len: SIZE; linc: SIZE;
  1130. BEGIN
  1131. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1132. ELSE
  1133. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1134. WHILE (len > 0) DO
  1135. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1136. INC( ladr, linc ); DEC( len );
  1137. END;
  1138. RETURN TRUE;
  1139. END;
  1140. END Traverse;
  1141. BEGIN
  1142. SYSTEM.GET( l, left ); dim := GetDim( left );
  1143. IF debug THEN Report( "AAB:left", left ); END;
  1144. (* check pattern: longest piece that can be done with a loop *)
  1145. FindPattern1( left, dim, loopd, looplen, loopli );
  1146. (* run through dimensions *)
  1147. RETURN Traverse( 0, GetAdr( left ) );
  1148. END ApplyBinaryASBOp;
  1149. (**** operators *)
  1150. (*** copy *)
  1151. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1152. BEGIN
  1153. WHILE len > 0 DO
  1154. SYSTEM.PUT32(dadr, SYSTEM.GET32(ladr));
  1155. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1156. END;
  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. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1167. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1168. DEC EBX ; DEC(EBX)
  1169. JMP start
  1170. end:*)
  1171. END Copy4;
  1172. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1173. BEGIN
  1174. WHILE len > 0 DO
  1175. SYSTEM.PUT16(dadr, SYSTEM.GET16(ladr));
  1176. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1177. END;
  1178. (*CODE {SYSTEM.i386}
  1179. MOV ECX, [EBP+ladr] ; ECX := ladr
  1180. MOV EDX, [EBP+dadr] ; EDX := dadr
  1181. MOV EBX, [EBP+len] ; EBX := len
  1182. start:
  1183. CMP EBX, 0 ;
  1184. JLE end ; WHILE EBX > 0 DO
  1185. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1186. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1187. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1188. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1189. DEC EBX ; DEC(EBX)
  1190. JMP start
  1191. end:*)
  1192. END Copy2;
  1193. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1194. BEGIN
  1195. WHILE len > 0 DO
  1196. SYSTEM.PUT8(dadr, SYSTEM.GET8(ladr));
  1197. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1198. END;
  1199. (*CODE {SYSTEM.i386}
  1200. MOV ECX, [EBP+ladr] ; ECX := ladr
  1201. MOV EDX, [EBP+dadr] ; EDX := dadr
  1202. MOV EBX, [EBP+len] ; EBX := len
  1203. start:
  1204. CMP EBX, 0 ;
  1205. JLE end ; WHILE EBX > 0 DO
  1206. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1207. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1208. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1209. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1210. DEC EBX ; DEC(EBX)
  1211. JMP start
  1212. end:*)
  1213. END Copy1;
  1214. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1215. BEGIN
  1216. WHILE len > 0 DO
  1217. SYSTEM.PUT64(dadr, SYSTEM.GET64(ladr));
  1218. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1219. END;
  1220. (*CODE {SYSTEM.i386}
  1221. MOV ECX, [EBP+ladr] ; ECX := ladr
  1222. MOV EDX, [EBP+dadr] ; EDX := dadr
  1223. MOV EBX, [EBP+len] ; EBX := len
  1224. start:
  1225. CMP EBX, 0 ;
  1226. JLE end ; WHILE EBX > 0 DO
  1227. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1228. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1229. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1230. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1231. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1232. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1233. DEC EBX ; DEC(EBX)
  1234. JMP start
  1235. end:*)
  1236. END Copy8;
  1237. PROCEDURE (*-*)MoveB*( srcadr, destadr, len: SIZE );
  1238. BEGIN
  1239. IF (srcadr >= destadr) OR (srcadr+len >= destadr) THEN
  1240. SYSTEM.MOVE(srcadr, destadr, len);
  1241. ELSE
  1242. INC(srcadr,len-1); INC(destadr,len-1);
  1243. WHILE len > 0 DO
  1244. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1245. DEC(srcadr); DEC(destadr); DEC(len);
  1246. END;
  1247. END;
  1248. (**
  1249. (** Correct move if overlap, might be important for some array operations,
  1250. do not use SYSTEM.MOVE. *)
  1251. CODE {SYSTEM.i386}
  1252. MOV ECX, [ESP] ; len
  1253. MOV EDI, [ESP+4] ; destadr
  1254. MOV ESI, [ESP+8] ; srcadr
  1255. CMP ESI, EDI
  1256. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1257. MOV EAX, ESI
  1258. ADD EAX, ECX
  1259. CMP EAX, EDI
  1260. JBE moveup ; no overlap, no problem, move up
  1261. MOV ESI, EAX
  1262. ADD EDI, ECX
  1263. DEC ESI
  1264. DEC EDI
  1265. STD ; move down since overlap occured
  1266. REP
  1267. MOVSB
  1268. JMP done
  1269. moveup:
  1270. CLD
  1271. MOV BL, CL
  1272. SHR ECX, 2
  1273. AND BL, 00000003H ; rest to move after 4 byte move
  1274. REP
  1275. MOVSD ; move 4 bytes each step
  1276. MOV CL, BL
  1277. REP
  1278. MOVSB ; move rest in one byte steps
  1279. done:
  1280. ADD ESP, 12 ; adjust stack pointer(inline procedure!)*)
  1281. END MoveB;
  1282. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1283. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1284. origdest: ADDRESS; modes: SET; dim: SIZE;
  1285. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1286. BEGIN
  1287. IF (dinc = elementSize) & (linc = elementSize) THEN
  1288. MoveB( ladr, dadr, len * elementSize );
  1289. (*
  1290. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1291. *)
  1292. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1293. len := len * elementSize;
  1294. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1295. ELSIF elementSize = 1 THEN
  1296. Copy1( ladr, dadr, linc, dinc, len );
  1297. (*
  1298. WHILE (len > 0) DO
  1299. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1300. END;
  1301. *)
  1302. ELSIF elementSize = 2 THEN
  1303. Copy2( ladr, dadr, linc, dinc, len );
  1304. (*
  1305. WHILE (len > 0) DO
  1306. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1307. END;
  1308. *)
  1309. ELSIF elementSize = 4 THEN
  1310. Copy4( ladr, dadr, linc, dinc, len );
  1311. (*
  1312. WHILE (len > 0) DO
  1313. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1314. END;
  1315. *)
  1316. ELSIF elementSize = 8 THEN
  1317. Copy8( ladr, dadr, linc, dinc, len );
  1318. (*
  1319. WHILE (len > 0) DO
  1320. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1321. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1322. INC( dadr, dinc );
  1323. END;
  1324. *)
  1325. ELSE (* SYSTEM.MOVE is expensive ! *)
  1326. WHILE (len > 0) DO
  1327. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1328. INC( dadr, dinc );
  1329. END;
  1330. END;
  1331. END Loop;
  1332. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1333. VAR len: SIZE; linc, dinc: SIZE;
  1334. BEGIN
  1335. IF dim = loopd THEN
  1336. Loop( ladr, dadr, loopli, loopdi, looplen );
  1337. IF conservative THEN INC( glen, looplen ) END;
  1338. ELSE
  1339. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1340. dinc := GetIncr( dest, dim ); INC( dim );
  1341. WHILE (len > 0) DO
  1342. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1343. DEC( len );
  1344. END;
  1345. END;
  1346. END Traverse;
  1347. BEGIN
  1348. dim := GetDim( src );
  1349. origdest := 0; modes := {up, down}; (* copy modes *)
  1350. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1351. CopyUpCompatible( dest, src, modes );
  1352. IF up IN modes THEN (* nothing to be done *)
  1353. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1354. Reverse( src, dim ); Reverse( dest, dim )
  1355. ELSE (* can only copy via double buffer *)
  1356. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1357. END;
  1358. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1359. END;
  1360. (* check pattern: longest piece that can be done with a loop *)
  1361. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1362. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1363. IF up IN modes THEN (* nothing to be done *)
  1364. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1365. ELSE CopyContent( origdest, dest, elementSize );
  1366. END;
  1367. END CopyContent;
  1368. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  1369. VAR ptr, data: ANY; Size: SIZE;
  1370. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1371. PROCEDURE NewData;
  1372. VAR dim, len, size: SIZE;
  1373. BEGIN
  1374. dim := GetDim( src ); size := elementsize;
  1375. PutDim( dest, dim );
  1376. PutSize( dest, elementsize );
  1377. WHILE (dim > 0) DO
  1378. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1379. PutInc( dest, dim, size ); size := size * len;
  1380. END;
  1381. SYSTEM.NEW( data, size + ArrayAlignment);
  1382. PutAdr( dest, Align(data));
  1383. PutPtr( dest, data );
  1384. END NewData;
  1385. BEGIN
  1386. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1387. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1388. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1389. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1390. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1391. PutFlags(dest, {TensorFlag});
  1392. NewData(); RETURN ptr;
  1393. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1394. (* check if re-allocation of descriptor is allowed *)
  1395. IF ~(TensorFlag IN GetFlags( dest )) &
  1396. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1397. HALT( 100 );
  1398. END;
  1399. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1400. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1401. PutFlags(dest, {TensorFlag});
  1402. NewData();
  1403. RETURN ptr;
  1404. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1405. (* check if re-allocation of array data is allowed *)
  1406. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1407. HALT( 100 );
  1408. END;
  1409. NewData();
  1410. RETURN data;
  1411. ELSE (* nothing to do *)
  1412. RETURN NIL;
  1413. END;
  1414. END AllocateSame;
  1415. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1416. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1417. BEGIN
  1418. dim := GetDim(src);
  1419. p := GetArrayDesc(dim);
  1420. adr := p;
  1421. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1422. PutAdr( src, 0 );
  1423. PutPtr( src, NIL );
  1424. PutFlags( src, {} );
  1425. RETURN p;
  1426. END TempDescCopy;
  1427. (* used when arrays are passed by value *)
  1428. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: SIZE );
  1429. VAR p: ANY;
  1430. BEGIN
  1431. ASSERT( src = dest );
  1432. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1433. CopyArray( dest, p, elementsize );
  1434. END CopyArraySelf;
  1435. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1436. VAR p: ANY; srcdim, destdim: SIZE;
  1437. BEGIN
  1438. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1439. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1440. srcdim := GetDim(src);
  1441. destdim := GetDim(dest);
  1442. (*
  1443. Debugging.Stack("copy array");
  1444. *)
  1445. Report( "copy array source", src ); Report( "copy array des", dest );
  1446. HALT(100);
  1447. ELSIF src = dest THEN (* self copy *)
  1448. CopyArraySelf( dest, src, elementsize );
  1449. ELSE
  1450. p := AllocateSame( dest, src, elementsize );
  1451. CopyContent( dest, src, elementsize )
  1452. END;
  1453. END CopyArray;
  1454. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1455. BEGIN
  1456. dest := 0; CopyTensor( dest, src, elementsize );
  1457. END CopyTensorSelf;
  1458. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1459. elementsize: SIZE );
  1460. VAR p: ANY;
  1461. BEGIN
  1462. (* Report("dest",dest); Report("src",src); *)
  1463. IF (src = NIL) THEN dest := NIL
  1464. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1465. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1466. CopyContent( dest, src, elementsize );
  1467. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1468. ELSE CopyContent( dest, src, elementsize )
  1469. END;
  1470. END CopyTensor;
  1471. (* copy descriptor of src to that of dest. If not existent then create.*)
  1472. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS): ANY;
  1473. VAR ptr: ANY; flags: SET;
  1474. PROCEDURE CopyDescriptor;
  1475. BEGIN
  1476. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1477. PutPtr(dest, GetPtr(src)); (* GC! *)
  1478. END CopyDescriptor;
  1479. BEGIN
  1480. (*
  1481. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1482. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1483. *)
  1484. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1485. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1486. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1487. CopyDescriptor();
  1488. PutFlags(dest, {TensorFlag});
  1489. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1490. flags := GetFlags(dest);
  1491. (* check if re-allocation of descriptor is allowed *)
  1492. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1493. Halt(DimensionMismatch,src,0,dest);
  1494. END;
  1495. (* create a new descriptor!!! (added by Alexey) *)
  1496. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1497. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1498. CopyDescriptor();
  1499. PutFlags(dest, flags);
  1500. ELSE
  1501. flags := GetFlags(dest);
  1502. (* check if re-allocation of array data is allowed *)
  1503. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1504. Halt(AllocationForbidden,src,0,dest);
  1505. END;
  1506. CopyDescriptor();
  1507. PutFlags(dest, flags);
  1508. END;
  1509. RETURN ptr;
  1510. END ShallowCopy;
  1511. (*
  1512. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1513. BEGIN
  1514. IF debug THEN
  1515. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1516. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1517. END;
  1518. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1519. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1520. END DescriptorCopy;
  1521. *)
  1522. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1523. VAR p: ANY; s,d: ADDRESS;
  1524. BEGIN
  1525. s := SYSTEM.VAL(ADDRESS,src);
  1526. d := SYSTEM.VAL(ADDRESS,dest);
  1527. p := ShallowCopy(d,s);
  1528. SYSTEM.PUT(ADDRESSOF(dest),d);
  1529. IF p = d THEN
  1530. Heaps.CheckAssignment(ADDRESS OF dest, p);
  1531. END;
  1532. END ZeroCopy;
  1533. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1534. BEGIN
  1535. ZeroCopy(src, RESULT);
  1536. RETURN RESULT
  1537. END "ALIAS";
  1538. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1539. VAR dim: SIZE;
  1540. BEGIN
  1541. dim := GetDim( l );
  1542. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1543. WHILE (dim > 0) DO
  1544. DEC( dim );
  1545. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1546. END;
  1547. RETURN TRUE;
  1548. END SameShape;
  1549. (*
  1550. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1551. (*
  1552. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1553. check if deep copy can be avoided and if so then do a shallow copy
  1554. *)
  1555. BEGIN
  1556. ASSERT( dest # 0 ); (* impossible *)
  1557. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1558. HALT( 100 );
  1559. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1560. (* must copy (and allocate) *)
  1561. CopyArray( dest, src, elementsize );
  1562. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1563. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1564. ELSE CopyContent( dest, src, elementsize )
  1565. END;
  1566. ELSE DescriptorCopy( src, dest )
  1567. END;
  1568. END ZeroCopyArray;
  1569. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1570. (*
  1571. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1572. check if deep copy can be avoided and if so then do a shallow copy
  1573. *)
  1574. BEGIN
  1575. IF debug THEN
  1576. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1577. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1578. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1579. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1580. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1581. END;
  1582. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1583. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1584. ELSE
  1585. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1586. END;
  1587. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1588. (* must copy (and allocate) *)
  1589. CopyTensor( dest, src, elementsize );
  1590. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1591. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1592. ELSE
  1593. HALT( 100 ); (* copy forbidden *)
  1594. END;
  1595. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1596. DescriptorCopy( src, dest );
  1597. ELSE
  1598. HALT( 100 ); (* different shapes: not allowed *)
  1599. END;
  1600. END ZeroCopyTensor;
  1601. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1602. VAR i: LONGINT;
  1603. BEGIN
  1604. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1605. CopyContent( dest, left, elementSize )
  1606. ELSE
  1607. IF debug THEN
  1608. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1609. KernelLog.Ln;
  1610. END;
  1611. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1612. FOR i := 0 TO dim - 1 DO
  1613. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1614. END;
  1615. END;
  1616. END ZeroCopy;
  1617. *)
  1618. (*** conversions ****)
  1619. (** SHORTINT -> INTEGER *)
  1620. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1621. BEGIN
  1622. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1623. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1624. DEC( len );
  1625. END;
  1626. END ConvertASAILoop;
  1627. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1628. BEGIN
  1629. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1630. RETURN RESULT
  1631. END "@Convert";
  1632. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1633. BEGIN
  1634. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1635. RETURN RESULT
  1636. END "LONG";
  1637. (** SHORTINT -> LONGINT *)
  1638. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1639. BEGIN
  1640. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1641. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1642. DEC( len );
  1643. END;
  1644. END ConvertLoopSL;
  1645. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1646. BEGIN
  1647. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1648. RETURN RESULT
  1649. END "@Convert";
  1650. (** SHORTINT -> REAL *)
  1651. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1652. VAR lval: SHORTINT; dval: REAL;
  1653. BEGIN
  1654. WHILE (len > 0) DO
  1655. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1656. INC( dadr, dinc ); DEC( len );
  1657. END;
  1658. END ConvertLoopSR;
  1659. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1660. BEGIN
  1661. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1662. RETURN RESULT
  1663. END "@Convert";
  1664. (** SHORTINT -> LONGREAL *)
  1665. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1666. VAR lval: SHORTINT; dval: LONGREAL;
  1667. BEGIN
  1668. WHILE (len > 0) DO
  1669. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1670. INC( dadr, dinc ); DEC( len );
  1671. END;
  1672. END ConvertLoopSX;
  1673. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1674. BEGIN
  1675. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1676. RETURN RESULT
  1677. END "@Convert";
  1678. (** INTEGER -> SHORTINT (SHORT) *)
  1679. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1680. VAR lval: INTEGER; dval: SHORTINT;
  1681. BEGIN
  1682. WHILE (len > 0) DO
  1683. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1684. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1685. END;
  1686. END ConvertLoopIS;
  1687. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1688. BEGIN
  1689. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1690. RETURN RESULT
  1691. END "@Convert";
  1692. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1693. BEGIN
  1694. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1695. RETURN RESULT
  1696. END "SHORT";
  1697. (** INTEGER -> LONGINT *)
  1698. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1699. BEGIN
  1700. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1701. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1702. DEC( len );
  1703. END;
  1704. END ConvertLoopIL;
  1705. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1706. BEGIN
  1707. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1708. RETURN RESULT
  1709. END "@Convert";
  1710. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1711. BEGIN
  1712. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1713. RETURN RESULT
  1714. END "LONG";
  1715. (** INTEGER -> REAL *)
  1716. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1717. VAR lval: INTEGER; dval: REAL;
  1718. BEGIN
  1719. WHILE (len > 0) DO
  1720. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1721. INC( dadr, dinc ); DEC( len );
  1722. END;
  1723. END ConvertLoopIR;
  1724. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1725. BEGIN
  1726. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1727. RETURN RESULT
  1728. END "@Convert";
  1729. (** INTEGER -> LONGREAL *)
  1730. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1731. VAR lval: INTEGER; dval: LONGREAL;
  1732. BEGIN
  1733. WHILE (len > 0) DO
  1734. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1735. INC( dadr, dinc ); DEC( len );
  1736. END;
  1737. END ConvertLoopIX;
  1738. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1739. BEGIN
  1740. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1741. RETURN RESULT
  1742. END "@Convert";
  1743. (** LONGINT -> INTEGER (SHORT) *)
  1744. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1745. VAR lval: LONGINT; dval: INTEGER;
  1746. BEGIN
  1747. WHILE (len > 0) DO
  1748. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1749. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1750. END;
  1751. END ConvertLoopLI;
  1752. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1753. BEGIN
  1754. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1755. RETURN RESULT
  1756. END "@Convert";
  1757. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1758. BEGIN
  1759. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1760. RETURN RESULT
  1761. END "SHORT";
  1762. (** LONGINT -> REAL *)
  1763. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1764. VAR lval: LONGINT; dval: REAL;
  1765. BEGIN
  1766. WHILE (len > 0) DO
  1767. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1768. INC( dadr, dinc ); DEC( len );
  1769. END;
  1770. END ConvertLoopLR;
  1771. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1772. BEGIN
  1773. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1774. RETURN RESULT
  1775. END "@Convert";
  1776. (** LONGINT -> LONGREAL *)
  1777. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1778. VAR lval: LONGINT; dval: LONGREAL;
  1779. BEGIN
  1780. WHILE (len > 0) DO
  1781. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1782. INC( dadr, dinc ); DEC( len );
  1783. END;
  1784. END ConvertLoopLX;
  1785. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1786. BEGIN
  1787. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1788. RETURN RESULT
  1789. END "@Convert";
  1790. (** REAL -> LONGINT (ENTIER) *)
  1791. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1792. VAR lval: REAL; dval: LONGINT;
  1793. BEGIN
  1794. WHILE (len > 0) DO
  1795. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1796. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1797. END;
  1798. END ConvertLoopRL;
  1799. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1800. BEGIN
  1801. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1802. RETURN RESULT
  1803. END "@Convert";
  1804. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1805. BEGIN
  1806. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1807. RETURN RESULT
  1808. END "ENTIER";
  1809. (** REAL -> LONGREAL *)
  1810. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1811. VAR lval: REAL; dval: LONGREAL;
  1812. BEGIN
  1813. WHILE (len > 0) DO
  1814. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1815. INC( dadr, dinc ); DEC( len );
  1816. END;
  1817. END ConvertLoopRX;
  1818. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1819. BEGIN
  1820. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1821. RETURN RESULT
  1822. END "@Convert";
  1823. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1824. BEGIN
  1825. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1826. RETURN RESULT
  1827. END "LONG";
  1828. (** LONGREAL -> REAL (SHORT) *)
  1829. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1830. VAR lval: LONGREAL; dval: REAL;
  1831. BEGIN
  1832. WHILE (len > 0) DO
  1833. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1834. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1835. END;
  1836. END ConvertLoopXR;
  1837. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1838. BEGIN
  1839. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1840. RETURN RESULT
  1841. END "@Convert";
  1842. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1843. BEGIN
  1844. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1845. RETURN RESULT
  1846. END "SHORT";
  1847. (** LONGREAL -> LONGINT (ENTIER) *)
  1848. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1849. VAR lval: LONGREAL; dval: LONGINT;
  1850. BEGIN
  1851. WHILE (len > 0) DO
  1852. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1853. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1854. END;
  1855. END ConvertLoopXL;
  1856. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1857. BEGIN
  1858. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1859. RETURN RESULT
  1860. END "@Convert";
  1861. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF SIZE;
  1862. BEGIN
  1863. CASE SIZEOF(SIZE) OF
  1864. 4: RETURN src;
  1865. |8: ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SIZE ), ConvertLoopLX );
  1866. ELSE
  1867. HALT(100);
  1868. END;
  1869. RETURN RESULT
  1870. END "@Convert";
  1871. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1872. BEGIN
  1873. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1874. RETURN RESULT
  1875. END "ENTIER";
  1876. (*** monadic not A -> ~A ********************************************************************)
  1877. (** BOOLEAN *)
  1878. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1879. VAR lval: BOOLEAN;
  1880. BEGIN
  1881. WHILE (len > 0) DO
  1882. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1883. DEC( len );
  1884. END;
  1885. END NotLoopAB;
  1886. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1887. BEGIN
  1888. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1889. RETURN RESULT
  1890. END "~";
  1891. (*** monadic generic (A) -> -A ********************************************************************)
  1892. (** SHORTINT *)
  1893. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1894. VAR lval: SHORTINT;
  1895. BEGIN
  1896. WHILE (len > 0) DO
  1897. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1898. DEC( len );
  1899. END;
  1900. END GenericLoopS;
  1901. (** INTEGER *)
  1902. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1903. VAR lval: INTEGER;
  1904. BEGIN
  1905. WHILE (len > 0) DO
  1906. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1907. DEC( len );
  1908. END;
  1909. END GenericLoopI;
  1910. (** LONGINT *)
  1911. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1912. VAR lval: LONGINT;
  1913. BEGIN
  1914. WHILE (len > 0) DO
  1915. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1916. DEC( len );
  1917. END;
  1918. END GenericLoopL;
  1919. (** HUGEINT *)
  1920. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1921. VAR lval: HUGEINT;
  1922. BEGIN
  1923. WHILE (len > 0) DO
  1924. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1925. DEC( len );
  1926. END;
  1927. END GenericLoopH;
  1928. (** REAL *)
  1929. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1930. VAR lval: REAL;
  1931. BEGIN
  1932. WHILE (len > 0) DO
  1933. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1934. DEC( len );
  1935. END;
  1936. END GenericLoopR;
  1937. (** LONGREAL *)
  1938. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1939. VAR lval: LONGREAL;
  1940. BEGIN
  1941. WHILE (len > 0) DO
  1942. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1943. DEC( len );
  1944. END;
  1945. END GenericLoopX;
  1946. (** COMPLEX *)
  1947. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1948. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1949. BEGIN
  1950. WHILE (len > 0) DO
  1951. lval := ladr;
  1952. dval := dadr;
  1953. dval.val := op(lval.val);
  1954. INC( ladr, linc ); INC( dadr, dinc );
  1955. DEC( len );
  1956. END;
  1957. END GenericLoopZ;
  1958. (** LONGCOMPLEX *)
  1959. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1960. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1961. BEGIN
  1962. WHILE (len > 0) DO
  1963. lval := ladr;
  1964. dval := dadr;
  1965. dval.val := op (lval.val);
  1966. INC( ladr, linc ); INC( dadr, dinc );
  1967. DEC( len );
  1968. END;
  1969. END GenericLoopLZ;
  1970. (*** monadic minus A -> -A ********************************************************************)
  1971. (** SHORTINT *)
  1972. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1973. VAR lval: SHORTINT;
  1974. BEGIN
  1975. WHILE (len > 0) DO
  1976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1977. DEC( len );
  1978. END;
  1979. END MinusLoopS;
  1980. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1981. BEGIN
  1982. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1983. RETURN RESULT
  1984. END "-";
  1985. (** INTEGER *)
  1986. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1987. VAR lval: INTEGER;
  1988. BEGIN
  1989. WHILE (len > 0) DO
  1990. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1991. DEC( len );
  1992. END;
  1993. END MinusLoopI;
  1994. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1995. BEGIN
  1996. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1997. RETURN RESULT
  1998. END "-";
  1999. (** LONGINT *)
  2000. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2001. VAR lval: LONGINT;
  2002. BEGIN
  2003. WHILE (len > 0) DO
  2004. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2005. DEC( len );
  2006. END;
  2007. END MinusLoopL;
  2008. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2009. BEGIN
  2010. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  2011. RETURN RESULT
  2012. END "-";
  2013. (** REAL *)
  2014. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2015. VAR lval: REAL;
  2016. BEGIN
  2017. WHILE (len > 0) DO
  2018. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2019. DEC( len );
  2020. END;
  2021. END MinusLoopR;
  2022. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2023. BEGIN
  2024. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  2025. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  2026. RETURN RESULT
  2027. END "-";
  2028. (** LONGREAL *)
  2029. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2030. VAR lval: LONGREAL;
  2031. BEGIN
  2032. WHILE (len > 0) DO
  2033. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2034. DEC( len );
  2035. END;
  2036. END MinusLoopX;
  2037. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2038. BEGIN
  2039. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  2040. MinusLoopX );
  2041. RETURN RESULT
  2042. END "-";
  2043. (*** add array + array -> array ********************************************************************)
  2044. (** SHORTINT *)
  2045. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2046. VAR lval, rval: SHORTINT;
  2047. BEGIN
  2048. WHILE (len > 0) DO
  2049. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2050. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2051. END;
  2052. END AddASASLoop;
  2053. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2054. BEGIN
  2055. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2056. SIZEOF( SHORTINT ), AddASASLoop );
  2057. RETURN RESULT
  2058. END "+";
  2059. (** INTEGER *)
  2060. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2061. VAR lval, rval: INTEGER;
  2062. BEGIN
  2063. WHILE (len > 0) DO
  2064. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2065. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2066. END;
  2067. END AddAIAILoop;
  2068. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2069. BEGIN
  2070. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2071. SIZEOF( INTEGER ), AddAIAILoop );
  2072. RETURN RESULT
  2073. END "+";
  2074. (** LONGINT *)
  2075. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2076. VAR lval, rval: LONGINT;
  2077. BEGIN
  2078. WHILE (len > 0) DO
  2079. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2080. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2081. END;
  2082. END AddALALLoop;
  2083. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2084. BEGIN
  2085. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2086. SIZEOF( LONGINT ), AddALALLoop );
  2087. RETURN RESULT
  2088. END "+";
  2089. (** REAL *)
  2090. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2091. VAR lval, rval: REAL;
  2092. BEGIN
  2093. WHILE (len > 0) DO
  2094. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2095. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2096. END;
  2097. END AddARARLoop;
  2098. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2099. BEGIN
  2100. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2101. loopAddARAR );
  2102. RETURN RESULT
  2103. END "+";
  2104. (** LONGREAL *)
  2105. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2106. VAR lval, rval: LONGREAL;
  2107. BEGIN
  2108. WHILE (len > 0) DO
  2109. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2110. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2111. END;
  2112. END AddAXAXLoop;
  2113. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2114. BEGIN
  2115. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2116. SIZEOF( LONGREAL ), loopAddAXAX );
  2117. RETURN RESULT
  2118. END "+";
  2119. (** COMPLEX *)
  2120. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2121. VAR lval, rval: COMPLEX;
  2122. BEGIN
  2123. WHILE (len > 0) DO
  2124. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2125. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2126. END;
  2127. END AddAZAZLoop;
  2128. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2129. BEGIN
  2130. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2131. SIZEOF( COMPLEX ), loopAddAZAZ );
  2132. RETURN RESULT
  2133. END "+";
  2134. (** HUGEINT *)
  2135. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2136. VAR lval, rval: HUGEINT;
  2137. BEGIN
  2138. WHILE (len > 0) DO
  2139. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2140. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2141. END;
  2142. END AddAHAHLoop;
  2143. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY [?] OF HUGEINT;
  2144. BEGIN
  2145. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2146. SIZEOF( HUGEINT ), AddAHAHLoop);
  2147. RETURN RESULT
  2148. END "+";
  2149. (** SIZE *)
  2150. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2151. VAR lval, rval: SIZE;
  2152. BEGIN
  2153. WHILE (len > 0) DO
  2154. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2155. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2156. END;
  2157. END AddAYAYLoop;
  2158. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  2159. BEGIN
  2160. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2161. SIZEOF( SIZE ), AddAYAYLoop);
  2162. RETURN RESULT
  2163. END "+";
  2164. (** LONGCOMPLEX *)
  2165. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2166. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2167. BEGIN
  2168. WHILE (len > 0) DO
  2169. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2170. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2171. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2172. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2173. DEC( len );
  2174. END;
  2175. END AddALZALZLoop;
  2176. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2177. BEGIN
  2178. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2179. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2180. RETURN RESULT
  2181. END "+";
  2182. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2183. (** SHORTINT *)
  2184. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2185. VAR lval, rval: SHORTINT;
  2186. BEGIN
  2187. SYSTEM.GET( radr, rval );
  2188. WHILE (len > 0) DO
  2189. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2190. INC( dadr, dinc ); DEC( len );
  2191. END;
  2192. END AddASSSLoop;
  2193. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2194. BEGIN
  2195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2196. SIZEOF( SHORTINT ), AddASSSLoop );
  2197. RETURN RESULT
  2198. END "+";
  2199. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2200. BEGIN
  2201. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2202. SIZEOF( SHORTINT ), AddASSSLoop );
  2203. RETURN RESULT
  2204. END "+";
  2205. (** INTEGER *)
  2206. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2207. VAR lval, rval: INTEGER;
  2208. BEGIN
  2209. SYSTEM.GET( radr, rval );
  2210. WHILE (len > 0) DO
  2211. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2212. INC( dadr, dinc ); DEC( len );
  2213. END;
  2214. END AddAISILoop;
  2215. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2216. BEGIN
  2217. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2218. SIZEOF( INTEGER ), AddAISILoop );
  2219. RETURN RESULT
  2220. END "+";
  2221. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2222. BEGIN
  2223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2224. SIZEOF( INTEGER ), AddAISILoop );
  2225. RETURN RESULT
  2226. END "+";
  2227. (** LONGINT *)
  2228. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2229. VAR lval, rval: LONGINT;
  2230. BEGIN
  2231. SYSTEM.GET( radr, rval );
  2232. WHILE (len > 0) DO
  2233. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2234. INC( dadr, dinc ); DEC( len );
  2235. END;
  2236. END AddALSLLoop;
  2237. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2238. BEGIN
  2239. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2240. SIZEOF( LONGINT ), AddALSLLoop );
  2241. RETURN RESULT
  2242. END "+";
  2243. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2244. BEGIN
  2245. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2246. SIZEOF( LONGINT ), AddALSLLoop );
  2247. RETURN RESULT
  2248. END "+";
  2249. (** REAL *)
  2250. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2251. VAR lval, rval: REAL;
  2252. BEGIN
  2253. SYSTEM.GET( radr, rval );
  2254. WHILE (len > 0) DO
  2255. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2256. INC( dadr, dinc ); DEC( len );
  2257. END;
  2258. END AddARSRLoop;
  2259. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2260. BEGIN
  2261. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2262. AddARSRLoop );
  2263. RETURN RESULT
  2264. END "+";
  2265. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2266. BEGIN
  2267. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2268. AddARSRLoop );
  2269. RETURN RESULT
  2270. END "+";
  2271. (** LONGREAL *)
  2272. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2273. VAR lval, rval: LONGREAL;
  2274. BEGIN
  2275. SYSTEM.GET( radr, rval );
  2276. WHILE (len > 0) DO
  2277. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2278. INC( dadr, dinc ); DEC( len );
  2279. END;
  2280. END AddAXSXLoop;
  2281. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2282. BEGIN
  2283. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2284. SIZEOF( LONGREAL ), AddAXSXLoop );
  2285. RETURN RESULT
  2286. END "+";
  2287. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2288. BEGIN
  2289. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2290. SIZEOF( LONGREAL ), AddAXSXLoop );
  2291. RETURN RESULT
  2292. END "+";
  2293. (** COMPLEX *)
  2294. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2295. VAR lval, rval: COMPLEX;
  2296. BEGIN
  2297. SYSTEM.GET( radr, rval );
  2298. WHILE (len > 0) DO
  2299. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2300. INC( dadr, dinc ); DEC( len );
  2301. END;
  2302. END AddAZSZLoop;
  2303. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2304. BEGIN
  2305. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2306. AddAZSZLoop );
  2307. RETURN RESULT
  2308. END "+";
  2309. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2310. BEGIN
  2311. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2312. AddAZSZLoop );
  2313. RETURN RESULT
  2314. END "+";
  2315. (** HUGEINT *)
  2316. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2317. VAR lval, rval: HUGEINT;
  2318. BEGIN
  2319. SYSTEM.GET( radr, rval );
  2320. WHILE (len > 0) DO
  2321. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2322. INC( dadr, dinc ); DEC( len );
  2323. END;
  2324. END AddAHSHLoop;
  2325. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY [ ? ] OF HUGEINT;
  2326. BEGIN
  2327. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2328. AddAZSZLoop );
  2329. RETURN RESULT
  2330. END "+";
  2331. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY [ ? ] OF HUGEINT;
  2332. BEGIN
  2333. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2334. AddAZSZLoop );
  2335. RETURN RESULT
  2336. END "+";
  2337. (** SIZE *)
  2338. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2339. VAR lval, rval: SIZE;
  2340. BEGIN
  2341. SYSTEM.GET( radr, rval );
  2342. WHILE (len > 0) DO
  2343. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2344. INC( dadr, dinc ); DEC( len );
  2345. END;
  2346. END AddAYSYLoop;
  2347. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2348. BEGIN
  2349. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SIZE ),
  2350. AddAYSYLoop );
  2351. RETURN RESULT
  2352. END "+";
  2353. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2354. BEGIN
  2355. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( SIZE ),
  2356. AddAYSYLoop );
  2357. RETURN RESULT
  2358. END "+";
  2359. (** LONGCOMPLEX *)
  2360. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2361. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2362. BEGIN
  2363. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2364. WHILE (len > 0) DO
  2365. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2366. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2367. INC( ladr, linc );
  2368. INC( dadr, dinc ); DEC( len );
  2369. END;
  2370. END AddALZSLZLoop;
  2371. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2372. BEGIN
  2373. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2374. AddALZSLZLoop );
  2375. RETURN RESULT
  2376. END "+";
  2377. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2378. BEGIN
  2379. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2380. AddALZSLZLoop );
  2381. RETURN RESULT
  2382. END "+";
  2383. (*** subtraction array - array -> array ********************************************************************)
  2384. (** SHORTINT *)
  2385. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2386. VAR lval, rval: SHORTINT;
  2387. BEGIN
  2388. WHILE (len > 0) DO
  2389. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2390. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2391. END;
  2392. END SubASASLoop;
  2393. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2394. BEGIN
  2395. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2396. SIZEOF( SHORTINT ), SubASASLoop );
  2397. RETURN RESULT
  2398. END "-";
  2399. (** INTEGER *)
  2400. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2401. VAR lval, rval: INTEGER;
  2402. BEGIN
  2403. WHILE (len > 0) DO
  2404. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2405. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2406. END;
  2407. END SubAIAILoop;
  2408. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2409. BEGIN
  2410. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2411. SIZEOF( INTEGER ), SubAIAILoop );
  2412. RETURN RESULT
  2413. END "-";
  2414. (** LONGINT *)
  2415. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2416. VAR lval, rval: LONGINT;
  2417. BEGIN
  2418. WHILE (len > 0) DO
  2419. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2420. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2421. END;
  2422. END SubALALLoop;
  2423. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2424. BEGIN
  2425. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2426. SIZEOF( LONGINT ), SubALALLoop );
  2427. RETURN RESULT
  2428. END "-";
  2429. (** REAL *)
  2430. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2431. VAR lval, rval: REAL;
  2432. BEGIN
  2433. WHILE (len > 0) DO
  2434. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2435. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2436. END;
  2437. END SubARARLoop;
  2438. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2439. BEGIN
  2440. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2441. SubARARLoop );
  2442. RETURN RESULT
  2443. END "-";
  2444. (** LONGREAL *)
  2445. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2446. VAR lval, rval: LONGREAL;
  2447. BEGIN
  2448. WHILE (len > 0) DO
  2449. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2450. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2451. END;
  2452. END SubAXAXLoop;
  2453. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2454. BEGIN
  2455. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2456. SIZEOF( LONGREAL ), SubAXAXLoop );
  2457. RETURN RESULT
  2458. END "-";
  2459. (** COMPLEX *)
  2460. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2461. VAR lval, rval: COMPLEX;
  2462. BEGIN
  2463. WHILE (len > 0) DO
  2464. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2465. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2466. END;
  2467. END SubAZAZLoop;
  2468. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2469. BEGIN
  2470. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2471. SIZEOF( COMPLEX ), SubAZAZLoop );
  2472. RETURN RESULT
  2473. END "-";
  2474. (** LONGCOMPLEX *)
  2475. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2476. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2477. BEGIN
  2478. WHILE (len > 0) DO
  2479. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2480. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2481. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2482. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2483. DEC( len );
  2484. END;
  2485. END SubALZALZLoop;
  2486. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2487. BEGIN
  2488. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2489. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2490. RETURN RESULT
  2491. END "-";
  2492. (*** subtraction array-scalar -> array ********************************************************************)
  2493. (** SHORTINT *)
  2494. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2495. BEGIN
  2496. RESULT := left + (-right);
  2497. RETURN RESULT
  2498. END "-";
  2499. (** INTEGER *)
  2500. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2501. BEGIN
  2502. RESULT := left + (-right);
  2503. RETURN RESULT
  2504. END "-";
  2505. (** LONGINT *)
  2506. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2507. BEGIN
  2508. RESULT := left + (-right);
  2509. RETURN RESULT
  2510. END "-";
  2511. (** REAL *)
  2512. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2513. BEGIN
  2514. RESULT := left + (-right);
  2515. RETURN RESULT
  2516. END "-";
  2517. (** LONGREAL *)
  2518. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2519. BEGIN
  2520. RESULT := left + (-right);
  2521. RETURN RESULT
  2522. END "-";
  2523. (** COMPLEX *)
  2524. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2525. BEGIN
  2526. RESULT := left + (-right);
  2527. RETURN RESULT
  2528. END "-";
  2529. (** LONGCOMPLEX *)
  2530. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2531. BEGIN
  2532. RESULT := left + (-right);
  2533. RETURN RESULT
  2534. END "-";
  2535. (*** subtraction scalar-array -> array ********************************************************************)
  2536. (** SHORTINT *)
  2537. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2538. VAR lval, rval, dval: SHORTINT;
  2539. BEGIN
  2540. SYSTEM.GET( radr, rval );
  2541. WHILE (len > 0) DO
  2542. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2543. INC( dadr, dinc ); DEC( len );
  2544. END;
  2545. END SubSSASLoop;
  2546. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2547. BEGIN
  2548. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2549. SIZEOF( SHORTINT ), SubSSASLoop );
  2550. RETURN RESULT
  2551. END "-";
  2552. (** INTEGER *)
  2553. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2554. VAR lval, rval, dval: INTEGER;
  2555. BEGIN
  2556. SYSTEM.GET( radr, rval );
  2557. WHILE (len > 0) DO
  2558. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2559. INC( dadr, dinc ); DEC( len );
  2560. END;
  2561. END SubSIAILoop;
  2562. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2563. BEGIN
  2564. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2565. SIZEOF( INTEGER ), SubSIAILoop );
  2566. RETURN RESULT
  2567. END "-";
  2568. (** LONGINT *)
  2569. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2570. VAR lval, rval, dval: LONGINT;
  2571. BEGIN
  2572. SYSTEM.GET( radr, rval );
  2573. WHILE (len > 0) DO
  2574. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2575. INC( dadr, dinc ); DEC( len );
  2576. END;
  2577. END SubSLALLoop;
  2578. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2579. BEGIN
  2580. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2581. SIZEOF( LONGINT ), SubSLALLoop );
  2582. RETURN RESULT
  2583. END "-";
  2584. (** REAL *)
  2585. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2586. VAR lval, rval, dval: REAL;
  2587. BEGIN
  2588. SYSTEM.GET( radr, rval );
  2589. WHILE (len > 0) DO
  2590. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2591. INC( dadr, dinc ); DEC( len );
  2592. END;
  2593. END SubSRARLoop;
  2594. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2595. BEGIN
  2596. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2597. SubSRARLoop );
  2598. RETURN RESULT
  2599. END "-";
  2600. (** LONGREAL *)
  2601. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2602. VAR lval, rval, dval: LONGREAL;
  2603. BEGIN
  2604. SYSTEM.GET( radr, rval );
  2605. WHILE (len > 0) DO
  2606. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2607. INC( dadr, dinc ); DEC( len );
  2608. END;
  2609. END SubSXAXLoop;
  2610. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2611. BEGIN
  2612. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2613. SIZEOF( LONGREAL ), SubSXAXLoop );
  2614. RETURN RESULT
  2615. END "-";
  2616. (** COMPLEX *)
  2617. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2618. VAR lval, rval, dval: COMPLEX;
  2619. BEGIN
  2620. SYSTEM.GET( radr, rval );
  2621. WHILE (len > 0) DO
  2622. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2623. INC( dadr, dinc ); DEC( len );
  2624. END;
  2625. END SubSZAZLoop;
  2626. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2627. BEGIN
  2628. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2629. SIZEOF( COMPLEX ), SubSZAZLoop );
  2630. RETURN RESULT
  2631. END "-";
  2632. (** LONGCOMPLEX *)
  2633. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2634. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2635. BEGIN
  2636. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2637. WHILE (len > 0) DO
  2638. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2639. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2640. INC( ladr, linc );
  2641. INC( dadr, dinc ); DEC( len );
  2642. END;
  2643. END SubSLZALZLoop;
  2644. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2645. BEGIN
  2646. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2647. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2648. RETURN RESULT
  2649. END "-";
  2650. (*** element-wise multiply array x array -> array ********************************************************************)
  2651. (** SHORTINT *)
  2652. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2653. VAR lval, rval: SHORTINT;
  2654. BEGIN
  2655. WHILE (len > 0) DO
  2656. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2657. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2658. END;
  2659. END EMulASASLoop;
  2660. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2661. BEGIN
  2662. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2663. SIZEOF( SHORTINT ), EMulASASLoop );
  2664. RETURN RESULT
  2665. END ".*";
  2666. (** INTEGER *)
  2667. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2668. VAR lval, rval: INTEGER; dval: INTEGER;
  2669. BEGIN
  2670. WHILE (len > 0) DO
  2671. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2672. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2673. DEC( len );
  2674. END;
  2675. END EMulAIAILoop;
  2676. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2677. BEGIN
  2678. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2679. SIZEOF( INTEGER ), EMulAIAILoop );
  2680. RETURN RESULT
  2681. END ".*";
  2682. (** LONGINT *)
  2683. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2684. VAR lval, rval: LONGINT;
  2685. BEGIN
  2686. WHILE (len > 0) DO
  2687. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2688. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2689. END;
  2690. END EMulALALLoop;
  2691. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2692. BEGIN
  2693. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2694. SIZEOF( LONGINT ), EMulALALLoop );
  2695. RETURN RESULT
  2696. END ".*";
  2697. (** REAL *)
  2698. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2699. VAR lval, rval: REAL;
  2700. BEGIN
  2701. WHILE (len > 0) DO
  2702. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2703. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2704. END;
  2705. END EMulARARLoop;
  2706. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2707. BEGIN
  2708. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2709. EMulARARLoop );
  2710. RETURN RESULT
  2711. END ".*";
  2712. (** LONGREAL *)
  2713. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2714. VAR lval, rval: LONGREAL;
  2715. BEGIN
  2716. WHILE (len > 0) DO
  2717. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2718. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2719. END;
  2720. END EMulAXAXLoop;
  2721. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2722. BEGIN
  2723. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2724. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2725. RETURN RESULT
  2726. END ".*";
  2727. (** COMPLEX *)
  2728. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2729. VAR lval, rval: COMPLEX;
  2730. BEGIN
  2731. WHILE (len > 0) DO
  2732. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2733. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2734. END;
  2735. END EMulAZAZLoop;
  2736. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2737. BEGIN
  2738. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2739. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2740. RETURN RESULT
  2741. END ".*";
  2742. (** LONGCOMPLEX *)
  2743. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2744. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2745. BEGIN
  2746. WHILE (len > 0) DO
  2747. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2748. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2749. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2750. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2751. DEC( len );
  2752. END;
  2753. END EMulALZALZLoop;
  2754. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2755. BEGIN
  2756. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2757. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2758. RETURN RESULT
  2759. END ".*";
  2760. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2761. (** SHORTINT *)
  2762. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2763. VAR lval, rval,dval: SHORTINT;
  2764. BEGIN
  2765. WHILE (len > 0) DO
  2766. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2767. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2768. END;
  2769. END EMulIncASASLoop;
  2770. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2771. BEGIN
  2772. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2773. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2774. END ".*+";
  2775. (** INTEGER *)
  2776. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2777. VAR lval, rval,dval: INTEGER;
  2778. BEGIN
  2779. WHILE (len > 0) DO
  2780. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2781. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2782. DEC( len );
  2783. END;
  2784. END EMulIncAIAILoop;
  2785. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2786. BEGIN
  2787. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2788. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2789. END ".*+";
  2790. (** LONGINT *)
  2791. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2792. VAR lval, rval,dval: LONGINT;
  2793. BEGIN
  2794. WHILE (len > 0) DO
  2795. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2796. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2797. END;
  2798. END EMulIncALALLoop;
  2799. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2800. BEGIN
  2801. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2802. SIZEOF( LONGINT ), EMulIncALALLoop );
  2803. END ".*+";
  2804. (** REAL *)
  2805. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2806. VAR lval, rval,dval: REAL;
  2807. BEGIN
  2808. WHILE (len > 0) DO
  2809. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2810. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2811. END;
  2812. END EMulIncARARLoop;
  2813. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2814. BEGIN
  2815. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2816. EMulIncARARLoop );
  2817. END ".*+";
  2818. (** LONGREAL *)
  2819. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2820. VAR lval, rval,dval: LONGREAL;
  2821. BEGIN
  2822. WHILE (len > 0) DO
  2823. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2824. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2825. END;
  2826. END EMulIncAXAXLoop;
  2827. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2828. BEGIN
  2829. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2830. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2831. END ".*+";
  2832. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2833. (** SHORTINT *)
  2834. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2835. VAR lval, rval: SHORTINT;
  2836. BEGIN
  2837. SYSTEM.GET( radr, rval );
  2838. WHILE (len > 0) DO
  2839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2840. INC( dadr, dinc ); DEC( len );
  2841. END;
  2842. END MulASSSLoop;
  2843. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2844. BEGIN
  2845. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2846. SIZEOF( SHORTINT ), MulASSSLoop );
  2847. RETURN RESULT
  2848. END "*";
  2849. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2850. BEGIN
  2851. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2852. SIZEOF( SHORTINT ), MulASSSLoop );
  2853. RETURN RESULT
  2854. END "*";
  2855. (** INTEGER *)
  2856. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2857. VAR lval, rval: INTEGER;
  2858. BEGIN
  2859. SYSTEM.GET( radr, rval );
  2860. WHILE (len > 0) DO
  2861. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2862. INC( dadr, dinc ); DEC( len );
  2863. END;
  2864. END MulAISILoop;
  2865. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2866. BEGIN
  2867. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2868. SIZEOF( INTEGER ), MulAISILoop );
  2869. RETURN RESULT
  2870. END "*";
  2871. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2872. BEGIN
  2873. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2874. SIZEOF( INTEGER ), MulAISILoop );
  2875. RETURN RESULT
  2876. END "*";
  2877. (** LONGINT *)
  2878. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2879. VAR lval, rval: LONGINT;
  2880. BEGIN
  2881. SYSTEM.GET( radr, rval );
  2882. WHILE (len > 0) DO
  2883. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2884. INC( dadr, dinc ); DEC( len );
  2885. END;
  2886. END MulALSLLoop;
  2887. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2888. BEGIN
  2889. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2890. SIZEOF( LONGINT ), MulALSLLoop );
  2891. RETURN RESULT
  2892. END "*";
  2893. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2894. BEGIN
  2895. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2896. SIZEOF( LONGINT ), MulALSLLoop );
  2897. RETURN RESULT
  2898. END "*";
  2899. (** REAL *)
  2900. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2901. VAR lval, rval: REAL;
  2902. BEGIN
  2903. SYSTEM.GET( radr, rval );
  2904. WHILE (len > 0) DO
  2905. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2906. INC( dadr, dinc ); DEC( len );
  2907. END;
  2908. END MulARSRLoop;
  2909. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2910. BEGIN
  2911. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2912. loopMulARSR );
  2913. RETURN RESULT
  2914. END "*";
  2915. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2916. BEGIN
  2917. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2918. loopMulARSR );
  2919. RETURN RESULT
  2920. END "*";
  2921. (** LONGREAL *)
  2922. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2923. VAR lval, rval: LONGREAL;
  2924. BEGIN
  2925. IF debug THEN
  2926. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2927. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2928. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2929. END;
  2930. SYSTEM.GET( radr, rval );
  2931. WHILE (len > 0) DO
  2932. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2933. INC( dadr, dinc ); DEC( len );
  2934. END;
  2935. END MulAXSXLoop;
  2936. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2937. BEGIN
  2938. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2939. SIZEOF( LONGREAL ), loopMulAXSX );
  2940. RETURN RESULT
  2941. END "*";
  2942. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2943. BEGIN
  2944. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2945. SIZEOF( LONGREAL ), loopMulAXSX );
  2946. RETURN RESULT
  2947. END "*";
  2948. (** COMPLEX *)
  2949. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2950. VAR lval, rval: COMPLEX;
  2951. BEGIN
  2952. SYSTEM.GET( radr, rval );
  2953. WHILE (len > 0) DO
  2954. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2955. INC( dadr, dinc ); DEC( len );
  2956. END;
  2957. END MulAZSZLoop;
  2958. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2959. BEGIN
  2960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2961. loopMulAZSZ );
  2962. RETURN RESULT
  2963. END "*";
  2964. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2965. BEGIN
  2966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2967. loopMulAZSZ );
  2968. RETURN RESULT
  2969. END "*";
  2970. (** LONGCOMPLEX *)
  2971. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2972. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2973. BEGIN
  2974. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2975. WHILE (len > 0) DO
  2976. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2977. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2978. INC( ladr, linc );
  2979. INC( dadr, dinc ); DEC( len );
  2980. END;
  2981. END MulALZSLZLoop;
  2982. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2983. BEGIN
  2984. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2985. loopMulALZSLZ );
  2986. RETURN RESULT
  2987. END "*";
  2988. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2989. BEGIN
  2990. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2991. loopMulALZSLZ );
  2992. RETURN RESULT
  2993. END "*";
  2994. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2995. (** SHORTINT *)
  2996. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2997. VAR lval, rval, dval: SHORTINT;
  2998. BEGIN
  2999. SYSTEM.GET( radr, rval );
  3000. WHILE (len > 0) DO
  3001. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3002. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3003. END;
  3004. END IncMulASSSLoop;
  3005. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3006. BEGIN
  3007. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3008. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3009. END "INCMUL";
  3010. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3011. BEGIN
  3012. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3013. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3014. RETURN RESULT
  3015. END "INCMUL";
  3016. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3017. BEGIN
  3018. RESULT := -RESULT;
  3019. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3020. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3021. RESULT := -RESULT;
  3022. RETURN RESULT
  3023. END "DECMUL";
  3024. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3025. BEGIN
  3026. RESULT := -RESULT;
  3027. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3028. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3029. RESULT := -RESULT;
  3030. RETURN RESULT
  3031. END "DECMUL";
  3032. (** INTEGER *)
  3033. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3034. VAR lval, rval, dval: INTEGER;
  3035. BEGIN
  3036. SYSTEM.GET( radr, rval );
  3037. WHILE (len > 0) DO
  3038. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3039. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3040. END;
  3041. END IncMulAISILoop;
  3042. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3043. BEGIN
  3044. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3045. SIZEOF( INTEGER ), IncMulAISILoop );
  3046. RETURN RESULT
  3047. END "INCMUL";
  3048. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3049. BEGIN
  3050. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3051. SIZEOF( INTEGER ), IncMulAISILoop );
  3052. RETURN RESULT
  3053. END "INCMUL";
  3054. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3055. BEGIN
  3056. RESULT := -RESULT;
  3057. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3058. SIZEOF( INTEGER ), IncMulAISILoop );
  3059. RESULT := -RESULT;
  3060. RETURN RESULT
  3061. END "DECMUL";
  3062. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3063. BEGIN
  3064. RESULT := -RESULT;
  3065. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3066. SIZEOF( INTEGER ), IncMulAISILoop );
  3067. RESULT := -RESULT;
  3068. RETURN RESULT
  3069. END "DECMUL";
  3070. (** LONGINT *)
  3071. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3072. VAR lval, rval, dval: LONGINT;
  3073. BEGIN
  3074. SYSTEM.GET( radr, rval );
  3075. WHILE (len > 0) DO
  3076. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3077. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3078. END;
  3079. END IncMulALSLLoop;
  3080. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3081. BEGIN
  3082. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3083. SIZEOF( LONGINT ), IncMulALSLLoop );
  3084. RETURN RESULT
  3085. END "INCMUL";
  3086. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3087. BEGIN
  3088. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3089. SIZEOF( LONGINT ), IncMulALSLLoop );
  3090. RETURN RESULT
  3091. END "INCMUL";
  3092. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3093. BEGIN
  3094. RESULT := -RESULT;
  3095. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3096. SIZEOF( LONGINT ), IncMulALSLLoop );
  3097. RESULT := -RESULT;
  3098. RETURN RESULT
  3099. END "DECMUL";
  3100. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3101. BEGIN
  3102. RESULT := -RESULT;
  3103. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3104. SIZEOF( LONGINT ), IncMulALSLLoop );
  3105. RESULT := -RESULT;
  3106. RETURN RESULT
  3107. END "DECMUL";
  3108. (** REAL *)
  3109. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3110. VAR lval, rval, dval: REAL;
  3111. BEGIN
  3112. SYSTEM.GET( radr, rval );
  3113. WHILE (len > 0) DO
  3114. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3115. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3116. END;
  3117. END IncMulARSRLoop;
  3118. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3119. BEGIN
  3120. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3121. loopIncMulARSR );
  3122. RETURN RESULT
  3123. END "INCMUL";
  3124. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3125. BEGIN
  3126. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3127. loopIncMulARSR );
  3128. RETURN RESULT
  3129. END "INCMUL";
  3130. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3131. BEGIN
  3132. RESULT := -RESULT;
  3133. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3134. loopIncMulARSR );
  3135. RESULT := -RESULT;
  3136. RETURN RESULT
  3137. END "DECMUL";
  3138. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3139. BEGIN
  3140. RESULT := -RESULT;
  3141. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3142. loopIncMulARSR );
  3143. RESULT := -RESULT;
  3144. RETURN RESULT
  3145. END "DECMUL";
  3146. (** LONGREAL *)
  3147. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3148. VAR lval, rval, dval: LONGREAL;
  3149. BEGIN
  3150. IF debug THEN
  3151. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3152. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3153. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3154. END;
  3155. SYSTEM.GET( radr, rval );
  3156. WHILE (len > 0) DO
  3157. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3158. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3159. END;
  3160. END IncMulAXSXLoop;
  3161. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3162. BEGIN
  3163. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3164. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3165. RETURN RESULT
  3166. END "INCMUL";
  3167. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3168. BEGIN
  3169. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3170. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3171. RETURN RESULT
  3172. END "INCMUL";
  3173. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3174. BEGIN
  3175. RESULT := -RESULT;
  3176. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3177. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3178. RESULT := -RESULT;
  3179. RETURN RESULT
  3180. END "DECMUL";
  3181. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3182. BEGIN
  3183. RESULT := -RESULT;
  3184. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3185. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3186. RESULT := -RESULT;
  3187. RETURN RESULT
  3188. END "DECMUL";
  3189. (*** element-wise division array / array -> array ********************************************************************)
  3190. (** SHORTINT *)
  3191. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3192. VAR lval, rval: SHORTINT; dval: REAL;
  3193. BEGIN
  3194. WHILE (len > 0) DO
  3195. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3196. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3197. DEC( len );
  3198. END;
  3199. END EDivideASASLoop;
  3200. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3201. BEGIN
  3202. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3203. EDivideASASLoop );
  3204. RETURN RESULT
  3205. END "./";
  3206. (** INTEGER *)
  3207. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3208. VAR lval, rval: INTEGER; dval: REAL;
  3209. BEGIN
  3210. WHILE (len > 0) DO
  3211. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3212. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3213. DEC( len );
  3214. END;
  3215. END EDivideAIAILoop;
  3216. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3217. BEGIN
  3218. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3219. EDivideAIAILoop );
  3220. RETURN RESULT
  3221. END "./";
  3222. (** LONGINT *)
  3223. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3224. VAR lval, rval: LONGINT; dval: REAL;
  3225. BEGIN
  3226. WHILE (len > 0) DO
  3227. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3228. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3229. DEC( len );
  3230. END;
  3231. END EDivideALALLoop;
  3232. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3233. BEGIN
  3234. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3235. EDivideALALLoop );
  3236. RETURN RESULT
  3237. END "./";
  3238. (** REAL *)
  3239. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3240. VAR lval, rval: REAL; dval: REAL;
  3241. BEGIN
  3242. WHILE (len > 0) DO
  3243. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3244. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3245. DEC( len );
  3246. END;
  3247. END EDivideARARLoop;
  3248. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3249. BEGIN
  3250. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3251. EDivideARARLoop );
  3252. RETURN RESULT
  3253. END "./";
  3254. (** LONGREAL *)
  3255. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3256. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3257. BEGIN
  3258. WHILE (len > 0) DO
  3259. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3260. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3261. DEC( len );
  3262. END;
  3263. END EDivideAXAXLoop;
  3264. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3265. BEGIN
  3266. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3267. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3268. RETURN RESULT
  3269. END "./";
  3270. (** COMPLEX *)
  3271. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3272. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3273. BEGIN
  3274. WHILE (len > 0) DO
  3275. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3276. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3277. DEC( len );
  3278. END;
  3279. END EDivideAZAZLoop;
  3280. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3281. BEGIN
  3282. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3283. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3284. RETURN RESULT
  3285. END "./";
  3286. (** LONGCOMPLEX *)
  3287. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3288. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3289. BEGIN
  3290. WHILE (len > 0) DO
  3291. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3292. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3293. IF rvalIm # 0.0D0 THEN
  3294. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3295. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3296. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3297. ELSE
  3298. dvalRe := lvalRe/rvalRe;
  3299. dvalIm := lvalIm/rvalRe;
  3300. END;
  3301. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3302. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3303. DEC( len );
  3304. END;
  3305. END EDivideALZALZLoop;
  3306. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3307. BEGIN
  3308. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3309. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3310. RETURN RESULT
  3311. END "./";
  3312. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3313. (** SHORTINT *)
  3314. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3315. VAR lval, rval: SHORTINT; dval: REAL;
  3316. BEGIN
  3317. SYSTEM.GET( radr, rval );
  3318. WHILE (len > 0) DO
  3319. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3320. INC( dadr, dinc ); DEC( len );
  3321. END;
  3322. END DivideASSSLoop;
  3323. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3324. BEGIN
  3325. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3326. DivideASSSLoop );
  3327. RETURN RESULT
  3328. END "/";
  3329. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3330. VAR lval, rval: SHORTINT; dval: REAL;
  3331. BEGIN
  3332. SYSTEM.GET( radr, rval );
  3333. WHILE (len > 0) DO
  3334. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3335. INC( dadr, dinc ); DEC( len );
  3336. END;
  3337. END DivideSSASLoop;
  3338. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3339. BEGIN
  3340. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3341. DivideSSASLoop );
  3342. RETURN RESULT
  3343. END "/";
  3344. (** INTEGER *)
  3345. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3346. VAR lval, rval: INTEGER; dval: REAL;
  3347. BEGIN
  3348. SYSTEM.GET( radr, rval );
  3349. WHILE (len > 0) DO
  3350. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3351. INC( dadr, dinc ); DEC( len );
  3352. END;
  3353. END DivideAISILoop;
  3354. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3355. BEGIN
  3356. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3357. DivideAISILoop );
  3358. RETURN RESULT
  3359. END "/";
  3360. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3361. VAR lval, rval: INTEGER; dval: REAL;
  3362. BEGIN
  3363. SYSTEM.GET( radr, rval );
  3364. WHILE (len > 0) DO
  3365. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3366. INC( dadr, dinc ); DEC( len );
  3367. END;
  3368. END DivideSIAILoop;
  3369. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3370. BEGIN
  3371. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3372. DivideSIAILoop );
  3373. RETURN RESULT
  3374. END "/";
  3375. (** LONGINT *)
  3376. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3377. VAR lval, rval: LONGINT; dval: REAL;
  3378. BEGIN
  3379. SYSTEM.GET( radr, rval );
  3380. WHILE (len > 0) DO
  3381. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3382. INC( dadr, dinc ); DEC( len );
  3383. END;
  3384. END DivideALSLLoop;
  3385. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3386. BEGIN
  3387. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3388. DivideALSLLoop );
  3389. RETURN RESULT
  3390. END "/";
  3391. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3392. VAR lval, rval: LONGINT; dval: REAL;
  3393. BEGIN
  3394. SYSTEM.GET( radr, rval );
  3395. WHILE (len > 0) DO
  3396. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3397. INC( dadr, dinc ); DEC( len );
  3398. END;
  3399. END DivideSLALLoop;
  3400. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3401. BEGIN
  3402. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3403. DivideSLALLoop );
  3404. RETURN RESULT
  3405. END "/";
  3406. (** REAL *)
  3407. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3408. VAR lval, rval: REAL; dval: REAL;
  3409. BEGIN
  3410. SYSTEM.GET( radr, rval );
  3411. WHILE (len > 0) DO
  3412. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3413. INC( dadr, dinc ); DEC( len );
  3414. END;
  3415. END DivideARSRLoop;
  3416. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3417. BEGIN
  3418. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3419. DivideARSRLoop );
  3420. RETURN RESULT
  3421. END "/";
  3422. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3423. VAR lval, rval: REAL; dval: REAL;
  3424. BEGIN
  3425. SYSTEM.GET( radr, rval );
  3426. WHILE (len > 0) DO
  3427. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3428. INC( dadr, dinc ); DEC( len );
  3429. END;
  3430. END DivideSRARLoop;
  3431. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3432. BEGIN
  3433. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3434. DivideSRARLoop );
  3435. RETURN RESULT
  3436. END "/";
  3437. (** LONGREAL *)
  3438. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3439. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3440. BEGIN
  3441. SYSTEM.GET( radr, rval );
  3442. WHILE (len > 0) DO
  3443. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3444. INC( dadr, dinc ); DEC( len );
  3445. END;
  3446. END DivideAXSXLoop;
  3447. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3448. BEGIN
  3449. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3450. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3451. RETURN RESULT
  3452. END "/";
  3453. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3454. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3455. BEGIN
  3456. SYSTEM.GET( radr, rval );
  3457. WHILE (len > 0) DO
  3458. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3459. INC( dadr, dinc ); DEC( len );
  3460. END;
  3461. END DivideSXAXLoop;
  3462. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3463. BEGIN
  3464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3465. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3466. RETURN RESULT
  3467. END "/";
  3468. (** COMPLEX *)
  3469. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3470. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3471. BEGIN
  3472. SYSTEM.GET( radr, rval );
  3473. WHILE (len > 0) DO
  3474. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3475. INC( dadr, dinc ); DEC( len );
  3476. END;
  3477. END DivideAZSZLoop;
  3478. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3479. BEGIN
  3480. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3481. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3482. RETURN RESULT
  3483. END "/";
  3484. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3485. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3486. BEGIN
  3487. SYSTEM.GET( radr, rval );
  3488. WHILE (len > 0) DO
  3489. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3490. INC( dadr, dinc ); DEC( len );
  3491. END;
  3492. END DivideSZAZLoop;
  3493. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3494. BEGIN
  3495. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3496. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3497. RETURN RESULT
  3498. END "/";
  3499. (** LONGCOMPLEX *)
  3500. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3501. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3502. BEGIN
  3503. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3504. IF rvalIm # 0.0D0 THEN
  3505. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3506. WHILE (len > 0) DO
  3507. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3508. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3509. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3510. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3511. INC( ladr, linc );
  3512. INC( dadr, dinc ); DEC( len );
  3513. END;
  3514. ELSE
  3515. WHILE (len > 0) DO
  3516. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3517. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3518. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3519. INC( ladr, linc );
  3520. INC( dadr, dinc ); DEC( len );
  3521. END;
  3522. END;
  3523. END DivideALZSLZLoop;
  3524. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3525. BEGIN
  3526. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3527. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3528. RETURN RESULT
  3529. END "/";
  3530. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3531. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3532. BEGIN
  3533. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3534. WHILE (len > 0) DO
  3535. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3536. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3537. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3538. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3539. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3540. INC( ladr, linc );
  3541. INC( dadr, dinc ); DEC( len );
  3542. END;
  3543. END DivideSLZALZLoop;
  3544. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3545. BEGIN
  3546. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3547. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3548. RETURN RESULT
  3549. END "/";
  3550. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3551. (** SHORTINT *)
  3552. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3553. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3554. BEGIN
  3555. WHILE (len > 0) DO
  3556. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3557. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3558. DEC( len );
  3559. END;
  3560. END EDivASASLoop;
  3561. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3562. BEGIN
  3563. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3564. SIZEOF( SHORTINT ), EDivASASLoop );
  3565. RETURN RESULT
  3566. END "DIV";
  3567. (** INTEGER *)
  3568. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3569. VAR lval, rval: INTEGER; dval: INTEGER;
  3570. BEGIN
  3571. WHILE (len > 0) DO
  3572. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3573. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3574. DEC( len );
  3575. END;
  3576. END EDivAIAILoop;
  3577. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3578. BEGIN
  3579. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3580. SIZEOF( INTEGER ), EDivAIAILoop );
  3581. RETURN RESULT
  3582. END "DIV";
  3583. (** LONGINT *)
  3584. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3585. VAR lval, rval: LONGINT; dval: LONGINT;
  3586. BEGIN
  3587. WHILE (len > 0) DO
  3588. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3589. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3590. DEC( len );
  3591. END;
  3592. END EDivALALLoop;
  3593. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3594. BEGIN
  3595. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3596. SIZEOF( LONGINT ), EDivALALLoop );
  3597. RETURN RESULT
  3598. END "DIV";
  3599. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3600. (** SHORTINT *)
  3601. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3602. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3603. BEGIN
  3604. SYSTEM.GET( radr, rval );
  3605. WHILE (len > 0) DO
  3606. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3607. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3608. END;
  3609. END DivASSSLoop;
  3610. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3611. BEGIN
  3612. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3613. SIZEOF( SHORTINT ), DivASSSLoop );
  3614. RETURN RESULT
  3615. END "DIV";
  3616. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3617. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3618. BEGIN
  3619. SYSTEM.GET( radr, rval );
  3620. WHILE (len > 0) DO
  3621. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3622. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3623. END;
  3624. END DivSSASLoop;
  3625. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3626. BEGIN
  3627. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3628. SIZEOF( SHORTINT ), DivSSASLoop );
  3629. RETURN RESULT
  3630. END "DIV";
  3631. (** INTEGER *)
  3632. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3633. VAR lval, rval: INTEGER; dval: INTEGER;
  3634. BEGIN
  3635. SYSTEM.GET( radr, rval );
  3636. WHILE (len > 0) DO
  3637. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3638. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3639. END;
  3640. END DivAISILoop;
  3641. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3642. BEGIN
  3643. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3644. SIZEOF( INTEGER ), DivAISILoop );
  3645. RETURN RESULT
  3646. END "DIV";
  3647. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3648. VAR lval, rval: INTEGER; dval: INTEGER;
  3649. BEGIN
  3650. SYSTEM.GET( radr, rval );
  3651. WHILE (len > 0) DO
  3652. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3653. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3654. END;
  3655. END DivSIAILoop;
  3656. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3657. BEGIN
  3658. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3659. SIZEOF( INTEGER ), DivSIAILoop );
  3660. RETURN RESULT
  3661. END "DIV";
  3662. (** LONGINT *)
  3663. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3664. VAR lval, rval: LONGINT; dval: LONGINT;
  3665. BEGIN
  3666. SYSTEM.GET( radr, rval );
  3667. WHILE (len > 0) DO
  3668. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3669. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3670. END;
  3671. END DivALSLLoop;
  3672. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3673. BEGIN
  3674. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3675. SIZEOF( LONGINT ), DivALSLLoop );
  3676. RETURN RESULT
  3677. END "DIV";
  3678. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3679. VAR lval, rval: LONGINT; dval: LONGINT;
  3680. BEGIN
  3681. SYSTEM.GET( radr, rval );
  3682. WHILE (len > 0) DO
  3683. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3684. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3685. END;
  3686. END DivSLALLoop;
  3687. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3688. BEGIN
  3689. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3690. SIZEOF( LONGINT ), DivSLALLoop );
  3691. RETURN RESULT
  3692. END "DIV";
  3693. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3694. (** SHORTINT *)
  3695. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3696. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3697. BEGIN
  3698. WHILE (len > 0) DO
  3699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3700. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3701. DEC( len );
  3702. END;
  3703. END EModASASLoop;
  3704. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3705. BEGIN
  3706. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3707. SIZEOF( SHORTINT ), EModASASLoop );
  3708. RETURN RESULT
  3709. END "MOD";
  3710. (** INTEGER *)
  3711. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3712. VAR lval, rval: INTEGER; dval: INTEGER;
  3713. BEGIN
  3714. WHILE (len > 0) DO
  3715. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3716. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3717. DEC( len );
  3718. END;
  3719. END EModAIAILoop;
  3720. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3721. BEGIN
  3722. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3723. SIZEOF( INTEGER ), EModAIAILoop );
  3724. RETURN RESULT
  3725. END "MOD";
  3726. (** LONGINT *)
  3727. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3728. VAR lval, rval: LONGINT; dval: LONGINT;
  3729. BEGIN
  3730. WHILE (len > 0) DO
  3731. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3732. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3733. DEC( len );
  3734. END;
  3735. END EModALALLoop;
  3736. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3737. BEGIN
  3738. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3739. SIZEOF( LONGINT ), EModALALLoop );
  3740. RETURN RESULT
  3741. END "MOD";
  3742. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3743. (** SHORTINT *)
  3744. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3745. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3746. BEGIN
  3747. SYSTEM.GET( radr, rval );
  3748. WHILE (len > 0) DO
  3749. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3750. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3751. END;
  3752. END ModASSSLoop;
  3753. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3754. BEGIN
  3755. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3756. SIZEOF( SHORTINT ), ModASSSLoop );
  3757. RETURN RESULT
  3758. END "MOD";
  3759. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3760. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3761. BEGIN
  3762. SYSTEM.GET( radr, rval );
  3763. WHILE (len > 0) DO
  3764. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3765. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3766. END;
  3767. END ModSSASLoop;
  3768. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3769. BEGIN
  3770. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3771. SIZEOF( SHORTINT ), ModSSASLoop );
  3772. RETURN RESULT
  3773. END "MOD";
  3774. (** INTEGER *)
  3775. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3776. VAR lval, rval: INTEGER; dval: INTEGER;
  3777. BEGIN
  3778. SYSTEM.GET( radr, rval );
  3779. WHILE (len > 0) DO
  3780. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3781. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3782. END;
  3783. END ModAISILoop;
  3784. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3785. BEGIN
  3786. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3787. SIZEOF( INTEGER ), ModAISILoop );
  3788. RETURN RESULT
  3789. END "MOD";
  3790. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3791. VAR lval, rval: INTEGER; dval: INTEGER;
  3792. BEGIN
  3793. SYSTEM.GET( radr, rval );
  3794. WHILE (len > 0) DO
  3795. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3796. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3797. END;
  3798. END ModSIAILoop;
  3799. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3800. BEGIN
  3801. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3802. SIZEOF( INTEGER ), ModSIAILoop );
  3803. RETURN RESULT
  3804. END "MOD";
  3805. (** LONGINT *)
  3806. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3807. VAR lval, rval: LONGINT; dval: LONGINT;
  3808. BEGIN
  3809. SYSTEM.GET( radr, rval );
  3810. WHILE (len > 0) DO
  3811. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3812. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3813. END;
  3814. END ModALSLLoop;
  3815. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3816. BEGIN
  3817. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3818. SIZEOF( LONGINT ), ModALSLLoop );
  3819. RETURN RESULT
  3820. END "MOD";
  3821. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3822. VAR lval, rval: LONGINT; dval: LONGINT;
  3823. BEGIN
  3824. SYSTEM.GET( radr, rval );
  3825. WHILE (len > 0) DO
  3826. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3827. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3828. END;
  3829. END ModSLALLoop;
  3830. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3831. BEGIN
  3832. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3833. SIZEOF( LONGINT ), ModSLALLoop );
  3834. RETURN RESULT
  3835. END "MOD";
  3836. (*** scalar product <array,array> -> scalar ********************************************************************)
  3837. (** SHORTINT *)
  3838. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3839. VAR lval, rval: SHORTINT; dval: LONGINT;
  3840. BEGIN
  3841. SYSTEM.GET( dadr, dval );
  3842. WHILE (len > 0) DO
  3843. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3844. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3845. END;
  3846. SYSTEM.PUT( dadr, dval );
  3847. END SPASASLoop;
  3848. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3849. VAR dest: LONGINT;
  3850. BEGIN
  3851. dest := 0;
  3852. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3853. RETURN dest;
  3854. END "+*";
  3855. (** INTEGER *)
  3856. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3857. VAR lval, rval: INTEGER; dval: LONGINT;
  3858. BEGIN
  3859. SYSTEM.GET( dadr, dval );
  3860. WHILE (len > 0) DO
  3861. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3862. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3863. END;
  3864. SYSTEM.PUT( dadr, dval );
  3865. END SPAIAILoop;
  3866. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3867. VAR dest: LONGINT;
  3868. BEGIN
  3869. dest := 0;
  3870. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3871. RETURN dest;
  3872. END "+*";
  3873. (** LONGINT *)
  3874. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3875. VAR lval, rval: LONGINT; dval: LONGINT;
  3876. BEGIN
  3877. SYSTEM.GET( dadr, dval );
  3878. WHILE (len > 0) DO
  3879. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3880. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3881. END;
  3882. SYSTEM.PUT( dadr, dval );
  3883. END SPALALLoop;
  3884. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3885. VAR dest: LONGINT;
  3886. BEGIN
  3887. dest := 0;
  3888. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3889. RETURN dest;
  3890. END "+*";
  3891. (** REAL *)
  3892. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3893. VAR lval, rval: REAL; dval: REAL;
  3894. BEGIN
  3895. SYSTEM.GET( dadr, dval );
  3896. WHILE (len > 0) DO
  3897. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3898. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3899. END;
  3900. SYSTEM.PUT( dadr, dval );
  3901. END SPARARLoop;
  3902. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3903. VAR dest: REAL;
  3904. BEGIN
  3905. dest := 0;
  3906. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3907. RETURN dest;
  3908. END "+*";
  3909. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3910. VAR lval, rval, dval: LONGREAL;
  3911. BEGIN
  3912. IF debug THEN
  3913. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3914. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3915. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3916. END;
  3917. SYSTEM.GET( dadr, dval );
  3918. WHILE (len > 0) DO
  3919. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3920. dval := dval + rval * lval; DEC( len );
  3921. END;
  3922. SYSTEM.PUT( dadr, dval );
  3923. END SPAXAXLoop;
  3924. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3925. VAR dest: LONGREAL;
  3926. BEGIN
  3927. dest := 0;
  3928. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3929. RETURN dest;
  3930. END "+*";
  3931. (** COMPLEX *)
  3932. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3933. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3934. BEGIN
  3935. SYSTEM.GET( dadr, dval );
  3936. WHILE (len > 0) DO
  3937. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3938. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3939. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3940. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3941. END;
  3942. SYSTEM.PUT( dadr, dval );
  3943. END SPAZAZLoop;
  3944. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3945. VAR dest: COMPLEX;
  3946. BEGIN
  3947. dest := 0;
  3948. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3949. RETURN dest;
  3950. END "+*";
  3951. (** COMPLEX *)
  3952. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3953. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3954. BEGIN
  3955. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3956. WHILE (len > 0) DO
  3957. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3958. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3959. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3960. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3961. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3962. END;
  3963. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3964. END SPALZALZLoop;
  3965. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3966. VAR dest: LONGCOMPLEX;
  3967. BEGIN
  3968. dest := 0;
  3969. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3970. RETURN dest;
  3971. END "+*";
  3972. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3973. (** BOOLEAN *)
  3974. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3975. VAR lval, rval: BOOLEAN;
  3976. BEGIN
  3977. WHILE (len > 0) DO
  3978. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3979. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3980. END;
  3981. END EEqlABABLoop;
  3982. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3983. BEGIN
  3984. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3985. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3986. RETURN RESULT
  3987. END ".=";
  3988. (** SHORTINT *)
  3989. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3990. VAR lval, rval: SHORTINT;
  3991. BEGIN
  3992. WHILE (len > 0) DO
  3993. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3994. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3995. END;
  3996. END EEqlASASLoop;
  3997. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3998. BEGIN
  3999. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4000. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4001. RETURN RESULT
  4002. END ".=";
  4003. (** INTEGER *)
  4004. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4005. VAR lval, rval: INTEGER;
  4006. BEGIN
  4007. WHILE (len > 0) DO
  4008. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4009. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4010. END;
  4011. END EEqlAIAILoop;
  4012. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4013. BEGIN
  4014. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4015. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4016. RETURN RESULT
  4017. END ".=";
  4018. (** LONGINT *)
  4019. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4020. VAR lval, rval: LONGINT;
  4021. BEGIN
  4022. WHILE (len > 0) DO
  4023. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4024. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4025. END;
  4026. END EEqlALALLoop;
  4027. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4028. BEGIN
  4029. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4030. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4031. RETURN RESULT
  4032. END ".=";
  4033. (** REAL *)
  4034. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4035. VAR lval, rval: REAL;
  4036. BEGIN
  4037. WHILE (len > 0) DO
  4038. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4039. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4040. END;
  4041. END EEqlARARLoop;
  4042. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4043. BEGIN
  4044. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4045. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4046. RETURN RESULT
  4047. END ".=";
  4048. (** LONGREAL *)
  4049. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4050. VAR lval, rval: LONGREAL;
  4051. BEGIN
  4052. WHILE (len > 0) DO
  4053. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4054. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4055. END;
  4056. END EEqlAXAXLoop;
  4057. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4058. BEGIN
  4059. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4060. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4061. RETURN RESULT
  4062. END ".=";
  4063. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4064. (** BOOLEAN *)
  4065. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4066. VAR lval, rval: BOOLEAN;
  4067. BEGIN
  4068. SYSTEM.GET( radr, rval );
  4069. WHILE (len > 0) DO
  4070. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4071. INC( dadr, dinc ); DEC( len );
  4072. END;
  4073. END EEqlABSBLoop;
  4074. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4075. BEGIN
  4076. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4077. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4078. RETURN RESULT
  4079. END ".=";
  4080. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4081. BEGIN
  4082. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4083. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4084. RETURN RESULT
  4085. END ".=";
  4086. (** SHORTINT *)
  4087. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4088. VAR lval, rval: SHORTINT;
  4089. BEGIN
  4090. SYSTEM.GET( radr, rval );
  4091. WHILE (len > 0) DO
  4092. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4093. INC( dadr, dinc ); DEC( len );
  4094. END;
  4095. END EEqlASSSLoop;
  4096. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4097. BEGIN
  4098. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4099. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4100. RETURN RESULT
  4101. END ".=";
  4102. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4103. BEGIN
  4104. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4105. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4106. RETURN RESULT
  4107. END ".=";
  4108. (** INTEGER *)
  4109. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4110. VAR lval, rval: INTEGER;
  4111. BEGIN
  4112. SYSTEM.GET( radr, rval );
  4113. WHILE (len > 0) DO
  4114. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4115. INC( dadr, dinc ); DEC( len );
  4116. END;
  4117. END EEqlAISILoop;
  4118. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4119. BEGIN
  4120. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4121. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4122. RETURN RESULT
  4123. END ".=";
  4124. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4125. BEGIN
  4126. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4127. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4128. RETURN RESULT
  4129. END ".=";
  4130. (** LONGINT *)
  4131. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4132. VAR lval, rval: LONGINT;
  4133. BEGIN
  4134. SYSTEM.GET( radr, rval );
  4135. WHILE (len > 0) DO
  4136. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4137. INC( dadr, dinc ); DEC( len );
  4138. END;
  4139. END EEqlALSLLoop;
  4140. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4141. BEGIN
  4142. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4143. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4144. RETURN RESULT
  4145. END ".=";
  4146. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4147. BEGIN
  4148. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4149. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4150. RETURN RESULT
  4151. END ".=";
  4152. (** REAL *)
  4153. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4154. VAR lval, rval: REAL;
  4155. BEGIN
  4156. SYSTEM.GET( radr, rval );
  4157. WHILE (len > 0) DO
  4158. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4159. INC( dadr, dinc ); DEC( len );
  4160. END;
  4161. END EEqlARSRLoop;
  4162. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4163. BEGIN
  4164. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4165. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4166. RETURN RESULT
  4167. END ".=";
  4168. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4169. BEGIN
  4170. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4171. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4172. RETURN RESULT
  4173. END ".=";
  4174. (** LONGREAL *)
  4175. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4176. VAR lval, rval: LONGREAL;
  4177. BEGIN
  4178. SYSTEM.GET( radr, rval );
  4179. WHILE (len > 0) DO
  4180. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4181. INC( dadr, dinc ); DEC( len );
  4182. END;
  4183. END EEqlAXSXLoop;
  4184. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4185. BEGIN
  4186. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4187. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4188. RETURN RESULT
  4189. END ".=";
  4190. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4191. BEGIN
  4192. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4193. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4194. RETURN RESULT
  4195. END ".=";
  4196. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4197. (** BOOLEAN *)
  4198. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4199. VAR lval, rval: BOOLEAN;
  4200. BEGIN
  4201. WHILE (len > 0) DO
  4202. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4203. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4204. END;
  4205. END ENeqABABLoop;
  4206. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4207. BEGIN
  4208. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4209. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4210. RETURN RESULT
  4211. END ".#";
  4212. (** SHORTINT *)
  4213. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4214. VAR lval, rval: SHORTINT;
  4215. BEGIN
  4216. WHILE (len > 0) DO
  4217. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4218. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4219. END;
  4220. END ENeqASASLoop;
  4221. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4222. BEGIN
  4223. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4224. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4225. RETURN RESULT
  4226. END ".#";
  4227. (** INTEGER*)
  4228. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4229. VAR lval, rval: INTEGER;
  4230. BEGIN
  4231. WHILE (len > 0) DO
  4232. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4233. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4234. END;
  4235. END ENeqAIAILoop;
  4236. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4237. BEGIN
  4238. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4239. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4240. RETURN RESULT
  4241. END ".#";
  4242. (** LONGINT*)
  4243. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4244. VAR lval, rval: LONGINT;
  4245. BEGIN
  4246. WHILE (len > 0) DO
  4247. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4248. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4249. END;
  4250. END ENeqALALLoop;
  4251. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4252. BEGIN
  4253. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4254. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4255. RETURN RESULT
  4256. END ".#";
  4257. (** REAL *)
  4258. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4259. VAR lval, rval: REAL;
  4260. BEGIN
  4261. WHILE (len > 0) DO
  4262. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4263. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4264. END;
  4265. END ENeqARARLoop;
  4266. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4267. BEGIN
  4268. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4269. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4270. RETURN RESULT
  4271. END ".#";
  4272. (** LONGREAL *)
  4273. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4274. VAR lval, rval: LONGREAL;
  4275. BEGIN
  4276. WHILE (len > 0) DO
  4277. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4278. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4279. END;
  4280. END ENeqAXAXLoop;
  4281. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4282. BEGIN
  4283. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4284. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4285. RETURN RESULT
  4286. END ".#";
  4287. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4288. (** BOOLEAN *)
  4289. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4290. VAR lval, rval: BOOLEAN;
  4291. BEGIN
  4292. SYSTEM.GET( radr, rval );
  4293. WHILE (len > 0) DO
  4294. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4295. INC( dadr, dinc ); DEC( len );
  4296. END;
  4297. END ENeqABSBLoop;
  4298. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4299. BEGIN
  4300. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4301. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4302. RETURN RESULT
  4303. END ".#";
  4304. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4305. BEGIN
  4306. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4307. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4308. RETURN RESULT
  4309. END ".#";
  4310. (** SHORTINT *)
  4311. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4312. VAR lval, rval: SHORTINT;
  4313. BEGIN
  4314. SYSTEM.GET( radr, rval );
  4315. WHILE (len > 0) DO
  4316. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4317. INC( dadr, dinc ); DEC( len );
  4318. END;
  4319. END ENeqASSSLoop;
  4320. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4321. BEGIN
  4322. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4323. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4324. RETURN RESULT
  4325. END ".#";
  4326. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4327. BEGIN
  4328. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4329. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4330. RETURN RESULT
  4331. END ".#";
  4332. (** INTEGER *)
  4333. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4334. VAR lval, rval: INTEGER;
  4335. BEGIN
  4336. SYSTEM.GET( radr, rval );
  4337. WHILE (len > 0) DO
  4338. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4339. INC( dadr, dinc ); DEC( len );
  4340. END;
  4341. END ENeqAISILoop;
  4342. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4343. BEGIN
  4344. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4345. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4346. RETURN RESULT
  4347. END ".#";
  4348. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4349. BEGIN
  4350. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4351. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4352. RETURN RESULT
  4353. END ".#";
  4354. (** LONGINT *)
  4355. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4356. VAR lval, rval: LONGINT;
  4357. BEGIN
  4358. SYSTEM.GET( radr, rval );
  4359. WHILE (len > 0) DO
  4360. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4361. INC( dadr, dinc ); DEC( len );
  4362. END;
  4363. END ENeqALSLLoop;
  4364. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4365. BEGIN
  4366. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4367. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4368. RETURN RESULT
  4369. END ".#";
  4370. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4371. BEGIN
  4372. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4373. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4374. RETURN RESULT
  4375. END ".#";
  4376. (** REAL *)
  4377. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4378. VAR lval, rval: REAL;
  4379. BEGIN
  4380. SYSTEM.GET( radr, rval );
  4381. WHILE (len > 0) DO
  4382. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4383. INC( dadr, dinc ); DEC( len );
  4384. END;
  4385. END ENeqARSRLoop;
  4386. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4387. BEGIN
  4388. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4389. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4390. RETURN RESULT
  4391. END ".#";
  4392. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4393. BEGIN
  4394. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4395. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4396. RETURN RESULT
  4397. END ".#";
  4398. (** LONGREAL *)
  4399. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4400. VAR lval, rval: LONGREAL;
  4401. BEGIN
  4402. SYSTEM.GET( radr, rval );
  4403. WHILE (len > 0) DO
  4404. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4405. INC( dadr, dinc ); DEC( len );
  4406. END;
  4407. END ENeqAXSXLoop;
  4408. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4409. BEGIN
  4410. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4411. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4412. RETURN RESULT
  4413. END ".#";
  4414. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4415. BEGIN
  4416. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4417. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4418. RETURN RESULT
  4419. END ".#";
  4420. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4421. (** SHORTINT *)
  4422. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4423. VAR lval, rval: SHORTINT;
  4424. BEGIN
  4425. WHILE (len > 0) DO
  4426. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4427. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4428. END;
  4429. END EGtrASASLoop;
  4430. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4431. BEGIN
  4432. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4433. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4434. RETURN RESULT
  4435. END ".>";
  4436. (** INTEGER *)
  4437. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4438. VAR lval, rval: INTEGER;
  4439. BEGIN
  4440. WHILE (len > 0) DO
  4441. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4442. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4443. END;
  4444. END EGtrAIAILoop;
  4445. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4446. BEGIN
  4447. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4448. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4449. RETURN RESULT
  4450. END ".>";
  4451. (** LONGINT *)
  4452. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4453. VAR lval, rval: LONGINT;
  4454. BEGIN
  4455. WHILE (len > 0) DO
  4456. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4457. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4458. END;
  4459. END EGtrALALLoop;
  4460. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4461. BEGIN
  4462. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4463. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4464. RETURN RESULT
  4465. END ".>";
  4466. (** REAL *)
  4467. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4468. VAR lval, rval: REAL;
  4469. BEGIN
  4470. WHILE (len > 0) DO
  4471. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4472. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4473. END;
  4474. END EGtrARARLoop;
  4475. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4476. BEGIN
  4477. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4478. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4479. RETURN RESULT
  4480. END ".>";
  4481. (** LONGREAL *)
  4482. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4483. VAR lval, rval: LONGREAL;
  4484. BEGIN
  4485. WHILE (len > 0) DO
  4486. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4487. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4488. END;
  4489. END EGtrAXAXLoop;
  4490. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4491. BEGIN
  4492. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4493. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4494. RETURN RESULT
  4495. END ".>";
  4496. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4497. (** SHORTINT *)
  4498. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4499. VAR lval, rval: SHORTINT;
  4500. BEGIN
  4501. SYSTEM.GET( radr, rval );
  4502. WHILE (len > 0) DO
  4503. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4504. INC( dadr, dinc ); DEC( len );
  4505. END;
  4506. END EGtrASSSLoop;
  4507. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4508. BEGIN
  4509. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4510. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4511. RETURN RESULT
  4512. END ".>";
  4513. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4514. BEGIN
  4515. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4516. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4517. RETURN RESULT
  4518. END ".<";
  4519. (** INTEGER *)
  4520. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4521. VAR lval, rval: INTEGER;
  4522. BEGIN
  4523. SYSTEM.GET( radr, rval );
  4524. WHILE (len > 0) DO
  4525. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4526. INC( dadr, dinc ); DEC( len );
  4527. END;
  4528. END EGtrAISILoop;
  4529. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4530. BEGIN
  4531. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4532. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4533. RETURN RESULT
  4534. END ".>";
  4535. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4536. BEGIN
  4537. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4538. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4539. RETURN RESULT
  4540. END ".<";
  4541. (** LONGINT *)
  4542. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4543. VAR lval, rval: LONGINT;
  4544. BEGIN
  4545. SYSTEM.GET( radr, rval );
  4546. WHILE (len > 0) DO
  4547. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4548. INC( dadr, dinc ); DEC( len );
  4549. END;
  4550. END EGtrALSLLoop;
  4551. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4552. BEGIN
  4553. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4554. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4555. RETURN RESULT
  4556. END ".>";
  4557. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4558. BEGIN
  4559. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4560. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4561. RETURN RESULT
  4562. END ".<";
  4563. (** REAL *)
  4564. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4565. VAR lval, rval: REAL;
  4566. BEGIN
  4567. SYSTEM.GET( radr, rval );
  4568. WHILE (len > 0) DO
  4569. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4570. INC( dadr, dinc ); DEC( len );
  4571. END;
  4572. END EGtrARSRLoop;
  4573. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4574. BEGIN
  4575. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4576. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4577. RETURN RESULT
  4578. END ".>";
  4579. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4580. BEGIN
  4581. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4582. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4583. RETURN RESULT
  4584. END ".<";
  4585. (** LONGREAL *)
  4586. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4587. VAR lval, rval: LONGREAL;
  4588. BEGIN
  4589. SYSTEM.GET( radr, rval );
  4590. WHILE (len > 0) DO
  4591. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4592. INC( dadr, dinc ); DEC( len );
  4593. END;
  4594. END EGtrAXSXLoop;
  4595. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4596. BEGIN
  4597. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4598. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4599. RETURN RESULT
  4600. END ".>";
  4601. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4602. BEGIN
  4603. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4604. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4605. RETURN RESULT
  4606. END ".<";
  4607. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4608. (** SHORTINT *)
  4609. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4610. VAR lval, rval: SHORTINT;
  4611. BEGIN
  4612. WHILE (len > 0) DO
  4613. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4614. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4615. END;
  4616. END EGeqASASLoop;
  4617. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4618. BEGIN
  4619. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4620. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4621. RETURN RESULT
  4622. END ".>=";
  4623. (** INTEGER *)
  4624. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4625. VAR lval, rval: INTEGER;
  4626. BEGIN
  4627. WHILE (len > 0) DO
  4628. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4629. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4630. END;
  4631. END EGeqAIAILoop;
  4632. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4633. BEGIN
  4634. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4635. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4636. RETURN RESULT
  4637. END ".>=";
  4638. (** LONGINT *)
  4639. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4640. VAR lval, rval: LONGINT;
  4641. BEGIN
  4642. WHILE (len > 0) DO
  4643. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4644. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4645. END;
  4646. END EGeqALALLoop;
  4647. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4648. BEGIN
  4649. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4650. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4651. RETURN RESULT
  4652. END ".>=";
  4653. (** REAL *)
  4654. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4655. VAR lval, rval: REAL;
  4656. BEGIN
  4657. WHILE (len > 0) DO
  4658. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4659. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4660. END;
  4661. END EGeqARARLoop;
  4662. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4663. BEGIN
  4664. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4665. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4666. RETURN RESULT
  4667. END ".>=";
  4668. (** LONGREAL *)
  4669. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4670. VAR lval, rval: LONGREAL;
  4671. BEGIN
  4672. WHILE (len > 0) DO
  4673. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4674. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4675. END;
  4676. END EGeqAXAXLoop;
  4677. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4678. BEGIN
  4679. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4680. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4681. RETURN RESULT
  4682. END ".>=";
  4683. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4684. (** SHORTINT *)
  4685. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4686. VAR lval, rval: SHORTINT;
  4687. BEGIN
  4688. SYSTEM.GET( radr, rval );
  4689. WHILE (len > 0) DO
  4690. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4691. INC( dadr, dinc ); DEC( len );
  4692. END;
  4693. END EGeqASSSLoop;
  4694. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4695. BEGIN
  4696. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4697. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4698. RETURN RESULT
  4699. END ".>=";
  4700. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4701. BEGIN
  4702. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4703. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4704. RETURN RESULT
  4705. END ".<=";
  4706. (** INTEGER *)
  4707. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4708. VAR lval, rval: INTEGER;
  4709. BEGIN
  4710. SYSTEM.GET( radr, rval );
  4711. WHILE (len > 0) DO
  4712. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4713. INC( dadr, dinc ); DEC( len );
  4714. END;
  4715. END EGeqAISILoop;
  4716. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4717. BEGIN
  4718. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4719. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4720. RETURN RESULT
  4721. END ".>=";
  4722. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4723. BEGIN
  4724. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4725. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4726. RETURN RESULT
  4727. END ".<=";
  4728. (** LONGINT *)
  4729. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4730. VAR lval, rval: LONGINT;
  4731. BEGIN
  4732. SYSTEM.GET( radr, rval );
  4733. WHILE (len > 0) DO
  4734. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4735. INC( dadr, dinc ); DEC( len );
  4736. END;
  4737. END EGeqALSLLoop;
  4738. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4739. BEGIN
  4740. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4741. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4742. RETURN RESULT
  4743. END ".>=";
  4744. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4745. BEGIN
  4746. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4747. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4748. RETURN RESULT
  4749. END ".<=";
  4750. (** REAL *)
  4751. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4752. VAR lval, rval: REAL;
  4753. BEGIN
  4754. SYSTEM.GET( radr, rval );
  4755. WHILE (len > 0) DO
  4756. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4757. INC( dadr, dinc ); DEC( len );
  4758. END;
  4759. END EGeqARSRLoop;
  4760. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4761. BEGIN
  4762. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4763. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4764. RETURN RESULT
  4765. END ".>=";
  4766. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4767. BEGIN
  4768. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4769. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4770. RETURN RESULT
  4771. END ".<=";
  4772. (** LONGREAL *)
  4773. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4774. VAR lval, rval: LONGREAL;
  4775. BEGIN
  4776. SYSTEM.GET( radr, rval );
  4777. WHILE (len > 0) DO
  4778. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4779. INC( dadr, dinc ); DEC( len );
  4780. END;
  4781. END EGeqAXSXLoop;
  4782. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4783. BEGIN
  4784. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4785. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4786. RETURN RESULT
  4787. END ".>=";
  4788. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4789. BEGIN
  4790. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4791. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4792. RETURN RESULT
  4793. END ".<=";
  4794. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4795. (** SHORTINT *)
  4796. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4797. VAR lval, rval: SHORTINT;
  4798. BEGIN
  4799. WHILE (len > 0) DO
  4800. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4801. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4802. END;
  4803. END ELssASASLoop;
  4804. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4805. BEGIN
  4806. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4807. SIZEOF( BOOLEAN ), ELssASASLoop );
  4808. RETURN RESULT
  4809. END ".<";
  4810. (** INTEGER *)
  4811. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4812. VAR lval, rval: INTEGER;
  4813. BEGIN
  4814. WHILE (len > 0) DO
  4815. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4816. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4817. END;
  4818. END ELssAIAILoop;
  4819. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4820. BEGIN
  4821. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4822. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4823. RETURN RESULT
  4824. END ".<";
  4825. (** LONGINT*)
  4826. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4827. VAR lval, rval: LONGINT;
  4828. BEGIN
  4829. WHILE (len > 0) DO
  4830. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4831. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4832. END;
  4833. END ELssALALLoop;
  4834. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4835. BEGIN
  4836. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4837. SIZEOF( BOOLEAN ), ELssALALLoop );
  4838. RETURN RESULT
  4839. END ".<";
  4840. (** REAL *)
  4841. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4842. VAR lval, rval: REAL;
  4843. BEGIN
  4844. WHILE (len > 0) DO
  4845. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4846. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4847. END;
  4848. END ELssARARLoop;
  4849. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4850. BEGIN
  4851. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4852. SIZEOF( BOOLEAN ), ELssARARLoop );
  4853. RETURN RESULT
  4854. END ".<";
  4855. (** LONGREAL *)
  4856. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4857. VAR lval, rval: LONGREAL;
  4858. BEGIN
  4859. WHILE (len > 0) DO
  4860. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4861. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4862. END;
  4863. END ELssAXAXLoop;
  4864. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4865. BEGIN
  4866. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4867. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4868. RETURN RESULT
  4869. END ".<";
  4870. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4871. (** SHORTINT *)
  4872. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4873. VAR lval, rval: SHORTINT;
  4874. BEGIN
  4875. SYSTEM.GET( radr, rval );
  4876. WHILE (len > 0) DO
  4877. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4878. INC( dadr, dinc ); DEC( len );
  4879. END;
  4880. END ELssASSSLoop;
  4881. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4882. BEGIN
  4883. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4884. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4885. RETURN RESULT
  4886. END ".<";
  4887. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4888. BEGIN
  4889. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4890. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4891. RETURN RESULT
  4892. END ".>";
  4893. (** INTEGER *)
  4894. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4895. VAR lval, rval: INTEGER;
  4896. BEGIN
  4897. SYSTEM.GET( radr, rval );
  4898. WHILE (len > 0) DO
  4899. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4900. INC( dadr, dinc ); DEC( len );
  4901. END;
  4902. END ELssAISILoop;
  4903. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4904. BEGIN
  4905. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4906. SIZEOF( BOOLEAN ), ELssAISILoop );
  4907. RETURN RESULT
  4908. END ".<";
  4909. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4910. BEGIN
  4911. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4912. SIZEOF( BOOLEAN ), ELssAISILoop );
  4913. RETURN RESULT
  4914. END ".>";
  4915. (** LONGINT *)
  4916. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4917. VAR lval, rval: LONGINT;
  4918. BEGIN
  4919. SYSTEM.GET( radr, rval );
  4920. WHILE (len > 0) DO
  4921. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4922. INC( dadr, dinc ); DEC( len );
  4923. END;
  4924. END ELssALSLLoop;
  4925. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4926. BEGIN
  4927. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4928. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4929. RETURN RESULT
  4930. END ".<";
  4931. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4932. BEGIN
  4933. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4934. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4935. RETURN RESULT
  4936. END ".>";
  4937. (** REAL *)
  4938. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4939. VAR lval, rval: REAL;
  4940. BEGIN
  4941. SYSTEM.GET( radr, rval );
  4942. WHILE (len > 0) DO
  4943. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4944. INC( dadr, dinc ); DEC( len );
  4945. END;
  4946. END ELssARSRLoop;
  4947. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4948. BEGIN
  4949. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4950. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4951. RETURN RESULT
  4952. END ".<";
  4953. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4954. BEGIN
  4955. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4956. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4957. RETURN RESULT
  4958. END ".>";
  4959. (** LONGREAL *)
  4960. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4961. VAR lval, rval: LONGREAL;
  4962. BEGIN
  4963. SYSTEM.GET( radr, rval );
  4964. WHILE (len > 0) DO
  4965. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4966. INC( dadr, dinc ); DEC( len );
  4967. END;
  4968. END ELssAXSXLoop;
  4969. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4970. BEGIN
  4971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4972. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4973. RETURN RESULT
  4974. END ".<";
  4975. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4976. BEGIN
  4977. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4978. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4979. RETURN RESULT
  4980. END ".>";
  4981. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4982. (** SHORTINT *)
  4983. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4984. VAR lval, rval: SHORTINT;
  4985. BEGIN
  4986. WHILE (len > 0) DO
  4987. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4988. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4989. END;
  4990. END ELeqASASLoop;
  4991. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4992. BEGIN
  4993. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4994. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4995. RETURN RESULT
  4996. END ".<=";
  4997. (** INTEGER *)
  4998. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4999. VAR lval, rval: INTEGER;
  5000. BEGIN
  5001. WHILE (len > 0) DO
  5002. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5003. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5004. END;
  5005. END ELeqAIAILoop;
  5006. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5007. BEGIN
  5008. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5009. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5010. RETURN RESULT
  5011. END ".<=";
  5012. (** LONGINT *)
  5013. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5014. VAR lval, rval: LONGINT;
  5015. BEGIN
  5016. WHILE (len > 0) DO
  5017. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5018. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5019. END;
  5020. END ELeqALALLoop;
  5021. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5022. BEGIN
  5023. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5024. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5025. RETURN RESULT
  5026. END ".<=";
  5027. (** REAL *)
  5028. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5029. VAR lval, rval: REAL;
  5030. BEGIN
  5031. WHILE (len > 0) DO
  5032. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5033. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5034. END;
  5035. END ELeqARARLoop;
  5036. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  5037. BEGIN
  5038. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5039. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5040. RETURN RESULT
  5041. END ".<=";
  5042. (** LONGREAL*)
  5043. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5044. VAR lval, rval: LONGREAL;
  5045. BEGIN
  5046. WHILE (len > 0) DO
  5047. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5048. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5049. END;
  5050. END ELeqAXAXLoop;
  5051. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5052. BEGIN
  5053. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5054. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5055. RETURN RESULT
  5056. END ".<=";
  5057. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5058. (** SHORTINT *)
  5059. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5060. VAR lval, rval: SHORTINT;
  5061. BEGIN
  5062. SYSTEM.GET( radr, rval );
  5063. WHILE (len > 0) DO
  5064. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5065. INC( dadr, dinc ); DEC( len );
  5066. END;
  5067. END ELeqASSSLoop;
  5068. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5069. BEGIN
  5070. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5071. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5072. RETURN RESULT
  5073. END ".<=";
  5074. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  5075. BEGIN
  5076. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5077. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5078. RETURN RESULT
  5079. END ".>=";
  5080. (** INTEGER *)
  5081. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5082. VAR lval, rval: INTEGER;
  5083. BEGIN
  5084. SYSTEM.GET( radr, rval );
  5085. WHILE (len > 0) DO
  5086. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5087. INC( dadr, dinc ); DEC( len );
  5088. END;
  5089. END ELeqAISILoop;
  5090. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5091. BEGIN
  5092. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5093. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5094. RETURN RESULT
  5095. END ".<=";
  5096. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  5097. BEGIN
  5098. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5099. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5100. RETURN RESULT
  5101. END ".>=";
  5102. (** LONGINT *)
  5103. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5104. VAR lval, rval: LONGINT;
  5105. BEGIN
  5106. SYSTEM.GET( radr, rval );
  5107. WHILE (len > 0) DO
  5108. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5109. INC( dadr, dinc ); DEC( len );
  5110. END;
  5111. END ELeqALSLLoop;
  5112. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5113. BEGIN
  5114. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5115. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5116. RETURN RESULT
  5117. END ".<=";
  5118. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5119. BEGIN
  5120. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5121. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5122. RETURN RESULT
  5123. END ".>=";
  5124. (** REAL *)
  5125. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5126. VAR lval, rval: REAL;
  5127. BEGIN
  5128. SYSTEM.GET( radr, rval );
  5129. WHILE (len > 0) DO
  5130. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5131. INC( dadr, dinc ); DEC( len );
  5132. END;
  5133. END ELeqARSRLoop;
  5134. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5135. BEGIN
  5136. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5137. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5138. RETURN RESULT
  5139. END ".<=";
  5140. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5141. BEGIN
  5142. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5143. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5144. RETURN RESULT
  5145. END ".>=";
  5146. (** LONGREAL *)
  5147. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5148. VAR lval, rval: LONGREAL;
  5149. BEGIN
  5150. SYSTEM.GET( radr, rval );
  5151. WHILE (len > 0) DO
  5152. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5153. INC( dadr, dinc ); DEC( len );
  5154. END;
  5155. END ELeqAXSXLoop;
  5156. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5157. BEGIN
  5158. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5159. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5160. RETURN RESULT
  5161. END ".<=";
  5162. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5163. BEGIN
  5164. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5165. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5166. RETURN RESULT
  5167. END ".>=";
  5168. (*** elementwise or, elementwise and ********************************************************************)
  5169. (** array x array *)
  5170. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5171. VAR lval, rval: BOOLEAN;
  5172. BEGIN
  5173. WHILE (len > 0) DO
  5174. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5175. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5176. END;
  5177. END ElOrABABLoop;
  5178. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5179. BEGIN
  5180. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5181. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5182. RETURN RESULT
  5183. END "OR";
  5184. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5185. VAR lval, rval: BOOLEAN;
  5186. BEGIN
  5187. WHILE (len > 0) DO
  5188. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5189. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5190. END;
  5191. END ElAndABABLoop;
  5192. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5193. BEGIN
  5194. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5195. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5196. RETURN RESULT
  5197. END "&";
  5198. (** array x boolean *)
  5199. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5200. VAR lval, rval: BOOLEAN;
  5201. BEGIN
  5202. SYSTEM.GET( radr, rval );
  5203. WHILE (len > 0) DO
  5204. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5205. INC( dadr, dinc ); DEC( len );
  5206. END;
  5207. END ElOrABSBLoop;
  5208. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5209. BEGIN
  5210. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5211. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5212. RETURN RESULT
  5213. END "OR";
  5214. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5215. BEGIN
  5216. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5217. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5218. RETURN RESULT
  5219. END "OR";
  5220. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5221. VAR lval, rval: BOOLEAN;
  5222. BEGIN
  5223. SYSTEM.GET( radr, rval );
  5224. WHILE (len > 0) DO
  5225. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5226. INC( dadr, dinc ); DEC( len );
  5227. END;
  5228. END ElAndABSBLoop;
  5229. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5230. BEGIN
  5231. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5232. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5233. RETURN RESULT
  5234. END "&";
  5235. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5236. BEGIN
  5237. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5238. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5239. RETURN RESULT
  5240. END "&";
  5241. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5242. (** SHORTINT *)
  5243. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5244. VAR lval, rval: SHORTINT;
  5245. BEGIN
  5246. WHILE (len > 0) DO
  5247. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5248. IF rval <= lval THEN RETURN FALSE END;
  5249. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5250. END;
  5251. RETURN TRUE;
  5252. END LssASASLoop;
  5253. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5254. BEGIN
  5255. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5256. END "<";
  5257. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5258. VAR lval, rval: SHORTINT;
  5259. BEGIN
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5262. IF rval > lval THEN RETURN FALSE END;
  5263. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5264. END;
  5265. RETURN TRUE;
  5266. END GeqASASLoop;
  5267. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5268. BEGIN
  5269. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5270. END ">=";
  5271. (** INTEGER *)
  5272. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5273. VAR lval, rval: INTEGER;
  5274. BEGIN
  5275. WHILE (len > 0) DO
  5276. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5277. IF rval <= lval THEN RETURN FALSE END;
  5278. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5279. END;
  5280. RETURN TRUE;
  5281. END LssAIAILoop;
  5282. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5283. BEGIN
  5284. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5285. END "<";
  5286. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5287. VAR lval, rval: INTEGER;
  5288. BEGIN
  5289. WHILE (len > 0) DO
  5290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5291. IF rval > lval THEN RETURN FALSE END;
  5292. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5293. END;
  5294. RETURN TRUE;
  5295. END GeqAIAILoop;
  5296. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5297. BEGIN
  5298. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5299. END ">=";
  5300. (** LONGINT *)
  5301. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5302. VAR lval, rval: LONGINT;
  5303. BEGIN
  5304. WHILE (len > 0) DO
  5305. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5306. IF rval <= lval THEN RETURN FALSE END;
  5307. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5308. END;
  5309. RETURN TRUE;
  5310. END LssALALLoop;
  5311. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5312. BEGIN
  5313. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5314. END "<";
  5315. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5316. VAR lval, rval: LONGINT;
  5317. BEGIN
  5318. WHILE (len > 0) DO
  5319. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5320. IF rval > lval THEN RETURN FALSE END;
  5321. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5322. END;
  5323. RETURN TRUE;
  5324. END GeqALALLoop;
  5325. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5326. BEGIN
  5327. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5328. END ">=";
  5329. (** SIZE *)
  5330. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5331. VAR lval, rval: LONGINT;
  5332. BEGIN
  5333. WHILE (len > 0) DO
  5334. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5335. IF rval <= lval THEN RETURN FALSE END;
  5336. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5337. END;
  5338. RETURN TRUE;
  5339. END LssAZAZLoop;
  5340. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5341. BEGIN
  5342. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZAZLoop , FALSE);
  5343. END "<";
  5344. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5345. VAR lval, rval: SIZE;
  5346. BEGIN
  5347. WHILE (len > 0) DO
  5348. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5349. IF rval > lval THEN RETURN FALSE END;
  5350. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5351. END;
  5352. RETURN TRUE;
  5353. END GeqAZAZLoop;
  5354. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5355. BEGIN
  5356. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZAZLoop , FALSE);
  5357. END ">=";
  5358. (** REAL *)
  5359. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5360. VAR lval, rval: REAL;
  5361. BEGIN
  5362. WHILE (len > 0) DO
  5363. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5364. IF rval <= lval THEN RETURN FALSE END;
  5365. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5366. END;
  5367. RETURN TRUE;
  5368. END LssARARLoop;
  5369. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5370. BEGIN
  5371. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5372. END "<";
  5373. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5374. VAR lval, rval: REAL;
  5375. BEGIN
  5376. WHILE (len > 0) DO
  5377. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5378. IF rval > lval THEN RETURN FALSE END;
  5379. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5380. END;
  5381. RETURN TRUE;
  5382. END GeqARARLoop;
  5383. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5384. BEGIN
  5385. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5386. END ">=";
  5387. (** LONGREAL *)
  5388. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5389. VAR lval, rval: LONGREAL;
  5390. BEGIN
  5391. WHILE (len > 0) DO
  5392. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5393. IF rval <= lval THEN RETURN FALSE END;
  5394. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5395. END;
  5396. RETURN TRUE;
  5397. END LssAXAXLoop;
  5398. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5399. BEGIN
  5400. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5401. END "<";
  5402. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5403. VAR lval, rval: LONGREAL;
  5404. BEGIN
  5405. WHILE (len > 0) DO
  5406. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5407. IF rval > lval THEN RETURN FALSE END;
  5408. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5409. END;
  5410. RETURN TRUE;
  5411. END GeqAXAXLoop;
  5412. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5413. BEGIN
  5414. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5415. END ">=";
  5416. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5417. (** SHORTINT *)
  5418. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5419. VAR lval, rval: SHORTINT;
  5420. BEGIN
  5421. WHILE (len > 0) DO
  5422. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5423. IF rval >= lval THEN RETURN FALSE END;
  5424. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5425. END;
  5426. RETURN TRUE;
  5427. END GtrASASLoop;
  5428. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5429. BEGIN
  5430. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5431. END ">";
  5432. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5433. VAR lval, rval: SHORTINT;
  5434. BEGIN
  5435. WHILE (len > 0) DO
  5436. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5437. IF rval < lval THEN RETURN FALSE END;
  5438. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5439. END;
  5440. RETURN TRUE;
  5441. END LeqASASLoop;
  5442. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5443. BEGIN
  5444. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5445. END "<=";
  5446. (** INTEGER *)
  5447. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5448. VAR lval, rval: INTEGER;
  5449. BEGIN
  5450. WHILE (len > 0) DO
  5451. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5452. IF rval >= lval THEN RETURN FALSE END;
  5453. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5454. END;
  5455. RETURN TRUE;
  5456. END GtrAIAILoop;
  5457. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5458. BEGIN
  5459. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5460. END ">";
  5461. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5462. VAR lval, rval: INTEGER;
  5463. BEGIN
  5464. WHILE (len > 0) DO
  5465. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5466. IF rval < lval THEN RETURN FALSE END;
  5467. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5468. END;
  5469. RETURN TRUE;
  5470. END LeqAIAILoop;
  5471. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5472. BEGIN
  5473. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5474. END "<=";
  5475. (** LONGINT *)
  5476. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5477. VAR lval, rval: LONGINT;
  5478. BEGIN
  5479. WHILE (len > 0) DO
  5480. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5481. IF rval >= lval THEN RETURN FALSE END;
  5482. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5483. END;
  5484. RETURN TRUE;
  5485. END GtrALALLoop;
  5486. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5487. BEGIN
  5488. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5489. END ">";
  5490. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5491. VAR lval, rval: LONGINT;
  5492. BEGIN
  5493. WHILE (len > 0) DO
  5494. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5495. IF rval < lval THEN RETURN FALSE END;
  5496. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5497. END;
  5498. RETURN TRUE;
  5499. END LeqALALLoop;
  5500. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5501. BEGIN
  5502. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5503. END "<=";
  5504. (** SIZE *)
  5505. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5506. VAR lval, rval: SIZE;
  5507. BEGIN
  5508. WHILE (len > 0) DO
  5509. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5510. IF rval >= lval THEN RETURN FALSE END;
  5511. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5512. END;
  5513. RETURN TRUE;
  5514. END GtrAZAZLoop;
  5515. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5516. BEGIN
  5517. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZAZLoop , FALSE);
  5518. END ">";
  5519. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5520. VAR lval, rval: SIZE;
  5521. BEGIN
  5522. WHILE (len > 0) DO
  5523. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5524. IF rval < lval THEN RETURN FALSE END;
  5525. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5526. END;
  5527. RETURN TRUE;
  5528. END LeqAZAZLoop;
  5529. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5530. BEGIN
  5531. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZAZLoop , FALSE);
  5532. END "<=";
  5533. (** SIZE *)
  5534. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5535. VAR lval, rval: REAL;
  5536. BEGIN
  5537. WHILE (len > 0) DO
  5538. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5539. IF rval >= lval THEN RETURN FALSE END;
  5540. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5541. END;
  5542. RETURN TRUE;
  5543. END GtrARARLoop;
  5544. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5545. BEGIN
  5546. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5547. END ">";
  5548. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5549. VAR lval, rval: REAL;
  5550. BEGIN
  5551. WHILE (len > 0) DO
  5552. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5553. IF rval < lval THEN RETURN FALSE END;
  5554. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5555. END;
  5556. RETURN TRUE;
  5557. END LeqARARLoop;
  5558. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5559. BEGIN
  5560. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5561. END "<=";
  5562. (** LONGREAL *)
  5563. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5564. VAR lval, rval: LONGREAL;
  5565. BEGIN
  5566. WHILE (len > 0) DO
  5567. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5568. IF rval >= lval THEN RETURN FALSE END;
  5569. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5570. END;
  5571. RETURN TRUE;
  5572. END GtrAXAXLoop;
  5573. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5574. BEGIN
  5575. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5576. END ">";
  5577. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5578. VAR lval, rval: LONGREAL;
  5579. BEGIN
  5580. WHILE (len > 0) DO
  5581. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5582. IF rval < lval THEN RETURN FALSE END;
  5583. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5584. END;
  5585. RETURN TRUE;
  5586. END LeqAXAXLoop;
  5587. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5588. BEGIN
  5589. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5590. END "<=";
  5591. (*** equals: array x array -> boolean ********************************************************************)
  5592. (** BOOLEAN *)
  5593. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5594. VAR lval, rval: BOOLEAN;
  5595. BEGIN
  5596. WHILE (len > 0) DO
  5597. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5598. IF rval # lval THEN RETURN FALSE END;
  5599. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5600. END;
  5601. RETURN TRUE;
  5602. END EqlABABLoop;
  5603. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5604. BEGIN
  5605. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5606. END "=";
  5607. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5608. BEGIN
  5609. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5610. END "#";
  5611. (** SHORTINT *)
  5612. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5613. VAR lval, rval: SHORTINT;
  5614. BEGIN
  5615. WHILE (len > 0) DO
  5616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5617. IF rval # lval THEN RETURN FALSE END;
  5618. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5619. END;
  5620. RETURN TRUE;
  5621. END EqlASASLoop;
  5622. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5623. BEGIN
  5624. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5625. END "=";
  5626. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5627. BEGIN
  5628. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5629. END "#";
  5630. (** INTEGER *)
  5631. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5632. VAR lval, rval: INTEGER;
  5633. BEGIN
  5634. WHILE (len > 0) DO
  5635. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5636. IF rval # lval THEN RETURN FALSE END;
  5637. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5638. END;
  5639. RETURN TRUE;
  5640. END EqlAIAILoop;
  5641. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5642. BEGIN
  5643. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5644. END "=";
  5645. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5646. BEGIN
  5647. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5648. END "#";
  5649. (** LONGINT *)
  5650. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5651. VAR lval, rval: LONGINT;
  5652. BEGIN
  5653. WHILE (len > 0) DO
  5654. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5655. IF rval # lval THEN RETURN FALSE END;
  5656. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5657. END;
  5658. RETURN TRUE;
  5659. END EqlALALLoop;
  5660. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5661. BEGIN
  5662. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5663. END "=";
  5664. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5665. BEGIN
  5666. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5667. END "#";
  5668. (** SIZE *)
  5669. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5670. VAR lval, rval: SIZE;
  5671. BEGIN
  5672. WHILE (len > 0) DO
  5673. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5674. IF rval # lval THEN RETURN FALSE END;
  5675. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5676. END;
  5677. RETURN TRUE;
  5678. END EqlAZAZLoop;
  5679. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5680. BEGIN
  5681. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5682. END "=";
  5683. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5684. BEGIN
  5685. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5686. END "#";
  5687. (** REAL *)
  5688. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5689. VAR lval, rval: REAL;
  5690. BEGIN
  5691. WHILE (len > 0) DO
  5692. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5693. IF rval # lval THEN RETURN FALSE END;
  5694. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5695. END;
  5696. RETURN TRUE;
  5697. END EqlARARLoop;
  5698. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5699. BEGIN
  5700. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5701. END "=";
  5702. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5703. BEGIN
  5704. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5705. END "#";
  5706. (** LONGREAL *)
  5707. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5708. VAR lval, rval: LONGREAL;
  5709. BEGIN
  5710. WHILE (len > 0) DO
  5711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5712. IF rval # lval THEN RETURN FALSE END;
  5713. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5714. END;
  5715. RETURN TRUE;
  5716. END EqlAXAXLoop;
  5717. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5718. BEGIN
  5719. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5720. END "=";
  5721. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5722. BEGIN
  5723. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5724. END "#";
  5725. (** COMPLEX *)
  5726. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5727. VAR lval, rval: COMPLEX;
  5728. BEGIN
  5729. WHILE (len > 0) DO
  5730. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5731. IF rval # lval THEN RETURN FALSE END;
  5732. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5733. END;
  5734. RETURN TRUE;
  5735. END EqlACACLoop;
  5736. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5737. BEGIN
  5738. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5739. END "=";
  5740. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5741. BEGIN
  5742. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5743. END "#";
  5744. (** LONGCOMPLEX *)
  5745. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5746. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5747. BEGIN
  5748. WHILE (len > 0) DO
  5749. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5750. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5751. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5752. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5753. END;
  5754. RETURN TRUE;
  5755. END EqlALZALZLoop;
  5756. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5757. BEGIN
  5758. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5759. END "=";
  5760. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5761. BEGIN
  5762. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5763. END "#";
  5764. (*** equals: array x scalar -> boolean ********************************************************************)
  5765. (** BOOLEAN *)
  5766. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5767. VAR lval, rval: BOOLEAN;
  5768. BEGIN
  5769. SYSTEM.GET( radr, rval );
  5770. WHILE (len > 0) DO
  5771. SYSTEM.GET( ladr, lval );
  5772. IF lval # rval THEN RETURN FALSE END;
  5773. INC( ladr, linc ); DEC( len );
  5774. END;
  5775. RETURN TRUE;
  5776. END EqlABSBLoop;
  5777. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5778. right: BOOLEAN ): BOOLEAN;
  5779. BEGIN
  5780. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5781. END "=";
  5782. OPERATOR "="*( left: BOOLEAN;
  5783. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5784. BEGIN
  5785. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5786. END "=";
  5787. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5788. right: BOOLEAN ): BOOLEAN;
  5789. BEGIN
  5790. RETURN ~(left = right);
  5791. END "#";
  5792. OPERATOR "#"*( left: BOOLEAN;
  5793. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5794. BEGIN
  5795. RETURN ~( left = right );
  5796. END "#";
  5797. (** SHORTINT *)
  5798. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5799. VAR lval, rval: SHORTINT;
  5800. BEGIN
  5801. SYSTEM.GET( radr, rval );
  5802. WHILE (len > 0) DO
  5803. SYSTEM.GET( ladr, lval );
  5804. IF lval # rval THEN RETURN FALSE END;
  5805. INC( ladr, linc ); DEC( len );
  5806. END;
  5807. RETURN TRUE;
  5808. END EqlASSSLoop;
  5809. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5810. BEGIN
  5811. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5812. END "=";
  5813. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5814. BEGIN
  5815. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5816. END "=";
  5817. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5818. BEGIN
  5819. RETURN ~( left= right );
  5820. END "#";
  5821. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5822. BEGIN
  5823. RETURN ~( left= right );
  5824. END "#";
  5825. (** INTEGER *)
  5826. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5827. VAR lval, rval: INTEGER;
  5828. BEGIN
  5829. SYSTEM.GET( radr, rval );
  5830. WHILE (len > 0) DO
  5831. SYSTEM.GET( ladr, lval );
  5832. IF lval # rval THEN RETURN FALSE END;
  5833. INC( ladr, linc ); DEC( len );
  5834. END;
  5835. RETURN TRUE;
  5836. END EqlAISILoop;
  5837. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5838. BEGIN
  5839. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5840. END "=";
  5841. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5842. BEGIN
  5843. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5844. END "=";
  5845. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5846. BEGIN
  5847. RETURN ~( left = right );
  5848. END "#";
  5849. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5850. BEGIN
  5851. RETURN ~( left = right );
  5852. END "#";
  5853. (** LONGINT *)
  5854. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5855. VAR lval, rval: LONGINT;
  5856. BEGIN
  5857. SYSTEM.GET( radr, rval );
  5858. WHILE (len > 0) DO
  5859. SYSTEM.GET( ladr, lval );
  5860. IF lval # rval THEN RETURN FALSE END;
  5861. INC( ladr, linc ); DEC( len );
  5862. END;
  5863. RETURN TRUE;
  5864. END EqlALSLLoop;
  5865. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5866. right: LONGINT ): BOOLEAN;
  5867. BEGIN
  5868. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5869. END "=";
  5870. OPERATOR "="*( left: LONGINT;
  5871. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5872. BEGIN
  5873. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5874. END "=";
  5875. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5876. right: LONGINT ): BOOLEAN;
  5877. BEGIN
  5878. RETURN ~(left = right);
  5879. END "#";
  5880. OPERATOR "#"*( left: LONGINT;
  5881. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5882. BEGIN
  5883. RETURN ~(left = right);
  5884. END "#";
  5885. (** SIZE *)
  5886. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5887. VAR lval, rval: SIZE;
  5888. BEGIN
  5889. SYSTEM.GET( radr, rval );
  5890. WHILE (len > 0) DO
  5891. SYSTEM.GET( ladr, lval );
  5892. IF lval # rval THEN RETURN FALSE END;
  5893. INC( ladr, linc ); DEC( len );
  5894. END;
  5895. RETURN TRUE;
  5896. END EqlAZSZLoop;
  5897. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5898. right: SIZE ): BOOLEAN;
  5899. BEGIN
  5900. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZSZLoop );
  5901. END "=";
  5902. OPERATOR "="*( left: SIZE;
  5903. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5904. BEGIN
  5905. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5906. END "=";
  5907. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5908. right: SIZE ): BOOLEAN;
  5909. BEGIN
  5910. RETURN ~(left = right);
  5911. END "#";
  5912. OPERATOR "#"*( left: SIZE;
  5913. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5914. BEGIN
  5915. RETURN ~(left = right);
  5916. END "#";
  5917. (** REAL *)
  5918. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5919. VAR lval, rval: REAL;
  5920. BEGIN
  5921. SYSTEM.GET( radr, rval );
  5922. WHILE (len > 0) DO
  5923. SYSTEM.GET( ladr, lval );
  5924. IF lval # rval THEN RETURN FALSE END;
  5925. INC( ladr, linc ); DEC( len );
  5926. END;
  5927. RETURN TRUE;
  5928. END EqlARSRLoop;
  5929. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5930. right: REAL ): BOOLEAN;
  5931. BEGIN
  5932. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5933. END "=";
  5934. OPERATOR "="*( left: REAL;
  5935. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5936. BEGIN
  5937. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5938. END "=";
  5939. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5940. right: REAL ): BOOLEAN;
  5941. BEGIN
  5942. RETURN ~( left = right );
  5943. END "#";
  5944. OPERATOR "#"*( left: REAL;
  5945. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5946. BEGIN
  5947. RETURN ~( left = right );
  5948. END "#";
  5949. (** LONGREAL *)
  5950. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5951. VAR lval, rval: LONGREAL;
  5952. BEGIN
  5953. SYSTEM.GET( radr, rval );
  5954. WHILE (len > 0) DO
  5955. SYSTEM.GET( ladr, lval );
  5956. IF lval # rval THEN RETURN FALSE END;
  5957. INC( ladr, linc ); DEC( len );
  5958. END;
  5959. RETURN TRUE;
  5960. END EqlAXSXLoop;
  5961. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5962. right: LONGREAL ): BOOLEAN;
  5963. BEGIN
  5964. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5965. END "=";
  5966. OPERATOR "="*( left: LONGREAL;
  5967. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5968. BEGIN
  5969. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5970. END "=";
  5971. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5972. right: LONGREAL ): BOOLEAN;
  5973. BEGIN
  5974. RETURN ~( left = right );
  5975. END "#";
  5976. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5977. BEGIN
  5978. RETURN ~( left= right );
  5979. END "#";
  5980. (*** gtr : array x scalar -> boolean ********************************************************************)
  5981. (** SHORTINT *)
  5982. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5983. VAR lval, rval: SHORTINT;
  5984. BEGIN
  5985. SYSTEM.GET( radr, rval );
  5986. WHILE (len > 0) DO
  5987. SYSTEM.GET( ladr, lval );
  5988. IF lval <= rval THEN RETURN FALSE END;
  5989. INC( ladr, linc ); DEC( len );
  5990. END;
  5991. RETURN TRUE;
  5992. END GtrASSSLoop;
  5993. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5994. BEGIN
  5995. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5996. END ">";
  5997. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5998. BEGIN
  5999. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  6000. END "<";
  6001. (** INTEGER *)
  6002. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6003. VAR lval, rval: INTEGER;
  6004. BEGIN
  6005. SYSTEM.GET( radr, rval );
  6006. WHILE (len > 0) DO
  6007. SYSTEM.GET( ladr, lval );
  6008. IF lval <= rval THEN RETURN FALSE END;
  6009. INC( ladr, linc ); DEC( len );
  6010. END;
  6011. RETURN TRUE;
  6012. END GtrAISILoop;
  6013. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6014. BEGIN
  6015. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  6016. END ">";
  6017. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6018. BEGIN
  6019. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  6020. END "<";
  6021. (** LONGINT *)
  6022. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6023. VAR lval, rval: LONGINT;
  6024. BEGIN
  6025. SYSTEM.GET( radr, rval );
  6026. WHILE (len > 0) DO
  6027. SYSTEM.GET( ladr, lval );
  6028. IF lval <= rval THEN RETURN FALSE END;
  6029. INC( ladr, linc ); DEC( len );
  6030. END;
  6031. RETURN TRUE;
  6032. END GtrALSLLoop;
  6033. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6034. BEGIN
  6035. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  6036. END ">";
  6037. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6038. BEGIN
  6039. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  6040. END "<";
  6041. (** SIZE *)
  6042. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6043. VAR lval, rval: SIZE;
  6044. BEGIN
  6045. SYSTEM.GET( radr, rval );
  6046. WHILE (len > 0) DO
  6047. SYSTEM.GET( ladr, lval );
  6048. IF lval <= rval THEN RETURN FALSE END;
  6049. INC( ladr, linc ); DEC( len );
  6050. END;
  6051. RETURN TRUE;
  6052. END GtrAZSZLoop;
  6053. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6054. BEGIN
  6055. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZSZLoop );
  6056. END ">";
  6057. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6058. BEGIN
  6059. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAZSZLoop );
  6060. END "<";
  6061. (** REAL *)
  6062. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6063. VAR lval, rval: REAL;
  6064. BEGIN
  6065. SYSTEM.GET( radr, rval );
  6066. WHILE (len > 0) DO
  6067. SYSTEM.GET( ladr, lval );
  6068. IF lval <= rval THEN RETURN FALSE END;
  6069. INC( ladr, linc ); DEC( len );
  6070. END;
  6071. RETURN TRUE;
  6072. END GtrARSRLoop;
  6073. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6074. right: REAL ): BOOLEAN;
  6075. BEGIN
  6076. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  6077. END ">";
  6078. OPERATOR "<"*( left: REAL;
  6079. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6080. BEGIN
  6081. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  6082. END "<";
  6083. (** LONGREAL *)
  6084. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6085. VAR lval, rval: LONGREAL;
  6086. BEGIN
  6087. SYSTEM.GET( radr, rval );
  6088. WHILE (len > 0) DO
  6089. SYSTEM.GET( ladr, lval );
  6090. IF lval <= rval THEN RETURN FALSE END;
  6091. INC( ladr, linc ); DEC( len );
  6092. END;
  6093. RETURN TRUE;
  6094. END GtrAXSXLoop;
  6095. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6096. right: LONGREAL ): BOOLEAN;
  6097. BEGIN
  6098. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  6099. END ">";
  6100. OPERATOR "<"*( left: LONGREAL;
  6101. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6102. BEGIN
  6103. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  6104. END "<";
  6105. (*** geq : array x scalar -> boolean ********************************************************************)
  6106. (** SHORTINT *)
  6107. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6108. VAR lval, rval: SHORTINT;
  6109. BEGIN
  6110. SYSTEM.GET( radr, rval );
  6111. WHILE (len > 0) DO
  6112. SYSTEM.GET( ladr, lval );
  6113. IF lval < rval THEN RETURN FALSE END;
  6114. INC( ladr, linc ); DEC( len );
  6115. END;
  6116. RETURN TRUE;
  6117. END GeqASSSLoop;
  6118. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6119. right: SHORTINT ): BOOLEAN;
  6120. BEGIN
  6121. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  6122. END ">=";
  6123. OPERATOR "<="*( left: SHORTINT;
  6124. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6125. BEGIN
  6126. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  6127. END "<=";
  6128. (** INTEGER *)
  6129. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6130. VAR lval, rval: INTEGER;
  6131. BEGIN
  6132. SYSTEM.GET( radr, rval );
  6133. WHILE (len > 0) DO
  6134. SYSTEM.GET( ladr, lval );
  6135. IF lval < rval THEN RETURN FALSE END;
  6136. INC( ladr, linc ); DEC( len );
  6137. END;
  6138. RETURN TRUE;
  6139. END GeqAISILoop;
  6140. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6141. BEGIN
  6142. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  6143. END ">=";
  6144. OPERATOR "<="*( left: INTEGER;
  6145. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6146. BEGIN
  6147. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  6148. END "<=";
  6149. (** LONGINT *)
  6150. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6151. VAR lval, rval: LONGINT;
  6152. BEGIN
  6153. SYSTEM.GET( radr, rval );
  6154. WHILE (len > 0) DO
  6155. SYSTEM.GET( ladr, lval );
  6156. IF lval < rval THEN RETURN FALSE END;
  6157. INC( ladr, linc ); DEC( len );
  6158. END;
  6159. RETURN TRUE;
  6160. END GeqALSLLoop;
  6161. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6162. right: LONGINT ): BOOLEAN;
  6163. BEGIN
  6164. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  6165. END ">=";
  6166. OPERATOR "<="*( left: LONGINT;
  6167. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6168. BEGIN
  6169. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  6170. END "<=";
  6171. (** SIZE *)
  6172. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6173. VAR lval, rval: SIZE;
  6174. BEGIN
  6175. SYSTEM.GET( radr, rval );
  6176. WHILE (len > 0) DO
  6177. SYSTEM.GET( ladr, lval );
  6178. IF lval < rval THEN RETURN FALSE END;
  6179. INC( ladr, linc ); DEC( len );
  6180. END;
  6181. RETURN TRUE;
  6182. END GeqAZSZLoop;
  6183. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6184. right: SIZE ): BOOLEAN;
  6185. BEGIN
  6186. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZSZLoop );
  6187. END ">=";
  6188. OPERATOR "<="*( left:SIZE;
  6189. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6190. BEGIN
  6191. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAZSZLoop );
  6192. END "<=";
  6193. (** REAL *)
  6194. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6195. VAR lval, rval: REAL;
  6196. BEGIN
  6197. SYSTEM.GET( radr, rval );
  6198. WHILE (len > 0) DO
  6199. SYSTEM.GET( ladr, lval );
  6200. IF lval < rval THEN RETURN FALSE END;
  6201. INC( ladr, linc ); DEC( len );
  6202. END;
  6203. RETURN TRUE;
  6204. END GeqARSRLoop;
  6205. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6206. right: REAL ): BOOLEAN;
  6207. BEGIN
  6208. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  6209. END ">=";
  6210. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6211. BEGIN
  6212. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  6213. END "<=";
  6214. (** LONGREAL *)
  6215. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6216. VAR lval, rval: LONGREAL;
  6217. BEGIN
  6218. SYSTEM.GET( radr, rval );
  6219. WHILE (len > 0) DO
  6220. SYSTEM.GET( ladr, lval );
  6221. IF lval < rval THEN RETURN FALSE END;
  6222. INC( ladr, linc ); DEC( len );
  6223. END;
  6224. RETURN TRUE;
  6225. END GeqAXSXLoop;
  6226. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6227. BEGIN
  6228. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  6229. END ">=";
  6230. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6231. BEGIN
  6232. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  6233. END "<=";
  6234. (*** leq : array x scalar -> boolean ********************************************************************)
  6235. (** SHORTINT *)
  6236. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6237. VAR lval, rval: SHORTINT;
  6238. BEGIN
  6239. SYSTEM.GET( radr, rval );
  6240. WHILE (len > 0) DO
  6241. SYSTEM.GET( ladr, lval );
  6242. IF lval > rval THEN RETURN FALSE END;
  6243. INC( ladr, linc ); DEC( len );
  6244. END;
  6245. RETURN TRUE;
  6246. END LeqASSSLoop;
  6247. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6248. BEGIN
  6249. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6250. END "<=";
  6251. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6252. BEGIN
  6253. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6254. END ">=";
  6255. (** INTEGER *)
  6256. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6257. VAR lval, rval: INTEGER;
  6258. BEGIN
  6259. SYSTEM.GET( radr, rval );
  6260. WHILE (len > 0) DO
  6261. SYSTEM.GET( ladr, lval );
  6262. IF lval > rval THEN RETURN FALSE END;
  6263. INC( ladr, linc ); DEC( len );
  6264. END;
  6265. RETURN TRUE;
  6266. END LeqAISILoop;
  6267. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6268. BEGIN
  6269. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6270. END "<=";
  6271. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6272. BEGIN
  6273. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6274. END ">=";
  6275. (** LONGINT *)
  6276. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6277. VAR lval, rval: LONGINT;
  6278. BEGIN
  6279. SYSTEM.GET( radr, rval );
  6280. WHILE (len > 0) DO
  6281. SYSTEM.GET( ladr, lval );
  6282. IF lval > rval THEN RETURN FALSE END;
  6283. INC( ladr, linc ); DEC( len );
  6284. END;
  6285. RETURN TRUE;
  6286. END LeqALSLLoop;
  6287. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6288. BEGIN
  6289. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6290. END "<=";
  6291. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6292. BEGIN
  6293. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6294. END ">=";
  6295. (** SIZE *)
  6296. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6297. VAR lval, rval: SIZE;
  6298. BEGIN
  6299. SYSTEM.GET( radr, rval );
  6300. WHILE (len > 0) DO
  6301. SYSTEM.GET( ladr, lval );
  6302. IF lval > rval THEN RETURN FALSE END;
  6303. INC( ladr, linc ); DEC( len );
  6304. END;
  6305. RETURN TRUE;
  6306. END LeqAZSZLoop;
  6307. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6308. BEGIN
  6309. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZSZLoop );
  6310. END "<=";
  6311. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6312. BEGIN
  6313. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAZSZLoop );
  6314. END ">=";
  6315. (** REAL *)
  6316. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6317. VAR lval, rval: REAL;
  6318. BEGIN
  6319. SYSTEM.GET( radr, rval );
  6320. WHILE (len > 0) DO
  6321. SYSTEM.GET( ladr, lval );
  6322. IF lval > rval THEN RETURN FALSE END;
  6323. INC( ladr, linc ); DEC( len );
  6324. END;
  6325. RETURN TRUE;
  6326. END LeqARSRLoop;
  6327. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6328. BEGIN
  6329. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6330. END "<=";
  6331. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6332. BEGIN
  6333. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6334. END ">=";
  6335. (** LONGREAL *)
  6336. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6337. VAR lval, rval: LONGREAL;
  6338. BEGIN
  6339. SYSTEM.GET( radr, rval );
  6340. WHILE (len > 0) DO
  6341. SYSTEM.GET( ladr, lval );
  6342. IF lval > rval THEN RETURN FALSE END;
  6343. INC( ladr, linc ); DEC( len );
  6344. END;
  6345. RETURN TRUE;
  6346. END LeqAXSXLoop;
  6347. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6348. BEGIN
  6349. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6350. END "<=";
  6351. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6352. BEGIN
  6353. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6354. END ">=";
  6355. (*** lss: array x scalar -> boolean ********************************************************************)
  6356. (** SHORTINT *)
  6357. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6358. VAR lval, rval: SHORTINT;
  6359. BEGIN
  6360. SYSTEM.GET( radr, rval );
  6361. WHILE (len > 0) DO
  6362. SYSTEM.GET( ladr, lval );
  6363. IF lval >= rval THEN RETURN FALSE END;
  6364. INC( ladr, linc ); DEC( len );
  6365. END;
  6366. RETURN TRUE;
  6367. END LssASSSLoop;
  6368. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6369. BEGIN
  6370. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6371. END "<";
  6372. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6373. BEGIN
  6374. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6375. END ">";
  6376. (** INTEGER *)
  6377. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6378. VAR lval, rval: INTEGER;
  6379. BEGIN
  6380. SYSTEM.GET( radr, rval );
  6381. WHILE (len > 0) DO
  6382. SYSTEM.GET( ladr, lval );
  6383. IF lval >= rval THEN RETURN FALSE END;
  6384. INC( ladr, linc ); DEC( len );
  6385. END;
  6386. RETURN TRUE;
  6387. END LssAISILoop;
  6388. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6389. BEGIN
  6390. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6391. END "<";
  6392. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6393. BEGIN
  6394. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6395. END ">";
  6396. (** LONGINT *)
  6397. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6398. VAR lval, rval: LONGINT;
  6399. BEGIN
  6400. SYSTEM.GET( radr, rval );
  6401. WHILE (len > 0) DO
  6402. SYSTEM.GET( ladr, lval );
  6403. IF lval >= rval THEN RETURN FALSE END;
  6404. INC( ladr, linc ); DEC( len );
  6405. END;
  6406. RETURN TRUE;
  6407. END LssALSLLoop;
  6408. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6409. BEGIN
  6410. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6411. END "<";
  6412. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6413. BEGIN
  6414. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6415. END ">";
  6416. (** SIZE *)
  6417. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6418. VAR lval, rval: SIZE;
  6419. BEGIN
  6420. SYSTEM.GET( radr, rval );
  6421. WHILE (len > 0) DO
  6422. SYSTEM.GET( ladr, lval );
  6423. IF lval >= rval THEN RETURN FALSE END;
  6424. INC( ladr, linc ); DEC( len );
  6425. END;
  6426. RETURN TRUE;
  6427. END LssAZSZLoop;
  6428. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6429. BEGIN
  6430. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZSZLoop );
  6431. END "<";
  6432. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6433. BEGIN
  6434. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAZSZLoop );
  6435. END ">";
  6436. (** REAL *)
  6437. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6438. VAR lval, rval: REAL;
  6439. BEGIN
  6440. SYSTEM.GET( radr, rval );
  6441. WHILE (len > 0) DO
  6442. SYSTEM.GET( ladr, lval );
  6443. IF lval >= rval THEN RETURN FALSE END;
  6444. INC( ladr, linc ); DEC( len );
  6445. END;
  6446. RETURN TRUE;
  6447. END LssARSRLoop;
  6448. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6449. right: REAL ): BOOLEAN;
  6450. BEGIN
  6451. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6452. END "<";
  6453. OPERATOR ">"*( left: REAL;
  6454. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6455. BEGIN
  6456. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6457. END ">";
  6458. (** LONGREAL *)
  6459. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6460. VAR lval, rval: LONGREAL;
  6461. BEGIN
  6462. SYSTEM.GET( radr, rval );
  6463. WHILE (len > 0) DO
  6464. SYSTEM.GET( ladr, lval );
  6465. IF lval >= rval THEN RETURN FALSE END;
  6466. INC( ladr, linc ); DEC( len );
  6467. END;
  6468. RETURN TRUE;
  6469. END LssAXSXLoop;
  6470. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6471. right: LONGREAL ): BOOLEAN;
  6472. BEGIN
  6473. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6474. END "<";
  6475. OPERATOR ">"*( left: LONGREAL;
  6476. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6477. BEGIN
  6478. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6479. END ">";
  6480. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6481. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6482. VAR lval, val: LONGREAL;
  6483. BEGIN
  6484. SYSTEM.GET( radr, val );
  6485. WHILE (len > 0) DO
  6486. SYSTEM.GET( ladr, lval );
  6487. INC( ladr, linc ); DEC( len );
  6488. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6489. INC(dadr,dinc);
  6490. END;
  6491. END MaxAXSXLoop;
  6492. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6493. TYPE Type = LONGREAL;
  6494. BEGIN
  6495. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6496. RETURN RESULT
  6497. END "MAX";
  6498. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6499. VAR lval, val: REAL;
  6500. BEGIN
  6501. SYSTEM.GET( radr, val );
  6502. WHILE (len > 0) DO
  6503. SYSTEM.GET( ladr, lval );
  6504. INC( ladr, linc ); DEC( len );
  6505. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6506. INC(dadr,dinc);
  6507. END;
  6508. END MaxARSRLoop;
  6509. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6510. TYPE Type = REAL;
  6511. BEGIN
  6512. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6513. RETURN RESULT
  6514. END "MAX";
  6515. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6516. VAR lval, val: LONGINT;
  6517. BEGIN
  6518. SYSTEM.GET( radr, val );
  6519. WHILE (len > 0) DO
  6520. SYSTEM.GET( ladr, lval );
  6521. INC( ladr, linc ); DEC( len );
  6522. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6523. INC(dadr,dinc);
  6524. END;
  6525. END MaxALSLLoop;
  6526. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6527. TYPE Type = LONGINT;
  6528. BEGIN
  6529. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6530. RETURN RESULT
  6531. END "MAX";
  6532. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6533. VAR lval, val: INTEGER;
  6534. BEGIN
  6535. SYSTEM.GET( radr, val );
  6536. WHILE (len > 0) DO
  6537. SYSTEM.GET( ladr, lval );
  6538. INC( ladr, linc ); DEC( len );
  6539. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6540. INC(dadr,dinc);
  6541. END;
  6542. END MaxAISILoop;
  6543. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6544. TYPE Type = INTEGER;
  6545. BEGIN
  6546. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6547. RETURN RESULT
  6548. END "MAX";
  6549. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6550. VAR lval, val: SHORTINT;
  6551. BEGIN
  6552. SYSTEM.GET( radr, val );
  6553. WHILE (len > 0) DO
  6554. SYSTEM.GET( ladr, lval );
  6555. INC( ladr, linc ); DEC( len );
  6556. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6557. INC(dadr,dinc);
  6558. END;
  6559. END MaxASSSLoop;
  6560. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6561. TYPE Type = SHORTINT;
  6562. BEGIN
  6563. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6564. RETURN RESULT
  6565. END "MAX";
  6566. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6567. VAR lval, val: LONGREAL;
  6568. BEGIN
  6569. SYSTEM.GET( radr, val );
  6570. WHILE (len > 0) DO
  6571. SYSTEM.GET( ladr, lval );
  6572. INC( ladr, linc ); DEC( len );
  6573. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6574. INC(dadr,dinc);
  6575. END;
  6576. END MinAXSXLoop;
  6577. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6578. TYPE Type = LONGREAL;
  6579. BEGIN
  6580. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6581. RETURN RESULT
  6582. END "MIN";
  6583. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6584. VAR lval, val: REAL;
  6585. BEGIN
  6586. SYSTEM.GET( radr, val );
  6587. WHILE (len > 0) DO
  6588. SYSTEM.GET( ladr, lval );
  6589. INC( ladr, linc ); DEC( len );
  6590. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6591. INC(dadr,dinc);
  6592. END;
  6593. END MinARSRLoop;
  6594. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6595. TYPE Type = REAL;
  6596. BEGIN
  6597. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6598. RETURN RESULT
  6599. END "MIN";
  6600. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6601. VAR lval, val: LONGINT;
  6602. BEGIN
  6603. SYSTEM.GET( radr, val );
  6604. WHILE (len > 0) DO
  6605. SYSTEM.GET( ladr, lval );
  6606. INC( ladr, linc ); DEC( len );
  6607. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6608. INC(dadr,dinc);
  6609. END;
  6610. END MinALSLLoop;
  6611. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6612. TYPE Type = LONGINT;
  6613. BEGIN
  6614. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6615. RETURN RESULT
  6616. END "MIN";
  6617. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6618. VAR lval, val: INTEGER;
  6619. BEGIN
  6620. SYSTEM.GET( radr, val );
  6621. WHILE (len > 0) DO
  6622. SYSTEM.GET( ladr, lval );
  6623. INC( ladr, linc ); DEC( len );
  6624. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6625. INC(dadr,dinc);
  6626. END;
  6627. END MinAISILoop;
  6628. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6629. TYPE Type = INTEGER;
  6630. BEGIN
  6631. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6632. RETURN RESULT
  6633. END "MIN";
  6634. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6635. VAR lval, val: SHORTINT;
  6636. BEGIN
  6637. SYSTEM.GET( radr, val );
  6638. WHILE (len > 0) DO
  6639. SYSTEM.GET( ladr, lval );
  6640. INC( ladr, linc ); DEC( len );
  6641. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6642. INC(dadr,dinc);
  6643. END;
  6644. END MinASSSLoop;
  6645. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6646. TYPE Type = SHORTINT;
  6647. BEGIN
  6648. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6649. RETURN RESULT
  6650. END "MIN";
  6651. (**** binary max/min operators array x array -> array ********************************************************************)
  6652. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6653. VAR lval, rval: LONGREAL;
  6654. BEGIN
  6655. WHILE (len > 0) DO
  6656. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6657. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6658. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6659. INC(dadr,dinc);
  6660. END;
  6661. END MaxAXAXLoop;
  6662. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6663. BEGIN
  6664. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6665. RETURN RESULT
  6666. END "MAX";
  6667. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6668. VAR lval, rval: REAL ;
  6669. BEGIN
  6670. WHILE (len > 0) DO
  6671. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6672. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6673. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6674. INC(dadr,dinc);
  6675. END;
  6676. END MaxARARLoop;
  6677. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6678. BEGIN
  6679. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6680. RETURN RESULT
  6681. END "MAX";
  6682. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6683. VAR lval, rval: LONGINT;
  6684. BEGIN
  6685. WHILE (len > 0) DO
  6686. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6687. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6688. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6689. INC(dadr,dinc);
  6690. END;
  6691. END MaxALALLoop;
  6692. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6693. BEGIN
  6694. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6695. RETURN RESULT
  6696. END "MAX";
  6697. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6698. VAR lval, rval: INTEGER;
  6699. BEGIN
  6700. WHILE (len > 0) DO
  6701. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6702. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6703. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6704. INC(dadr,dinc);
  6705. END;
  6706. END MaxAIAILoop;
  6707. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6708. BEGIN
  6709. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6710. RETURN RESULT
  6711. END "MAX";
  6712. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6713. VAR lval, rval: SHORTINT;
  6714. BEGIN
  6715. WHILE (len > 0) DO
  6716. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6717. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6718. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6719. INC(dadr,dinc);
  6720. END;
  6721. END MaxASASLoop;
  6722. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6723. BEGIN
  6724. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6725. RETURN RESULT
  6726. END "MAX";
  6727. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6728. VAR lval, rval: LONGREAL;
  6729. BEGIN
  6730. WHILE (len > 0) DO
  6731. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6732. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6733. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6734. INC(dadr,dinc);
  6735. END;
  6736. END MinAXAXLoop;
  6737. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6738. BEGIN
  6739. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6740. RETURN RESULT
  6741. END "MIN";
  6742. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6743. VAR lval, rval: REAL ;
  6744. BEGIN
  6745. WHILE (len > 0) DO
  6746. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6747. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6748. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6749. INC(dadr,dinc);
  6750. END;
  6751. END MinARARLoop;
  6752. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6753. BEGIN
  6754. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6755. RETURN RESULT
  6756. END "MIN";
  6757. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6758. VAR lval, rval: LONGINT;
  6759. BEGIN
  6760. WHILE (len > 0) DO
  6761. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6762. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6763. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6764. INC(dadr,dinc);
  6765. END;
  6766. END MinALALLoop;
  6767. *)
  6768. TYPE
  6769. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6770. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6771. BEGIN
  6772. WHILE (len > 0) DO
  6773. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6774. ladr := ladr + linc;
  6775. radr := radr + rinc;
  6776. dadr := dadr + dinc;
  6777. DEC(len);
  6778. END;
  6779. END MinALALLoop;
  6780. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6781. BEGIN
  6782. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6783. RETURN RESULT
  6784. END "MIN";
  6785. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6786. VAR lval, rval: INTEGER;
  6787. BEGIN
  6788. WHILE (len > 0) DO
  6789. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6790. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6791. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6792. INC(dadr,dinc);
  6793. END;
  6794. END MinAIAILoop;
  6795. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6796. BEGIN
  6797. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6798. RETURN RESULT
  6799. END "MIN";
  6800. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6801. VAR lval, rval: SHORTINT;
  6802. BEGIN
  6803. WHILE (len > 0) DO
  6804. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6805. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6806. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6807. INC(dadr,dinc);
  6808. END;
  6809. END MinASASLoop;
  6810. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6811. BEGIN
  6812. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6813. RETURN RESULT
  6814. END "MIN";
  6815. (**** unary operators array -> scalar ********************************************************************)
  6816. (*** min: array -> scalar ****************************************)
  6817. (** SHORTINT *)
  6818. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6819. VAR lval, dval: SHORTINT;
  6820. BEGIN
  6821. SYSTEM.GET( dadr, dval );
  6822. WHILE (len > 0) DO
  6823. SYSTEM.GET( ladr, lval );
  6824. IF lval < dval THEN dval := lval END;
  6825. INC( ladr, linc ); DEC( len );
  6826. END;
  6827. SYSTEM.PUT( dadr, dval );
  6828. END MinASLoop;
  6829. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6830. TYPE Type = SHORTINT;
  6831. VAR val: Type;
  6832. BEGIN
  6833. val := MAX( Type );
  6834. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6835. END "MIN";
  6836. (** INTEGER *)
  6837. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6838. VAR lval, dval: INTEGER;
  6839. BEGIN
  6840. SYSTEM.GET( dadr, dval );
  6841. WHILE (len > 0) DO
  6842. SYSTEM.GET( ladr, lval );
  6843. IF lval < dval THEN dval := lval END;
  6844. INC( ladr, linc ); DEC( len );
  6845. END;
  6846. SYSTEM.PUT( dadr, dval );
  6847. END MinAILoop;
  6848. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6849. TYPE Type = INTEGER;
  6850. VAR val: Type;
  6851. BEGIN
  6852. val := MAX( Type );
  6853. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6854. END "MIN";
  6855. (** LONGINT *)
  6856. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6857. VAR lval, dval: LONGINT;
  6858. BEGIN
  6859. SYSTEM.GET( dadr, dval );
  6860. WHILE (len > 0) DO
  6861. SYSTEM.GET( ladr, lval );
  6862. IF lval < dval THEN dval := lval END;
  6863. INC( ladr, linc ); DEC( len );
  6864. END;
  6865. SYSTEM.PUT( dadr, dval );
  6866. END MinALLoop;
  6867. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6868. TYPE Type = LONGINT;
  6869. VAR val: Type;
  6870. BEGIN
  6871. val := MAX( Type );
  6872. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6873. END "MIN";
  6874. (** SIZE *)
  6875. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6876. VAR lval, dval: SIZE;
  6877. BEGIN
  6878. SYSTEM.GET( dadr, dval );
  6879. WHILE (len > 0) DO
  6880. SYSTEM.GET( ladr, lval );
  6881. IF lval < dval THEN dval := lval END;
  6882. INC( ladr, linc ); DEC( len );
  6883. END;
  6884. SYSTEM.PUT( dadr, dval );
  6885. END MinAZLoop;
  6886. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6887. TYPE Type = SIZE;
  6888. VAR val: Type;
  6889. BEGIN
  6890. val := MAX( Type );
  6891. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAZLoop ); RETURN val;
  6892. END "MIN";
  6893. (** REAL *)
  6894. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6895. VAR lval, dval: REAL;
  6896. BEGIN
  6897. SYSTEM.GET( dadr, dval );
  6898. WHILE (len > 0) DO
  6899. SYSTEM.GET( ladr, lval );
  6900. IF lval < dval THEN dval := lval END;
  6901. INC( ladr, linc ); DEC( len );
  6902. END;
  6903. SYSTEM.PUT( dadr, dval );
  6904. END MinARLoop;
  6905. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6906. TYPE Type = REAL;
  6907. VAR val: Type;
  6908. BEGIN
  6909. val := MAX( Type );
  6910. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6911. END "MIN";
  6912. (** LONGREAL *)
  6913. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6914. VAR lval, dval: LONGREAL;
  6915. BEGIN
  6916. SYSTEM.GET( dadr, dval );
  6917. WHILE (len > 0) DO
  6918. SYSTEM.GET( ladr, lval );
  6919. IF lval < dval THEN dval := lval END;
  6920. INC( ladr, linc ); DEC( len );
  6921. END;
  6922. SYSTEM.PUT( dadr, dval );
  6923. END MinAXLoop;
  6924. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6925. TYPE Type = LONGREAL;
  6926. VAR val: Type;
  6927. BEGIN
  6928. val := MAX( Type );
  6929. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6930. END "MIN";
  6931. (*** max: array -> scalar ********************************************************************)
  6932. (** SHORTINT *)
  6933. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6934. VAR lval, dval: SHORTINT;
  6935. BEGIN
  6936. SYSTEM.GET( dadr, dval );
  6937. WHILE (len > 0) DO
  6938. SYSTEM.GET( ladr, lval );
  6939. IF lval > dval THEN dval := lval END;
  6940. INC( ladr, linc ); DEC( len );
  6941. END;
  6942. SYSTEM.PUT( dadr, dval );
  6943. END MaxASLoop;
  6944. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6945. TYPE Type = SHORTINT;
  6946. VAR val: Type;
  6947. BEGIN
  6948. val := MIN( Type );
  6949. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6950. END "MAX";
  6951. (** INTEGER *)
  6952. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6953. VAR lval, dval: INTEGER;
  6954. BEGIN
  6955. SYSTEM.GET( dadr, dval );
  6956. WHILE (len > 0) DO
  6957. SYSTEM.GET( ladr, lval );
  6958. IF lval > dval THEN dval := lval END;
  6959. INC( ladr, linc ); DEC( len );
  6960. END;
  6961. SYSTEM.PUT( dadr, dval );
  6962. END MaxAILoop;
  6963. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6964. TYPE Type = INTEGER;
  6965. VAR val: Type;
  6966. BEGIN
  6967. val := MIN( Type );
  6968. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6969. END "MAX";
  6970. (** LONGINT *)
  6971. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6972. VAR lval, dval: LONGINT;
  6973. BEGIN
  6974. SYSTEM.GET( dadr, dval );
  6975. WHILE (len > 0) DO
  6976. SYSTEM.GET( ladr, lval );
  6977. IF lval > dval THEN dval := lval END;
  6978. INC( ladr, linc ); DEC( len );
  6979. END;
  6980. SYSTEM.PUT( dadr, dval );
  6981. END MaxALLoop;
  6982. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6983. TYPE Type = LONGINT;
  6984. VAR val: Type;
  6985. BEGIN
  6986. val := MIN( Type );
  6987. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6988. END "MAX";
  6989. (** REAL *)
  6990. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6991. VAR lval, dval: REAL;
  6992. BEGIN
  6993. SYSTEM.GET( dadr, dval );
  6994. WHILE (len > 0) DO
  6995. SYSTEM.GET( ladr, lval );
  6996. IF lval > dval THEN dval := lval END;
  6997. INC( ladr, linc ); DEC( len );
  6998. END;
  6999. SYSTEM.PUT( dadr, dval );
  7000. END MaxARLoop;
  7001. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7002. TYPE Type = REAL;
  7003. VAR val: Type;
  7004. BEGIN
  7005. val := MIN( Type );
  7006. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  7007. END "MAX";
  7008. (** LONGREAL *)
  7009. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7010. VAR lval, dval: LONGREAL;
  7011. BEGIN
  7012. SYSTEM.GET( dadr, dval );
  7013. WHILE (len > 0) DO
  7014. SYSTEM.GET( ladr, lval );
  7015. IF lval > dval THEN dval := lval END;
  7016. INC( ladr, linc ); DEC( len );
  7017. END;
  7018. SYSTEM.PUT( dadr, dval );
  7019. END MaxAXLoop;
  7020. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7021. TYPE Type = LONGREAL;
  7022. VAR val: Type;
  7023. BEGIN
  7024. val := MIN( Type );
  7025. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  7026. END "MAX";
  7027. (*** LEN: array -> array **)
  7028. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LenType;
  7029. VAR src: ADDRESS; dim,i: SIZE;
  7030. BEGIN
  7031. src := SYSTEM.VAL(ADDRESS,left);
  7032. dim := GetDim( src );
  7033. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7034. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(src,i)) END;
  7035. RETURN RESULT
  7036. END "LEN";
  7037. (*** SUM: array -> scalar ********************************************************************)
  7038. (** SHORTINT *)
  7039. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7040. VAR lval, dval: SHORTINT;
  7041. BEGIN
  7042. SYSTEM.GET( dadr, dval );
  7043. WHILE (len > 0) DO
  7044. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7045. END;
  7046. SYSTEM.PUT( dadr, dval );
  7047. END SumASLoop;
  7048. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7049. TYPE Type = SHORTINT;
  7050. VAR val: Type;
  7051. BEGIN
  7052. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  7053. RETURN val;
  7054. END "SUM";
  7055. (** INTEGER *)
  7056. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7057. VAR lval, dval: INTEGER;
  7058. BEGIN
  7059. SYSTEM.GET( dadr, dval );
  7060. WHILE (len > 0) DO
  7061. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7062. END;
  7063. SYSTEM.PUT( dadr, dval );
  7064. END SumAILoop;
  7065. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7066. TYPE Type = INTEGER;
  7067. VAR val: Type;
  7068. BEGIN
  7069. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  7070. RETURN val;
  7071. END "SUM";
  7072. (** LONGINT *)
  7073. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7074. VAR lval, dval: LONGINT;
  7075. BEGIN
  7076. SYSTEM.GET( dadr, dval );
  7077. WHILE (len > 0) DO
  7078. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7079. END;
  7080. SYSTEM.PUT( dadr, dval );
  7081. END SumALLoop;
  7082. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7083. TYPE Type = LONGINT;
  7084. VAR val: Type;
  7085. BEGIN
  7086. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  7087. RETURN val;
  7088. END "SUM";
  7089. (** REAL *)
  7090. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7091. VAR lval, dval: REAL;
  7092. BEGIN
  7093. SYSTEM.GET( dadr, dval );
  7094. WHILE (len > 0) DO
  7095. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7096. END;
  7097. SYSTEM.PUT( dadr, dval );
  7098. END SumARLoop;
  7099. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7100. TYPE Type = REAL;
  7101. VAR val: Type;
  7102. BEGIN
  7103. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  7104. RETURN val;
  7105. END "SUM";
  7106. (** LONGREAL *)
  7107. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7108. VAR lval, dval: LONGREAL;
  7109. BEGIN
  7110. SYSTEM.GET( dadr, dval );
  7111. WHILE (len > 0) DO
  7112. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7113. END;
  7114. SYSTEM.PUT( dadr, dval );
  7115. END SumAXLoop;
  7116. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7117. TYPE Type = LONGREAL;
  7118. VAR val: Type;
  7119. BEGIN
  7120. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  7121. RETURN val;
  7122. END "SUM";
  7123. (** COMPLEX *)
  7124. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7125. VAR lval, dval: COMPLEX;
  7126. BEGIN
  7127. SYSTEM.GET( dadr, dval );
  7128. WHILE (len > 0) DO
  7129. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7130. END;
  7131. SYSTEM.PUT( dadr, dval );
  7132. END SumAZLoop;
  7133. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7134. TYPE Type = COMPLEX;
  7135. VAR val: Type;
  7136. BEGIN
  7137. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  7138. RETURN val;
  7139. END "SUM";
  7140. (** LONGCOMPLEX *)
  7141. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7142. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7143. BEGIN
  7144. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7145. WHILE (len > 0) DO
  7146. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7147. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7148. INC( ladr, linc ); DEC( len );
  7149. END;
  7150. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7151. END SumALZLoop;
  7152. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7153. TYPE Type = LONGCOMPLEX;
  7154. VAR val: Type;
  7155. BEGIN
  7156. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  7157. RETURN val;
  7158. END "SUM";
  7159. (*** monadic ABS array -> array ********************************************************************)
  7160. (** SHORTINT *)
  7161. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7162. VAR lval: SHORTINT;
  7163. BEGIN
  7164. WHILE (len > 0) DO
  7165. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7166. INC( dadr, dinc ); DEC( len );
  7167. END;
  7168. END AbsLoopS;
  7169. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  7170. BEGIN
  7171. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  7172. RETURN RESULT
  7173. END "ABS";
  7174. (** INTEGER *)
  7175. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7176. VAR lval: INTEGER;
  7177. BEGIN
  7178. WHILE (len > 0) DO
  7179. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7180. INC( dadr, dinc ); DEC( len );
  7181. END;
  7182. END AbsLoopI;
  7183. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  7184. BEGIN
  7185. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  7186. RETURN RESULT
  7187. END "ABS";
  7188. (** LONGINT *)
  7189. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7190. VAR lval: LONGINT;
  7191. BEGIN
  7192. WHILE (len > 0) DO
  7193. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7194. INC( dadr, dinc ); DEC( len );
  7195. END;
  7196. END AbsLoopL;
  7197. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  7198. BEGIN
  7199. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  7200. RETURN RESULT
  7201. END "ABS";
  7202. (** REAL *)
  7203. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7204. VAR lval: REAL;
  7205. BEGIN
  7206. WHILE (len > 0) DO
  7207. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7208. INC( dadr, dinc ); DEC( len );
  7209. END;
  7210. END AbsLoopR;
  7211. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  7212. BEGIN
  7213. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  7214. RETURN RESULT
  7215. END "ABS";
  7216. (** LONGREAL *)
  7217. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7218. VAR lval: LONGREAL;
  7219. BEGIN
  7220. WHILE (len > 0) DO
  7221. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7222. INC( dadr, dinc ); DEC( len );
  7223. END;
  7224. END AbsLoopX;
  7225. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  7226. BEGIN
  7227. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  7228. RETURN RESULT
  7229. END "ABS";
  7230. (** COMPLEX *)
  7231. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7232. VAR lval: COMPLEX;
  7233. BEGIN
  7234. WHILE (len > 0) DO
  7235. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7236. INC( dadr, dinc ); DEC( len );
  7237. END;
  7238. END AbsLoopZ;
  7239. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  7240. BEGIN
  7241. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  7242. RETURN RESULT
  7243. END "ABS";
  7244. (** LONGCOMPLEX *)
  7245. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7246. VAR lvalRe, lvalIm: LONGREAL;
  7247. BEGIN
  7248. WHILE (len > 0) DO
  7249. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7250. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7251. INC( ladr, linc );
  7252. INC( dadr, dinc ); DEC( len );
  7253. END;
  7254. END AbsLoopLZ;
  7255. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  7256. BEGIN
  7257. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  7258. RETURN RESULT
  7259. END "ABS";
  7260. (*** assign number to array (initialisation) ********************************************************************)
  7261. (** BOOLEAN *)
  7262. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7263. VAR lval: BOOLEAN;
  7264. BEGIN
  7265. SYSTEM.GET( ladr, lval );
  7266. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7267. END AssignSBABLoop;
  7268. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  7269. BEGIN
  7270. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  7271. END ":=";
  7272. (** SHORTINT*)
  7273. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7274. VAR lval: SHORTINT;
  7275. BEGIN
  7276. SYSTEM.GET( ladr, lval );
  7277. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7278. END AssignSSASLoop;
  7279. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  7280. BEGIN
  7281. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  7282. END ":=";
  7283. (**INTEGER *)
  7284. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7285. VAR lval: INTEGER;
  7286. BEGIN
  7287. SYSTEM.GET( ladr, lval );
  7288. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7289. END AssignSIAILoop;
  7290. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  7291. BEGIN
  7292. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  7293. END ":=";
  7294. (** LONGINT *)
  7295. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7296. VAR lval: LONGINT;
  7297. BEGIN
  7298. SYSTEM.GET( ladr, lval );
  7299. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7300. END AssignSLALLoop;
  7301. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  7302. BEGIN
  7303. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  7304. END ":=";
  7305. (** REAL *)
  7306. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7307. VAR lval: REAL;
  7308. BEGIN
  7309. SYSTEM.GET( ladr, lval );
  7310. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7311. END AssignSRARLoop;
  7312. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  7313. BEGIN
  7314. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  7315. END ":=";
  7316. (** LONGREAL *)
  7317. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7318. VAR lval: LONGREAL;
  7319. BEGIN
  7320. SYSTEM.GET( ladr, lval );
  7321. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7322. END AssignSXAXLoop;
  7323. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7324. BEGIN
  7325. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7326. END ":=";
  7327. (** COMPLEX *)
  7328. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7329. VAR lval: COMPLEX;
  7330. BEGIN
  7331. SYSTEM.GET( ladr, lval );
  7332. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7333. END AssignSZAZLoop;
  7334. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7335. BEGIN
  7336. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7337. END ":=";
  7338. (** LONGCOMPLEX *)
  7339. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7340. VAR lvalRe, lvalIm: LONGREAL;
  7341. BEGIN
  7342. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7343. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7344. END AssignSLZALZLoop;
  7345. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7346. BEGIN
  7347. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7348. END ":=";
  7349. (*** matrix multipliation ********************************************************************)
  7350. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7351. rows, cols, elementsize: SIZE ): ANY;
  7352. VAR p: ANY;
  7353. BEGIN
  7354. (*
  7355. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7356. *)
  7357. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7358. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7359. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7360. PutPtr( dest, p); RETURN p;
  7361. END AllocateMatrix;
  7362. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7363. VAR p: ANY;
  7364. BEGIN
  7365. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7366. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7367. PutPtr( dest, p ); RETURN p;
  7368. END AllocateVector;
  7369. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7370. loop: BinaryAASLoop;
  7371. fast: FastMatMul ); (* Size= element-size *)
  7372. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7373. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7374. BEGIN
  7375. (*
  7376. <- 1 ->
  7377. xxx xxxx -> xxxx
  7378. ^ xxx xxxx xxxx
  7379. 0 xxx xxxx xxxx
  7380. v xxx xxxx
  7381. xxx xxxx
  7382. Len(..,1): #columns ; Inc(..,1): inc in rows
  7383. Len(..,0): #rows ; Inc(..,0): inc between rows
  7384. *)
  7385. (* apply multiplication D = L * R *)
  7386. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7387. colsL := GetLen( left, 1 ); (* # left columns *)
  7388. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7389. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7390. (* check geometric restriction *)
  7391. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7392. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7393. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7394. IF RangeFlag IN GetFlags( dest ) THEN
  7395. Halt( GeometryMismatch, left, right, dest )
  7396. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7397. END;
  7398. END;
  7399. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7400. IF overlap THEN
  7401. destOld := dest; destNew := 0;
  7402. p := AllocateSame( destNew, destOld, Size );
  7403. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7404. dest := destNew;
  7405. END;
  7406. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7407. HALT( 9999 )
  7408. END;
  7409. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7410. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7411. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7412. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7413. (*
  7414. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7415. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7416. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7417. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7418. *)
  7419. IF rowsL = 0 THEN RETURN
  7420. ELSIF colsL=0 THEN RETURN
  7421. ELSIF colsR=0 THEN RETURN
  7422. ELSIF (fast = NIL ) OR
  7423. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7424. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7425. radri := radr; dadri := dadr; colsRi := colsR;
  7426. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7427. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7428. INC( dadri, incD ); DEC( colsRi );
  7429. END;
  7430. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7431. END;
  7432. END;
  7433. IF overlap THEN CopyContent( destOld, dest, Size );
  7434. END;
  7435. END ApplyMatMulLoop;
  7436. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7437. Size: SIZE; loop: BinaryAASLoop;
  7438. fast: FastMatMul ); (* Size= element-size *)
  7439. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7440. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7441. BEGIN
  7442. (*
  7443. <- 0 ->
  7444. xxx T(xxx) -> T(xxxxx)
  7445. xxx
  7446. 1 xxx
  7447. xxx
  7448. xxx
  7449. Len(..,0): #columns ; Inc(..,0): inc in rows
  7450. Len(..,1): #rows ; Inc(..,1): inc between rows
  7451. *)
  7452. (* check geometric restriction *)
  7453. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7454. Halt( GeometryMismatch, left, right,0 );
  7455. END;
  7456. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7457. l2 := GetLen( left, 1 ); (* inner loop len *)
  7458. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7459. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7460. IF RangeFlag IN GetFlags( dest ) THEN
  7461. Halt( GeometryMismatch, left, right, dest );
  7462. ELSE p := AllocateVector( dest, l1, Size );
  7463. END;
  7464. END;
  7465. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7466. IF overlap THEN
  7467. destOld := dest; destNew := 0;
  7468. p := AllocateSame( destNew, destOld, Size );
  7469. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7470. dest := destNew;
  7471. END;
  7472. (*
  7473. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7474. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7475. END;
  7476. *)
  7477. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7478. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7479. di0 := GetIncr( dest, 0 );
  7480. IF l1=0 THEN RETURN
  7481. ELSIF l2=0 THEN RETURN
  7482. ELSIF (fast = NIL ) OR
  7483. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7484. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7485. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7486. DEC( l1 );
  7487. END;
  7488. END;
  7489. IF overlap THEN CopyContent( destOld, dest, Size );
  7490. END;
  7491. END ApplyMatVecMulLoop;
  7492. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7493. Size: SIZE; loop: BinaryAASLoop;
  7494. fast: FastMatMul ); (* Size= element-size *)
  7495. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7496. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7497. BEGIN
  7498. (*
  7499. <- 0 ->
  7500. xxx xxxx -> xxxx
  7501. xxxx
  7502. 1 xxxx
  7503. Len(..,0): #columns ; Inc(..,0): inc in rows
  7504. Len(..,1): #rows ; Inc(..,1): inc between rows
  7505. *)
  7506. (* check geometric restriction *)
  7507. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7508. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7509. l2 := GetLen( right, 0 ); (* inner loop len *)
  7510. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7511. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7512. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7513. ELSE p := AllocateVector( dest, l0, Size );
  7514. END;
  7515. END;
  7516. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7517. IF overlap THEN
  7518. destOld := dest; destNew := 0;
  7519. p := AllocateSame( destNew, destOld, Size );
  7520. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7521. dest := destNew;
  7522. END;
  7523. (*
  7524. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7525. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7526. END;
  7527. *)
  7528. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7529. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7530. di0 := GetIncr( dest, 0 );
  7531. IF l2=0 THEN RETURN
  7532. ELSIF l0=0 THEN RETURN
  7533. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7534. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7535. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7536. DEC( l0 );
  7537. END;
  7538. END;
  7539. IF overlap THEN CopyContent( destOld, dest, Size );
  7540. END;
  7541. END ApplyVecMatMulLoop;
  7542. (** SHORTINT *)
  7543. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7544. VAR lval, rval, dval: SHORTINT;
  7545. BEGIN
  7546. dval := 0;
  7547. WHILE (len > 0) DO
  7548. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7549. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7550. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7551. END;
  7552. SYSTEM.PUT( dadr, dval );
  7553. END MatMulASASLoop;
  7554. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7555. BEGIN
  7556. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7557. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7558. RETURN RESULT
  7559. END "*";
  7560. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7561. BEGIN
  7562. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7563. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7564. RETURN RESULT
  7565. END "*";
  7566. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7567. BEGIN
  7568. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7569. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7570. RETURN RESULT
  7571. END "*";
  7572. (** INTEGER *)
  7573. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7574. VAR lval, rval, dval: INTEGER;
  7575. BEGIN
  7576. dval := 0;
  7577. WHILE (len > 0) DO
  7578. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7579. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7580. END;
  7581. SYSTEM.PUT( dadr, dval );
  7582. END MatMulAIAILoop;
  7583. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7584. BEGIN
  7585. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7586. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7587. RETURN RESULT
  7588. END "*";
  7589. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7590. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7591. BEGIN
  7592. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7593. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7594. RETURN RESULT
  7595. END "*";
  7596. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7597. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7598. BEGIN
  7599. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7600. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7601. RETURN RESULT
  7602. END "*";
  7603. (** LONGINT *)
  7604. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7605. VAR lval, rval, dval: LONGINT;
  7606. BEGIN
  7607. dval := 0;
  7608. WHILE (len > 0) DO
  7609. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7610. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7611. END;
  7612. SYSTEM.PUT( dadr, dval );
  7613. END MatMulALALLoop;
  7614. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7615. BEGIN
  7616. (*
  7617. KernelLog.String("MatMulALAL");
  7618. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7619. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7620. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7621. KernelLog.Ln;
  7622. *)
  7623. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7624. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7625. RETURN RESULT
  7626. END "*";
  7627. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7628. BEGIN
  7629. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7630. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7631. RETURN RESULT
  7632. END "*";
  7633. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7634. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7635. BEGIN
  7636. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7637. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7638. RETURN RESULT
  7639. END "*";
  7640. (** REAL *)
  7641. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7642. VAR lval, rval, dval: REAL;
  7643. BEGIN
  7644. dval := 0;
  7645. WHILE (len > 0) DO
  7646. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7647. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7648. END;
  7649. SYSTEM.PUT( dadr, dval );
  7650. END MatMulARARLoop;
  7651. (*
  7652. Optimized for small matrices (Alexey Morozov)
  7653. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7654. *)
  7655. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7656. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7657. BEGIN
  7658. dadr := GetAdr(ADDRESSOF(RESULT));
  7659. ladr := GetAdr(ADDRESSOF(left));
  7660. radr := GetAdr(ADDRESSOF(right));
  7661. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7662. IF (ladr # dadr) & (radr # dadr) THEN
  7663. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7664. CASE SYSTEM.VAL(LONGINT,flags) OF
  7665. Mat2x2:
  7666. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7667. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7668. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7669. END;
  7670. END;
  7671. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7672. ELSE
  7673. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7674. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7675. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7676. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7677. END;
  7678. |Mat3x3:
  7679. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7680. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7681. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7682. END;
  7683. END;
  7684. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7685. ELSE
  7686. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7687. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7688. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7689. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7690. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7691. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7692. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7693. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7694. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7695. END;
  7696. |Mat4x4:
  7697. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7698. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7699. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7700. END;
  7701. END;
  7702. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7703. ELSE
  7704. 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];
  7705. 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];
  7706. 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];
  7707. 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];
  7708. 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];
  7709. 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];
  7710. 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];
  7711. 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];
  7712. 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];
  7713. 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];
  7714. 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];
  7715. 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];
  7716. 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];
  7717. 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];
  7718. 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];
  7719. 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];
  7720. END;
  7721. ELSE
  7722. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7723. loopMatMulARAR, matMulR );
  7724. END;
  7725. ELSE
  7726. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7727. loopMatMulARAR, matMulR );
  7728. END;
  7729. RETURN RESULT
  7730. END "*";
  7731. (*
  7732. Optimized for small arrays (Alexey Morozov)
  7733. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7734. *)
  7735. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7736. VAR
  7737. flags: SET; dadr, ladr, radr: ADDRESS;
  7738. v0, v1, v2: REAL;
  7739. BEGIN
  7740. dadr := GetAdr(ADDRESSOF(RESULT));
  7741. ladr := GetAdr(ADDRESSOF(left));
  7742. radr := GetAdr(ADDRESSOF(right));
  7743. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7744. CASE SYSTEM.VAL(LONGINT,flags) OF
  7745. MatVec2x2:
  7746. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7747. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7748. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7749. END;
  7750. END;
  7751. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7752. ELSE
  7753. (* account possible overlapping *)
  7754. v0 := right[0];
  7755. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7756. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7757. END;
  7758. |MatVec3x3:
  7759. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7760. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7761. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7762. END;
  7763. END;
  7764. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7765. ELSE
  7766. (* account possible overlapping *)
  7767. v0 := right[0]; v1 := right[1];
  7768. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7769. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7770. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7771. END;
  7772. |MatVec4x4:
  7773. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7774. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7775. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7776. END;
  7777. END;
  7778. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7779. ELSE
  7780. (* account possible overlapping *)
  7781. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7782. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7783. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7784. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7785. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7786. END;
  7787. ELSE
  7788. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7789. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7790. END;
  7791. RETURN RESULT
  7792. END "*";
  7793. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7794. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7795. BEGIN
  7796. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7797. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7798. RETURN RESULT
  7799. END "*";
  7800. (** LONGREAL *)
  7801. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7802. VAR lval, rval, dval: LONGREAL;
  7803. BEGIN
  7804. dval := 0;
  7805. WHILE (len > 0) DO
  7806. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7807. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7808. END;
  7809. SYSTEM.PUT( dadr, dval );
  7810. END MatMulAXAXLoop;
  7811. (*
  7812. Optimized for small matrices (Alexey Morozov)
  7813. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7814. *)
  7815. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7816. VAR
  7817. flags: SET; dadr, ladr, radr: ADDRESS;
  7818. BEGIN
  7819. dadr := GetAdr(ADDRESSOF(RESULT));
  7820. ladr := GetAdr(ADDRESSOF(left));
  7821. radr := GetAdr(ADDRESSOF(right));
  7822. IF (ladr # dadr) & (radr # dadr) THEN
  7823. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7824. CASE SYSTEM.VAL(LONGINT,flags) OF
  7825. Mat2x2:
  7826. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7827. IF dadr = 0 THEN NEW(RESULT,2,2);
  7828. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7829. END;
  7830. END;
  7831. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7832. ELSE
  7833. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7834. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7835. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7836. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7837. END;
  7838. |Mat3x3:
  7839. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7840. IF dadr = 0 THEN NEW(RESULT,3,3);
  7841. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7842. END;
  7843. END;
  7844. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7845. ELSE
  7846. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7847. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7848. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7849. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7850. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7851. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7852. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7853. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7854. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7855. END;
  7856. |Mat4x4:
  7857. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7858. IF dadr = 0 THEN NEW(RESULT,4,4);
  7859. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7860. END;
  7861. END;
  7862. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7863. ELSE
  7864. 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];
  7865. 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];
  7866. 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];
  7867. 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];
  7868. 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];
  7869. 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];
  7870. 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];
  7871. 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];
  7872. 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];
  7873. 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];
  7874. 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];
  7875. 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];
  7876. 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];
  7877. 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];
  7878. 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];
  7879. 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];
  7880. END;
  7881. ELSE
  7882. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7883. loopMatMulAXAX, matMulX );
  7884. END;
  7885. ELSE
  7886. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7887. loopMatMulAXAX, matMulX );
  7888. END;
  7889. RETURN RESULT
  7890. END "*";
  7891. (*
  7892. Optimized for small arrays (Alexey Morozov)
  7893. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7894. *)
  7895. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7896. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7897. VAR
  7898. flags: SET; dadr, ladr, radr: ADDRESS;
  7899. v0, v1, v2: LONGREAL;
  7900. BEGIN
  7901. dadr := GetAdr(ADDRESSOF(RESULT));
  7902. ladr := GetAdr(ADDRESSOF(left));
  7903. radr := GetAdr(ADDRESSOF(right));
  7904. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7905. CASE SYSTEM.VAL(LONGINT,flags) OF
  7906. MatVec2x2:
  7907. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7908. IF dadr = 0 THEN NEW(RESULT,2);
  7909. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7910. END;
  7911. END;
  7912. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7913. ELSE
  7914. (* account possible overlapping *)
  7915. v0 := right[0];
  7916. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7917. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7918. END;
  7919. |MatVec3x3:
  7920. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7921. IF dadr = 0 THEN NEW(RESULT,3);
  7922. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7923. END;
  7924. END;
  7925. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7926. ELSE
  7927. (* account possible overlapping *)
  7928. v0 := right[0]; v1 := right[1];
  7929. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7930. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7931. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7932. END;
  7933. |MatVec4x4:
  7934. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7935. IF dadr = 0 THEN NEW(RESULT,4);
  7936. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7937. END;
  7938. END;
  7939. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7940. ELSE
  7941. (* account possible overlapping *)
  7942. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7943. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7944. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7945. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7946. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7947. END;
  7948. ELSE
  7949. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7950. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7951. END;
  7952. RETURN RESULT
  7953. END "*";
  7954. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7955. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7956. BEGIN
  7957. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7958. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7959. RETURN RESULT
  7960. END "*";
  7961. (** SHORTINT *)
  7962. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7963. VAR lval, rval, dval: SHORTINT;
  7964. BEGIN
  7965. SYSTEM.GET( dadr, dval );
  7966. WHILE (len > 0) DO
  7967. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7968. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7969. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7970. END;
  7971. SYSTEM.PUT( dadr, dval );
  7972. END MatMulIncASASLoop;
  7973. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7974. BEGIN
  7975. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7976. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7977. RETURN RESULT
  7978. END "INCMUL";
  7979. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7980. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7981. BEGIN
  7982. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7983. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7984. RETURN RESULT
  7985. END "INCMUL";
  7986. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7987. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7988. BEGIN
  7989. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7990. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7991. RETURN RESULT
  7992. END "INCMUL";
  7993. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7994. BEGIN
  7995. RESULT := -RESULT;
  7996. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7997. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7998. RESULT := -RESULT;
  7999. RETURN RESULT
  8000. END "DECMUL";
  8001. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8002. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8003. BEGIN
  8004. RESULT := -RESULT;
  8005. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8006. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8007. RESULT := -RESULT;
  8008. RETURN RESULT
  8009. END "DECMUL";
  8010. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8011. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8012. BEGIN
  8013. RESULT := -RESULT;
  8014. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8015. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8016. RESULT := -RESULT;
  8017. RETURN RESULT
  8018. END "DECMUL";
  8019. (** INTEGER *)
  8020. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8021. VAR lval, rval, dval: INTEGER;
  8022. BEGIN
  8023. SYSTEM.GET( dadr, dval );
  8024. WHILE (len > 0) DO
  8025. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8026. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8027. END;
  8028. SYSTEM.PUT( dadr, dval );
  8029. END MatMulIncAIAILoop;
  8030. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8031. BEGIN
  8032. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8033. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8034. RETURN RESULT
  8035. END "INCMUL";
  8036. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8037. BEGIN
  8038. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8039. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8040. RETURN RESULT
  8041. END "INCMUL";
  8042. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8043. BEGIN
  8044. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8045. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8046. RETURN RESULT
  8047. END "INCMUL";
  8048. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8049. BEGIN
  8050. RESULT := -RESULT;
  8051. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8052. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8053. RESULT := -RESULT;
  8054. RETURN RESULT
  8055. END "DECMUL";
  8056. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8057. BEGIN
  8058. RESULT := -RESULT;
  8059. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8060. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8061. RESULT := -RESULT;
  8062. RETURN RESULT
  8063. END "DECMUL";
  8064. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8065. BEGIN
  8066. RESULT := -RESULT;
  8067. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8068. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8069. RESULT := -RESULT;
  8070. RETURN RESULT
  8071. END "DECMUL";
  8072. (** LONGINT *)
  8073. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8074. VAR lval, rval, dval: LONGINT;
  8075. BEGIN
  8076. SYSTEM.GET( dadr, dval );
  8077. WHILE (len > 0) DO
  8078. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8079. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8080. END;
  8081. SYSTEM.PUT( dadr, dval );
  8082. END MatMulIncALALLoop;
  8083. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8084. BEGIN
  8085. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8086. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8087. RETURN RESULT
  8088. END "INCMUL";
  8089. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8090. BEGIN
  8091. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8092. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8093. RETURN RESULT
  8094. END "INCMUL";
  8095. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8096. BEGIN
  8097. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8098. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8099. RETURN RESULT
  8100. END "INCMUL";
  8101. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8102. BEGIN
  8103. RESULT := -RESULT;
  8104. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8105. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8106. RESULT := -RESULT;
  8107. RETURN RESULT
  8108. END "DECMUL";
  8109. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8110. BEGIN
  8111. RESULT := -RESULT;
  8112. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8113. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8114. RESULT := -RESULT;
  8115. RETURN RESULT
  8116. END "DECMUL";
  8117. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8118. BEGIN
  8119. RESULT := -RESULT;
  8120. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8121. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8122. RESULT := -RESULT;
  8123. RETURN RESULT
  8124. END "DECMUL";
  8125. (** REAL *)
  8126. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8127. VAR lval, rval, dval: REAL;
  8128. BEGIN
  8129. SYSTEM.GET( dadr, dval );
  8130. WHILE (len > 0) DO
  8131. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8132. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8133. END;
  8134. SYSTEM.PUT( dadr, dval );
  8135. END MatMulIncARARLoop;
  8136. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8137. BEGIN
  8138. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8139. loopMatMulIncARAR, matMulIncR );
  8140. RETURN RESULT
  8141. END "INCMUL";
  8142. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8143. BEGIN
  8144. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8145. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8146. RETURN RESULT
  8147. END "INCMUL";
  8148. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8149. BEGIN
  8150. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8151. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8152. RETURN RESULT
  8153. END "INCMUL";
  8154. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8155. BEGIN
  8156. RESULT := -RESULT;
  8157. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8158. loopMatMulIncARAR, matMulIncR );
  8159. RESULT := -RESULT;
  8160. RETURN RESULT
  8161. END "DECMUL";
  8162. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8163. BEGIN
  8164. RESULT := -RESULT;
  8165. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8166. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8167. RESULT := -RESULT;
  8168. RETURN RESULT
  8169. END "DECMUL";
  8170. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8171. BEGIN
  8172. RESULT := -RESULT;
  8173. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8174. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8175. RESULT := -RESULT;
  8176. RETURN RESULT
  8177. END "DECMUL";
  8178. (** LONGREAL *)
  8179. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8180. VAR lval, rval, dval: LONGREAL;
  8181. BEGIN
  8182. SYSTEM.GET( dadr, dval );
  8183. WHILE (len > 0) DO
  8184. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8185. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8186. END;
  8187. SYSTEM.PUT( dadr, dval );
  8188. END MatMulIncAXAXLoop;
  8189. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8190. BEGIN
  8191. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8192. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8193. RETURN RESULT
  8194. END "INCMUL";
  8195. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8196. BEGIN
  8197. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8198. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8199. RETURN RESULT
  8200. END "INCMUL";
  8201. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8202. BEGIN
  8203. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8204. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8205. RETURN RESULT
  8206. END "INCMUL";
  8207. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8208. BEGIN
  8209. RESULT := -RESULT;
  8210. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8211. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8212. RESULT := -RESULT;
  8213. RETURN RESULT
  8214. END "DECMUL";
  8215. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8216. BEGIN
  8217. RESULT := -RESULT;
  8218. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8219. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8220. RESULT := -RESULT;
  8221. RETURN RESULT
  8222. END "DECMUL";
  8223. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8224. BEGIN
  8225. RESULT := -RESULT;
  8226. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8227. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8228. RESULT := -RESULT;
  8229. RETURN RESULT
  8230. END "DECMUL";
  8231. (*** Cross product ********************************************************************)
  8232. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8233. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8234. BEGIN
  8235. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8236. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8237. END;
  8238. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8239. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8240. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8241. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8242. RETURN RESULT
  8243. END "*";
  8244. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8245. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8246. BEGIN
  8247. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8248. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8249. END;
  8250. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8251. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8252. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8253. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8254. RETURN RESULT
  8255. END "*";
  8256. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8257. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8258. BEGIN
  8259. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8260. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8261. END;
  8262. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8263. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8264. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8265. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8266. RETURN RESULT
  8267. END "*";
  8268. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8269. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8270. BEGIN
  8271. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8272. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8273. END;
  8274. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8275. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8276. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8277. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8278. RETURN RESULT
  8279. END "*";
  8280. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8281. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8282. BEGIN
  8283. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8284. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8285. END;
  8286. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8287. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8288. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8289. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8290. RETURN RESULT
  8291. END "*";
  8292. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  8293. VAR tensor: Tensor;
  8294. BEGIN
  8295. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8296. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8297. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8298. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8299. ELSE HALT(200);
  8300. END;
  8301. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8302. loopMatMulAXAX, matMulX );
  8303. RETURN RESULT
  8304. END "*";
  8305. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  8306. BEGIN
  8307. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8308. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8309. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8310. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8311. ELSE HALT(200);
  8312. END;
  8313. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8314. loopMatMulARAR, matMulR );
  8315. RETURN RESULT
  8316. END "*";
  8317. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  8318. BEGIN
  8319. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8320. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8321. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8322. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8323. ELSE HALT(200);
  8324. END;
  8325. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8326. MatMulALALLoop, NIL );
  8327. RETURN RESULT
  8328. END "*";
  8329. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8330. BEGIN
  8331. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8332. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8333. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8334. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8335. ELSE HALT(200);
  8336. END;
  8337. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8338. MatMulAIAILoop,NIL );
  8339. RETURN RESULT
  8340. END "*";
  8341. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8342. BEGIN
  8343. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8344. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8345. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8346. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8347. ELSE HALT(200);
  8348. END;
  8349. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8350. MatMulASASLoop, NIL );
  8351. RETURN RESULT
  8352. END "*";
  8353. (** Transpose ********************************************************************)
  8354. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8355. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8356. BEGIN
  8357. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8358. dim := GetDim( src1 ) - 1;
  8359. WHILE (dim > 0) DO
  8360. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8361. END;
  8362. dim := GetDim( src2 ) - 1;
  8363. WHILE (dim > 0) DO
  8364. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8365. END;
  8366. IF from1 < from2 THEN RETURN to1 >= from2;
  8367. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8368. ELSE RETURN TRUE;
  8369. END;
  8370. END Overlap;
  8371. (*
  8372. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8373. VAR from1, from2, to1, to2: ADDRESS;
  8374. BEGIN
  8375. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8376. DEC( dim );
  8377. WHILE (dim > 0) DO
  8378. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8379. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8380. END;
  8381. IF from1 < from2 THEN RETURN to1 >= from2;
  8382. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8383. ELSE RETURN TRUE;
  8384. END;
  8385. END Overlap;
  8386. *)
  8387. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8388. VAR ptr, data: ANY; Size: SIZE;
  8389. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8390. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8391. VAR dim,max: SIZE;
  8392. BEGIN
  8393. dim := GetDim( l );
  8394. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8395. max := dim-1;
  8396. WHILE (dim > 0) DO
  8397. DEC( dim );
  8398. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8399. END;
  8400. RETURN TRUE;
  8401. END TransposedShape;
  8402. PROCEDURE NewData;
  8403. VAR max,dim, len, size: SIZE;
  8404. BEGIN
  8405. dim := GetDim( src ); size := elementsize;
  8406. PutDim( dest, dim );
  8407. PutSize( dest, elementsize );
  8408. max := dim-1;
  8409. WHILE (dim > 0) DO
  8410. DEC( dim );
  8411. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8412. PutInc( dest, dim, size ); size := size * len;
  8413. END;
  8414. SYSTEM.NEW( data, size + ArrayAlignment);
  8415. PutAdr( dest, Align(data) );
  8416. PutPtr( dest, data );
  8417. END NewData;
  8418. BEGIN
  8419. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8420. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8421. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8422. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8423. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8424. PutFlags(dest, {TensorFlag});
  8425. NewData();
  8426. RETURN ptr;
  8427. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8428. (* check if re-allocation of descriptor is allowed *)
  8429. IF ~(TensorFlag IN GetFlags( dest )) &
  8430. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8431. HALT( 100 );
  8432. END;
  8433. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8434. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8435. PutFlags(dest, {TensorFlag});
  8436. NewData(); RETURN ptr;
  8437. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8438. (* check if re-allocation of array data is allowed *)
  8439. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8440. HALT( 100 );
  8441. END;
  8442. NewData();
  8443. RETURN data;
  8444. ELSE (* nothing to do *)
  8445. RETURN NIL;
  8446. END;
  8447. END AllocateTransposed;
  8448. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8449. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8450. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8451. BEGIN
  8452. WHILE (len > 0) DO
  8453. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8454. DEC( len );
  8455. END;
  8456. END CopyLoop;
  8457. BEGIN
  8458. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8459. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8460. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8461. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8462. ELSE
  8463. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8464. p := AllocateTransposed(dest,left,Size);
  8465. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8466. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8467. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8468. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8469. WHILE (len0 > 0) DO
  8470. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8471. INC( dadr, dinc0 ); DEC( len0 );
  8472. END;
  8473. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8474. ladr := p;
  8475. ELSE
  8476. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8477. END;
  8478. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8479. dadr := GetAdr( dest );
  8480. IF (Size = 4) & (transpose4 # NIL ) THEN
  8481. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8482. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8483. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8484. ELSE
  8485. WHILE (len0 > 0) DO
  8486. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8487. INC( dadr, dinc1 ); DEC( len0 );
  8488. END;
  8489. END;
  8490. END;
  8491. END Transpose;
  8492. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8493. BEGIN
  8494. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8495. RETURN RESULT
  8496. END "`";
  8497. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8498. BEGIN
  8499. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8500. RETURN RESULT
  8501. END "`";
  8502. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8503. BEGIN
  8504. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8505. RETURN RESULT
  8506. END "`";
  8507. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8508. BEGIN
  8509. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8510. RETURN RESULT
  8511. END "`";
  8512. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8513. BEGIN
  8514. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8515. RETURN RESULT
  8516. END "`";
  8517. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8518. VAR i: SIZE;
  8519. BEGIN
  8520. FOR i := 0 TO rdim - 1 DO
  8521. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8522. END;
  8523. FOR i := 0 TO ldim - 1 DO
  8524. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8525. END;
  8526. RETURN TRUE;
  8527. END CheckTensorGeometry;
  8528. (*
  8529. PROCEDURE Zero(p: ANY; size: LONGINT);
  8530. VAR adr: LONGINT;
  8531. BEGIN
  8532. adr := SYSTEM.VAL(LONGINT,p);
  8533. WHILE(size>0) DO
  8534. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8535. END;
  8536. END Zero;
  8537. *)
  8538. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8539. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8540. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8541. squeezingReshape: BOOLEAN;
  8542. PROCEDURE CheckAlloc;
  8543. BEGIN
  8544. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8545. END CheckAlloc;
  8546. PROCEDURE NewDescriptor;
  8547. BEGIN
  8548. CheckAlloc;
  8549. ptr := GetArrayDesc( newDim ); new := ptr;
  8550. END NewDescriptor;
  8551. (* Added by Alexey
  8552. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8553. *)
  8554. PROCEDURE SqueezingReshape(): BOOLEAN;
  8555. VAR
  8556. i, j, n: SIZE;
  8557. BEGIN
  8558. IF oldDim > newDim THEN
  8559. i := 0; j := 0;
  8560. WHILE (i < oldDim) & (j < newDim) DO
  8561. n := GetLen(src,i);
  8562. IF n = shape[j] THEN INC(j); END;
  8563. INC(i);
  8564. END;
  8565. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8566. ELSE
  8567. squeezingReshape := FALSE;
  8568. END;
  8569. squeezingReshape := (i = oldDim) & (j = newDim);
  8570. RETURN squeezingReshape;
  8571. END SqueezingReshape;
  8572. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8573. PROCEDURE TargetContinuous(): BOOLEAN;
  8574. VAR
  8575. i, n: SIZE;
  8576. continue: BOOLEAN;
  8577. BEGIN
  8578. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8579. continue := TRUE;
  8580. WHILE (i > 0) & continue DO
  8581. n := n * GetLen(dest,i);
  8582. DEC(i);
  8583. continue := GetIncr(dest,i) = n;
  8584. END;
  8585. (*TRACE(i,continue,Size,GetSize(dest));*)
  8586. (*tod obviously size is not what I expect it to be*)
  8587. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8588. RETURN TRUE;
  8589. ELSE
  8590. RETURN FALSE;
  8591. END;
  8592. END TargetContinuous;
  8593. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8594. PROCEDURE PreservesContiguity(): BOOLEAN;
  8595. VAR
  8596. i, n: SIZE;
  8597. continue: BOOLEAN;
  8598. BEGIN
  8599. i := oldDim-1; n := GetIncr(src,i);
  8600. continue := TRUE;
  8601. WHILE (i > 0) & continue DO
  8602. n := n * GetLen(src,i);
  8603. DEC(i);
  8604. continue := GetIncr(src,i) = n;
  8605. END;
  8606. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8607. RETURN TRUE;
  8608. ELSE Err("Not yet implemented!");
  8609. END;
  8610. END PreservesContiguity;
  8611. (* Added by Alexey *)
  8612. PROCEDURE NewDescriptorForSameData;
  8613. VAR len, size, i, j: SIZE;
  8614. BEGIN
  8615. CheckAlloc();
  8616. ptr := GetArrayDesc( newDim ); new := ptr;
  8617. IF ~squeezingReshape THEN
  8618. size := Size;
  8619. FOR i := newDim - 1 TO 0 BY -1 DO
  8620. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8621. size := size * len;
  8622. END;
  8623. ELSE (* squeezing reshape *)
  8624. j := 0; len := shape[j];
  8625. FOR i := 0 TO oldDim-1 DO
  8626. IF GetLen(src,i) = len THEN
  8627. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8628. INC(j);
  8629. IF j < newDim THEN len := shape[j]; END;
  8630. END;
  8631. END;
  8632. END;
  8633. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8634. PutFlags(new,GetFlags(new)+{RangeFlag});
  8635. END;
  8636. PutAdr( new, GetAdr(src) );
  8637. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8638. PutSize( new, Size );
  8639. END NewDescriptorForSameData;
  8640. PROCEDURE NewData;
  8641. VAR len, size, i: SIZE;
  8642. BEGIN
  8643. size := Size;
  8644. FOR i := newDim - 1 TO 0 BY -1 DO
  8645. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8646. size := size * len;
  8647. END;
  8648. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8649. PutAdr( new, Align(data) );
  8650. PutPtr( new, data ); PutDim( new, newDim );
  8651. PutSize( new, Size );
  8652. END NewData;
  8653. PROCEDURE CopyData;
  8654. VAR d, s: SIZE; dadr: ADDRESS;
  8655. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8656. VAR inc, len, i: SIZE;
  8657. BEGIN
  8658. IF dim = d THEN
  8659. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8660. FOR i := 0 TO len - 1 DO
  8661. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8662. END;
  8663. ELSE
  8664. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8665. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8666. END;
  8667. END Loop;
  8668. BEGIN
  8669. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8670. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8671. s := s * GetLen( src, d ); DEC( d );
  8672. END;
  8673. IF d = -1 THEN (* special case: both continuous *)
  8674. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8675. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8676. END;
  8677. END CopyData;
  8678. PROCEDURE CopyDataBack;
  8679. VAR d, s: SIZE; sadr: ADDRESS;
  8680. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8681. VAR inc, len, i: SIZE;
  8682. BEGIN
  8683. IF dim = d THEN
  8684. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8685. FOR i := 0 TO len - 1 DO
  8686. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8687. END;
  8688. ELSE
  8689. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8690. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8691. END;
  8692. END Loop;
  8693. BEGIN
  8694. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8695. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8696. s := s * GetLen( dest, d ); DEC( d );
  8697. END;
  8698. IF d = -1 THEN (* special case: both continuous *)
  8699. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8700. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8701. END;
  8702. END CopyDataBack;
  8703. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8704. BEGIN
  8705. ASSERT( GetDim( src ) = GetDim( dest ) );
  8706. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8707. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8708. END CopyDescriptor;
  8709. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8710. VAR i: SIZE;
  8711. BEGIN
  8712. ASSERT(GetDim(dest) = newDim);
  8713. FOR i := 0 TO newDim - 1 DO
  8714. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8715. END;
  8716. RETURN FALSE;
  8717. END ShapeDiffers;
  8718. BEGIN
  8719. (*
  8720. cases
  8721. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8722. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8723. 3.) descriptor may not be reshaped: dest = RANGE
  8724. *)
  8725. (* first check invariants *)
  8726. oldDim := GetDim( src );
  8727. IF oldDim = 0 THEN oldSize := 0
  8728. ELSE
  8729. oldSize := 1;
  8730. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8731. END;
  8732. newDim := LEN( shape, 0 );
  8733. IF newDim = 0 THEN newSize := 0
  8734. ELSE
  8735. newSize := 1;
  8736. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8737. END;
  8738. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8739. Size := GetSize( src );
  8740. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8741. IF dest = src THEN (* added by Alexey *)
  8742. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8743. NewDescriptorForSameData;
  8744. dest := new;
  8745. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8746. (* create a copy of the original descriptor *)
  8747. CheckAlloc();
  8748. ptr := GetArrayDesc(newDim); dest := ptr;
  8749. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8750. CopyDescriptor(src,dest);
  8751. ELSE
  8752. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8753. END;
  8754. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8755. NewDescriptor; NewData; CopyData; dest := new;
  8756. ELSIF (dest = temporary) THEN
  8757. NewDescriptorForSameData;
  8758. dest := new;
  8759. ELSIF TargetContinuous() THEN
  8760. NewDescriptor; new:=dest; CopyData;
  8761. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8762. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8763. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8764. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8765. END;
  8766. NewDescriptor; NewData; CopyData;
  8767. dest := new;
  8768. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8769. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8770. (*
  8771. NewDescriptor; *)
  8772. new := dest;
  8773. NewData; CopyData;
  8774. new := NIL;
  8775. (*CopyDescriptor( new, dest );*)
  8776. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8777. NewDescriptor; NewData; CopyData; CopyDataBack;
  8778. ELSE (* same shape, just copy *)
  8779. CopyContent( src, dest, Size ); RETURN;
  8780. END;
  8781. IF dest = new THEN (* new block *)
  8782. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  8783. END;
  8784. END DoReshape;
  8785. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8786. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8787. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8788. PROCEDURE NewData;
  8789. VAR len, size, i: SIZE;
  8790. BEGIN
  8791. size := elementSize;
  8792. FOR i := dim - 1 TO 0 BY -1 DO
  8793. len := a[i];
  8794. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8795. END;
  8796. IF tag = 0 THEN
  8797. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8798. dest.adr := Align(data);
  8799. ELSE
  8800. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8801. dest.adr := data + ArrDataArrayOffset;
  8802. END;
  8803. SafePut(dest.ptr, data);
  8804. (*dest.ptr := data;*)
  8805. PutSize( dest, elementSize );
  8806. END NewData;
  8807. PROCEDURE ClearData;
  8808. (*! todo *)
  8809. END ClearData;
  8810. BEGIN
  8811. dim := LEN( a,0 );
  8812. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8813. IF dest # 0 THEN
  8814. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8815. END;
  8816. descr := GetArrayDesc( LEN( a,0 ) );
  8817. dest := descr;
  8818. NewData;
  8819. Heaps.SetPC(data);
  8820. ELSE
  8821. i := 0;
  8822. same := TRUE;
  8823. WHILE (i < dim) & same DO
  8824. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8825. INC( i );
  8826. END;
  8827. IF ~same THEN
  8828. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8829. NewData;
  8830. Heaps.SetPC(data);
  8831. ELSE ClearData
  8832. END;
  8833. END;
  8834. END AllocateTensorA;
  8835. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8836. BEGIN
  8837. AllocateTensorA(a,elementSize,tag,dest);
  8838. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8839. END AllocateArrayA;
  8840. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8841. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  8842. PROCEDURE NewData;
  8843. VAR len, size: SIZE; i: SIZE;
  8844. BEGIN
  8845. size := Size;
  8846. FOR i := dim - 1 TO 0 BY -1 DO
  8847. len := a[i];
  8848. (*
  8849. KernelLog.Int(len,10); KernelLog.Ln;
  8850. *)
  8851. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8852. END;
  8853. IF tag = 0 THEN
  8854. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8855. PutAdr( dest, Align(data) );
  8856. ELSE
  8857. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8858. PutAdr( dest, data+ ArrDataArrayOffset );
  8859. END;
  8860. PutPtr( dest, data ); PutSize( dest, Size );
  8861. END NewData;
  8862. PROCEDURE ClearData;
  8863. (*! todo *)
  8864. END ClearData;
  8865. BEGIN
  8866. dim := LEN( a,0 );
  8867. dest := SYSTEM.VAL(ADDRESS,destA);
  8868. (*! check range flag! *)
  8869. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8870. IF dest # 0 THEN
  8871. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8872. END;
  8873. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8874. NewData;
  8875. ELSE
  8876. i := 0;
  8877. WHILE (i < dim) & same DO
  8878. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8879. INC( i );
  8880. END;
  8881. IF ~same THEN
  8882. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8883. NewData
  8884. ELSE ClearData
  8885. END;
  8886. END;
  8887. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8888. IF dest = descr THEN (* new block *)
  8889. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  8890. END;
  8891. END AllocateTensorX;
  8892. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8893. VAR dim, i: SIZE;
  8894. BEGIN
  8895. dim := GetDim( src );
  8896. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8897. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8898. END LenA;
  8899. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8900. VAR dim, len: SIZE; i: SIZE;
  8901. BEGIN
  8902. dim := GetDim( src ); len := LEN( dest, 0 );
  8903. IF len # dim THEN NEW( dest, dim ); END;
  8904. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8905. END IncrA;
  8906. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8907. VAR dim: SIZE;
  8908. BEGIN
  8909. dim := GetDim(src);
  8910. IF (d<0) OR (d>=dim) THEN HALT(100)
  8911. ELSE
  8912. RETURN GetLen(src,d);
  8913. END;
  8914. END Len;
  8915. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8916. VAR dim: SIZE;
  8917. BEGIN
  8918. dim := GetDim(src);
  8919. IF (d<0) OR (d>=dim) THEN HALT(100)
  8920. ELSE
  8921. RETURN GetIncr(src,d);
  8922. END;
  8923. END Incr;
  8924. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8925. Size: SIZE ): ANY;
  8926. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8927. PROCEDURE NewData;
  8928. VAR len, size, i: SIZE;
  8929. BEGIN
  8930. size := 1;
  8931. FOR i := 0 TO ldim - 1 DO
  8932. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8933. END;
  8934. FOR i := 0 TO rdim - 1 DO
  8935. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8936. END;
  8937. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8938. (*
  8939. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8940. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8941. *)
  8942. size := Size;
  8943. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8944. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8945. END;
  8946. PutAdr( dest, Align(data) );
  8947. PutPtr( dest, data );
  8948. END NewData;
  8949. BEGIN
  8950. ldim := GetDim( left ); rdim := GetDim( right );
  8951. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8952. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8953. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8954. NewData(); RETURN ptr;
  8955. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8956. IF ~(TensorFlag IN GetFlags( dest )) &
  8957. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8958. HALT( 100 );
  8959. END;
  8960. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8961. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8962. NewData(); RETURN ptr;
  8963. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8964. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8965. HALT( 100 );
  8966. END;
  8967. NewData(); RETURN data;
  8968. END;
  8969. RETURN NIL;
  8970. END AllocateTensor;
  8971. (* 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 *)
  8972. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8973. VAR rdim, len, linc, ri: SIZE );
  8974. (* geometric precondition: lengths must coincide *)
  8975. VAR ldim: SIZE;
  8976. BEGIN
  8977. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8978. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8979. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8980. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8981. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8982. END;
  8983. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8984. DEC( ldim );
  8985. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8986. (GetIncr( right, rdim ) = len * ri) DO
  8987. len := len * GetLen( left, ldim );
  8988. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8989. DEC( ldim );
  8990. END;
  8991. INC( ldim ); INC( rdim );
  8992. IF debug THEN
  8993. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8994. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8995. END;
  8996. END FindPatternTensor;
  8997. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  8998. Loop: BinaryASALoop );
  8999. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  9000. origdest: ADDRESS; left, right, dest: ADDRESS;
  9001. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9002. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9003. BEGIN
  9004. IF (ldim < lDim) THEN
  9005. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9006. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9007. WHILE (len > 0) DO
  9008. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9009. INC( dadr, dinc ); DEC( len );
  9010. END;
  9011. ELSIF (rdim # loopd) THEN
  9012. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9013. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9014. WHILE (len > 0) DO
  9015. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9016. INC( dadr, dinc ); DEC( len );
  9017. END;
  9018. ELSE
  9019. (*
  9020. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9021. KernelLog.Int(GetAdr(dest),10);
  9022. KernelLog.Int(GetAdr(dest)+clen,10);
  9023. KernelLog.Ln;
  9024. *)
  9025. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9026. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9027. END;
  9028. END Traverse;
  9029. BEGIN
  9030. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  9031. (* check array lengths *)
  9032. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9033. p := AllocateTensor( dest, left, right, elementSize );
  9034. (*
  9035. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9036. p := AllocateTensor( left, right, dest, elementSize )
  9037. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9038. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9039. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9040. END;
  9041. (*! to be done: treat overlapping memory *)
  9042. END;
  9043. *)
  9044. (* debugging *)
  9045. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9046. (* check pattern: longest piece that can be done with a loop *)
  9047. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9048. (* run through dimensions *)
  9049. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9050. SYSTEM.PUT( d, dest );
  9051. IF p = dest THEN
  9052. Heaps.CheckAssignment(d,dest);
  9053. END;
  9054. END ApplyTensorAAAOp;
  9055. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  9056. BEGIN
  9057. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9058. SIZEOF( SHORTINT ), MulASSSLoop );
  9059. RETURN RESULT
  9060. END "**";
  9061. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  9062. BEGIN
  9063. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9064. SIZEOF( INTEGER ), MulAISILoop );
  9065. RETURN RESULT
  9066. END "**";
  9067. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  9068. BEGIN
  9069. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9070. SIZEOF( LONGINT ), MulALSLLoop );
  9071. RETURN RESULT
  9072. END "**";
  9073. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  9074. BEGIN
  9075. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  9076. loopMulARSR );
  9077. RETURN RESULT
  9078. END "**";
  9079. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  9080. BEGIN
  9081. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9082. SIZEOF( LONGREAL ), loopMulAXSX );
  9083. RETURN RESULT
  9084. END "**";
  9085. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  9086. BEGIN
  9087. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  9088. loopMulAZSZ );
  9089. RETURN RESULT
  9090. END "**";
  9091. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  9092. BEGIN
  9093. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  9094. loopMulALZSLZ );
  9095. RETURN RESULT
  9096. END "**";
  9097. PROCEDURE InitOptimization;
  9098. VAR p: PROCEDURE;
  9099. BEGIN
  9100. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9101. IF p # NIL THEN
  9102. p;
  9103. ELSE
  9104. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9105. END;
  9106. END InitOptimization;
  9107. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9108. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9109. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  9110. BEGIN
  9111. IF src = 0 THEN
  9112. HALT(100);
  9113. ELSE
  9114. srcDim := GetDim(src);
  9115. destDim := srcDim - prefixIndices - suffixIndices;
  9116. (*
  9117. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9118. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9119. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9120. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9121. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9122. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9123. *)
  9124. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  9125. dest := SYSTEM.VAL(ADDRESS,destPtr);
  9126. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9127. PutAdr(dest,GetAdr(src));
  9128. PutPtr(dest,GetPtr(src));
  9129. PutFlags(dest,GetFlags(src));
  9130. PutSize(dest,GetSize(src));
  9131. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9132. srcDim := i + prefixIndices + prefixRanges;
  9133. destDim := i + prefixRanges;
  9134. len := GetLen(src,srcDim);
  9135. incr := GetIncr(src,srcDim);
  9136. PutLen(dest,destDim,len);
  9137. PutInc(dest,destDim,incr);
  9138. END;
  9139. (*
  9140. Report("copy descriptor src",src);
  9141. Report("copy descriptor dest",dest);
  9142. *)
  9143. END;
  9144. END CopyDescriptor;
  9145. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9146. VAR dest: ARRAY [?] OF basetype
  9147. CONST src: ARRAY [?] OF basetype
  9148. CONST shape: ARRAY [*] OF LONGINT
  9149. *)
  9150. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  9151. BEGIN
  9152. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  9153. RETURN RESULT
  9154. END Reshape;
  9155. (* OLIVIER *)
  9156. (** creates a degenerated range from an integer.
  9157. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9158. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9159. **)
  9160. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9161. BEGIN RETURN (integer .. integer BY 1)
  9162. END RangeFromInteger;
  9163. (* OLIVIER *)
  9164. (** create an array with the same data but with more dimensions
  9165. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9166. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9167. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9168. e.g.:
  9169. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9170. performs the following type transformation:
  9171. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9172. **)
  9173. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9174. VAR
  9175. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9176. sourceADDRESS, targetADDRESS: ADDRESS;
  9177. targetArrayDescriptor: ANY;
  9178. BEGIN
  9179. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9180. targetDimensionality := LEN(keptDimensions, 0);
  9181. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9182. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9183. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9184. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9185. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9186. PutFlags(targetADDRESS, {TensorFlag});
  9187. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9188. (* set increments and lengths *)
  9189. sourceIndex := 0;
  9190. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9191. IF keptDimensions[targetIndex] THEN
  9192. (* reuse length and increment from source array *)
  9193. ASSERT(sourceIndex < DIM(sourceArray));
  9194. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9195. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9196. INC(sourceIndex)
  9197. ELSE
  9198. (* set length = 1 and increment = 0 *)
  9199. PutLen(targetADDRESS, targetIndex, 1);
  9200. PutInc(targetADDRESS, targetIndex, 0);
  9201. END
  9202. END;
  9203. (* Report("expand dimensions: ", targetADDRESS); *)
  9204. RETURN RESULT
  9205. END ExpandDimensions;
  9206. (* index ranges *)
  9207. (* the length of a range, i.e. the number of indices that it stands for *)
  9208. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9209. VAR
  9210. temp, result: SIZE;
  9211. BEGIN
  9212. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9213. (* invalid range *)
  9214. result := 0
  9215. ELSIF LAST(range) = MAX(LONGINT) THEN
  9216. (* open-ended range *)
  9217. result := MAX(LONGINT)
  9218. ELSE
  9219. temp := 1 + LAST(range) - FIRST(range);
  9220. result := temp DIV STEP(range);
  9221. IF (temp MOD STEP(range)) # 0 THEN
  9222. INC(result)
  9223. END
  9224. END;
  9225. RETURN result
  9226. END "LEN";
  9227. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  9228. BEGIN
  9229. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  9230. RETURN RESULT;
  9231. END "ALL";
  9232. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  9233. BEGIN
  9234. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  9235. RETURN RESULT;
  9236. END "ALL";
  9237. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  9238. BEGIN
  9239. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  9240. RETURN RESULT;
  9241. END "ALL";
  9242. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  9243. BEGIN
  9244. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  9245. RETURN RESULT;
  9246. END "ALL";
  9247. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  9248. BEGIN
  9249. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  9250. RETURN RESULT;
  9251. END "ALL";
  9252. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  9253. BEGIN
  9254. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  9255. RETURN RESULT;
  9256. END "ALL";
  9257. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  9258. BEGIN
  9259. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  9260. RETURN RESULT;
  9261. END "ALL";
  9262. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9263. BEGIN
  9264. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9265. RETURN RESULT;
  9266. END "ALL";
  9267. BEGIN
  9268. alloc := 0; NEW(temporary);
  9269. PutFlags(temporary,{TensorFlag});
  9270. PutDim(temporary, 0);
  9271. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9272. END FoxArrayBase.
  9273. Compiler.Compile FoxArrayBase.Mod ~
  9274. SystemTools.ListModules